Information permeability for stereo matching

Cigla, Cevahir
Alatan, Abdullah Aydın
A novel local stereo matching algorithm is introduced to address the fundamental challenge of stereo algorithms, accuracy and computational complexity dilemma. The time consuming intensity dependent aggregation procedure of local methods is improved in terms of both speed and precision. Providing connected 2D support regions, the proposed approach exploits a new paradigm, namely separable successive weighted summation (SWS) among horizontal and vertical directions enabling constant operational complexity. The weights are determined by four-neighborhood intensity similarity of pixels and utilized to model the information transfer rate, permeability, towards the corresponding direction. The same procedure is also utilized to diffuse information through overlapped pixels during occlusion handling after detecting unreliable disparity assignments. Successive weighted summation adaptively cumulates the support data based on local characteristics, enabling disparity maps to preserve object boundaries and depth discontinuities. According to the experimental results on Middlebury stereo benchmark, the proposed method is one of the most effective local stereo algorithm providing high quality disparity models by unifying constant time filtering and weighted aggregation. Hence, the proposed algorithm provides a competitive alternative for various local methods in terms of achieving precise and consistent disparity maps from stereo video within fast execution time. Crown Copyright (c) 2013 Published by Elsevier B.V. All rights reserved.


Low-level multiscale image segmentation and a benchmark for its evaluation
Akbaş, Emre (Elsevier BV, 2020-10-01)
In this paper, we present a segmentation algorithm to detect low-level structure present in images. The algorithm is designed to partition a given image into regions, corresponding to image structures, regardless of their shapes, sizes, and levels of interior homogeneity. We model a region as a connected set of pixels that is surrounded by ramp edge discontinuities where the magnitude of these discontinuities is large compared to the variation inside the region. Each region is associated with a scale that d...
Nested local symmetry set
Tarı, Zehra Sibel (Elsevier BV, 2000-08-01)
A local-symmetry-based representation for shapes in arbitrary dimensions and a method for its computation are presented. The method depends on analyzing the Hessian of a specific boundaryness function, v, which is computed as the minimizer of an energy functional. The method is basically a generalized ridge finding scheme in which the ridges are defined in terms of the orbit of the gradient vector del v under the action of the Hessian of v. Once the ridges are determined, the local extrema of the magnitude ...
Continuous dimensionality characterization of image structures
Felsberg, Michael; Kalkan, Sinan; Kruger, Norbert (Elsevier BV, 2009-05-04)
Intrinsic dimensionality is a concept introduced by statistics and later used in image processing to measure the dimensionality of a data set. In this paper, we introduce a continuous representation of the intrinsic dimension of an image patch in terms of its local spectrum or, equivalently, its gradient field. By making use of a cone structure and barycentric co-ordinates, we can associate three confidences to the three different ideal cases of intrinsic dimensions corresponding to homogeneous image patche...
Multiple description coding of animated meshes
Bici, M. Oguz; Akar, Gözde (Elsevier BV, 2010-11-01)
In this paper, we propose three novel multiple description coding (MDC) methods for reliable transmission of compressed animated meshes represented by series of 3D static meshes with same connectivity. The proposed methods trade off reconstruction quality for error resilience to provide the best expected reconstruction of 3D mesh sequence at the decoder side. The methods are based on layer duplication and partitioning of the set of vertices of a scalable coded animated mesh by either spatial or temporal sub...
State-space identification of switching linear discrete time-periodic systems with known scheduling signals
Uyanik, Ismail; Hamzacebi, Hasan; Ankaralı, Mustafa Mert (The Scientific and Technological Research Council of Turkey, 2019-01-01)
In this paper, we propose a novel frequency domain state-space identification method for switching linear discrete time-periodic (LDTP) systems with known scheduling signals. The state-space identification problem of linear time-invariant (LTI) systems has been widely studied both in the time and frequency domains. Indeed, there have been several studies that also concentrated on state-space identification of both continuous and discrete linear time-periodic (LTP) systems. The focus in this study is the fam...
Citation Formats
C. Cigla and A. A. Alatan, “Information permeability for stereo matching,” SIGNAL PROCESSING-IMAGE COMMUNICATION, pp. 1072–1088, 2013, Accessed: 00, 2020. [Online]. Available: