Segmentation Graph Hierarchies
@inproceedings{Haxhimusa2004SegmentationGH, title={Segmentation Graph Hierarchies}, author={Yll Haxhimusa and Walter G. Kropatsch}, booktitle={SSPR/SPR}, year={2004} }
The region’s internal properties (color, texture, ...) help to identify them and their external relations (adjacency, inclusion, ...) are used to build groups of regions having a particular consistent meaning in a more abstract context. Low-level cue image segmentation in a bottom-up way, cannot and should not produce a complete final “good” segmentation. We present a hierarchical partitioning of images using a pairwise similarity function on a graph-based representation of an image. The aim of…
69 Citations
A Hierarchical Image Segmentation Algorithm Based on an Observation Scale
- Computer ScienceSSPR/SPR
- 2012
This work proposes a hierarchical graph based image segmentation relying on a criterion popularized by Felzenszwalb and Huttenlocher, and quantitative and qualitative assessments of the method shows efficiency, ease of use and robustness of this method.
Topology-preserving perceptual segmentation using the Combinatorial Pyramid
- Computer Science
- 2010
This paper presents a bottom-up approach for perceptual segmentation of natural images which preserves the topology of the image and results reveal that the proposed perceptual grouping provides satisfactory scores.
Hierarchical Image Partitioning using Combinatorial Maps
- Computer Science
- 2005
A hierarchical partitioning of images using a pairwise similarity function on a combinatorial map based representation, based on local differences in a color space, to create a hierarchy of partitions with multiple resolutions suitable for further goal driven analysis.
A Graph-Based Hierarchical Image Segmentation Method Based on a Statistical Merging Predicate
- Computer Science, PhysicsICIAP
- 2013
This work proposes a hierarchical graph-based image segmentation relying on a statistical region merging and studies how the inclusion of hierarchical property have influenced the computation of quality measures in the original method.
Combining boundary and region features inside the combinatorial pyramid for topology-preserving perceptual image segmentation
- Computer SciencePattern Recognit. Lett.
- 2012
A New Perception-Based Segmentation Approach Using Combinatorial Pyramids
- Computer ScienceICIAP
- 2011
Although additional descriptors must be added to deal with textured surfaces, experimental results reveal that the proposed perceptual grouping provides satisfactory scores.
Evaluation of Colour Image Segmentation Hierarchies
- Computer Science, MathematicsThe 3rd Canadian Conference on Computer and Robot Vision (CRV'06)
- 2006
This paper employs the Earth Mover’s Distance (EMD) as a segmentation criterion in a hierarchical colour segmentation algorithm and develops a novel evaluation method which looks at the stability of segmentation hierarchies in stereo images.
Hierarchical image feature extraction by an irregular pyramid of polygonal partitions
- Computer Science
- 2008
An algorithmic framework for hierarchical image segmentation and feature extraction that incorporates the Gestalt principles of visual perception and exploits spectral and textural similarities of polygonal partitions, while iteratively grouping them until dissimilarity criteria are exceeded.
Segmentation of Similar Images Using Graph Matching and Community Detection
- Computer ScienceGbRPR
- 2011
A new method to segment sets of similar images using graphmatching and community detection algorithms, showing an important biological application on butterfly wings images and a case using images taken by a digital camera to demonstrate its effectiveness.
A Faster Graph-Based Segmentation Algorithm with Statistical Region Merge
- Computer ScienceISVC
- 2006
A modification of a bottom up graph theoretic image segmentation algorithm using Kruskal's algorithm to build minimum spanning trees for segmentation that reflect global properties of the image to improve its performance.
References
SHOWING 1-10 OF 49 REFERENCES
Hierarchy of Partitions with Dual Graph Contraction
- Computer ScienceDAGM-Symposium
- 2003
A hierarchical partitioning of images is presented using a pairwise similarity function on a graph-based representation of an image using a measure of differences of component’s internal differences to encapsulate the intuitive notion of contrast.
Hierarchical Image Partitioning with Dual Graph Contraction 1
- Computer Science
- 2003
A hierarchical partitioning of images is presented using a pairwise similarity function on a graph-based representation of an image using a measure of differences of the components’ internal differences to encapsulate the intuitive notion of contrast.
Normalized cuts and image segmentation
- Computer ScienceProceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition
- 1997
This work treats image segmentation as a graph partitioning problem and proposes a novel global criterion, the normalized cut, for segmenting the graph, which measures both the total dissimilarity between the different groups as well as the total similarity within the groups.
Self-Organization in Vision: Stochastic Clustering for Image Segmentation, Perceptual Grouping, and Image Database Organization
- Computer ScienceIEEE Trans. Pattern Anal. Mach. Intell.
- 2001
We present a stochastic clustering algorithm which uses pairwise similarity of elements and show how it can be used to address various problems in computer vision, including the low-level image…
Dominant sets and hierarchical clustering
- Computer ScienceProceedings Ninth IEEE International Conference on Computer Vision
- 2003
This work considers a family of (continuous) quadratic programs, which contain a parameterized regularization term that controls the global shape of the energy landscape, and suggests a new (divisive) hierarchical approach to clustering, based on the idea of properly varying the regularization parameter during the clustering process.
Image segmentation using local variation
- Computer ScienceProceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231)
- 1998
A new graph-theoretic approach to the problem of image segmentation that is able to preserve detail in low-variability regions while ignoring detail in high-Variability regions, which is illustrated with several examples on both real and synthetic images.
The hierarchy of the cocoons of a graph and its application to image segmentation
- Computer SciencePattern Recognit. Lett.
- 2003
Hierarchical Image Analysis Using Irregular Tessellations
- Computer ScienceIEEE Trans. Pattern Anal. Mach. Intell.
- 1991
A novel multiresolution image analysis technique based on hierarchies of irregular tessellations generated in parallel by independent stochastic processes is presented, which adapted to the image content and artifacts of rigid resolution reduction are avoided.
Segmentation with Pairwise Attraction and Repulsion
- Computer ScienceICCV
- 2001
A method of image segmentation by integrating pairwise attraction and directional repulsion derived from local grouping and figure-ground cues, which allows segmentation andfigure-ground segregation to be computed simultaneously.
Building irregular pyramids by dual-graph contraction
- Computer Science
- 1995
The author presents a theory that allows the building of different types of hierarchies on top of such image graphs based on the properties of a pair of dual-image graphs that the reduction process should preserve, e.g. the structure of a particular input graph.