A new segmentation-based losslesscompression method is proposed for colour images. The method exploits the correlation existing among the three colour planes by treating each pixel as a vector of three components, an...
详细信息
A new segmentation-based losslesscompression method is proposed for colour images. The method exploits the correlation existing among the three colour planes by treating each pixel as a vector of three components, and performing region growing and difference operations using the vectors. The method performs better than the JPEG standard by an average of 0.68 bit/pixel with a 12 image database.
A lossless compression algorithm for images based on ordered binary-decision diagrams (OBDDs) is presented. The algorithm finds an OBDD which represents the image exactly and then codes the OBDD efficiently. The resul...
详细信息
A lossless compression algorithm for images based on ordered binary-decision diagrams (OBDDs) is presented. The algorithm finds an OBDD which represents the image exactly and then codes the OBDD efficiently. The results obtained show a great improvement with respect to a previous work.
Data-compression implementations are particularly sensitive to internal faults because most inherent redundancy in the input data is minimised by the source-coding process. Fault-tolerance techniques are presented for...
详细信息
Data-compression implementations are particularly sensitive to internal faults because most inherent redundancy in the input data is minimised by the source-coding process. Fault-tolerance techniques are presented for protecting a lossless compression algorithm, arithmetic coding, that is vulnerable to temporary hardware failures. The fundamental arithmetic operations are protected by low-cost residue codes, employing new fault-tolerance methods for multiplications and additions, as recently reported. However, additional fault-tolerant design techniques are developed to protect critical steps such as normalisation and rounding, bit stuffing and index selection. These approaches integrate well with residue codes. Normalisation and rounding after multiplication are protected by efficiently modifying the multiplier to produce residue segments. The decoding step that selects the next symbol is checked by comparing local values with estimates already calculated in other parts of the decoding structure, whereas bit stuffing, a procedure for limiting very long carry propagations, is checked by modified residue values. Overhead complexity issues are discussed as rough estimates.
A lossless compression algorithm for compressing locally stationary binary data is introduced. The algorithm is based on enumerative coding. It has low complexity, and experimental results indicate that it has good co...
详细信息
A lossless compression algorithm for compressing locally stationary binary data is introduced. The algorithm is based on enumerative coding. It has low complexity, and experimental results indicate that it has good compression performance For locally stationary binary data.
暂无评论