• Journal of the Semiconductor & Display Technology
• /
• v.8 no.4
• /
• pp.95-100
• /
• 2009

This paper presents an efficient disparity matching, using sum of absolute difference (SAD) and dynamic programming (DP) algorithm. This algorithm makes use of one of area-based algorithm which is the absolute sum of the pixel difference corresponding to the window size. We use the information of the right eye brightness (B) and the left eye brightness to get an best matching results and apply the results to the left eye image using the window go by the brightness of the right eye image. This is that we can control the brightness. The major feature of this algorithm called SAD+DP+B is that although Root Mean Square (RMS) performance is slightly less than SAD+DP, due to comparing original image, its visual performance is increased drastically for matching the disparity map on account of its matching compared to SAD+DP. The simulation results demonstrate that the visual performance can be increased and the RMS is competitive with or slightly higher than SAD+DP.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.418-422
• /
• 2009

Generally, algorithms for generating disparity maps can be clssified into two categories: region-based method and feature-based method. The main focus of this research is to generate a disparity map with an accuracy depth information for 3-dimensional reconstructing. Basically, the region-based method and the feature-based method are simultaneously included in the proposed algorithm, so that the existing problems including false matching and occlusion can be effectively solved. As a region-based method, regions of false matching are extracted by the proposed MMAD(Modified Mean of Absolute Differences) algorithm which is a modification of the existing MAD(Mean of Absolute Differences) algorithm. As a feature-based method, the proposed method eliminates false matching errors by calculating the vector with SIFT and compensates the occluded regions by using a pair of adjacent SIFT matching points, so that the errors are reduced and the disparity map becomes more accurate.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.4
• /
• pp.105-117
• /
• 1998

In this paper, the general formula of disparity estimation based on Bayesian Maximum A Posteriori (MAP) algorithm is derived and implemented with simplified probabilistic models. The probabilistic models are independence and similarity among the neighboring disparities in the configuration.The formula is the generalized probabilistic diffusion equation based on Bayesian model, and can be implemented into the some different forms corresponding to the probabilistic models in the disparity neighborhood system or configuration. And, we proposed new probabilistic models in order to simplify the joint probability distribution of disparities in the configuration. According to the experimental results, the proposed algorithm outperformed the other ones, such as sum of swuared difference(SSD) based algorithm and Scharstein's method. We canconclude that the derived formular generalizes the probabilistic diffusion based on Bayesian MAP algorithm for disparity estimation, and the propsoed probabilistic models are reasonable and approximate the pure joint probability distribution very well with decreasing the computations to 0.01% of the generalized formula.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.3
• /
• pp.349-354
• /
• 2011

In this paper we propose a simple efficient stereo matching algorithm to recover sharp object boundaries and to obtain dense disparity map using new multiple line shape windows. To this end, we consider left-right consistency and unique constraint. From the experimental results it is found that the proposed algorithm is very good for obtaining sharp and dense disparity maps for stereo image pairs.

• Journal of Broadcast Engineering
• /
• v.17 no.5
• /
• pp.838-850
• /
• 2012

In this paper, we propose a novel algorithm that generates multi-view images by using various image features obtained from the given stereoscopic images. In the proposed algorithm, we first create an intensity gradient saliency map from the given stereo images. And then we calculate a block-based optical flow that represents the relative movement(disparity) of each block with certain size between left and right images. And we also obtain the disparities of feature points that are extracted by SIFT(scale-invariant We then create a disparity saliency map by combining these extracted disparity features. Disparity saliency map is refined through the occlusion detection and removal of false disparities. Thirdly, we extract straight line segments in order to minimize the distortion of straight lines during the image warping. Finally, we generate multi-view images by grid mesh-based image warping algorithm. Extracted image features are used as constraints during grid mesh-based image warping. The experimental results show that the proposed algorithm performs better than the conventional DIBR algorithm in terms of visual quality.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1996-1999
• /
• 2003

Stereo matching is an important technique in the are of computer vision. There are already many theorems to find disparity map using stereo images. Usually, disparity is searched by using block matching. However block matching result in blocking effects caused by using fixed size window for computing pixel correlations. This paper suggests an efficient method to remove the blocking effect in stereo matching procedures.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.403-404
• /
• 2006

In this paper, we proposed muli-dimensional feature vector matching method combined with disparity smoothness constraint. The smoothness constraint was calculated using the difference between disparity of center pixel and those of 4-neighbor pixels. By applying proposed algorithm to IKONOS satellite stereo imagery, we obtained robust stereo matching result in urban areas.

• Journal of Broadcast Engineering
• /
• v.19 no.5
• /
• pp.656-664
• /
• 2014

In the case of a haze image, transferring the information of the original image is difficult as the contrast leans toward bright regions. Thus, dehazing algorithms have become an important area of study. Normally, since it is hard to obtain a haze-free image, the output image is qualitatively analyzed to test the performance of an algorithm. However, this paper proposes a quantitative error comparison based on reproducing the haze image using a disparity map. In addition, a Hidden Random Markov Model and EM algorithm are used to remove any block artifacts. The performance of the proposed algorithm is confirmed using a variety of synthetic and natural images.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.201-208
• /
• 2015

3D image must have depth image for depth information in order for 3D realistic media broadcasting. We used generally belief propagation algorithm to solve probability model. Belief propagation algorithm is operated by message passing between nodes corresponding to each pixel. The high resolution image will be able to precisely represent but that required much computational complexity for 3D representation. We proposed fast stereo matching algorithm using belief propagation with multi-resolution based wavelet or lifting. This method can be shown efficiently computational time at much iterations for accurate disparity map.

• Journal of Ocean Engineering and Technology
• /
• v.35 no.3
• /
• pp.183-190
• /
• 2021

Tomographic particle image velocimetry (PIV) is a widely used method that measures a three-dimensional (3D) flow field by reconstructing camera images into voxel images. In 3D measurements, the setting and calibration of the camera's mapping function significantly impact the obtained results. In this study, a camera self-calibration technique is applied to tomographic PIV to reduce the occurrence of errors arising from such functions. The measured 3D particles are superimposed on the image to create a disparity map. Camera self-calibration is performed by reflecting the error of the disparity map to the center value of the particles. Vortex ring synthetic images are generated and the developed algorithm is applied. The optimal result is obtained by applying self-calibration once when the center error is less than 1 pixel and by applying self-calibration 2-3 times when it was more than 1 pixel; the maximum recovery ratio is 96%. Further self-correlation did not improve the results. The algorithm is evaluated by performing an actual rotational flow experiment, and the optimal result was obtained when self-calibration was applied once, as shown in the virtual image result. Therefore, the developed algorithm is expected to be utilized for the performance improvement of 3D flow measurements.