English  |  正體中文  |  简体中文  |  Items with full text/Total items : 53694/88316 (61%)
Visitors : 10257626      Online Users : 250
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/92657

    Title: A KD-Tree-Based Nearest Neighbor Search for Large Quantities of Data
    Authors: Yen, Shwu-Huey;Hsieh, Ya-Ju
    Contributors: 淡江大學資訊工程學系
    Keywords: Arbitrary KD-tree (KDA);Feature Point;KD-Tree;Nearest Neighbor (NN);Image Stitching
    Date: 2013-03
    Issue Date: 2013-10-21 17:21:13 (UTC+8)
    Publisher: Seoul: Korean Society for Internet Information
    Abstract: The discovery of nearest neighbors, without training in advance, has many applications, such as the formation of mosaic images, image matching, image retrieval and image stitching. When the quantity of data is huge and the number of dimensions is high, the efficient identification of a nearest neighbor (NN) is very important. This study proposes a variation of the KD-tree - the arbitrary KD-tree (KDA) - which is constructed without the need to evaluate variances. Multiple KDAs can be constructed efficiently and possess independent tree structures, when the amount of data is large. Upon testing, using extended synthetic databases and real-world SIFT data, this study concludes that the KDA method increases computational efficiency and produces satisfactory accuracy, when solving NN problems.
    Relation: Transactions on Internet and Information Systems 7(3), pp.459-470
    DOI: 10.3837/tiis.2013.03.003
    Appears in Collections:[資訊工程學系暨研究所] 期刊論文

    Files in This Item:

    File Description SizeFormat
    A KD-tree-based nearest neighbor search for large quantities of data(TIIS).pdf960KbAdobe PDF232View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback