Correspondence-Free Non-Rigid Point Set Registration Using Unsupervised Clustering Analysis

Research article (2024 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2024) · cited 29× · AI/ML

academia openalex:W4402753726

Press Enter · cited answer in seconds

Correspondence-Free Non-Rigid Point Set Registration Using Unsupervised Clustering Analysis

Summary

Correspondence-Free Non-Rigid Point Set Registration Using Unsupervised Clustering Analysis is a scholarly article^[1].

Key Facts

Correspondence-Free Non-Rigid Point Set Registration Using Unsupervised Clustering Analysis's instance of is recorded as scholarly article^[2].

⭐ Popularity Graph

0/100 long tail

Quick Facts

Instance of scholarly article

🔗 Connections

Authored by 5

Dong‐Ming Yan, Gaofeng Meng, Jingen Jiang, Mingyang Zhao, Shiqing Xin

← Author of 5

Dong‐Ming Yan, Gaofeng Meng, Jingen Jiang, Mingyang Zhao, Shiqing Xin

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

[2] ↑ Correspondence-Free Non-Rigid Point Set Registration Using Unsupervised Clustering Analysis — instance of (P31): scholarly article. wikidata.org.

Class ancestry

[1] ↑ Correspondence-Free Non-Rigid Point Set Registration Using Unsupervised Clustering Analysis is an instance of scholarly article (scholarly article) [P31, primary]. Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA

4ort.xyz Knowledge Graph. (2026). Correspondence-Free Non-Rigid Point Set Registration Using Unsupervised Clustering Analysis. Retrieved May 24, 2026, from https://4ort.xyz/entity/correspondence-free-non-rigid-point-set-registration-using-unsupervised-clustering-analysis

MLA

“Correspondence-Free Non-Rigid Point Set Registration Using Unsupervised Clustering Analysis.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/correspondence-free-non-rigid-point-set-registration-using-unsupervised-clustering-analysis.

BibTeX

@misc{4ortxyz_correspondence-free-non-rigid-point-set-registration-using-unsupervised-clustering-analysis_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Correspondence-Free Non-Rigid Point Set Registration Using Unsupervised Clustering Analysis}}, year = {2026}, url = {https://4ort.xyz/entity/correspondence-free-non-rigid-point-set-registration-using-unsupervised-clustering-analysis}, note = {Accessed: 2026-05-24}}

LLM prompt

According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Correspondence-Free Non-Rigid Point Set Registration Using Unsupervised Clustering Analysis — https://4ort.xyz/entity/correspondence-free-non-rigid-point-set-registration-using-unsupervised-clustering-analysis (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/correspondence-free-non-rigid-point-set-registration-using-unsupervised-clustering-analysis · Last refreshed: May 24, 2026