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.
Bryan R. Conroy, Peter J. Ramadge