We consider the following graph embedding question: given a graph G, is it possible to map its vertices to points in 3D such that G is isomorphic to the mutual nearest neighbor gra...
Abstract. The expressiveness of a lot of image analysis algorithms depends on the question whether shape information is preserved during digitization. Most existing approaches to a...
Aiming at the task allocation in multi-target tracking of wireless sensor networks, the discrete particle swarm optimization based on nearest-neighbor is presented to reduce the c...
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
Hakan Cevikalp, Diane Larlus, Marian Neamtu, Bill ...