• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1159-1181
• /
• 2016

This study introduces an image-based 2D-to-3D conversion system that provides significant stereoscopic visual effects for humans. The linear and atmospheric perspective cues that compensate each other are employed to estimate depth information. Rather than retrieving a precise depth value for pixels from the depth cues, a direction angle of the image is estimated and then the depth gradient, in accordance with the direction angle, is integrated with superpixels to obtain the depth map. However, stereoscopic effects of synthesized views obtained from this depth map are limited and dissatisfy viewers. To obtain impressive visual effects, the viewer's main focus is considered, and thus salient object detection is performed to explore the significance region for visual attention. Then, the depth map is refined by locally modifying the depth values within the significance region. The refinement process not only maintains global depth consistency by correcting non-uniform depth values but also enhances the visual stereoscopic effect. Experimental results show that in subjective evaluation, the subjectively evaluated degree of satisfaction with the proposed method is approximately 7% greater than both existing commercial conversion software and state-of-the-art approach.

• Smart Media Journal
• /
• v.1 no.3
• /
• pp.22-28
• /
• 2012

As the smart media becomes more popular, the demand for high-quality 3D images and depth maps is increasing. However, performance of the current technologies to acquire depth maps is not sufficient. The depth maps from stereo matching methods have low accuracy in homogeneous regions. The depth maps from depth cameras are noisy and have low-resolution due to technical limitations. In this paper, we introduce the state-of-the-art algorithms for depth map enhancement and up-sampling from conventional methods using only depth maps to the latest algorithms referring to both depth maps and their corresponding color images. We also present depth map enhancement algorithms for hybrid camera systems in detail.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.357-359
• /
• 2010

In monocular images that are used to determine the depth of the vanishing point, the buildings, roads and buildings, such as outdoor video or hallway with room inside for the interior structure, such as the vanishing point in the video is a very strong depth cue. Depth map using the vanishing point in the three-dimensional space, the two-dimensional imaging is used to restore the structure. But if there is a vanishing point vanishing point in the video also depends on the location of the relative depth of different ways to express that need. In this paper we present images of a vanishing point with respect to the improved depth-map was created. Proposed an area where the loss of seven points and areas defined as areas along the proposed direction of different depth.

• Journal of Broadcast Engineering
• /
• v.14 no.5
• /
• pp.601-615
• /
• 2009

This paper proposes an efficient depth-map coding method for generating virtual-view images in 3D-Video. Virtual-view images can be generated by the view-interpolation based on the depth-map of the image. A conventional video coding method such as H.264 has been used. However, a conventional video coding method does not consider the image characteristics of the depth-map. Therefore, this paper proposes an adaptive depth-map coding method that can select between the H.264/AVC coding scheme and the proposed gray-coded bit plane-based coding scheme in a unit of block. This improves the coding efficiency of the depth-map data. Simulation results show that the proposed method, in comparison with the H.264/AVC coding scheme, improves the average BD-rate savings by 7.43% and the average BD-PSNR gains by 0.5dB. It also improves the subjective picture quality of synthesized virtual-view images using decoded depth-maps.

• Journal of Digital Convergence
• /
• v.10 no.9
• /
• pp.351-356
• /
• 2012

This paper presents the 2D/3D conversion technique using depth map which is generated based on the haze and relative height cue. In cases that only the conventional haze information is used, errors in image without haze could be generated. To reduce this kind of errors, a new approach is proposed combining the haze information with depth map which is constructed based on the relative height cue. Also the gray scale image from Mean Shift Segmentation is combined with depth map of haze information to sharpen the object's contour lines, upgrading the quality of 3D image. Left and right view images are generated by DIBR(Depth Image Based Rendering) using input image and final depth map. The left and right images are used to generate red-cyan 3D image and the result is verified by measuring PSNR between the depth maps.

• Journal of Broadcast Engineering
• /
• v.16 no.6
• /
• pp.916-926
• /
• 2011

It is well known that high-resolution 3D movie contents frequently do not deliver the identical 3D perception to low-resolution 3D images. For solving this problem, we propose a novel method that produces a new stereoscopic image based on depth map transformation using the spatial complexity of an image. After analyzing the depth map histogram, the depth map is decomposed into multiple depth planes that are transformed based upon the spatial complexity. The transformed depth planes are composited into a new depth map. Experimental results demonstrate that the lower the spatial complexity is, the higher the perceived video quality and depth perception are. As well, visual fatigue test showed that the stereoscopic images deliver less visual fatigue.

• Economic and Environmental Geology
• /
• v.32 no.5
• /
• pp.503-517
• /
• 1999

The purpose of this study is to verfify a more effecive techique for calculating geothermal gradient. this study examines 370 data of temperature-logging having been collected since 1985. The daya are divided into three different grades grades according to the type of temperature-depth plots: 204 data show typical linear gradient (Grade A); 126 data do not explicitily show the gradient becase of various external effects such as water flow (Grade B); and the rest 40 data do not show the gradient at all (Grade D). The new technique for calculating geothermal gradient is to be required to use Greade-B data more effctiviely. This new technique includes (1) calculating the independer depth of atmospheric temperature in the earth; (2) drawing a distribution map of subsurface tempurature by using the distribution map of subsurface temperature by using Grade-A data at the independent depth; and (3) recalculating geothermal gradient of Grade-B data by using the distrbution map of subsurface temperature, borehole depth, and bottom temperature of Grade-B data by using the distribution map of subsurface temperature, borehole depth, and bottom temperature of Grade-B data. As a result, 330 data-both Grade-A and Grade-B data--can be used to draw a distribution map of hot spradient. The map clearly distinguishes anomaly areas, and helps interpret their relations to the distribution of hot springs, geology, geological structures, and geophysical anomaly areas. These new results reveal that the average of geothermal in south Korea is 25.6$^{\circ}C$/km, when calculated to the Kriging method.

• Journal of the Semiconductor & Display Technology
• /
• v.15 no.3
• /
• pp.67-71
• /
• 2016

This paper addresses a problem of defocus map recovery from single image. We describe a simple effective approach to estimate the spatial value of defocus blur at the edge location of the image. At first, we perform a re-blurring process using Gaussian function with input image, and calculate a gradient magnitude ratio with blurring amount between input image and re-blurred image. Then we get a full defocus map by propagating the blur amount at the edge location. Experimental result reveals that our method outperforms a reliable estimation of depth map, and shows that our algorithm is robust to noise, inaccurate edge location and interferences of neighboring edges within input image.

• The Journal of the Korea Contents Association
• /
• v.13 no.10
• /
• pp.62-70
• /
• 2013

DIBR(Depth Image Based Rendering) is a kind of view synthesis algorithm to generate images at free view points from the reference color image and its depth map. One of the main challenges of DIBR is the occurrence of holes that correspond to uncovered backgrounds at the synthesized view. In order to cover holes efficiently, two main approaches have been actively investigated. One is to develop preprocessing algorithms for depth maps or parallax maps to reduce the size of possible holes, and the other is to develop hole filling methods to fill the generated holes using adjacent pixels in non-hole areas. Most conventional preprocessing algorithms for reducing the size of holes are based on the smoothing process of depth map. Filtering of depth map, however, attenuates the resolution of depth map and generates geometric distortions. In this paper, we proposes a novel preprocessing algorithm for parallax map to improve the performance of hole-filling by avoiding the drawbacks of conventional methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.5
• /
• pp.1155-1163
• /
• 2011

In this paper, we propose a new pre-processing algorithm applied to depth map to improve the coding efficiency. Now, 3DV/FTV group in the MPEG is working for standard of 3DVC(3D video coding), but compression method for depth map images are not confirmed yet. In the proposed algorithm, after dividing the histogram distribution of a given depth map by EM clustering method based on GMM, we classify the depth map into several layered images. Then, we apply different mean shift filter to each classified image according to the existence of background or foreground in it. In other words, we try to maximize the coding efficiency while keeping the boundary of each object and taking average operation toward inner field of the boundary. The experiments are performed with many test images and the results show that the proposed algorithm achieves bits reduction of 19% ~ 20% and computation time is also reduced.