• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1997.10a
• /
• pp.147-152
• /
• 1997

This paper presents a method for measuring and analyzing strains in sheet metal forming by stereo vision system. A better understanding and evaluation of the formability can be achieved by analyzing stain distribution in deformed sheet metals. By means of image processing technique, it is possible to get strain distribution efficiently. For measuring strain automatically and accurately, algorithms for camera calibration, grid detection, stereo matching and strain analysis has been developed and verified by experiments with GUI(Graphic User Interface).

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.474-478
• /
• 1999

Genetic algorithm is an efficient search method using principles of natural selection and population genetics. In conventional genetic algorithms, however, the size of gene pool should be increased to insure a convergency. Therefore, many memory spaces and much computation time were needed. Also, since child chromosomes were generated by chromosome crossover and gene mutation, the algorithms have a complex structure. Thus, in this paper, a compact stereo matching algorithm using a population-based incremental teaming based on probability vector is proposed to reduce these problems. The PBIL method is modified for matching environment. Since the Proposed algorithm uses a probability vector and eliminates gene pool, chromosome crossover, and gene mutation, the matching algorithm is simple and the computation load is considerably reduced. Even if the characteristics of images are changed, stable outputs are obtained without the modification of the matching algorithm.

• 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 Korea Multimedia Society
• /
• v.8 no.4
• /
• pp.492-501
• /
• 2005

In this paper, we proposed the new segmentation method of optic nerve head and optic cub to consider the depth of optic nerve head on stereo fundus image. We analyzed the error factor of stereo matching on stereo fundus image, and compensated them. For robust extraction of optic nerve head and optic cub, we proposed the modified active contour model to consider the 3D depth of optic nerve head. As experiment result to various stereo fundus images, we confirmed that proposed method can segment optic nerve head and optic cup effectively.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.8
• /
• pp.1663-1674
• /
• 2012

In this paper, we propose a new watermarking technique for copyright protection of stereo image. The proposed technique embeds watermark to the region which corresponds to occlusion of the disparity map to be extracted by the proposed stereo matching and the frequency coefficient with the appropriate value. We use discrete wavelet transform for frequency transform tool. The proposed algorithm consists of stereo matching, watermark rearrange, mark space selection, and watermark embedding/extracting. We tested the experiment about 4 stereo images which are from Middlebury site. We embedded the watermark to 4 stereo images and extracted it from the images after attacks. We also visually analyzed the watermark embedding images in 3D TV environment.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.16 no.5
• /
• pp.134-140
• /
• 2017

Shape-from-shading (SFS) or stereo vision algorithms can be utilized to measure the shape of an object with imaging techniques for effective sensing in non-contact measurements. SFS algorithms could reconstruct the 3D information from a 2D image data, offering relatively comprehensive information. Meanwhile, a stereo vision algorithm needs several feature points or lines to extract 3D information from two 2D images. However, to measure the size of an object with a freeform surface, the two algorithms need some additional information, such as boundary conditions and grids, respectively. In this study, a stereo vision scheme using the depth information obtained by shape-from-shading as patterns was proposed to measure the size of an object with a freeform surface. The feasibility of the scheme was proved with an experiment where the images of an object were acquired by a CCD camera at two positions, then processed by SFS, and finally by stereo matching. The experimental results revealed that the proposed scheme could recognize the size and shape of freeform surface fairly well.

• The KIPS Transactions:PartB
• /
• v.12B no.4 s.100
• /
• pp.429-436
• /
• 2005

A simple stereo matching algorithm using population-based incremental learning(PBIL) is proposed in this paper to decrease the general problem of genetic algorithms, such as memory consumption and inefficiency of search. PBIL is a variation of genetic algorithms using stochastic search and competitive teaming based on a probability vector. The structure of PBIL is simpler than that of other genetic algorithm families, such as serial and parallel ones, due to the use of a probability vector. The PBIL strategy is simplified and adapted for stereo matching circumstances. Thus, gene pool, chromosome crossover, and gene mutation we removed, while the evolution rule, that fitter chromosomes should have higher survival probabilities, is preserved. As a result, memory space is decreased, matching rules are simplified and computation cost is reduced. In addition, a scheme controlling the distance of neighbors for disparity smoothness is inserted to obtain a wide-area consistency of disparities, like a result of coarse-to-fine matchers. Because of this scheme, the proposed algorithm can produce a stable disparity map with a small fixed-size window. Finally, an alterative version of the proposed algorithm without using probability vector is also presented for simpler set-ups.

• Journal of KIISE
• /
• v.44 no.9
• /
• pp.932-945
• /
• 2017

In this paper, a new hardware and software architecture for a stereo vision processing system including rectification, disparity estimation, and visualization was developed. The developed method, named LArge scale stereo matching method using Support Point Interpolation (LASPI), shows excellence in real-time processing for obtaining dense disparity maps from high quality image regions that contain high density support points. In the real-time processing of high definition (HD) images, LASPI does not degrade the quality level of disparity maps compared to existing stereo-matching methods such as Efficient LArge-scale Stereo matching (ELAS). LASPI has been designed to meet a high frame-rate, accurate distance resolution performance, and a low resource usage even in a limited resource environment. These characteristics enable LASPI to be deployed to safety-critical applications such as an obstacle recognition system and distance detection system for autonomous vehicles. A Field Programmable Gate Array (FPGA) for the LASPI algorithm has been implemented in order to support parallel processing and 4-stage pipelining. From various experiments, it was verified that the developed FPGA system (Xilinx Virtex-7 FPGA, 148.5MHz Clock) is capable of processing 30 HD ($1280{\times}720pixels$) frames per second in real-time while it generates disparity maps that are applicable to real vehicles.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.10a
• /
• pp.177-177
• /
• 2003

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1C
• /
• pp.56-63
• /
• 2003

In this paper, a wavelet-based stereo matching algorithm to obtain an accurate disparity map in wavelet transformed domain by using a shift ability property, a modified wavelet transform, the similarities for their sub-bands, and a hierarchical structure is proposed. New approaches for stereo matching by lots of feature information are to utilize translation-variant results of the sub-bands in the wavelet transformed domain because they cannot literally expect translation invariance in a system based on convolution and sub-sampling. After the similarity matching for each sub-band, we can easily find optimal matched-points because the sub-bands appearance of the shifted signals is definitely different from that of the original signal with no shift.