Full Text:   <2251>

CLC number: TP391

On-line Access: 

Received: 2006-12-31

Revision Accepted: 2007-05-08

Crosschecked: 0000-00-00

Cited: 0

Clicked: 4227

Citations:  Bibtex RefMan EndNote GB/T7714

-   Go to

Article info.
1. Reference List
Open peer comments

Journal of Zhejiang University SCIENCE A 2007 Vol.8 No.8 P.1218-1226

http://doi.org/10.1631/jzus.2007.A1218


Stepwise approach for view synthesis


Author(s):  CHAI Deng-feng, PENG Qun-sheng

Affiliation(s):  State Key Lab of CAD and CG, Zhejiang University, Hangzhou 310027, China; more

Corresponding email(s):   chaidf@cad.zju.edu.cn

Key Words:  View synthesis, Occlusion, Graph cut


CHAI Deng-feng, PENG Qun-sheng. Stepwise approach for view synthesis[J]. Journal of Zhejiang University Science A, 2007, 8(8): 1218-1226.

@article{title="Stepwise approach for view synthesis",
author="CHAI Deng-feng, PENG Qun-sheng",
journal="Journal of Zhejiang University Science A",
volume="8",
number="8",
pages="1218-1226",
year="2007",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.2007.A1218"
}

%0 Journal Article
%T Stepwise approach for view synthesis
%A CHAI Deng-feng
%A PENG Qun-sheng
%J Journal of Zhejiang University SCIENCE A
%V 8
%N 8
%P 1218-1226
%@ 1673-565X
%D 2007
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2007.A1218

TY - JOUR
T1 - Stepwise approach for view synthesis
A1 - CHAI Deng-feng
A1 - PENG Qun-sheng
J0 - Journal of Zhejiang University Science A
VL - 8
IS - 8
SP - 1218
EP - 1226
%@ 1673-565X
Y1 - 2007
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2007.A1218


Abstract: 
This paper presents some techniques for synthesizing novel view for a virtual viewpoint from two given views captured at different viewpoints to achieve both high quality and high efficiency. The whole process consists of three passes. The first pass recovers depth map. We formulate it as pixel labelling and propose a bisection approach to solve it. It is accomplished in log2n (n is the number of depth levels) steps, each of which involves a single graph cut computation. The second pass detects occluded pixels and reasons about their depth. It fits a foreground depth curve and a background depth curve using depth of nearby foreground and background pixels, and then distinguishes foreground and background pixels by minimizing a global energy, which involves only one graph cut computation. The third pass finds for each pixel in the novel view the corresponding pixels in the input views and computes its color. The whole process involves only a small number of graph cut computations, therefore it is efficient. And, visual artifacts in the synthesized view can be removed successfully by correcting depth of the occluded pixels. Experimental results demonstrate that both high quality and high efficiency are achieved by the proposed techniques.

Darkslateblue:Affiliate; Royal Blue:Author; Turquoise:Article

Reference

[1] Bobick, A., Intille, S., 1999. Large occlusion stereo. Int. J. Computer Vision, 33(3):181-200.

[2] Boykov, Y., Veksler, O., Zabih, R., 2001. Fast approximate energy minimization via graph cuts. IEEE Trans. on Pattern Anal. Machine Intell., 23(11):1222-1239.

[3] Chai, D.F., 2006. Stereo Matching for Three Dimensional Visual Communication. Ph.D Thesis, Zhejiang University (in Chinese).

[4] Chen, S.E., Williams, L., 1993. View Interpolation for Image Synthesis. Proc. SIGGRAPH’93, p.279-288.

[5] Criminisi, A., Shotton, J., Blake, A., Torr, P., 2003. Gaze Manipulation for One-to-one Teleconferencing. Proc. Int. Conf. on Computer Vision, p.939-946.

[6] Dhond, U., Aggarwal, J., 1989. Structure from stereo—a review. IEEE Trans. on Systems, Man, and Cybern., 19(6):1489-1510.

[7] Geman, S., Geman, D., 1984. Stochastic relaxation, Gibbs distribution, and the Bayesian restoration of images. IEEE Trans. on Pattern Anal. Machine Intell., 6(6):721-741.

[8] Gortler, S.J., Grzeszczuk, R., Szeliski, R., Cohen, M.F., 1996. The Lumigraph. Proc. SIGGRAPH’96, p.43-54.

[9] Hartley, R., Zisserman, A., 2000. Multiple View Geometry in Computer Vision. University Press, Cambridge, UK.

[10] Heckbert, P.S., 1986. Survey of texture mapping. IEEE Computer Graphics and Applications, 6(11):56-67.

[11] Kolmogorov, V., Zabih, R., 2001. Visual Correspondence with Occlusions Using Graph Cuts. Proc. Int. Conf. on Computer Vision, p.508-515.

[12] Kolmogorov, V., Zabih, R., 2002. Multi-camera Scene Reconstruction via Graph Cuts. Proc. European Conference on Computer Vision, p.82-96.

[13] Kolmogorov, V., Zabih, R., 2004. What energy functions can be minimized via graph cuts? IEEE Trans. on Pattern Anal. Machine Intell., 26(2):147-159.

[14] Kutulakos, K., Seitz, S., 2000. A theory of shape by space carving. Int. J. Computer Vision, 38(3):199-218.

[15] Levoy, M., Hanrahan, P., 1996. Light Field Rendering. Proc. SIGGRAPH’96, p.31-42.

[16] Mark, W., McMillan, L., Bishop, G., 1997. Post-rendering 3D Warping. Proc. Symposium on Interactive 3D Graphics, p.7-16.

[17] McMillan, L., Bishop, G., 1995. Plenoptic Modeling: An Image-based Rendering System. Proc. SIGGRAPH’95, p.39-46.

[18] Ohta, Y., Kanade, T., 1985. Stereo by intra- and inter-scanline search using dynamic programming. IEEE Trans. on Pattern Anal. Machine Intell., 7(2):139-154.

[19] Sara, R., Bajcsy, R., 1997. On Occluding Contour Artifacts in Stereo Vision. Proc. IEEE Conf. on Computer Vision and Pattern Recognition, p.852-857.

[20] Scharstein, D., Szeliski, R., 2002. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. Int. J. Computer Vision, 47:7-42.

[21] Seitz, S., Dyer, C., 1999. Photorealistic scene reconstruction by voxel coloring. Int. J. Computer Vision, 35(2):151-173.

[22] Shade, J., Gortler, S., Hey, L., Szeliski, R., 1998. Layered Depth Images. Proc. SIGGRAPH’98, p.231-242.

[23] Shum, H.Y., Kang, S.B., 2000. A Review of Image-based Rendering Techniques. Proc. IEEE/SPIE Visual Communications and Image Processing, p.2-13.

[24] Silva, C., Santos-Victor, J., 2000. Intrinsic Images for Dense Stereo Matching with Occlusions. Proc. European Conference on Computer Vision, p.100-114.

[25] Sun, J., Shum, H., Zheng, N., 2002. Stereo Matching Using Belief Propagation. Proc. European Conference on Computer Vision, p.510-524.

[26] Terzopoulos, D., 1986. Regularization of inverse visual problems involving discontinuities. IEEE Trans. on Pattern Anal. Machine Intell., 8(4):413-424.

[27] Yang, R., Welch, G., Bishop, G., 2002. Real-time Consensus-based Scene Reconstruction Using Commodity Graphics Hardware. Proc. 10th Pacific Conf. on Computer Graphics and Applications, p.225-235.

Open peer comments: Debate/Discuss/Question/Opinion

<1>

Please provide your name, email address and a comment





Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952783; E-mail: cjzhang@zju.edu.cn
Copyright © 2000 - 2022 Journal of Zhejiang University-SCIENCE