Open Access
Unforced Image Partitioning by Weighted Pyramid Linking
Tsai-Hong Hong,Azriel Rosenfeld +1 more
Reads0
Chats0
TLDR
In this article, a pyramid of successively reduced-resolution versions of the image is used to define link strengths between pairs of pixels at successive levels of this pyramid, based on proximity and similarity, and iteratively recomputes the pixel values and adjusts the link strengths.Abstract:
: This paper describes a method of image segmentation that creates a partition of the image into compact, homogeneous regions using a parallel, iterative approach that does not require immediate forced choices. The approach makes use of a 'pyramid' of successively reduced-resolution versions of the image. It defines link strengths between pairs of pixels at successive levels of this pyramid, based on proximity and similarity, and iteratively recomputes the pixel values and adjusts the link strengths. After a few iterations, the link strengths stabilize, and the links that remain strong define a set of subtrees of the pyramid. Each such tree represents a compact (piece of a ) homogeneous region in the image; the leaves of the subtree are the pixels in the region, and the size of the region depends on how high the root of the tree lies in the pyramid. Thus the trees define a partition of the image into (pieces of) homogeneous regions.read more
Citations
More filters
Journal ArticleDOI
Entropy-Based Texture Analysis in the Spatial Frequency Domain
M. E. Jernigan,F. D'Astous +1 more
TL;DR: An approach which uses regional entropy measures in the spatial frequency domain for texture discrimination is presented, and performance of the entropy features as measured by a between-to-within-class scatter criterion is comparable to that of traditional frequency domain features and gray level co-occurrence contrast features.
Journal ArticleDOI
Extracting Compact Objects Using Linked Pyramids
Tsai-Hong Hong,M. Shneier +1 more
TL;DR: This correspondence describes a method of extracting compact regions from images using three multiresolution representations of image features using a gray-level pyramid, an edge pyramid and a ``surroundedness'' pyramid.
Journal ArticleDOI
An analysis of node linking in overlapped pyramids
J. M. Cibulskis,Charles R. Dyer +1 more
TL;DR: An image segmentation algorithm is described that uses an overlapped pyramid to represent an image at multiple levels of resolution to create a forest embedded within the pyramid.
Book ChapterDOI
Quadtrees and Pyramids: Hierarchical Representation of Images
TL;DR: This paper reviews methods of variable-resolution representation or approximation of digital images based on the use of trees of degree 4 (“quadtrees”) and discusses the multi- resolution representation of an image by an exponentially tapering “pyramid” of arrays.
Book ChapterDOI
Overlapping in compact pyramids
TL;DR: The effectiveness of pyramid architectures in some multiresolution algorithms is studied, especially when the match between architecture and data structure is only partial; such is the case when machines with fixed connections among neighboring processing elements are used to run algorithms which exploit overlapped pyramids with dynamic links among adjacent levels.