| | This Article | |
| |
| |
| | Share | |
| |
| |
| | Bibliographic References | |
| |
| |
| | Add to: | |
| |
 Digg
 Furl
 Spurl
 Blink
 Simpy
 Google
 Del.icio.us
 Y!MyWeb
| |
| | Search | |
| |
| |
| | |
A Variable Window Approach to Early Vision
December 1998 (vol. 20 no. 12)
pp. 1283-1294
Abstract—Early vision relies heavily on rectangular windows for tasks such as smoothing and computing correspondence. While rectangular windows are efficient, they yield poor results near object boundaries. We describe an efficient method for choosing an arbitrarily shaped connected window, in a manner that varies at each pixel. Our approach can be applied to several problems, including image restoration and visual correspondence. It runs in linear time, and takes a few seconds on traditional benchmark images. Performance on both synthetic and real imagery appears promising.
[1] 1283 S. Barnard, "Stochastic Stereo Matching Over Scale," Int'l J. Computer Vision, vol. 3, no. 1, pp. 17-32, 1989.[2] P.J. Besl,J. B. Birch,, and L.T. Watson,“Robust window operators,” Proc. 2nd Int’l Conf. on Computer Vision, pp. 591-600, 1988.[3] R. Bolles, H. Baker, and M. Hannah, "The JISCT Stereo Evaluation," DARPA Image Understanding Workshop, pp. 263-274, 1993.[4] Y. Boykov, O. Veksler, and R. Zabih, Markov Random Fields with Efficient Approximations Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 648-655, 1998.[5] I. Cox, S. Hingorani, S. Rao, and B. Maggs, "A Maximum Likelihood Stereo Algorithm," Computer Vision, Graphics, and Image Processing, vol. 63, no. 3, pp. 542-567, 1996.[6] I. Cox, S. Roy, and S. Hingorani, "Dynamic Histogram Warping Of Image Pairs For Constant Image Brightness," IEEE Int'l Conf. Image Processing, 1995. Extended version available as an NEC technical report. [7] S. Geman and D. Geman, "Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration pf Images," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, pp. 721-741, 1984.[8] M.A. Gennert, "Brightness-Based Stereo Matching," Proc. Int'l Conf. Computer Vision, pp. 139-143, 1988.[9] D. Greig, B. Porteous, and A. Seheult, "Exact Maximum A Posteriori Estimation for Binary Images," J. Royal Statistical Soc., Series B, vol. 51, no. 2, pp. 271-279, 1989.[10] M. Hanna, "Computer Matching of Areas in Stereo Images," PhD thesis, Stanford Univ., 1974.[11] B.K.P. Horn and B. Schunk, "Determining Optical Flow," Artificial Intelligence, vol. 17, pp. 185-203, 1981.[12] H. Ishikawa and D. Geiger, Segmentation by Grouping Junctions Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 125-131, 1998.[13] D. Jones and J. Malik, "A Computational Framework for Determining Stereo Correspondence From a Set of Linear Spatial Filters," Second European Conf. Computer Vision, pp. 395-410, 1992.[14] T. Kanade and M. Okutomi, “A Stereo Matching Algorithm with an Adaptive Window: Theory and Experiment,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, pp. 920-932, 1994.[15] J. Little, "Accurate Early Detection of Discontinuities," Vision Interface, pp. 97-102, 1992.[16] P. Meer, D. Mintz, A. Rosenfeld, and D. Kim, "Robust Regression Methods for Computer Vision: A Review," Int'l J. Computer Vision, vol. 6, no. 1, pp. 59-70, 1991.[17] S. Negahdaripour and C. H. Yu, "A Generalized Brightness Change Model for Computing Optical Flow," Proc. Int'l Conf. Computer Vision,Germany, 1993.[18] M. Okutomi and T. Kanade, “A Multiple-Baseline Stereo,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 4, pp. 353-363, Apr. 1993.[19] T. Poggio, V. Torre, and C. Koch, "Computational Vision and Regularization Theory," Nature, vol. 317, pp. 314-319, 1985.[20] R. Potts, "Some Generalized Order-Disorder Transformation," Proc. Cambridge Philosophical Soc., vol. 48, pp. 106-109, 1952.[21] P. Rousseeuw and A. Leroy, Robust Regression and Outlier Detection.New York: Wiley, 1987.[22] C.V. Stewart, “MINPRAN: A New Robust Estimator for Computer Vision,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 10, pp. 925-938, Oct. 1995.[23] R. Szeliski and G. Hinton, "Solving Random-Dot Stereograms Using the Heat Equation," IEEE Conf. Computer Vision and Pattern Recognition, pp. 284-288, 1985.[24] R. Tarjan, "Depth First Search and Linear Graph Algorithms," SIAM J. Computing, vol. 1, no. 2, pp. 146-160, 1972.
Index Terms:
Image restoration, motion, stereo, adaptive windows, visual correspondence.
Citation:
Yuri Boykov, Olga Veksler, Ramin Zabih, "A Variable Window Approach to Early Vision," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 20, no. 12, pp. 1283-1294, Dec. 1998, doi:10.1109/34.735802
