Subgraph matching using compactness prior for robust feature correspondence

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

academia openalex:W1917573513

Press Enter · cited answer in seconds

Subgraph matching using compactness prior for robust feature correspondence

Summary

Subgraph matching using compactness prior for robust feature correspondence is a scholarly article^[1].

Key Facts

Subgraph matching using compactness prior for robust feature correspondence's instance of is recorded as scholarly article^[2].

⭐ Popularity Graph

0/100 long tail

📊 Google Search Volume

no search data yet

Quick Facts

Instance of scholarly article

🔗 Connections

Authored by 2

Kyoung Mu Lee, Yumin Suh

← Author of 2

Kyoung Mu Lee, Yumin Suh

References

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

Direct Wikidata claims

[2] ↑ Subgraph matching using compactness prior for robust feature correspondence — instance of (P31): scholarly article. wikidata.org.

Class ancestry

[1] ↑ Subgraph matching using compactness prior for robust feature correspondence 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). Subgraph matching using compactness prior for robust feature correspondence. Retrieved May 24, 2026, from https://4ort.xyz/entity/subgraph-matching-using-compactness-prior-for-robust-feature-correspondence

MLA

“Subgraph matching using compactness prior for robust feature correspondence.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/subgraph-matching-using-compactness-prior-for-robust-feature-correspondence.

BibTeX

@misc{4ortxyz_subgraph-matching-using-compactness-prior-for-robust-feature-correspondence_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Subgraph matching using compactness prior for robust feature correspondence}}, year = {2026}, url = {https://4ort.xyz/entity/subgraph-matching-using-compactness-prior-for-robust-feature-correspondence}, note = {Accessed: 2026-05-24}}

LLM prompt

According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Subgraph matching using compactness prior for robust feature correspondence — https://4ort.xyz/entity/subgraph-matching-using-compactness-prior-for-robust-feature-correspondence (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/subgraph-matching-using-compactness-prior-for-robust-feature-correspondence · Last refreshed: May 24, 2026