Geometric Matching
Convolutional Hough Matching
Introduced by Min et al. in Convolutional Hough Matching Networks for Robust and Efficient Visual CorrespondenceConvolutional Hough Matching, or CHM, is a geometric matching algorithm that distributes similarities of candidate matches over a geometric transformation space and evaluates them in a convolutional manner. It is casted into a trainable neural layer with a semi-isotropic high-dimensional kernel, which learns non-rigid matching with a small number of interpretable parameters.
Source: Convolutional Hough Matching Networks for Robust and Efficient Visual Correspondence
Papers
| Paper | Code | Results | Date | Stars |
|---|
Usage Over Time
Components
| Component | Type |
|
|---|---|---|
| 🤖 No Components Found | You can add them if they exist; e.g. Mask R-CNN uses RoIAlign |
