Efficient High Order Matching

@article{Chertok2010EfficientHO,
  title={Efficient High Order Matching},
  author={Michael Chertok and Yosi Keller},
  journal={IEEE Transactions on Pattern Analysis and Machine Intelligence},
  year={2010},
  volume={32},
  pages={2205-2215}
}
We present a computational approach to high-order matching of data sets in Rd. Those are matchings based on data affinity measures that score the matching of more than two pairs of points at a time. High-order affinities are represented by tensors and the matching is then given by a rank-one approximation of the affinity tensor and a corresponding discretization. Our approach is rigorously justified by extending Zass and Shashua's hypergraph matching to high-order spectral matching. This paves… CONTINUE READING
Highly Cited
This paper has 108 citations. REVIEW CITATIONS

18 Figures & Tables

Topics

Statistics

0102030201020112012201320142015201620172018
Citations per Year

109 Citations

Semantic Scholar estimates that this publication has 109 citations based on the available data.

See our FAQ for additional information.