Image segmentation with unified region and boundary characteristics within recursive shortest spanning tree

Date

2007-06-13

Author

Esen, E.
Alp, Y. K.

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

326
views

0
downloads

The lack of boundary information in region based image segmentation algorithms resulted in many hybrid methods that integrate the complementary information sources of region and boundary, in order to increase the segmentation performance. In compliance with this trend, we propose a novel method to unify the region and boundary characteristics within the canonical Recursive Shortest Spanning Tree algorithm. The main idea is to incorporate the boundary information in the distance metric of RSST with minor changes in the algorithm. Additionaly, we still benefit from the simple yet powerful structure of RSST. The results indicate the superiority of the proposed algorithm with respect to the conventional RSST. The object boundaries are successfully preserved. Therefore, the proposed algorithm is a candidate for video object segmentation where object boundaries coincide with motion field boundaries.

Subject Keywords

Object segmentation, Image segmentation

URI

https://hdl.handle.net/11511/64655

DOI

https://doi.org/10.1109/siu.2007.4298597

Conference Name

IEEE 15th Signal Processing and Communications Applications Conference

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

REGION-BASED IMAGE SEGMENTATION VIA GRAPH CUTS Cigla, Cevahir; Alatan, Abdullah Aydın (2008-01-01) A graph theoretic color image segmentation algorithm is proposed, in which the popular normalized cuts image segmentation method is improved with modifications on its graph structure. The image is represented by a weighted undirected graph, whose nodes correspond to over-segmented regions, instead of pixels, that decreases the complexity of the overall algorithm. In addition, the link weights between the nodes are calculated through the intensity similarities of the neighboring regions. The irregular distri...
Multi-image region growing for integrating disparity maps Leloglu, UĞUR MURAT; Halıcı, Uğur (1999-01-01) In this paper, a multi-image region growing algorithm to obtain planar 3-D surfaces in the object space from multiple dense disparity maps, is presented. A surface patch is represented by a plane equation and a set of pixels in multiple images. The union of back projections of all pixels in the set onto the infinite plane, forms the surface patch. Thanks to that hybrid representation of planar surfaces, region growing (both region aggregation and region merging) is performed on all images simultaneously. Pl...
Image Annotation With Semi-Supervised Clustering Sayar, Ahmet; Yarman Vural, Fatoş Tunay (2009-09-16) Methods developed for image annotation usually make use of region clustering algorithms. Visual codebooks are generated from the region clusters of low level features. These codebooks are then, matched with the words of the text document related to the image, in various ways. In this paper, we supervise the clustering process by using three types of side information. The first one is the topic probability information obtained from the text document associated with the image. The second is the orientation an...
Object Segmentation in Multi-view Video via Color, Depth and Motion Cues Cigla, Cevahir; Alatan, Abdullah Aydın (2009-01-01) In the light of dense depth map estimation, motion estimation and object segmentation, the research on multi-view video (MVV) content has becoming increasingly popular due to its wide application areas in the near future. In this work, object segmentation problem is studied by additional cues due to depth and motion fields. Segmentation is achieved by modeling images as graphical models and performing popular Normalized Cuts method with some modifications. In the graphical models, each node is represented b...
Recursive shortest spanning tree algorithms for image segmentation Bayramoglu, NY; Bazlamaçcı, Cüneyt Fehmi (2005-11-24) Image segmentation has an important role in image processing and the speed of the segmentation algorithm may become a drawback for some applications. This study analyzes the run time performances of some variations of the Recursive Shortest Spanning Tree Algorithm (RSST) and proposes simple but effective modifications on these algorithms to improve their speeds. In addition, the effect of link weight cost function on the run time performance and the segmentation quality is examined. For further improvement ...

Citation Formats

E. Esen and Y. K. Alp, “Image segmentation with unified region and boundary characteristics within recursive shortest spanning tree,” Eskişehir, TURKEY, 2007, p. 523, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/64655.