51 |
Rival penalized competitive learning for content-based indexing.January 1998 (has links)
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
|
52 |
Digital video watermarking techniques for secure multimedia creation and delivery.January 2004 (has links)
Chan Pik-Wah. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 111-130). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iv / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Background --- p.1 / Chapter 1.2 --- Research Objective --- p.3 / Chapter 1.3 --- Contributions --- p.4 / Chapter 1.4 --- The Structure of this Thesis --- p.6 / Chapter 2 --- Literature Review --- p.7 / Chapter 2.1 --- Security in Multimedia Communications --- p.8 / Chapter 2.2 --- Cryptography --- p.11 / Chapter 2.3 --- Digital Watermarking --- p.14 / Chapter 2.4 --- Essential Ingredients for Video Watermarking --- p.16 / Chapter 2.4.1 --- Fidelity --- p.16 / Chapter 2.4.2 --- Robustness --- p.17 / Chapter 2.4.3 --- Use of Keys --- p.19 / Chapter 2.4.4 --- Blind Detection --- p.20 / Chapter 2.4.5 --- Capacity and Speed --- p.20 / Chapter 2.4.6 --- Statistical Imperceptibility --- p.21 / Chapter 2.4.7 --- Low Error Probability --- p.21 / Chapter 2.4.8 --- Real-time Detector Complexity --- p.21 / Chapter 2.5 --- Review on Video Watermarking Techniques --- p.22 / Chapter 2.5.1 --- Video Watermarking --- p.25 / Chapter 2.5.2 --- Spatial Domain Watermarks --- p.26 / Chapter 2.5.3 --- Frequency Domain Watermarks --- p.30 / Chapter 2.5.4 --- Watermarks Based on MPEG Coding Struc- tures --- p.35 / Chapter 2.6 --- Comparison between Different Watermarking Schemes --- p.38 / Chapter 3 --- Novel Watermarking Schemes --- p.42 / Chapter 3.1 --- A Scene-based Video Watermarking Scheme --- p.42 / Chapter 3.1.1 --- Watermark Preprocess --- p.44 / Chapter 3.1.2 --- Video Preprocess --- p.46 / Chapter 3.1.3 --- Watermark Embedding --- p.48 / Chapter 3.1.4 --- Watermark Detection --- p.50 / Chapter 3.2 --- Theoretical Analysis --- p.52 / Chapter 3.2.1 --- Performance --- p.52 / Chapter 3.2.2 --- Capacity --- p.56 / Chapter 3.3 --- A Hybrid Watermarking Scheme --- p.60 / Chapter 3.3.1 --- Visual-audio Hybrid Watermarking --- p.61 / Chapter 3.3.2 --- Hybrid Approach with Different Water- marking Schemes --- p.69 / Chapter 3.4 --- A Genetic Algorithm-based Video Watermarking Scheme --- p.73 / Chapter 3.4.1 --- Watermarking Scheme --- p.75 / Chapter 3.4.2 --- Problem Modelling --- p.76 / Chapter 3.4.3 --- Chromosome Encoding --- p.79 / Chapter 3.4.4 --- Genetic Operators --- p.80 / Chapter 4 --- Experimental Results --- p.85 / Chapter 4.1 --- Test on Robustness --- p.85 / Chapter 4.1.1 --- Experiment with Frame Dropping --- p.87 / Chapter 4.1.2 --- Experiment with Frame Averaging and Sta- tistical Analysis --- p.89 / Chapter 4.1.3 --- Experiment with Lossy Compression --- p.90 / Chapter 4.1.4 --- Test of Robustness with StirMark 4.0 --- p.92 / Chapter 4.1.5 --- Overall Comparison --- p.98 / Chapter 4.2 --- Test on Fidelity --- p.100 / Chapter 4.2.1 --- Parameter(s) Setting --- p.101 / Chapter 4.2.2 --- Evaluate with PSNR --- p.101 / Chapter 4.2.3 --- Evaluate with MAD --- p.102 / Chapter 4.3 --- Other Features of the Scheme --- p.105 / Chapter 4.4 --- Conclusion --- p.106 / Chapter 5 --- Conclusion --- p.108 / Bibliography --- p.110
|
53 |
Internet multimedia information retrieval based on link analysis.January 2004 (has links)
Chan Ka Yan. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves i-iv (3rd gp.)). / Abstracts in English and Chinese. / ACKNOWLEDGEMENT --- p.I / ABSTRACT --- p.II / 摘要 --- p.IV / TABLE OF CONTENT --- p.VI / LIST OF FIGURE --- p.VIII / LIST OF TABLE --- p.IX / Chapter CHAPTER 1. --- INTRODUCTION --- p.1 / Chapter 1.1 --- Background --- p.1 / Chapter 1.2 --- Importance of hyperlink analysis --- p.2 / Chapter CHAPTER 2. --- RELATED WORK --- p.4 / Chapter 2.1 --- Crawling --- p.4 / Chapter 2.1.1 --- Crawling method for HITS Algorithm --- p.4 / Chapter 2.1.2 --- Crawling method for Page Rank Algorithm --- p.7 / Chapter 2.2 --- Ranking --- p.7 / Chapter 2.2.1 --- Page Rank Algorithm --- p.8 / Chapter 2.2.2 --- HITS Algorithm --- p.11 / Chapter 2.2.3 --- PageRank-HITS Algorithm --- p.15 / Chapter 2.2.4 --- SALSA Algorithm --- p.16 / Chapter 2.2.5 --- Average and Sim --- p.18 / Chapter 2.2.6 --- Netscape Approach --- p.19 / Chapter 2.2.7 --- Cocitation Approach --- p.19 / Chapter 2.3 --- Multimedia Information Retrieval --- p.20 / Chapter 2.3.1 --- Octopus --- p.21 / Chapter CHAPTER 3. --- RESEARCH METHODOLOGY --- p.25 / Chapter 3.1 --- Research Objective --- p.25 / Chapter 3.2 --- Proposed Crawling Methodology --- p.26 / Chapter 3.2.1 --- Collecting Media Objects --- p.26 / Chapter 3.2.2 --- Filtering the collection of links --- p.29 / Chapter 3.3 --- Proposed Ranking Methodology --- p.34 / Chapter 3.3.1 --- Identifying the factors affect ranking --- p.34 / Chapter 3.3.2 --- Modified Ranking Algorithms --- p.37 / Chapter CHAPTER 4. --- EXPERIMENTAL RESULTS AND DISCUSSIONS --- p.52 / Chapter 4.1 --- Experimental Setup --- p.52 / Chapter 4.1.1 --- Assumptions for the Experiment --- p.53 / Chapter 4.2 --- Some Observations from Experiment --- p.54 / Chapter 4.2.1 --- Dangling links --- p.55 / Chapter 4.2.2 --- "Good Hub = bad Authority, Good Authority = bad Hub?" --- p.55 / Chapter 4.2.3 --- Setting of weights --- p.56 / Chapter 4.3 --- Discussion on Experimental Results --- p.57 / Chapter 4.3.1 --- Relevance --- p.57 / Chapter 4.3.2 --- Precision and recall --- p.58 / Chapter 4.3.3 --- Significance testing --- p.61 / Chapter 4.3.4 --- Ranking --- p.63 / Chapter 4.4 --- Limitations and Difficulties --- p.67 / Chapter 4.4.1 --- Small size of the base set --- p.68 / Chapter 4.4.2 --- Parameter settings --- p.68 / Chapter 4.4.3 --- Unable to remove all the meaningless links from base set --- p.68 / Chapter 4.4.4 --- Resources and time-consuming --- p.69 / Chapter 4.4.5 --- TKC Effect --- p.69 / Chapter 4.4.6 --- Continuously updated format of HTML codes and file types --- p.70 / Chapter 4.4.7 --- The object citation habit of authors --- p.70 / Chapter CHAPTER 5. --- CONCLUSION --- p.71 / Chapter 5.1 --- Contribution of our Methodology --- p.71 / Chapter 5.2 --- Possible Improvement --- p.71 / Chapter 5.3 --- Conclusion --- p.72 / BIBLIOGRAPHY --- p.I / APPENDIX --- p.A-I / Chapter A.1 --- One-tailed paired t-test results --- p.A-I / Chapter A2. --- Anova results --- p.A-IV
|
54 |
Indexing methods for multimedia data objects given pair-wise distances.January 1997 (has links)
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
|
55 |
A Multi-user storyboard-based authoring system.January 1997 (has links)
by Steve Tai-Man Wong. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1997. / Includes bibliographical references (leaves 64-65). / TABLE OF FIGURES --- p.i / Chapter 1 --- INTRODUCTION --- p.1 / Chapter 1.1 --- Contributions --- p.4 / Chapter 1.2 --- Thesis Organization --- p.5 / Chapter 2 --- BACKGROUND --- p.6 / Chapter 3 --- THE MUSAS AUTHORING SYSTEM --- p.11 / Chapter 3.1 --- The Storyboard-based Authoring System and Extension --- p.11 / Chapter 3.2 --- The Editor-Authors Hierarchy --- p.18 / Chapter 3.3 --- The Multi-agents Architecture --- p.22 / Chapter 3.3.1 --- The RESAgent --- p.22 / Chapter 3.3.2 --- The SalesAgent --- p.31 / Chapter 3.3.3 --- The WatcherAgent --- p.36 / Chapter 3.3.4 --- The NeedleAgent --- p.38 / Chapter 4 --- IMPLEMENTATION --- p.42 / Chapter 4.1 --- The Project Builder --- p.42 / Chapter 4.2 --- The Timetable Editor --- p.46 / Chapter 4.3 --- The Multi-agents Architecture --- p.47 / Chapter 4.4 --- The WatcherAgent --- p.49 / Chapter 4.5 --- The SalesAgent --- p.49 / Chapter 4.6 --- The RESAgent --- p.50 / Chapter 5 --- CASE STUDY --- p.53 / Chapter 6 --- FUTURE WORK --- p.60 / Chapter 7 --- CONCLUSION --- p.62 / REFERENCES --- p.64 / Chapter APPENDIX A --- INSTALLATION PROCEDURE --- p.66 / Chapter APPENDIX B --- THE USER'S MANUAL --- p.67 / Chapter APPENDIX C --- CLASS DIAGRAMS --- p.90 / Chapter APPENDIX D --- THE PROGRAMMER'S GUIDE --- p.99
|
56 |
An ICAP-based content repurposing system for ubiquitous access to multimedia content.January 2003 (has links)
by Tam Wing-Lam. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2003. / Includes bibliographical references (leaves 55-57). / Abstracts in English and Chinese. / Acknowledgments --- p.i / Abstract --- p.ii / 哲學碩士論文摘要 --- p.iii / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Research Background --- p.2 / Chapter 1.2 --- Contribution of the Thesis --- p.5 / Chapter 1.3 --- Organization of the Thesis --- p.6 / Chapter Chapter 2 --- Content Repurposing System Architecture --- p.7 / Chapter 2.1 --- Introduction to ICAP-based Content Repurposing System --- p.7 / Chapter 2.2 --- Generic Service-enabling Platform --- p.8 / Chapter 2.3 --- Rule Engine --- p.10 / Chapter 2.4 --- ICAP-enabled Application Server --- p.10 / Chapter 2.5 --- Store-and-forward Transcoding and Streamed Transcoding --- p.11 / Chapter Chapter 3 --- Transcoding Techniques --- p.18 / Chapter 3.1 --- Text Transcoding --- p.19 / Chapter 2.2 --- Image Transcoding --- p.20 / Chapter 3.3 --- Audio Transcoding --- p.23 / Chapter 3.4 --- Video Transcoding --- p.25 / Chapter Chapter 4 --- Adaptation Policy --- p.28 / Chapter 4.1 --- Delay Analysis of Content Repurposing System --- p.30 / Chapter 4.2 --- Store-and-forward Transcoding for Image Files --- p.31 / Chapter 4.2.1 --- Distribution of Input Web Images --- p.34 / Chapter 4.2.2 --- Transcoding Web images to WBMP --- p.34 / Chapter 4.2.3 --- Adaptation policy of Transformation to WBMP --- p.36 / Chapter 4.2.4 --- Adaptation policy of JPEG images --- p.36 / Chapter 4.3 --- Streamed Transcoding for Audio/Video Files --- p.39 / Chapter 4.3.1 --- Audio Transcoding --- p.41 / Chapter 4.3.2 --- Video Transcoding --- p.42 / Chapter 4.4 --- Case Study --- p.43 / Chapter 4.4.1 --- Weak Device with Insufficient Bandwidth --- p.43 / Chapter 4.4.2 --- Weak Device with Sufficient Bandwidth --- p.43 / Chapter 4.4.3 --- Strong Device with Insufficient Bandwidth --- p.44 / Chapter Chapter 5 --- Conclusion --- p.54 / Bibliography --- p.55
|
57 |
Video content analysis and its applications for multimedia authoring of presentations /Wang, Feng. January 2006 (has links)
Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2006. / Includes bibliographical references (leaves 130-138). Also available in electronic version.
|
58 |
Arithmetic units for digital signal processing and multimedia /Wires, Kent Eugene, January 2000 (has links)
Thesis (Ph. D.)--Lehigh University, 2000. / Includes vita. Includes bibliographical references (leaves 135-142).
|
59 |
Better admission control and disk scheduling for multimedia applicationsVenkatachari, Badrinath. January 2002 (has links)
Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: multimedia; disk scheduling; admission control. Includes bibliographical references (p. 135-138).
|
60 |
Q-fabric system support for continuous online quality management /Poellabauer, Christian. January 2004 (has links) (PDF)
Thesis (Ph. D.)--Computing, Georgia Institute of Technology, 2004. / Pande, Santosh, Committee Member ; Pu, Calton, Committee Member ; Schwan, Karsten, Committee Chair ; Franke, Hubertus, Committee Member ; Eisenhauer, Greg, Committee Member. Vita. Includes bibliographical references (leaves 158-169).
|
Page generated in 0.0495 seconds