We present a novel clustering method using HMM parameter space and eigenvector decomposition. Unlike the existing methods, our algorithm can cluster both constant and variable leng...
Abstract Investigating a data set of the critical size makes a classification task difficult. Studying dissimilarity data refers to such a problem, since the number of samples equa...
Elzbieta Pekalska, Marina Skurichina, Robert P. W....
In this paper, we consider the problem of speaker verification as a two-class object detection problem in computer vision, where the object instances are 1-D short-time spectral v...
— This paper introduces the establishment of PolyU Near-Infrared Face Database (PolyU-4 NIRFD) and presents a new coding scheme for face recognition. The PolyU-NIRFD contains ima...
Baochang Zhang, Lei Zhang 0006, David Zhang, Linli...
In this paper, we design linear time algorithms to recognize and determine topological invariants such as genus and homology groups in 3D. These invariants can be used to identify...