Fast Nearest Neighbor Search in Medical Image Databases

dc.contributor.authorKorn, Flipen_US
dc.contributor.authorSidiropoulos, N.en_US
dc.contributor.authorFaloutsos, Christosen_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T10:01:22Z
dc.date.available2007-05-23T10:01:22Z
dc.date.issued1996en_US
dc.description.abstractWe examine the problem of finding similar tumor shapes. Starting from a natural similarity function (the so-called ax morphological distance'), we showed how to lower-bound it and how to search for nearest neighbors in large collections of tumor- like shapes.<P>Specifically, we used state-of-the-art concepts from morphology, namely the attern spectrum' of a shape, to map each shape to a point in n-dimensional space. Following [19, 36], we organized the n-d points in an R-tree. We showed that the L (= max) norm in the n-d space lower-bounds the actual distance. This guarantees no false dismissals for range queries. In addition, we developed a nearest neighbor algorithm that also guarantees no false dismissals.<P>Finally, we implemented the method, and we tested it against a testbed of realistic tumor shapes, using an established tumor-growth model of Murray Eden [15]. The experiments showed that our method is up to 27 times faster than straightforward sequential scanning.<P>en_US
dc.format.extent1364727 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/5743
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1996-13en_US
dc.subjectsignal processingen_US
dc.subjectdatabasesen_US
dc.subjectfeature extractionen_US
dc.subjectmedical information systemsen_US
dc.subjectaccess methodsen_US
dc.subjectSystems Integration Methodologyen_US
dc.titleFast Nearest Neighbor Search in Medical Image Databasesen_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR_96-13.pdf
Size:
1.3 MB
Format:
Adobe Portable Document Format