The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A Topological Approach to Hierarchical Segmentation using Mean Shift
Abstract
Mean shift is a popular method to segment images and videos. Pixels are represented by feature points, and the segmentation is driven by the point density in feature space. In this paper, we introduce the use of Morse theory to interpret mean shift as a topological decomposition of the feature space into density modes. This allows us to build on the watershed technique and design a new algorithm to compute mean-shift segmentations of images and videos. In addition, we introduce the use of topological persistence to create a segmentation hierarchy. We validated our method by clustering images using color cues. In this context, our technique runs faster than previous work, especially on videos and large images. We evaluated accuracy with a classical benchmark which shows results on par with existing low-level techniques, i.e. we do not sacrifice accuracy for speed.
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
Martin, D., Fowlkes, C., Tal, D., & Malik, J. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937655 · Cited by 8,216
Comaniciu, D., Ramesh, V., & Meer, P. (2003) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2003.1195991 · Cited by 4,560 · cited 1×
“It has been used in numerous applications such as noise removal [8], object tracking [11], 3D reconstruction [36], image and video stylization [1, 12, 35], and video editing [33].”
MethodTopological Persistence and Simplification
Edelsbrunner, Letscher, & Zomorodian (2002) · Discrete & Computational Geometry · doi:10.1007/s00454-002-2885-2 · Cited by 1,779
James, D. L., & Twigg, C. D. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073206 · Cited by 361
Cited by
Quick Shift and Kernel Methods for Mode Seeking
Vedaldi, A., & Soatto, S. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88693-8_52 · Cited by 890
Interactive image segmentation by maximal similarity based region merging
Ning, J., Zhang, L., Zhang, D., & Wu, C. (2010) · Pattern Recognition · doi:10.1016/j.patcog.2009.03.004 · Cited by 424
Pintilie, G. D., Zhang, J., Goddard, T. D., Chiu, W., & Gossard, D. C. (2010) · Journal of Structural Biology · doi:10.1016/j.jsb.2010.03.007 · Cited by 388
(2012) · Cited by 4
Metadata
- Authors
- Paris, S., & Durand, F.
- Venue
- 2007 IEEE Conference on Computer Vision and Pattern Recognition
- Publisher
- IEEE
- Published
- 2007-06
- Pages
- 1-8
- ISSN
- 1063-6919 (ISSN-L)
- OpenAlex
- W2151743452
- Cited by
- 162
- References
- 4
- FWCI
- 6.55
- Type
- conference paper
- 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.