No description available.

No description available.

by Tung Lun Hsing. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (leaves 80-84). / Abstract --- p.i / Acknowledgement --- p.ii / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Literature Survey --- p.8 / Chapter 2.1 --- The Freeman Chain Code Approach --- p.8 / Chapter 2.2 --- The Moment Approach --- p.10 / Chapter 2.3 --- The Rectangular Cover Approach --- p.12 / Chapter 2.4 --- The Potential-Based Approach --- p.15 / Chapter 2.5 --- The Normalized Coordinate System Approach --- p.17 / Chapter 2.6 --- The Hausdorff Distance Method --- p.20 / Chapter 2.7 --- The PCA Approach --- p.22 / Chapter 3 --- Binary Shape Descriptor --- p.26 / Chapter 3.1 --- Basic idea --- p.26 / Chapter 3.2 --- Standardized Binary String Descriptor --- p.27 / Chapter 3.3 --- Number of equivalent classes for n-gons --- p.28 / Chapter 4 --- The Two-Stage Framework --- p.30 / Chapter 5 --- Multi-Resolution Area Matching --- p.33 / Chapter 5.1 --- The idea --- p.33 / Chapter 5.2 --- Computing MRAI --- p.34 / Chapter 5.3 --- Measuring similarity using MRAI --- p.36 / Chapter 5.4 --- Query processing using MRAM --- p.38 / Chapter 5.5 --- Characteristics and Discussion --- p.40 / Chapter 6 --- Circular Error Bound and Minimum Circular Error Bound --- p.41 / Chapter 6.1 --- Polygon Matching using Circular Error Bound --- p.41 / Chapter 6.1.1 --- Translation --- p.43 / Chapter 6.1.2 --- Translation and uniform scaling in x-axis and y-axis directions --- p.45 / Chapter 6.1.3 --- Translation and independent scaling in x-axis and y-axis directions --- p.47 / Chapter 6.2 --- Minimum Circular Error Bound --- p.48 / Chapter 6.3 --- Characteristics --- p.49 / Chapter 7 --- Experimental Results --- p.50 / Chapter 7.1 --- Setup --- p.50 / Chapter 7.1.1 --- Polygon generation --- p.51 / Chapter 7.1.2 --- Database construction --- p.52 / Chapter 7.1.3 --- Query processing --- p.54 / Chapter 7.2 --- Running time comparison --- p.55 / Chapter 7.2.1 --- Experiment I --- p.55 / Chapter 7.2.2 --- Experiment II --- p.58 / Chapter 7.2.3 --- Experiment III --- p.60 / Chapter 7.3 --- Visual ranking comparison --- p.61 / Chapter 7.3.1 --- Experiment I --- p.61 / Chapter 7.3.2 --- Experiment II --- p.62 / Chapter 7.3.3 --- Experiment III --- p.63 / Chapter 7.3.4 --- Conclusion on visual ranking experiments --- p.66 / Chapter 8 --- Discussion --- p.68 / Chapter 8.1 --- N-ary Shape Descriptor --- p.68 / Chapter 8.2 --- Distribution of polygon equivalent classes --- p.69 / Chapter 8.3 --- Comparing polygons with different number of vertices --- p.72 / Chapter 8.4 --- Relaxation of assumptions --- p.73 / Chapter 8.4.1 --- Non-degenerate --- p.74 / Chapter 8.4.2 --- Simple --- p.74 / Chapter 8.4.3 --- Closed --- p.76 / Chapter 9 --- Conclusion --- p.78 / Bibliography --- p.80