The diameter k-clustering problem is the problem of partitioning a finite subset of Rd into k subsets called clusters such that the maximum diameter of the clusters is minimized. ...
The Earth Mover's Distance (EMD) is a similarity measure that captures perceptual difference between two distributions. Its computational complexity, however, prevents a direc...
Given a unlabelled set of points X ∈ RN belonging to k groups, we propose a method to identify cluster assignments that provides maximum separating margin among the clusters. We...
This paper presents a novel study and analysis on two important problems in gait recognition: one is how to perform gait recognition with only segment of a complete gait cycle for...
We present an algorithm for the segmentation of multicell fluorescence microscopy images. Such images abound and a segmentation algorithm robust to different experimental conditio...