Abstract
A new efficient method, based on a differential PCM technique, for encoding the leaves of a pruned quadtree is presented. Solutions to the problems of causality maintenance during tree scanning-encoding and of fast neighbour finding are described. The result is a constant wordlength code with a remarkable rate–distortion performance.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
