US20140327737A1 - Method and Apparatus to Perform Optimal Visually-Weighed Quantization of Time-Varying Visual Sequences in Transform Space - Google Patents

Method and Apparatus to Perform Optimal Visually-Weighed Quantization of Time-Varying Visual Sequences in Transform Space Download PDF

Info

Publication number
US20140327737A1
US20140327737A1 US14/266,645 US201414266645A US2014327737A1 US 20140327737 A1 US20140327737 A1 US 20140327737A1 US 201414266645 A US201414266645 A US 201414266645A US 2014327737 A1 US2014327737 A1 US 2014327737A1
Authority
US
United States
Prior art keywords
symbols
visual data
calculated
probability
conditional expectation
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US14/266,645
Inventor
Raymond John Westwater
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZPEG Inc
Original Assignee
Raymond John Westwater
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Raymond John Westwater filed Critical Raymond John Westwater
Priority to US14/266,645 priority Critical patent/US20140327737A1/en
Publication of US20140327737A1 publication Critical patent/US20140327737A1/en
Assigned to ZPEG, INC. reassignment ZPEG, INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: WESTWATER, RAYMOND
Priority to US15/189,242 priority patent/US10021423B2/en
Abandoned legal-status Critical Current

Links

Images

Classifications

    • H04N19/00769—
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • H04N19/625—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using discrete cosine transform [DCT]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/124—Quantisation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/129—Scanning of coding units, e.g. zig-zag scan of transform coefficients or flexible macroblock ordering [FMO]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/136—Incoming video signal characteristics or properties
    • H04N19/14—Coding unit complexity, e.g. amount of activity or edge presence estimation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
    • H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/18—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a set of transform coefficients
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/182—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a pixel
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • H04N19/63—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using sub-band based transform, e.g. wavelets
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/91—Entropy coding, e.g. variable length coding [VLC] or arithmetic coding

Definitions

  • the present invention relates generally to compression of still image and moving video data, and more particularly to the application of calculation of statistics of the behavior of the quantized transform representation of the video from the measured variances and the measured correlations in pixel space.
  • the video streams can be collected into successive refinement streams (progressive mode), and the probabilities of the constructed symbols can be calculated for the purposes of entropy removal.
  • the measured variances and correlations suffice to reconstruct the compressed video streams for any frame or group of frames.
  • an input stream 1010 is transform coded 1020 , after which a process of motion estimation 1030 followed by equal-weight quantization 1040 or a process of visually-weighted quantization 1050 takes place, the resulting data is sequenced into transmission order 1060 , symbols are collected 1070 , and an entropy removal step 1080 results in a compressed data stream 1090 .
  • the essential innovation of the current invention is in the area of prediction of statistical behavior, which influences the process of transmission order sequence, symbol collection, and entropy removal. The current invention does not address the topic of motion estimation.
  • the JPEG zig-zag transmission order illustrated in FIG. 2 is a standard prior-art means of sequencing quantized coefficients into transmission order using a fixed pattern based on the average of statistics collected across a variety of sample content.
  • the JPEG zig-zag order is a simple pattern which orders coefficients roughly into the order of increasing probability of zero.
  • the JPEG zig-zag order is applied to one fixed-size block of the image at a time.
  • FIG. 3 depicts a plurality of two 8 ⁇ 8 quantized transform blocks 3010 covered by a plurality of three spectral bands, of which spectral band 3020 is typical. Data is collected within the band across all blocks 3030 and symbols are collected from the data within each band, which is then entropy coded and transmitted.
  • FIG. 3 b depicts a plurality of two 8 ⁇ 8 quantized transform blocks represented by a typical 2 ⁇ 2 entry 3110 .
  • the 2 ⁇ 2 entry of eight-bit numbers is divided into two successive refinement bands of four-bit representation, one of which is depicted 3120 .
  • the first four bits are collected across transform blocks into a transmission stream 3130 from which symbols will be collected and entropy coding will take place.
  • the second four bits are similarly collected into transmission stream 3140 .
  • FIG. 3 c depicts a first-transmitted low-resolution image 3210 , followed by a second-transmitted medium-resolution image 3220 , and a final high-resolution image 3230 .
  • Each separate-resolution image is used to create its own transmission stream.
  • FIG. 4 depicts typical prior-art means of communicating entropy encoding statistics between compressing and decompressing apparatuses. It should be noted that these entropy statistics may be represented directly as a table of relative probabilities for the purposes of arithmetic encoding, or as Huffman tables.
  • the original JPEG specification provides for a pre-defined entropy pre-shared encoding table as depicted in FIG. 4 a .
  • a preshared table 4020 is known to compressor 4010 , and is used to generate the compressed data stream 4030 .
  • the preshared table 4050 known to the decompressor 4040 is used to decompress the received data stream.
  • Pre-shared tables are intended to provide good compression based on the collection of statistics for a large collection of images.
  • tables may be dynamically calculated and embedded in the transmission stream.
  • a compressor 4110 calculates a table 4120 , which it then transmits in-band 4130 in the compressed transmission stream 4140 .
  • the decompressor 4150 reads an in-band table 4160 and uses it to decompress the following compressed stream. This strategy enables better compression at the overhead cost of hundreds to thousands of bytes.
  • Each JPEG-2000 progressive transmission approach described above in FIG. 3 requires assembly of symbols over each progressive decomposition step (spectral band, successively bit representation, or resolution), giving different symbols and symbol distributions.
  • a JPEG-2000 compressor 4210 calculates up to four entropy coding tables 4220 which it then transmits in-band 4230 in the compressed transmission stream 4240 .
  • the decompressor 4250 reads the in-band tables 4260 and uses them, as selected by each progressive stream, to decompress the following compressed data. If the tables are calculated to reflect typical progressive stream behavior, the tables may potentially be reusable.
  • a method for the optimal rearrangement of components into a transmission stream based on the calculated variance of individual quantized transform components from the measured variance and correlation of the raw untransformed visual samples.
  • a second aspect of the invention provides a method for the optimal calculation of entropy reduction tables for a transmission stream based on the calculated symbol probabilities based on the calculated probability distributions of individual quantized transform components.
  • a final aspect of the invention provides a method for the parallel construction of transmission stream rearrangement, symbol construction and entropy tables between compressing apparatus and decompressing apparatus via communication of the measured variances and correlations of the raw untransformed visual samples.
  • FIG. 1 depicts a prior-art compressor decomposed into the steps of transformation, quantization, transmission order sequencing, symbol collection, and entropy removal.
  • FIG. 2 depicts a prior-art compressor featuring per-block transmission order sequencing.
  • FIG. 3 depicts a prior-art compressor featuring three forms of progressive transmission order encoding; spectral selection, successive refinement, and hierarchical.
  • FIG. 4 depicts a prior-art compressor featuring various means of communication of entropy coding tables; pre-shared, in-band, and multiple tables.
  • FIG. 5 depicts a typical embodiment of the current invention into a compression apparatus and a decompression apparatus.
  • FIG. 6 depicts the steps typically required of a compression unit in order to perform block-by-block compression.
  • FIG. 7 illustrated hierarchical subband decomposition and compression.
  • FIG. 8 illustrates the calculations required to model per-quantized transform component variance from pixel variance and pixel correlation.
  • FIG. 9 illustrates the calculations required to predict per-symbol probabilities from quantized transform component variances.
  • FIG. 5 depicts a compression apparatus 5010 and a decompression apparatus 5020 .
  • Said compression apparatus 5010 is fed a sequential stream of visual data 5110 , and factors said sequential stream of visual data 5110 into a plurality of multidimensional subblocks 5120 .
  • Said plurality of multidimensional subblocks 5120 is processed singly or jointly by a correlation measurement unit 5130 to produce a flow of measured variance values and measured correlation values to the decompression apparatus 5210 and a duplicate flow of measured variance values and measured correlation values to a compressor 5140 .
  • a compression unit 5150 uses said duplicate flow of measured variance values and measured correlation values to a compressor 5140 and said plurality of multidimensional subblocks 5120 to produce a compressed stream to the decompression apparatus 5220 .
  • Said decompression apparatus 5020 is compressed of a decompressor 5310 which processes said flow of measured variance values and measured correlation values to the decompression apparatus 5210 and said compressed stream to the decompression apparatus 5220 to produce a plurality of reconstructed multidimensional subblocks 5320 .
  • FIG. 6 depicts a decomposition of said compression apparatus 6010 into typical processing steps used to perform individual block-by-block compression.
  • Said flow of measured variance values and measured correlation values to the decompression apparatus 5210 results in a set of variance values and correlation values in the x, y and z directions valid for one subblock 6110 of said plurality of multidimensional subblocks.
  • Said set of kmeasured variance values and measured correlation values in the x, y and z directions valid for one subblock 6020 is processed through a step 6030 which calculates the variances for said quantized transform components of said one subblock 6110 .
  • said calculated variances for said quantized transform components of said one subblock from said step 6030 is used to calculate relative probabilities for each symbol.
  • the quantized transform components of said one subblock 6110 of said plurality of multidimensional subblocks processed through a step 6120 to reorder quantized transform components into order of greatest probability of zero (lowest variance).
  • Said step 6120 uses said calculated variances for said quantized transform components from said step 6030 to perform its sort processing.
  • Said reordered quantized transform components are then processed through a step 6130 of collection of said reordered quantized transform components into symbols.
  • Each said collected symbol is then processed through a step 6140 of entropy coding of said symbol into a short sequence of bits.
  • Said step 6140 uses said calculated relative probabilities for each symbol from said step 6040 in its entropy-removing calculations.
  • Said short sequence of bits is finally processed through an aggregation step 6150 to concatenate generated bit sequences into a transport stream.
  • FIG. 7 depicts a typical implementation of the hierarchical type of progressive transmission.
  • a sequential stream of visual data 7010 is subsampled from said sequential stream of visual data 5110 .
  • Said subsampled sequential stream of visual data 7010 is factored into a plurality of multidimensional subblocks 7020 .
  • Said plurality of multidimensional subblocks 7020 is then processed subblock by subblock by said compression unit 5150 to produce a sequence of compressed bits for transmission.
  • a higher-resolution sequential stream of visual data less subband data 7110 may be processed.
  • Said higher-resolution sequential stream of visual data less subband data 7110 is comprised of sequential stream of visual data 5110 where each and every coefficient comprising said subsampled sequential stream of visual data 7010 is set to 0 with a variance of 0.
  • Said higher-resolution sequential stream of visual data less subband data 7110 is factored into a plurality of multidimensional subblocks 7120 .
  • Said plurality of multidimensional subblocks 7120 is then processed subblock by subblock by said compression unit 5150 to produce a sequence of compressed bits for transmission.
  • FIG. 8 illustrates the calculations required to model per-quantized transform component variance from pixel variance and pixel correlation.
  • a matrix DCT x 8010 is comprised of the individual constants of discrete cosine transform convolution. Said matrix DCT x 8010 is shown with the discrete cosine transform of a 4 ⁇ 4 convolution, but may in practice be composed of any orthonormal transform. Similar matrices DCT y and DCT z (in the case of three-dimensional said multidimensional subblocks 7120 ) will assume the length of each dimension of the said multidimensional subblocks 7020 .
  • a covariance matrix A pixel,x 8020 is composed of the multiplication of said measured pixel variance in the x direction by the autocorrelation matrix derived from said measured pixel correlation in the x direction. Similar matrices A pixel,y and A pixel,z (in the case of three-dimensional said multidimensional subblocks 7120 ) will utilize the measured pixel variance, pixel correlations and length of each dimension of the said multidimensional subblocks 7020 .
  • DCT covariance matrix A x 8030 is calculated as the product of said matrix DCT x 8010 , said covariance matrix A pixel,x 8020 , and the transpose of said matrix DCT x 8010 .
  • the variance of the quantized transform component 8040 of index u,v,w within said multidimensional subblocks 7020 , ⁇ 2 u,v,w is calculated as the product of the trace of said DCT covariance matrix A x 8030 with the trace of said DCT covariant matrix A y (and with the trace of said DCT covariant matrix A z if said multidimensional subblocks 7020 are three-dimensional) divided by the quantizer value for said quantized transform component 8040 of index u,v,w within said multidimensional subblocks 7020 .
  • FIG. 9 illustrates the process of calculating symbol probabilities.
  • the maximum number of bits subblock N MAX,u,v,w 9010 required to encode any said quantized transform component of index u,v,w within said quantized transform is calculated as the rounded-up integer of the logarithm base 2 of the product of the number of bits representing each pixel N IN , the square root of the product of the lengths of said multidimensional blocks divided by the quantizer Q u,v,w of said quantized transform component.
  • a typical symbol S u,v,w (r,b) 9040 comprised of a run length of r zeros followed by a non-zero value of length b is calculated as the conditional probability the each symbol in the order of said rearrangement of said quantized transform component within said quantized transform subblock.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Discrete Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Abstract

Pure transform-based technologies, such as the DCT or wavelets, can leverage a mathematical model based on few or one parameters to generate the expected distribution of the transform components' energy, and generate ideal entropy removal configuration data continuously responsive to changes in video behavior. Construction of successive-refinement streams is supported by this technology, permitting response to changing channel conditions. Lossless compression is also supported by this process. The embodiment described herein uses a video correlation model to develop optimal entropy removal tables and optimal transmission sequence based on a combination of descriptive characteristics of the video source, enabling independent derivation of said optimal entropy removal tables and optimal transmission sequence in both encoder and decoder sides of the compression and playback process.

Description

    FEDERALLY SPONSORED RESEARCH
  • Not Applicable.
    • PATENT CASE TEXT
  • This application claims benefit of a prior filed U.S. provisional application Ser. No. Ser. 61/818,423, filed May 1, 2013.
    • BACKGROUND
  • 1. Field of Invention
  • The present invention relates generally to compression of still image and moving video data, and more particularly to the application of calculation of statistics of the behavior of the quantized transform representation of the video from the measured variances and the measured correlations in pixel space. Once the statistical behavior of the video is modeled, the video streams can be collected into successive refinement streams (progressive mode), and the probabilities of the constructed symbols can be calculated for the purposes of entropy removal. The measured variances and correlations suffice to reconstruct the compressed video streams for any frame or group of frames.
  • 2. Description of Prior Art
  • As depicted in FIG. 1, most prior-art still image and motion video compression algorithms perform a similar sequence of steps: an input stream 1010 is transform coded 1020, after which a process of motion estimation 1030 followed by equal-weight quantization 1040 or a process of visually-weighted quantization 1050 takes place, the resulting data is sequenced into transmission order 1060, symbols are collected 1070, and an entropy removal step 1080 results in a compressed data stream 1090. The essential innovation of the current invention is in the area of prediction of statistical behavior, which influences the process of transmission order sequence, symbol collection, and entropy removal. The current invention does not address the topic of motion estimation.
  • The JPEG zig-zag transmission order illustrated in FIG. 2 is a standard prior-art means of sequencing quantized coefficients into transmission order using a fixed pattern based on the average of statistics collected across a variety of sample content. The JPEG zig-zag order is a simple pattern which orders coefficients roughly into the order of increasing probability of zero. The JPEG zig-zag order is applied to one fixed-size block of the image at a time.
  • As depicted in FIG. 3, the prior-art JPEG-2000 standard implements various forms of progressive transmission, including spectral selection (FIG. 3 a), successive refinement (FIG. 3 b), and hierarchical (FIG. 3 c). FIG. 3 a depicts a plurality of two 8×8 quantized transform blocks 3010 covered by a plurality of three spectral bands, of which spectral band 3020 is typical. Data is collected within the band across all blocks 3030 and symbols are collected from the data within each band, which is then entropy coded and transmitted.
  • FIG. 3 b depicts a plurality of two 8×8 quantized transform blocks represented by a typical 2×2 entry 3110. The 2×2 entry of eight-bit numbers is divided into two successive refinement bands of four-bit representation, one of which is depicted 3120. The first four bits are collected across transform blocks into a transmission stream 3130 from which symbols will be collected and entropy coding will take place. The second four bits are similarly collected into transmission stream 3140.
  • FIG. 3 c depicts a first-transmitted low-resolution image 3210, followed by a second-transmitted medium-resolution image 3220, and a final high-resolution image 3230. Each separate-resolution image is used to create its own transmission stream.
  • FIG. 4 depicts typical prior-art means of communicating entropy encoding statistics between compressing and decompressing apparatuses. It should be noted that these entropy statistics may be represented directly as a table of relative probabilities for the purposes of arithmetic encoding, or as Huffman tables.
  • The original JPEG specification provides for a pre-defined entropy pre-shared encoding table as depicted in FIG. 4 a. A preshared table 4020 is known to compressor 4010, and is used to generate the compressed data stream 4030. The preshared table 4050 known to the decompressor 4040 is used to decompress the received data stream. Pre-shared tables are intended to provide good compression based on the collection of statistics for a large collection of images.
  • As illustrated in FIG. 4 b, tables may be dynamically calculated and embedded in the transmission stream. A compressor 4110 calculates a table 4120, which it then transmits in-band 4130 in the compressed transmission stream 4140. The decompressor 4150 reads an in-band table 4160 and uses it to decompress the following compressed stream. This strategy enables better compression at the overhead cost of hundreds to thousands of bytes.
  • Each JPEG-2000 progressive transmission approach described above in FIG. 3 requires assembly of symbols over each progressive decomposition step (spectral band, successively bit representation, or resolution), giving different symbols and symbol distributions. As depicted in FIG. 4 c, a JPEG-2000 compressor 4210 calculates up to four entropy coding tables 4220 which it then transmits in-band 4230 in the compressed transmission stream 4240. The decompressor 4250 reads the in-band tables 4260 and uses them, as selected by each progressive stream, to decompress the following compressed data. If the tables are calculated to reflect typical progressive stream behavior, the tables may potentially be reusable.
  • Much effort has been expended in the incremental increase of efficiency in the communication of entropy coding statistics between compressing and decompressing apparatuses, but no significant advances can be claimed over the prior-are techniques described herein. The current invention discloses a far more efficient means of developing entropy tables independently in compressor and decompressor.
    • SUMMARY OF INVENTION
  • In accordance with one aspect of the invention, a method is provided for the optimal rearrangement of components into a transmission stream based on the calculated variance of individual quantized transform components from the measured variance and correlation of the raw untransformed visual samples.
  • A second aspect of the invention provides a method for the optimal calculation of entropy reduction tables for a transmission stream based on the calculated symbol probabilities based on the calculated probability distributions of individual quantized transform components.
  • A final aspect of the invention provides a method for the parallel construction of transmission stream rearrangement, symbol construction and entropy tables between compressing apparatus and decompressing apparatus via communication of the measured variances and correlations of the raw untransformed visual samples.
    • BRIEF DESCRIPTION OF THE DRAWINGS
  • FIG. 1 depicts a prior-art compressor decomposed into the steps of transformation, quantization, transmission order sequencing, symbol collection, and entropy removal.
  • FIG. 2 depicts a prior-art compressor featuring per-block transmission order sequencing.
  • FIG. 3 depicts a prior-art compressor featuring three forms of progressive transmission order encoding; spectral selection, successive refinement, and hierarchical.
  • FIG. 4 depicts a prior-art compressor featuring various means of communication of entropy coding tables; pre-shared, in-band, and multiple tables.
  • FIG. 5 depicts a typical embodiment of the current invention into a compression apparatus and a decompression apparatus.
  • FIG. 6 depicts the steps typically required of a compression unit in order to perform block-by-block compression.
  • FIG. 7 illustrated hierarchical subband decomposition and compression.
  • FIG. 8 illustrates the calculations required to model per-quantized transform component variance from pixel variance and pixel correlation.
  • FIG. 9 illustrates the calculations required to predict per-symbol probabilities from quantized transform component variances.
    •  DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
  • FIG. 5 depicts a compression apparatus 5010 and a decompression apparatus 5020. Said compression apparatus 5010 is fed a sequential stream of visual data 5110, and factors said sequential stream of visual data 5110 into a plurality of multidimensional subblocks 5120. Said plurality of multidimensional subblocks 5120 is processed singly or jointly by a correlation measurement unit 5130 to produce a flow of measured variance values and measured correlation values to the decompression apparatus 5210 and a duplicate flow of measured variance values and measured correlation values to a compressor 5140. A compression unit 5150 uses said duplicate flow of measured variance values and measured correlation values to a compressor 5140 and said plurality of multidimensional subblocks 5120 to produce a compressed stream to the decompression apparatus 5220. Said decompression apparatus 5020 is compressed of a decompressor 5310 which processes said flow of measured variance values and measured correlation values to the decompression apparatus 5210 and said compressed stream to the decompression apparatus 5220 to produce a plurality of reconstructed multidimensional subblocks 5320.
  • FIG. 6 depicts a decomposition of said compression apparatus 6010 into typical processing steps used to perform individual block-by-block compression. Said flow of measured variance values and measured correlation values to the decompression apparatus 5210 results in a set of variance values and correlation values in the x, y and z directions valid for one subblock 6110 of said plurality of multidimensional subblocks. Said set of kmeasured variance values and measured correlation values in the x, y and z directions valid for one subblock 6020 is processed through a step 6030 which calculates the variances for said quantized transform components of said one subblock 6110. In a further processing step 6040, said calculated variances for said quantized transform components of said one subblock from said step 6030 is used to calculate relative probabilities for each symbol.
  • The quantized transform components of said one subblock 6110 of said plurality of multidimensional subblocks processed through a step 6120 to reorder quantized transform components into order of greatest probability of zero (lowest variance). Said step 6120 uses said calculated variances for said quantized transform components from said step 6030 to perform its sort processing.
  • Said reordered quantized transform components are then processed through a step 6130 of collection of said reordered quantized transform components into symbols. Each said collected symbol is then processed through a step 6140 of entropy coding of said symbol into a short sequence of bits. Said step 6140 uses said calculated relative probabilities for each symbol from said step 6040 in its entropy-removing calculations.
  • Said short sequence of bits is finally processed through an aggregation step 6150 to concatenate generated bit sequences into a transport stream.
  • FIG. 7 depicts a typical implementation of the hierarchical type of progressive transmission. A sequential stream of visual data 7010 is subsampled from said sequential stream of visual data 5110. Said subsampled sequential stream of visual data 7010 is factored into a plurality of multidimensional subblocks 7020. Said plurality of multidimensional subblocks 7020 is then processed subblock by subblock by said compression unit 5150 to produce a sequence of compressed bits for transmission.
  • Once said subsampled sequential stream of visual data 7010 has been processed through said compression unit 5150, a higher-resolution sequential stream of visual data less subband data 7110 may be processed. Said higher-resolution sequential stream of visual data less subband data 7110 is comprised of sequential stream of visual data 5110 where each and every coefficient comprising said subsampled sequential stream of visual data 7010 is set to 0 with a variance of 0. Said higher-resolution sequential stream of visual data less subband data 7110 is factored into a plurality of multidimensional subblocks 7120. Said plurality of multidimensional subblocks 7120 is then processed subblock by subblock by said compression unit 5150 to produce a sequence of compressed bits for transmission.
  • FIG. 8 illustrates the calculations required to model per-quantized transform component variance from pixel variance and pixel correlation. A matrix DCT x 8010 is comprised of the individual constants of discrete cosine transform convolution. Said matrix DCT x 8010 is shown with the discrete cosine transform of a 4×4 convolution, but may in practice be composed of any orthonormal transform. Similar matrices DCTy and DCTz (in the case of three-dimensional said multidimensional subblocks 7120) will assume the length of each dimension of the said multidimensional subblocks 7020.
  • A covariance matrix A pixel,x 8020 is composed of the multiplication of said measured pixel variance in the x direction by the autocorrelation matrix derived from said measured pixel correlation in the x direction. Similar matrices Apixel,y and Apixel,z (in the case of three-dimensional said multidimensional subblocks 7120) will utilize the measured pixel variance, pixel correlations and length of each dimension of the said multidimensional subblocks 7020.
  • DCT covariance matrix A x 8030 is calculated as the product of said matrix DCT x 8010, said covariance matrix A pixel,x 8020, and the transpose of said matrix DCT x 8010.
  • The variance of the quantized transform component 8040 of index u,v,w within said multidimensional subblocks 7020, σ2 u,v,w, is calculated as the product of the trace of said DCT covariance matrix A x 8030 with the trace of said DCT covariant matrix Ay (and with the trace of said DCT covariant matrix Az if said multidimensional subblocks 7020 are three-dimensional) divided by the quantizer value for said quantized transform component 8040 of index u,v,w within said multidimensional subblocks 7020.
  • FIG. 9 illustrates the process of calculating symbol probabilities. The maximum number of bits subblock N MAX,u,v,w 9010 required to encode any said quantized transform component of index u,v,w within said quantized transform is calculated as the rounded-up integer of the logarithm base 2 of the product of the number of bits representing each pixel NIN, the square root of the product of the lengths of said multidimensional blocks divided by the quantizer Qu,v,w of said quantized transform component.
  • The probability pu,v,w(x==0) 9020 that any quantized transform component of index u,v,w within said quantized transform subblock is 0 is calculated from the Cumulative Distribution Function of a normal distribution with expectation of 0 and variance equal to that of said quantized transform component of index u,v,w within said quantized transform.
  • The probability pu,v,w(log2(x)==n) 9030 that any quantized transform component of index u,v,w within said quantized transform subblock has n bits in its representation is calculated from the Cumulative Distribution Function of a normal distribution with expectation of 0 and variance equal to that of said quantized transform component of index u,v,w within said quantized transform.
  • A typical symbol Su,v,w(r,b) 9040 comprised of a run length of r zeros followed by a non-zero value of length b is calculated as the conditional probability the each symbol in the order of said rearrangement of said quantized transform component within said quantized transform subblock. The probability of the ith quantized transform component following quantized transform component index u,v,w within said quantized transform subblock being 0 is written p(u,v,w)+i(x==0). The probability of the rth quantized transform component following quantized transform component index u,v,w within said quantized transform subblock requiring b bits is written p(u,v,w)+r(log2(x)==b).
  • Conclusion
  • While the present invention has been described in its preferred version or embodiment with some degree of particularity, it is understood that this description is intended as an example only, and that numerous changes in the composition or arrangements of apparatus elements and process steps may be made within the scope and spirit of the invention. In particular, rearrangement and recalculation of statistics may be made to support various modes of progressive transmission, including spectral banding or bitwise refinement. Further, pixel statistics may be measured and transmitted on a per-block or global basis, and may be measured in each dimension or averaged across all dimensions. Block sizes may also be taken to be as large as the entire frame, as would be typical when using the wavelet transform.
  • With regard to the processes, systems, methods, heuristics, etc. described herein, it should be understood that, although the steps of such processes, etc. have been described as occurring according to a certain ordered sequence, such processes could be practiced with the described steps performed in an order other than the order described herein. It further should be understood that certain steps could be performed simultaneously, that other steps could be added, or that certain steps described herein could be omitted. In other words, the descriptions of processes herein are provided for the purpose of illustrating certain embodiments, and should in no way be construed so as to limit the claimed invention.
  • Accordingly, it is to be understood that the above description is intended to be illustrative and not restrictive. Many embodiments and applications other than the examples provided would be apparent to those of skill in the art upon reading the above description. The scope of the invention should be determined, not with reference to the above description, but should instead be determined with reference to the appended claims, along with the full scope of equivalents to which such claims are entitled. It is anticipated and intended that future developments will occur in the arts discussed herein, and that the disclosed systems and methods will be incorporated into such future embodiments. In sum, it should be understood that the invention is capable of modification and variation and is limited only by the following claims.
  • All terms used in the claims are intended to be given their broadest reasonable constructions and their ordinary meanings as understood by those skilled in the art unless an explicit indication to the contrary in made herein. In particular, use of the singular articles such as “a,” “the,” “said,” etc. should be read to recite one or more of the indicated elements unless a claim recites an explicit limitation to the contrary.

Claims (30)

1. An apparatus comprised of a compressor and decompressor and a method for generating an optimally compressed representation of multidimensional visual data after transformation by a multidimensional orthogonal transform of a specified transformation block size, after quantization by coefficients of said transformation block size, and after rearrangement of said quantized coefficients into a transmission sequence, and after collection of said quantized transformation coefficients into symbols, by the application of said quantized decorrelating transform to a plurality of measured variances of uncompressed multidimensional visual data and measured correlation coefficients of uncompressed multidimensional visual data to calculate the probability distribution of each quantized transform coefficient required to perform entropy removal,
2. The method of claim 1 where said orthogonal transform is the discrete cosine transform,
3. The method of claim 1 where said multidimensional visual data comprises a two-dimensional still image,
4. The method of claim 3 where said transformation block size comprises the entire image,
5. The method of claim 3 where said plurality of measured variances of uncompressed multidimensional visual data is one averaged value per block and said plurality of correlation coefficients is one averaged value per frame,
6. The method of claim 3 where said plurality of measured variances of uncompressed multidimensional visual data is one averaged value per block and said plurality of correlation coefficients is one averaged value per block,
7. The method of claim 3 where said plurality of measured variances of uncompressed multidimensional visual data is one averaged value per dimension per frame and said plurality of correlation coefficients is one averaged value per dimension per frame,
8. The method of claim 3 where said plurality of measured variances of uncompressed multidimensional visual data is one averaged value per block and said plurality of correlation coefficients is one averaged value per dimension per block,
9. The method of claim 1 where said multidimensional visual data comprises a three-dimensional moving video sequence,
10. The method of claim 9 where said transformation block size comprises a number of frames by the entire size of a single frame,
11. The method of claim 9 where said plurality of measured variances of uncompressed multidimensional visual data is one averaged value per group of frames and said plurality of correlation coefficients is one averaged value per group of frames,
12. The method of claim 9 where said plurality of measured variances of uncompressed multidimensional visual data is one averaged value per block and said plurality of correlation coefficients is one averaged value per block,
13. The method of claim 9 where said plurality of measured variances of uncompressed multidimensional visual data is one averaged value per dimension per group of frames and said plurality of correlation coefficients is one averaged value per dimension per group of frames,
14. The method of claim 9 where said plurality of measured variances of uncompressed multidimensional visual data is one averaged value per dimension per block and said plurality of correlation coefficients is one averaged value per dimension per block,
15. The method of claim 1 where said quantizers are all ones,
16. The method of claim 1 where said quantizers are all equal,
17. The method of claim 1 where said quantizers are visually weighed,
18. The method of claim 1 where coefficients are organized within each block into order of decreasing calculated component variance,
19. The method of claim 18 where the probability of symbols is calculated from a definition of a plurality of symbols as collected from sequences of component values whose conditional expectation is zero followed by the actual non-zero value, a plurality of symbols as collected from sequences of component values whose conditional expectation is zero followed by the number of bits required to represent the non-zero value, an end-of-block symbol whose conditional expectation is calculated from the cumulative probability of a sequence of symbols comprised solely of zeroes, and an escape symbol whose conditional expectation is calculated from the accumulation of the probability of all symbols not otherwise defined.
20. The method of claim 1 where coefficients are organized across blocks into order of decreasing calculated component variance,
21. The method of claim 20 where the probability of symbols is calculated from a definition of a plurality of symbols as collected from sequences of component values whose conditional expectation is zero followed by the actual non-zero value, a plurality of symbols as collected from sequences of component values whose conditional expectation is zero followed by the number of bits required to represent the non-zero value, an end-of-block symbol whose conditional expectation is calculated from the cumulative probability of a sequence of symbols comprised solely of zeroes, and an escape symbol whose conditional expectation is calculated from the accumulation of the probability of all symbols not otherwise defined.
22. The method of claim 1 where coefficients are organized across blocks into bands of decreasing calculated component variance within of order successive refinement,
23. The method of claim 22 where the probability of symbols is calculated from a definition of a plurality of symbols as collected from sequences of component values whose conditional expectation is zero followed by the actual non-zero value, a plurality of symbols as collected from sequences of component values whose conditional expectation is zero followed by the number of bits required to represent the non-zero value, an end-of-block symbol whose conditional expectation is calculated from the cumulative probability of a sequence of symbols comprised solely of zeroes, and an escape symbol whose conditional expectation is calculated from the accumulation of the probability of all symbols not otherwise defined.
24. The method of claim 1 where coefficients are organized across blocks into bands of equal weight in order of decreasing calculated component variance,
25. The method of claim 24 where the probability of symbols is calculated from a definition of a plurality of symbols as collected from sequences of component values whose conditional expectation is zero followed by the actual non-zero value, a plurality of symbols as collected from sequences of component values whose conditional expectation is zero followed by the number of bits required to represent the non-zero value, an end-of-block symbol whose conditional expectation is calculated from the cumulative probability of a sequence of symbols comprised solely of zeroes, and an escape symbol whose conditional expectation is calculated from the accumulation of the probability of all symbols not otherwise defined.
26. The method of claim 1 where Huffman coding based used to perform entropy removal on the constructed stream of symbols,
27. The method of claim 26 where said measured variances of uncompressed multidimensional visual data and said measured correlations of uncompressed multidimensional visual data are communicated between compressor and decompressor,
28. The method of claim 1 where arithmetic coding based is used to perform entropy removal on the constructed stream of symbols,
29. The method of claim 28 where said measured variances of uncompressed multidimensional visual data and said measured correlations of uncompressed multidimensional visual data are communicated between compressor and decompressor,
30. The method of claim 1 where said decorrelating transform is any orthonormal wavelet.
US14/266,645 2013-05-01 2014-04-30 Method and Apparatus to Perform Optimal Visually-Weighed Quantization of Time-Varying Visual Sequences in Transform Space Abandoned US20140327737A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US14/266,645 US20140327737A1 (en) 2013-05-01 2014-04-30 Method and Apparatus to Perform Optimal Visually-Weighed Quantization of Time-Varying Visual Sequences in Transform Space
US15/189,242 US10021423B2 (en) 2013-05-01 2016-06-22 Method and apparatus to perform correlation-based entropy removal from quantized still images or quantized time-varying video sequences in transform

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201361818419P 2013-05-01 2013-05-01
US14/266,645 US20140327737A1 (en) 2013-05-01 2014-04-30 Method and Apparatus to Perform Optimal Visually-Weighed Quantization of Time-Varying Visual Sequences in Transform Space

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US15/189,242 Continuation US10021423B2 (en) 2013-05-01 2016-06-22 Method and apparatus to perform correlation-based entropy removal from quantized still images or quantized time-varying video sequences in transform

Publications (1)

Publication Number Publication Date
US20140327737A1 true US20140327737A1 (en) 2014-11-06

Family

ID=51841240

Family Applications (4)

Application Number Title Priority Date Filing Date
US14/266,645 Abandoned US20140327737A1 (en) 2013-05-01 2014-04-30 Method and Apparatus to Perform Optimal Visually-Weighed Quantization of Time-Varying Visual Sequences in Transform Space
US14/266,757 Abandoned US20140328406A1 (en) 2013-05-01 2014-04-30 Method and Apparatus to Perform Optimal Visually-Weighed Quantization of Time-Varying Visual Sequences in Transform Space
US15/189,187 Expired - Fee Related US10070149B2 (en) 2013-05-01 2016-06-22 Method and apparatus to perform optimal visually-weighed quantization of time-varying visual sequences in transform space
US15/189,242 Expired - Fee Related US10021423B2 (en) 2013-05-01 2016-06-22 Method and apparatus to perform correlation-based entropy removal from quantized still images or quantized time-varying video sequences in transform

Family Applications After (3)

Application Number Title Priority Date Filing Date
US14/266,757 Abandoned US20140328406A1 (en) 2013-05-01 2014-04-30 Method and Apparatus to Perform Optimal Visually-Weighed Quantization of Time-Varying Visual Sequences in Transform Space
US15/189,187 Expired - Fee Related US10070149B2 (en) 2013-05-01 2016-06-22 Method and apparatus to perform optimal visually-weighed quantization of time-varying visual sequences in transform space
US15/189,242 Expired - Fee Related US10021423B2 (en) 2013-05-01 2016-06-22 Method and apparatus to perform correlation-based entropy removal from quantized still images or quantized time-varying video sequences in transform

Country Status (1)

Country Link
US (4) US20140327737A1 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10021423B2 (en) 2013-05-01 2018-07-10 Zpeg, Inc. Method and apparatus to perform correlation-based entropy removal from quantized still images or quantized time-varying video sequences in transform
US10567807B1 (en) * 2019-02-04 2020-02-18 Google Llc Adjustable per-symbol entropy coding probability updating for image and video coding

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10638047B2 (en) * 2015-12-16 2020-04-28 Gopro, Inc. Dynamic synchronization of frame rate to a detected cadence in a time lapse image sequence
CN107153632B (en) * 2017-05-10 2021-04-20 广西师范大学 Method for realizing quantum circuit design by quantum Haar wavelet transform

Citations (51)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5751358A (en) * 1994-09-29 1998-05-12 Sony Corporation Video encoder with quantization controlled by inter-picture correlation
US6222887B1 (en) * 1996-08-05 2001-04-24 Mitsubishi Denki Kabushiki Kaisha Image coded data re-encoding apparatus without once decoding the original image coded data
US20010004400A1 (en) * 1999-12-20 2001-06-21 Takahiro Aoki Method and apparatus for detecting moving object
US6256413B1 (en) * 1994-05-23 2001-07-03 Canon Kabushiki Kaisha Image encoding apparatus
US20020168022A1 (en) * 2001-03-26 2002-11-14 Samsung Electronics Co., Ltd. Data communication apparatus and method based on orthogonal frequency division multiple access
US20020186772A1 (en) * 2001-06-08 2002-12-12 Xin Li Wavelet domain motion compensation system
US20030090591A1 (en) * 2001-09-14 2003-05-15 Stmicroelectronics S.R.I. Process for the format conversion of MPEG bitstreams, a system and computer program product therefor
US20030142098A1 (en) * 2001-02-28 2003-07-31 Samsung Electronics Co., Ltd. Encoding method and apparatus of deformation information of 3D object
US20030169928A1 (en) * 2002-03-08 2003-09-11 Stanek Clay J. Image compression to enhance optical correlation
US20040001611A1 (en) * 2002-06-28 2004-01-01 Celik Mehmet Utku System and method for embedding information in digital signals
US20040066974A1 (en) * 2002-10-03 2004-04-08 Nokia Corporation Context-based adaptive variable length coding for adaptive block transforms
US20040105590A1 (en) * 2002-07-16 2004-06-03 Hiroshi Akimoto Method for still image compressing using filter bank based on non-separable wavelet basis
US20040190610A1 (en) * 2003-01-14 2004-09-30 Samsung Electronics Co., Ltd. Method and apparatus for encoding and/or decoding moving pictures
US20040208362A1 (en) * 2003-04-15 2004-10-21 Nokia Corporation Encoding and decoding data to render 2D or 3D images
US20050008224A1 (en) * 2000-01-27 2005-01-13 Caruso Robert M. Image compression usable with animated images
US20050105608A1 (en) * 2002-08-29 2005-05-19 Scott Coleman Method and apparatus for caching, compressing and transmitting video signals
US20050165517A1 (en) * 2002-09-23 2005-07-28 Stefan Reich Optical sensing system and system for stabilizing machine-controllable vehicles
US20050207660A1 (en) * 2004-03-16 2005-09-22 Sozotek, Inc. System and method for reduction of compressed image artifacts
US20050281479A1 (en) * 2004-06-16 2005-12-22 Samsung Electronics Co., Ltd. Method of and apparatus for estimating noise of input image based on motion compensation, method of eliminating noise of input image and encoding video using the method for estimating noise of input image, and recording media having recorded thereon program for implementing those methods
US20060155531A1 (en) * 2005-01-12 2006-07-13 Nec Laboratories America, Inc. Transform coding system and method
US20060164268A1 (en) * 2005-01-21 2006-07-27 Samsung Electronics Co., Ltd. Method, medium, and apparatus controlling bit rate in image data encoding
US20070071090A1 (en) * 2005-06-21 2007-03-29 National Chiao Tung University Method for performing context adaptive binary arithmetic coding with stochastic bit reshuffling for fine granularity scalability
US20070081589A1 (en) * 2005-10-12 2007-04-12 Samsung Electronics Co., Ltd. Adaptive quantization controller and methods thereof
US20070121731A1 (en) * 2005-11-30 2007-05-31 Akiyuki Tanizawa Image encoding/image decoding method and image encoding/image decoding apparatus
US20070230565A1 (en) * 2004-06-18 2007-10-04 Tourapis Alexandros M Method and Apparatus for Video Encoding Optimization
US20080186348A1 (en) * 2007-02-01 2008-08-07 Canon Kabushiki Kaisha Image processing apparatus, image forming apparatus, and control method thereof
US20080192824A1 (en) * 2007-02-09 2008-08-14 Chong Soon Lim Video coding method and video coding apparatus
US20100054342A1 (en) * 2007-04-17 2010-03-04 Humax Co., Ltd. Bitstream decoding device and method
US20100286991A1 (en) * 2008-01-04 2010-11-11 Dolby International Ab Audio encoder and decoder
US20100322597A1 (en) * 2009-06-22 2010-12-23 Sony Corporation Method of compression of graphics images and videos
US20100324850A1 (en) * 2009-06-17 2010-12-23 Qualcomm Incorporated Static Noise Margin Estimation
US20100329329A1 (en) * 2009-06-24 2010-12-30 Qualcomm Incorporated 8-point transform for media data coding
US7889790B2 (en) * 2005-12-20 2011-02-15 Sharp Laboratories Of America, Inc. Method and apparatus for dynamically adjusting quantization offset values
US20110075897A1 (en) * 2009-09-30 2011-03-31 Genera Electric Company Stain-based optimized compression of digital pathology slides
US20110286525A1 (en) * 2009-05-14 2011-11-24 Massachusetts Institute Of Technology Selecting Transforms for Compressing Visual Data
US20120133361A1 (en) * 2010-11-25 2012-05-31 Patrick Gross Supplementation of acquired, undersampled mr data
US20120140819A1 (en) * 2009-06-25 2012-06-07 Kim Woo-Shik Depth map coding
US20130003829A1 (en) * 2011-07-01 2013-01-03 Kiran Misra System for initializing an arithmetic coder
US8432967B2 (en) * 2007-01-31 2013-04-30 Sony Corporation Information processing apparatus and method for encoding image data to generate encoded data
US20130114703A1 (en) * 2005-03-31 2013-05-09 Euclid Discoveries, Llc Context Based Video Encoding and Decoding
US20130195206A1 (en) * 2012-01-31 2013-08-01 General Instrument Corporation Video coding using eye tracking maps
US20130287104A1 (en) * 2010-12-31 2013-10-31 University-Industry Cooperation Group Of Kyung Hee University Method for encoding video information and method for decoding video information, and apparatus using same
US20130336594A1 (en) * 2012-06-15 2013-12-19 Comcast Cable Communications, Llc Dynamic generation of a quantization matrix for compression of a digital object
US20140003728A1 (en) * 2011-03-10 2014-01-02 Panasonic Corporation Object determination device
US20140115472A1 (en) * 2011-10-28 2014-04-24 Panasonic Corporation Recording medium, playback device, recording device, playback method and recording method for editing recorded content while maintaining compatibility with old format
US20140169407A1 (en) * 2012-03-26 2014-06-19 John David Terry Method and Apparatus for Multiple Signal Aggregation and Reception in Digital Chaos Network
US20140267432A1 (en) * 2013-03-12 2014-09-18 Sony Corporation Method to select appropriate window size for local image processing
US20140270331A1 (en) * 2013-03-15 2014-09-18 Rimage Corporation Content watermarking
US20140286434A1 (en) * 2011-10-05 2014-09-25 Electronics And Telecommunications Research Institute Image-encoding method and image-decoding method
US20140376620A1 (en) * 2011-12-07 2014-12-25 Hitachi Kokusai Electric Inc. Image encoding device and image encoding method
US20150003707A1 (en) * 2012-01-19 2015-01-01 Peter Amon Pixel-Prediction for Compression of Visual Data

Family Cites Families (53)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE3641186A1 (en) 1985-12-04 1987-07-02 Olympus Optical Co IMAGE SIGNAL CORRECTION
BE1000643A5 (en) 1987-06-05 1989-02-28 Belge Etat METHOD FOR CODING IMAGE SIGNALS.
AU3274593A (en) 1991-12-13 1993-07-19 Avid Technology, Inc. Quantization table adjustment
US5881176A (en) 1994-09-21 1999-03-09 Ricoh Corporation Compression and decompression with wavelet style and binary style including quantization by device-dependent parser
US6549666B1 (en) 1994-09-21 2003-04-15 Ricoh Company, Ltd Reversible embedded wavelet system implementation
US5629780A (en) 1994-12-19 1997-05-13 The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration Image data compression having minimum perceptual error
JPH08275160A (en) 1995-03-27 1996-10-18 Internatl Business Mach Corp <Ibm> Discrete cosine conversion method
FR2743246B1 (en) 1995-12-29 1998-01-23 Thomson Broadcast Systems METHOD AND DEVICE FOR COMPRESSING DIGITAL DATA
JPH09261640A (en) 1996-03-22 1997-10-03 Oki Electric Ind Co Ltd Image coder
TW364107B (en) 1996-03-25 1999-07-11 Trw Inc Method and system for three-dimensional compression of digital video signals
US6252989B1 (en) * 1997-01-07 2001-06-26 Board Of The Regents, The University Of Texas System Foveated image coding system and method for image bandwidth reduction
US6239811B1 (en) 1997-11-07 2001-05-29 Raymond John Westwater Method and apparatus to measure relative visibility of time-varying data in transform space
US20020001412A1 (en) 1998-07-21 2002-01-03 Hewlett-Packard Company System for variable quantization in jpeg for compound documents
US6347157B2 (en) 1998-07-24 2002-02-12 Picsurf, Inc. System and method for encoding a video sequence using spatial and temporal transforms
US7006568B1 (en) * 1999-05-27 2006-02-28 University Of Maryland, College Park 3D wavelet based video codec with human perceptual model
US6456744B1 (en) 1999-12-30 2002-09-24 Quikcat.Com, Inc. Method and apparatus for video compression using sequential frame cellular automata transforms
US7035473B1 (en) * 2000-03-01 2006-04-25 Sharp Laboratories Of America, Inc. Distortion-adaptive visual frequency weighting
US6801573B2 (en) 2000-12-21 2004-10-05 The Ohio State University Method for dynamic 3D wavelet transform for video compression
US7123656B1 (en) 2001-10-01 2006-10-17 Realnetworks, Inc. Systems and methods for video compression
US6810083B2 (en) * 2001-11-16 2004-10-26 Koninklijke Philips Electronics N.V. Method and system for estimating objective quality of compressed video data
US7031552B2 (en) * 2002-04-05 2006-04-18 Seiko Epson Corporation Adaptive post-filtering for reducing noise in highly compressed image/video coding
US20040061709A1 (en) 2002-09-17 2004-04-01 Lg Electronics Inc. Method and apparatus for driving plasma display panel
CN100401778C (en) 2002-09-17 2008-07-09 弗拉迪米尔·切佩尔科维奇 Fast CODEC with high compression ratio and minimum required resources
US7212571B2 (en) * 2003-01-31 2007-05-01 Seiko Epson Corporation Method and apparatus for DCT domain filtering for block based encoding
US6894628B2 (en) 2003-07-17 2005-05-17 Fraunhofer-Gesellschaft Zur Forderung Der Angewandten Forschung E.V. Apparatus and methods for entropy-encoding or entropy-decoding using an initialization of context variables
WO2005027045A1 (en) 2003-08-29 2005-03-24 Thomson Licensing S.A. Method and apparatus for modeling film grain patterns in the frequency domain
US20050157791A1 (en) * 2004-01-20 2005-07-21 Eastman Kodak Company System and method for video tone scale reduction
US20050190836A1 (en) * 2004-01-30 2005-09-01 Jiuhuai Lu Process for maximizing the effectiveness of quantization matrices in video codec systems
US20050286629A1 (en) * 2004-06-25 2005-12-29 Adriana Dumitras Coding of scene cuts in video sequences using non-reference frames
US20060062304A1 (en) 2004-09-17 2006-03-23 Shih-Chang Hsia Apparatus and method for error concealment
US20060098897A1 (en) * 2004-11-10 2006-05-11 Agfa-Gevaert Method of superimposing images
US7783130B2 (en) * 2005-01-24 2010-08-24 The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration Spatial standard observer
US7599840B2 (en) 2005-07-15 2009-10-06 Microsoft Corporation Selectively using multiple entropy models in adaptive coding and decoding
EP1908050A4 (en) 2005-07-15 2011-04-13 X Rite Inc Product selection based on color and appearance of decorative artifacts
US7684981B2 (en) 2005-07-15 2010-03-23 Microsoft Corporation Prediction of spectral coefficients in waveform coding and decoding
US8428048B2 (en) * 2006-02-21 2013-04-23 Qualcomm Incorporated Multi-program viewing in a wireless apparatus
KR100788703B1 (en) * 2006-02-24 2007-12-26 삼성전자주식회사 Method and apparatus for video encoding and decoding
JP4974586B2 (en) 2006-05-24 2012-07-11 オリンパス株式会社 Microscope imaging device
CN101090351B (en) * 2006-06-14 2010-04-21 华为技术有限公司 Transport method for function entity in WiMAX network
US20080057385A1 (en) 2006-08-30 2008-03-06 Shin-Etsu Chemical Co., Ltd. Separator for non-aqueous secondary battery, making method, and non-aqueous electrolyte secondary battery
US20080071764A1 (en) * 2006-09-19 2008-03-20 Kazunari Omi Method and an apparatus to perform feature similarity mapping
US7822275B2 (en) 2007-06-04 2010-10-26 Objectvideo, Inc. Method for detecting water regions in video
JP4915350B2 (en) 2008-01-16 2012-04-11 日本電気株式会社 Entropy encoder, video encoding device, video encoding method, and video encoding program
US8509555B2 (en) * 2008-03-12 2013-08-13 The Boeing Company Error-resilient entropy coding for partial embedding and fine grain scalability
US8179974B2 (en) 2008-05-02 2012-05-15 Microsoft Corporation Multi-level representation of reordered transform coefficients
WO2010077325A2 (en) * 2008-12-29 2010-07-08 Thomson Licensing Method and apparatus for adaptive quantization of subband/wavelet coefficients
US8326067B2 (en) 2009-02-27 2012-12-04 Research In Motion Limited Optimization of image encoding using perceptual weighting
US20110255589A1 (en) * 2009-08-03 2011-10-20 Droplet Technology, Inc. Methods of compressing data and methods of assessing the same
CN102939719B (en) 2010-05-21 2016-08-03 黑莓有限公司 For the method and apparatus reducing source in binary system entropy code and decoding
US20120057633A1 (en) * 2010-09-02 2012-03-08 Fang Shi Video Classification Systems and Methods
FR2969298B1 (en) 2010-12-21 2013-01-18 Biofilm Control METHOD FOR MEASURING RESISTANCE OF FILMS
US9781449B2 (en) 2011-10-06 2017-10-03 Synopsys, Inc. Rate distortion optimization in image and video encoding
US20140327737A1 (en) 2013-05-01 2014-11-06 Raymond John Westwater Method and Apparatus to Perform Optimal Visually-Weighed Quantization of Time-Varying Visual Sequences in Transform Space

Patent Citations (51)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6256413B1 (en) * 1994-05-23 2001-07-03 Canon Kabushiki Kaisha Image encoding apparatus
US5751358A (en) * 1994-09-29 1998-05-12 Sony Corporation Video encoder with quantization controlled by inter-picture correlation
US6222887B1 (en) * 1996-08-05 2001-04-24 Mitsubishi Denki Kabushiki Kaisha Image coded data re-encoding apparatus without once decoding the original image coded data
US20010004400A1 (en) * 1999-12-20 2001-06-21 Takahiro Aoki Method and apparatus for detecting moving object
US20050008224A1 (en) * 2000-01-27 2005-01-13 Caruso Robert M. Image compression usable with animated images
US20030142098A1 (en) * 2001-02-28 2003-07-31 Samsung Electronics Co., Ltd. Encoding method and apparatus of deformation information of 3D object
US20020168022A1 (en) * 2001-03-26 2002-11-14 Samsung Electronics Co., Ltd. Data communication apparatus and method based on orthogonal frequency division multiple access
US20020186772A1 (en) * 2001-06-08 2002-12-12 Xin Li Wavelet domain motion compensation system
US20030090591A1 (en) * 2001-09-14 2003-05-15 Stmicroelectronics S.R.I. Process for the format conversion of MPEG bitstreams, a system and computer program product therefor
US20030169928A1 (en) * 2002-03-08 2003-09-11 Stanek Clay J. Image compression to enhance optical correlation
US20040001611A1 (en) * 2002-06-28 2004-01-01 Celik Mehmet Utku System and method for embedding information in digital signals
US20040105590A1 (en) * 2002-07-16 2004-06-03 Hiroshi Akimoto Method for still image compressing using filter bank based on non-separable wavelet basis
US20050105608A1 (en) * 2002-08-29 2005-05-19 Scott Coleman Method and apparatus for caching, compressing and transmitting video signals
US20050165517A1 (en) * 2002-09-23 2005-07-28 Stefan Reich Optical sensing system and system for stabilizing machine-controllable vehicles
US20040066974A1 (en) * 2002-10-03 2004-04-08 Nokia Corporation Context-based adaptive variable length coding for adaptive block transforms
US20040190610A1 (en) * 2003-01-14 2004-09-30 Samsung Electronics Co., Ltd. Method and apparatus for encoding and/or decoding moving pictures
US20040208362A1 (en) * 2003-04-15 2004-10-21 Nokia Corporation Encoding and decoding data to render 2D or 3D images
US20050207660A1 (en) * 2004-03-16 2005-09-22 Sozotek, Inc. System and method for reduction of compressed image artifacts
US20050281479A1 (en) * 2004-06-16 2005-12-22 Samsung Electronics Co., Ltd. Method of and apparatus for estimating noise of input image based on motion compensation, method of eliminating noise of input image and encoding video using the method for estimating noise of input image, and recording media having recorded thereon program for implementing those methods
US20070230565A1 (en) * 2004-06-18 2007-10-04 Tourapis Alexandros M Method and Apparatus for Video Encoding Optimization
US20060155531A1 (en) * 2005-01-12 2006-07-13 Nec Laboratories America, Inc. Transform coding system and method
US20060164268A1 (en) * 2005-01-21 2006-07-27 Samsung Electronics Co., Ltd. Method, medium, and apparatus controlling bit rate in image data encoding
US20130114703A1 (en) * 2005-03-31 2013-05-09 Euclid Discoveries, Llc Context Based Video Encoding and Decoding
US20070071090A1 (en) * 2005-06-21 2007-03-29 National Chiao Tung University Method for performing context adaptive binary arithmetic coding with stochastic bit reshuffling for fine granularity scalability
US20070081589A1 (en) * 2005-10-12 2007-04-12 Samsung Electronics Co., Ltd. Adaptive quantization controller and methods thereof
US20070121731A1 (en) * 2005-11-30 2007-05-31 Akiyuki Tanizawa Image encoding/image decoding method and image encoding/image decoding apparatus
US7889790B2 (en) * 2005-12-20 2011-02-15 Sharp Laboratories Of America, Inc. Method and apparatus for dynamically adjusting quantization offset values
US8432967B2 (en) * 2007-01-31 2013-04-30 Sony Corporation Information processing apparatus and method for encoding image data to generate encoded data
US20080186348A1 (en) * 2007-02-01 2008-08-07 Canon Kabushiki Kaisha Image processing apparatus, image forming apparatus, and control method thereof
US20080192824A1 (en) * 2007-02-09 2008-08-14 Chong Soon Lim Video coding method and video coding apparatus
US20100054342A1 (en) * 2007-04-17 2010-03-04 Humax Co., Ltd. Bitstream decoding device and method
US20100286991A1 (en) * 2008-01-04 2010-11-11 Dolby International Ab Audio encoder and decoder
US20110286525A1 (en) * 2009-05-14 2011-11-24 Massachusetts Institute Of Technology Selecting Transforms for Compressing Visual Data
US20100324850A1 (en) * 2009-06-17 2010-12-23 Qualcomm Incorporated Static Noise Margin Estimation
US20100322597A1 (en) * 2009-06-22 2010-12-23 Sony Corporation Method of compression of graphics images and videos
US20100329329A1 (en) * 2009-06-24 2010-12-30 Qualcomm Incorporated 8-point transform for media data coding
US20120140819A1 (en) * 2009-06-25 2012-06-07 Kim Woo-Shik Depth map coding
US20110075897A1 (en) * 2009-09-30 2011-03-31 Genera Electric Company Stain-based optimized compression of digital pathology slides
US20120133361A1 (en) * 2010-11-25 2012-05-31 Patrick Gross Supplementation of acquired, undersampled mr data
US20130287104A1 (en) * 2010-12-31 2013-10-31 University-Industry Cooperation Group Of Kyung Hee University Method for encoding video information and method for decoding video information, and apparatus using same
US20140003728A1 (en) * 2011-03-10 2014-01-02 Panasonic Corporation Object determination device
US20130003829A1 (en) * 2011-07-01 2013-01-03 Kiran Misra System for initializing an arithmetic coder
US20140286434A1 (en) * 2011-10-05 2014-09-25 Electronics And Telecommunications Research Institute Image-encoding method and image-decoding method
US20140115472A1 (en) * 2011-10-28 2014-04-24 Panasonic Corporation Recording medium, playback device, recording device, playback method and recording method for editing recorded content while maintaining compatibility with old format
US20140376620A1 (en) * 2011-12-07 2014-12-25 Hitachi Kokusai Electric Inc. Image encoding device and image encoding method
US20150003707A1 (en) * 2012-01-19 2015-01-01 Peter Amon Pixel-Prediction for Compression of Visual Data
US20130195206A1 (en) * 2012-01-31 2013-08-01 General Instrument Corporation Video coding using eye tracking maps
US20140169407A1 (en) * 2012-03-26 2014-06-19 John David Terry Method and Apparatus for Multiple Signal Aggregation and Reception in Digital Chaos Network
US20130336594A1 (en) * 2012-06-15 2013-12-19 Comcast Cable Communications, Llc Dynamic generation of a quantization matrix for compression of a digital object
US20140267432A1 (en) * 2013-03-12 2014-09-18 Sony Corporation Method to select appropriate window size for local image processing
US20140270331A1 (en) * 2013-03-15 2014-09-18 Rimage Corporation Content watermarking

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10021423B2 (en) 2013-05-01 2018-07-10 Zpeg, Inc. Method and apparatus to perform correlation-based entropy removal from quantized still images or quantized time-varying video sequences in transform
US10070149B2 (en) 2013-05-01 2018-09-04 Zpeg, Inc. Method and apparatus to perform optimal visually-weighed quantization of time-varying visual sequences in transform space
US10567807B1 (en) * 2019-02-04 2020-02-18 Google Llc Adjustable per-symbol entropy coding probability updating for image and video coding
US10951921B2 (en) * 2019-02-04 2021-03-16 Google Llc Adjustable per-symbol entropy coding probability updating for image and video coding

Also Published As

Publication number Publication date
US10021423B2 (en) 2018-07-10
US20140328406A1 (en) 2014-11-06
US10070149B2 (en) 2018-09-04
US20160309190A1 (en) 2016-10-20
US20160309189A1 (en) 2016-10-20

Similar Documents

Publication Publication Date Title
Raid et al. Jpeg image compression using discrete cosine transform-A survey
US5850482A (en) Error resilient method and apparatus for entropy coding
US5966465A (en) Compression/decompression using reversible embedded wavelets
CN100576195C (en) With the system and method for lossless manner to digital picture and voice data decoding
Padmaja et al. Analysis of various image compression techniques
US10021423B2 (en) Method and apparatus to perform correlation-based entropy removal from quantized still images or quantized time-varying video sequences in transform
US6813387B1 (en) Tile boundary artifact removal for arbitrary wavelet filters
US20160021396A1 (en) Systems and methods for digital media compression and recompression
RU2567988C2 (en) Encoder, method of encoding data, decoder, method of decoding data, system for transmitting data, method of transmitting data and programme product
Sahoo et al. Haar wavelet transform image compression using run length encoding
Satone et al. A review of image compression techniques
CN105163130B (en) A kind of Lossless Image Compression Algorithm method based on discrete Tchebichef orthogonal polynomial
Rojatkar et al. Image compression techniques: lossy and lossless
Bhammar et al. Survey of various image compression techniques
US6330283B1 (en) Method and apparatus for video compression using multi-state dynamical predictive systems
Garg et al. Analysis of different image compression techniques: a review
WO2013011355A1 (en) Method and apparatus for encoding an image
EP3180862B1 (en) Method for coding pulse vectors using statistical properties
EP3180863B1 (en) Method for coding pulse vectors using statistical properties
Meenakshi et al. Literature Review of Image Compression Techniques
Cherifi et al. Sorted run length coding-application to Meteosat image compression
Rahman et al. An integer wavelet transform based lossless image compression technique using arithmetic coding
Costantini et al. A low-complexity video coder based on the Discrete Walsh Hadamard Transform
Elmourssi et al. A Performance Study Of Two Jpeg Compression Approaches
Jindal et al. Lossless image compression for storage reduction using pollination based optimization

Legal Events

Date Code Title Description
AS Assignment

Owner name: ZPEG, INC., TEXAS

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:WESTWATER, RAYMOND;REEL/FRAME:035228/0631

Effective date: 20150310

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION