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
33 sonuçtan 1-3 arası sonuçlar
Sayfa 63
... represent shading , for newspaper printing , say . - If instead we use an n x n matrix of on - off 1 - bit dots , we can represent n n2 + 1 levels of intensity resolution since , for example , three dots filled in any way counts as one ...
... represent shading , for newspaper printing , say . - If instead we use an n x n matrix of on - off 1 - bit dots , we can represent n n2 + 1 levels of intensity resolution since , for example , three dots filled in any way counts as one ...
Sayfa 176
... represent it . When a particular symbol s ; has a large probability ( close to 1.0 ) , log2 will be close to 0 , and assigning one bit to represent that symbol will be costly . Only when the probabilities of all symbols can be expressed ...
... represent it . When a particular symbol s ; has a large probability ( close to 1.0 ) , log2 will be close to 0 , and assigning one bit to represent that symbol will be costly . Only when the probabilities of all symbols can be expressed ...
Sayfa 187
... represent it . 1 For example , when a particular symbol s ; has a large probability ( close to 1.0 ) , log2 Pi will be close to 0 , and assigning one bit to represent that symbol will be very costly . Only when the probabilities of all ...
... represent it . 1 For example , when a particular symbol s ; has a large probability ( close to 1.0 ) , log2 Pi will be close to 0 , and assigning one bit to represent that symbol will be very costly . Only when the probabilities of all ...
İçindekiler
Preface χίν | 1 |
MPEG Video Coding II MPEG4 7 and Beyond | 12 |
Multimedia Authoring and Tools | 20 |
Telif Hakkı | |
23 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 components data compression data rate DCT coefficients decoder defined digital video encoder enhancement layer entropy coding error example Figure filter format 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 modules motion compensation motion vectors movie MPEG multimedia nodes 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 |