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
92 sonuçtan 1-3 arası sonuçlar
Sayfa 69
... bit range 0 .. 7 and shrink the B range down to the 2 - bit range 0 .. 3 , making a total of 8 bits . To shrink R and G , we could simply divide the R or G byte value by ( 256/8 = ) 32 and then truncate . Then each pixel in the image ...
... bit range 0 .. 7 and shrink the B range down to the 2 - bit range 0 .. 3 , making a total of 8 bits . To shrink R and G , we could simply divide the R or G byte value by ( 256/8 = ) 32 and then truncate . Then each pixel in the image ...
Sayfa 169
... bits for all such communications would also be 2 bits . If we like , we can think of the possible number of states in our 2 - bit system as four outcomes . Each outcome has probability 1/4 . So on average , the number of bits to send ...
... bits for all such communications would also be 2 bits . If we like , we can think of the possible number of states in our 2 - bit system as four outcomes . Each outcome has probability 1/4 . So on average , the number of bits to send ...
Sayfa 506
... bits into a coder that convolves them with the generator polynomial to generate n bits . The rate of such code is defined to be . The shifting is necessary , since coding is achieved using memory ( shift ) registers . There can be more ...
... bits into a coder that convolves them with the generator polynomial to generate n bits . The rate of such code is defined to be . The shifting is necessary , since coding is achieved using memory ( shift ) registers . There can be more ...
İçindekiler
MPEG Video Coding II MPEG4 7 and Beyond | 12 |
1 | 18 |
3 | 33 |
Telif Hakkı | |
25 diğer bölüm gösterilmiyor
Diğer baskılar - Tümünü görüntüle
Sık kullanılan terimler ve kelime öbekleri
algorithm applications arithmetic coding audio bandwidth basic bitrate bitstream block byte channel Chapter chrominance coder codeword color image components data compression data rate DCT coefficients decoder defined digital video encoder enhancement layer entropy coding error example Figure filter frame frequency function gamma correction graphics HDTV header histogram Huffman coding IDCT IEEE image compression input JBIG2 JPEG JPEG-LS kbps keyframe lossless lossy macroblock masking Mbps method MIDI mode motion compensation motion vectors movie MPEG multimedia node NTSC number of bits objects output P-frame packet parameters pixels prediction protocol quantization range reconstructed result samples scalability scale scan scheme segment sequence shows signal simple sound spatial specified speech sprite standard subband symbol Table texture tone transmission transmitted types values variable-length coding VRML wavelet transform window zero
Bu kitaba yapılan referanslar
Multimedia Transcoding in Mobile and Wireless Networks Ahmad, Ashraf M.A.,Khalil, Ismail Sınırlı önizleme - 2008 |