Multi-image region growing for integrating disparity maps

Date

1999-01-01

Author

Leloglu, UĞUR MURAT
Halıcı, Uğur

Metadata

Show full item record

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

Item Usage Stats

197
views

0
downloads

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. Planar approximation is done in object space by linear least square estimation using all data points of the region under question in all images. Linear edge segments detected on colour images are used for constraining the region growing during the region aggregation phase as well as for detection of borders of surface patches. Experimental results on disparity maps obtained from high-resolution aerial images of urban areas demonstrate the performance of the algorithm.

Subject Keywords

SURFACE SEGMENTATION, STEREO

URI

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

Journal

COMPUTER ANALYSIS OF IMAGES AND PATTERNS

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Image segmentation with unified region and boundary characteristics within recursive shortest spanning tree Esen, E.; Alp, Y. K. (2007-06-13) 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 cha...
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...
QUALITY EVALUATION OF STEREOSCOPIC VIDEOS USING DEPTH MAP SEGMENTATION Sarikan, Selim S.; Olgun, Ramazan F.; Akar, Gözde (2011-09-09) This paper presents a new quality evaluation model for stereoscopic videos using depth map segmentation. This study includes both objective and subjective evaluation. The goal of this study is to understand the effect of different depth levels on the overall 3D quality. Test sequences with different coding schemes are used. The results show that overall quality has a strong correlation with the quality of the background, where disparity is smaller relative to the foreground. The results also showed that con...
Low-Level Hierarchical Multiscale Segmentation Statistics of Natural Images Akbaş, Emre (2014-09-01) This paper is aimed at obtaining the statistics as a probabilistic model pertaining to the geometric, topological and photometric structure of natural images. The image structure is represented by its segmentation graph derived from the low-level hierarchical multiscale image segmentation. We first estimate the statistics of a number of segmentation graph properties from a large number of images. Our estimates confirm some findings reported in the past work, as well as provide some new ones. We then obtain ...
Extraction of 3D transform and scale invariant patches from range scans Akagunduz, Erdern; Ulusoy, İlkay (2007-06-22) An algorithm is proposed to extract transformation and scale invariant 3D fundamental elements from the surface structure of 3D range scan data. The surface is described by mean and Gaussian curvature values at every data point at various scales and a scale-space search is performed in order to extract the fundamental structures and to estimate the location and the scale of each fundamental structure. The extracted fundamental structures can later be used as nodes in a topological graph where the links betw...

Citation Formats

U. M. Leloglu and U. Halıcı, “Multi-image region growing for integrating disparity maps,” COMPUTER ANALYSIS OF IMAGES AND PATTERNS, pp. 403–410, 1999, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/53413.