19 search results - page 4 / 4 » On applications of parameterized hyperplane partitioning |
CVPR
2005
IEEE
14 years 7 months ago
2005
IEEE
We optimize over the set of corrected laplacians (CL) associated with a weighted graph to improve the average case normalized cut (NCut) of a graph. Unlike edge-relaxation SDPs, o...
ICCV
2003
IEEE
14 years 7 months ago
2003
IEEE
Dominant sets are a new graph-theoretic concept that has proven to be relevant in partitional (flat) clustering as well as image segmentation problems. However, in many computer v...
CGF
2006
13 years 5 months ago
2006
Level-of-detail modeling is a vital representation for real-time applications. To support texture mapping progressive meshes (PM), we usually allow the whole PM sequence to share ...
ISBI
2009
IEEE
14 years 7 days ago
2009
IEEE
—We present iCluster, a fast and efficient algorithm that clusters a set of images while co-registering them using a parameterized, nonlinear transformation model. The output of...