EP1941742A2 - Videocodierungsverfahren zur ermöglichung einer hocheffizienten teilweisen decodierung von h.264 und anderen transformationscodierten informationen - Google Patents

Videocodierungsverfahren zur ermöglichung einer hocheffizienten teilweisen decodierung von h.264 und anderen transformationscodierten informationen

Info

Publication number
EP1941742A2
EP1941742A2 EP06815757A EP06815757A EP1941742A2 EP 1941742 A2 EP1941742 A2 EP 1941742A2 EP 06815757 A EP06815757 A EP 06815757A EP 06815757 A EP06815757 A EP 06815757A EP 1941742 A2 EP1941742 A2 EP 1941742A2
Authority
EP
European Patent Office
Prior art keywords
samples
multimedia
transform coefficients
reconstructed
multimedia data
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.)
Ceased
Application number
EP06815757A
Other languages
English (en)
French (fr)
Inventor
Peisong Chen
Seyfullah Halit Oguz
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.)
Qualcomm Inc
Original Assignee
Qualcomm Inc
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 Qualcomm Inc filed Critical Qualcomm Inc
Publication of EP1941742A2 publication Critical patent/EP1941742A2/de
Ceased legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods 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/132Sampling, masking or truncation of coding units, e.g. adaptive resampling, frame skipping, frame interpolation or high-frequency transform coefficient masking
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/14Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
    • G06F17/147Discrete orthonormal transforms, e.g. discrete cosine transform, discrete sine transform, and variations therefrom, e.g. modified discrete cosine transform, integer transforms approximating the discrete cosine transform
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods 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
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134Methods 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/157Assigned coding mode, i.e. the coding mode being predefined or preselected to be further used for selection of another element or parameter
    • H04N19/159Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169Methods 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/17Methods 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/174Methods 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 slice, e.g. a line of blocks or a group of blocks
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/42Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/593Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving spatial prediction techniques
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/60Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/60Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • H04N19/61Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding in combination with predictive coding
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/85Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression
    • H04N19/89Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression involving methods or arrangements for detection of transmission errors at the decoder
    • H04N19/895Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression involving methods or arrangements for detection of transmission errors at the decoder in combination with error concealment

Definitions

  • the invention is directed to multimedia signal processing and, more particularly, to video encoding, and decoding.
  • Multimedia signal processing systems may encode multimedia data using encoding methods based on international standards such as MPEG-X and H.26x standards. Such encoding methods generally are directed towards compressing the multimedia data for transmission and/or storage. Compression is broadly the process of removing redundancy from the data.
  • a video signal may be described in terms of a sequence of pictures, which include frames (an entire picture), or fields (e.g., an interlaced video signal comprises fields of alternating odd or even lines of a picture).
  • the term "frame” refers to a picture, a frame or a field.
  • Video encoding methods compress video signals by using lossless or lossy compression algorithms to compress each frame.
  • Intra-frame coding (herein referred to as intra-coding) refers to encoding a frame using that frame.
  • Inter-frame coding (herein referred to as inter-coding) refers to encoding a frame based on other, "reference,” frames.
  • Multimedia processors such as video encoders, may encode a frame by partitioning it into blocks or "macroblocks" of, for example, 16x16 pixels. The encoder may further partition each macroblock into subblocks. Each subblock may further comprise additional subblocks. For example, subblocks of a macroblock may include 16x8 and 8x16 subblocks. Subblocks of the 8x16 subblocks may include 8x8 subblocks, and so forth. As used herein, the term "block” refers to either a macroblock or a subblock.
  • H.264 One compression technology based on developing industry standards is commonly referred to as "H.264” video compression.
  • the H.264 technology defines the syntax of an encoded video bitstream together with the method of decoding this bitstream.
  • an input video frame is presented for encoding.
  • the frame is processed in units of macroblocks corresponding to the original image.
  • Each macroblock can be encoded in intra or inter mode.
  • a predicted macroblock is formed based on portions of an already reconstructed frame or already reconstructed neighboring blocks in the same frame known as causal neighbors.
  • intra mode a macroblock is formed from causal samples in the current frame that have been previously encoded, decoded, and reconstructed.
  • Multimedia samples of one or more causal neighboring macroblocks are subtracted from the current macroblock being encoded to produce a residual or difference macroblock, D.
  • This residual block D is transformed using a block transform and quantized to produce X, a set of quantized transform coefficients. These transform coefficients are re-ordered and entropy encoded.
  • the entropy encoded coefficients, together with other information for decoding the macroblock, become part of a compressed bitstream that is transmitted to a receiving device.
  • error concealment has become critical when delivering multimedia content over error prone networks such as wireless channels.
  • Error concealment schemes make use of the spatial and temporal correlation that exists in the video signal.
  • recovery may occur during entropy decoding.
  • all or part of the data pertaining to one or more macroblocks or video slices could be lost.
  • resynchronization of decoding can take place at the next slice, and missing blocks of the lost slice can be concealed using spatial concealment.
  • the decoded data available to a decoder device includes the causal neighbors that have already been decoded and reconstructed
  • spatial concealment typically uses causal neighbors to conceal the missing blocks.
  • One reason for using the causal neighbors to conceal the lost blocks is that out-of-order reconstruction of the next slice followed by concealment of the lost section of the current slice can be very inefficient, especially when using a highly pipelined video hardware decoder core.
  • the non-causal neighbors could offer valuable information for improved spatial concealment. What is needed is an efficient method for providing out of order reconstruction of non-causal neighboring multimedia samples.
  • a method of processing multimedia data includes receiving transform coefficients, where the transform coefficients are associated with the multimedia data.
  • the method further includes determining a set of multimedia samples to be reconstructed, determining a set of the received transform coefficients based on the multimedia samples to be reconstructed, and processing the determined set of transform coefficients to generate reconstructed samples corresponding to the determined set of multimedia samples.
  • a multimedia data processor is provided.
  • the processor is configured to receive transform coefficients, where the transform coefficients are associated with multimedia data.
  • the processor is further configured to determine a set of multimedia samples to be reconstructed, determine a set of the received transform coefficients based on the multimedia samples to be reconstructed, and process the determined set of transform coefficients to generate reconstructed samples corresponding to the determined set of multimedia samples.
  • An apparatus for processing multimedia data includes a receiver to receive transform coefficients, where the transform coefficients are associated with multimedia data.
  • the apparatus further includes a first determiner to determine a set of multimedia samples to be reconstructed, a second determiner to determine a set of the received transform coefficients based on the multimedia samples to be reconstructed, and a generator to process the determined set of transform coefficients to generate reconstructed samples corresponding to the determined set of multimedia samples.
  • a machine readable medium including instructions that upon executing cause a machine to process multimedia data is provided.
  • the instructions cause the machine to receive transform coefficients, where the transform coefficients are associated with multimedia data.
  • the instructions further cause the machine to determine a set of multimedia samples to be reconstructed, determine a set of the received transform coefficients based on the multimedia samples to be reconstructed, and process the determined set of transform coefficients to generate reconstructed samples corresponding to the determined set of multimedia samples.
  • FIG. 1 is a block diagram illustrating a multimedia communications system according to one aspect.
  • FIG. 2A is a block diagram illustrating an aspect of a decoder device that may be used in a system such as illustrated in FIG. 1.
  • FIG. 2B is a block diagram illustrating an example of a computer processor system of a decoder device that may be used in a system such as illustrated in FIG. 1.
  • FIG. 3 is a flowchart illustrating one example of a method of decoding a portion of a video stream in a system such as illustrated in FIG. 1.
  • FIG. 4 is a flowchart illustrating in more detail another example of a method of decoding a portion of a video stream in a system such as illustrated in FIG. 1.
  • FIG. 5 shows a detailed diagram of a 4x4 block and its surrounding causal neighbor pixels.
  • FIG. 6 shows a directivity mode diagram that illustrates nine directivity modes (0-8) which are used to describe a directivity characteristic of a block in H.264.
  • FIG. 7 illustrates one example of an intra-coded 4x4 pixel block immediately below and right of one or more slice boundaries.
  • FIG. 8 illustrates a nomenclature of neighbor pixels and pixels within an intra- coded 4x4 pixel block.
  • FIG. 9 illustrates one example of an intra-coded 16x16 Luma macroblock immediately below and right of a slice boundary.
  • FIG. 10 illustrates one example of an intra-coded 8x8 Chroma block immediately below and right of a slice boundary.
  • FIG. 11 illustrates a portion of multimedia samples located immediately below a slice boundary.
  • FIG. 12 is a block diagram illustrating another example of a decoder device that may be used in a system such as illustrated in FIG. 1.
  • FIG. 13 is a block diagram illustrating another example of a decoder device 150 that may be used in a system such as illustrated in FIG. 1.
  • Video signals may be characterized in terms of a series of pictures, frames, or fields.
  • frame is a broad term that may encompass either frames of a progressive video signal or frames or fields of an interlaced video signal.
  • Aspects include systems and methods of improving processing in an encoder and a decoder in a multimedia transmission system.
  • Multimedia data may include one or more of motion video, audio, still images, or any other suitable type of audio-visual data.
  • aspects include an apparatus and method of decoding video data in an efficient manor providing improved error concealment by reconstructing non-causal multimedia samples and using the reconstructed samples to perform spatial concealment of lost or erroneous encoded multimedia data. For example, it has been found according to one aspect that generating reconstructed causal and/or non-causal neighboring samples prior to estimating multimedia concealment data for the lost or erroneous data can improve the quality of the spatial concealment. In some examples, the reconstructed multimedia samples and directivity indicators with which the reconstructed samples were originally encoded are used in the estimation of the multimedia concealment data. In another aspect, it has been found that reconstructing a subset of a matrix of multimedia samples to be used in spatial error concealment can further improve the processing efficiency.
  • the reconstruction of the multimedia samples and the estimation of the multimedia concealment data are performed in a pre-processor.
  • the multimedia concealment data can then be communicated with the originally encoded non-causal multimedia data to be decoded in an efficient video core processor, further improving processing efficiency.
  • HG. 1 is a functional block diagram illustrating a multimedia communications system 100 according to one aspect.
  • the system 100 includes an encoder device 110 in communication with a decoder device 150 via a network 140.
  • the encoder device receives a multimedia signal from an external source 102 and encodes that signal for transmission on the network 140.
  • the encoder device 110 comprises a processor 112 coupled to a memory 114 and a transceiver 116.
  • the processor 112 encodes data from the multimedia data source and provides it to the transceiver 116 for communication over the network 140.
  • the decoder device 150 comprises a processor 152 coupled to a memory 154 and a transceiver 156.
  • the processor 152 may include one or more of a general purpose processor and/or a digital signal processor and/or an application specific hardware processor.
  • the memory 154 may include one or more of solid state or disk based storage or any readable and writeable random access memory device.
  • the transceiver 156 is configured to receive multimedia data over the network 140 and make it available to the processor 152 for decoding. Li one example, the transceiver 156 includes a wireless transceiver.
  • the network 140 may comprise one or more of a wireline or wireless communication system, including one or more of a Ethernet, telephone (e.g., POTS), cable, power-line, and fiber optic systems, and/or a wireless system comprising one or more of a code division multiple access (CDMA or CDMA2000) communication system, a frequency division multiple access (EDMA) system, a time division multiple access (TDMA) system such as GSM/GPRS (General Packet Radio Service)/EDGE (enhanced data GSM environment), a TETRA (Terrestrial Trunked Radio) mobile telephone system, a wideband code division multiple access (WCDMA) system, a high data rate (IxEV-DO or IxEV-DO Gold Multicast) system, an IEEE 802.11 system, a MediaFLO system, a DMB system, an orthogonal frequency division multiple access (OFDM) system, or a DVB-H system.
  • a code division multiple access CDMA or CDMA2000
  • EDMA frequency division multiple access
  • FIG. 2A is a functional block diagram illustrating an aspect of the decoder device 150 that may be used in a system such as the system 100 illustrated in FIG. 1.
  • the decoder 150 comprises a receiver element 202, a multimedia sample determiner element 204, a transform coefficient determiner element 206, a reconstructed sample generator element 208, and a multimedia concealment estimator element 210.
  • the receiver 202 receives encoded video data (e.g., data encoded by the encoder 110 of FIGS. 1).
  • the receiver 202 may receive the encoded data over a wireline or wireless network such as the network 140 of FIG. 1.
  • the received data includes transform coefficients representing source multimedia data.
  • the transform coefficients are transformed into a domain where the correlations of neighboring samples are significantly reduced. For example, images typically exhibit a high degree of spatial correlation in the spatial domain. On the other hand, the transformed coefficients are typically orthogonal to each other, exhibiting zero correlation.
  • Some examples of transforms that can be used for multimedia data include, but are not limited to, the DCT (Discrete Cosine Transform), the DFT (Discrete Fourier Transform), the Hadamard (or Walsh-Hadamard) transform, discrete wavelet transforms, the DST (Discrete Sine Transform), the Haar transform, the Slant transform, the KL (Karhunen- Loeve) transform and integer transforms such as one used in H.264.
  • the transforms are used to transform a matrix or array of multimedia samples.
  • the received data also includes information indicating how the encoded blocks were encoded. Such information may include inter-coding reference information such as motion vectors and frame sequence numbers, and intra-coding reference information including block sizes, and spatial prediction directivity indicators, and others. Some received data includes quantization parameters indicating how each transform coefficient was rounded, nonzero indicators indicating how many transform coefficients in the transformed matrix are non-zero, and others.
  • the multimedia sample determiner 204 determines which multimedia samples are to be reconstructed. In one aspect the multimedia sample determiner 204 determines neighboring multimedia samples or pixels that are near to and/or border regions of multimedia data that are lost and can be concealed. In one example the multimedia sample determiner identifies pixels adjacent to a border of a slice or other group of blocks where a portion of the data has been lost due to errors or channel loss. In some examples, the multimedia sample determiner 204 identifies the fewest number of pixels associated with reconstructing neighboring blocks spatially predicted from the determined pixels. For example, compressed multimedia data can comprise a block of , transform coefficients resulting from a transformation of individual blocks (e.g. 8x8 pixel blocks and/or 4x4 pixel blocks) or matrices.
  • individual blocks e.g. 8x8 pixel blocks and/or 4x4 pixel blocks
  • the multimedia sample determiner 204 can identify a specific subset of multimedia samples of the transformed block to be reconstructed in order to be used to conceal the lost data or be used to reconstruct other encoded multimedia samples in other blocks predicted from those samples.
  • the determined multimedia samples can include non-causal samples and/or causal samples.
  • the transform coefficient determiner 206 determines a set of transform coefficients to be used to reconstruct some or all of the multimedia samples determined to be reconstructed by the multimedia sample determiner 204. The determination of which transform coefficients to use depends on the encoding method that was used to generate the transform coefficients. The transform coefficient determination also depends on which multimedia samples are being reconstructed and whether there are transform coefficients with zero values (thereby negating the potential need to use them). Details of which transform coefficients may be sufficient to reconstruct multimedia samples are discussed below.
  • the reconstructed sample generator 208 reconstructs multimedia samples based on those samples determined by the multimedia sample determiner 204.
  • the set of reconstructed samples can be a whole set, such as an entire NxN matrix of samples, where N is an integer.
  • the set of samples can be a subset of samples from an NxN matrix such as a row, a column, part of a row or column, a diagonal, etc.
  • the reconstructed sample generator 208 uses the transform coefficients determined by the transform coefficient determiner 206 in reconstructing the samples.
  • the reconstructed sample generator 208 also uses information based on the encoding method used to encode the transform coefficients in reconstructing the multimedia samples. Details of actions performed by the reconstructed sample generator 208 are discussed below.
  • the multimedia concealment estimator 210 uses the reconstructed samples calculated by the reconstructed sample generator 208 to form concealment multimedia samples to replace or conceal regions of multimedia data that are lost or altered with errors during transmission/reception.
  • the multimedia concealment estimator 210 uses reconstructed sample values in one aspect to form the concealment multimedia data.
  • the multimedia concealment estimator 210 uses the reconstructed sample values and a received spatial prediction directivity mode indicator in estimating the multimedia concealment data. Further details of spatial error concealment can be found in Application No. 11/182,621 (now published patent application U.S. 2006/0013320) "METHODS AND APPARATUS FOR SPATIAL ERROR CONCEALMENT" which is assigned to the assignee hereof.
  • one or more of the elements of the decoder 150 of FIG. 2 A may be rearranged and/or combined.
  • the elements may be implemented by hardware, software, firmware, middleware, microcode or any combination thereof. Details of the actions performed by the elements of the decoder 150 will be discussed in reference to the methods illustrated in FIGS. 3 and 4 below.
  • FIG. 2B is a block diagram illustrating an example of a computer processor system of a decoder device that may be used in a system such as illustrated in FIG. 1.
  • the decoder device 150 of this example includes a pre-processor element 220, a random access memory (RAM) element 222, a digital signal processor (DSP) element 224, and a video core element 226.
  • RAM random access memory
  • DSP digital signal processor
  • the pre-processor 220 is used in one aspect to perform one or more of the actions performed by the various elements in FIG. 2A.
  • the pre-processor parses the video bitstream and writes the data to the RAM 222.
  • the preprocessor 220 implements the actions of the multimedia sample determiner 204, the transform coefficient determiner 206, the reconstructed sample generator 208 and the multimedia concealment estimator 210. By performing these more efficient, less computationally intensive actions in the preprocessor 220, the more computationally intensive video decoding can be done, in causal order, in the highly efficient video core 226.
  • the DSP 224 retrieves the parsed video data stored in the RAM 222 and reorganizes it to be handled by the video core 226.
  • the video core 226 performs the dequantization (also known as rescaling or scaling), inverse transforming and deblocking functions as well as other video decompression functions.
  • the video core is typically implemented in a highly optimized and pipelined fashion. Because of this, the video data can be decoded in the fastest manner when it is decoded in causal order. By performing the out-of-order reconstruction of multimedia samples and the subsequent spatial concealment in the pre-processor, the causal order is maintained for decoding in the video core allowing for improved overall decoding performance.
  • FIG. 3 is a flowchart illustrating one example of a method of decoding a portion of a video stream in a system such as illustrated in FIG. 1.
  • the process 300 can be performed by a decoding device such as the examples shown in FIGS. 2 A and 2B.
  • the process 300 enables reconstruction of selected multimedia samples.
  • the process 300 may be used to reconstruct multimedia samples in a causal order where other encoded multimedia data is predicted from the causal data and may need reconstruction of the causal data prior to its own reconstruction.
  • the process 300 may be used to reconstruct multimedia samples in non-causal order.
  • the non-causal data is reconstructed in a manner so as to permit a subsequent reconstruction of all the multimedia data (both causal and non-causal) in a more efficient and timely manner.
  • the process 300 starts at block 305 where the decoder device receives transform coefficients associated with a multimedia data bitstream.
  • the decoder device may receive the transform coefficients over a wireline and/or wireless network such as the network 140 shown in FIG. 1.
  • the transform coefficients can represent multimedia samples including color and/or brightness parameters such as chrominance and luminance, respectively.
  • the transforms used to generate the transform coefficients may include, but are not limited to, the DCT (Discrete Cosine Transform), the DFT (Discrete Fourier Transform), the Hadamard (or Walsh-Hadamard) transform, discrete wavelet transforms, the DST (Discrete Sine Transform), the Haar transform, the Slant transform, the KL (Karhunen-Loeve) transform and integer transforms such as one used in H.264.
  • the multimedia samples may be transformed in groups such as one dimensional arrays and/or two dimensional matrices when the transform coefficients are generated during encoding.
  • the transformed coefficients may be intra-coded and may or may not include spatial prediction.
  • the transform coefficients may represent a residual value that is the error of a predictor provided by a reference value.
  • the transform coefficients may be quantized.
  • the transform coefficients may be entropy encoded.
  • the receiver element 202 of FIG. 2A may perform the acts at block 305.
  • the process 300 continues at block 310 where the decoder device determines a set of multimedia samples to be reconstructed.
  • the multimedia samples to be reconstructed may include luminance (luma) and chrominance (chroma) samples.
  • the set of multimedia samples to be reconstructed are determined in response to loss of synchronization while decoding the multimedia bitstream being received at block 305.
  • the loss of synchronization may be caused by the erroneous reception or the loss of some or all of the encoded data corresponding to multimedia samples contained in a first slice of macroblocks.
  • the determined multimedia samples to be reconstructed may be contained in a second slice of macroblocks.
  • the second slice of macroblocks borders at least a part of the lost portion of the first slice of macroblocks.
  • the determined multimedia samples may be causal or non-causal with respect to the lost portion of multimedia samples, as discussed above.
  • the multimedia samples determined to be reconstructed at block 310 may enable reconstruction of other multimedia samples that border a lost portion of multimedia data to be concealed.
  • intra-coded macroblocks at the bottom of another slice of macroblocks may be spatially predicted in reference to the determined set of multimedia samples determined to be reconstructed at block 310. Therefore, by reconstructing the determined set of multimedia samples which strongly correlate with the intra-coded blocks, the intra-coded blocks themselves can be reconstructed through a concealment process.
  • the multimedia samples determined to be reconstructed at block 310 may comprise samples located on or near a slice border. The samples to be reconstructed may comprise an entire matrix of associated multimedia samples that were transformed as a group during encoding.
  • the samples to be reconstructed may also comprise a portion of the matrix of associated multimedia samples such as a row, a column, a diagonal, or portions and/or combinations thereof.
  • the multimedia sample determiner 204 of FIG. 2A may perform the acts at block 310. Details of subsets of multimedia samples that may be reconstructed are discussed below.
  • the process 300 continues at block 315 where the decoder device determines a set of transform coefficients associated with the multimedia samples determined to be reconstructed at block 310.
  • the determination of which transform coefficients to use for reconstruction depends on the encoding method that was used to generate the transform coefficients.
  • the transform coefficient determination also depends on which multimedia samples are being reconstructed. For example, it may be determined that the entire set of multimedia samples determined at block 310 may be reconstructed, or a subset may alternatively be determined to be reconstructed.
  • the transform coefficient determination at block 315 also depends on whether there are transform coefficients with zero value (thereby negating the potential need to use them). Details of which transform coefficients may be sufficient to reconstruct multimedia samples are discussed below.
  • the transform coefficient determiner of FIG. 2A can perform the acts at block 315.
  • the process 300 proceeds to block 320.
  • the decoder device processes the set of determined transform coefficients in order to generate reconstructed multimedia samples.
  • the processing performed depends on the encoding methods that were used to generate the transform coefficients.
  • the processing includes inverse transforming the transform coefficients, but may also include other acts including, but not limited to, entropy decoding, dequantization (also called rescaling or scaling), etc. Details of examples of processing performed at block 320 are discussed below in reference to FIG. 4.
  • some or all acts of the process 300 are performed in a pre-processor such as the pre-processor 220 shown in FIG. 2B. It should be noted that some of the blocks of the process 300 may be combined, omitted, rearranged or any combination thereof.
  • HG. 4 is a flowchart illustrating in more detail another example of a method of decoding a portion of a video stream in a system such as illustrated in FIG. 1.
  • the example process 400 includes all of the actions performed at the blocks 305 to 320 contained in the process 300. The blocks 305, 310 and 315 remain unchanged from the examples shown in FIG. 3 and discussed above.
  • the block 320 of the process 300, where the transform coefficients are processed to generate reconstructed samples, is illustrated in more detail in the process 400, where it comprises four blocks 405, 410, 420 and 425.
  • the process 400 also includes additional blocks where concealment multimedia samples are estimated, block 430, and where transform coefficients, based on the estimated concealment multimedia samples, are generated, block 435.
  • the decoder device performs the actions at blocks 305, 310 and 315 in a similar fashion as discussed above.
  • the detailed example of the block 320 is shown where transform coefficients are associated with basis images in order to efficiently reconstruct the multimedia samples.
  • the decoder device partitions the transform coefficients into groups, where the groups of transform coefficients are associated with the multimedia samples determined to be reconstructed at block 305.
  • the groups of transform coefficients comprise the transform coefficients that modify (or weigh) a common basis image during an inverse transformation process in the reconstruction. Details of how transform coefficients are partitioned into groups are discussed below in relation to an example using H.264.
  • the decoder device calculates a weight value associated with each partitioned group based on the encoding method which generated the coefficients.
  • the weight is the sum of scaled transform coefficients of each group.
  • the scaling duplicates the inverse transform characteristics of the encoding method. Examples of scaling and calculating the weight value are discussed below in relation to the H.264 example.
  • Basis images are determined for each of the groups based on the encoding transform method.
  • Basis images are typically two dimensional orthogonal matrices, although one-dimensional arrays may also be utilized. Portions of the two dimensional basis images are used, where the portions depend on which multimedia samples are being reconstructed (as determined at block 310).
  • the values calculated for each group at block 410 are use to modify (or weigh) the associated basis images at block 425. By combining all the weighed basis images, multimedia samples are reconstructed at block 425. Details of blocks 420 and 425 are discussed below in reference to the H.264 example.
  • the process 400 continues at block 430, where the decoder device estimates concealment multimedia samples, in some examples, based on the reconstructed samples.
  • reconstructed sample values of the multimedia samples are used to form the concealment multimedia data.
  • the reconstructed sample values and a received spatial prediction directivity mode indicator are used to form the multimedia concealment data. Further details of spatial error concealment can be found in the Application No. 11/182/621 (now published patent application U.S. 2006/0013320) "METHODS AND APPARATUS FOR SPATIAL ERROR CONCEALMENT" which is assigned to the assignee hereof.
  • the estimated concealment multimedia samples are used directly and inserted into a frame buffer containing reconstructed data of the same frame to then be displayed.
  • the estimated concealment multimedia samples are transformed, in a manner replicating an encoding process, to generate transform coefficients representing the estimated concealment multimedia samples at block 435. These transformed coefficients are then inserted into the undecoded (still encoded) bitstream as if they were normal encoded samples.
  • the entire bitstream can then be forwarded to a video decoder core, such as the video core 226 in FIG. 2B, to be decoded.
  • all or part of the process 400 can be performed in a preprocessor such as the pre-processor 220 of FIG. 2B.
  • This method of performing the reconstruction and concealment estimation is especially useful for reconstructing non- causal portions which are then used to conceal other portions of multimedia data that were lost due to channel errors. Details of methods used to improve the efficiency of the reconstruction of multimedia samples will now be discussed in relation to H.264 encoded multimedia bitstreams.
  • H.264 uses spatial prediction to exploit the spatial correlation among neighboring blocks of pixels.
  • the spatial prediction modes use the causal neighbors to the left and above a 4x4, 8x8 or 16x16 pixel block for spatial prediction.
  • H.264 offers 2 modes of spatial prediction for Luma values, one for 4x4 pixel blocks (herein referred to as intra-4x4 coding) and one for 16x16 pixel macroblocks (herein referred to as intra- 16x16 coding). Note that other causal and non-causal neighboring samples may be used for spatial prediction.
  • FIG. 5 shows a detailed diagram of a 4x4 pixel block 502 and its surrounding causal neighbor pixels to the left and above, shown generally as 504.
  • the causal neighbor pixels 504 are used to generate various predictors, values and/or parameters describing the block 502 pixels.
  • the block 502 comprises pixels (p ⁇ -pl5) and the causal neighbor pixels 504 are identified using reference indicators n3, n7, nil, nl2, nl3, nl4, and nl5 where the number corresponds to the similar positions of the block 502 pixels.
  • FIG. 6 shows a directivity mode diagram 600 that illustrates nine directivity modes (0-8) which are used to describe a directivity characteristic of an intra-coded block in H.264.
  • the nine directivity modes (or indicators) are used to describe a directivity characteristic of the spatial prediction of block 502. For example, mode 0 describes a vertical directivity characteristic, mode 1 describes a horizontal directivity characteristic, and mode 2 describes a DC characteristic where the average value of available causal neighboring pixels is used as a reference for the prediction.
  • the causal neighboring pixels (those immediately above and to the left of the 4x4, 8x8 or 16x16 pixel block) that are in the same slice are used in calculating the average. For example, if the block being encoded borders a slice above, then the pixels to the left are averaged. If the block being encoded borders another slice to the left and above, then a value of 128 is used as the DC average (half of the 8-bit range of values provided in H.264).
  • the modes illustrated in the directivity mode diagram 600 are used in the H.264 encoding process to generate prediction values for the block 502.
  • the luma values can be encoded in reference to the pixels to the left and above the 4x4 block using any of the nine directivity modes.
  • intra-16xl6 coding the luma values can be encoded in reference to the pixels to the left and above the entire 16x16 pixel block using four modes: i) vertical (mode 0), ii) horizontal (mode 1), iii) DC (mode 2), and iv) planar (mode 3).
  • mode 3 In the planar prediction mode, it is assumed that the luma values vary spatially and smoothly across the macroblock and the reference is formed based on a planar equation. For chroma, there is one prediction mode, 8x8.
  • the 8x8 block can be predicted with the same modes used in intra-16xl6 coding: i) vertical (mode 0), ii) horizontal (mode 1), iii) DC (mode 2), and iv) planar (mode 3). Details of reconstructing the predicted blocks encoded in H.264 will now be discussed. [0062]
  • the residual values ⁇ can be reconstructed by inverse transformation of the transform coefficients.
  • the prediction values p are obtained from causal neighboring pixels depending on the spatial prediction mode used to encode them. [0063] The following are observations affecting reconstruction of pixels within intra- 4x4 coded macroblocks located immediately below a slice boundary (non-causal neighbors in H.264).
  • FIG. 7 shows one aspect of an intra-4x4 coded block immediately below a slice boundary.
  • the line AA' marks the mentioned slice boundary and the 4x4 block 702 is the current block being reconstructed.
  • the 9 neighboring pixels 704 above the slice boundary line AA' which could normally have been used for performing spatial prediction in the intra-4x4 coding, are not available since they are located on the other side of the slice boundary and hence they belong to another slice. Spatial prediction as well as any other predictive coding dependency across a slice boundary is not permitted in H.264 since slices act as resynchronization points.
  • FIG. 8 illustrates a nomenclature for the neighbor pixels and pixels within an intra-4x4 coded block. Since pixels above the slice boundary AA' are not available for spatial prediction, the neighboring pixels of block 702 available for prediction are the pixels ⁇ I, J, K, L ⁇ . This implies that the permissible intra-4x4 coding prediction modes for the 4x4 block 702 are: i) mode 1 (horizontal), ii) mode 2 (DC), and iii) mode 8 (horizontal-up). If the line BB' in Figure 7 marked another slice boundary, then none of the pixels ⁇ I, J, K, L ⁇ or ⁇ M, A, B, C, D, E, F, G and H) would be available for spatial prediction.
  • the permissible intra-4x4 coding prediction mode available is mode 2 (DC) where the reference value for all the pixels of block 702 is 128.
  • DC mode 2
  • the information for decoding and reconstructing some or all of the pixels of an intra-4x4 coded block located immediately below a slice boundary includes:
  • This sufficient data set can enable the reconstruction of all pixel values ⁇ a, b, c, . . . , n, o, p in FIG. 8 ⁇ of the current 4x4 block.
  • this data set is sufficient for reconstructing the values of the pixel subset ⁇ d, h, 1, p ⁇ which in turn may be used for the reconstruction of the next 4x4 block immediately to the right.
  • the following are observations affecting reconstruction of pixels within intra- 16x16 coded macroblocks located immediately below a slice boundary (non-causal neighbors in H.264).
  • the interest is in the uppermost four 4x4 blocks (i.e. those with block indices b ⁇ , bl, b4, and b5 in FIG. 9), of an intra-16xl6 coded macroblock located immediately below a slice boundary.
  • FIG. 9 shows one aspect of an intra-16xl6 coded macroblock located below a slice boundary.
  • the line AA 1 marks the mentioned slice boundary and the four 4x4 blocks labeled b ⁇ , bl, b4 and b5 constitute the portion of the 16x16 macroblock under consideration for reconstruction.
  • the 17 neighboring pixels above the line AA' which could normally have been used for performing the intra- 16x16 spatial prediction, are not available since they are located on the other side of the slice boundary and hence they belong to another slice.
  • the permissible intra- 16x16 coding spatial prediction modes for the current macroblock are i) mode 1 (horizontal), and ii) mode 2 (DC).
  • the permissible intra-16xl6 prediction mode is mode 2 (DC).
  • the topmost four neighboring pixels located immediately to the left of line BB' and below the line AA' are sufficient for decoding and reconstructing the topmost four 4x4 blocks within the current 16x16 macroblock. This is consistent with the above described framework enabling the decoding of the topmost four 4x4 blocks in intra-4x4 coded macroblocks.
  • the intra- 16x16 coding of macroblocks which are located immediately below a slice boundary should be limited to the spatial prediction mode 1 (horizontal), unless they are located immediately to the right of a slice boundary, or at the left frame boundary. This allows for computationally efficient reconstruction of the rightmost four pixels of all the topmost 4x4 blocks in the row. This in turn allows for computationally efficient reconstruction of the topmost four pixels of all the topmost 4x4 blocks in the row.
  • HG. 10 shows one aspect of a 8x8 chroma block located immediately below a slice boundary.
  • the line AA' marks the slice boundary and the two 4x4 blocks immediately below line AA' and to the right of line BB' constitute data for one of the two chroma channels (Cr and Cb).
  • the nine neighboring pixels above the slice boundary line AA' are not available for spatial prediction, in this example, since they are located on the other side of the slice boundary and hence they belong to another slice.
  • the availability of 8 neighboring pixels, those located immediately to the left of line BB' implies that the permissible chroma channel intra prediction modes for the current MB are limited to i) mode 0 (DC) and ii) mode 1 (horizontal).
  • the permissible chroma channel intra prediction mode is mode 0 (DC).
  • the topmost four neighboring pixels located immediately to the left of line BB' may be needed for decoding and reconstructing the topmost two 4x4 chroma blocks within the current MB. It should be noted that there are two 8x8 chroma blocks corresponding to one 16x16 luma macroblock.
  • the intra-8x8 coding of chroma channels (Cr and Cb) of intra- coded macroblocks should be limited to the spatial prediction mode 1 (horizontal), unless they are located immediately to the right of a slice boundary, or at the left frame boundary.
  • transforms that may be partially decoded using these methods include, but are not limited to, the DCT (Discrete Cosine Transform), the DFT (Discrete Fourier Transform), the Hadamard (or Walsh-Hadamard) transform, discrete wavelet transforms, the DST (Discrete Sine Transform), the Haar transform, the Slant transform, and the KL (Karhunen-Loeve) transform.
  • DCT Discrete Cosine Transform
  • DFT Discrete Fourier Transform
  • the Hadamard or Walsh-Hadamard
  • discrete wavelet transforms discrete wavelet transforms
  • DST Discrete Sine Transform
  • Haar transform discrete wavelet transforms
  • Slant transform the Slant transform
  • KL Kerhunen-Loeve
  • the transformations represented by equations (3) and (4) can each be thought of as two one-dimensional (ID) transforms resulting in a two-dimensional (2D) transform.
  • the [Y] [T] matrix multiplication operation can be thought of as a ID row transform and the [T] T [Y] matrix multiplication operation can be thought of as a ID column transform.
  • the combination forms a 2D transform.
  • Another way of thinking about the 2D transform of an NxN matrix [Y] is to perform N 2 inner-products of [Y] with 2D basis images corresponding to the 2D transform characterized by the transform matrix [T], leading to a set of N 2 values identical to the set of transform coefficients.
  • Basis images of a given transform [T] can be calculated by setting one of the transform coefficients to one and setting all others to zero, and taking an inverse transform of the resulting coefficient matrix. For example, using a 4x4 transform coefficient matrix [w], and setting the W 11 coefficient to 1 and all others to zero, and using the H.264 integer transform [T H ], equation (4) results in:
  • the 16 basis images associated with the H.264 4x4 integer transformation process for residual 4x4 blocks can be determined to be as follows, where sij (for i,j e ⁇ 0,1,2,3 ⁇ ) is the basis image associated with ith horizontal and jth vertical frequency channel.
  • FIG. 11 illustrates a portion of multimedia samples located immediately below a slice boundary.
  • the pixels may comprise luma and chroma values. The pixel positions
  • the intra-4x4 spatial prediction modes which could have been used to generate the prediction signal for this 4x4 block can be one of the following:
  • Intra-4x4 spatial prediction mode 1 (Horizontal):
  • the rescaling factors vij i,je ⁇ 0,1,2,3 ⁇ which are used to scale zij ij e ⁇ 0,1,2,3 ⁇ , in addition to their dependence on the quantization parameter, also possess the following position related structure within a 4x4 matrix: v 00 v 10 v 20 v 30 v ⁇ l v ll v 21 v 31 v 02 v 12 v 22 v 32 v 03 v 13 v 23 v 33 where three groups of rescaling factors including [vOO, v20, vO2 v22], [vll, v31, vl3, v33] and [vlO, v30, v01, v21, vl2, v32, v03, v23] each have the same value for a given quantization parameter QPy.
  • FIG. 12 is a functional block diagram illustrating another example of a decoder device 150 that may be used in a system such as illustrated in FIG. 1.
  • This aspect includes means for receiving transform coefficients, wherein the transform coefficients are associated with multimedia data, first determiner means for determining a set of multimedia samples to be reconstructed, second determiner means for determining a set of the received transform coefficients based on the multimedia samples to be reconstructed, and generator means for processing the determined set of transform coefficients to generate reconstructed samples corresponding to the determined set of multimedia samples.
  • the receiving means comprises a receiver 202
  • the first determiner means comprises a multimedia sample determiner 204
  • the second determiner means comprises a transform coefficient determiner 206
  • the generator means comprises a reconstructed sample generator 208.
  • FIG. 13 is a functional block diagram illustrating another example of a decoder device 150 that may be used in a system such as illustrated in FIG. 1.
  • This aspect includes means for receiving transform coefficients, wherein the transform coefficients are associated with multimedia data, first determiner means for determining a set of multimedia samples to be reconstructed, second determiner means for determining a set of the received transform coefficients based on the multimedia samples to be reconstructed, and generator means for processing the determined set of transform coefficients to generate reconstructed samples corresponding to the determined set of multimedia samples.
  • the receiving means comprises a module for receiving 1302, where the first determiner means comprises a module for determining samples for reconstruction 1304, where the second determiner means comprises a module for determining transform coefficients 1306 and where the generator means comprises a module for processing transform coefficients 1308.
  • the receiving means comprises a module for receiving 1302
  • the first determiner means comprises a module for determining samples for reconstruction 1304
  • the second determiner means comprises a module for determining transform coefficients 1306
  • the generator means comprises a module for processing transform coefficients 1308.
  • DSP digital signal processor
  • ASIC application specific integrated circuit
  • FPGA field programmable gate array
  • a general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine.
  • a processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core or ASIC core, or any other such configuration.
  • the steps of a method or algorithm described in connection with the examples disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two.
  • a software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, an optical storage medium, or any other form of storage medium known in the art.
  • An example storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium.
  • the storage medium may be integral to the processor.
  • the processor and the storage medium may reside in an Application Specific Integrated Circuit (ASIC).
  • the ASIC may reside in a wireless modem.
  • the processor and the storage medium may reside as discrete components in the wireless modem.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Multimedia (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Computational Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Databases & Information Systems (AREA)
  • Algebra (AREA)
  • Discrete Mathematics (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Compression Of Band Width Or Redundancy In Fax (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)
EP06815757A 2005-09-27 2006-09-27 Videocodierungsverfahren zur ermöglichung einer hocheffizienten teilweisen decodierung von h.264 und anderen transformationscodierten informationen Ceased EP1941742A2 (de)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US72137705P 2005-09-27 2005-09-27
PCT/US2006/037996 WO2007038727A2 (en) 2005-09-27 2006-09-27 Video encoding method enabling highly efficient partial decoding of h.264 and other transform coded information

Publications (1)

Publication Number Publication Date
EP1941742A2 true EP1941742A2 (de) 2008-07-09

Family

ID=37835195

Family Applications (1)

Application Number Title Priority Date Filing Date
EP06815757A Ceased EP1941742A2 (de) 2005-09-27 2006-09-27 Videocodierungsverfahren zur ermöglichung einer hocheffizienten teilweisen decodierung von h.264 und anderen transformationscodierten informationen

Country Status (7)

Country Link
EP (1) EP1941742A2 (de)
JP (2) JP2009510938A (de)
KR (1) KR100984650B1 (de)
CN (1) CN101310536B (de)
AR (1) AR055185A1 (de)
TW (1) TW200719726A (de)
WO (1) WO2007038727A2 (de)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8634457B2 (en) 2008-09-26 2014-01-21 Qualcomm Incorporated Determining availability of video data units
US8660176B2 (en) 2008-09-26 2014-02-25 Qualcomm Incorporated Resolving geometric relationships among video data units
US8724697B2 (en) 2008-09-26 2014-05-13 Qualcomm Incorporated Locating motion vectors for video data units
KR101619972B1 (ko) * 2008-10-02 2016-05-11 한국전자통신연구원 이산 여현 변환/이산 정현 변환을 선택적으로 이용하는 부호화/복호화 장치 및 방법
PT3471416T (pt) * 2010-04-13 2020-10-19 Ge Video Compression Llc Codificação de mapas de significância e blocos de coeficientes de transformada
US10070126B2 (en) 2011-06-28 2018-09-04 Hfi Innovation Inc. Method and apparatus of intra mode coding
CN113411584A (zh) * 2020-03-17 2021-09-17 北京三星通信技术研究有限公司 视频编解码的方法和装置

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH01141481A (ja) * 1987-11-27 1989-06-02 Matsushita Electric Ind Co Ltd 画像処理装置
GB2263373B (en) * 1992-01-09 1995-05-24 Sony Broadcast & Communication Data error concealment
US5532837A (en) * 1992-12-18 1996-07-02 Matsushita Electric Industrial Co., Ltd. Digital video signal processing apparatus
US5621467A (en) * 1995-02-16 1997-04-15 Thomson Multimedia S.A. Temporal-spatial error concealment apparatus and method for video signal processors
JP3795960B2 (ja) * 1996-07-18 2006-07-12 三洋電機株式会社 画像表示装置
JP2001086504A (ja) * 1999-09-09 2001-03-30 Toshiba Digital Media Engineering Corp Mpegビデオ復号化装置
US6662329B1 (en) * 2000-03-23 2003-12-09 International Business Machines Corporation Processing errors in MPEG data as it is sent to a fixed storage device
CN101087422B (zh) * 2002-05-28 2011-05-25 夏普株式会社 用于估计象素预测模式的设备
JP2006513634A (ja) * 2003-01-10 2006-04-20 トムソン ライセンシング 符号化ストリーム中で伝送されたイントラ予測モードに基づく空間的誤り隠蔽
CN100584024C (zh) * 2003-01-10 2010-01-20 汤姆森特许公司 为编码图像中的错误掩蔽定义内插滤波器

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO2007038727A3 *

Also Published As

Publication number Publication date
KR100984650B1 (ko) 2010-10-01
AR055185A1 (es) 2007-08-08
KR20080066714A (ko) 2008-07-16
WO2007038727A3 (en) 2007-08-02
TW200719726A (en) 2007-05-16
CN101310536B (zh) 2010-06-02
JP2009510938A (ja) 2009-03-12
WO2007038727A2 (en) 2007-04-05
CN101310536A (zh) 2008-11-19
JP2012231505A (ja) 2012-11-22

Similar Documents

Publication Publication Date Title
US9055298B2 (en) Video encoding method enabling highly efficient partial decoding of H.264 and other transform coded information
US10687075B2 (en) Sub-block transform coding of prediction residuals
US20210014509A1 (en) Signaling residual signs predicted in transform domain
EP2941004B1 (de) Verfahren und vorrichtung zur decodierung eines intraprädktionsmodus
EP2942956A2 (de) Bilddecodierungsvorrichtung
US20070025631A1 (en) Adaptive variable block transform system, medium, and method
US9852521B2 (en) Image coding device, image decoding device, methods thereof, and programs
CN110741645B (zh) 块效应减少
EP2036358A1 (de) Vorrichtung und verfahren zur bildkodierung und -dekodierung
WO2007108642A1 (en) Image encoding/decoding method and apparatus
WO2008020687A1 (en) Image encoding/decoding method and apparatus
EP2206353A1 (de) Verfahren und vorrichtung zur auswahl eines kodierungsmodus
WO2007038727A2 (en) Video encoding method enabling highly efficient partial decoding of h.264 and other transform coded information
CN110741636A (zh) 用于视频编码的变换块级扫描顺序选择
US10015484B2 (en) Adaptive scan device and method for scanning thereof
EP3754983B1 (de) Frühe intracodierungsentscheidung
EP4268460A1 (de) Zeitfilter
Kesireddy A new adaptive trilateral filter for in-loop filtering

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20080327

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR

17Q First examination report despatched

Effective date: 20090210

DAX Request for extension of the european patent (deleted)
REG Reference to a national code

Ref country code: DE

Ref legal event code: R003

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION HAS BEEN REFUSED

18R Application refused

Effective date: 20141026