Typescript (photocopy). / Digitized by Kansas Correctional Industries

Lu, Shi. / Thesis submitted in: December 2004. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2005. / Includes bibliographical references (leaves 100-109). / Abstracts in English and Chinese. / Abstract --- p.ii / Acknowledgement --- p.vi / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivation and Objectives --- p.1 / Chapter 1.2 --- Our Contributions --- p.3 / Chapter 1.3 --- Thesis Outline --- p.4 / Chapter 2 --- Related Work --- p.6 / Chapter 2.1 --- Static Video Summary --- p.6 / Chapter 2.2 --- Dynamic Video Skimming --- p.10 / Chapter 2.3 --- Summary --- p.14 / Chapter 3 --- Greedy Method Based Skim Generation --- p.16 / Chapter 3.1 --- Selected Video Features for Video Summarization --- p.17 / Chapter 3.2 --- Video Summarization Problem --- p.18 / Chapter 3.3 --- Experiments --- p.22 / Chapter 3.4 --- Summary --- p.25 / Chapter 4 --- Video Structure Analysis --- p.27 / Chapter 4.1 --- Video Shot Detection --- p.29 / Chapter 4.1.1 --- Shot Cut Detection --- p.30 / Chapter 4.1.2 --- Fade Detection --- p.35 / Chapter 4.2 --- Video Shot Group Construction --- p.38 / Chapter 4.2.1 --- Shot Pairwise Similarity Measure --- p.39 / Chapter 4.2.2 --- Video Shot Grouping by VToC --- p.41 / Chapter 4.2.3 --- Spectral Graph Partitioning --- p.42 / Chapter 4.3 --- Video Scene Detection --- p.46 / Chapter 4.4 --- Shot Arrangement Patterns --- p.48 / Chapter 4.5 --- Experiments --- p.50 / Chapter 4.6 --- Summary --- p.53 / Chapter 5 --- Graph Optimization-Based Video Summary Generation --- p.55 / Chapter 5.1 --- Video Scene Analysis --- p.56 / Chapter 5.1.1 --- Scene Content Entropy --- p.57 / Chapter 5.1.2 --- Target Skim Length Assignment --- p.58 / Chapter 5.2 --- Graph Modelling of Video Scenes --- p.59 / Chapter 5.2.1 --- Decompose the Video Scene into Candidate Video Strings --- p.60 / Chapter 5.2.2 --- The Spatial-Temporal Relation Graph --- p.61 / Chapter 5.2.3 --- The Optimal Skim Problem --- p.62 / Chapter 5.3 --- Graph Optimization --- p.64 / Chapter 5.4 --- Static Video Summary Generation --- p.65 / Chapter 5.5 --- Experiments --- p.68 / Chapter 5.6 --- Summary --- p.74 / Chapter 6 --- Video Content Annotation and Semantic Video Summarization --- p.75 / Chapter 6.1 --- Semantic Video Content Annotation --- p.77 / Chapter 6.1.1 --- Video Shot Segmentation --- p.77 / Chapter 6.1.2 --- Semi-Automatic Video Shot Annotation --- p.77 / Chapter 6.2 --- Video Structures and Semantics --- p.78 / Chapter 6.2.1 --- Video Structure Analysis --- p.78 / Chapter 6.2.2 --- Video Structure and Video Edit Process --- p.80 / Chapter 6.2.3 --- Mutual Reinforcement and Semantic Video Shot Group Detection --- p.81 / Chapter 6.3 --- Semantic Video Summarization --- p.84 / Chapter 6.3.1 --- Summarization Requests and Goals --- p.84 / Chapter 6.3.2 --- Determine the Sub-Skimming Length for Each Scene --- p.85 / Chapter 6.3.3 --- Extracting Video Shots by String Analysis --- p.86 / Chapter 6.4 --- Experiments --- p.88 / Chapter 6.5 --- Summary --- p.92 / Chapter 7 --- Concluding Remarks --- p.93 / Chapter 7.1 --- Summary --- p.93 / Chapter 7.2 --- Future Work --- p.95 / Chapter A --- Notations --- p.97 / Bibliography --- p.100

by Chan Mei Shuen Polly. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (leaves 67-70). / Abstract --- p.ii / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Definitions --- p.3 / Chapter 1.2 --- Thesis Overview --- p.5 / Chapter 2 --- Background and Related Work --- p.6 / Chapter 2.1 --- Feature-Based Index Structures --- p.6 / Chapter 2.2 --- Distance Preserving Methods --- p.8 / Chapter 2.3 --- Distance-Based Index Structures --- p.9 / Chapter 2.3.1 --- The Vantage-Point Tree Method --- p.10 / Chapter 3 --- The Problem of Distance Preserving Methods in Querying --- p.12 / Chapter 3.1 --- Some Experimental Results --- p.13 / Chapter 3.2 --- Discussion --- p.15 / Chapter 4 --- Nearest Neighbor Search in VP-trees --- p.17 / Chapter 4.1 --- The sigma-factor Algorithm --- p.18 / Chapter 4.2 --- The Constant-α Algorithm --- p.22 / Chapter 4.3 --- The Single-Pass Algorithm --- p.24 / Chapter 4.4 --- Discussion --- p.25 / Chapter 4.5 --- Performance Evaluation --- p.26 / Chapter 4.5.1 --- Experimental Setup --- p.27 / Chapter 4.5.2 --- Results --- p.28 / Chapter 5 --- Update Operations on VP-trees --- p.41 / Chapter 5.1 --- Insert --- p.41 / Chapter 5.2 --- Delete --- p.48 / Chapter 5.3 --- Performance Evaluation --- p.51 / Chapter 6 --- Minimizing Distance Computations --- p.57 / Chapter 6.1 --- A Single Vantage Point per Level --- p.58 / Chapter 6.2 --- Reuse of Vantage Points --- p.59 / Chapter 6.3 --- Performance Evaluation --- p.60 / Chapter 7 --- Conclusions and Future Work --- p.63 / Chapter 7.1 --- Future Work --- p.65 / Bibliography --- p.67

by Frank Hing-Wah Luk. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1996. / Includes bibliographical references (leaves 92-95). / Abstract --- p.ii / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivation --- p.1 / Chapter 1.2 --- The Problem in Object-Oriented Database Indexing --- p.2 / Chapter 1.3 --- Contributions --- p.3 / Chapter 1.4 --- Thesis Organization --- p.4 / Chapter 2 --- Object-oriented Data Model --- p.5 / Chapter 2.1 --- Object-oriented Data Model --- p.5 / Chapter 2.2 --- Object and Object Identifiers --- p.6 / Chapter 2.3 --- Complex Attributes and Methods --- p.6 / Chapter 2.4 --- Class --- p.8 / Chapter 2.4.1 --- Inheritance Hierarchy --- p.8 / Chapter 2.4.2 --- Aggregation Hierarchy --- p.8 / Chapter 2.5 --- Sample Object-Oriented Database Schema --- p.9 / Chapter 3 --- Indexing in Object-Oriented Databases --- p.10 / Chapter 3.1 --- Introduction --- p.10 / Chapter 3.2 --- Indexing on Inheritance Hierarchy --- p.10 / Chapter 3.3 --- Indexing on Aggregation Hierarchy --- p.13 / Chapter 3.4 --- Indexing on Integrated Support --- p.16 / Chapter 3.5 --- Indexing on Method Invocation --- p.18 / Chapter 3.6 --- Indexing on Overlapping Path Expressions --- p.19 / Chapter 4 --- Triple Node Hierarchy --- p.23 / Chapter 4.1 --- Introduction --- p.23 / Chapter 4.2 --- Triple Node --- p.25 / Chapter 4.3 --- Triple Node Hierarchy --- p.26 / Chapter 4.3.1 --- Construction of the Triple Node Hierarchy --- p.26 / Chapter 4.3.2 --- Updates in the Triple Node Hierarchy --- p.31 / Chapter 4.4 --- Cost Model --- p.33 / Chapter 4.4.1 --- Storage --- p.33 / Chapter 4.4.2 --- Query Cost --- p.35 / Chapter 4.4.3 --- Update Cost --- p.35 / Chapter 4.5 --- Evaluation --- p.37 / Chapter 4.6 --- Summary --- p.42 / Chapter 5 --- Triple Node Hierarchy in Both Aggregation and Inheritance Hierarchies --- p.43 / Chapter 5.1 --- Introduction --- p.43 / Chapter 5.2 --- Preliminaries --- p.44 / Chapter 5.3 --- Class-Hierarchy Tree --- p.45 / Chapter 5.4 --- The Nested CH-tree --- p.47 / Chapter 5.4.1 --- Construction --- p.47 / Chapter 5.4.2 --- Retrieval --- p.48 / Chapter 5.4.3 --- Update --- p.48 / Chapter 5.5 --- Cost Model --- p.49 / Chapter 5.5.1 --- Assumptions --- p.51 / Chapter 5.5.2 --- Storage --- p.52 / Chapter 5.5.3 --- Query Cost --- p.52 / Chapter 5.5.4 --- Update Cost --- p.53 / Chapter 5.6 --- Evaluation --- p.55 / Chapter 5.6.1 --- Storage Cost --- p.55 / Chapter 5.6.2 --- Query Cost --- p.57 / Chapter 5.6.3 --- Update Cost --- p.62 / Chapter 5.7 --- Summary --- p.63 / Chapter 6 --- Decomposition of Path Expressions --- p.65 / Chapter 6.1 --- Introduction --- p.65 / Chapter 6.2 --- Configuration on Path Expressions --- p.67 / Chapter 6.2.1 --- Single Path Expression --- p.67 / Chapter 6.2.2 --- Overlapping Path Expressions --- p.68 / Chapter 6.3 --- New Algorithm --- p.70 / Chapter 6.3.1 --- Example --- p.72 / Chapter 6.4 --- Evaluation --- p.75 / Chapter 6.5 --- Summary --- p.76 / Chapter 7 --- Conclusion and Future Research --- p.77 / Chapter 7.1 --- Conclusion --- p.77 / Chapter 7.2 --- Future Research --- p.78 / Chapter A --- Evaluation of some Parameters in Chapter5 --- p.79 / Chapter B --- Cost Model for Nested-Inherited Index --- p.82 / Chapter B.1 --- Storage --- p.82 / Chapter B.2 --- Query Cost --- p.84 / Chapter B.3 --- Update --- p.84 / Chapter C --- Algorithm constructing a minimum auxiliary set of J Is --- p.87 / Chapter D --- Estimation on the number of possible combinations --- p.89 / Bibliography --- p.92

Typescript, etc. / Digitized by Kansas Correctional Industries

Typescript, etc. / Digitized by Kansas Correctional Industries

No description available.

Browsing marked-up documents by traversing hyperlinks has become probably the most important means by which documents are accessed, both via the World Wide Web (WWW) and organisational Intranets. However, there is a pressing demand for document management and retrieval systems to deal appropriately with the massive number of documents available. There are two classes of solution: general search engines, whether for the WWW or an Intranet, which make little use of specific domain knowledge or hand-crafted specialised systems which are costly to build and maintain. The aim of this thesis was to develop a document management and retrieval system suitable for small communities as well as individuals in specialised domains on the Web. The aim was to allow users to easily create and maintain their own organisation of documents while ensuring continual improvement in the retrieval performance of the system as it evolves. The system developed is based on the free annotation of documents by users and is browsed using the concept lattice of Formal Concept Analysis (FCA). A number of annotation support tools were developed to aid the annotation process so that a suitable system evolved. Experiments were conducted in using the system to assist in finding staff and student home pages at the School of Computer Science and Engineering, University of New South Wales. Results indicated that the annotation tools provided a good level of assistance so that documents were easily organised and a lattice-based browsing structure that evolves in an ad hoc fashion provided good efficiency in retrieval performance. An interesting result suggested that although an established external taxonomy can be useful in proposing annotation terms, users appear to be very selective in their use of terms proposed. Results also supported the hypothesis that the concept lattice of FCA helped take users beyond a narrow search to find other useful documents. In general, lattice-based browsing was considered as a more helpful method than Boolean queries or hierarchical browsing for searching a specialised domain. We conclude that the concept lattice of Formal Concept Analysis, supported by annotation techniques is a useful way of supporting the flexible open management of documents required by individuals, small communities and in specialised domains. It seems likely that this approach can be readily integrated with other developments such as further improvements in search engines and the use of semantically marked-up documents, and provide a unique advantage in supporting autonomous management of documents by individuals and groups - in a way that is closely aligned with the autonomy of the WWW.

Bibliography: p. 281-289. Electronic publication; Full text available in PDF format; abstract in HTML format. Electronic reproduction.[Australia] :Australian Digital Theses Program,2001.

Thesis (M. Phil.)--University of Hong Kong, 2007. / Title proper from title frame. Also available in printed format.