One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
Ali Shokoufandeh, Yakov Keselman, M. Fatih Demirci...
Abstract. In this work we introduce a new technique for a frequently encountered problem in computer vision: image registration. The registration is computed by matching features, ...
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
-- A new Dominant Color Structure Descriptor (DCSD) is proposed in this paper. It is designed to provide an efficient way to represent both color and spatial structure information ...
— An important problem in color based image retrieval is the lack of efficient way to represent both the color and the spatial structure information with single descriptor. To so...