Tang, Kai Lam. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references. / Abstracts in English and Chinese. / Acknowledgement --- p.i / Abstract --- p.ii / Contents --- p.iv / Publication List --- p.vii / Chapter Chapter 1 --- Introduction --- p.1-1 / Chapter 1.1 --- Video Coding --- p.1-1 / Chapter 1.1.1 --- Temporal prediction --- p.1-5 / Chapter 1.1.2 --- Transform Coding --- p.1-9 / Chapter 1.1.3 --- Quantization --- p.1-12 / Chapter 1.1.4 --- Entropy Coding --- p.1-14 / Chapter 1.2 --- H.264/MPEG-4 Part 10 --- p.1-15 / Chapter 1.2.1 --- Overview --- p.1-16 / Chapter 1.2.2 --- Intra Prediction --- p.1-19 / Chapter 1.2.3 --- Inter Prediction --- p.1-20 / Chapter 1.2.4 --- Transform and Quantization --- p.1-23 / Chapter 1.2.5 --- Entropy Coding --- p.1-25 / Chapter 1.2.6 --- Deblocking Filter --- p.1-29 / Chapter 1.3 --- Organization of the Thesis --- p.1-32 / Chapter 1.3.1 --- Review of Motion Estimation Techniques --- p.1-32 / Chapter 1.3.2 --- The Proposed Algorithms --- p.1-33 / Chapter 1.3.3 --- Optimization of the Codec --- p.1-34 / Chapter 1.4 --- Contributions --- p.1-35 / Chapter Chapter 2 --- Review of Motion Estimation Techniques --- p.2-1 / Chapter 2.1 --- Fast Full Search --- p.2-2 / Chapter 2.2 --- Hybrid Unsymmetrical-cross Multi-Hexagon-grid Search --- p.2-4 / Chapter 2.3 --- Center biased Fractional Pel Search --- p.2-6 / Chapter 2.4 --- Enhanced Predictive Zonal Search --- p.2-7 / Chapter Chapter 3 --- Enhancement Techniques for Intra Block Matching --- p.3-1 / Chapter 3.1 --- Introduction --- p.3-1 / Chapter 3.1.1 --- Fundamental Principles --- p.3-1 / Chapter 3.1.2 --- Variable Block Size Intra Block Matching --- p.3-3 / Chapter 3.2 --- Proposed Techniques --- p.3-5 / Chapter 3.2.1 --- Padding --- p.3-5 / Chapter 3.2.2 --- Modes --- p.3-9 / Chapter 3.2.3 --- Performance Enhancement Tools --- p.3-12 / Chapter 3.2.3.1 --- Multiple Best Matches --- p.3-12 / Chapter 3.2.3.2 --- Adaptive Integer and Sub-pixel Intra Block Matching --- p.3-13 / Chapter 3.2.4 --- Pseudo Intra Block Matching --- p.3-14 / Chapter 3.3 --- Proposed Fast Algorithms --- p.3-16 / Chapter 3.3.1 --- Fast Intra Block Matching Decision --- p.3-16 / Chapter 3.3.2 --- Skipping some Intra Block Matching Processes --- p.3-18 / Chapter 3.3.3 --- Early Termination --- p.3-19 / Chapter 3.3.4 --- SAD Reuse Techniques --- p.3-21 / Chapter 3.4 --- Experimental Results --- p.3-22 / Chapter Chapter 4 --- Enhanced SAD Reuse Fast Motion Estimation --- p.4-1 / Chapter 4.1 --- Introduction --- p.4-1 / Chapter 4.2 --- Proposed Fast Motion Estimation Algorithm --- p.4-3 / Chapter 4.2.1 --- Best Initial Motion Vector --- p.4-3 / Chapter 4.2.2 --- Initial Search Pattern --- p.4-4 / Chapter 4.2.3 --- Initial Search Process and Search Pattern Improvement Process --- p.4-7 / Chapter 4.2.3.1 --- BISPCSP Motion Estimation or Refinement Process Decision --- p.4-8 / Chapter 4.2.3.2 --- ISP Motion Estimation or Refinement Process Decision --- p.4-9 / Chapter 4.2.4 --- Motion Estimation Process and Refinement Process --- p.4-9 / Chapter 4.2.4.1 --- Motion Estimation Process --- p.4-9 / Chapter 4.2.4.2 --- Refinement Process --- p.4-11 / Chapter 4.2.5 --- Motion Estimation Skip Process for B Pictures --- p.4-12 / Chapter 4.3 --- Experimental Results --- p.4-13 / Chapter Chapter 5 --- Development of Real-Time H.264 Codec on Pocket PC --- p.5-1 / Chapter 5.1 --- Algorithmic Optimizations --- p.5-2 / Chapter 5.1.1 --- Fast Sub-Pixel Motion Estimation --- p.5-2 / Chapter 5.1.2 --- Interpolation --- p.5-5 / Chapter 5.1.2.1 --- Revision of Luma Interpolation --- p.5-5 / Chapter 5.1.2.2 --- Fast Interpolation --- p.5-8 / Chapter 5.1.3 --- Skipping Inverse ICT and Inverse Quantization Depends on Coded Block Pattern --- p.5-10 / Chapter 5. 2 --- Code Level Optimizations --- p.5-12 / Chapter 5.2.1 --- Merging Loops --- p.5-12 / Chapter 5.2.2 --- Moving Independent Code outside the Loop --- p.5-13 / Chapter 5.2.3 --- Unrolling Loops --- p.5-14 / Chapter 5.3 --- Experimental Results --- p.5-16 / Chapter 5.4 --- Applications --- p.5-26 / Chapter Chapter 6 --- Conclusions and Future Development --- p.6-1 / Chapter 6.1 --- Conclusions --- p.6-1 / Chapter 6.1.1 --- Enhancement Techniques for Intra Block Matching --- p.6-1 / Chapter 6.1.2 --- Enhanced SAD Reuse Fast Motion Estimation --- p.6-1 / Chapter 6.1.3 --- Development of Real-Time H.264 Codec on Pocket PC --- p.6-2 / Chapter 6.2 --- Future Development --- p.6-3 / Bibliography --- p.I

No description available.

No description available.

Thesis (Ph.D )--University of Texas at Arlington, 2009.

Thesis (M.S.)--West Virginia University, 2004. / Title from document title page. Document formatted into pages; contains vi, 52 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 50-52).

No description available.

No description available.

No description available.

The amount of digital video has been increasing dramatically due to the technology advances in video capturing, storage, and compression. The usefulness of vast repositories of digital information is limited by the effectiveness of the access methods, as shown by the Web explosion. The key issues in addressing the access methods are those of content description and of information space navigation. While textual documents in digital form are somewhat self-describing (i.e., they provide explicit indices, such as words and sentences that can be directly used to categorise and access them), digital video does not provide such an explicit content description. In order to access video material in an effective way, without looking at the material in its entirety, it is therefore necessary to analyse and annotate video sequences, and provide an explicit content description targeted to the user needs. Digital video is a very rich medium, and the characteristics in which users may be interested are quite diverse, ranging from the structure of the video to the identity of the people who appear in it, their movements and dialogues and the accompanying music and audio effects. Indexing digital video, based on its content, can be carried out at several levels of abstraction, beginning with indices like the video program name and name of subject, to much lower level aspects of video like the location of edits and motion properties of video. Manual video indexing requires the sequential examination of the entire video clip. This is a time-consuming, subjective, and expensive process. As a result, there is an urgent need for tools to automate the indexing process. In response to such needs, various video analysis techniques from the research fields of image processing and computer vision have been proposed to parse, index and annotate the massive amount of digital video data. However, most of these video analysis techniques have been developed for uncompressed video. Since most video data are stored in compressed formats for efficiency of storage and transmission, it is necessary to perform decompression on compressed video before such analysis techniques can be applied. Two consequences of having to first decompress before processing are incurring computation time for decompression and requiring extra auxiliary storage.To save on the computational cost of decompression and lower the overall size of the data which must be processed, this study attempts to make use of features available in compressed video data and proposes several video processing techniques operating directly on compressed video data. Specifically, techniques of processing MPEG-1 and MPEG-2 compressed data have been developed to help automate the video indexing process. This includes the tasks of video segmentation (shot boundary detection), camera motion characterisation, and highlights extraction (detection of skin-colour regions, text regions, moving objects and replays) in MPEG compressed video sequences. The approach of performing analysis on the compressed data has the advantages of dealing with a much reduced data size and is therefore suitable for computationally-intensive low-level operations. Experimental results show that most analysis tasks for video indexing can be carried out efficiently in the compressed domain. Once intermediate results, which are dramatically reduced in size, are obtained from the compressed domain analysis, partial decompression can be applied to enable high resolution processing to extract high level semantic information.

Diss. Umeå : Umeå universitet., 2006.