The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper we present a novel method for automatic text-line parameter selection for stereo image pairs. The parameters are selected such that correspondence between the same content in a stereo pair is maximized. Automatic parameter selection has been carried out by establishing robust text-line correspondence which is also a contribution of the presented work. The proposed method is applied to...
In this paper, we propose a novel binary-based cost computation and aggregation approach for stereo matching problem. The cost volume is constructed through bitwise operations on a series of binary strings. Then this approach is combined with traditional winner-take-all strategy, resulting in a new local stereo matching algorithm called binary stereo matching (BSM). Since core algorithm of BSM is...
The idea of cost or similarity volume may date back to Marr and Poggio's cooperative algorithm. One of the challenging difficulties in applying their algorithm to recovering sub-pixel disparity is 1) how to take advantages of the edge location in the images for computing reliable cost between the corresponding sub-pixel coordinates. In addition, it should be noted that 2) accidental correspondences...
We propose a novel method on stereo matching based on the Global Edge Constraint (GEC) and Graph Cuts. Firstly, the GEC composed of particular image edges is employed to generate the initial disparity maps. And then the reliable disparity maps consistent with the observed data are extracted to construct the data term of the energy function. Finally, we incorporate the GEC as a soft constraint into...
In this paper we present a novel method for robust stereo matching on document image pairs. The matching itself is performed using an affine-invariant similarity measurement to compensate for perspective distortions, where affine invariance is achieved by normalization using second-order statistics, to finally allow a simple pixel-wise comparison. To handle the inherent high self-similarity of the...
This paper proposes a new cost construction method with multiscale Weber (MSW) descriptor and weighted linear regression for robust stereo matching in a two-layer hierarchical structure. Firstly, the MSW descriptors extracted from stereo pairs are utilized to combined raw matching costs to reduce the disparity search range. Secondly, the indispensable matching costs on the subsets of disparity candidates...
This paper presents a novel algorithm for estimating stereo disparity which exploits the benefit of learning to the fullest. Given a cost volume of stereo matching, we solve the cost aggregation and disparity computation in one shot by using a classifier; we design a feature called matching cost pattern for the input which we extract from the cost volume while we use simulated stereo patterns for...
This paper proposes a method for reconstructing accurate 3D surface points. To this end, robust and dense reconstruction with Shape-from-Silhouettes (SfS) and accurate multiview stereo are integrated. Unlike gradual shape shrinking and/or bruteforce large space search by existing space carving approaches, our method obtains 3D points by SfS and stereo independently, and then selects correct ones from...
This paper presents a new stereo-motion approach for 3D scene reconstruction in dense and accurate form, that allows the cameras to be described by the full perspective model. Given a short and arbitrary motion of a stereo rig of camera, the projective depth of every image point can be recovered from the rank-four property of a matrix that comprises the image positions of the scene, and the associated...
This paper addresses the problem of how the image intensity quantization affects the stereo matching algorithms. We compute the disparity using the stereo images represented by various intensity quantization levels. It is shown that, depending on the stereo matching algorithms, even the image pairs with low intensity quantization are able to produce fairly good disparity results. Experiments on Middlebury...
Multi-camera systems such as linear camera arrays are commonly used to capture content for multi-baseline stereo estimation, view generation for auto-stereoscopic displays, or similar tasks. However, even after a careful mechanical alignment, residual vertical disparities and horizontal disparity offsets impair further processing steps. In consequence, the multicamera content needs to be rectified...
In this paper a combination of an initial disparity estimation using the line-wise hybrid recursive matcher and a subsequent post-processing and up-sampling step using variations of cross-bilateral filtering is presented. The proposed algorithm is realtime capable for image resolutions up to HD and scales well with large disparity ranges. It is specifically designed to allow for a high degree of parallelization...
The advent of cheap consumer level depth-aware cameras and the steady advances with dense stereo algorithms urge the exploitation of combined photometric and geometric information to attain a more robust scene understanding. To this end, segmentation is a fundamental task, since it can be used to feed with meaningfully grouped data the following steps in a more complex pipeline. Color segmentation...
In this paper, a novel edge-based stereo matching technique is presented. Depth discontinuities are specifically accounted for in the choice of support regions. We employ dynamic programming along edge-segments to efficiently enforce inter-scanline consistency. Although not performing a global optimization over the whole image we show that our approach performs successfully on the Middlebury benchmark...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.