—The conventional K-Means clustering algorithm must know the number of clusters in advance and the clustering result is sensitive to the selection of the initial cluster centroid...
Jing Xiao, YuPing Yan, Ying Lin, Ling Yuan, Jun Zh...
Abstract. We present an algorithm for automatically constructing a decompositional shape model from examples. Unlike current approaches to structural model acquisition, in which on...
Alex Levinshtein, Cristian Sminchisescu, Sven J. D...
We address the problem of estimating human pose in a single image using a part based approach. Pose accuracy is directly affected by the accuracy of the part detectors but more acc...
We present a planner for the Combat Power Management (CPM) problem. In response to multiple simultaneous or sequential threats, the planner generates a set of local plans, one for...
Abder Rezak Benaskeur, Froduald Kabanza, Eric Beau...
A matrix formulation for an adaptive genetic algorithm is developed using mutation matrix and crossover matrix. Selection, mutation, and crossover are all parameter-free in the se...