Class GeometricHasher<I extends InterestPoint>
java.lang.Object
net.preibisch.mvrecon.process.interestpointregistration.pairwise.methods.geometrichashing.GeometricHasher<I>
Class that actually computes the geometric hashing
- Author:
- Stephan Preibisch (stephan.preibisch@gmx.de)
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionprotected voidcomputeMatching(ArrayList<LocalCoordinateSystemPointDescriptor<I>> descriptors1, net.imglib2.neighborsearch.KNearestNeighborSearchOnKDTree<LocalCoordinateSystemPointDescriptor<I>> nnsearch2, ArrayList<PointMatchGeneric<I>> correspondences, double differenceThreshold, double ratioOfDistance) static <I extends InterestPoint>
ArrayList<LocalCoordinateSystemPointDescriptor<I>> createLocalCoordinateSystemPointDescriptors(net.imglib2.KDTree<I> tree, Collection<I> basisPoints, int redundancy, boolean normalize) extractCorrespondenceCandidates(ArrayList<I> nodeListA, ArrayList<I> nodeListB, double differenceThreshold, int redundancy, double ratioOfDistance)
-
Constructor Details
-
GeometricHasher
public GeometricHasher()
-
-
Method Details
-
extractCorrespondenceCandidates
-
computeMatching
protected void computeMatching(ArrayList<LocalCoordinateSystemPointDescriptor<I>> descriptors1, net.imglib2.neighborsearch.KNearestNeighborSearchOnKDTree<LocalCoordinateSystemPointDescriptor<I>> nnsearch2, ArrayList<PointMatchGeneric<I>> correspondences, double differenceThreshold, double ratioOfDistance) -
createLocalCoordinateSystemPointDescriptors
public static <I extends InterestPoint> ArrayList<LocalCoordinateSystemPointDescriptor<I>> createLocalCoordinateSystemPointDescriptors(net.imglib2.KDTree<I> tree, Collection<I> basisPoints, int redundancy, boolean normalize)
-