Evidence map›Paper›PMID 41305219›Full record

ArticleSensors (Basel, Switzerland)2025

Enhancing Point Cloud Registration for Pipe Fittings: A Coarse-to-Fine Approach with DANIP Keypoint Detection and ICP Optimization.

Zeyuan Liu, Xiaofeng Yue

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Zeyuan LiuSchool of Mechatronic Engineering, Changchun University of Technology, Changchun 130012, China.
Xiaofeng YueSchool of Mechatronic Engineering, Changchun University of Technology, Changchun 130012, China.

Funding

Jilin Provincial Scientific and Technological Development Program 20240302033GX
6 · The paper itself

Abstract

In 3D reconstruction, loss of depth data caused by highly reflective surfaces often undermines the accuracy of point cloud registration. Traditional registration methods suffer from reduced accuracy and computational efficiency under such conditions. This paper presents a novel coarse-to-fine point cloud registration approach that combines a density-aware keypoint detection method with iterative closest point optimization to enhance both precision and computational performance. The proposed keypoint detection method optimizes registration by progressively refining the initial pose estimate through multi-scale geometric feature detection. This process includes a density-aware mechanism for removing edge outliers and an adaptive threshold based on normal vector inner products. This improves both keypoint identification accuracy and matching efficiency, providing better initial registration for the iterative closest point algorithm in scenarios with significant data loss. The approach prevents the iterative closest point algorithm from converging to local optima, which improves both convergence speed and overall computational performance. Experimental results show that, under optimal conditions, the runtime is reduced by up to 78.01% across several datasets, including those from Stanford, Kinect, Queen, and ASL-LRD. Compared to other traditional methods, the proposed approach delivers higher registration accuracy, even for multi-view point clouds with severe data loss, which demonstrates its robustness and potential for engineering applications.

Indexed as

iterative closest pointkeypoint detectionpipe fittingspoint cloud registration

Identifiers

PMID41305219
PMCPMC12655940

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.