2009 IEEE Conference on Computer Vision and Pattern Recognition (2009)
Miami, FL, USA
June 20, 2009 to June 25, 2009
Linli Xu , Dept. of Comput. Sci., Univ. of Alberta, Edmonton, AB, Canada
Wenye Li , Dept. of Comput. Sci., Univ. of Alberta, Edmonton, AB, Canada
D. Schuurmans , Dept. of Comput. Sci., Univ. of Alberta, Edmonton, AB, Canada
Normalized cut is a widely used technique for solving a variety of problems. Although finding the optimal normalized cut has proven to be NP-hard, spectral relaxations can be applied and the problem of minimizing the normalized cut can be approximately solved using eigen-computations. However, it is a challenge to incorporate prior information in this approach. In this paper, we express prior knowledge by linear constraints on the solution, with the goal of minimizing the normalized cut criterion with respect to these constraints. We develop a fast and effective algorithm that is guaranteed to converge. Convincing results are achieved on image segmentation tasks, where the prior knowledge is given as the grouping information of features.
image segmentation, fast normalized cut, linear constraints, NP-hard problems, spectral relaxations, eigencomputations
Wenye Li, Linli Xu and D. Schuurmans, "Fast normalized cut with linear constraints," 2009 IEEE Conference on Computer Vision and Pattern Recognition(CVPR), Miami, FL, USA, 2009, pp. 2866-2873.