| Package | Description |
|---|---|
| spim.process.interestpointregistration | |
| spim.process.interestpointregistration.geometricdescriptor | |
| spim.process.interestpointregistration.geometrichashing |
| Modifier and Type | Method and Description |
|---|---|
Detection[] |
Detection.createArray(int n) |
| Modifier and Type | Method and Description |
|---|---|
ArrayList<PointMatchGeneric<Detection>> |
PairwiseMatch.getCandidates() |
ArrayList<PointMatchGeneric<Detection>> |
PairwiseMatch.getInliers() |
| Modifier and Type | Method and Description |
|---|---|
float |
Detection.distanceTo(Detection o) |
boolean |
Detection.equals(Detection otherDetection) |
| Modifier and Type | Method and Description |
|---|---|
protected static void |
GlobalOpt.addPointMatches(ArrayList<PointMatchGeneric<Detection>> correspondences,
Tile<?> tileA,
Tile<?> tileB) |
static Pair<String,Double> |
RANSAC.computeRANSAC(ArrayList<PointMatchGeneric<Detection>> correspondenceCandidates,
ArrayList<PointMatchGeneric<Detection>> inlierList,
Model<?> model,
double maxEpsilon,
double minInlierRatio,
double minNumberInlierFactor,
int numIterations) |
static Pair<String,Double> |
RANSAC.computeRANSAC(ArrayList<PointMatchGeneric<Detection>> correspondenceCandidates,
ArrayList<PointMatchGeneric<Detection>> inlierList,
Model<?> model,
double maxEpsilon,
double minInlierRatio,
double minNumberInlierFactor,
int numIterations) |
void |
PairwiseMatch.setCandidates(ArrayList<PointMatchGeneric<Detection>> candidates) |
void |
PairwiseMatch.setInliers(ArrayList<PointMatchGeneric<Detection>> inliers,
double error) |
| Modifier and Type | Method and Description |
|---|---|
protected static <D extends AbstractPointDescriptor<Detection,D>> |
RGLDMMatcher.findCorrespondingDescriptors(ArrayList<D> descriptorsA,
ArrayList<D> descriptorsB,
double nTimesBetter,
double differenceThreshold) |
| Modifier and Type | Method and Description |
|---|---|
protected static ArrayList<SimplePointDescriptor<Detection>> |
RGLDMMatcher.createSimplePointDescriptors(KDTree<Detection> tree,
ArrayList<Detection> basisPoints,
int numNeighbors,
Matcher matcher,
SimilarityMeasure similarityMeasure) |
ArrayList<PointMatchGeneric<Detection>> |
RGLDMMatcher.extractCorrespondenceCandidates(ArrayList<Detection> nodeListA,
ArrayList<Detection> nodeListB,
int numNeighbors,
int redundancy,
double ratioOfDistance,
double differenceThreshold) |
protected static <D extends AbstractPointDescriptor<Detection,D>> |
RGLDMMatcher.findCorrespondingDescriptors(ArrayList<D> descriptorsA,
ArrayList<D> descriptorsB,
double nTimesBetter,
double differenceThreshold) |
| Modifier and Type | Method and Description |
|---|---|
protected static ArrayList<SimplePointDescriptor<Detection>> |
RGLDMMatcher.createSimplePointDescriptors(KDTree<Detection> tree,
ArrayList<Detection> basisPoints,
int numNeighbors,
Matcher matcher,
SimilarityMeasure similarityMeasure) |
protected static ArrayList<SimplePointDescriptor<Detection>> |
RGLDMMatcher.createSimplePointDescriptors(KDTree<Detection> tree,
ArrayList<Detection> basisPoints,
int numNeighbors,
Matcher matcher,
SimilarityMeasure similarityMeasure) |
ArrayList<PointMatchGeneric<Detection>> |
RGLDMMatcher.extractCorrespondenceCandidates(ArrayList<Detection> nodeListA,
ArrayList<Detection> nodeListB,
int numNeighbors,
int redundancy,
double ratioOfDistance,
double differenceThreshold) |
ArrayList<PointMatchGeneric<Detection>> |
RGLDMMatcher.extractCorrespondenceCandidates(ArrayList<Detection> nodeListA,
ArrayList<Detection> nodeListB,
int numNeighbors,
int redundancy,
double ratioOfDistance,
double differenceThreshold) |
| Modifier and Type | Method and Description |
|---|---|
ArrayList<PointMatchGeneric<Detection>> |
GeometricHasher.extractCorrespondenceCandidates(ArrayList<Detection> nodeListA,
ArrayList<Detection> nodeListB,
double differenceThreshold,
double ratioOfDistance,
boolean useAssociatedBeads) |
Copyright © 2015–2021 Fiji. All rights reserved.