Journal Article10.1109/tmech.2021.3119435
Multi-View Point Clouds Registration Method Based on Overlap-Area Features and Local Distance Constraints for the Optical Measurement of Blade Profiles
TL;DR: Wang et al. as discussed by the authors proposed a fine registration algorithm to realize accurate measurement of blade profiles, which mainly comprises two novel constraint mechanisms: overlap-area features and local distance constraints, which are constructed and integrated based on the Hadamard Product of matrices.
read more
Abstract: The accurate and efficient measurement of blade profiles plays an important role in blade processing and quality monitoring. Currently, increasing attention is being paid to the optical measurement method for blade profiles due to its easy accessibility, high efficiency, and flexibility. However, as a key issue of blade profile measurement, the registration of multiview measured data still relies on the geometric accuracy and motion stability of the measurement system. Besides, multiple factors, including the various density and insufficient overlaps of multiview point cloud data, make the registration a challenging problem. To overcome these problems and realize accurate measurement of blade profiles, a fine registration algorithm is proposed in this article, which mainly comprises two novel constraint mechanisms: overlap-area features and local distance constraints. Two constraint matrices based on the features and distance information are constructed and integrated based on the Hadamard Product of matrices. In this way, the underlying corresponding mapping between multiview point clouds can be effectively recovered and the registration accuracy can be improved. The results of measurement experiment on three typical blades demonstrate the accuracy and feasibility of the proposed method.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
Distinctive Image Features from Scale-Invariant Keypoints
TL;DR: This paper presents a method for extracting distinctive invariant features from images that can be used to perform reliable matching between different views of an object or scene and can robustly identify objects among clutter and occlusion while achieving near real-time performance.
A method for registration of 3-D shapes
Paul J. Besl,H.D. McKay +1 more
TL;DR: In this paper, the authors describe a general-purpose representation-independent method for the accurate and computationally efficient registration of 3D shapes including free-form curves and surfaces, based on the iterative closest point (ICP) algorithm, which requires only a procedure to find the closest point on a geometric entity to a given point.
20.6K
Fast Point Feature Histograms (FPFH) for 3D registration
Radu Bogdan Rusu,Nico Blodow,Michael Beetz +2 more
- 12 May 2009
TL;DR: This paper modifications their mathematical expressions and performs a rigorous analysis on their robustness and complexity for the problem of 3D registration for overlapping point cloud views, and proposes an algorithm for the online computation of FPFH features for realtime applications.
4.1K
Point Set Registration: Coherent Point Drift
Andriy Myronenko,Xubo Song +1 more
TL;DR: A probabilistic method, called the Coherent Point Drift (CPD) algorithm, is introduced for both rigid and nonrigid point set registration and a fast algorithm is introduced that reduces the method computation complexity to linear.
Go-ICP: A Globally Optimal Solution to 3D ICP Point-Set Registration
TL;DR: This paper presents the first globally optimal algorithm, named Go-ICP, for Euclidean (rigid) registration of two 3D point-sets under the inline-formula notation, and derives novel upper and lower bounds for the registration error function.