Results 1 -
6 of
6
Balancing Deformability and Discriminability for Shape Matching
"... Abstract. We propose a novel framework, aspect space, to balance deformability and discriminability, which are often two competing factors in shape and image representations. In this framework, an object is embedded as a surface in a higher dimensional space with a parameter named aspect weight, whi ..."
Abstract
-
Cited by 4 (1 self)
- Add to MetaCart
Abstract. We propose a novel framework, aspect space, to balance deformability and discriminability, which are often two competing factors in shape and image representations. In this framework, an object is embedded as a surface in a higher dimensional space with a parameter named aspect weight, which controls the importance of intensity in the embedding. We show that this framework naturally unifies existing important shape and image representations by adjusting the aspect weight and the embedding. More importantly, we find that the aspect weight implicitly controls the degree to which a representation handles deformation. Based on this idea, we present the aspect shape context, which extends shape context-based descriptors and adaptively selects the “best ” aspect weight for shape comparison. Another observation we have is the proposed descriptor nicely fits context-sensitive shape retrieval. The proposed methods are evaluated on two public datasets, MPEG7-CE-Shape-1 and Tari 1000, in comparison to state-of-the-art solutions. In the standard shape retrieval experiment using the MPEG7 CE-Shape-1 database, the new descriptor with context information achieves a bull’s eye score of 95.96%, which surpassed all previous results. In the Tari 1000 dataset, our methods significantly outperform previous tested methods as well. 1
Object Recognition”.
, 2009
"... This work fullfils 7 of the 8 criteria for human competitiveness: (A) The result was patented as an invention in the past, is an improvement over a patented invention, or would qualify today as a patentable new invention. (B) The result is equal to or better than a result that was accepted as a new ..."
Abstract
- Add to MetaCart
This work fullfils 7 of the 8 criteria for human competitiveness: (A) The result was patented as an invention in the past, is an improvement over a patented invention, or would qualify today as a patentable new invention. (B) The result is equal to or better than a result that was accepted as a new scientific result at the time when it was published in a peer-reviewed scientific journal. (C) The result is equal to or better than a result that was placed into a database or archive of results maintained by an internationally recognized panel of scientific experts. (D) The result is publishable in its own right as a new scientific result 3/4 independent of the fact that the result was mechanically created. (E) The result is equal to or better than the most recent human-created solution to a long-standing problem for which there has been a succession of increasingly better human-created solutions. (F) The result is equal to or better than a result that was considered an achievement in its field at the time it was first discovered. (G) The result solves a problem of indisputable difficulty in its field.
Genetic Programming as Strategy for Learning Image Descriptor Operators
, 2012
"... Nowadays, object recognition based on local invariant features is widely acknowledged as one of the best paradigms for object recognition due to its robustness for solving image matching across different views of a given scene. This paper proposes a new approach for learning invariant region descrip ..."
Abstract
- Add to MetaCart
Nowadays, object recognition based on local invariant features is widely acknowledged as one of the best paradigms for object recognition due to its robustness for solving image matching across different views of a given scene. This paper proposes a new approach for learning invariant region descriptor operators through genetic programming and introduces another optimization method basedonahill-climbingalgorithm with multiplere-starts. Theapproach relies on the synthesis of mathematical expressions that extract information derived from local image patches called local features. These local features have been previously designed by human experts using traditional representations that have a clear and, preferably mathematically, well-founded definition. We propose in this paper that the mathematical principles that are used in the description of such local features could be well optimized using a genetic programming paradigm. Experimental results confirm the validity of our approach using a widely accepted testbed that is used for testing local descriptor algorithms. In addition, we compare our results not only against three state-of-the-art algorithms designed by human experts, but also, against a simpler search method for automatically generating programs such as hill-climber. Furthermore, we provide results that illustrate the performance of our improved SIFT algorithms using an object recognition application for indoor and outdoor scenarios.
Deformation and Illumination Invariant Feature Point Descriptor
"... Recent advances in 3D shape recognition have shown that kernels based on diffusion geometry can be effectively used to describe local features of deforming surfaces. In this paper, we introduce a new framework that allows using these kernels on 2D local patches, yielding a novel feature point descri ..."
Abstract
- Add to MetaCart
Recent advances in 3D shape recognition have shown that kernels based on diffusion geometry can be effectively used to describe local features of deforming surfaces. In this paper, we introduce a new framework that allows using these kernels on 2D local patches, yielding a novel feature point descriptor that is both invariant to non-rigid image deformations and illumination changes. In order to build the descriptor, 2D image patches are embedded as 3D surfaces, by multiplying the intensity level by an arbitrarily large and constant weight that favors anisotropic diffusion and retains the gradient magnitude information. Patches are then described in terms of a heat kernel signature, which is made invariant to intensity changes, rotation and scaling. The resulting feature point descriptor is proven to be significantly more discriminative than state of the art ones, even those which are specifically designed for describing non-rigid image deformations. 1.

