• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2225-2227
• /
• 1998

An efficient stereo matching method with variable matching weights is proposed. The edge segment-based stereo matching has been shown to be efficient method. The method includes 5 matching factor with different weights. The ordinary matching weights are not always adequate for every image. Employing different weight sets depending on the complexity shows better matching performance. In this paper, an evaluation criterion for complexity is suggested and the experimental results with the proposed method is shown.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12C
• /
• pp.1147-1153
• /
• 2009

We propose a novel image segmentation and segment-based stereo matching technique using color, depth, and motion information. Proposed technique firstly splits reference images into foreground region or background region using depth information from depth camera. Then each region is segmented into small segments with color information. Moreover, extracted segments in current frame are tracked in the next frame in order to maintain depth consistency between frames. The initial depth from the depth camera is also used to set the depth search range for stereo matching. Proposed segment-based stereo matching technique was compared with conventional one without foreground and background separation and other conventional one without motion tracking of segments. Simulation results showed that the improvement of segment extraction and depth estimation consistencies by proposed technique compared to conventional ones especially at the static background region.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.3
• /
• pp.116-123
• /
• 1990

Most algorithms utilized the horizontal epipolar lines for solving the correspondence problem in 3-D computer vision. However, the requirement is very difficult to be satisfied in real situations. In this paper, we propose a binocular-stereo matching algorithm, based on line matching method, which does not require the horizontal epipolar lines of the extreme pixels of a given line segment and two circles whose radius is equal to the maximum disparity. And we use the features including the direction of line segments, edge strength and cross-correlation for line matching. The experimental results show that the proposed algorithm can be a useful tool for solving the correspondence problem in 3-D computer vision.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.4
• /
• pp.277-285
• /
• 2004

We present a new hybrid stereo matching technique in terms of the co-operation of area-based stereo and feature-based stereo. The core of our technique is that feature matching is carried out by the reference of the disparity evaluated by area-based stereo. Since the reference of the disparity can significantly reduce the number of feature matching combinations, feature matching error can be drastically minimized. One requirement of the disparity to be referenced is that it should be reliable to be used in feature matching. To measure the reliability of the disparity, in this paper, we employ the self-consistency of the disunity Our suggested technique is applied to the detection of 3D line segments by 2D line matching using our hybrid stereo matching, which can be efficiently utilized in the generation of the rooftop model from urban imagery. We carry out the experiments on our hybrid stereo matching scheme. We generate synthetic images by photo-realistic simulation on Avenches data set of Ascona aerial images. Experimental results indicate that the extracted 3D line segments have an average error of 0.5m and verify our proposed scheme. In order to apply our method to the generation of 3D model in urban imagery, we carry out Preliminary experiments for rooftop generation. Since occlusions are occurred around the outlines of buildings, we experimentally suggested multi-image hybrid stereo system, based on the fusion of 3D line segments. In terms of the simple domain-specific 3D grouping scheme, we notice that an accurate 3D rooftop model can be generated. In this context, we expect that an extended 3D grouping scheme using our hybrid technique can be efficiently applied to the construction of 3D models with more general types of building rooftops.

• Journal of IKEEE
• /
• v.13 no.2
• /
• pp.181-185
• /
• 2009

In this paper, we are concerned with a 3D line segment extraction method by area-based stereo matching technique. The main idea is based on line fitting of elevation data on 2D line coordinates of ortho-image. Elevation data and ortho-image can be obtained by well-known area-based stereo matching technique. In order to use elevation in line fitting, the elevation itself should be reliable. To measure the reliability of elevation, in this paper, we employ the concept of self-consistency. We test the effectiveness of the proposed method with a quantitative accuracy analysis using synthetic images generated from Avenches data set of Ascona aerial images. Experimental results indicate that our method generates 3D line segments almost 7.5 times more accurate than raw elevations obtained by area-based method.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2921-2923
• /
• 2005

This paper presents to generate 3D building model using estimation of rooftop surface after 3D line segment extraction using hybrid stereo matching techniques in terms of the co-operation of area-based stereo and feature-based stereo. we first performed a junction extraction from 3D line segment data which was obtained by stereo images, and finally generated building's reliable rooftop surface model using LSE(Least Square Error) method after creating surfaces by grouped and fixed junction points. we generated synthetic images for experimentation by photo-realistic simulation on Avenches data set of Ascona aerial images.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3721-3737
• /
• 2015

3D reconstruction based on binocular data is significant to machine vision. In our method, we propose a new and high efficiency 3D reconstruction approach by using a consumer camera aiming to: 1) address the configuration problem of dual camera in the binocular reconstruction system; 2) address stereo matching can hardly be done well problem in both time computing and precision. The kernel feature is firstly proposed in calibration stage to rectify the epipolar. Then, we segment the objects in the camera into background and foreground, for which system obtains the disparity by different method: local window matching and kernel feature-based matching. Extensive experiments demonstrate our proposed algorithm represents accurate 3D model.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.3
• /
• pp.407-415
• /
• 2012

In this paper, we propose a new stereo matching algorithm by using color information especially for stereo images containing human beings in the applications such as tele-presence system. In the proposed algorithm, we first remove the background regions by using a threshold value for stereo images obtained by stereo camera and then find an initial disparity map and segment a given image into R, G, B and white color components. We also obtain edges in the segmented image and estimate the disparity from the extract boundary regions. Finally, we generate the final disparity map by properly combining the disparity map of each color component. Experiment results show better performance compared with the window based method and the dynamic programing method especially for stereo images with human being.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.8
• /
• pp.744-750
• /
• 2010

To segment instances of vehicle classes in a sparse stereo-matching data set, this paper presents an algorithm for clustering based on DP (Dynamic Programming). The algorithm is agglomerative: it begins with each element in the set as a separate cluster and merges them into successively larger clusters according to similarity of two clusters. Here, similarity is formulated as a cost function of DP. The proposed algorithm is proven to be effective by experiments performed on various images acquired by a moving vehicle.

• The Journal of Engineering Research
• /
• v.6 no.2
• /
• pp.99-107
• /
• 2004

In stereo matching system, it is efficient using segment patch, which divides the image into homogeneous region in color or similar intensity, because it preserves the disparity boundary and disparity continuity in low textured region. But many miss matching occur in the highly textured region because of the over segmentation that makes patch small and ambiguous. In this paper, in order to solve problems, we propose adaptive patch matching based on the watershed image segmentation. Performance was verified in experimental results.