-
Elastic Net Constraints for Shape Matching
AbstractWe consider a parametrized relaxation of the widely adopted quadratic assignment problem (QAP) formulation for minimum distortion correspondence between deformable shapes. In order to control the accuracy/sparsity trade-off we introduce a weighting parameter on the combination of two existing relaxations, namely spectral and
Related Material
[pdf][bibtex]@InProceedings{Rodola_2013_ICCV,
author = {Rodola, Emanuele and Torsello, Andrea and Harada, Tatsuya and Kuniyoshi, Yasuo and Cremers, Daniel},
title = {Elastic Net Constraints for Shape Matching},
booktitle = {Proceedings of the IEEE International Conference on Computer Vision (ICCV)},
month = {December},
year = {2013}
}
These ICCV 2013 papers are the Open Access versions, provided by the Computer Vision Foundation.
Except for the watermark, they are identical to the accepted versions; the final published version of the proceedings is available on IEEE Xplore.
Except for the watermark, they are identical to the accepted versions; the final published version of the proceedings is available on IEEE Xplore.
This material is presented to ensure timely dissemination of scholarly and technical work.
Copyright and all rights therein are retained by authors or by other copyright holders.
All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.