IEEE Transactions on Knowledge and Data Engineering · 1998 · 161 citations · 51 references
ComputingComputer ScienceOncologyComputational GeometryData StructuresInformation RetrievalFeature DescriptionMedical Image AnalysisNearest Neighbor SearchRange SearchingShape AnalysisShape RepresentationMathematical MorphologyNearest Neighbor MatchingNearest Neighbor QueriesRange QueriesRetrievalShape FeaturesShape MatchingShape Retrieval
Investigates the problem of retrieving similar shapes from a large database; in particular, we focus on medical tumor shapes (finding tumors that are similar to a given pattern). We use a natural similarity function for shape matching, based on concepts from mathematical morphology, and we show how it can be lower-bounded by a set of shape features for safely pruning candidates, thus giving fast and correct output. These features can be organized in a spatial access method, leading to fast indexing for range queries and nearest-neighbor queries. In addition to the lower-bounding, our second contribution is the design of a fast algorithm for nearest-neighbor searching, achieving significant speedup while provably guaranteeing correctness. Our experiments demonstrate that roughly 90% of the candidates can be pruned using these techniques, resulting in up to 27 times better performance compared to sequential scanning.
51
Colin Goodall, Ian T. Jolliffe · Technometrics · 1988 · 8.7K citations
Multidimensional binary search trees used for associative searching
Jon Bentley · Communications of the ACM · 1975 · 7.5K citations · Full text
The R*-tree: an efficient and robust access method for points and rectangles
Norbert Beckmann, Hans‐Peter Kriegel, Ralf Schneider et al. · 1990 · 4.2K citations · Full text