The 3D Point Cloud Registration Algorithm Based on Harris-DLFS
Bibliographic record
Abstract
Three-dimensional model reconstruction is a pivotal technology in the realm of computer vision. Point cloud registration serves as its integral step, which decisively impacts the efficiency and precision of the entire reconstruction process. However, existing point cloud registration algorithms often face issues. These include prolonged processing time, inadequate accuracy, and poor robustness. To address these problems, this paper proposes a novel point cloud registration algorithm based on corner detection (Harris) and partition-based local feature statistics (DLFS). The main steps are as follows: Firstly, the Harris corner detection algorithm is employed. This step is crucial for extracting key points and enhancing the efficiency of the registration process. Secondly, the DLFS method is used to describe the features of each key point, generating feature vectors. Subsequently, matching point pairs are filtered based on rigid distance constraints, and an coarse registration is performed using the Random Sample Consensus (RANSAC) algorithm. Finally, the Iterative Closest Point (ICP) algorithm is applied for fine registration. Experimental results demonstrated the effectiveness of this method. It significantly improved registration accuracy, robustness, and computational efficiency. Therefore, it holds substantial value for practical point cloud registration applications.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.003 | 0.003 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".