The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Path Similarity Skeleton Graph Matching
Abstract
This paper presents a novel framework to for shape recognition based on object silhouettes. The main idea is to match skeleton graphs by comparing the shortest paths between skeleton endpoints. In contrast to typical tree or graph matching methods, we completely ignore the topological graph structure. Our approach is motivated by the fact that visually similar skeleton graphs may have completely different topological structures. The proposed comparison of shortest paths between endpoints of skeleton graphs yields correct matching results in such cases. The skeletons are pruned by contour partitioning with Discrete Curve Evolution, which implies that the endpoints of skeleton branches correspond to visual parts of the objects. The experimental results demonstrate that our method is able to produce correct results in the presence of articulations, stretching, and occlusion.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Dynamic Programming Algorithm Optimization for Spoken Word Recognition
Sakoe, H., & Chiba, S. (1978) · IEEE Transactions on Acoustics Speech and Signal Processing · doi:10.1109/tassp.1978.1163055 · Cited by 6,727
Shape matching and object recognition using shape contexts
Belongie, S., Malik, J., & Puzicha, J. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.993558 · Cited by 6,306
Comparing images using the Hausdorff distance
Huttenlocher, D. P., Klanderman, G. A., & Rucklidge, W. J. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.232073 · Cited by 4,545
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
Discovering similar multidimensional trajectories
Vlachos, M., Kollios, G., & Gunopulos, D. (2003) · Proceedings 18th International Conference on Data Engineering · doi:10.1109/icde.2002.994784 · Cited by 1,468
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
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
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
Self-citationShock Graphs and Shape Matching
Siddiqi, K., Shokoufandeh, A., Dickinson, S. J., & Zucker, S. W. (1999) · International Journal of Computer Vision · doi:10.1023/a:1008102926703 · Cited by 756
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
Kimia, B. B., Tannenbaum, A. R., & Zucker, S. W. (1995) · International Journal of Computer Vision · doi:10.1007/bf01451741 · Cited by 543
Aligning gene expression time series with time warping algorithms
Aach, J., & Church, G. M. (2001) · Bioinformatics · doi:10.1093/bioinformatics/17.6.495 · Cited by 496
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
Self-citationSkeleton 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
Self-citationOgniewicz, R. L., & Kübler, O. (1995) · Pattern Recognition · doi:10.1016/0031-3203(94)00105-u · Cited by 401
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
Sebastian, T. B., Klein, P. N., & Kimia, B. B. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1159951 · Cited by 374
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
FORMS: A flexible object recognition and modelling system
Zhu, S., & Yuille, A. (1996) · International Journal of Computer Vision · doi:10.1007/bf00208719 · Cited by 277
Iterative Deepening Dynamic Time Warping for Time Series
Chu, S., Keogh, E., Hart, D., & Pazzani, M. (2002) · Proceedings of the 2002 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972726.12 · Cited by 268
Parts of visual form: computational aspects
Kaleem Siddiqi, A., & Kimia, B. B. (1995) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.368189 · Cited by 243
3D object recognition using shape similiarity-based aspect graph
Cyr, C. M., & Kimia, B. B. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937526 · Cited by 218
Determining the similarity of deformable shapes
Basri, R., Costa, L., Geiger, D., & Jacobs, D. (1998) · Vision Research · doi:10.1016/s0042-6989(98)00043-1 · Cited by 217
Shape Matching and Recognition – Using Generative Models and Informative Features
Tu, Z., & Yuille, A. L. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24672-5_16 · Cited by 195
Object Recognition as Many-to-Many Feature Matching
Demirci, M. F., Shokoufandeh, A., Keselman, Y., Bretzner, L., & Dickinson, S. (2006) · International Journal of Computer Vision · doi:10.1007/s11263-006-6993-y · Cited by 146
Recognition of shapes by editing shock graphs
(2001) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2001.937602 · Cited by 145
Indexing hierarchical structures using graph spectra
Shokoufandeh, A., Macrini, D., Dickinson, S., Kaleem Siddiqi, A., & Zucker, S. W. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.142 · Cited by 140
Shock graphs and shape matching
Kaleem Siddiqi, A., Shokoufandeh, A., Dickenson, S. J., & Zucker, S. W. (2002) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.1998.710722 · Cited by 134
3-D object recognition using bipartite matching embedded in discrete relaxation
Kim, W.-Y., & Kak, A. C. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.75511 · Cited by 117
Recognition of shapes by attributed skeletal graphs
Ruberto, C. D. (2003) · Pattern Recognition · doi:10.1016/j.patcog.2003.07.004 · Cited by 98
Curves vs. skeletons in object recognition
Sebastian, T. B., & Kimia, B. B. (2004) · Signal Processing · doi:10.1016/j.sigpro.2004.10.016 · Cited by 93
Computing approximate tree edit distance using relaxation labeling
Torsello, A., & Hancock, E. R. (2003) · Pattern Recognition Letters · doi:10.1016/s0167-8655(02)00255-6 · Cited by 73
Ligature Instabilities in the Perceptual Organization of Shape
August, J., Kaleem Siddiqi, A., & Zucker, S. W. (1999) · Computer Vision and Image Understanding · doi:10.1006/cviu.1999.0802 · Cited by 67
A skeletal measure of 2D shape similarity
Andrea Torsello, A., & Hancock, E. R. (2004) · Computer Vision and Image Understanding · doi:10.1016/j.cviu.2004.03.006 · Cited by 62
Kaleem Siddiqi, A., Kimia, B. B., Tannenbaum, A., & Zucker, S. W. (1999) · Image and Vision Computing · doi:10.1016/s0262-8856(98)00130-9 · Cited by 52
Matching free trees, maximal cliques, and monotone game dynamics
Pelillo, M. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1046176 · Cited by 50
Cited by
Robust Part-Based Hand Gesture Recognition Using Kinect Sensor
Ren, Z., Yuan, J., Meng, J., & Zhang, Z. (2013) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2013.2246148 · Cited by 746
Robust Feature Matching for Remote Sensing Image Registration via Locally Linear Transforming
Ma, J., Zhou, H., Zhao, J., Gao, Y., Jiang, J., & Tian, J. (2015) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2015.2441954 · Cited by 474
A survey on skeletonization algorithms and their applications
Saha, P. K., Borgefors, G., & Sanniti di Baja, G. (2016) · Pattern Recognition Letters · doi:10.1016/j.patrec.2015.04.006 · Cited by 353
GRAPH MATCHING AND LEARNING IN PATTERN RECOGNITION IN THE LAST 10 YEARS
FOGGIA, P., PERCANNELLA, G., & VENTO, M. (2014) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001414500013 · Cited by 337
Superpixel-Based Hand Gesture Recognition With Kinect Depth Camera
Wang, C., Liu, Z., & Chan, S.-C. (2015) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2014.2374357 · Cited by 328
Metadata
- Authors
- Bai, X., & Latecki, L. J.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2008-07
- Volume
- 30
- Issue
- 7
- Pages
- 1282-1292
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2111569598
- Cited by
- 343
- References
- 36
- FWCI
- 37.23
- 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.