cvpr cvpr2013 cvpr2013-437 cvpr2013-437-reference knowledge-graph by maker-knowledge-mining

437 cvpr-2013-Towards Fast and Accurate Segmentation


Source: pdf

Author: Camillo Jose Taylor

Abstract: In this paper we explore approaches to accelerating segmentation and edge detection algorithms based on the gPb framework. The paper characterizes the performance of a simple but effective edge detection scheme which can be computed rapidly and offers performance that is competitive with the pB detector. The paper also describes an approach for computing a reduced order normalized cut that captures the essential features of the original problem but can be computed in less than half a second on a standard computing platform.


reference text

[1] P. R. Amestoy, T. A. Davis, and I. S. Duff. Algorithm 837: Amd, an approximate minimum degree ordering algorithm. ACM Trans. Math. Softw., 30(3):381–388, Sept. 2004.

[2] P. Arbelaez, M. Maire, C. Fowlkes, and J. Malik. From contours to regions: An empirical evaluation. In Computer Vision and Pattern Recognition, 2009. CVPR 2009. IEEE Conference on, pages 2294 –2301, 2009.

[3] P. Arbelaez, M. Maire, C. Fowlkes, and J. Malik. Contour detection and hierarchical image segmentation. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 33(5):898–916, May 2011.

[4] L. Bertelli, B. Sumengen, B. S. Manjunath, and F. Gibou. A variational framework for multiregion pairwise-similaritybased image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 30(8): 1400–1414, August 2008.

[5] B. Catanzaro, B.-Y. Su, N. Sundaram, Y. Lee, M. Murphy, and K. Keutzer. Efficient, high-quality image contour detection. In IEEE International Conference on Computer Vision,

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

[14] pages 2381–2388, October 2009. D. Comaniciu and P. Meer. Mean shift: A robust approach toward feature space analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24:603–619, 2002. T. Cour, F. Benezit, and J. Shi. Spectral segmentation with multiscale graph decomposition. In Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on, volume 2, pages 1124 – 1 13 1 vol. 2, 2005. P. F. Felzenszwalb and D. P. Huttenlocher. Efficient graph-based image segmentation. Int. J. Comput. Vision, 59(2): 167–181, 2004. C. Fowlkes, S. Belongie, F. Chung, and J. Malik. Spectral grouping using the nystrom method. Pattern Analysis andMachine Intelligence, IEEE Transactions on, 26(2):214– 225, 2004. G. H. Golub and C. F. V. Loan. Matrix Computations. The Johns Hopkins University Press, 3rd edition, 1996. P. Meer and B. Georgescu. Edge detection with embedded confidence. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(12): 135 1–1365, December 2001 . X. Ren and L. Bo. Discriminatively trained sparse code gradients for contour detection. In Neural Information Processing Systems (NIPS), December 2012. E. Sharon, M. Galun, D. Sharon, R. Basri, and A. Brandt. Hierarchy and adaptivity in segmenting visual scenes. Nature, 442:810–813, 2006. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22:888–905, 1997. 111999222200