Segmentation-based object categorization: Difference between revisions

Revision as of 18:22, 18 July 2008

Revision as of 18:51, 14 August 2008

Line 53:

* <math>y^t D 1 = 0 </math>

Minimizing <math>\frac{y^t (D - W) y}{y^t D y}</math> subject to the constraints above is [[NP-hard]]. To make the problem tractable, we relax the constraints on <math>y</math>, and allow it to take real values. The relaxed problem can be solved by solving the generalized eigenvalue problem <math>(D - W)y = \lambda D y</math>for the second smallest generalized eigenvectoreigenvalue.

'''The partitioning algorithm:'''