EP1679903B1 - Chemin de balayage adaptatif de coefficients - Google Patents

Chemin de balayage adaptatif de coefficients Download PDF

Info

Publication number
EP1679903B1
EP1679903B1 EP05026123.9A EP05026123A EP1679903B1 EP 1679903 B1 EP1679903 B1 EP 1679903B1 EP 05026123 A EP05026123 A EP 05026123A EP 1679903 B1 EP1679903 B1 EP 1679903B1
Authority
EP
European Patent Office
Prior art keywords
scan order
coefficients
locations
block
order
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.)
Active
Application number
EP05026123.9A
Other languages
German (de)
English (en)
Other versions
EP1679903A3 (fr
EP1679903A2 (fr
Inventor
Sridhar Srinivasan
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.)
Microsoft Technology Licensing LLC
Original Assignee
Microsoft Corp
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 Microsoft Corp filed Critical Microsoft Corp
Publication of EP1679903A2 publication Critical patent/EP1679903A2/fr
Publication of EP1679903A3 publication Critical patent/EP1679903A3/fr
Application granted granted Critical
Publication of EP1679903B1 publication Critical patent/EP1679903B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • 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/13—Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]
    • 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
    • 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/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding

Definitions

  • the invention relates generally to block transform-based digital media (e.g., video and image) compression.
  • Transform coding is a compression technique used in many audio, image and video compression systems.
  • Uncompressed digital image and video is typically represented or captured as samples of picture elements or colors at locations in an image or video frame arranged in a two-dimensional (2D) grid. This is referred to as a spatial-domain representation of the image or video.
  • a typical format for images consists of a stream of 24-bit color picture element samples arranged as a grid. Each sample is a number representing color components at a pixel location in the grid within a color space, such as RGB, or YIQ, among others.
  • RGB RGB
  • YIQ a color space
  • Various image and video systems may use various different color, spatial and time resolutions of sampling.
  • digital audio is typically represented as time-sampled audio signal stream.
  • a typical audio format consists of a stream of 16-bit amplitude samples of an audio signal taken at regular time intervals.
  • Transform coding reduces the size of digital audio, images and video by transforming the spatial-domain representation of the signal into a frequency-domain (or other like transform domain) representation, and then reducing resolution of certain generally less perceptible frequency components of the transform-domain representation. This generally produces much less perceptible degradation of the digital signal compared to reducing color or spatial resolution of images or video in the spatial domain, or of audio in the time domain.
  • a typical block transform-based codec 100 shown in Figure 1 divides the uncompressed digital image's pixels into fixed-size two dimensional blocks (X 1 , ... X n ), each block possibly overlapping with other blocks.
  • a linear transform 120-121 that does spatial-frequency analysis is applied to each block, which converts the spaced samples within the block to a set of frequency (or transform) coefficients generally representing the strength of the digital signal in corresponding frequency bands over the block interval.
  • the transform coefficients may be selectively quantized 130 (i.e., reduced in resolution, such as by dropping least significant bits of the coefficient values or otherwise mapping values in a higher resolution number set to a lower resolution), and also entropy or variable-length coded 130 into a compressed data stream.
  • the transform coefficients will inversely transform 170-171 to nearly reconstruct the original color/spatial sampled image/video signal (reconstructed blocks X ⁇ 1 , ... X ⁇ n ).
  • the input data is arbitrarily long, it is segmented into N sized vectors and a block transform is applied to each segment.
  • reversible block transforms are chosen.
  • the matrix M is invertible.
  • block transforms are typically implemented as separable operations.
  • the matrix multiplication is applied separably along each dimension of the data (i.e., both rows and columns).
  • the transform coefficients may be selectively quantized (i.e., reduced in resolution, such as by dropping least significant bits of the coefficient values or otherwise mapping values in a higher resolution number set to a lower resolution), and also entropy or variable-length coded into a compressed data stream.
  • the inverse of these operations are applied on the decoder 150 side, as show in Fig. 1 .
  • the inverse matrix M -1 (inverse transform 170-171) is applied as a multiplier to the transform domain data.
  • the inverse transform When applied to the transform domain data, the inverse transform nearly reconstructs the original time-domain or spatial-domain digital media.
  • the transform used may be simple DPCM type predictor/correctors, or they may be more complicated structures such as wavelets or DCTs (Discrete Cosine Transforms).
  • DCTs Discrete Cosine Transforms
  • JPEG/MPEG2/MPEG4, JPEG2000, and Windows Media Video (WMV) use the DCT, wavelet, and integerized-DCT respectively.
  • WMV uses a lapped smoothing operator that provides visual and rate-distortion benefit for intra blocks and intra frames.
  • the lapped smoothing operator in conjunction with the block transform, tries to mimic a lapped transform of the type described in H. S. Malvar, Signal Processing with Lapped Transforms, Artech House, Boston, MA, 1992 .
  • Run length coding proceeds by scanning a block of quantized transform coefficients according to a pre-determined pattern.
  • a pre-determined pattern is the continuous "zigzag" scan pattern shown in Figure 3 .
  • the run length coding technique exploits the statistics of the underlying transform. Typically, larger coefficients occur towards the "DC" value (which is conventionally represented at the top left corner), and the more infrequent and smaller coefficients happen at larger distances from DC. For example, it is common for most of the transform coefficients of a transform block to have a value of zero after quantization. Many scan patterns give higher priority to coefficients that are more likely to have non-zero values. In other words, such coefficients are scanned earlier in the scan pattern. In this way, the non-zero coefficients are more likely to be bunched together, followed by one or more long groups of zero value coefficients. In particular, this leads to more efficient run/level/last coding, but other forms of entropy coding also benefit from the reordering.
  • US 2003/0128753 A1 discloses a scanning method for coding or decoding an image signal, wherein probabilities that non-zero-coefficients occur are obtained. Scanning order is performed in a zigzag manner if the probabilities are identical.
  • the pattern of likely coefficients in a transform block shows some kind of local data dependency. For instance in textured regions of an image, which may span several blocks in the horizontal and vertical dimensions, coefficients occur as expected. However, in regions of the image with strong vertical or horizontal features, the coefficients along the corresponding axis are more likely. Therefore, the scan pattern which is ideal (in the sense of reducing number of bits used) for textured regions is not always ideal for regions with linear features.
  • lapped transforms further affects the optimality of the scan pattern.
  • a lapped transform is implemented as a pre-filter followed by a block transform, discontinuities in the original image are enhanced by the pre-filter.
  • the transform coefficients therefore show a higher variance, and moreover, the highest frequencies occur with greater strength.
  • the highest 2D frequency which is the transform coefficient that lies at the bottom right of the coefficient block of many transforms
  • DCAC prediction is an encoding tool that is used to minimize the occurrence and/or magnitude of "DCAC" coefficients, which are DC in either X or Y dimensions, and AC in the other. These are coefficients lying along the axes. For strongly linear regions, the DCAC coefficients can be predicted with a greater degree of confidence than for randomly textured regions. Therefore, not only is the best scan order dependent on the underlying data, it is also influenced by how well the underlying data can be predicted with its DCAC coefficients.
  • an adaptive coefficient scan ordering technique described herein that efficiently matches the scan order of block coefficients with the local statistics of the image. Described implementations of this technique are computationally very efficient, and have minimum latency, which is significant benefit in image and video codecs were speed is critical. Moreover, the described adaptive coefficient scan order implementation "learns" the statistics from what is causally encountered by the encoder and decoder; therefore there is no additional signaling or bit usage in the compressed bit stream to send side information to the decoder.
  • the following description relates to a digital media compression system or codec, which utilizes an adaptive coefficient scan order technique.
  • an embodiment of a compression system incorporating the adaptive coefficient scan order technique is an image or video compression system.
  • the reversible overlap operator also can be incorporated into compression systems or codecs for other digital media or 2D data.
  • the adaptive coefficient scan order technique does not require that the digital media compression system encodes the compressed digital media data in a particular coding format.
  • Figures 4 and 5 are a generalized diagram of the processes employed in a representative 2-dimensional (2D) data encoder 400 and decoder 500 based on a lapped transform and using the adaptive coefficient scan order described more fully below.
  • the diagrams present a generalized or simplified illustration of the use and application of this adaptive coefficient scan order technique in a compression system incorporating the 2D data encoder and decoder.
  • additional or fewer processes than those illustrated in this representative encoder and decoder can be used for the 2D data compression.
  • some encoders/decoders may also include color conversion, color formats, scalable coding, lossless coding, macroblock modes, etc.
  • the compression system (encoder and decoder) can provide lossless and/or lossy compression of the 2D data, depending on the quantization which may be based on a quantization parameter varying from lossless to lossy.
  • the 2D data encoder 400 produces a compressed bitstream 420 that is a more compact representation (for typical input) of 2D data 410 presented as input to the encoder.
  • the 2D data input can be an image, a frame of a video sequence, or other data having two dimensions.
  • the 2D data encoder tiles 430 the input data into macroblocks, which are 16 ⁇ 16 pixels in size in this representative encoder.
  • the 2D data encoder further tiles each macroblock into 4 ⁇ 4 blocks 432.
  • a "forward overlap" operator 440 is applied to each edge between blocks, after which each 4 ⁇ 4 block is transformed using a block transform 450.
  • This block transform 450 can be the reversible, scale-free 2D transform.
  • the overlap operator can be the reversible overlap operator.
  • the discrete cosine transform or other block transforms, lapped transforms and overlap operators can be used.
  • the DC coefficient 460 of each 4 ⁇ 4 transform block is subject to a similar processing chain (tiling, forward overlap, followed by 4 ⁇ 4 block transform).
  • the resulting DC transform coefficients and the AC transform coefficients are quantized 470, entropy coded 480 and packetized 490.
  • the decoder performs the reverse process.
  • the transform coefficient bits are extracted 510 from their respective packets, from which the coefficients are themselves decoded 520 and dequantized 530.
  • the DC coefficients 540 are regenerated by applying an inverse transform, and the plane of DC coefficients is "inverse overlapped" using a suitable smoothing operator applied across the DC block edges.
  • the entire data is regenerated by applying the 4 ⁇ 4 inverse transform 550 to the DC coefficients, and the AC coefficients 542 decoded from the bitstream.
  • the block edges in the resulting image planes are inverse overlap filtered 560. This produces a reconstructed 2D data output.
  • the encoder 400 ( Figure 4 ) and decoder 500 ( Figure 5 ) of the illustrated digital media compression system utilize an adaptive coefficient scan order technique to further enhance the compression efficiency when entropy encoding the transform coefficients.
  • This adaptive coefficient scan order efficiently adjusts the scan order of block coefficients in accordance with the local statistics of the digital media data, such that the coefficients can be encoded more efficiently by entropy encoding 480 ( Figure 4 ).
  • the illustrated implementation of the adaptive coefficient scan order technique avoids added signaling or bit usage for sending side information to the decoder by using a same determinative process on both encoder and decoder side to learn the local statistics from what is causally encountered as the media data is processed by the encoder and decoder. Further, the illustrated implementation of the technique is computationally efficient, so as to impose minimal latency in encoding/decoding the digital media stream (which can be beneficial for live communications, and like applications).
  • Figure 6 shows a procedure 600 according to one implementation of the adaptive coefficient scan order technique in the encoder 400 and decoder 500.
  • the procedure 600 begins at operation 610 by initializing the coefficient scan order (or orders in cases where multiple scan orders are adaptively varied, e.g., for horizontal and vertical coefficients) to a known ordering expected to perform well across a typical range of data.
  • this initial ordering may be different in different scan order contexts, such as coefficient scan orders for macroblocks showing a predominantly "horizontal" orientation versus "vertical" orientation.
  • the orientation or scan context can be signaled explicitly from the encoder to the decoder.
  • this orientation can be inferred from the orientation of the DC sub-band transmitted prior to the AC coefficients.
  • Figure 7 shows an example of an initial scan order 700 for a 4x4 block having a horizontal orientation.
  • Figure8 shows an example of an initial scan order 800 for a 4x4 block having a vertical orientation.
  • the horizontal orientation scan order 700 is the initial scan order also used for blocks showing no particular orientation.
  • the illustrated procedure 600 tracks the local statistics of block coefficients using two 1-dimensional arrays: an Order array 910 and a Totals array 920.
  • a separate set of the arrays is kept for each scan order context.
  • this array (labeled "Order") contains as its entries the inverse scan, i.e. the index of the coefficient in ascending scan order.
  • the procedure 600 initializes this array to the initial scan order in the initialization operation 610.
  • Figure 9 illustrates the values stored in the Order array 910 for the example initial vertical orientation scan order 800 shown in Figure 8 at initialization. In this illustration, the DC coefficient is sent prior to the AC coefficients, and therefore does not appear in the array.
  • the procedure 600 For each inverse scan Order array 910, the procedure 600 also keeps the array labeled "Totals" in this illustration, in which the procedure 600 tallies the incidence of occurrence of the respective coefficient.
  • the procedure 600 initializes the Totals array with arbitrary descending values. For instance, this array is populated with values ⁇ k*N, k*(N-1), k*(N-1), ... ,k ⁇ for some value of k. This is shown in the lower row of the table in Figure 9 .
  • the value k in this example is chosen to be a small integer, typically between 2 and 4. In some implementations of the adaptive coefficient scan order procedure, the choice of k may be based on the quantization parameter used in quantization 470 ( Figure 4 ).
  • Figure 10 shows a situation where Totals[n] > Totals[n-1].
  • the arrows show the elements that need to be exchanged.
  • Figure 11 shows the Order and Totals arrays subsequent to the exchange, and
  • Figure 12 shows the corresponding scan order indices on the 4x4 block.
  • the illustrated adaptive coefficient scan order procedure 600 there is no further conditional exchange of Totals[n - 1] and Totals[n - 2], etc. This means that there is at most one transition in the scan order array for each nonzero coefficient, and therefore the illustrated procedure 600 has a linear order of complexity in the number of nonzero coefficients. A coefficient can move at most one place in the scan order for each block traversal inside the loop 630-680.
  • the illustrated procedure 600 does not guarantee optimality at every stage, but over the long run it can be shown that the scan array approaches the global optimum for a stationary distribution, based on the logic of the ordering algorithm.
  • the adaptation is causal. Equivalently, the entire block can be coded using the current scan order. Subsequently, the scan order can be modified based on the coded nonzero coefficients and Totals array. Therefore, there is no additional latency introduced in the process of encoding or decoding.
  • the procedure 600 After traversing all coefficients in the current block, the procedure 600 checks whether there are further blocks of the digital media data (e.g., the image being encoded) to be encoded/decoded at operation 690. The procedure 600 then ends when all blocks have been processed.
  • the digital media data e.g., the image being encoded
  • the procedure 600 resets the Totals array to the initialization state so as to prevent arithmetic overflow, and to facilitate adaptation.
  • the Totals array is reset at the start of every chunk of 8 macroblocks (macroblocks are 16x16 arrays of luminance pixels and include corresponding chrominance pixels).
  • reset intervals may be chosen for more or less rapid adaptation, and reset intervals may be quantization parameter dependent. Accordingly, at the Totals array reset interval as illustrated by operation 692, the procedure 600 loops back to the operation 620 where the Totals array is initialized, before proceeding to process a next block of coefficients.
  • both the Totals and Order arrays are reset to the initialization states so as to facilitate random access at these locations.
  • the procedure loops back to the Totals and Order arrays' initialization operation 610 at such intervals.
  • the procedure can reset to the initialization state at entry points to independently coded portions of the image bitstream, or at the beginning of each image of a video sequence, etc.
  • Bubble sort is a conventional computer procedure for the sorting of an array of data.
  • a bubble sort procedure can be described as follows. Let an N element array (which may be assumed, without loss of generality, to be numeric) be represented by X. X[i] is the ith element, with the index i running from 1 through N.
  • the bubble sort proceeds by N-1 traversals of the array, each traversal being composed of N-1 conditional exchange operations.
  • the conditional exchange operation for an ascending sort order is defined as follows:
  • the array X is sorted.
  • the same procedure may be used, with minor modifications, to sort in descending order, alphabetically, or to generate rank order indices.
  • bubble sort is not used often because of its unfavorable running time.
  • the adaptive coefficient scan order procedure 600 described here is based on a similar conditional exchange operation, i.e., the conditional exchange operation 660, 670.
  • the illustrated implementation of the adaptive coefficient scan order procedure 600 differs from the bubble sort in that the illustrated procedure 600 follows a more relaxed updating schedule. More particularly, two differences from bubble sort include:
  • the illustrated adaptive coefficient scan order procedure 600 has been found to result in a bitrate savings that can be as high as 2%, compared with an entropy coding scheme that uses fixed scan tables.
  • this technique may be used in conjunction with other sophisticated context models to choose between one of several adaptive tables, and also with Huffman, bitplane or arithmetic encoding techniques for run length coding of data.
  • different adaptive scan models may be used with the high pass and low pass bands.
  • the adaptive coefficient scan order technique may be used to code larger transform sizes, as well as to code with multiple transform shapes (e.g., on 4x8 and 8x4 size blocks, etc.). Likewise, blocks or macroblocks may be scanned in any pre-determined manner across the image.
  • the conditional exchange step may employ hysteresis, or different rules for performance benefits, or to degrade/obfuscate data for rights management purposes.
  • the above described codec utilizing the adaptive coefficient scan order technique can be performed on any of a variety of devices in which digital media signal processing is performed, including among other examples, computers; image and video recording, transmission and receiving equipment; portable video players; video conferencing; and etc.
  • the digital media coding techniques can be implemented in hardware circuitry, as well as in digital media processing software executing within a computer or other computing environment, such as shown in Figure 13 .
  • FIG. 13 illustrates a generalized example of a suitable computing environment (1300) in which described embodiments may be implemented.
  • the computing environment (1300) is not intended to suggest any limitation as to scope of use or functionality of the invention, as the present invention may be implemented in diverse general-purpose or special-purpose computing environments.
  • the computing environment (1300) includes at least one processing unit (1310) and memory (1320).
  • the processing unit (1310) executes computer-executable instructions and may be a real or a virtual processor. In a multi-processing system, multiple processing units execute computer-executable instructions to increase processing power.
  • the memory (1320) may be volatile memory (e.g., registers, cache, RAM), non-volatile memory (e.g., ROM, EEPROM, flash memory, etc.), or some combination of the two.
  • the memory (1320) stores software (1380) implementing the described encoder/decoder and adaptive coefficient scan order procedure.
  • a computing environment may have additional features.
  • the computing environment (1300) includes storage (1340), one or more input devices (1350), one or more output devices (1360), and one or more communication connections (1370).
  • An interconnection mechanism such as a bus, controller, or network interconnects the components of the computing environment (1300).
  • operating system software provides an operating environment for other software executing in the computing environment (1300), and coordinates activities of the components of the computing environment (1300).
  • the storage (1340) may be removable or non-removable, and includes magnetic disks, magnetic tapes or cassettes, CD-ROMs, CD-RWs, DVDs, or any other medium which can be used to store information and which can be accessed within the computing environment (1300).
  • the storage (1340) stores instructions for the software (1380) implementing the codec and adaptive coefficient scan order procedure.
  • the input device(s) (1350) may be a touch input device such as a keyboard, mouse, pen, or trackball, a voice input device, a scanning device, or another device that provides input to the computing environment (1300).
  • the input device(s) (1350) may be a sound card or similar device that accepts audio input in analog or digital form, or a CD-ROM reader that provides audio samples to the computing environment.
  • the output device(s) (1360) may be a display, printer, speaker, CD-writer, or another device that provides output from the computing environment (1300).
  • the communication connection(s) (1370) enable communication over a communication medium to another computing entity.
  • the communication medium conveys information such as computer-executable instructions, compressed audio or video information, or other data in a modulated data signal.
  • a modulated data signal is a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal.
  • communication media include wired or wireless techniques implemented with an electrical, optical, RF, infrared, acoustic, or other carrier.
  • Computer-readable media are any available media that can be accessed within a computing environment.
  • Computer-readable media include memory (1320), storage (1340), communication media, and combinations of any of the above.
  • the digital media processing techniques herein can be described in the general context of computer-executable instructions, such as those included in program modules, being executed in a computing environment on a target real or virtual processor.
  • program modules include routines, programs, libraries, objects, classes, components, data structures, etc. that perform particular tasks or implement particular abstract data types.
  • the functionality of the program modules may be combined or split between program modules as desired in various embodiments.
  • Computer-executable instructions for program modules may be executed within a local or distributed computing environment.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (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)

Claims (14)

  1. Procédé, à base de transformée de blocs, de codage de données d'image numérique ou de données de vidéo numériques, le procédé consistant à :
    analyser la fréquence statistique d'occurrence de valeur non nulle de coefficients au niveau d'emplacements dans un agencement de blocus ;
    adapter un ordre de balayage des coefficients selon lesdites statistiques, en mettant en oeuvre les étapes ci-dessous consistant à :
    initialiser l'ordre de balayage des coefficients à un ordre initial ;
    pour des coefficients dans un bloc en cours des données d'image numérique ou des données de vidéo numérique, mettre à jour un ensemble de valeurs représentant la fréquence statistique d'occurrence de valeurs de coefficients non nulles au niveau d'emplacements dans l'agencement de blocs ; et
    dans une traversée des emplacements selon l'ordre de balayage une fois par bloc des données d'image numérique ou des données de vidéo numérique, échanger conditionnellement l'ordre de balayage d'emplacements qui sont adjacents dans l'ordre sur la base d'une comparaison des valeurs représentant la fréquence statistique d'occurrence de valeurs de coefficients audits emplacements ; et
    coder par entropie les coefficients dans l'ordre de balayage adapté.
  2. Procédé selon la revendication 1, consistant en outre à :
    mettre en oeuvre l'adaptation de l'ordre de balayage sur une base causale et déterministe, de sorte qu'une signalisation explicite de l'ordre de balayage des coefficients dans les données d'image numérique codées ou les données de vidéo numérique codées est évitée.
  3. Procédé selon la revendication 1, dans lequel l'adaptation de l'ordre de balayage consiste à :
    trier les emplacements selon ladite fréquence statistique d'occurrence de valeurs de coefficients aux emplacements dans l'agencement de blocs ; et
    réagencer l'ordre de balayage selon le tri.
  4. Procédé selon la revendication 1, consistant en outre à réinitialiser périodiquement les statistiques de la fréquence d'occurrence de valeurs de coefficients, aux emplacements, au cours du codage de blocs des données d'image numérique ou des données de vidéo numérique.
  5. Procédé selon la revendication 1, consistant en outre à :
    réinitialiser périodiquement l'ordre de balayage à un ordre initial.
  6. Codeur de médias numériques, comprenant :
    une mémoire contenant une structure de données de représentation d'ordres de balayage représentative d'un ordre de balayage d'emplacements dans un agencement de blocs de coefficients de transformée, et une structure de données de représentation de statistiques représentative d'une fréquence statistique d'occurrence d'une valeur non nulle de coefficients aux emplacements ;
    un processeur programmé de manière à :
    adapter l'ordre de balayage des coefficients selon lesdites statistiques,
    en mettant en oeuvre les étapes ci-dessous consistant à :
    initialiser l'ordre de balayage des coefficients à un ordre initial ;
    pour des coefficients dans un bloc en cours de données d'image numérique ou de données de vidéo numérique, mettre à jour un ensemble de valeurs représentant la fréquence statistique d'occurrence de valeurs de coefficients au niveau d'emplacements dans l'agencement de blocs ; et
    dans une traversée des emplacements selon l'ordre de balayage une fois par bloc des données d'image numérique ou des données de vidéo numérique, échanger conditionnellement l'ordre d'emplacements qui sont adjacents à l'ordre de balayage sur la base d'une comparaison des valeurs représentant la fréquence statistique d'occurrence de valeurs de coefficients auxdits emplacements ; et
    coder par entropie les coefficient dans l'ordre de balayage adapté.
  7. Au moins un support d'enregistrement lisible par ordinateur transportant un programme de traitement de médias numériques exécutable par ordinateur pour mettre en oeuvre un procédé, à base de transformée de blocs, de codage de données d'image numérique ou de données de vidéo numérique selon l'une quelconque des revendications 1 à 5.
  8. Procédé, à base de transformée de blocs, de décodage de données d'image numérique ou de données de vidéo numérique, le procédé consistant à :
    décoder par entropie des coefficients pour un bloc en cours des données d'image numérique ou des données de vidéo numérique ;
    agencer les valeurs de coefficients décodés pour le bloc en cours dans un agencement de blocs présentant une pluralité d'emplacements selon un ordre de balayage ;
    analyser la fréquence statistique d'occurrence d'une valeur non nulle de coefficients au niveau d'emplacements dans l'agencement de blocs ;
    adapter l'ordre de balayage des coefficients selon les statistiques, en mettant en oeuvre les étapes ci-dessous consistant à :
    initialiser l'ordre de balayage des coefficients à un ordre initial ;
    pour les coefficients dans le bloc en cours des données d'image numérique ou des données de vidéo numérique, mettre à jour un ensemble de valeurs représentant la fréquence statistique d'occurrence de valeurs de coefficients au niveau d'emplacements dans l'agencement de blocs ; et
    dans une traversée des emplacements selon l'ordre de balayage une fois par bloc des données d'image numérique ou des données de vidéo numérique, échanger conditionnellement l'ordre d'emplacements qui sont adjacents dans l'ordre sur la base d'une comparaison des valeurs représentant la fréquence statistique d'occurrence de valeurs de coefficients audits emplacements.
  9. Procédé selon la revendication 8, consistant en outre à :
    mettre en oeuvre l'adaptation de l'ordre de balayage sur une base causale et déterministe, de sorte qu'une signalisation explicite de l'ordre de balayage des coefficients dans les données d'image numérique ou les données de vidéo numérique est évitée.
  10. Procédé selon la revendication 8, dans lequel l'adaptation de l'ordre de balayage consiste à :
    trier les emplacements selon la fréquence statistique d'occurrence de valeurs de coefficients aux emplacements dans l'agencement de blocs ; et
    réagencer l'ordre de balayage selon le tri.
  11. Procédé selon la revendication 8, consistant en outre à réinitialiser périodiquement les statistiques de la fréquence d'occurrence de valeurs de coefficients aux emplacements au cours du décodage de blocs des données d'image numérique ou des données de vidéo numérique.
  12. Procédé selon la revendication 8, consistant en outre à :
    réinitialiser périodiquement l'ordre de balayage à un ordre initial.
  13. Décodeur de médias numériques comprenant :
    une mémoire contenant une structure de données de représentation d'ordres de balayage représentative d'un ordre de balayage d'emplacements dans un agencement de blocs de coefficients de transformée, et une structure de données de représentation de statistiques représentative d'une fréquence statistique d'occurrence d'une valeur de coefficient non nulle aux emplacements ;
    un processeur programmé de manière à :
    décoder par entropie des coefficients pour un bloc en cours de données d'image numérique ou de données de vidéo numérique ;
    agencer les valeurs de coefficients décodés pour le bloc en cours dans un agencement de blocs présentant une pluralité d'emplacements selon l'ordre de balayage ;
    analyser la fréquence statistique d'occurrence d'une valeur non nulle de coefficients au niveau d'emplacements dans l'agencement de blocs ;
    adapter l'ordre de balayage des coefficients selon les statistiques, en mettant en oeuvre les étapes ci-dessous consistant à :
    initialiser l'ordre de balayage des coefficients à un ordre initial ;
    pour des coefficients dans le bloc en cours des données d'image numérique ou des données de vidéo numérique, mettre à jour un ensemble de valeurs représentant la fréquence statistique d'occurrence de valeurs de coefficients au niveau d'emplacements dans l'agencement de blocs ; et
    dans une traversée des emplacements selon l'ordre de balayage une fois par bloc des données d'image numérique ou des données de vidéo numérique, échanger conditionnellement l'ordre d'emplacements qui sont adjacents dans l'ordre sur la base d'une comparaison des valeurs représentant la fréquence statistique d'occurrence de valeurs de coefficients auxdits emplacements.
  14. Au moins un support d'enregistrement lisible par ordinateur transportant un programme de traitement de médias numériques exécutable par ordinateur en vue de mettre en oeuvre un procédé, à base de transformée de blocs, de décodage de données d'image numérique ou de données de vidéo numérique selon l'une quelconque des revendications 8 à 12.
EP05026123.9A 2004-12-31 2005-11-30 Chemin de balayage adaptatif de coefficients Active EP1679903B1 (fr)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US11/026,650 US8311119B2 (en) 2004-12-31 2004-12-31 Adaptive coefficient scan order

Publications (3)

Publication Number Publication Date
EP1679903A2 EP1679903A2 (fr) 2006-07-12
EP1679903A3 EP1679903A3 (fr) 2006-07-26
EP1679903B1 true EP1679903B1 (fr) 2014-10-01

Family

ID=36390237

Family Applications (1)

Application Number Title Priority Date Filing Date
EP05026123.9A Active EP1679903B1 (fr) 2004-12-31 2005-11-30 Chemin de balayage adaptatif de coefficients

Country Status (10)

Country Link
US (2) US8311119B2 (fr)
EP (1) EP1679903B1 (fr)
JP (2) JP4700491B2 (fr)
KR (1) KR101260073B1 (fr)
CN (1) CN1798341B (fr)
AU (1) AU2005234613B2 (fr)
BR (1) BRPI0504835B1 (fr)
CA (1) CA2527654C (fr)
MX (1) MXPA05012973A (fr)
RU (1) RU2404534C2 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017138832A1 (fr) 2016-02-12 2017-08-17 Huawei Technologies Co., Ltd. Procédé et appareil pour une sélection d'ordre de balayage
WO2017138831A1 (fr) 2016-02-12 2017-08-17 Huawei Technologies Co., Ltd. Procédé et appareil de sélection d'ordre de balayage
US11330272B2 (en) 2010-12-22 2022-05-10 Qualcomm Incorporated Using a most probable scanning order to efficiently code scanning order information for a video block in video coding

Families Citing this family (84)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8208540B2 (en) 2005-08-05 2012-06-26 Lsi Corporation Video bitstream transcoding method and apparatus
US8155194B2 (en) * 2005-08-05 2012-04-10 Lsi Corporation Method and apparatus for MPEG-2 to H.264 video transcoding
US8045618B2 (en) * 2005-08-05 2011-10-25 Lsi Corporation Method and apparatus for MPEG-2 to VC-1 video transcoding
US7881384B2 (en) * 2005-08-05 2011-02-01 Lsi Corporation Method and apparatus for H.264 to MPEG-2 video transcoding
US7903739B2 (en) * 2005-08-05 2011-03-08 Lsi Corporation Method and apparatus for VC-1 to MPEG-2 video transcoding
US7912127B2 (en) * 2005-08-05 2011-03-22 Lsi Corporation H.264 to VC-1 and VC-1 to H.264 transcoding
US7933337B2 (en) * 2005-08-12 2011-04-26 Microsoft Corporation Prediction of transform coefficients for image compression
EP1949703A4 (fr) * 2005-10-21 2011-03-16 Korea Electronics Telecomm Dispositif et procede de codage et de decodage d'une image mobile par balayage adaptatif
WO2008047319A1 (fr) * 2006-10-20 2008-04-24 Nokia Corporation Indication générique de chemins d'adaptation pour multimédia extensible
US8184710B2 (en) 2007-02-21 2012-05-22 Microsoft Corporation Adaptive truncation of transform coefficient data in a transform-based digital media codec
US8428133B2 (en) * 2007-06-15 2013-04-23 Qualcomm Incorporated Adaptive coding of video block prediction mode
US8571104B2 (en) 2007-06-15 2013-10-29 Qualcomm, Incorporated Adaptive coefficient scanning in video coding
JP2009027541A (ja) * 2007-07-20 2009-02-05 Ntt Docomo Inc 画像符号化装置、方法及びプログラム、並びに、画像復号装置、方法及びプログラム
KR20090097013A (ko) * 2008-03-10 2009-09-15 삼성전자주식회사 영상 부호화장치 및 영상 복호화장치
TWI349487B (en) * 2008-03-25 2011-09-21 Novatek Microelectronics Corp Entropy encoding circuit and encoding method thereof
JP5177400B2 (ja) * 2008-04-24 2013-04-03 株式会社メガチップス エンコーダ
TWI376959B (en) * 2008-05-02 2012-11-11 Novatek Microelectronics Corp Entropy decoding circuit, entropy decoding method, and entropy decoding method using a pipeline manner
US8000546B2 (en) * 2008-08-01 2011-08-16 National Cheng Kung University Adaptive scan method for image/video coding
US8194991B2 (en) * 2008-10-20 2012-06-05 Motorola Mobililty, Inc. Out-of-order coding
EP2182732A1 (fr) 2008-10-28 2010-05-05 Panasonic Corporation Commutation entre des balayages dans un codage d'image
US8737613B2 (en) * 2008-11-20 2014-05-27 Mediatek Inc. Scanning methods of transform-based digital data processing that conditionally adjust scan order according to characteristics information and related apparatus thereof
JP5334070B2 (ja) 2009-02-13 2013-11-06 ブラックベリー リミテッド 画像処理における均衡ピクセル領域ひずみ分布を有する適合量子化
JP5303659B2 (ja) 2009-02-13 2013-10-02 リサーチ イン モーション リミテッド イントラコード化された画像またはフレームのインループ非ブロック化
EP2396969A4 (fr) * 2009-02-13 2012-12-12 Research In Motion Ltd Codage entropique modifié pour images et vidéos
JP5421609B2 (ja) 2009-02-17 2014-02-19 キヤノン株式会社 スキャン変換装置及び画像符号化装置、並びにそれらの制御方法
JP5004986B2 (ja) * 2009-03-19 2012-08-22 キヤノン株式会社 スキャン変換装置及び画像符号化装置、並びにそれらの制御方法
JP5240935B2 (ja) * 2009-05-13 2013-07-17 株式会社メガチップス 画像処理装置
JP5302769B2 (ja) * 2009-05-14 2013-10-02 キヤノン株式会社 スキャン変換装置及び画像符号化装置及びそれらの制御方法
EP2271102A1 (fr) 2009-06-29 2011-01-05 Thomson Licensing Codage adaptif d'une image résiduelle
US9094691B2 (en) * 2010-03-15 2015-07-28 Mediatek Singapore Pte. Ltd. Methods of utilizing tables adaptively updated for coding/decoding and related processing circuits thereof
US9049450B2 (en) 2010-04-05 2015-06-02 Samsung Electronics Co., Ltd. Method and apparatus for encoding video based on internal bit depth increment, and method and apparatus for decoding video based on internal bit depth increment
WO2011126288A2 (fr) * 2010-04-05 2011-10-13 Samsung Electronics Co., Ltd. Procédé et appareil destinés à coder et à décoder une image et procédé et appareil destinés à décoder une image à l'aide d'un ordre de balayage de coefficient adaptatif
KR20110112168A (ko) * 2010-04-05 2011-10-12 삼성전자주식회사 내부 비트뎁스 확장에 기반한 비디오 부호화 방법 및 그 장치, 내부 비트뎁스 확장에 기반한 비디오 복호화 방법 및 그 장치
WO2011126282A2 (fr) 2010-04-05 2011-10-13 Samsung Electronics Co., Ltd. Procédé et appareil destinés à coder une vidéo à l'aide d'un indice de transformation, et procédé et appareil destinés à décoder une vidéo à l'aide d'un indice de transformation
WO2011126277A2 (fr) 2010-04-05 2011-10-13 Samsung Electronics Co., Ltd. Procédé et appareil destinés à un codage/décodage d'entropie de faible complexité
US8929440B2 (en) * 2010-04-09 2015-01-06 Sony Corporation QP adaptive coefficients scanning and application
PL2559244T3 (pl) * 2010-04-13 2018-01-31 Ge Video Compression Llc Kodowanie map istotności i bloków współczynników transformacji
US8559741B2 (en) * 2010-06-02 2013-10-15 Altek Corporation Lossless image compression method
US9215470B2 (en) * 2010-07-09 2015-12-15 Qualcomm Incorporated Signaling selected directional transform for video coding
JP2012019448A (ja) * 2010-07-09 2012-01-26 Sony Corp 画像処理装置および方法
CN102447895B (zh) 2010-09-30 2013-10-02 华为技术有限公司 扫描方法及装置、反扫描方法及装置
KR20130054408A (ko) 2010-10-05 2013-05-24 제너럴 인스트루먼트 코포레이션 지그재그 스캔에 의한 적응적 컨텍스트 모델 선택을 이용하는 코딩 및 디코딩
US9641846B2 (en) 2010-10-22 2017-05-02 Qualcomm Incorporated Adaptive scanning of transform coefficients for video coding
US9042440B2 (en) 2010-12-03 2015-05-26 Qualcomm Incorporated Coding the position of a last significant coefficient within a video block based on a scanning order for the block in video coding
US8976861B2 (en) 2010-12-03 2015-03-10 Qualcomm Incorporated Separately coding the position of a last significant coefficient of a video block in video coding
JP2012129888A (ja) * 2010-12-16 2012-07-05 Samsung Electronics Co Ltd 画像符号化装置及び画像符号化方法
US20120163472A1 (en) * 2010-12-22 2012-06-28 Qualcomm Incorporated Efficiently coding scanning order information for a video block in video coding
US20120236931A1 (en) * 2010-12-23 2012-09-20 Qualcomm Incorporated Transform coefficient scan
US10992958B2 (en) 2010-12-29 2021-04-27 Qualcomm Incorporated Video coding using mapped transforms and scanning modes
US9490839B2 (en) 2011-01-03 2016-11-08 Qualcomm Incorporated Variable length coding of video block coefficients
US9106913B2 (en) * 2011-03-08 2015-08-11 Qualcomm Incorporated Coding of transform coefficients for video coding
US20120230418A1 (en) 2011-03-08 2012-09-13 Qualcomm Incorporated Coding of transform coefficients for video coding
CN102685503B (zh) 2011-03-10 2014-06-25 华为技术有限公司 变换系数的编码方法、变换系数的解码方法，和装置
US9491469B2 (en) 2011-06-28 2016-11-08 Qualcomm Incorporated Coding of last significant transform coefficient
US9516316B2 (en) 2011-06-29 2016-12-06 Qualcomm Incorporated VLC coefficient coding for large chroma block
US9338456B2 (en) 2011-07-11 2016-05-10 Qualcomm Incorporated Coding syntax elements using VLC codewords
US9756360B2 (en) * 2011-07-19 2017-09-05 Qualcomm Incorporated Coefficient scanning in video coding
US8891616B1 (en) 2011-07-27 2014-11-18 Google Inc. Method and apparatus for entropy encoding based on encoding cost
PL3849199T3 (pl) * 2011-11-07 2023-04-17 Tagivan Ii Llc Sposób kodowania obrazu i urządzenie kodujące obraz
US8660374B1 (en) * 2011-12-23 2014-02-25 Massachusetts Institute Of Technology Selecting transform paths for compressing visual data
CN108769691B (zh) * 2011-12-28 2022-05-31 夏普株式会社 图像解码装置、图像解码方法以及图像编码装置
US9363510B2 (en) * 2012-03-02 2016-06-07 Qualcomm Incorporated Scan-based sliding window in context derivation for transform coefficient coding
JP2012170140A (ja) * 2012-05-11 2012-09-06 Ntt Docomo Inc 画像符号化装置及び画像復号装置
US9774856B1 (en) 2012-07-02 2017-09-26 Google Inc. Adaptive stochastic entropy coding
US9509998B1 (en) 2013-04-04 2016-11-29 Google Inc. Conditional predictive multi-symbol run-length coding
CN104104958B (zh) * 2013-04-08 2017-08-25 联发科技（新加坡）私人有限公司 图像解码方法及其图像解码装置
JP2016528810A (ja) 2013-07-24 2016-09-15 マイクロソフト テクノロジー ライセンシング，エルエルシー 非変換符号化のためのスキャン順序
JP5646713B2 (ja) * 2013-09-13 2014-12-24 株式会社Ｎｔｔドコモ 画像符号化装置、方法及びプログラム、並びに、画像復号装置、方法及びプログラム
US9392288B2 (en) 2013-10-17 2016-07-12 Google Inc. Video coding using scatter-based scan tables
US9179151B2 (en) 2013-10-18 2015-11-03 Google Inc. Spatial proximity context entropy coding
KR102218196B1 (ko) 2013-10-28 2021-02-23 삼성전자주식회사 인코더, 이의 동작 방법과, 상기 인코더를 포함하는 장치들
JP5893711B2 (ja) * 2014-11-04 2016-03-23 株式会社Ｎｔｔドコモ 画像符号化装置、方法及びプログラム、並びに、画像復号装置、方法及びプログラム
US10306229B2 (en) 2015-01-26 2019-05-28 Qualcomm Incorporated Enhanced multiple transforms for prediction residual
US10261832B2 (en) * 2015-12-02 2019-04-16 At&T Mobility Ii Llc Sorting apparatus
JP6109354B2 (ja) * 2016-01-20 2017-04-05 株式会社Ｎｔｔドコモ 画像復号装置、方法及びプログラム
US10623774B2 (en) 2016-03-22 2020-04-14 Qualcomm Incorporated Constrained block-level optimization and signaling for video coding tools
CN107545011B (zh) * 2016-06-29 2020-04-10 高德信息技术有限公司 一种数据读取方法及装置
US10440394B2 (en) 2016-09-08 2019-10-08 Google Llc Context adaptive scan order for entropy coding
US11477492B2 (en) 2017-08-04 2022-10-18 Google Inc. Adaptation for entropy coding of blocks of image data
EP3484148A1 (fr) 2017-11-09 2019-05-15 Thomson Licensing Ordre de balayage automatisé de blocs subdivisés
US10382758B2 (en) 2017-12-15 2019-08-13 Google Llc Transform block-level scan order selection for video coding
US11323748B2 (en) 2018-12-19 2022-05-03 Qualcomm Incorporated Tree-based transform unit (TU) partition for video coding
CN111090048B (zh) * 2019-12-19 2021-09-24 重庆大学 一种新能源汽车车载数据自适应时间间隔传输方法
CN112903613B (zh) * 2021-02-24 2022-11-08 南昌大学 一种基于Labview的瞬态吸收光谱控制系统设计方法

Family Cites Families (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5714950A (en) * 1992-07-23 1998-02-03 Samsung Electronics Co., Ltd. System for variable-length-coding and variable-length-decoding digitaldata
JPH06177774A (ja) 1992-12-04 1994-06-24 Asahi Chem Ind Co Ltd 画像再生方法および画像再生装置
TW224553B (en) 1993-03-01 1994-06-01 Sony Co Ltd Method and apparatus for inverse discrete consine transform and coding/decoding of moving picture
JPH0750836A (ja) 1993-08-06 1995-02-21 Sharp Corp 画像符号化装置
JP3292221B2 (ja) 1993-09-14 2002-06-17 ソニー株式会社 画像圧縮符号化方法
US5729484A (en) * 1994-02-28 1998-03-17 Intel Corporation Processes, apparatuses, and systems of encoding and decoding signals using transforms
US5748244A (en) 1995-03-28 1998-05-05 Daewoo Electronics Co., Ltd. Adaptive runlength coding based on zero and non-zero subblocks
KR0178198B1 (ko) * 1995-03-28 1999-05-01 배순훈 영상 신호 부호화 장치
JPH0974562A (ja) 1995-09-04 1997-03-18 Nippon Telegr & Teleph Corp <Ntt> 画像信号符号化方法
JP3967405B2 (ja) 1996-10-09 2007-08-29 テキサス インスツルメンツ インコーポレイテツド 画像信号の符号化方法
JP3720850B2 (ja) 1997-01-31 2005-11-30 シーメンス アクチエンゲゼルシヤフト デジタル化画像の符号化および復号化のための方法および装置
JPH11275582A (ja) 1998-03-22 1999-10-08 Sony Corp 画像符号化装置及び画像復号装置並びにそれらの方法
KR100323692B1 (ko) 1999-05-13 2002-02-07 구자홍 허프만 테이블의 재배열에 의한 영상 부호화 방법 및 영상 부호화기 및 복호화기
US6947874B2 (en) * 2000-11-16 2005-09-20 Canon Kabushiki Kaisha Entropy coding
CN101448162B (zh) * 2001-12-17 2013-01-02 微软公司 处理视频图像的方法
KR100468844B1 (ko) 2002-01-07 2005-01-29 삼성전자주식회사 정지영상 및 동영상을 부호화/복호화하기 위한변환계수들의 최적주사방법
JP2003333339A (ja) 2002-05-13 2003-11-21 Sony Corp 画像符号化装置及び画像符号化方法
US7463782B2 (en) * 2002-11-05 2008-12-09 Canon Kabushiki Kaisha Data encoding with an amplitude model and path between the data and corresponding decoding
US7688894B2 (en) * 2003-09-07 2010-03-30 Microsoft Corporation Scan patterns for interlaced video content
US7782954B2 (en) * 2003-09-07 2010-08-24 Microsoft Corporation Scan patterns for progressive video content

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11330272B2 (en) 2010-12-22 2022-05-10 Qualcomm Incorporated Using a most probable scanning order to efficiently code scanning order information for a video block in video coding
WO2017138832A1 (fr) 2016-02-12 2017-08-17 Huawei Technologies Co., Ltd. Procédé et appareil pour une sélection d'ordre de balayage
WO2017138831A1 (fr) 2016-02-12 2017-08-17 Huawei Technologies Co., Ltd. Procédé et appareil de sélection d'ordre de balayage
US10798390B2 (en) 2016-02-12 2020-10-06 Huawei Technologies Co., Ltd. Method and apparatus for scan order selection
US11582455B2 (en) 2016-02-12 2023-02-14 Huawei Technologies Co., Ltd. Method and apparatus for scan order selection

Also Published As

Publication number Publication date
CN1798341B (zh) 2012-07-18
US8311119B2 (en) 2012-11-13
US20060146936A1 (en) 2006-07-06
JP2011125038A (ja) 2011-06-23
BRPI0504835A (pt) 2006-09-12
AU2005234613B2 (en) 2010-02-25
EP1679903A3 (fr) 2006-07-26
RU2404534C2 (ru) 2010-11-20
KR101260073B1 (ko) 2013-05-02
BRPI0504835A8 (pt) 2016-10-04
EP1679903A2 (fr) 2006-07-12
MXPA05012973A (es) 2006-06-29
AU2005234613A1 (en) 2006-07-20
US20130070843A1 (en) 2013-03-21
RU2005137246A (ru) 2007-06-10
KR20060079087A (ko) 2006-07-05
JP4700491B2 (ja) 2011-06-15
CA2527654C (fr) 2015-01-06
CA2527654A1 (fr) 2006-06-30
JP2006191628A (ja) 2006-07-20
BRPI0504835B1 (pt) 2018-12-26
CN1798341A (zh) 2006-07-05
US8824557B2 (en) 2014-09-02
JP5027936B2 (ja) 2012-09-19

Similar Documents

Publication Publication Date Title
EP1679903B1 (fr) Chemin de balayage adaptatif de coefficients
EP1922874B1 (fr) Prediction de coefficients de transformee pour compression d&#39;images
KR101247011B1 (ko) 넓은 범위 계수의 적응형 코딩 및 디코딩
US9584821B2 (en) Method and apparatus for encoding and decoding image by using large transform unit
CN107835431B (zh) 对视频编码的方法和设备以及对视频解码的方法和设备
US9077960B2 (en) Non-zero coefficient block pattern coding
JP2013179707A (ja) 大きいサイズの変換単位を利用した映像符号化、復号化方法及び装置
AU2021200431B2 (en) Techniques for high efficiency entropy coding of video data
CN114025166A (zh) 视频压缩方法、电子设备及计算机可读存储介质
JP2002209112A (ja) 適応的静止画像符号化装置

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

PUAL Search report despatched

Free format text: ORIGINAL CODE: 0009013

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

AX Request for extension of the european patent

Extension state: AL BA HR MK YU

AK Designated contracting states

Kind code of ref document: A3

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

AX Request for extension of the european patent

Extension state: AL BA HR MK YU

RIN1 Information on inventor provided before grant (corrected)

Inventor name: SRINIVASAN, SRIDHAR

17P Request for examination filed

Effective date: 20061120

17Q First examination report despatched

Effective date: 20061229

AKX Designation fees paid

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

REG Reference to a national code

Ref country code: DE

Ref legal event code: R079

Ref document number: 602005044810

Country of ref document: DE

Free format text: PREVIOUS MAIN CLASS: H04N0007300000

Ipc: H04N0019600000

RIC1 Information provided on ipc code assigned before grant

Ipc: H04N 19/60 20140101AFI20140319BHEP

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

INTG Intention to grant announced

Effective date: 20140522

INTG Intention to grant announced

Effective date: 20140530

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

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

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 690018

Country of ref document: AT

Kind code of ref document: T

Effective date: 20141015

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602005044810

Country of ref document: DE

Effective date: 20141106

REG Reference to a national code

Ref country code: NL

Ref legal event code: VDEP

Effective date: 20141001

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 690018

Country of ref document: AT

Kind code of ref document: T

Effective date: 20141001

RAP2 Party data changed (patent owner data changed or rights of a patent transferred)

Owner name: MICROSOFT TECHNOLOGY LICENSING, LLC

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20141001

REG Reference to a national code

Ref country code: GB

Ref legal event code: 732E

Free format text: REGISTERED BETWEEN 20150312 AND 20150318

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20141001

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150202

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20141001

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150201

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20141001

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20141001

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 602005044810

Country of ref document: DE

Representative=s name: BOEHMERT & BOEHMERT ANWALTSPARTNERSCHAFT MBB -, DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20150102

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20141001

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20141001

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20141001

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20141001

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20141001

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 602005044810

Country of ref document: DE

Representative=s name: BOEHMERT & BOEHMERT ANWALTSPARTNERSCHAFT MBB -, DE

Effective date: 20150430

Ref country code: DE

Ref legal event code: R081

Ref document number: 602005044810

Country of ref document: DE

Owner name: MICROSOFT TECHNOLOGY LICENSING, LLC, REDMOND, US

Free format text: FORMER OWNER: MICROSOFT CORP., REDMOND, WASH., US

Effective date: 20141002

Ref country code: DE

Ref legal event code: R081

Ref document number: 602005044810

Country of ref document: DE

Owner name: MICROSOFT TECHNOLOGY LICENSING, LLC, REDMOND, US

Free format text: FORMER OWNER: MICROSOFT CORP., REDMOND, WASH., US

Effective date: 20150430

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20141130

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20141001

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602005044810

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20141130

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20141001

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20141130

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20141001

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20141001

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20141001

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

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

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20141001

26N No opposition filed

Effective date: 20150702

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 11

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20141130

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20141001

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20141001

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20141001

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20051130

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20141130

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 12

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 13

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 14

REG Reference to a national code

Ref country code: DE

Ref legal event code: R082

Ref document number: 602005044810

Country of ref document: DE

Representative=s name: GRUENECKER PATENT- UND RECHTSANWAELTE PARTG MB, DE

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230505

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20231019

Year of fee payment: 19

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20231019

Year of fee payment: 19

Ref country code: DE

Payment date: 20231019

Year of fee payment: 19