Adaptive non-cartesian networks for vision

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We address the problem of locating and extracting frame curves on interesting image areas. Reference frames, focus of attention, bounding contours of shapes, axis of inertia, centers of masses and other mid-level visual structures, can be used to guide other mid-level visual tasks or to lead subsequent high level processing like recognition, indexing or image retrieval. Frame curves, are useful to tackle non-rigid object recognition problems because these have fuzzy boundaries. Where is the boundary of a cloud, oak leave or a leopard? we present a perceptual organization approach based on dynamic programming and adaptive non-cartesian networks, a new kind of networks which are based on placing processor lines using a distribution function adapted to the image array. We present a novel computational framework to extract frame curves directly on the image and several experiments on real images.

Cite

CITATION STYLE

APA

Serra, R., & Subirana, B. (1997). Adaptive non-cartesian networks for vision. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1311, pp. 324–331). Springer Verlag. https://doi.org/10.1007/3-540-63508-4_139

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free