by Lau Tak Kan. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1998. / Includes bibliographical references (leaves 100-108). / Abstract also in Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Background --- p.1 / Chapter 1.2 --- Problem Defined --- p.5 / Chapter 1.3 --- Contributions --- p.5 / Chapter 1.4 --- Thesis Organization --- p.7 / Chapter 2 --- Content-based Retrieval Multimedia Database Background and Indexing Problem --- p.8 / Chapter 2.1 --- Feature Extraction --- p.8 / Chapter 2.2 --- Nearest-neighbor Search --- p.10 / Chapter 2.3 --- Content-based Indexing Methods --- p.15 / Chapter 2.4 --- Indexing Problem --- p.22 / Chapter 3 --- Data Clustering Methods for Indexing --- p.25 / Chapter 3.1 --- Proposed Solution to Indexing Problem --- p.25 / Chapter 3.2 --- Brief Description of Several Clustering Methods --- p.26 / Chapter 3.2.1 --- K-means --- p.26 / Chapter 3.2.2 --- Competitive Learning (CL) --- p.27 / Chapter 3.2.3 --- Rival Penalized Competitive Learning (RPCL) --- p.29 / Chapter 3.2.4 --- General Hierarchical Clustering Methods --- p.31 / Chapter 3.3 --- Why RPCL? --- p.32 / Chapter 4 --- Non-hierarchical RPCL Indexing --- p.33 / Chapter 4.1 --- The Non-hierarchical Approach --- p.33 / Chapter 4.2 --- Performance Experiments --- p.34 / Chapter 4.2.1 --- Experimental Setup --- p.35 / Chapter 4.2.2 --- Experiment 1: Test for Recall and Precision Performance --- p.38 / Chapter 4.2.3 --- Experiment 2: Test for Different Sizes of Input Data Sets --- p.45 / Chapter 4.2.4 --- Experiment 3: Test for Different Numbers of Dimensions --- p.49 / Chapter 4.2.5 --- Experiment 4: Compare with Actual Nearest-neighbor Results --- p.53 / Chapter 4.3 --- Chapter Summary --- p.55 / Chapter 5 --- Hierarchical RPCL Indexing --- p.56 / Chapter 5.1 --- The Hierarchical Approach --- p.56 / Chapter 5.2 --- The Hierarchical RPCL Binary Tree (RPCL-b-tree) --- p.58 / Chapter 5.3 --- Insertion --- p.61 / Chapter 5.4 --- Deletion --- p.63 / Chapter 5.5 --- Searching --- p.63 / Chapter 5.6 --- Experiments --- p.69 / Chapter 5.6.1 --- Experimental Setup --- p.69 / Chapter 5.6.2 --- Experiment 5: Test for Different Node Sizes --- p.72 / Chapter 5.6.3 --- Experiment 6: Test for Different Sizes of Data Sets --- p.75 / Chapter 5.6.4 --- Experiment 7: Test for Different Data Distributions --- p.78 / Chapter 5.6.5 --- Experiment 8: Test for Different Numbers of Dimensions --- p.80 / Chapter 5.6.6 --- Experiment 9: Test for Different Numbers of Database Ob- jects Retrieved --- p.83 / Chapter 5.6.7 --- Experiment 10: Test with VP-tree --- p.86 / Chapter 5.7 --- Discussion --- p.90 / Chapter 5.8 --- A Relationship Formula --- p.93 / Chapter 5.9 --- Chapter Summary --- p.96 / Chapter 6 --- Conclusion --- p.97 / Chapter 6.1 --- Future Works --- p.97 / Chapter 6.2 --- Conclusion --- p.98 / Bibliography --- p.100
| Identifer | oai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_322264 |
| Date | January 1998 |
| Contributors | Lau, Tak Kan., Chinese University of Hong Kong Graduate School. Division of Computer Science and Engineering. |
| Source Sets | The Chinese University of Hong Kong |
| Language | English, Chinese |
| Detected Language | English |
| Type | Text, bibliography |
| Format | print, xvi, 108 leaves : ill. ; 30 cm. |
| Rights | Use of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/) |
Page generated in 0.004 seconds