The DOI matches its Crossref record; 49 of the 49 references it cites were found in a registry or an index.
Shock Graphs and Shape Matching
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
Osher, S., & Sethian, J. A. (1988) · Journal of Computational Physics · doi:10.1016/0021-9991(88)90002-2 · Cited by 14,062
Turk, M., & Pentland, A. (1991) · Journal of Cognitive Neuroscience · doi:10.1162/jocn.1991.3.1.71 · Cited by 13,733
Image analysis and mathematical morphology
(1982) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(82)90078-8 · Cited by 8,151
Basic objects in natural categories
Rosch, E., Mervis, C. B., Gray, W. D., Johnson, D. M., & Boyes-Braem, P. (1976) · Cognitive Psychology · doi:10.1016/0010-0285(76)90013-x · Cited by 5,643
Shape modeling with front propagation: a level set approach
Malladi, R., Sethian, J. A., & Vemuri, B. C. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.368173 · Cited by 3,158
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
Hopcroft, J. E., & Karp, R. M. (1973) · SIAM Journal on Computing · doi:10.1137/0202019 · Cited by 2,802
Image Selective Smoothing and Edge Detection by Nonlinear Diffusion. II
Alvarez, L., Lions, P.-L., & Morel, J.-M. (1992) · SIAM Journal on Numerical Analysis · doi:10.1137/0729052 · Cited by 2,208
Visual learning and recognition of 3-d objects from appearance
Murase, H., & Nayar, S. K. (1995) · International Journal of Computer Vision · doi:10.1007/bf01421486 · Cited by 1,881
Biological shape and visual science (part I)
Blum, H. (1973) · Journal of Theoretical Biology · doi:10.1016/0022-5193(73)90175-6 · Cited by 1,159
Cited by
Topology matching for fully automatic similarity estimation of 3D shapes
Hilaga, M., Shinagawa, Y., Kohmura, T., & Kunii, T. L. (2001) · Proceedings of the 28th annual conference on Computer graphics and interactive techniques · doi:10.1145/383259.383282 · Cited by 2,187
Blank, M., Gorelick, L., Shechtman, E., Irani, M., & Basri, R. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.28 · Cited by 1,733
Osada, R., Funkhouser, T., Chazelle, B., & Dobkin, D. (2002) · ACM Transactions on Graphics · doi:10.1145/571647.571648 · Cited by 1,661
Gorelick, L., Blank, M., Shechtman, E., Irani, M., & Basri, R. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.70711 · Cited by 1,430
Shape Classification Using the Inner-Distance
Ling, H., & Jacobs, D. W. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.41 · Cited by 1,069
Funkhouser, T., Min, P., Kazhdan, M., Chen, J., Halderman, A., Dobkin, D., & Jacobs, D. (2003) · ACM Transactions on Graphics · doi:10.1145/588272.588279 · Cited by 935
Shape descriptors for non-rigid shapes with a single closed contour
Latecki, L. J., Lakamper, R., & Eckhardt, T. (2002) · Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662) · doi:10.1109/cvpr.2000.855850 · Cited by 833
Recognition of shapes by editing their shock graphs
Sebastian, T. B., Klein, P. N., & Kimia, B. B. (2004) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2004.1273924 · Cited by 727
Matching 3D models with shape distributions
Osada, R., Funkhouser, T., Chazelle, B., & Dobkin, D. (2002) · Proceedings International Conference on Shape Modeling and Applications · doi:10.1109/sma.2001.923386 · Cited by 591
Skeleton based shape matching and retrieval
Sundar, H., Silver, D., Gagvani, N., & Dickinson, S. (2003) · 2003 Shape Modeling International. · doi:10.1109/smi.2003.1199609 · Cited by 560
Self-citationTopology preserving level set method for geometric deformable models
Han, X., Xu, C., & Prince, J. L. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1201824 · Cited by 492
Shape similarity measure based on correspondence of visual parts
Latecki, L. J., & Lakamper, R. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.879802 · Cited by 461
Skeleton Pruning by Contour Partitioning with Discrete Curve Evolution
Bai, X., Latecki, L., & Liu, W.-Y. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.59 · Cited by 425
A Stochastic Grammar of Images
Zhu, S.-C., & Mumford, D. (2006) · now publishers, Inc. eBooks · doi:10.1561/9781601980618 · Cited by 395
Matching hierarchical structures using association graphs
Pelillo, M., Siddiqi, K., & Zucker, S. W. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.809105 · Cited by 394
Self-citation50 Years of object recognition: Directions forward
Andreopoulos, A., & Tsotsos, J. K. (2013) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2013.04.005 · Cited by 347
“More recent work has expanded the scope of graph based algorithms using shock graphs [181], [210], [211], [212], [213], [214], [215].”
BackgroundPath Similarity Skeleton Graph Matching
Bai, X., & Latecki, L. J. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.70769 · Cited by 343
3D zernike descriptors for content based shape retrieval
Novotni, M., & Klein, R. (2003) · Proceedings of the eighth ACM symposium on Solid modeling and applications · doi:10.1145/781606.781639 · Cited by 302
Recognition of Shapes by Editing Shock Graphs
Sebastian, T., Klein, P. N., Kimia, B. B., & Ri, P. (2001) · doi:10.1109/iccv.2001.10050 · Cited by 285
Learning Context-Sensitive Shape Similarity by Graph Transduction
Bai, X., Yang, X., Latecki, L. J., Liu, W., & Tu, Z. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.85 · Cited by 280
3D Skeletons: A State‐of‐the‐Art Report
Tagliasacchi, A., Delame, T., Spagnuolo, M., Amenta, N., & Telea, A. (2016) · Computer Graphics Forum · doi:10.1111/cgf.12865 · Cited by 264
Retrieving articulated 3-D models using medial surfaces
Siddiqi, K., Zhang, J., Macrini, D., Shokoufandeh, A., Bouix, S., & Dickinson, S. (2008) · Machine Vision and Applications · doi:10.1007/s00138-007-0097-8 · Cited by 256
Self-citationRossi, L., Torsello, A., & Hancock, E. R. (2015) · Physical Review E · doi:10.1103/physreve.91.022815 · Cited by 46
“Measuring graph similarity through continuous-time quantum walks and the quantum Jensen-Shannon divergence Luca Rossi,1 Andrea Torsello,2 and Edwin R. Hancock3 1School of Computer Science, University of Birmingham, United Kingdom 2Dipartimento di Scienze Ambientali, Informatica e Statistica, Università Ca’ Foscari Ve…”
BackgroundRigNet: Neural Rigging for Articulated Characters
Xu, Z., Zhou, Y., Kalogerakis, E., Landreth, C., & Singh, K. (2020) · arXiv · doi:10.48550/arxiv.2005.00559 · Cited by 13
“2018], to piecewise linear structures [Hilaga et al. 2001; Katz and Tal 2003; Siddiqi et al. 1999; Zhu and Yuille 1996].”
Background
Metadata
- Authors
- Siddiqi, K., Shokoufandeh, A., Dickinson, S. J., & Zucker, S. W.
- Venue
- International Journal of Computer Vision
- Published
- 1999-11
- Volume
- 35
- Issue
- 1
- Pages
- 13-32
- ISSN
- 0920-5691 (ISSN-L)
- 1573-1405
- OpenAlex
- W2150559991
- Cited by
- 756
- References
- 49
- FWCI
- 35.08
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.