• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.1
• /
• pp.53-59
• /
• 2009

Multi-view video is necessary to develop a new compression encoding technique for storage and transmission, because of a huge amount of data. Layered depth image is an efficient representation method of multi-view video data. This method makes a data structure that is synthesis of multi-view color and depth image. This paper proposed enhanced compression method by presentation of efficient layered depth image using real distance comparison, solution of overlap problem, and interpolation. In experimental results, confirmed high compression performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.2C
• /
• pp.186-193
• /
• 2009

Multi-view video is necessary to develop a new compression encoding technique for storage and transmission, because of a huge amount of data. Layered depth image is an efficient representation method of multi-view video data. This method makes a data structure that is synthesis of multi-view color and depth image. This paper proposed enhanced compression method by presentation of efficient layered depth image using real distance comparison, solution of overlap problem, and YCrCb color transformation. In experimental results, confirmed high compression performance and good reconstructed image.

• Journal of Broadcast Engineering
• /
• v.17 no.4
• /
• pp.625-633
• /
• 2012

Extended Depth of Focus (EDF) algorithms for extracting three-dimensional (3D) information from a set of optical image slices are studied by many researches recently. Due to the limited depth of focus of the microscope, only a small portion of the image slices are in focus. Most of the EDF algorithms try to find the in-focus area to generate a single focused image and a 3D depth image. Inherent to most image processing algorithms, the EDF algorithms need parameters to be properly initialized to perform successfully. In this paper, we select three popular transform-based EDF algorithms which are each based on pyramid, wavelet transform, and complex wavelet transform, and study the performance of the algorithms according to the initialization of its parameters. The parameters we considered consist of the number of levels used in the transform, the selection of the lowest level image, the window size used in high frequency filter, the noise reduction method, etc. Through extended simulation, we find a good relationship between the initialization of the parameters and the properties of both the texture and 3D ground truth images. Typically, we find that a proper initialization of the parameters improve the algorithm performance 3dB ~ 19dB over a default initialization in recovering the 3D information.

• Journal of Broadcast Engineering
• /
• v.9 no.3
• /
• pp.185-195
• /
• 2004

This paper presents a multi-depth map fusion method for the 3D scene reconstruction. It fuses depth maps obtained from the stereo matching technique and the depth camera. Traditional stereo matching techniques that estimate disparities between two images often produce inaccurate depth map because of occlusion and homogeneous area. Depth map obtained from the depth camera is globally accurate but noisy and provide a limited depth range. In order to get better depth estimates than these two conventional techniques, we propose a depth map fusion method that fuses the multi-depth maps from stereo matching and the depth camera. We first obtain two depth maps generated from the stereo matching of 3-view images. Moreover, a depth map is obtained from the depth camera for the center-view image. After preprocessing each depth map, we select a depth value for each pixel among them. Simulation results showed a few improvements in some background legions by proposed fusion technique.

• 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.11 no.1
• /
• pp.243-248
• /
• 2013

In this paper, depth of foreground is analysed by focus and color analysis grouping for 2D/3D video conversion and depth of foreground progressing method is preposed by using focus and motion information. Candidate foreground image is generated by estimated movement of image focus information for extracting foreground from 2D video. Area of foreground is extracted by filling progress using color analysis on hole area of inner object existing candidate foreground image. Depth information is generated by analysing value of focus existing on actual frame for allocating depth at generated foreground area. Depth information is allocated by weighting motion information. Results of previous proposed algorithm is compared with proposed method from this paper for evaluating the quality of generated depth information.

• Ecology and Resilient Infrastructure
• /
• v.6 no.3
• /
• pp.171-177
• /
• 2019

The hyperspectral images can be analyzed in more detail compared to the conventional multispectral images so they can be used for analyzing surface properties which are difficult to detect. Therefore, the purpose of this study is to obtain information on river environment by using actual depth data and drone-based images. For this purpose, this study acquired the image values for 100 points of 1 survey line using drone-based hyperspectral sensors and analyzed the correlation in comparison with the actual depth information obtained through ADCP. The ADCP measurements showed that the depth tended to get deeper toward the center and that the average water depth was 0.81 m. As a result of analyzing the hyperspectral images, the value of maximum intensity was 645 and the value of minimum intensity was 278, and the correlation between the actual depth and the results of analyzing the hyperspectral images showed that the depth increased as the value of maximum intensity decreased.

• Korean Journal of Optics and Photonics
• /
• v.20 no.1
• /
• pp.16-22
• /
• 2009

We propose a method to convert a two-dimensional movie to a three-dimensional movie using normalized cut and optical flow. In this paper, we segment an image of a two-dimensional movie to objects first, and then estimate the depth of each object. Normalized cut is one of the image segmentation algorithms. For improving speed and accuracy of normalized cut, we used a watershed algorithm and a weight function using optical flow. We estimate the depth of objects which are segmented by improved normalized cut using optical flow. Ordinal depth is estimated by the change of the segmented object label in an occluded region which is the difference of absolute values of optical flow. For compensating ordinal depth, we generate the relational depth which is the absolute value of optical flow as motion parallax. A final depth map is determined by multiplying ordinal depth by relational depth, then dividing by average optical flow. In this research, we propose the two-dimensional/three-dimensional movie conversion method which is applicable to all three-dimensional display devices and all two-dimensional movie formats. We present experimental results using sample two-dimensional movies.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.1070-1075
• /
• 2009

In this paper, we propose new depth estimation and intermediate view synthesis algorithms for three-dimensional video generation. In order to improve temporal consistency of the depth map sequence, we add a temporal weighting function to the conventional matching function when we compute the matching cost for estimating the depth information. In addition, we propose a boundary noise removal method in the view synthesis operation. after finding boundary noise areas using the depth map, we replace them with corresponding texture information from the other reference image. Experimental results showed that the proposed algorithm improved temporal consistency of the depth sequence and reduced flickering artifacts in the virtual view. It also improved visual quality of the synthesized virtual views by removing the boundary noise.

• Journal of Broadcast Engineering
• /
• v.11 no.4 s.33
• /
• pp.471-482
• /
• 2006

In this paper, we propose a new scheme to generate multi-view images utilizing depth map decomposition and adaptive edge smoothing. After carrying out smooth filtering based on an adaptive window size to regions of edges in the depth map, we decompose the smoothed depth map into four types of images: regular mesh, object boundary, feature point, and number-of-layer images. Then, we generate 3-D scenes from the decomposed images using a 3-D mesh triangulation technique. Finally, we extract multi-view images from the reconstructed 3-D scenes by changing the position of a virtual camera in the 3-D space. Experimental results show that our scheme generates multi-view images successfully by minimizing a rubber-sheet problem using edge smoothing, and renders consecutive 3-D scenes in real time through information decomposition of depth maps. In addition, the proposed scheme can be used for 3-D applications that need the depth information, such as depth keying, since we can preserve the depth data unlike the previous unsymmetric filtering method.