Abstract
In this paper, we propose a stereo matching algorithm using multiple windows to recover sharp object boundaries. In order to achieve this goal, we employ commonly used techniques, such as left-right consistency, uniqueness constraint, and expansible multiple windows. By adding a new idea of multiple windows over these techniques, we can minimize the boundary overreach, which is usually caused by the unsuitable window size or shape. We demonstrate that the algorithm using a new multiple windows can display the dense and sharp disparity map and the windows adaptively used according to features of boundary edges. A problem generated by the disposition order of multiple windows is also presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dhond, U. R., Aggarwal, J.K.: Structure from Stereo-A Review, IEEE Transactions on System, Man, and Cybernetics, Vol. 19, No. 6, Nov./Dec. (1989) 1489–1510.
Otha, Y., Tamura, H.: Mixed Reality, Springer-Verlag (1999).
Kanade, T., Okutomi, M.: A Stereo Matching Algorithm with An Adaptive Window: Theory and Experiment, IEEE Transaction on Pattern Analysis and Machine Intelligence, Vol. 16, No. 9, Sept. (1994) 920–932
Okutomi, M., Kanade, T.: A Multiple-Baseline Stereo, IEEE Transaction on Pattern Analysis and Machine Intelligence, Vol. 15, No. 4, (1993) 353–363.
Fusiello, A., Roberto, V., Trucco, E.: Efficient Stereo with Multiple Windowing, Proceeding of CVPR, (1997) 858–863
Scharstein, R., Szeliski, R.: Stereo Matching with Nonlinear Diffusion, International Journal of Computer Vision, Vol. 28, No. 2, July (1998) 155–174.
Fua, P.: A Parallel Stereo Algorithm that Produces Dense Depth Maps and Preserves Image Features, Machine Vision and Application, Vol. 6, No. 1, (1993) 35–49.
Okutomi, M., Katayama, Y., Oka, S.: A Simple Algorithm to Recover Precise Object Boundaries and Smooth Surface, IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’2001), Vol. 2, (2001) 138–144.
Marr, D., Poggio, T.: Cooperative Computation of Stereo Disparity, Science, Vol. 194, Oct. (1976) 283–287.
Jeon, J., Kim, K., Kim, C., Ho, Y. S.: A Robust Stereo-Matching Algorithm Using Multiple-Baseline Cameras, IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM 2001), Vol. I, Aug. (2001) 263–266.
Kang, S.B., Szeliski, R., Chai, J,: Handling Occlusions in Dense Multi-View Stereo, Technical Report MSR-TR-2001-80, Microsoft Research, Sept. (2001).
Gonzalez, G. C., Woods, R. E.: Digital Image Processing, Addison Wesley (1992).
Frei, W., Chen, C. C.: Fast Boundary Detection: A Generalization and a New Algorithm, IEEE Transaction on Computers, Vol. C-26, No. 10, Oct. (1977) 988–998.
Tsai, R.Y.: A versatile Camera Calibration Technique for High-Accuracy 3D Machine Vision Metrology Using Off-the-Self TV Cameras and Lenses, IEEE Journal of Robotics and Automation, Vol. RA-3, No. 4, Aug. (1987) 323–344.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jeon, J., Kim, C., Ho, YS. (2002). Stereo for Recovering Sharp Object Boundaries. In: Shafazand, H., Tjoa, A.M. (eds) EurAsia-ICT 2002: Information and Communication Technology. EurAsia-ICT 2002. Lecture Notes in Computer Science, vol 2510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36087-5_29
Download citation
DOI: https://doi.org/10.1007/3-540-36087-5_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00028-0
Online ISBN: 978-3-540-36087-2
eBook Packages: Springer Book Archive