English  |  正體中文  |  简体中文  |  Items with full text/Total items : 26999/38800
Visitors : 2401816      Online Users : 63
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/27829

Title: Fast indexing method for image retrieval using k nearest neighbors searches by principal axis analysis
Authors: Shyi-Chyi Cheng;Tian-Luu Wu
Contributors: NTOU:Department of Computer Science and Engineering
國立臺灣海洋大學:資訊工程學系
Keywords: High-dimensional image database;Content-based image retrieval;Principal axis analysis;Vector ordering;k-NN search
Date: 2006-02
Issue Date: 2011-10-21T02:34:09Z
Publisher: Journal of Visual Communication and Image Representation
Abstract: Abstract:This paper presents a fast indexing scheme for content-based image retrieval based on the principal axis analysis. 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 similar to the quadratic histogram distance measure is defined for this indexing method. The computational complexity of similarity measure in high-dimensional image database is very huge and hence the applications of image retrieval are restricted to certain areas. In this work, feature vectors in a given image are ordered by the principal axis analysis to speed up the similarity search in a high-dimensional image database using k nearest neighbor searches. 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) method, Jain and Vailay’s method, and the LPC-file method. The experimental results demonstrate that the proposed method outperforms the compared methods in retrieval accuracy and execution speed. 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: 17(1), pp.42-56
URI: http://ntour.ntou.edu.tw/handle/987654321/27829
Appears in Collections:[資訊工程學系] 期刊論文

Files in This Item:

File Description SizeFormat
index.html0KbHTML294View/Open


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