Chen Chung-Shue. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2001. / Includes bibliographical references (leaves 100-102). / Abstracts in English and Chinese. / Chapter 1. --- Introduction --- p.1 / Chapter 1.1 --- Evolution to 3G Mobile --- p.2 / Chapter 1.1.1 --- First Generation --- p.2 / Chapter 1.1.2 --- Second Generation --- p.3 / Chapter 1.1.3 --- Third Generation --- p.3 / Chapter 1.2 --- UTRA Framework --- p.5 / Chapter 1.2.1 --- FDD and TDD --- p.6 / Chapter 1.2.2 --- Channel Spreading --- p.6 / Chapter 1.2.3 --- OVSF Code Tree --- p.8 / Chapter 1.3 --- Cellular Concepts --- p.10 / Chapter 1.3.1 --- System Capacity --- p.10 / Chapter 1.3.2 --- Multiple Access --- p.11 / Chapter 1.3.3 --- Resource Management --- p.15 / Chapter 1.4 --- Organization of the Thesis --- p.16 / Chapter 2. --- Analysis on Multi-rate Operations --- p.18 / Chapter 2.1 --- Related Works in Multi-rate Operations --- p.18 / Chapter 2.1.1 --- Variable Spreading Factor --- p.19 / Chapter 2.1.2 --- Data Time-multiplexing --- p.20 / Chapter 2.1.3 --- Multi-carrier Transmission --- p.21 / Chapter 2.1.4 --- Hybrid TDMA/CDMA --- p.23 / Chapter 2.2 --- Problems in Multi-rate Operations --- p.24 / Chapter 2.2.1 --- Conventional CDMA --- p.24 / Chapter 2.2.2 --- Data Time-multiplexing --- p.25 / Chapter 2.2.3 --- MC-CDMA --- p.25 / Chapter 2.2.4 --- TD-CDMA --- p.27 / Chapter 2.3 --- Multi-user multi-rate Operations --- p.28 / Chapter 3. --- Bandwidth Allocation --- p.29 / Chapter 3.1 --- Most Regular Binary Sequence --- p.30 / Chapter 3.1.1 --- Properties of MRBS --- p.31 / Chapter 3.1.2 --- Construction of MRCS --- p.32 / Chapter 3.1.3 --- Zero-one Sequence under MRBS --- p.33 / Chapter 3.2 --- MRBS in TD-CDMA --- p.35 / Chapter 3.2.1 --- Time Slot Optimization --- p.36 / Chapter 3.2.2 --- Sequence Generator --- p.37 / Chapter 3.3 --- Most Regular Code Sequence --- p.38 / Chapter 3.3.1 --- Properties of MRCS --- p.38 / Chapter 3.2.2 --- Construction of MRCS --- p.41 / Chapter 3.3.3 --- Fraction-valued Sequence under MRCS --- p.42 / Chapter 3.3.4 --- LCC and UCC --- p.45 / Chapter 3.4 --- MRCS in WCDMA --- p.46 / Chapter 3.4.1 --- Spreading Factor Optimization --- p.46 / Chapter 3.4.2 --- Code Generator --- p.48 / Chapter 3.4.3 --- Uplink and Downlink --- p.50 / Chapter 4. --- Multi-access Control --- p.52 / Chapter 4.1 --- Conflict and Resolution --- p.53 / Chapter 4.1.1 --- Conflicts in MRBS and MRCS --- p.53 / Chapter 4.1.2 --- Resolution with Buffering --- p.55 / Chapter 4.2 --- MRBS Transmission Scheduling --- p.56 / Chapter 4.2.1 --- Slot Scheduling on MRBS --- p.56 / Chapter 4.2.2 --- Properties of Scheduling Algorithm --- p.59 / Chapter 4.2.3 --- Scheduled MRBS --- p.71 / Chapter 4.3 --- MRCS Transmission Scheduling --- p.73 / Chapter 4.3.1 --- Slot Scheduling on MRCS --- p.73 / Chapter 4.3.2 --- Properties of Scheduling Algorithm --- p.75 / Chapter 4.3.3 --- Scheduled MRBS --- p.76 / Chapter 4.4 --- Performance Evaluation --- p.78 / Chapter 4.4.1 --- Simulation on Algorithm --- p.78 / Chapter 4.4.2 --- Resource Utilization and Delay Bound --- p.79 / Chapter 4.4.3 --- Blocking Model and System Capacity --- p.80 / Chapter 4.4.4 --- Numerical Analysis --- p.86 / Chapter 5. --- Conclusions and Future works --- p.92 / Appendix A --- p.94 / Appendix B --- p.98 / Bibliography --- p.100

Tung, Tak Fu. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2002. / Includes bibliographical references (leaves 66-68). / Abstracts in English and Chinese. / Chapter 1 --- Introduction to Multi-path Streaming and Dynamic End-point Adaptation --- p.1 / Chapter 1.1 --- Multi-path Streaming --- p.2 / Chapter 1.2 --- Dynamic End-point Adaptation --- p.4 / Chapter 2 --- Related Work --- p.6 / Chapter 3 --- Path Loss Model --- p.10 / Chapter 3.1 --- Bursty Loss --- p.10 / Chapter 3.2 --- Gilbert Model --- p.11 / Chapter 3.2.1 --- Discrete-time Gilbert Model --- p.11 / Chapter 3.2.2 --- Continuous-time Gilbert Model --- p.12 / Chapter 4 --- Loss Recovery / Chapter 4.1 --- Automatic Repeat Request (ARQ) --- p.17 / Chapter 4.2 --- Forward Error Correction (FEC) --- p.18 / Chapter 5 --- Connection Adaptation --- p.23 / Chapter 5.1 --- Path Quality --- p.23 / Chapter 5.2 --- Effect of Shared Congestion Point --- p.24 / Chapter 5.2.1 --- Point-of-Congestion Detection --- p.25 / Chapter 5.3 --- Load Distribution --- p.27 / Chapter 6 --- Analytical Evaluation --- p.28 / Chapter 6.1 --- Performance Analysis of SP vs. Multi-path Streaming (without FEC) --- p.29 / Chapter 6.2 --- Performance Analysis of SP vs. Multi-path Streaming (with FEC) --- p.36 / Chapter 7 --- Experiments and Simulations --- p.42 / Chapter 7.1 --- Effect of Correlated Bursty Losses on Video Quality --- p.42 / Chapter 7.2 --- Analytical Model Based Evaluation --- p.44 / Chapter 7.2.1 --- Data Loss Rate --- p.44 / Chapter 7.2.2 --- Data Loss Rate as a function of FEC parameters --- p.46 / Chapter 7.2.3 --- Conditional Error Burst Length --- p.48 / Chapter 7.2.4 --- Lag-1 Autocorrelation --- p.49 / Chapter 7.2.5 --- Effects of Load Distribution Among Senders --- p.50 / Chapter 7.2.6 --- Sensitivity Analysis --- p.51 / Chapter 7.2.7 --- Effects of Shared Points of Congestion on Various Perfor- mance Metrics --- p.53 / Chapter 7.3 --- Simulation Model Based Evaluation --- p.55 / Chapter 7.3.1 --- Simulation Setup --- p.55 / Chapter 7.3.2 --- Data Loss Rate --- p.57 / Chapter 7.3.3 --- Data Loss Rate as a function of FEC parameters --- p.58 / Chapter 7.3.4 --- Conditional Error Burst Length --- p.59 / Chapter 7.3.5 --- Lag-1 Autocorrelation --- p.60 / Chapter 7.3.6 --- Effects of Load Distribution among Senders --- p.61 / Chapter 7.3.7 --- Sensitivity Analysis --- p.62 / Chapter 7.3.8 --- Effects of Shared Points of Congestion on Various Perfor- mance Metrics --- p.63 / Chapter 8 --- Conclusion --- p.65

Cheng Tung Yin. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2005. / Includes bibliographical references (leaves 136-141). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Overview --- p.1 / Chapter 1.1.1 --- Information Retrieval --- p.1 / Chapter 1.1.2 --- Search Engines --- p.2 / Chapter 1.1.3 --- Data Merging --- p.3 / Chapter 1.2 --- Meta-search Engines --- p.3 / Chapter 1.2.1 --- Framework and Techniques Employed --- p.3 / Chapter 1.2.2 --- Advantages of meta-searching --- p.8 / Chapter 1.3 --- Contribution of the Thesis --- p.10 / Chapter 1.4 --- Organization of the Thesis --- p.12 / Chapter 2 --- Literature Review --- p.14 / Chapter 2.1 --- Preliminaries --- p.14 / Chapter 2.2 --- Fusion Methods --- p.15 / Chapter 2.2.1 --- Fusion methods based on a document's score --- p.15 / Chapter 2.2.2 --- Fusion methods based on a document's ranking position --- p.23 / Chapter 2.2.3 --- Fusion methods based on a document's URL title and snippets --- p.30 / Chapter 2.2.4 --- Fusion methods based on a document's entire content --- p.40 / Chapter 2.3 --- Comparison of the Fusion Methods --- p.42 / Chapter 2.4 --- Relevance Feedback --- p.46 / Chapter 3 --- Research Methodology --- p.48 / Chapter 3.1 --- Investigation of the features of the retrieved results from the search engines --- p.48 / Chapter 3.2 --- Types of relationships --- p.53 / Chapter 3.3 --- Order of Strength of the Relationships --- p.64 / Chapter 3.3.1 --- Derivation of the weight for each kind of relationship (criterion) --- p.68 / Chapter 3.4 --- Observation of the relationships between retrieved objects and the effects of these relationships on the relevance of objects --- p.69 / Chapter 3.4.1 --- Observation on the relationships existed in items that are irrelevant and relevant to the query --- p.68 / Chapter 3.5 --- Proposed re-ranking algorithms --- p.89 / Chapter 3.5.1 --- Original re-ranking algorithm (before modification) --- p.91 / Chapter 3.5.2 --- Modified re-ranking algorithm (after modification) --- p.95 / Chapter 4 --- Evaluation Methodology and Experimental Results --- p.101 / Chapter 4.1 --- Objective --- p.101 / Chapter 4.2 --- Experimental Design and Setup --- p.101 / Chapter 4.2.1 --- Preparation of data --- p.101 / Chapter 4.3 --- Evaluation Methodology --- p.104 / Chapter 4.3.1 --- Evaluation of the relevance of a document to the corresponding query --- p.104 / Chapter 4.3.2 --- Performance Measures of the Evaluation --- p.105 / Chapter 4.4 --- Experimental Results and Interpretation --- p.106 / Chapter 4.4.1 --- Precision --- p.107 / Chapter 4.4.2 --- Recall --- p.107 / Chapter 4.4.3 --- F-measure --- p.108 / Chapter 4.4.4 --- Overall evaluation results for the ten queries for each evaluation tool --- p.110 / Chapter 4.4.5 --- Discussion --- p.123 / Chapter 4.5 --- Degree of difference between the performance of systems --- p.124 / Chapter 4.5.1 --- Analysis using One-Way ANOVA --- p.124 / Chapter 4.5.2 --- Analysis using paired samples T-test --- p.126 / Chapter 5 --- Conclusion --- p.131 / Chapter 5.1 --- "Implications, Limitations, and Future Work" --- p.131 / Chapter 5.2 --- Conclusions --- p.133 / Bibliography --- p.134 / Chapter A --- Paired samples T-test for F-measures of systems retrieving all media's items --- p.140

Based on the fixed block size FWS algorithm, we further proposed a fast full-pel variable block size motion estimation algorithm called Fast Walsh Search in Variable Block Size (FWS-VBS). As in FWS, FWS-VBS employs the PSAD as the error measure to identify likely mismatches. Mismatches are rejected by thresholding method and the thresholds are determined adaptively to cater for different activity levels in each block. Early termination techniques are employed to further reduce the number of candidates and modes to be searched of each block. FWS-VBS performs equally well to the exhaustive full search algorithm in the reference H.264/AVC encoder and requires only about 10% of the computation time. / Furthermore, we modified our proposed segmentation algorithm to handle video sequences that are already encoded in the H.264 format. Since the video is compressed, no spatial information is available. Instead, quantized transform coefficients of the residual frame are used to approximate spatial information and improve segmentation result. The computation time of the segmentation process is merely about 16ms per frame for CIF frame size video, allowing the algorithm to be applied in real-time applications such as video surveillance and conferencing. / In the first part of our research, we proposed a block matching algorithm called Fast Walsh Search (FWS) for video motion estimation. FWS employs two new error measures defined in Walsh Hadamard domain, which are partial sum-of-absolute difference (PSAD) and sum-of-absolute difference of DC coefficients (SADDCC). The algorithm first rejects most mismatched candidates using PSAD which is a coarse measure requiring little computation. Because of the energy packing ability of Walsh Hadamard transform (WHT) and the utilization of fast WHT computation algorithm, mismatched candidates are identified and rejected efficiently. Then the proposed algorithm identifies the matched candidate from the remaining candidates using SADDCC which is a more accurate measure and can reuse computation performed for PSAD. Experimental results show that FWS can give good visual quality to most of video scene with a reasonable amount of computation. / In the second part of our research, we developed a real-time video object segmentation algorithm. The motion information is obtained by FWS-VBS to minimize the computation time while maintaining an adequate accuracy. The algorithm makes use of the motion information to identify background motion model and moving objects. In order to preserve spatial and temporal continuity of objects, Markov random field (MRF) is used to model the foreground field. The block-based foreground object mask is obtained by minimizing the energy function of the MRF. The resulting object mask is then post-processed to generate a smooth object mask. Experimental results show that the proposed algorithm can effectively extract moving objects from different kind of sequences, at a speed of less than 100ms per frame for CIF frame size video. / Motion estimation is an important part in many video processing applications, such as video compression, object segmentation, and scene analysis. In all video compression applications, motion information is used to reduce temporal redundancy between frames, thus significantly reduce the required bitrate for transmission and storage of compressed video. In addition, in object-based video coding, video object can be automatically identified by its motion against the background. / Mak, Chun Man. / "June 2008." / Adviser: Wai-Kuen Cham. / Source: Dissertation Abstracts International, Volume: 70-03, Section: B, page: 1849. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2008. / Includes bibliographical references. / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Electronic reproduction. [Ann Arbor, MI] : ProQuest Information and Learning, [200-] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstracts in English and Chinese. / School code: 1307.

by Donald Asogu Adjeroh. / Thesis (Ph.D.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (p. 202-216). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Mode of access: World Wide Web.

No description available.

Multimedia technology enables direct manipulation of multiple media such as text, image, audio, and video, all integrated into one entity - the multimedia document. Interactive multimedia documents integrate text, images and continuous media such as audio and video, treat them as objects to be presented for a certain duration, and allow users to interact with the presentation. Authoring and presenting interactive multimedia documents imposes new requirements on document representation. We designed the interactive timeline model (ITM) for authoring and presenting interactive multimedia documents. We implemented the model and created a playback tool using the scripting language Tel. ITM uses an enhanced timeline model for representing interactive multimedia scenarios. ITM is a layered model that supports the creation of the logical, temporal, and presentation structures of a multimedia document and emphasizes the separation of content from its structure. The storage layer provides interfaces for creation and storage of media objects like text, images, scripts, choices, and audio. Choice is a media object that allows users to interact with the presentation. A script object causes Tel code to be executed. The composition layer specifies the logical structure and provides interfaces to compose a multimedia document. The presentation layer specifies the temporal and spatial structure of the document and describes the user interface for the playback tool. The run-time layer specifies the interfaces to start and control the flow of the presentation, describes the possible interactions between a user and the presentation at run-time, and specifies the actions to be taken when interaction takes place. ITM allows users to configure the playback tool according to their needs. It provides authors with a mechanism to create new interfaces and register them with the playback tool. To evaluate the design decisions of ITM and verify its usability, we conducted usability tests on the model. We asked a representative sample of end users ( both authors and viewers) to perform realistic tasks using the model. ITM is a powerful model to create and present interactive learning materials and dynamic presentations.

Abstract not available

This thesis presents a research work based on an integrated multi-modal approach for sports video indexing and retrieval. By combining specific features extractable from multiple (audio-visual) modalities, generic structure and specific events can be detected and classified. During browsing and retrieval, users will benefit from the integration of high-level semantic and some descriptive mid-level features such as whistle and close-up view of player(s). The main objective is to contribute to the three major components of sports video indexing systems. The first component is a set of powerful techniques to extract audio-visual features and semantic contents automatically. The main purposes are to reduce manual annotations and to summarize the lengthy contents into a compact, meaningful and more enjoyable presentation. The second component is an expressive and flexible indexing technique that supports gradual index construction. Indexing scheme is essential to determine the methods by which users can access a video database. The third and last component is a query language that can generate dynamic video summaries for smart browsing and support user-oriented retrievals.

Thesis (Ph. D.)--University of Florida, 2001. / Title from first page of PDF file. Document formatted into pages; contains xi, 86 p.; also contains graphics. Vita. Includes bibliographical references (p. 82-85).