z-logo
open-access-imgOpen Access
Multi-scale Hierarchical Segmentation
Author(s) -
Lewis D. Griffin,
Glynn P. Robinson,
A. C. F. Colchester
Publication year - 1993
Publication title -
citeseer x (the pennsylvania state university)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.5244/c.7.29
Subject(s) - a priori and a posteriori , segmentation , representation (politics) , scale invariance , computer science , scale (ratio) , invariant (physics) , scheme (mathematics) , artificial intelligence , process (computing) , algorithm , image segmentation , pattern recognition (psychology) , theoretical computer science , mathematics , geography , statistics , cartography , mathematical analysis , philosophy , epistemology , politics , political science , law , mathematical physics , operating system
In the absence of a priori information on scales of interest vision systems should initially process in a scale invariant manner. The fact that any signal can only be sampled discretely further constrains the initial processing. The paper argues that a representation satisfying these requirements is an hierarchical segmentation of scalespace. An algorithm is presented to compute such representations. The algorithm has been designed so that its operation is scale invariant in the following sense: the addition of finer scale information only ever adds to the computed representation and never changes what was discoverable from coarser scales. It is noted that such a scheme has benefits even when the scales of interest are known.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom