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 ) , log 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 ) , log 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 ...
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 |