The grouped two-sided orthogonal Procrustes problem

Bryan R. Conroy, Peter Jeffrey Ramadge

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

We pose a modified version of the two-sided orthogonal Procrustes problem subject to a grouping constraint, and offer an efficient solution method. This problem has applications in weighted graph matching. Simulation results indicate that the algorithm can effectively use the grouping information to greatly improve estimation accuracy in the presence of noise.

Original languageEnglish (US)
Title of host publication2011 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011 - Proceedings
Pages3688-3691
Number of pages4
DOIs
StatePublished - Aug 18 2011
Event36th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011 - Prague, Czech Republic
Duration: May 22 2011May 27 2011

Publication series

NameICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
ISSN (Print)1520-6149

Other

Other36th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011
CountryCzech Republic
CityPrague
Period5/22/115/27/11

All Science Journal Classification (ASJC) codes

  • Software
  • Signal Processing
  • Electrical and Electronic Engineering

Keywords

  • Greedy algorithms
  • Optimization methods
  • Pattern recognition

Cite this

Conroy, B. R., & Ramadge, P. J. (2011). The grouped two-sided orthogonal Procrustes problem. In 2011 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011 - Proceedings (pp. 3688-3691). [5947151] (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings). https://doi.org/10.1109/ICASSP.2011.5947151