Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/17169
Title: A kd-tree based dynamic indexing scheme for video retrieval and geometry matching
Authors: Gao, LI
Li, Z
Katsaggelos, A
Keywords: Image sequences
Principal component analysis
Video retrieval
Issue Date: 2008
Publisher: IEEE
Source: Proceedings of 17th International Conference on Computer Communications and Networks, 2008 : ICCCN '08, 3-7 August 2008, St. Thomas, US Virgin Islands, p. 1-5 How to cite?
Abstract: Efficient indexing is a key in content-based video retrieval solutions. In this paper we propose a new dynamic indexing scheme based on the kd-tree structure. Video sequences are first represented as traces in an appropriate low dimensional space via luminance field scaling and PCA projection. Then, the indexing scheme is applied to give the video database a manageable structure. Being able to handle dynamic video clip insertions and deletions is an essential part of this solution. At the beginning, an ordinary kd-tree is created for the initial database. As new video traces are added to the database, they will be added to the indexing tree structure as well. A tree node will be split if its size exceeds a certain threshold. If the tree structure un-balance level exceeds a threshold, merging and re-splitting will be performed. Preliminary experiments showed that merging and re-splitting will ensure the efficiency of the indexing scheme.
URI: http://hdl.handle.net/10397/17169
ISBN: 978-1-4244-2389-7
978-1-4244-2390-3 (E-ISBN)
ISSN: 1095-2055
DOI: 10.1109/ICCCN.2008.ECP.174
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

4
Last Week
0
Last month
0
Citations as of Oct 16, 2017

Page view(s)

42
Last Week
0
Last month
Checked on Oct 15, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.