學術產出-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

  • No doi shows Citation Infomation
題名 Efficient Near Neighbor Searching Using Multi-Indexes for Content-Based Multimedia Data Retrieval
作者 陳良弼
LIU,CHIH-CHIN;HSU,JIA-LIEN;CHEN,ARBEE L.P.
貢獻者 資科系
關鍵詞 near neighbor searching; spatial index; content-based multimedia data retrieval; multimedia databases
日期 2001
上傳時間 21-Aug-2014 14:54:02 (UTC+8)
摘要 Many content-based multimedia data retrieval problems can be transformed into the near neighbor searching problem in multidimensional feature space. An efficient near neighbor searching algorithm is needed when developing a multimedia database system. In this paper, we propose an approach to efficiently solve the near neighbor searching problem. In this approach, along each dimension an index is constructed according to the values of feature points of multimedia objects. A user can pose a content-based query by specifying a multimedia query example and a similarity measure. The specified query example will be transformed into a query point in the multi-dimensional feature space. The possible result points in each dimension are then retrieved by searching the value of the query point in the corresponding dimension. The sets of the possible result points are merged one by one by removing the points which are not within the query radius. The resultant points and their distances from the query point form the answer of the query. To show the efficiency of our approach, a series of experiments are performed to compare with the related approaches.
關聯 Multimedia Tools and Applications (EI,SCIE), Kluwer Academic Publishers,235-254
資料類型 article
dc.contributor 資科系en_US
dc.creator (作者) 陳良弼zh_TW
dc.creator (作者) LIU,CHIH-CHIN;HSU,JIA-LIEN;CHEN,ARBEE L.P.en_US
dc.date (日期) 2001en_US
dc.date.accessioned 21-Aug-2014 14:54:02 (UTC+8)-
dc.date.available 21-Aug-2014 14:54:02 (UTC+8)-
dc.date.issued (上傳時間) 21-Aug-2014 14:54:02 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/69131-
dc.description.abstract (摘要) Many content-based multimedia data retrieval problems can be transformed into the near neighbor searching problem in multidimensional feature space. An efficient near neighbor searching algorithm is needed when developing a multimedia database system. In this paper, we propose an approach to efficiently solve the near neighbor searching problem. In this approach, along each dimension an index is constructed according to the values of feature points of multimedia objects. A user can pose a content-based query by specifying a multimedia query example and a similarity measure. The specified query example will be transformed into a query point in the multi-dimensional feature space. The possible result points in each dimension are then retrieved by searching the value of the query point in the corresponding dimension. The sets of the possible result points are merged one by one by removing the points which are not within the query radius. The resultant points and their distances from the query point form the answer of the query. To show the efficiency of our approach, a series of experiments are performed to compare with the related approaches.en_US
dc.format.extent 237453 bytes-
dc.format.mimetype application/pdf-
dc.language.iso en_US-
dc.relation (關聯) Multimedia Tools and Applications (EI,SCIE), Kluwer Academic Publishers,235-254en_US
dc.subject (關鍵詞) near neighbor searching; spatial index; content-based multimedia data retrieval; multimedia databasesen_US
dc.title (題名) Efficient Near Neighbor Searching Using Multi-Indexes for Content-Based Multimedia Data Retrievalen_US
dc.type (資料類型) articleen