Alignment of 3D Shape Data by Hashing Sets of Feature Points
نویسندگان
چکیده
This paper presents a method to automatically align a pose of 3D shape data to fit another shape data taken from different viewpoints. One of the difficult issues is to handle shape data which have surface information in different sides due to the difference in viewpoints, and to deal with objects in different scale. We detect local feature points on the two shape data, make potentially corresponding pairs of three feature points, calculate transformation parameters to align the three points, and get optimal alignment parameters by the voting of parameters obtained from the pairs of three points. We used hash table to avoid combinatorial explosion in making the pairs, and used geometric invariants for its key which are calculated from the positions of the points to keep the scale invariance. The method was evaluated with some public data and a set of laser-scanned data, and proved to be effective in alignment of shape data in different angles or scales.
منابع مشابه
Invariant features for automatic coarse registration of point-based surfaces
Automatic coarse alignment, or registration, of partially overlapping three dimensional (3D) shapes is a fundamental problem of the shape acquisition and modelling pipeline. This paper describes a new approach to automatic coarse pair-wise registration of partially overlapping 3D point sets which are commonly generated by laser scanners, structured light systems or stereo. The approach is based...
متن کاملImage authentication using LBP-based perceptual image hashing
Feature extraction is a main step in all perceptual image hashing schemes in which robust features will led to better results in perceptual robustness. Simplicity, discriminative power, computational efficiency and robustness to illumination changes are counted as distinguished properties of Local Binary Pattern features. In this paper, we investigate the use of local binary patterns for percep...
متن کاملDirectional Voting with Geometric Hashing for Three Dimensional Object Recognition
2-24-16, Naka-cho, Koganei Tokyo 184, JAPAN the combinations of triplets of basis points from the set of ABSTRACT feature points and then the HT can include normalized A new method for recognition of three dimensional information of feature distribution on the image plane. In objects by use of a monocular image is proposed. It the recognition phase, a set of feature points from the utilizes sam...
متن کاملCTSS: A Robust and Efficient Method for Protein Structure Alignment Based on Local Geometrical and Biological Feature
We present a new method for conducting protein structure similarity searches, which improves on the accuracy, robustness, and efficiency of some existing techniques. Our method is grounded in the theory of differential geometry on 3D space curve matching. We generate shape signatures for proteins that are invariant, localized, robust, compact, and biologically meaningful. To improve matching ac...
متن کاملEfficient Similarity Indexing and Searching in High Dimensions
Efficient indexing and searching of high dimensional data has been an area of active research due to the growing exploitation of high dimensional data and the vulnerability of traditional search methods to the " curse of dimensionality ". This paper presents a new approach for fast and effective searching and indexing of high dimensional features using random partitions of the feature space. Ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011