Grouping of Isolated Non-directional Cues with Straight Offset Polygons

Toshiro Kubota

2015

Abstract

When the boundary of a familiar object is shown by a series of isolated dots, humans can often recognize the object with ease. This ability can be sustained with addition of distracting dots around the object. However, such capability has not been reproduced algorithmically on computers. In this paper, we will introduce a new algorithm that groups a set of dots into multiple overlapping subsets. It first connects the dots into a spanning tree using the proximity cue. It then applies the straight polygon transformation to an initial polygon derived from the spanning tree. The straight polygon divides the space into polygons recursively and each polygon can be viewed as grouping of a subset of the dots. The number of polygons generated is O(n). We used both natural and synthetic images to test the performance of the algorithm. The results are encouraging.

References

  1. Ahuja, N. (1982). Dot pattern processing using voronoi neighborhoods. Pattern Analysis and Machine Intelligence, IEEE Transactions on, (3):336-343.
  2. Ahuja, N. and Tuceryan, M. (1989). Extraction of early perceptual structure in dot patterns: integrating region, boundary, and component gestalt. Computer Vision, Graphics, and Image Processing, 48(3):304-356.
  3. Aichholzer, O. and Aurenhammer, F. (1996). Computing and Combinatorics, volume 1090 of Lecture Notes in Computer Science, chapter Straight skeletons for general polygonal figures in the plane, pages 117-126. Springer.
  4. Aichholzer, O., Aurenhammer, F., Alberts, D., and Gartner, B. (1995). A novel type of skeleton for polygons. Journal of Universal Computer Science, 1(12):752- 761.
  5. Blum, H. (1967). A transformation for extracting new descriptors of shape. Models for the perception of speech and visual form, 19(5):362-380.
  6. Chaudhuri, A., Chaudhuri, B. B., and Parui, S. K. (1997). A novel approach to computation of the shape of a dot pattern and extraction of its perceptual border. Computer Vision and Image Understanding, 68(3):257- 275.
  7. Edelsbrunner, H., Kirkpatrick, D., and Seidel, R. (1983). On the shape of a set of points in the plane. Information Theory, IEEE Transactions on, 29(4):551-559.
  8. Elder, J. H. and Zucker, S. W. (1996). Computing contour closure. In Proc. 4th European Conference on Computer Vision, pages 399-412, Cambridge, UK.
  9. Engbers, E. A. and Smeulders, A. W. M. (2003). Design considerations for generic grouping in vision. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 25(4):445-457.
  10. Greene, E. (2008). Additional evidence that contour attributes are not essential cues for object recognition. Behavioral and Brain Functions, 4(1):26.
  11. Kubovy, M. and Wagemans, J. (1995). Grouping by proximity and multistability in dot lattices: A quantitative gestalt theory. Psychological Science, 6(4):225-234.
  12. Lee, D.-T. (1982). Medial axis transformation of a planar shape. Pattern Analysis and Machine Intelligence, IEEE Transactions on, (4):363-369.
  13. Mahamud, S., Williams, L., Thornber, K., and Xu, K. (2003). Segmentation of multiple salient closed contours from real images. IEEE Trans. on Pattern Analysis and Machine Intelligence, 25(4):433-444.
  14. Melkemi, M. and Djebali, M. (2000). Computing the shape of a planar points set. Pattern Recognition, 33(9):1423-1436.
  15. O'Rourke, J., Booth, H., and Washington, R. (1987). Connect-the-dots: a new heuristic. Computer Vision, Graphics, and Image Processing, 39(2):258-266.
  16. Rosenberg, B. and Langridge, D. (1973). A computational view of perception. Perception, 2(4):415.
  17. Toussaint, G. T. (1980). The relative neighbourhood graph of a finite planar set. Pattern recognition, 12(4):261- 268.
  18. Wang, S., Kubota, T., Siskind, J., and Wang, J. (2005). Salient closed boundary extraction with ratio contour. IEEE Trans. Pattern Analysis and Machine Intelligence, 27(4):546-561.
  19. Zahn, C. T. (1971). Graph-theoretical methods for detecting and describing gestalt clusters. Computers, IEEE Transactions on, 100(1):68-86.
Download


Paper Citation


in Harvard Style

Kubota T. (2015). Grouping of Isolated Non-directional Cues with Straight Offset Polygons . In Proceedings of the 10th International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2015) ISBN 978-989-758-089-5, pages 341-348. DOI: 10.5220/0005257003410348


in Bibtex Style

@conference{visapp15,
author={Toshiro Kubota},
title={Grouping of Isolated Non-directional Cues with Straight Offset Polygons},
booktitle={Proceedings of the 10th International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2015)},
year={2015},
pages={341-348},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005257003410348},
isbn={978-989-758-089-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 10th International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, (VISIGRAPP 2015)
TI - Grouping of Isolated Non-directional Cues with Straight Offset Polygons
SN - 978-989-758-089-5
AU - Kubota T.
PY - 2015
SP - 341
EP - 348
DO - 10.5220/0005257003410348