Hough clustering and sparse matrices

asked 2016-06-11 13:49:46 -0500

pietrko gravatar image

updated 2016-06-11 16:37:17 -0500

berak gravatar image

Hi, I would like to implement Hough clustering method described in this
paper.

The whole idea is can be summarized in following way.

  1. Do typical nearest-neighbour matching between set of features from template and image. Obtaining set SM of matched features.
  2. Build 4-dimmensional grid parametrized by object position, scale and rotation, each grid element can contain a feature.
  3. Assign features from SM to grid "points" using feature's internal position, orientation etc.
  4. Pick the grid point that has the most features in it (represents most probable position).

Any suggestion how could I implement this in fastest and easiest way?

Also can I make sparse matrices in openCV with values being arbitrary classes? Or it has to be numerical type?

edit retag flag offensive close merge delete

Comments

"Also can I make sparse matrices in openCV with values being arbitrary classes? "

not really. you can put classes into a Mat, but there has to be a Datatype for it (which is pretty restrictive)

berak gravatar imageberak ( 2016-06-11 16:47:26 -0500 )edit