Variable Resolution & Dimensional Mapping For 3d Model Optimization

Three-dimensional computer models, especially geospatial architectural data sets, can be visualized in the same way humans experience the world, providing a realistic, interactive experience. Scene familiarization, architectural analysis, scientific visualization, and many other applications would benefit from finely detailed, high resolution, 3D models. Automated methods to construct these 3D models traditionally has produced data sets that are often low fidelity or inaccurate; otherwise, they are initially highly detailed, but are very labor and time intensive to construct. Such data sets are often not practical for common real-time usage and are not easily updated. This thesis proposes Variable Resolution & Dimensional Mapping (VRDM), a methodology that has been developed to address some of the limitations of existing approaches to model construction from images. Key components of VRDM are texture palettes, which enable variable and ultra-high resolution images to be easily composited; texture features, which allow image features to integrated as image or geometry, and have the ability to modify the geometric model structure to add detail. These components support a primary VRDM objective of facilitating model refinement with additional data. This can be done until the desired fidelity is achieved as practical limits of infinite detail are approached. Texture Levels, the third component, enable real-time interaction with a very detailed model, along with the flexibility of having alternate pixel data for a given area of the model and this is achieved through extra dimensions. Together these techniques have been used to construct models that can contain GBs of imagery data

Vision-assisted modeling for model-based video representations

Thesis (Ph. D.)--Massachusetts Institute of Technology, Program in Media Arts & Sciences, 1997.Includes bibliographical references (leaves 134-145).by Shawn C. Becker.Ph.D

Investigation And Development Of Flattening Algorithms For Curved Latent Fingerprint Images

Fingerprint had been used to identify a person due to its uniqueness and unchangeable throughout life. However, latent fingerprint acquisition normally being performed on uneven or noisy surface with poor contrast, causing fingerprint minutiae point extracted appear to be inaccurate and affect the result of fingerprint matching. Thus, latent fingerprint required image to be pre-process and enhance before latent search. In order to increase latent matching accuracy, geometry rectification is needed to correct distortion in fingerprint images due to uneven surfaces. This research will investigate and develop flattening algorithm that can be adapted to latent fingerprint images on cylindrical surface. The boundary of an image is required to detect the curvature of an image that need to be flattened. Boundary of interested area can be acquired using a predefined algorithm or define by user using interactive drawing. The flattening algorithm required mapping from cylindrical coordinate to image coordinate. Since curved image appears to be rectangular shape, parabolic approximation and ellipse approximation are being used to design algorithms for flattening. Experimental results prove that algorithm that applies ellipse equation to flatten fingerprint images able to increase the quality of the minutiae. However, measurement results for horizontal axes shows that the distortion in horizontal axis is not being well taken care of. In summary, both algorithms developed able to flatten curved latent fingerprint images with the assumption that image that needs to be flattened is vertical cylindrical shape and boundary of cylinder must be detectable. Algorithm that applies ellipse approximation provides better performance as compared with the algorithm that developed based on parabolic approximation

Multiple View Geometry For Video Analysis And Post-production

Multiple view geometry is the foundation of an important class of computer vision techniques for simultaneous recovery of camera motion and scene structure from a set of images. There are numerous important applications in this area. Examples include video post-production, scene reconstruction, registration, surveillance, tracking, and segmentation. In video post-production, which is the topic being addressed in this dissertation, computer analysis of the motion of the camera can replace the currently used manual methods for correctly aligning an artificially inserted object in a scene. However, existing single view methods typically require multiple vanishing points, and therefore would fail when only one vanishing point is available. In addition, current multiple view techniques, making use of either epipolar geometry or trifocal tensor, do not exploit fully the properties of constant or known camera motion. Finally, there does not exist a general solution to the problem of synchronization of N video sequences of distinct general scenes captured by cameras undergoing similar ego-motions, which is the necessary step for video post-production among different input videos. This dissertation proposes several advancements that overcome these limitations. These advancements are used to develop an efficient framework for video analysis and post-production in multiple cameras. In the first part of the dissertation, the novel inter-image constraints are introduced that are particularly useful for scenes where minimal information is available. This result extends the current state-of-the-art in single view geometry techniques to situations where only one vanishing point is available. The property of constant or known camera motion is also described in this dissertation for applications such as calibration of a network of cameras in video surveillance systems, and Euclidean reconstruction from turn-table image sequences in the presence of zoom and focus. We then propose a new framework for the estimation and alignment of camera motions, including both simple (panning, tracking and zooming) and complex (e.g. hand-held) camera motions. Accuracy of these results is demonstrated by applying our approach to video post-production applications such as video cut-and-paste and shadow synthesis. As realistic image-based rendering problems, these applications require extreme accuracy in the estimation of camera geometry, the position and the orientation of the light source, and the photometric properties of the resulting cast shadows. In each case, the theoretical results are fully supported and illustrated by both numerical simulations and thorough experimentation on real data

Simplicial Complex based Point Correspondence between Images warped onto Manifolds

Recent increase in the availability of warped images projected onto a manifold (e.g., omnidirectional spherical images), coupled with the success of higher-order assignment methods, has sparked an interest in the search for improved higher-order matching algorithms on warped images due to projection. Although currently, several existing methods "flatten" such 3D images to use planar graph / hypergraph matching methods, they still suffer from severe distortions and other undesired artifacts, which result in inaccurate matching. Alternatively, current planar methods cannot be trivially extended to effectively match points on images warped onto manifolds. Hence, matching on these warped images persists as a formidable challenge. In this paper, we pose the assignment problem as finding a bijective map between two graph induced simplicial complexes, which are higher-order analogues of graphs. We propose a constrained quadratic assignment problem (QAP) that matches each p-skeleton of the simplicial complexes, iterating from the highest to the lowest dimension. The accuracy and robustness of our approach are illustrated on both synthetic and real-world spherical / warped (projected) images with known ground-truth correspondences. We significantly outperform existing state-of-the-art spherical matching methods on a diverse set of datasets.Comment: Accepted at ECCV 202

Plenoptische Modellierung und Darstellung komplexer starrer Szenen

Image-Based Rendering is the task of generating novel views from existing images. In this thesis different new methods to solve this problem are presented. These methods are designed to fulfil special goals such as scalability and interactive rendering performance. First, the theory of the Plenoptic Function is introduced as the mathematical foundation of image formation. Then a new taxonomy is introduced to categorise existing methods and an extensive overview of known approaches is given. This is followed by a detailed analysis of the design goals and the requirements with regards to input data. It is concluded that for perspectively correct image generation from sparse spatial sampling geometry information about the scene is necessary. This leads to the design of three different Image-Based Rendering methods. The rendering results are analysed on different data sets. For this analysis, error metrics are defined to evaluate different aspects

Machine learning techniques for high dimensional data

This thesis presents data processing techniques for three different but related application areas: embedding learning for classification, fusion of low bit depth images and 3D reconstruction from 2D images. For embedding learning for classification, a novel manifold embedding method is proposed for the automated processing of large, varied data sets. The method is based on binary classification, where the embeddings are constructed so as to determine one or more unique features for each class individually from a given dataset. The proposed method is applied to examples of multiclass classification that are relevant for large scale data processing for surveillance (e.g. face recognition), where the aim is to augment decision making by reducing extremely large sets of data to a manageable level before displaying the selected subset of data to a human operator. In addition, an indicator for a weighted pairwise constraint is proposed to balance the contributions from different classes to the final optimisation, in order to better control the relative positions between the important data samples from either the same class (intraclass) or different classes (interclass). The effectiveness of the proposed method is evaluated through comparison with seven existing techniques for embedding learning, using four established databases of faces, consisting of various poses, lighting conditions and facial expressions, as well as two standard text datasets. The proposed method performs better than these existing techniques, especially for cases with small sets of training data samples. For fusion of low bit depth images, using low bit depth images instead of full images offers a number of advantages for aerial imaging with UAVs, where there is a limited transmission rate/bandwidth. For example, reducing the need for data transmission, removing superfluous details, and reducing computational loading of on-board platforms (especially for small or micro-scale UAVs). The main drawback of using low bit depth imagery is discarding image details of the scene. Fortunately, this can be reconstructed by fusing a sequence of related low bit depth images, which have been properly aligned. To reduce computational complexity and obtain a less distorted result, a similarity transformation is used to approximate the geometric alignment between two images of the same scene. The transformation is estimated using a phase correlation technique. It is shown that that the phase correlation method is capable of registering low bit depth images, without any modi�cation, or any pre and/or post-processing. For 3D reconstruction from 2D images, a method is proposed to deal with the dense reconstruction after a sparse reconstruction (i.e. a sparse 3D point cloud) has been created employing the structure from motion technique. Instead of generating a dense 3D point cloud, this proposed method forms a triangle by three points in the sparse point cloud, and then maps the corresponding components in the 2D images back to the point cloud. Compared to the existing methods that use a similar approach, this method reduces the computational cost. Instated of utilising every triangle in the 3D space to do the mapping from 2D to 3D, it uses a large triangle to replace a number of small triangles for flat and almost flat areas. Compared to the reconstruction result obtained by existing techniques that aim to generate a dense point cloud, the proposed method can achieve a better result while the computational cost is comparable

Documentation of a historical house with close range digital photogrammetry

Thesis (Master)--Izmir Institute of Technology, Architectural Restoration, Izmir, 2008Includes bibliographical references (leaves: 121-128)Text in English; Abstract: Turkish and Englishxii, 128 leavesThis study aims to document the original architectural characteristics, alterations and damages of a historical house by combining the digital photogrammetric techniques with the mapping concepts of architectural conservation so that an architectural conservation project can be guided. The proposed documentation is carried on the entrance façade of a 19th century house located in the urban conservation site of Alaçatı, ..zmir, Turkey. The Demiral House has conservation priority among the other listed houses because of its vacant state and damages.Analytic recording of the façades of the historical houses in Alaçatı can be made fast with the rectification option of close range monoscopic softwares. A calibrated digital camera and a total station are the other tools used in this process. The colored thematic maps prepared are accurate enough for 1/50 scale analysis and they possess the qualitative information on the photographs. After it is checked that the threedimensional measurements defining the general geometry overlap with the 1/50 scaled rectified image mosaic, the details concerning the deteriorations are decided to be drawn to the scaled elevation drawing from this mosaic.This study has proposed a contemporary documentation technique so that architect-conservators can easily adapt in their conservation projects. When compared to the frequently applied documentation techniques like hatching on scaled twodimensional elevation drawings, it takes shorter time to prepare the proposed mapping method on rectified image mosaic. The architect-restorer has also the chance to examine many constructional details on the scaled rectified image mosaic. The end results are more realistic. Keywords: Architectural conservation, Close range, Rectification, Mapping, Alaçatı