[go: up one dir, main page]

Tavakoli, 1992 - Google Patents

Analyzing information content of MR images.

Tavakoli, 1992

View PDF
Document ID
280392221811965941
Author
Tavakoli N
Publication year
Publication venue
CBMS

External Links

Snippet

The purpose ofthis paper is to analyze the information content of MR Images and provide preprocessing algorithms which can improve the compression ratio resulted from existing lossless algorithms. Two approaches are taken for this purpose; segmentation and …
Continue reading at www.academia.edu (PDF) (other versions)

Classifications

    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information or similar information or a subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
    • H03M7/42—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code using table look-up for the coding or decoding process, e.g. using read-only memory
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T9/00—Image coding, e.g. from bit-mapped to non bit-mapped
    • G06T9/005—Statistical coding, e.g. Huffman, run length coding
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information or similar information or a subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/3084—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction using adaptive string matching, e.g. the Lempel-Ziv method
    • H03M7/3088—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction using adaptive string matching, e.g. the Lempel-Ziv method employing the use of a dictionary, e.g. LZ78
    • H—ELECTRICITY
    • H03—BASIC ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information or similar information or a subset of information is represented by a different sequence or number of digits
    • H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
    • H03M7/46—Conversion to or from run-length codes, i.e. by representing the number of consecutive digits, or groups of digits, of the same kind by a code word and a digit indicative of that kind
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T9/00—Image coding, e.g. from bit-mapped to non bit-mapped
    • G06T9/001—Model-based coding, e.g. wire frame
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T9/00—Image coding, e.g. from bit-mapped to non bit-mapped
    • G06T9/007—Transform coding, e.g. discrete cosine transform
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T9/00—Image coding, e.g. from bit-mapped to non bit-mapped
    • G06T9/004—Predictors, e.g. intraframe, interframe coding

Similar Documents

Publication Publication Date Title
KR100289591B1 (en) Image data compression apparatus and method thereof, image data decompression apparatus and method thereof, image data recording and reproducing apparatus
Heer et al. Comparison of reversible methods for data compression
US5857035A (en) Arithmetic coding compressor for encoding multiple bit values
WO1997007599A1 (en) Data compression method
Tamminen Encoding pixel trees
KR100573527B1 (en) How to compress and restore graphic images
Ezhilarasu et al. Arithmetic Coding for Lossless Data Compression–A Review
Rahman et al. A semi-lossless image compression procedure using a lossless mode of JPEG
Gupta et al. Data compression-lossless and lossy techniques
Tavakoli Analyzing information content of MR images.
Kadhim et al. Exploring Text Data Compression: A Comparative Study of Adaptive Huffman and LZW Approaches
Rahman et al. Text compression based on an alternative approach of run-length coding using burrows-wheeler transform and arithmetic coding
Komma et al. Lossless Volume Data Compression Schemes.
Alkhalayleh et al. A new lossless method of image compression by decomposing the tree of Huffman technique
Lee et al. Lossless compression of medical images by prediction and classification
Tavakoli Entropy and image compression
KR100300955B1 (en) Compression and Restoration Method of Medical Image with Region of Interest
Tariq et al. Hybrid Lossless Compression Techniques for English Text
CN111431538B (en) Data compression method, system and storage medium of embedded system
Atmaja et al. Comparison of the Packet Wavelet Transform Method for Medical Image Compression
Sujatha et al. LOSSLESS IMAGE COMPRESSION USING DIFFERENT ENCODING ALGORITHM FOR VARIOUS MEDICAL IMAGES.
Nahar et al. Data compression methods and analysis
Yovanof Recent advances in lossless coding techniques
Allred et al. Lossless image compression technique for infrared thermal images
Jha et al. Near-lossless compression of x-ray images using segmentation