Search space partitioning using convex hull and concavity features for fast medical image retrieval

Nikolay M. Sirakov, Phillip A. Mlsna

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Scopus citations

Abstract

A new approach is presented for partitioning an image database by classifying and indexing the convex hull shapes and the concavity features of regions. The result is a significant increase in image search and retrieval speed. The convex hull is first determined using a novel and efficient approach based on the geometrical heat differential equation. Next, the convex hull is represented by a triad of boundary shapes and other parameters as viewed from three viewpoints. This information enables the regions in the image database to be divided into 344 convex hull classes. Concavity information, obtained using a boundary support parameterization, further partitions the database. Since a given query must now be compared only to shapes of the same class, searching is much faster. Both theoretical background and practical results are discussed.

Original languageEnglish (US)
Title of host publication2004 2nd IEEE International Symposium on Biomedical Imaging
Subtitle of host publicationMacro to Nano
Pages796-799
Number of pages4
StatePublished - 2004
Event2004 2nd IEEE International Symposium on Biomedical Imaging: Macro to Nano - Arlington, VA, United States
Duration: Apr 15 2004Apr 18 2004

Publication series

Name2004 2nd IEEE International Symposium on Biomedical Imaging: Macro to Nano
Volume1

Other

Other2004 2nd IEEE International Symposium on Biomedical Imaging: Macro to Nano
Country/TerritoryUnited States
CityArlington, VA
Period4/15/044/18/04

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'Search space partitioning using convex hull and concavity features for fast medical image retrieval'. Together they form a unique fingerprint.

Cite this