The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Shape Representation and Classification Using the Poisson Equation
Abstract
We present a novel approach that allows us to reliably compute many useful properties of a silhouette. Our approach assigns, for every internal point of the silhouette, a value reflecting the mean time required for a random walk beginning at the point to hit the boundaries. This function can be computed by solving Poisson's equation, with the silhouette contours providing boundary conditions. We show how this function can be used to reliably extract various shape properties including part structure and rough skeleton, local orientation and aspect ratio of different parts, and convex and concave sections of the boundaries. In addition to this, we discuss properties of the solution and show how to efficiently compute this solution using multigrid algorithms. We demonstrate the utility of the extracted properties by using them for shape classification and retrieval.
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
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
Stochastic completion fields: A neural model of illusory contour shape and salience.
Williams, L. R., & Jacobs, D. W. (1997) · Neural Computation · doi:10.1162/neco.1997.9.4.837 · Cited by 331
Cited by
Cellpose: a generalist algorithm for cellular segmentation
Stringer, C., Wang, T., Michaelos, M., & Pachitariu, M. (2021) · Nature Methods · doi:10.1038/s41592-020-01018-x · Cited by 4,369
Random Walks for Image Segmentation
Grady, L. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.233 · Cited by 2,624
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
Self-citationGorelick, 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
Self-citationShape 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
The wave kernel signature: A quantum mechanical approach to shape analysis
Aubry, M., Schlickewei, U., & Cremers, D. (2011) · 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops) · doi:10.1109/iccvw.2011.6130444 · Cited by 731
Event Detection in Crowded Videos
Ke, Y., Sukthankar, R., & Hebert, M. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4409011 · Cited by 374
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
Random Walks: A Review of Algorithms and Applications
Xia, F., Liu, J., Nie, H., Fu, Y., Wan, L., & Kong, X. (2020) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2019.2952908 · Cited by 295
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
Geometrical Structure of Laplacian Eigenfunctions
Grebenkov, D. S., & Nguyen, B.-T. (2013) · SIAM Review · doi:10.1137/120880173 · Cited by 264
Metadata
- Authors
- Gorelick, L., Galun, M., Sharon, E., Basri, R., & Brandt, A.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2006-12
- Volume
- 28
- Issue
- 12
- Pages
- 1991-2005
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2120544738
- Cited by
- 235
- References
- 2
- FWCI
- 19.30
- 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.