2008 IEEE International Conference on Information Reuse and Integration 2008
DOI: 10.1109/iri.2008.4583070
|View full text |Cite
|
Sign up to set email alerts
|

Hierarchical affinity hybrid tree: A multidimensional index structure to organize videos and support content-based retrievals

Abstract: Abstract

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
4
0
1

Year Published

2008
2008
2018
2018

Publication Types

Select...
3
1
1

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(5 citation statements)
references
References 16 publications
0
4
0
1
Order By: Relevance
“…[4] discusses a multidimensional index structure designed to handle images. [5] extends the idea to a hierarchical index structure, supporting video data objects. It can handle the hierarchical relationship among the different video units and facilitate intra and inter-unit retrieval strategies.…”
Section: Replicated Multidimensional Index Structurementioning
confidence: 99%
See 2 more Smart Citations
“…[4] discusses a multidimensional index structure designed to handle images. [5] extends the idea to a hierarchical index structure, supporting video data objects. It can handle the hierarchical relationship among the different video units and facilitate intra and inter-unit retrieval strategies.…”
Section: Replicated Multidimensional Index Structurementioning
confidence: 99%
“…We chose AH-Tree as we wanted to use images as the test bed for developing and testing the initial framework of the distributed multimedia database. It should be pointed out here that both [5] as well as [6] can be used in the proposed framework without any loss of generality.…”
Section: Replicated Multidimensional Index Structurementioning
confidence: 99%
See 1 more Smart Citation
“…Three different types of queries are executed, namely queries involving only images, queries involving only videos, and queries involving both images and videos. The results obtained from GeM-Tree are compared with a distance-based index structure for only images [45] (labeled as I in Tables 4.3 to 4.5), a distance-based index structure for only videos [48] (labeled as II in Tables 4.3 Essentially, I and II have the same framework as GeM-Tree. The only difference is that in this experimental setup, while GeM-Tree indexes a data corpus having both images and videos, I and II indexes a data corpus having only images and videos respectively.…”
Section: Empirical Studymentioning
confidence: 99%
“…Para garantir uma resposta rápida, é imperativo o desenvolvimento de algoritmos de busca por similaridade que acelerem esse processo. Elaboradas estruturas de dados, conhecidas como métodos de acesso (MAs), têm sido propostas a fim de acelerar buscas por similaridade [44,45,47,65,94]. No entanto, a maioria desses métodos sofre de um problema conhecido como maldição da dimensionalidade (do inglês, curse of dimensionality): na medida em que aumenta a dimensionalidade dos dados, as estruturas de indexação desses métodos tornam-se lentas e grandes demais [174].…”
Section: Introductionunclassified