Can an arbitrary graph be embedded in Euclidean space so that the isometry group of its vertex set is precisely its graph automorphism group? This paper gives an affirmative answe...
The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding...
This paper focuses on the detection of objects with Lambertian surface under both varying dlumination and pose We offer to apply a novel detection method that proceeds by modeling...
In this paper we present a new method for alignment of 3D models. This approach is based on symmetry properties, and uses the fact that the principal components analysis (PCA) hav...
A number of problems frequently encountered in brain image analysis can be conveniently solved within a registration framework, such as alignment of mono- or multi-sequence Magnet...