Shape Similarity Measure Based on Correspondence of Visual Parts

By Longin Jan Latecki, Rolf Lakämper. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2000

529 citations recorded by the source corpus.

Subfields: Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/f4900c089f06ebd4d55c9a9255d6ea586bb95e54

How researchers see this paper

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

In Computer Vision and Pattern Recognition

Citations in the corpus

Analysis of planar shapes using geodesic paths on shape spaces (2004, background): “Therefore, similar to the ideas presentedin[17],weneedtopreprocess therawdatato obtain an appropriate representation of each shape.”
Partial Similarity of Objects, or How to Compare a Centaur to a Horse (2009, background): “…1995; Gudivada and Raghavan 1995; Chen and Wong 2003; Kim and Chung 2006), two-dimensional shapes (Bruckstein et al. 1992; Geiger et al. 1998, 2003; Latecki and Lakamper 2000; Cheng et al. 2001; Jacobs et al. 2000; Jacobs and Ling 2005; Felzenszwalb 2005; Bronstein et al. 2006e), three-dimensional…”
Image retrieval: Ideas, influences, and trends of the new age (2008, methodology): “Representation of shape using discrete curve evolution to simplify contours is discussed in [Latecki and Lakamper 2000].”
Learning Context-Sensitive Shape Similarity by Graph Transduction (2010, methodology): “(b) A comparison of retrieval rates between visual parts in [4] (blue cir cles) and the proposed method (red stars) for MPEG-7.”
Shape retrieval using triangle-area representation and dynamic space warping (2007, unknown): “Finally, Section 7 concludes the paper.”
Content-based image retrieval: approaches and trends of the new age (2005, unknown): “curve evolution to simplify contours, is discussed in [59].”
MeshCNN: a network with an edge (2019, background): “We also show that MeshCNN can handle a global high-level classification task on shapes with uniformly sized triangles.”
Integral Invariants for Shape Matching (2006, methodology): “Similar shortest-path concepts were exploited in the context of shape matching and warping in [65], [76], [30], [41], [84], [4], [85].”