The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Robust and efficient detection of salient convex groups
Abstract
This paper describes an algorithm that robustly locates salient convex collections of line segments in an image. The algorithm is guaranteed to find all convex sets of line segments in which the length of the gaps between segments is smaller than some fixed proportion of the total length of the lines. This enables the algorithm to find convex groups whose contours are partially occluded or missing due to noise. We give an expected case analysis of the algorithm performance. This demonstrates that salient convexity is unlikely to occur at random, and hence is a strong clue that grouped line segments reflect underlying structure in the scene. We also show that our algorithm run time is O(n/sup 2/log(n)+nm), when we wish to find the m most salient groups in an image with n line segments. We support this analysis with experiments on real data, and demonstrate the grouping system as part of a complete recognition system.
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
A Computational Approach to Edge Detection
Canny, J. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767851 · Cited by 30,004
Cited by
Wagemans, J., Elder, J. H., Kubovy, M., Palmer, S. E., Peterson, M. A., Singh, M., & von der Heydt, R. (2012) · Psychological Bulletin · doi:10.1037/a0029333 · Cited by 1,539
Contour and Texture Analysis for Image Segmentation
Malik, J., Belongie, S., Leung, T., & Shi, J. (2001) · International Journal of Computer Vision · doi:10.1023/a:1011174803800 · Cited by 1,089
Groups of Adjacent Contour Segments for Object Detection
Ferrari, V., Fevrier, L., Jurie, F., & Schmid, C. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1144 · Cited by 563
The Oxford Handbook of Perceptual Organization
(2015) · Oxford University Press eBooks · doi:10.1093/oxfordhb/9780199686858.001.0001 · Cited by 463
Edge and line oriented contour detection: State of the art
Papari, G., & Petkov, N. (2011) · Image and Vision Computing · doi:10.1016/j.imavis.2010.08.009 · Cited by 357
Metadata
- Authors
- Jacobs, D. W.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1996
- Volume
- 18
- Issue
- 1
- Pages
- 23-37
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2108299137
- Cited by
- 199
- References
- 1
- FWCI
- 16.64
- 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.