A kd-tree based dynamic indexing scheme for video retrieval and geometry matching. Li Gao, Zhu Li, Katsaggelos, A. K A., Gao, L., Li, Z., & Katsaggelos, A. K A. In 2008 Proceedings of 17th International Conference on Computer Communications and Networks, pages 1–5, aug, 2008. IEEE, IEEE. ![A kd-tree based dynamic indexing scheme for video retrieval and geometry matching [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex 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. © 2008 IEEE.
@inproceedings{gao2008kd,
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. {\textcopyright} 2008 IEEE.},
author = {{Li Gao} and {Zhu Li} and Katsaggelos, Aggelos K A.K. and Gao, Li and Li, Zhu and Katsaggelos, Aggelos K A.K.},
booktitle = {2008 Proceedings of 17th International Conference on Computer Communications and Networks},
doi = {10.1109/ICCCN.2008.ECP.174},
isbn = {978-1-4244-2389-7},
issn = {10952055},
month = {aug},
organization = {IEEE},
pages = {1--5},
publisher = {IEEE},
title = {{A kd-tree based dynamic indexing scheme for video retrieval and geometry matching}},
url = {http://ieeexplore.ieee.org/document/4674333/},
year = {2008}
}
Downloads: 0
{"_id":"mZ75cmv2kKpDZWgKW","bibbaseid":"ligao-zhuli-katsaggelos-gao-li-katsaggelos-akdtreebaseddynamicindexingschemeforvideoretrievalandgeometrymatching-2008","author_short":["Li Gao","Zhu Li","Katsaggelos, A. K A.","Gao, L.","Li, Z.","Katsaggelos, A. K A."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","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. © 2008 IEEE.","author":[{"firstnames":[],"propositions":[],"lastnames":["Li Gao"],"suffixes":[]},{"firstnames":[],"propositions":[],"lastnames":["Zhu Li"],"suffixes":[]},{"propositions":[],"lastnames":["Katsaggelos"],"firstnames":["Aggelos","K","A.K."],"suffixes":[]},{"propositions":[],"lastnames":["Gao"],"firstnames":["Li"],"suffixes":[]},{"propositions":[],"lastnames":["Li"],"firstnames":["Zhu"],"suffixes":[]},{"propositions":[],"lastnames":["Katsaggelos"],"firstnames":["Aggelos","K","A.K."],"suffixes":[]}],"booktitle":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","doi":"10.1109/ICCCN.2008.ECP.174","isbn":"978-1-4244-2389-7","issn":"10952055","month":"aug","organization":"IEEE","pages":"1–5","publisher":"IEEE","title":"A kd-tree based dynamic indexing scheme for video retrieval and geometry matching","url":"http://ieeexplore.ieee.org/document/4674333/","year":"2008","bibtex":"@inproceedings{gao2008kd,\nabstract = {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. {\\textcopyright} 2008 IEEE.},\nauthor = {{Li Gao} and {Zhu Li} and Katsaggelos, Aggelos K A.K. and Gao, Li and Li, Zhu and Katsaggelos, Aggelos K A.K.},\nbooktitle = {2008 Proceedings of 17th International Conference on Computer Communications and Networks},\ndoi = {10.1109/ICCCN.2008.ECP.174},\nisbn = {978-1-4244-2389-7},\nissn = {10952055},\nmonth = {aug},\norganization = {IEEE},\npages = {1--5},\npublisher = {IEEE},\ntitle = {{A kd-tree based dynamic indexing scheme for video retrieval and geometry matching}},\nurl = {http://ieeexplore.ieee.org/document/4674333/},\nyear = {2008}\n}\n","author_short":["Li Gao","Zhu Li","Katsaggelos, A. K A.","Gao, L.","Li, Z.","Katsaggelos, A. K A."],"key":"gao2008kd","id":"gao2008kd","bibbaseid":"ligao-zhuli-katsaggelos-gao-li-katsaggelos-akdtreebaseddynamicindexingschemeforvideoretrievalandgeometrymatching-2008","role":"author","urls":{"Paper":"http://ieeexplore.ieee.org/document/4674333/"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://sites.northwestern.edu/ivpl/files/2023/06/IVPL_Updated_publications-1.bib","dataSources":["XasdXLL99y5rygCmq","3gkSihZQRfAD2KBo3","t5XMbyZbtPBo4wBGS","bEpHM2CtrwW2qE8FP","teJzFLHexaz5AQW5z"],"keywords":[],"search_terms":["tree","based","dynamic","indexing","scheme","video","retrieval","geometry","matching","li gao","zhu li","katsaggelos","gao","li","katsaggelos"],"title":"A kd-tree based dynamic indexing scheme for video retrieval and geometry matching","year":2008}