DocumentCode :
938810
Title :
Near merging of paths in suboptimal tree searching (Corresp.)
Author :
Hang, Hsueh-Ming ; Woods, John W.
Volume :
30
Issue :
3
fYear :
1984
fDate :
5/1/1984 12:00:00 AM
Firstpage :
567
Lastpage :
573
Abstract :
The near merging of paths in tree searching is explored. This near merging can degrade coding performance when a suboptimal search algorithm is used. The problem is first identified and then a feasible solution is presented. Some examples from image source coding using the (M, L) algorithm are given.
Keywords :
Image coding; Tree coding; Channel capacity; Decision trees; Degradation; Filters; Image coding; Instruments; Laplace equations; Merging; Quantization; Source coding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1984.1056903
Filename :
1056903
Link To Document :
بازگشت