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...
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...
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 ...
—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...