A new approach to the maximum-flow problem
Journal of the ACM (JACM)
A Pixel Dissimilarity Measure That Is Insensitive to Image Sampling
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Mean Shift: A Robust Approach Toward Feature Space Analysis
IEEE Transactions on Pattern Analysis and Machine Intelligence
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
3D Models of Architectural Scenes from Uncalibrated Images and Vanishing Points
ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
Hexagon-based search pattern for fast block motion estimation
IEEE Transactions on Circuits and Systems for Video Technology
| Hi-index | 0.00 |
Recently, 3D display systems are getting considerable attentions not only from theater but also from home. 3D multimedia content development plays very important role in helping to setup a visual reality entertainment program. Lenticular Autostereoscopic display is one of the 3D-TV having the following advantages such as improving 3D viewing experience, supporting wider viewing angles for multiple viewers, and no requiring any special glasses. However, most of the current 3D movie and camera do not support the Autostereoscopic function. Therefore, we proposed a system that can transform the current 3D stereoscopic image sequence to the depth map sequence. These sequences can be warped into the multiplexed image by DIBR (Depth Image Based Rendering), and show with Autostereoscopic. Some recent techniques that transform the stereoscopic correspondence problem are based on Graph Cuts. They transform the matching problem to a minimization of a global energy function. However, it has been difficult to include high level information in the formulation of the Graph Cut. In this paper, we describe a new technique for generating depth map sequence from stereoscopic image sequence. We improve the Graph Cuts from pixel-based matching to region-based by using the Mean Shift 3D regions clustering to link the features of images before segmentation. And we also use the result of 3D regions clustering to assign depth values to time domain. After the sequence of depth map has been obtained, the DIBR method was used in transformation process. The experimental result shows that our system not only establishes a mechanism of depth transformation but also improves the accuracy and effectiveness on traditional Graph Cuts.