New algorithm for segmentation of images represented as hypergraph hexagonal-grid

Authors:
Dumitru Burdescu;Marius Brezovan;Eugen Ganea;Liana Stanescu
Affiliations:
University of Craiova, Craiova, Romania;University of Craiova, Craiova, Romania;University of Craiova, Craiova, Romania;University of Craiova, Craiova, Romania
Venue:
IbPRIA'11 Proceedings of the 5th Iberian conference on Pattern recognition and image analysis
Year:
2011

Citing 10
Cited 0

Robust and Efficient Detection of Salient Convex Groups

IEEE Transactions on Pattern Analysis and Machine Intelligence
Digital Image Processing

Digital Image Processing
Normalized Cuts and Image Segmentation

CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Robust analysis of feature spaces: color image segmentation

CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
Efficient Graph-Based Image Segmentation

International Journal of Computer Vision
Binary-Partition-Tree Creation using a Quasi-Inclusion Criterion

IV '04 Proceedings of the Information Visualisation, Eighth International Conference
Image Segmentation as Learning on Hypergraphs

ICMLA '08 Proceedings of the 2008 Seventh International Conference on Machine Learning and Applications
Weighted adaptive neighborhood hypergraph partitioning for image segmentation

ICAPR'05 Proceedings of the Third international conference on Pattern Recognition and Image Analysis - Volume Part II
Hypergraph-Based image representation

GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Region-based representations of image and video: segmentation tools for multimedia services

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new method for segmentation of images into regions and for boundary extraction that reflect objects present in the image scene. The unified framework for image processing uses a grid structure defined on the set of pixels from an image. We propose a segmentation algorithm based on hypergraph structure which produces a maximum spanning tree of a visual hypergraph constructed on the grid structure, and we consider the HCL (Hue-Chroma-Luminance) color space representation. Our technique has a time complexity lower than the methods from the specialized literature, and the experimental results on the Berkeley color image database show that the performance of the method is robust.