Дисертації з теми "Coding, information theory and compression"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Coding, information theory and compression".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
Zemouri, Rachid. "Data compression of speech using sub-band coding." Thesis, University of Newcastle Upon Tyne, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.316094.
Повний текст джерелаReid, Mark Montgomery. "Path-dictated, lossless volumetric data compression." Thesis, University of Ulster, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.338194.
Повний текст джерелаShih, An-Zen. "Fractal compression analysis of superdeformed nucleus data." Thesis, University of Liverpool, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.266091.
Повний текст джерелаTang, P. S. "Data compression for high precision digital waveform recording." Thesis, City University London, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.384076.
Повний текст джерелаYamazato, Takaya, Iwao Sasase, and Shinsaku Mori. "Interlace Coding System Involving Data Compression Code, Data Encryption Code and Error Correcting Code." IEICE, 1992. http://hdl.handle.net/2237/7844.
Повний текст джерелаJiang, Jianmin. "Multi-media data compression and real-time novel architectures implementation." Thesis, University of Southampton, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239417.
Повний текст джерелаReeder, Brian Martin. "Application of artificial neural networks for spacecraft instrument data compression." Thesis, University of Sussex, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.362216.
Повний текст джерелаBeirami, Ahmad. "Network compression via network memory: fundamental performance limits." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/53448.
Повний текст джерелаFloor, Pål Anders. "On the Theory of Shannon-Kotel'nikov Mappings in Joint Source-Channel Coding." Doctoral thesis, Norwegian University of Science and Technology, Faculty of Information Technology, Mathematics and Electrical Engineering, 2008. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-2193.
Повний текст джерелаIn this thesis an approach to joint source-channel coding using direct source to channel mappings is studied. The system studied communicates i.i.d. Gaussian sources on a point-to-point Gaussian memoryless channel with limited feedback (supporting channel state information at most). The mappings, named Shannon-Kotel'nikov (SK) mappings, are memoryless mappings between the source space of dimension M and the channel space of dimension N. Such mappings can be used for error control when M
The reason for studying SK-mappings is that they are delay free, robust against varying channel conditions, and have quite good performance at low complexity.
First a theory for determining and categorizing the distortion using SK-mappings for communication is introduced and developed. This theory is further used to show that SK-mappings can reach the information theoretical bound optimal performance theoretically attainable (OPTA) when their dimension approach infinity.
One problem is to determine the overall optimal geometry of the SK-mappings. Indications on the overall geometry can be found by studying the codebooks and channel constellations of power constrained channel optimized vector quantizers (PCCOVQ). The PCCOVQ algorithm will find the optimal placing of quantizer representation vectors in the source space and channel symbols in the channel space. A PCCOVQ algorithm giving well performing mappings for the dimension reduction case has been found in the past. In this thesis the PCCOVQ algorithm is modified to give well performing dimension expanding mappings for scalar sources, and 1:2 and 1:3 PCCOVQ examples are given.
Some example SK-mappings are proposed and analyzed. 2:1 and 1:2 PCCOVQ mappings are used as inspiration for making 2:1 and 1:2 SK-mappings based on the Archimedean spiral. Further 3:1, 4:1, 3:2 and 2:3 SK-mappings are found and analyzed. All example SK-mappings are modeled mathematically using the proposed theory on SK-mappings. These mathematical models are further used to find the optimal coefficients for all the proposed SK-mappings as a function of the channel signal-to-noise ratio (CSNR), making adaptations to varying channel conditions simple.
Zhao, Jing. "Information theoretic approach for low-complexity adaptive motion estimation." [Gainesville, Fla.] : University of Florida, 2005. http://purl.fcla.edu/fcla/etd/UFE0013068.
Повний текст джерелаSu, Yong. "Mathematical modeling with applications in high-performance coding." Connect to resource, 2005. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1127139848.
Повний текст джерелаTitle from first page of PDF file. Document formatted into pages; contains xiv, 130 p.; also includes graphics (some col.). Includes bibliographical references (p. 125-130). Available online via OhioLINK's ETD Center
Zhang, Jian Electrical Engineering Australian Defence Force Academy UNSW. "Error resilience for video coding services over packet-based networks." Awarded by:University of New South Wales - Australian Defence Force Academy. School of Electrical Engineering, 1999. http://handle.unsw.edu.au/1959.4/38652.
Повний текст джерелаCai, Jianfei. "Robust error control and optimal bit allocation for image and video transmission over wireless channels /." free to MU campus, to others for purchase, 2002. http://wwwlib.umi.com/cr/mo/fullcit?p3052158.
Повний текст джерелаDupraz, Elsa. "Codage de sources avec information adjacente et connaissance incertaine des corrélations." Phd thesis, Université Paris Sud - Paris XI, 2013. http://tel.archives-ouvertes.fr/tel-00955100.
Повний текст джерелаCoben, Muhammed Z. "Region-based subband coding of image sequences." Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/15500.
Повний текст джерелаReusens, Emmanuel. "Visual data compression using the fractal theory and dynamic coding /." Lausanne : Ecole polytechnique fédérale, 1997. http://library.epfl.ch/theses/?nr=1590.
Повний текст джерелаCesbron, Fred́eŕique Chantal. "Multiresolution fractal coding of still images." Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/15508.
Повний текст джерелаNg, Cheuk-yan, and 吳卓恩. "Rate control algorithms for video coding." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2000. http://hub.hku.hk/bib/B29729361.
Повний текст джерелаNg, Cheuk-yan. "Rate control algorithms for video coding /." Hong Kong : University of Hong Kong, 2000. http://sunzi.lib.hku.hk/hkuto/record.jsp?B25151289.
Повний текст джерелаBartelmess, Johan. "Compression efficiency of different picture coding structures in High Efficiency Video Coding (HEVC)." Thesis, Uppsala universitet, Avdelningen för systemteknik, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-281926.
Повний текст джерелаKunze, Richard J. "Redundant visual coding of state information /." free to MU campus, to others for purchase, 1997. http://wwwlib.umi.com/cr/mo/fullcit?p9841208.
Повний текст джерелаMiguel, Agnieszka C. "Image compression using overcomplete wavelet representations for multiple description coding /." Thesis, Connect to this title online; UW restricted, 2001. http://hdl.handle.net/1773/5920.
Повний текст джерелаCohen, D. A. "A problem in algebraic coding theory." Thesis, University of Oxford, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.380002.
Повний текст джерелаArmitano, Robert M. "Efficient motion-estimation algorithms for video coding." Diss., Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/15397.
Повний текст джерелаRedwood-Sawyerr, J. A. S. "Constant envelope modulation coding." Thesis, University of Essex, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356049.
Повний текст джерелаYun, Hee Cheol. "Compression of computer animation frames." Diss., Georgia Institute of Technology, 1996. http://hdl.handle.net/1853/13070.
Повний текст джерелаChan, Ming-Yan. "Video encoder complexity reduction /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202005%20CHANM.
Повний текст джерелаChau, Wing San. "Key frame selection for video transcoding /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202005%20CHAU.
Повний текст джерелаSipitca, Mihai. "A conditional entropy approach to encoding DCT coefficients for low bit rate video compression." Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/13404.
Повний текст джерелаDelopoulos, Athanasios. "Coding techniques for moving images." Thesis, Imperial College London, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.338648.
Повний текст джерелаKaouri, Hussein Ali. "Speech coding using vector quantisation." Thesis, Queen's University Belfast, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356934.
Повний текст джерелаBae, Soo Hyun. "Information retrieval via universal source coding." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/26573.
Повний текст джерелаCommittee Chair: Juang, Biing-Hwang; Committee Member: Al-Regib, Ghassan; Committee Member: Linda Wiils; Committee Member: Mersereau, Russell; Committee Member: Pappas, Thrasyvoulos. Part of the SMARTech Electronic Thesis and Dissertation Collection.
Danyali, Habibollah. "Highly scalable wavelet image and video coding for transmission over heterogeneous networks." Access electronically, 2004. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20041027.115306/index.html.
Повний текст джерелаTay, David B. H. "Multidimensional multirate filter banks : some theory and design." Thesis, University of Cambridge, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.319581.
Повний текст джерела蔡固庭 and Koo-ting Choi. "Improved processing techniques for picture sequence coding." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1998. http://hub.hku.hk/bib/B31220642.
Повний текст джерелаChoi, Koo-ting. "Improved processing techniques for picture sequence coding /." Hong Kong : University of Hong Kong, 1998. http://sunzi.lib.hku.hk/hkuto/record.jsp?B20565550.
Повний текст джерелаAllott, David. "Efficient source coding for digital images." Thesis, Loughborough University, 1985. https://dspace.lboro.ac.uk/2134/27563.
Повний текст джерелаPresnell, Stuart. "Minimal resources in quantum information theory : compression and measurement." Thesis, University of Bristol, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.399944.
Повний текст джерелаMcEwen, Peter A. "Trellis coding for partial response channels /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 1999. http://wwwlib.umi.com/cr/ucsd/fullcit?p9968170.
Повний текст джерелаCheng, Niann-Tsyr. "Error resilient video coding for noisy channels." Thesis, University of Cambridge, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239176.
Повний текст джерелаLund, David J. "Reconfigurable channel coding for future communication systems." Thesis, Lancaster University, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.289042.
Повний текст джерелаSuddle, Muhammad Riaz. "Speech coding in private and broadcast networks." Thesis, University of Surrey, 1996. http://epubs.surrey.ac.uk/1019/.
Повний текст джерелаGoh, Kwong Huang. "Wavelet transform based image and video coding." Thesis, University of Strathclyde, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.387720.
Повний текст джерелаSadok, Djamel Fawzi Hadj. "Interpersonal interchange of multimedia information." Thesis, University of Kent, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.278242.
Повний текст джерелаHong, Edwin S. "Group testing for image compression /." Thesis, Connect to this title online; UW restricted, 2001. http://hdl.handle.net/1773/6900.
Повний текст джерелаLuo, Enming. "Computational complexity reduction in the spatial scalable video coding encoder /." View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?ECED%202009%20LUOE.
Повний текст джерелаShu, Yan. "Coding of motion picture residues without adaptive spatial transforms." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0030/MQ47477.pdf.
Повний текст джерелаPanchapakesan, Kannan. "A study of Trellis coded quantization for image compression /." Online version of thesis, 1996. http://hdl.handle.net/1850/11700.
Повний текст джерелаSun, Wei. "Joint Compression and Digital Watermarking: Information-Theoretic Study and Algorithms Development." Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/2890.
Повний текст джерелаFrom the information theoretic viewpoint, we first study a new digital watermarking scenario, in which watermarks and covertexts are generated from a joint memoryless watermark and covertext source. The configuration of this scenario is different from that treated in existing digital watermarking works, where watermarks are assumed independent of covertexts. In the case of public watermarking where the covertext is not accessible to the watermark decoder, a necessary and sufficient condition is determined under which the watermark can be fully recovered with high probability at the end of watermark decoding after the watermarked signal is disturbed by a fixed memoryless attack channel. Moreover, by using similar techniques, a combined source coding and Gel'fand-Pinsker channel coding theorem is established, and an open problem proposed recently by Cox et al is solved. Interestingly, from the sufficient and necessary condition we can show that, in light of the correlation between the watermark and covertext, watermarks still can be fully recovered with high probability even if the entropy of the watermark source is strictly above the standard public watermarking capacity.
We then extend the above watermarking scenario to a case of joint compression and watermarking, where the watermark and covertext are correlated, and the watermarked signal has to be further compressed. Given an additional constraint of the compression rate of the watermarked signals, a necessary and sufficient condition is determined again under which the watermark can be fully recovered with high probability at the end of public watermark decoding after the watermarked signal is disturbed by a fixed memoryless attack channel.
The above two joint compression and watermarking models are further investigated under a less stringent environment where the reproduced watermark at the end of decoding is allowed to be within certain distortion of the original watermark. Sufficient conditions are determined in both cases, under which the original watermark can be reproduced with distortion less than a given distortion level after the watermarked signal is disturbed by a fixed memoryless attack channel and the covertext is not available to the watermark decoder.
Watermarking capacities and joint compression and watermarking rate regions are often characterized and/or presented as optimization problems in information theoretic research. However, it does not mean that they can be calculated easily. In this thesis we first derive closed forms of watermarking capacities of private Laplacian watermarking systems with the magnitude-error distortion measure under a fixed additive Laplacian attack and a fixed arbitrary additive attack, respectively. Then, based on the idea of the Blahut-Arimoto algorithm for computing channel capacities and rate distortion functions, two iterative algorithms are proposed for calculating private watermarking capacities and compression and watermarking rate regions of joint compression and private watermarking systems with finite alphabets. Finally, iterative algorithms are developed for calculating public watermarking capacities and compression and watermarking rate regions of joint compression and public watermarking systems with finite alphabets based on the Blahut-Arimoto algorithm and the Shannon's strategy.
Ahmed, Mohammed Zaki. "Crosstalk-resiliant coding for high density digital recording." Thesis, University of Plymouth, 2003. http://hdl.handle.net/10026.1/2536.
Повний текст джерела