English  |  正體中文  |  简体中文  |  Items with full text/Total items : 26999/38800
Visitors : 2401886      Online Users : 61
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search
LoginUploadHelpAboutAdminister

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/27868

Title: Speeding up the similarity search in high-dimensional image database by multiscale filtering and dynamic programming
Authors: Shyi-Chyi Cheng;Tian-Luu Wu
Contributors: NTOU:Department of Computer Science and Engineering
國立臺灣海洋大學:資訊工程學系
Keywords: High-dimensional image database;Content-based image retrieval;Multiscale filtering;Dynamic programming;Spatial layout
Date: 2006-05-01
Issue Date: 2011-10-21T02:34:17Z
Publisher: Image and Vision Computing
Abstract: Abstract:This paper presents a scalable content-based image indexing and retrieval system based on a new multiscale filter. Image databases often represent the image objects as high-dimensional feature vectors and access them via the feature vectors and similarity measure. A similarity measure based on the proposed multiscale filtering technique is defined to reduce the computational complexity of the similarity search in high-dimensional image database. Moreover, a special attention is paid to solve the problem of feature value correlation by dynamic programming. This problem arises from changes of images due to database updating or considering spatial layout in constructing feature vectors. The computational complexity of similarity measure in high-dimensional image database is very huge and the applications of image retrieval are restricted to certain areas. To demonstrate the effectiveness of the proposed algorithm, we conducted extensive experiments and compared the performance with the IBM's query by image content (QBIC) and Jain and Vailaya's methods. The experimental results demonstrate that the proposed method outperforms both of the methods in retrieval accuracy and noise immunity. The execution speed of the proposed method is much faster than that of QBIC method and it can achieve good results in terms of retrieval accuracy compared with Jain's method and QBIC method.
Relation: 24(5), pp.424-435
URI: http://ntour.ntou.edu.tw/handle/987654321/27868
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

There are no files associated with this item.



All items in NTOUR are protected by copyright, with all rights reserved.

 


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback