Spectral Correspondence for Deformed Point-Set Matching

M. Carcassoni; Edwin R. Hancock

doi:10.1007/10722604_11

ScienceGate Book Chapters

BOOK-CHAPTER

Spectral Correspondence for Deformed Point-Set Matching

M. Carcassoni Edwin R. Hancock

Year: 2000 Lecture notes in computer science Pages: 120-132 Publisher: Springer Science+Business Media

DOI: 10.1007/10722604_11

Get Full-Text PDF Get Analytical Report

Keywords:

Point set registration Adjacency matrix Computer science Adjacency list Algorithm Point (geometry) Matching (statistics) Spectral graph theory Representation (politics) Artificial intelligence Set (abstract data type) Matrix (chemical analysis) Pattern recognition (psychology) Graph Mathematics Theoretical computer science Geometry

Metrics

Cited By

0.92

FWCI (Field Weighted Citation Impact)

Refs

0.73

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Remote Sensing and LiDAR Applications

Physical Sciences → Environmental Science → Environmental Engineering

Robotics and Sensor-Based Localization

Physical Sciences → Engineering → Aerospace Engineering

Advanced Vision and Imaging

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

Spectral Correspondence for Deformed Point-Set Matching

Metrics

Citation History

Topics

Related Documents

Spectral correspondence for point pattern matching

Point pattern matching with robust spectral correspondence

Versatile spectral methods for point set matching

Spectral Correspondence for Point Pattern Matching Combined with Analysis of Geometric Consistency

Fast Brain Matching with Spectral Correspondence