Package boofcv.alg.feature.associate

Class AssociateGreedyDesc_MT<D>

java.lang.Object

boofcv.alg.feature.associate.AssociateGreedyBase<D>

boofcv.alg.feature.associate.AssociateGreedyDescBase<D>

boofcv.alg.feature.associate.AssociateGreedyDesc_MT<D>

Type Parameters:

D - Feature description type.

@Generated("boofcv.alg.feature.associate.AssociateGreedyDesc")
public class AssociateGreedyDesc_MT<D>
extends AssociateGreedyDescBase<D>

Brute force greedy association for objects described by a TupleDesc_F64. An object is associated with whichever object has the best fit score and every possible combination is examined. If there are a large number of features this can be quite slow.

Optionally, backwards validation can be used to reduce the number of false associations. Backwards validation works by checking to see if two objects are mutually the best association for each other. First an association is found from src to dst, then the best fit in dst is associated with feature in src.

Constructor Summary

Constructors

Constructor	Description
AssociateGreedyDesc_MT(ScoreAssociation<D> score)	Configure association

Method Summary

Modifier and Type	Method	Description
void	associate(FastAccess<D> src, FastAccess<D> dst)	Associates the two sets objects against each other by minimizing fit score.

Methods inherited from class boofcv.alg.feature.associate.AssociateGreedyBase

forwardsBackwards, setMaxFitError, setupForAssociate

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

AssociateGreedyDesc_MT

public AssociateGreedyDesc_MT(ScoreAssociation<D> score)

Configure association

Parameters:

score - Computes the association score.

Method Details

associate

public void associate(FastAccess<D> src,
 FastAccess<D> dst)

Associates the two sets objects against each other by minimizing fit score.

Specified by:

associate in class AssociateGreedyDescBase<D>

Parameters:

src - Source list.

dst - Destination list.