學術產出-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

  • No doi shows Citation Infomation
題名 3D-List: A Data Structure for Efficient Video Query Processing
作者 陳良弼
Liu,C. C.
Chen,Arbee L. P.
貢獻者 資科系
日期 2002
上傳時間 21-Aug-2014 14:54:30 (UTC+8)
摘要 In this paper, a video query model based on the content of video and iconic indexing is proposed. We extend the notion of two-dimensional strings to three-dimensional strings (3D-Strings) for representing the spatial and temporal relationships among the symbols in both a video and a video query. The problem of video query processing is then transformed into a problem of three-dimensional pattern matching. To efficiently match the 3D-Strings, a data structure, called 3D-List, and its related algorithms are proposed. In this approach, the symbols of a video in the video database are retrieved from the video index and organized as a 3D-List according to the 3D-String of the video query. The related algorithms are then applied on the 3D-List to determine whether this video is an answer to the video query. Based on this approach, we have started a project called Vega. In this project, we have implemented a user friendly interface for specifying video queries, a video index tool for constructing the video index, and a video query processor based on the notion of 3D-List. Some experiments are also performed to show the efficiency and effectiveness of the proposed algorithms.
關聯 IEEE Transactions on Knowledge and Data Engineering (EI,SCI),14(1),106-122
資料類型 article
dc.contributor 資科系en_US
dc.creator (作者) 陳良弼zh_TW
dc.creator (作者) Liu,C. C.en_US
dc.creator (作者) Chen,Arbee L. P.en_US
dc.date (日期) 2002en_US
dc.date.accessioned 21-Aug-2014 14:54:30 (UTC+8)-
dc.date.available 21-Aug-2014 14:54:30 (UTC+8)-
dc.date.issued (上傳時間) 21-Aug-2014 14:54:30 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/69133-
dc.description.abstract (摘要) In this paper, a video query model based on the content of video and iconic indexing is proposed. We extend the notion of two-dimensional strings to three-dimensional strings (3D-Strings) for representing the spatial and temporal relationships among the symbols in both a video and a video query. The problem of video query processing is then transformed into a problem of three-dimensional pattern matching. To efficiently match the 3D-Strings, a data structure, called 3D-List, and its related algorithms are proposed. In this approach, the symbols of a video in the video database are retrieved from the video index and organized as a 3D-List according to the 3D-String of the video query. The related algorithms are then applied on the 3D-List to determine whether this video is an answer to the video query. Based on this approach, we have started a project called Vega. In this project, we have implemented a user friendly interface for specifying video queries, a video index tool for constructing the video index, and a video query processor based on the notion of 3D-List. Some experiments are also performed to show the efficiency and effectiveness of the proposed algorithms.en_US
dc.format.extent 104 bytes-
dc.format.mimetype text/html-
dc.language.iso en_US-
dc.relation (關聯) IEEE Transactions on Knowledge and Data Engineering (EI,SCI),14(1),106-122en_US
dc.title (題名) 3D-List: A Data Structure for Efficient Video Query Processingen_US
dc.type (資料類型) articleen