Efficient Access Methods for Temporal Interval Queries of Video Metadata

Простая страница элемента
dc.creatorSioutas,Spyros
dc.creatorTsichlas,Kostas
dc.creatorVassiliadis,Bill
dc.creatorTsolis,Dimitrios
dc.date2007
dc.date.accessioned2024-02-06T12:55:53Z
dc.date.available2024-02-06T12:55:53Z
dc.descriptionIndexing video content is one of the most important problems in video databases. In this paper we present linear time and space algorithms for handling video metadata that represent objects or events present in various frames of the video sequence. To accomplish this, we make a straightforward reduction of this problem to the intersection problem in Computational Geometry. Our first result is an improvement over the one of V. S. Subrahmanian [Subramanian, 1998] by a logarithmic factor in storage. This is achieved by using different basic data structures. Then, we present two other interesting time-efficient approaches. Finally a reduction to a special geometric problem is considered according to which we can achieve two optimal in time and space solutions in main and external memory model of computation respectively. We also present an extended experimental evaluation.
dc.formattext/html
dc.identifierhttps://doi.org/10.3217/jucs-013-10-1411
dc.identifierhttps://lib.jucs.org/article/28862/
dc.identifier.urihttps://openrepository.mephi.ru/handle/123456789/9496
dc.languageen
dc.publisherJournal of Universal Computer Science
dc.relationinfo:eu-repo/semantics/altIdentifier/eissn/0948-6968
dc.relationinfo:eu-repo/semantics/altIdentifier/pissn/0948-695X
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightsJ.UCS License
dc.sourceJUCS - Journal of Universal Computer Science 13(10): 1411-1433
dc.subjectvideo databases
dc.subjectdata structures
dc.subjectcomputational geometry
dc.titleEfficient Access Methods for Temporal Interval Queries of Video Metadata
dc.typeResearch Article
Файлы
Коллекции
Публикации в журналах НИЯУ МИФИ