It is common when analyzing experimental data to encounter matrices that have been contaminated by noise and have missing elements. Missing data can be recovered with imputation methods if the measurement data matrix ...
详细信息
ISBN:
(纸本)9780769528250
It is common when analyzing experimental data to encounter matrices that have been contaminated by noise and have missing elements. Missing data can be recovered with imputation methods if the measurement data matrix is of low rank and the data is noise-free. However, iterative imputation can produce poor results for cases of large not. se or a large proportion of missing data. Non-imputing methods rely on the use of existent data and require a selection of complete submatrices. Jacobs introduced a non-imputing method which can produce good results, but the randomness in selecting the submatrices cannot guarantee a consistently accurate recovery of missing data. Chen and Suter's method chooses the most reliable submatrix based on the number of missing data elements only, which fails to consider the effect of noise on the selecteddata. Herein, a new criterion based on an estimate of the sensitivity of submatrices to perturbation is introduced which takes into consideration that in some cases a column with more missing data could provide more useful information than one with less missing data. Experimental results for the problem of Structure from Motion with noisy point correspondences and missing data show that our criterion can sort submatrices properly in terms of their possible perturbation and recover the 3d structure of the scene more accurately than other non-imputing methods.
The traditional ICP algorithm is a de facto standard approach for range image registration. While it assumes that one data set is a subset of another this assumption is often violated in practice. As a result, a numbe...
详细信息
ISBN:
(纸本)9780769528250
The traditional ICP algorithm is a de facto standard approach for range image registration. While it assumes that one data set is a subset of another this assumption is often violated in practice. As a result, a number of algorithms have been developed to first eliminate false matches due to occlusion, appearance anddisappearance of points and then estimate the camera motion parameters in the least squares sense. Instead of eliminating outliers in the process of image registration, we in this paper use the generalised entropy to estimate the probability of correspondences established using the traditional closest point criterion, leading camera motion parameters to be estimated in the weighted least squares sense. For more accurate registration results, we also learn from the probability of correspondences estimated in the past. Since one point in one data set can only correspond to a single point in another the two way constraint is also imposed. Finally the camera motion parameters are optimized using the powerful mean field annealing scheme. A comparative study based on real images has shown that the proposed algorithm produces promising automatic range image registration results.
Building footprints have been shown to be extremely useful in urban planning, infrastructure development, and roof modeling. Current methods for creating these footprints are often highly manual and rely largely on ar...
详细信息
ISBN:
(纸本)9780769528250
Building footprints have been shown to be extremely useful in urban planning, infrastructure development, and roof modeling. Current methods for creating these footprints are often highly manual and rely largely on architectural blueprints or skilled modelers. In this work we will use aerial LIdAR data to generate building footprints automatically. Existing automatic methods have been mostly unsuccessful due to large amounts of noise around building edges. We present a novel Bayesian technique for automatically constructing building footprints from a pre-classified LIdAR point cloud. Our algorithm first computes a bounded-error approximate building footprint using an application of the shortest path algorithm. We then determine the most probable building footprint by maximizing the posterior probability using linear optimization and simulated annealing techniques. We have applied our algorithm to more than 300 buildings in our data set and observe that we obtain accurate building footprints compared to the ground truth. Our algorithm is automatic and can be applied to other man-made shapes such as roads and telecommunication lines with minor modifications.
The following topics were dealt with: urban modeling; 3d navigation; geometric modelling; visual hulls; 3d coding and transmission; 3d retrieval; multiple view reconstruction; and large scale models and view planning.
The following topics were dealt with: urban modeling; 3d navigation; geometric modelling; visual hulls; 3d coding and transmission; 3d retrieval; multiple view reconstruction; and large scale models and view planning.
Copyright and Reprint Permissions: Abstracting is permitted with credit to the source. Libraries may photocopy beyond the limits of US copyright law, for private use of patrons, those articles in this volume that carr...
Copyright and Reprint Permissions: Abstracting is permitted with credit to the source. Libraries may photocopy beyond the limits of US copyright law, for private use of patrons, those articles in this volume that carry a code at the bottom of the first page, provided that the per-copy fee indicated in the code is paid through the Copyright Clearance Center. The papers in this book comprise the proceedings of the meeting mentioned on the cover and title page. They reflect the authors' opinions and, in the interests of timely dissemination, are published as presented and without change. Their inclusion in this publication does not necessarily constitute endorsement by the editors or the Institute of Electrical and Electronics Engineers, Inc.
New data sources and sensors bring new possibilities for terrain representations, and new types of characteristic errors. We develop a system to visualize and compare terrain representations and the errors they produce.
New data sources and sensors bring new possibilities for terrain representations, and new types of characteristic errors. We develop a system to visualize and compare terrain representations and the errors they produce.
Recent efforts attempt to combine together information of different passive methods. Critical issues in this research are the choice of data and how to combine such data in order to increase the overall information. T...
详细信息
Recent efforts attempt to combine together information of different passive methods. Critical issues in this research are the choice of data and how to combine such data in order to increase the overall information. The combination of stereo matching and silhouette information has recently received considerable attention both for obtaining high quality 3d models and for modelling 3ddynamic scenes. In this paper we present a 3d shape recovery system which fuse together silhouette, texture and shadow information. More precisely, we formulate the fusion problem of these three types of information. Experimental verification shows that the new method is capable to reconstruct a wider range of objects.
Previous works have shown that the ear is a good candidate for a human biometric. However, in prior work, the pre-processing of ear images has been a manual process. Also, prior algorithms were sensitive to noise in t...
详细信息
Previous works have shown that the ear is a good candidate for a human biometric. However, in prior work, the pre-processing of ear images has been a manual process. Also, prior algorithms were sensitive to noise in the data, especially that caused by hair and earrings. We present a novel solution to the automated cropping of the ear and implement it in an end-to-end solution for biometric recognition. We demonstrate our automatic recognition process with the largest study to date in ear biometrics, 415 subjects, achieving a rank one recognition rate of 97.6%. This work represents a breakthrough in ear biometrics and paves the way for commercial quality, fully automatic systems.
This paper addresses the problem of remote browsing of 3d scenes. Texture and geometry information are both available at server side in the form of scalably compressed images anddepth maps. We propose a framework for...
详细信息
This paper addresses the problem of remote browsing of 3d scenes. Texture and geometry information are both available at server side in the form of scalably compressed images anddepth maps. We propose a framework for the dynamic allocation of the available transmission resources between geometry and texture. Both the transmission of new images and the improvement of the already transmitted ones are taken into account. We also introduce a novel strategy for distortion-sensitive synthesis of both geometry and rendered imagery at client side.
The point containment predicate which specifies if a point is part of a mathematically defined shape is one of the most elementary operations in computer graphics and is a natural way to perform the many raster calcul...
详细信息
The point containment predicate which specifies if a point is part of a mathematically defined shape is one of the most elementary operations in computer graphics and is a natural way to perform the many raster calculations. It plays an essential role in several important processes such as filling, stroking, anti-aliasing, geometric modeling and volume rendering. This paper presents a generalized point containment algorithm for arbitrary dimension discrete objects whose main characteristics are low complexity, simple data structures and suitability for hardware implementation.
暂无评论