Pareto-optimal Dictionaries for Signatures

We present an effective method to optimize over the parameters of an image patch descriptor to obtain one that is computationally more efficient while maintaining a high recognition rate. We formulate the optimization problem in a multi-objective manner, which balances two conflicting goals while removing the need for traditional weighting coefficients. To this end we introduce the Pareto efficiency criterion, which helps finding solutions that increase one objective without decreasing the other. Despite the vast size of the search space, we show how a state-of-the-art Genetic Algorithm can be tailored to find good solutions.


Published in:
Conference On Computer Vision And Pattern Recognition (CVPR), 3011-3018
Presented at:
Conference on Computer Vision and Pattern Recognition (CVPR), San Francisco, CA, Jun 13-18, 2010
Year:
2010
Publisher:
IEEE
Laboratories:




 Record created 2011-12-16, last modified 2018-01-28

External link:
Download fulltext
n/a
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)