Robust and efficient detection of convex groups
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 770-771
- https://doi.org/10.1109/cvpr.1993.341167
Abstract
An algorithm is presented that finds all convex sets of line segments in an image, such that the length of the line segments account for at least some fixed proportion of the length of the convex hull. This enables the algorithm to find convex groups whose contours are partially occluded or missing due to noise. An expected time analysis of the algorithm's performance is performed, together with experiments on real images that show that the algorithm is efficient and that tell when the groups found are unlikely to occur at random, and are likely to capture the underlying structure of a scene.Keywords
This publication has 7 references indexed in Scilit:
- Generic object recognition: building and matching coarse descriptions from line drawingsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- Finding convex edge groupings in an imageInternational Journal of Computer Vision, 1992
- Grouping for RecognitionPublished by Defense Technical Information Center (DTIC) ,1989
- Two-Dimensional, Model-Based, Boundary Matching Using FootprintsThe International Journal of Robotics Research, 1986
- Human image understanding: Recent research and a theoryComputer Vision, Graphics, and Image Processing, 1985
- Perceptual Organization and Visual RecognitionPublished by Springer Nature ,1985
- Symbolic reasoning among 3-D models and 2-D imagesArtificial Intelligence, 1981