We present a flexible interactive 3D morpho-kinematical modeling application for astrophysics. Compared to other systems, our application reduces the restrictions on the physical assumptions, data type, and amount that is required for a reconstruction of an object's morphology. It is one of the first publicly available tools to apply interactive graphics to astrophysical modeling. The tool allows astrophysicists to provide a priori knowledge about the object by interactively defining 3D structural elements. By direct comparison of model prediction with observational data, model parameters can then be automatically optimized to fit the observation. The tool has already been successfully used in a number of astrophysical research projects.
The above-mentioned shortcomings of fully automatic reconstruction approaches may be avoided by resorting to interactive modeling techniques. The interactive creation of a model aiming to reproduce a given single image is a common task, but most existing solutions are not well suited for the modeling of emissive transparent objects that are prevalent in astronomy and do not allow for representation of velocity information and spectral data. Among the tools that most closely reflect our modeling approach are the interactive approaches of @cite_34 , Fran c ois and Medioni @cite_22 and @cite_12 , all of which expect some kind of user-specified coarse geometry or a set of user-defined geometry constraints which is then automatically converted into a full three-dimensional model that best fits the provided image under the given constraints. The idea of automatic optimization of a parameterized (deformable or morphable'') model has been successfully employed in the works of Montagnat and Delingette @cite_27 and Romdhani and Vetter @cite_18 .
@cite_18 @cite_22 @cite_27 @cite_34 @cite_12
2016663152 2055686029 2006227471 2073581653
In this article, we consider the problem of animation reconstruction, that is, the reconstruction of shape and motion of a deformable object from dynamic 3D scanner data, without using user-provided template models. Unlike previous work that addressed this problem, we do not rely on locally convergent optimization but present a system that can handle fast motion, temporally disrupted input, and can correctly match objects that disappear for extended time periods in acquisition holes due to occlusion. Our approach is motivated by cartography: We first estimate a few landmark correspondences, which are extended to a dense matching and then used to reconstruct geometry and motion. We propose a number of algorithmic building blocks: a scheme for tracking landmarks in temporally coherent and incoherent data, an algorithm for robust estimation of dense correspondences under topological noise, and the integration of local matching techniques to refine the result. We describe and evaluate the individual components and propose a complete animation reconstruction pipeline based on these ideas. We evaluate our method on a number of standard benchmark datasets and show that we can obtain correct reconstructions in situations where other techniques fail completely or require additional user guidance such as a template model. We propose a probabilistic formulation of joint silhouette extraction and 3D reconstruction given a series of calibrated 2D images. Instead of segmenting each image separately in order to construct a 3D surface consistent with the estimated silhouettes, we compute the most probable 3D shape that gives rise to the observed color information. The probabilistic framework, based on Bayesian inference, enables robust 3D reconstruction by optimally taking into account the contribution of all views. We solve the arising maximum a posteriori shape inference in a globally optimal manner by convex relaxation techniques in a spatially continuous representation. For an interactively provided user input in the form of scribbles specifying foreground and background regions, we build corresponding color distributions as multivariate Gaussians and find a volume occupancy that best fits to this data in a variational sense. Compared to classical methods for silhouette-based multiview reconstruction, the proposed approach does not depend on initialization and enjoys significant resilience to violations of the model assumptions due to background clutter, specular reflections, and camera sensor perturbations. In experiments on several real-world data sets, we show that exploiting a silhouette coherency criterion in a multiview setting allows for dramatic improvements of silhouette quality over independent 2D segmentations without any significant increase of computational efforts. This results in more accurate visual hull estimation, needed by a multitude of image-based modeling approaches. We made use of recent advances in parallel computing with a GPU implementation of the proposed method generating reconstructions on volume grids of more than 20 million voxels in up to 4.41 seconds. In this article, we introduce a new global optimization method to the field of multiview 3D reconstruction. While global minimization has been proposed in a discrete formulation in form of the maxflow-mincut framework, we suggest the use of a continuous convex relaxation scheme. Specifically, we propose to cast the problem of 3D shape reconstruction as one of minimizing a spatially continuous convex functional. In qualitative and quantitative evaluation we demonstrate several advantages of the proposed continuous formulation over the discrete graph cut solution. Firstly, geometric properties such as weighted boundary length and surface area are represented in a numerically consistent manner: The continuous convex relaxation assures that the algorithm does not suffer from metrication errors in the sense that the reconstruction converges to the continuous solution as the spatial resolution is increased. Moreover, memory requirements are reduced, allowing for globally optimal reconstructions at higher resolutions. We study three different energy models for multiview reconstruction, which are based on a common variational template unifying regional volumetric terms and on-surface photoconsistency. The three models use data measurements at increasing levels of sophistication. While the first two approaches are based on a classical silhouette-based volume subdivision, the third one relies on stereo information to define regional costs. Furthermore, this scheme is exploited to compute a precise photoconsistency measure as opposed to the classical estimation. All three models are compared on standard data sets demonstrating their advantages and shortcomings. For the third one, which gives the most accurate results, a more exhaustive qualitative and quantitative evaluation is presented. Abstract Frequently, terrestrial LiDAR and image data are used to extract high resolution building geometry like windows, doors and protrusions for three-dimensional (3D) facade reconstruction. However, such a purely data driven bottom-up modelling of facade structures is only feasible if the available observations meet considerable requirements on data quality. Errors in measurement, varying point densities, reduced accuracies, as well as incomplete coverage affect the achievable correctness and reliability of the reconstruction result. While dependence on data quality is a general disadvantage with data driven bottom-up approaches, model based top-down reconstructions are much more robust. Algorithms introduce knowledge about the appearance and arrangement of objects. Thus, they cope with data uncertainty and allow for a procedural modelling of building structures in a predefined architectural style, which is inherent in grammar or model descriptions. We aim at a quality sensitive facade reconstruction which is on the one hand robust against erroneous and incomplete data, but on the other hand not subject to prespecified rules or models. For this purpose, we combine bottom-up and top-down strategies by integrating automatically inferred rules into a data driven reconstruction process. Facade models reconstructed during a bottom-up method serve as a knowledge base for further processing. Dominant or repetitive features and regularities as well as their hierarchical relationship are detected from the modelled facade elements and automatically translated into rules. These rules together with the 3D representations of the modelled facade elements constitute a formal grammar. It holds all the information which is necessary to reconstruct facades in the style of the given building. The paper demonstrates that the proposed algorithm is very flexible towards different data quality and incomplete sensor data. The inferred grammar is used for the verification of the facade model produced during the data driven reconstruction process and the generation of synthetic facades for which only partial or no sensor data is available. Moreover, knowledge propagation is not restricted to facades of one single building. Based on a small set of formal grammars derived from just a few observed buildings, facade reconstruction is also possible for whole districts featuring uniform architectural styles.