Robust point matching for nonrigid shapes by preserving local neighborhood structures

By Yefeng Zheng, David S. Doermann. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2006

313 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Factorized Graph Matching (2016, methodology): “The most closely related work to our method is the statistical approach [54], [55], where a”
Non-Rigid Point Set Registration by Preserving Global and Local Structures (2015, methodology): “Finally, we provide the implementation details.”
A tensor-based algorithm for high-order graph matching (2009, unknown): “The situation has changed in the past few years, with the advent of combinatorial or mixed continuouslcombinatorial optimization approaches to feature matching (see, for example [4, 19, 20, 28, 161).”