Abstract
Scale-space filtering has been adopted by many people, especially in the artificial intelligence domain, to study signals under varying bandwidth conditions. It is shown in this paper that scale space is also ideally suited for studying and developing coding algorithms. This leads to an extension of the well-known Laplacian pyramid coding technique.
Original language | English |
---|---|
Pages (from-to) | 1585-1591 |
Number of pages | 7 |
Journal | IEEE Transactions on Communications |
Volume | 38 |
Issue number | 9 |
DOIs | |
Publication status | Published - 1990 |