Sciweavers

2219 search results - page 166 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
171
Voted
ACCV
2007
Springer
15 years 6 months ago
A Convex Programming Approach to the Trace Quotient Problem
Abstract. The trace quotient problem arises in many applications in pattern classification and computer vision, e.g., manifold learning, low-dimension embedding, etc. The task is ...
Chunhua Shen, Hongdong Li, Michael J. Brooks
129
Voted
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
16 years 2 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson
ICCV
2003
IEEE
16 years 6 months ago
Multiclass Spectral Clustering
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
Stella X. Yu, Jianbo Shi
WABI
2009
Springer
162views Bioinformatics» more  WABI 2009»
15 years 11 months ago
Aligning Biomolecular Networks Using Modular Graph Kernels
Comparative analysis of biomolecular networks constructed using measurements from different conditions, tissues, and organisms offer a powerful approach to understanding the stru...
Fadi Towfic, M. Heather West Greenlee, Vasant Hona...
133
Voted
CVPR
2011
IEEE
15 years 26 days ago
Biased Normalized Cuts
We present a modification of “Normalized Cuts” to incorporate priors which can be used for constrained image segmentation. Compared to previous generalizations of “Normaliz...
Subhransu Maji, Nisheeth Vishnoi, Jitendra Malik