Method for Data Segmentation using Laplacian Graphs
作者： Fatih Porikli , Feng Li
DOI:
关键词:
摘要: A method segments n-dimensional by first determining prior information from the data. fidelity term is determined information, and data are represented as a graph. graph Laplacian graph, spectrum constraint Laplacian. Then, an objective function minimized according to identify segment of target points in
lens.org 参考文章(8)
Daniel Lischinski, Yair Weiss, Anat Levin, Closed form method and system for matting a foreground object in an image having a background ,(2009)
Leo Grady, Chenyang Xu, Fast graph cuts: a weak shape assumption provides a fast exact method for graph cuts segmentation ,(2006)
Ali Kemal Sinop, Leo Grady, Globally optimal uninitialized graph-based rectilinear shape segmentation ,(2007)
Kai Xu, Hao Zhang, Daniel Cohen-Or, Yueshan Xiong, Technical Section: Dynamic harmonic fields for surface processing Computers & Graphics. ,vol. 33, pp. 391- 398 ,(2009) , 10.1016/J.CAG.2009.03.022
A. Bhusnurmath, C.J. Taylor, Graph Cuts via $\ell_1$ Norm Minimization IEEE Transactions on Pattern Analysis and Machine Intelligence. ,vol. 30, pp. 1866- 1871 ,(2008) , 10.1109/TPAMI.2008.82
Matthew E. Brand, Method for generating a low-dimensional representation of high-dimensional data ,(2004)
Gary L. Miller, David Allen Tolliver, Method for partitioning combinatorial graphs ,(2008)
Thomas Schiwietz, Leo Grady, Shmuel Aharon, GPU accelerated multi-label digital photo and video editing ,(2005)