2012
DOI: 10.1117/12.911292
|View full text |Cite
|
Sign up to set email alerts
|

Efficient similarity search on 3D bounding box annotations

Abstract: Searching for similar image regions in medical databases yields valuable information for diagnosis. However, most of the current approaches are restricted to special cases or they are only available for rather small data stores.In this paper, we propose a fast query pipeline for 3D similarity queries on large databases of computed tomography (CT) scans consisting of minimum bounding box annotations. As these box annotations also contain background information which is not part of the item that was actually ann… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2015
2015

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 18 publications
0
1
0
Order By: Relevance
“…In this paper, an improved bounding box method is used. The traditional bounding box method [19] is divided into three steps: First, search a minimum box which can surround all the points. Next the box is divided into many connected small boxes.…”
Section: Discussionmentioning
confidence: 99%
“…In this paper, an improved bounding box method is used. The traditional bounding box method [19] is divided into three steps: First, search a minimum box which can surround all the points. Next the box is divided into many connected small boxes.…”
Section: Discussionmentioning
confidence: 99%