nips nips2001 nips2001-89 nips2001-89-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Stella X. Yu, Jianbo Shi
Abstract: With the optimization of pattern discrimination as a goal, graph partitioning approaches often lack the capability to integrate prior knowledge to guide grouping. In this paper, we consider priors from unitary generative models, partially labeled data and spatial attention. These priors are modelled as constraints in the solution space. By imposing uniformity condition on the constraints, we restrict the feasible space to one of smooth solutions. A subspace projection method is developed to solve this constrained eigenproblema We demonstrate that simple priors can greatly improve image segmentation results. 1
[1] A. Amir· and M. Lindenbaum. Quantitative analysis of grouping process. In European Conference on Computer Vision, pages 371-84, 1996.
[2] A. Blum and S. Chawla. Learning from labeled and unlabeled data using graph mincuts, 2001.
[3] Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. In International Conference on Computer Vision, 1999.
[4] Y. Gdalyahu, D. Weinshall, and M. Werman. A randpmized algorithm for pairwise clustering. ill Neural Information Processing Systems, pages 424-30, 1998.
[5] S. Geman and D. Geman. Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images. IEEE Transactions on Pattern Analysis and Machine Intelligence, 6(6):721-41, 1984.
[6] H. Ishikawa and D. Geiger. Segmentation by grouping junctions. In IEEE Conference on Computer Vision and Pattern Recognition, 1998.
[7] I. H. Jermyn and H. Ishikawa. Globally optimal regions and boundaries. In International Conference on Computer Vision, 1999.
[8] M. Kass, A. Witkin, and D. Terzopoulos. Snakes: Active contour models. International Journal of Computer Vision, pages 321-331, 1988.
[9] J. Malik, S. Belongie, T. Leung, and J. Shi. Contour and texture analysis for image segmentation. International Journal of Computer Vision, 2001.
[10] M. Meila and J. Shi. Learning segmentation with random walk. ill Neural Information Processing Systems, 2001.
[11] P. Perona and W. Freeman. A factorization approach to grouping. In European Conference on Computer Vision, pages 655-70, 1998.
[12] J. Puzicha, T. Hofmann, and J. Buhmann. Unsupervised texture segmentation in a deterministic annealing framework. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(8):803-18, 1998.
[13] S. Roy and I. J. Cox. A maximum-flow formulation of then-camera stereo correspondence problem. In International Conference on Computer Vision, 1998.
[14] E. Sharon, A. Brandt, and R. Basri. Fast multiscale image segmentation. In IEEE Conference on Computer Vision and Pattern Recognition, pages 70-7, 2000.
[15] J. Shi and J. Malik. Normalized cuts and image segmentation. In IEEE Conference on Computer Vision and Pattern Recognition, pages 731-7, June 1997.