Elastic Net Constraints for Shape Matching

Emanuele Rodola, Andrea Torsello, Tatsuya Harada, Yasuo Kuniyoshi, Daniel Cremers

ICCV 2013

doi:10.1109/ICCV.2013.149 /iccv/2013/rodola2013iccv-elastic/

Abstract

We 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

PDF ICCV Semantic Scholar

Cite

Text

Rodola et al. "Elastic Net Constraints for Shape Matching." International Conference on Computer Vision, 2013. doi:10.1109/ICCV.2013.149

Markdown

[Rodola et al. "Elastic Net Constraints for Shape Matching." International Conference on Computer Vision, 2013.](https://mlanthology.org/iccv/2013/rodola2013iccv-elastic/) doi:10.1109/ICCV.2013.149

BibTeX

@inproceedings{rodola2013iccv-elastic,
  title     = {{Elastic Net Constraints for Shape Matching}},
  author    = {Rodola, Emanuele and Torsello, Andrea and Harada, Tatsuya and Kuniyoshi, Yasuo and Cremers, Daniel},
  booktitle = {International Conference on Computer Vision},
  year      = {2013},
  doi       = {10.1109/ICCV.2013.149},
  url       = {https://mlanthology.org/iccv/2013/rodola2013iccv-elastic/}
}