Adaptive partitioning strategies for ternary tree structures
Pattern Recognition LettersPublished 1 September 1991
Jeffrey Uhlmann
Citations6
SJR quartileQ1
SJR score1.00
SNIP1.43
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
Test results of three adaptive partition strategies for constructing multidimensional ternary trees are presented, which can be used to efficiently identify correlated measurements with error bounds that can be represented as finite volumes.
Abstract
Test results of three adaptive partition strategies for constructing multidimensional ternary trees are presented. Such trees can be used to efficiently identify correlated measurements with error bounds that can be represented as finite volumes.
Keywords
Computer Science
Communications of the ACMMultidimensional binary search trees used for associative searching
7,467 Citations1975Jon Bentley
The multidimensional binary search tree (or k-d tree) as a data structure for storage of information to be retrieved by associative searches is developed and it is shown to be quite efficient in its storage requirements.
ACM Transactions on Mathematical SoftwareAn Algorithm for Finding Best Matches in Logarithmic Expected Time
2,765 Citations1977Jerome H. Friedman, Jon Bentley +1 more
IEEE Transactions on Aerospace and Electronic SystemsEfficient gating in data association with multivariate Gaussian distributed states
109 Citations1992Joseph B. Collins, Jeffrey Uhlmann
An efficient algorithm for evaluating the (weighted bipartite graph of) associations between two sets of data with Gaussian error, e.g., between a set of measured state vectors and aSet of estimated state vectors is described.