Back to Results
First PageMeta Content
Matrix theory / Image processing / Computer vision / Eigenvalues and eigenvectors / Singular value decomposition / Segmentation / Graph partition / Laplacian matrix / GrabCut / Algebra / Mathematics / Linear algebra


Biased Normalized Cuts Subhransu Maji1 , Nisheeth K. Vishnoi2, and Jitendra Malik1 University of California, Berkeley1 Microsoft Research India, Bangalore2 [removed], [removed], malik@eecs.
Add to Reading List

Document Date: 2011-05-17 19:35:55


Open Document

File Size: 1,86 MB

Share Result on Facebook

Company

IBM / LG / Cambridge University Press / MIT Press / Google Inc. / /

Country

United Kingdom / /

/

Facility

Jitendra Malik1 University of California / /

IndustryTerm

purpose hardware / real valued solution / constrained points avoiding solutions / min-cut algorithm / energy minimization / spectral solution / min-cut/max-flow algorithms / Nearly-linear time algorithms / parametric maximum flow algorithm / feasible solution / final solution / constrained cut solution / biased cut solution / computing / linear systems / spectral algorithm / /

Organization

Cambridge University / University of California / American Mathematical Society / MIT / /

Person

C. Rother / V / Blake / Malik / PASCAL VOC / Pablo Arbelaez / Ai / Shi / G. Gallo / L. Van Gool / /

Position

author / /

ProvinceOrState

California / /

PublishedMedium

ACM Transactions on Graphics / Mathematical Journal / /

Technology

min-cut algorithm / spectral algorithm / parametric maximum flow algorithm / Nearly-linear time algorithms / min-cut/max-flow algorithms / machine learning / /

SocialTag