Junction-Based Correspondence Estimation of Plant Point Cloud Data Using Subgraph Matching
Bibliographic record
Abstract
Laser scanner-captured 3-D point cloud data analysis is becoming more commonly used for remote sensing and plant science applications. Because of nonrigidity and complexity, reconstructing a 3-D model of a plant is extremely challenging. Existing algorithms often fail to find correct correspondences for plantlike thin structures. We address the problem of finding 3-D junction points in plant point cloud data as a first step of this correspondence matching process. Temporarily, we transform the 3-D problem into 2-D by performing appropriate coordinate transformations to the neighborhood of each 3-D point. Our proposed method has two steps. First, a statistical dip test of multimodality is performed to detect the nonlinearity of the local 2D structure. Then, each branch is approximated by sequential random-sample-consensus line fitting and a Euclidean clustering technique. The straight line parameters of each branch are extracted using total-least-squares estimation. Finally, the straight line equations are solved to determine if they intersect in the local neighborhood. Such junction points are good candidates for subsequent correspondence algorithms. Using these detected junction points, we formulate a correspondence algorithm as a subgraph matching problem and show that, without using traditional descriptor similarity-based matching, good correspondences can be obtained by simply considering geodesic distances among graph nodes. Experiments on synthetic and real ( Arabidopsis plant) data show that the proposed method outperforms the state of the art.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.004 | 0.004 |
| 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.001 | 0.001 |
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".