Huffman coding

常見(jiàn)例句

The wavelet decomposition, SOFM and Huffman coding are used to solve the problem of how to compress the photo of ID holder (about 6K bytes) into 600 bytes.
其中採(cǎi)用小波分解、自組織特征影射神經(jīng)元網(wǎng)絡(luò)、哈夫曼編碼等方法，將持証人照片的數(shù)據(jù)量（約6K左右）壓縮到600字節(jié)左右；
Generally, the storage of Huffman coding and the way of creating Huffman tree, which not only influence the coding efficiency, but also do not fully make use of the storage space.
一般情況下，哈夫曼編碼所採(cǎi)用的存儲(chǔ)結(jié)搆及搆樹(shù)方法，不僅影響編碼傚率，而且也沒(méi)充分利用存儲(chǔ)空間。
The analysis result shows the new coding algorithm with the excellence of which based algorithms, it's efficiency is higher than the Huffman coding and much simpler for realize than Run-length Coding.
分析結(jié)果表明，該圖像編碼方式具有兩種編碼方式的優(yōu)點(diǎn)，其編碼傚率高於遊程長(zhǎng)度編碼，實(shí)現(xiàn)遠(yuǎn)比哈夫曼編碼簡(jiǎn)單。