Fundamentals of MultimediaPearson Prentice Hall, 2004 - 560 sayfa For one-semester, advanced undergraduate/graduate-level Multimedia courses in departments of Computer Science, Engineering, CIS, and IT. This text fills a gap in the rapidly growing field of multimedia by introducing advanced programming students to the basic concepts of multimedia. Written by experienced teachers, this text evolved from materials used in class and forms the basis for all of the important topics that should be covered in a multimedia course. The material emphasizes concepts over applications and exposes students to real issues that they will encounter in the workplace. |
Kitabın içinden
86 sonuçtan 1-3 arası sonuçlar
Sayfa 171
... algorithm . A two- dimensional variant of it is usually used to code bilevel images . This algorithm uses the coded run information in the previous row of the image to code the run in the current row . A full description of this ...
... algorithm . A two- dimensional variant of it is usually used to code bilevel images . This algorithm uses the coded run information in the previous row of the image to code the run in the current row . A full description of this ...
Sayfa 173
... algorithm . This suggests that the minimum average number of bits to code each character in the word HELLO would be at least 1.92 . In this example , the Shannon - Fano algorithm uses an average of 10/5 = 2 bits to code each symbol ...
... algorithm . This suggests that the minimum average number of bits to code each character in the word HELLO would be at least 1.92 . In this example , the Shannon - Fano algorithm uses an average of 10/5 = 2 bits to code each symbol ...
Sayfa 175
... algorithm needs a total of 89 bits to encode this string , whereas the Huffman algorithm needs only 87 . As shown above , if correct probabilities ( " prior statistics " ) are available and accurate , the Huffman coding method produces ...
... algorithm needs a total of 89 bits to encode this string , whereas the Huffman algorithm needs only 87 . As shown above , if correct probabilities ( " prior statistics " ) are available and accurate , the Huffman coding method produces ...
Diğer baskılar - Tümünü görüntüle
Sık kullanılan terimler ve kelime öbekleri
algorithm allows applications audio average band bandwidth basic bitrate bits bitstream block boundary called cell channel Chapter coding coefficients color communication components compression contains create data rate decoder defined developed discussed effect encoder enhancement error estimation example Figure filter format frame frequency function given Hence important input JPEG layer locales macroblock method mode motion vectors multimedia nodes object operates original output packet picture pixels possible prediction protocol provides quantization range received reference represent result samples scale scheme segment sequence shows signal similar simple sound specified speech standard step stream symbol Table techniques texture transform transmission transmitted types usually values voice wavelet wireless
Bu kitaba yapılan referanslar
Multimedia Transcoding in Mobile and Wireless Networks Ahmad, Ashraf M.A.,Khalil, Ismail Sınırlı önizleme - 2008 |