• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2005.07a
• /
• pp.605-606
• /
• 2005

Depth error correction effect for maladjusted stereo cameras with calibrated pixel distance parameter is presented. Intra and extra parameters should be obtain to determine the relation between image and world coordination through experiment. One difficulty is in camera alignment for parallel installation: placing two CCD arrays in a plane. If the pixel distance parameter which is one of intra parameter is calibrated with known points, such error can be compensated in some amount. Such error compensation effect with the calibrated pixel distance parameter is demonstrated with various experimental results.

• Journal of the Semiconductor & Display Technology
• /
• v.9 no.2
• /
• pp.123-126
• /
• 2010

An implementation of modified stereo matching using efficient belief propagation (BP) algorithm is presented in this paper. We do recommend the use of the simple sobel, prewitt edge operator. The application of B band sobel edge operator over image demonstrates result with somewhat noisy (distinct border). When we adopt the only MRF + BP algorithm, however, borders cannot be distinguished due to that the message functions in the BP algorithm is just the mechanism which passes energy data to the only large gap of each Message functions In order to address the abovementioned disadvantageous phenomenon, we use the sobel edge operator + MRF + BP algorithm to distinguish the border that is located between the similar message data. Using edge information, the result shows that our proposed process diminishes the propagation of wrong probabilistic information. The enhanced result is due to that our proposed method effectively reduced errors incurred by ambiguous scene properties.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.1464-1466
• /
• 2013

기존의 스테레오 매칭 시스템은 얻어지는 영상에 따라 disparity의 결과가 크게 차이를 나타내게 된다. 이러한 오류를 줄이고자 일정한 패턴을 주사하여 스테레오 매칭을 계산하는 방식인 액티브 스테레오 기법이 대두되고 있다. 본 논문에서는 이러한 액티브 스테레오 매칭을 사용시에 얻어질 수 있는 패턴 영상과 패턴이 없는 원영상을 서로 조합하여 스테레오 매칭을 수행함으로서 정확한 disparity를 얻고자 한다. 이러한 영상의 합성시에 두 영상의 비율에 따라서, 얻어지는 영상의 밝기 구성에 따라서 disparity결과의 차이와 이를 실제 시스템을 구성시에 필요한 점에 대해서 확인하고자 한다.

• Journal of KIISE:Software and Applications
• /
• v.33 no.1
• /
• pp.69-83
• /
• 2006

This paper describes an image disparity estimation method using a segmented-region based stereo matching. Segmented-region based disparity estimation yields a disparity map as the unit of segmented region. However, there is a problem that it estimates disparity imprecisely. The reason is that because it not only have matching errors but also apply an identical way to disparity estimation, which is not considered each type of matched regions. To solve this problem, we proposes a disparity estimation method which is considered the type of matched regions. That is, the proposed method classifies whole matched regions into similar-matched region, dissimilar-matched region, false-matched region and miss-matched region by analyzing the type of matched regions. We then performs proper disparity estimation for each type of matched regions. This method minimizes the error in estimating disparity which is caused by inaccurate matching and also improves the accuracy of disparity of the well-matched regions. For the purpose of performance evaluations, we perform tests on a variety of scenes for synthetic, indoor and outdoor images. As a result of tests, we can obtain a dense disparity map which has the improved accuracy. The remarkable result is that the accuracy of disparity is also improved considerably for complex outdoor images which are barely treatable in the previous methods.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.33 no.5
• /
• pp.407-414
• /
• 2015

Interest points are generally located at the pixels where height changes occur. So, interest points can be the significant pixels for DSM generation, and these have the important role to generate accurate and reliable matching results. Manual operation is widely used to extract the interest points and to match stereo satellite images using these for generating height information, but it causes economic and time consuming problems. Thus, a tie point extraction method using Harris-affine technique and SIFT(Scale Invariant Feature Transform) descriptors was suggested to analyze height information of buildings in this study. Interest points on buildings were extracted by Harris-affine technique, and tie points were collected efficiently by SIFT descriptors, which is invariant for scale. Searching window for each interest points was used, and direction of tie points pairs were considered for more efficient tie point extraction method. Tie point pairs estimated by proposed method was used to analyze height information of buildings. The result had RMSE values less than 2m comparing to the height information estimated by manual method.

• The KIPS Transactions:PartB
• /
• v.18B no.5
• /
• pp.255-264
• /
• 2011

In this paper, we propose a forward vehicle detection algorithm using column detection and bird's-eye view mapping based on stereo vision. The algorithm can detect forward vehicles robustly in real complex traffic situations. The algorithm consists of the three steps, namely road feature-based column detection, bird's-eye view mapping-based obstacle segmentation, obstacle area remerging and vehicle verification. First, we extract a road feature using maximum frequent values in v-disparity map. And we perform a column detection using the road feature as a new criterion. The road feature is more appropriate criterion than the median value because it is not affected by a road traffic situation, for example the changing of obstacle size or the number of obstacles. But there are still multiple obstacles in the obstacle areas. Thus, we perform a bird's-eye view mapping-based obstacle segmentation to divide obstacle accurately. We can segment obstacle easily because a bird's-eye view mapping can represent the position of obstacle on planar plane using depth map and camera information. Additionally, we perform obstacle area remerging processing because a segmented obstacle area may be same obstacle. Finally, we verify the obstacles whether those are vehicles or not using a depth map and gray image. We conduct experiments to prove the vehicle detection performance by applying our algorithm to real complex traffic situations.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.3
• /
• pp.160-173
• /
• 2013

In this paper, we propose a new visual odometry technique by combining a forward-looking stereo camera and a backward-looking monocular camera. The main goal of the proposed technique is to identify the location of a moving vehicle which travels long distance and comes back to the initial position in urban road environments. While the vehicle is moving to the destination, a global 3D map is updated continuously by a stereo visual odometry technique using a graph theorem. Once the vehicle reaches the destination and begins to come back to the initial position, a map-based monocular visual odometry technqieu is used. To estimate the position of the returning vehicle accurately, 2D features in the backward-looking camera image and the global map are matched. In addition, we utilize the previous matching nodes to limit the search ranges of the next vehicle position in the global map. Through two navigation paths, we analyze the accuracy of the proposed method.

• Journal of Korean Society for Geospatial Information Science
• /
• v.4 no.1 s.6
• /
• pp.93-102
• /
• 1996

For an atomatic generation of DEM(Digital Elevation Model) by computer, it is a time-consumed work to determine adquate matches from stereo images. Correlation and evenly distributed area-based method is generally used for matching operation. In this paper, we propose a new approach that computes matches efficiantly by changing the size of mask window and search area according to the given terrain information. For image segmentation, at first edge-preserving smoothing filter is used for preprocessing, and then region growing algorithm is applied for the filterd images. The segmented regions are classifed into mountain, plain and water area by using MRF(Markov Random Filed) model. Maching is composed of predicting parallex and fine matching. Predicted parallex determines the location of search area in fine matching stage. The size of search area and mask window is determined by terrain information for each pixel. The execution time of matching is reduced by lessening the size of search area in the case of plain and water. For the experiments, four images which are covered $10km{\times}10km(1024{\times}1024\;pixel)$ of Taejeon-Kumsan in each are studied. The result of this study shows that the computing time of the proposed method using terrain information for matching operation can be reduced from 25% to 35%.

• Convergence Security Journal
• /
• v.13 no.3
• /
• pp.9-15
• /
• 2013

Calculating of matching cost is an important for efficient stereo matching. To investigate the performance of matching process, the concepts of the existing methods are introduced. Also we analyze the performance and merits of them. The simplest matching costs assume constant intensities at matching image locations. We consider matching cost functions which can be distinguished between pixel-based and window-based approaches. The Pixel-based approach includes absolute differences (AD) and sampling-intensitive absolute differences (BT). The window-based approach includes the sum of the absolute differences, the sum of squared differences, the normalized cross-correlation, zero-mean normalized cross-correlation, census transform, and the absolute differences census transform (AD-Census). We evaluate matching cost functions in terms of accuracy and time complexity. In terms of the accuracy, AD-Census method shows the lowest matching error ratio (the best solution). The ZNCC method shows the lowest matching error ratio in non-occlusion and all evaluation part. But it performs high matching error ratio at the discontinuities evaluation part due to blurring effect in the boundary. The pixel-based AD method shows a low complexity in terms of time complexity.

• Journal of radiological science and technology
• /
• v.40 no.1
• /
• pp.121-126
• /
• 2017

A technique for producing the ear shell for a hearing aid using DICOM (Digital Imaging and Communication in Medicine) image and a 3D printing was studied. It is a new application method, and is an application technique that can improve the safety and infection of hearing aid users and can reduce the production time and process stages. In this study, the effects on the shape surface were examined before and after the printing of the ear shell using a 3D printer based on the values obtained from the raw data of the DICOM images at the volumes of 0.5 mm, 1.0 mm, and 2.0 mm, respectively. Before the printing, relative relationship was compared with respect to the STL (STereoLithography) file structure; and after the printing, the intervals of the layered structure of the ear shell shape surface were compared by magnifying them using a microscope. For the STL file structure, the numbers of triangular vertices, more than five intersecting points, and maximum intersecting points were large in the order of 0.5 mm, 1.0 mm, and 2.0 mm, respectively; and the triangular structure was densely distributed in the order of the bending, angle, and crest regions depending on the sinuosity of the external auditory meatus shape. As for the ear shell shape surface examined by the digital microscope, the interval of the layered structure was thick in the order of 2.0 mm, 1.0 mm, and 0.5 mm. For the STL surface structure mentioned above, the intersecting STL triangular structure was denser as the sinuosity of the 3D ear shell shape became more irregular and the volume of the raw data decreased.