We present a new L1-distance-based k-means clustering algorithm to address the challenge of clustering high-dimensional proportional vectors. The new algorithm explicitly incorpor...
Bonnie K. Ray, Hisashi Kashima, Jianying Hu, Monin...
In kernel density estimation methods, an approximation of the data probability density function is achieved by locating a kernel function at each data location. The smoothness of ...
Directional features are preferred in off-line Chinese character recognition due to their superior performance. This paper proposes an enhanced four plane feature (en-FPF) within ...
Given a query iris image, the goal of indexing is to identify and retrieve a small subset of candidate irides from the database in order to determine a possible match. This can si...
This paper investigates several issues in the problem of detecting handwritten markings, or annotations, on printed documents. One issue is to define the appropriate units over wh...