Movatterモバイル変換


[0]ホーム

URL:


EP2606648A1 - Coding and decoding utilizing adaptive context model selection with zigzag scan - Google Patents

Coding and decoding utilizing adaptive context model selection with zigzag scan

Info

Publication number
EP2606648A1
EP2606648A1EP11779258.0AEP11779258AEP2606648A1EP 2606648 A1EP2606648 A1EP 2606648A1EP 11779258 AEP11779258 AEP 11779258AEP 2606648 A1EP2606648 A1EP 2606648A1
Authority
EP
European Patent Office
Prior art keywords
significance map
array
transform
coding
utilizing
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
EP11779258.0A
Other languages
German (de)
French (fr)
Inventor
Jian Lou
Krit Panusopone
Limin Wang
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.)
Google Technology Holdings LLC
Original Assignee
Arris Technology Inc
General Instrument 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 Arris Technology Inc, General Instrument CorpfiledCriticalArris Technology Inc
Publication of EP2606648A1publicationCriticalpatent/EP2606648A1/en
Ceasedlegal-statusCriticalCurrent

Links

Classifications

Definitions

Landscapes

Abstract

There is a coding. The coding may include preparing video compression data based on source pictures utilizing a processor. The preparing may include processing a generated transform unit, including generating a significance map having a significance map array with y-x locations corresponding to the transform array. The generating may include scanning, utilizing a zigzag scanning pattern, a plurality of significance map elements in the significance map array. The generating may also include determining, utilizing the zigzag scanning pattern, a context model for coding a significance map element of the plurality of significance map elements based on a value associated with at least one coded neighbor significance map element of the significance map element in the significance map array. There is also a decoding including processing video compression data which is generated in the coding.

Description

CODING AND DECODING UTILIZING
ADAPTIVE CONTEXT MODEL SELECTION WITH ZIGZAG SCAN
PRIORITY
[001] The present application claims the benefit of priority to U.S.
Provisional Patent Application Serial No. 61/389,932, filed on October 5, 2010, entitled "Adaptive Context Selection for Zigzag Scan", by Jian Lou, et al., the disclosure of which is hereby incorporated by reference in its entirety.
CROSS REFERENCE TO RELATED APPLICATIONS
[002] The present application is related to U.S. Utility Patent Application
Serial No. 13/253,933, filed on October 5, 201 1 , entitled "Coding and Decoding Utilizing Context Model Selection with Adaptive Scan Pattern", by Jian Lou, et al., which claims priority to U.S. Provisional Patent Application Serial No. 61/393,198, filed on October 14, 2010, entitled "Context Selection for Adaptive Scanning Pattern", by Jian Lou, et al., the disclosures of which are hereby incorporated by reference in their entirety.
BACKGROUND
[003] Video compression utilizes block processing for many operations.
In block processing, a block of neighboring pixels is grouped into a coding unit and compression operations treat this group of pixels as one unit to take advantage of correlations among neighboring pixels within the coding unit. Block-based processing often includes prediction coding and transform coding. Transform coding with quantization is a type of data compression which is commonly "lossy" as the quantization of a transform block taken from a source picture often discards data associated with the transform block in the source picture, thereby lowering its bandwidth requirement but often also resulting in lower quality reproduction of the original transform block from the source picture.
[004] MPEG-4 AVC, also known as H.264, is an established video compression standard utilizing transform coding in block processing. In H.264, a picture is divided into macroblocks (MBs) of 16x16 pixels. Each MB is often further divided into smaller blocks. Blocks equal in size to or smaller than a MB are predicted using intra-/inter-picture prediction, and a spatial transform along with quantization is applied to the prediction residuals. The quantized transform coefficients of the residuals are commonly encoded using entropy coding methods (i.e., variable length coding or arithmetic coding). Context Adaptive Binary Arithmetic Coding (CABAC) was introduced in H.264 to provide a substantially lossless compression efficiency by combining an adaptive binary arithmetic coding technique with a set of context models. Context model selection plays a role in CABAC in providing a degree of adaptation and redundancy reduction. H.264 specifies two kinds of scan patterns over 2D blocks. A zigzag scan is utilized for pictures coded with progressive video compression techniques and an alternative scan is for pictures coded with interlaced video compression techniques.
[005] H.264 uses 2D block-based transform of block sizes 2x2, 4x4 and 8x8. A block-based transform converts a block of pixels in spatial domain into a block of coefficients in transform domain. Quantization then maps transform coefficients into a finite set. After quantization, many high frequency coefficients become zero. For a block having at least one non-zero coefficient after 2D transform and quantization operation, a significance map is developed, which specifies the position(s) of the non-zero quantized coefficient(s) within the 2D transform domain. Specifically, given a quantized 2D transformed block, if the value of a quantized coefficient at a position (y, x) is non zero, it is considered as significant and a "1 " is assigned for the position (y, x) in the associated significance map. Otherwise, a "0" is assigned to the position (y, x) in the significance map. In H.264, CABAC is used for coding and decoding each element of the significance map.
[006] HEVC (High Efficiency Video Coding), an international video coding standard being developed to succeed H.264, extends transform block sizes to 16x16 and 32x32 pixels to benefit high definition (HD) video coding. In the models under consideration for HEVC, a set of transform coefficient coding and decoding tools can be enabled for entropy coding and decoding. Among these tools is an adaptive scan scheme, which is applied for significance map coding and decoding. This scheme adaptively switches between two scan patterns for coding and decoding a significance map if the significance map array size is larger than 8x8.
[007] The adaptive scan scheme directs the scan order for coding and decoding a significance map by switching between two predefined scan patterns per diagonal line, either from bottom-left to top-right or from top-right to bottom- left diagonally. The switching occurs at the end of each diagonal sub-scan, and is controlled by two counters. The first counter, Ci , tracks the number of coded significant transform coefficients located in the bottom-left half of a transform block. The second counter, C2, tracks the number of coded significant transform coefficients which are located in the top-right half of a transform block. The implementation of the models considered for HEVC with using two scan patterns and two counters introduces substantial computational complexity and additional memory requirements. These complexities include tracking the count of coded significant transform coefficients located in the bottom-left half or in the top-right half of a transform, performing branch operations and making scan selections for coefficients in significance map coding and decoding. On the other hand, the adaptive scan scheme achieves only a negligible performance gain. Or, it provides no substantial gain in reducing bandwidth requirements for compression data associated with transform processing. SUMMARY
[008] According to principles of the invention, there are systems, methods, and computer readable mediums (CRMs) which provide for coding and decoding utilizing adaptive context model selection with zigzag scan. By utilizing adaptive context model selection by zigzag scan, inefficiencies in transform processing are reduced. These include inefficiencies based on overhead associated with computational complexities including tracking the counts of coded significant transform coefficients located in the bottom-left half and in the top-right half of a transform, performing branch operations and making scan selections for coefficients in significance map coding and decoding.
[009] According to a first principle of the invention, there is a system for coding. The system may include a processor configured to prepare video compression data based on source pictures. The preparing may include partitioning the source pictures into coding units. The preparing may also include generating one or more transform unit(s) having a transform array. The transform array may including transform coefficients assigned as entries to y-x locations of the transform array. The transform coefficients may be based on residual measures associated with the coding units. The preparing may include processing the generated transform unit. The processing may include generating a significance map, having a significance map array with y-x locations corresponding to the y-x locations of the transform array. The processing may also include scanning, utilizing a zigzag scanning pattern, a plurality of significance map elements in the significance map array. The processing may also include determining, utilizing the zigzag scanning pattern, a context model for coding a significance map element of the plurality of significance map elements based on a value associated with at least one coded neighbor significance map element of the significance map element in the significance map array. [0010] According to a second principle of the invention, there is a method for coding. The method may include preparing video compression data based on source pictures. The preparing may include partitioning the source pictures into coding units. The preparing may also include generating one or more transform unit(s) having a transform array. The transform array may including transform coefficients assigned as entries to y-x locations of the transform array. The transform coefficients may be based on residual measures associated with the coding units. The preparing may include processing the generated transform unit. The processing may include generating a significance map, having a significance map array with y-x locations corresponding to the y-x locations of the transform array. The processing may also include scanning, utilizing a zigzag scanning pattern, a plurality of significance map elements in the significance map array. The processing may also include determining, utilizing the zigzag scanning pattern, a context model for coding a significance map element of the plurality of significance map elements based on a value associated with at least one coded neighbor significance map element of the significance map element in the significance map array.
[0011] According to a third principle of the invention, there is a non- transitory CRM storing computer readable instructions which, when executed by a computer system, performs a method for coding. The method may include preparing video compression data based on source pictures. The preparing may include partitioning the source pictures into coding units. The preparing may also include generating one or more transform unit(s) having a transform array. The transform array may include transform coefficients assigned as entries to y-x locations of the transform array. The transform coefficients may be based on residual measures associated with the coding units. The preparing may include processing the generated transform unit. The processing may include generating a significance map, having a significance map array with y-x locations corresponding to the y-x locations of the transform array. The processing may also include scanning, utilizing a zigzag scanning pattern, a plurality of significance map elements in the significance map array. The processing may also include determining, utilizing the zigzag scanning pattern, a context model for coding a significance map element of the plurality of significance map elements based on a value associated with at least one coded neighbor significance map element of the significance map element in the significance map array.
[0012] According to a fourth principle of the invention, there is a system for decoding. The system may include an interface configured to receive video compression data. The system may also include a processor configured to process the received video compression data. The received video compression data may be based on processed transform units, based on source pictures. The preparing may include partitioning the source pictures into coding units. The preparing may also include generating one or more transform unit(s) having a transform array. The transform array may include transform coefficients assigned as entries to y-x locations of the transform array. The transform coefficients may be based on residual measures associated with the coding units. The preparing may include processing the generated transform unit. The processing may include generating a significance map, having a significance map array with y-x locations corresponding to the y-x locations of the transform array. The processing may also include scanning, utilizing a zigzag scanning pattern, a plurality of significance map elements in the significance map array. The processing may also include determining, utilizing the zigzag scanning pattern, a context model for coding a significance map element of the plurality of significance map elements based on a value associated with at least one coded neighbor significance map element of the significance map element in the significance map array.
[0013] According to a fifth principle of the invention, there is a method for decoding. The method may include receiving video compression data. The method may also include processing the received video compression data. The received video compression data may be based on processed transform units, based on source pictures. The preparing may include partitioning the source pictures into coding units. The preparing may also include generating one or more transform unit(s) having a transform array. The transform array may include transform coefficients assigned as entries to y-x locations of the transform array. The transform coefficients may be based on residual measures associated with the coding units. The preparing may include processing the generated transform unit. The processing may include generating a significance map, having a significance map array with y-x locations corresponding to the y-x locations of the transform array. The processing may also include scanning, utilizing a zigzag scanning pattern, a plurality of significance map elements in the significance map array. The processing may also include determining, utilizing the zigzag scanning pattern, a context model for coding a significance map element of the plurality of significance map elements based on a value associated with at least one coded neighbor significance map element of the significance map element in the significance map array.
[0014] According to a sixth principle of the invention, there is a CRM storing computer readable instructions which, when executed by a computer system, performs a method for decoding. The method may include processing the received video compression data. The received video compression data may be based on processed transform units, based on source pictures. The preparing may include partitioning the source pictures into coding units. The preparing may also include generating one or more transform unit(s) having a transform array. The transform array may include transform coefficients assigned as entries to y-x locations of the transform array. The transform coefficients may be based on residual measures associated with the coding units. The preparing may include processing the generated transform unit. The processing may include generating a significance map, having a significance map array with y-x locations corresponding to the y-x locations of the transform array. The processing may also include scanning, utilizing a zigzag scanning pattern, a plurality of significance map elements in the significance map array. The processing may also include determining, utilizing the zigzag scanning pattern, a context model for coding a significance map element of the plurality of significance map elements based on a value associated with at least one coded neighbor significance map element of the significance map element in the significance map array.
[0015] These and other objects are accomplished in accordance with the principles of the invention in providing systems, methods and CRMs which code and decode utilizing adaptive context model selection with zigzag scan. Further features, their nature and various advantages will be more apparent from the accompanying drawings and the following detailed description of the preferred embodiments.
BRIEF DESCRIPTION OF THE DRAWINGS
[0016] Features of the examples and disclosure are apparent to those skilled in the art from the following description with reference to the figures, in which:
[0017] FIG 1 is a block diagram illustrating a coding system and a decoding system utilizing adaptive context model selection by zigzag scan, according to an example;
[0018] FIG 2A is a scan pattern illustrating a zigzag scan for significance map coding and decoding, according to an example;
[0019] FIG 2B is a scan pattern illustrating for comparison purposes an adaptive split zigzag scan for significance map coding and decoding, according to a comparative example;
[0020] FIG 3 is a model illustrating adaptive context model selection by zigzag scan in significance map coding and decoding, according to an example;
[0021] FIG 4A is a model illustrating fixed model selection in significance map coding and decoding of a 2x2 array, according to an example;
[0022] FIG 4B is a model illustrating fixed model selection in significance map coding and decoding of a 4x4 array, according to an example;
[0023] FIG 4C is a model illustrating fixed model selection in significance map coding and decoding of an 8x8 array, according to an example;
[0024] FIG 5 is a flow diagram illustrating a method for preparing a coded significance map utilizing adaptive context model selection with zigzag scan, according to an example;
[0025] FIG 6 is a flow diagram illustrating a method for coding utilizing adaptive context model selection with zigzag scan, according to an example;
[0026] FIG 7 is a flow diagram illustrating a method for decoding utilizing adaptive context model selection with zigzag scan, according to an example; and
[0027] FIG 8 is a block diagram illustrating a computer system to provide a platform for a system for coding and/or a system for decoding utilizing adaptive context model selection with zigzag scan, according to examples.
DETAILED DESCRIPTION
[0028] For simplicity and illustrative purposes, the present invention is described by referring mainly to embodiments, principles and examples thereof. In the following description, numerous specific details are set forth in order to provide a thorough understanding of the examples. It is readily apparent however, that the embodiments may be practiced without limitation to these specific details. In other instances, some methods and structures have not been described in detail so as not to unnecessarily obscure the description. Furthermore, different embodiments are described below. The embodiments may be used or performed together in different combinations.
[0029] As used herein, the term "includes" means "includes at least" but is not limited to the term "including only". The term "based on" means "based at least in part on". The term "picture" means a picture which is either equivalent to a frame or equivalent to a field associated with a frame, such as a field which is one of two sets of interlaced lines of an interlaced video frame. The term "bitstream" is a digital data stream. The term "coding" may refer to encoding of an uncompressed video sequence. The term "coding" may also refer to the transcoding of a compressed video bitstream from one compressed format to another. The term "decoding" may refer to the decoding of a compressed video bitstream.
[0030] As demonstrated in the following examples and embodiments, there are systems, methods, and machine readable instructions stored on computer-readable media (e.g., CRMs) for coding and decoding utilizing adaptive context model selection with zigzag scan. Referring to FIG 1 , there is disclosed a content distribution system 100 including a coding system 1 10 and a decoding system 140 utilizing adaptive context model selection with zigzag scan.
[0031] In the coding system 1 10, the adaptive context model selection with zigzag scan is associated with preparing video compression data based on source pictures by partitioning the source pictures into coding units, and processing transform units based on the coding units.
[0032] In the decoding system 140, the adaptive context model selection with zigzag scan is associated with decoding received video compression information which is prepared utilizing adaptive context model selection with zigzag scan based on preparing video compression data based on source pictures by partitioning the source pictures into coding blocks, and processing transform units based on the coding units.
[0033] Coding for transform units may include three aspects: (1 ) significance map coding, (2) non-zero coefficient level coding, and (3) non-zero coefficient sign coding. Transform units may be processed in generating video compression data, according to an example, by generating a transform unit having a transform array including transform coefficients assigned as entries to y- x locations of the transform array, based on residual measures associated with the coding units. The processing of the generated transform unit may include generating a significance map having a significance map array with y-x locations corresponding to the y-x locations of the transform array. Generating the significance map may include checking of transform coefficients within the generated transform unit. The coding of significance map may include scanning, utilizing a zigzag scanning pattern, a plurality of significance map elements in the significance map array. The generating may also include determining a context model for coding a significance map element. The coding system 1 10 and a decoding system 140 are described in greater detail below after the following detailed description of adaptive context model selection with zigzag scan.
[0034] FIG 2A is an example of a zigzag scan 200 used for the significance map coding and decoding for transform units (i.e., a transform unit having a transform array for adaptive context model selection). As an example, Fig. 2A shows the zigzag scan for 16x16 blocks. The zigzag scan is utilized with adaptive context model selection to determine the sequence by which transform elements, such as transform coefficients, are processed. According to an example, the determination of the context model may be done utilizing the zigzag scanning pattern 200. The context model may be selected based on one or more value(s) associated with at least one coded neighbor significance map element of the significance map element in the significance map array. By comparison, in the models under consideration for HEVC, an adaptive split zigzag scan is used. FIG 2B is a comparative example of an adaptive split zigzag scan 250 and will be discussed in greater detail in the comparative example below.
[0035] According to an example, in adaptive context selection with zigzag scan a zigzag scan 200 is used for the significance map coding and decoding for all array sizes. A context model for an element in a significance map is determined based upon the values (0 or 1 ) of the element's coded neighbors. As one example of adaptive context model determination, given a significance map, the context model for an element in the significance map may be determined as shown in FIG 3, demonstrating adaptive context model criteria 300 for determining a context model for coding and decoding which includes processing a transform unit. The processing may include generating a significance map having an array which corresponds with an array of the transform unit, such as a significance map array of greater than 8x8 entries. The significance map array may include significance map elements assigned as entries to y-x locations of the significance map array, based on residual measures associated with coding units based on a source picture. For a significance map elements at position (0,
0) , (0, 1 ) or (1 , 0), in an array as shown in Fig. 3, a unique context model may be assigned.
[0036] For a significance map element at position (0, x>1 ), in an array as shown in Fig. 3, the context model may be selected based on the values (0 or 1 ) of the element's neighbors at positions (0, x-1 ), (0, x-2), (1 , x-2), and (1 , x-1 ) if x is an even number.
[0037] For a significance map element at position (y>1 , 0), in an array as shown in Fig. 3, the context model may be selected based on the values (0 or 1 ) of the element's neighbors at positions (y-1 , 0), (y-2, 0), (y-2, 1 ) and (y-1 , 1 ) if y is an odd number.
[0038] For a significance map element at position (y>0, x>0), in an array as shown in Fig. 3, the context model may be selected based on the value (0 or
1 ) of the element's neighbors at positions (y-1 , x-1 ), (y-1 , x), (y, x-1 ), and (y-1 , x-
2) and (y, x-2) if x is larger than 1 , (y+1 , x-2) if x is larger than 1 and y is smaller than the height-1 , (y-2, x-1 ) and (y-2, x) if y is larger than 1 , (y-2, x+1 ) if y is larger than 1 and x is smaller than the width-1 , (y-1 , x+1 ) if the sum of x and y is an odd number and x is smaller than the width-1 , (y+1 , x-1 ) if the sum of x and y is an even number and y is smaller than the height-1 .
[0039] For significance maps based on transform units having a transform array of less than or equal to 8x8 entries, a fixed criteria model may be applied based on a location in the array of the significance map. FIGs 4A through 4C show context models for 2x2, 4x4 and 8x8 significance map arrays. They are position dependent and designed based upon the assumption that for arrays of the same size, the value (0 or 1 ) at a specific position in the significance map may follow a similar statistical model. The context selection scheme depicted in FIG4A, FIG4B and FIG4C utilizes the array position as the context selection criteria. However, for larger array sizes, the increased array positions may substantially increase the number of possible context selections which indicates more memory is needed. Applying the adaptive context model selection by zigzag scan may be utilized to keep the number of context selections for arrays larger than 8x8 within a practical limit.
[0040] As a comparative example, in TMuCO.7, one model for HEVC under consideration enables a set of transform coefficient coding and decoding tools. It is switched on by default when the entropy coding option is CABAC/PIPE. Among these tools, an adaptive split zigzag scan 250, as shown in FIG 2B, is applied for significance map coding and decoding. The experimental results indicate that this adaptive split zigzag scan 250 scheme achieves only negligible performance gain. But, it also introduces additional memory and computational complexity as comparing to the zigzag scan as shown in FIG 2A..
[0041] In TMuC0.7, by default, the entropy coding is set to use the option of CABAC/PIPE which incorporates a set of transform coefficient coding and decoding tools. The set of coding and decoding tools in other HEVC models, includes an adaptive scan scheme which adaptively switches between two scan patterns for the significance map coding and decoding if the transform size is larger than 8x8. In TMuC0.7, the scan order for coding and decoding the significance map is allowed to switch between two predefined scan patterns per diagonal line, that is, either from bottom-left to top-right or from top-right to bottom-left diagonally. The switching occurs at the end of each diagonal sub- scan, and it is controlled by two counters, Ci , the number of coded significant transform coefficients that are located in the bottom-left half of the transform block, and c2, the number of coded significant transform coefficients that are located in the top-right half of the transform block.
[0042] Fig. 2B shows a comparative example of the adaptive scan for 16x16 blocks, where the diagonal scan can go either way. In the current implementation of significance map coding and decoding of TMuCO.7, this adaptive scan requires additional memories for the two scan patterns as comparing to one zigzag scan pattern and the two counters Ci and c2. It also introduces additional computational complexity due to counting the number coded of significant transform coefficients located in the bottom-left half or in the top-right half, branch operations and scan selection for each coefficient before the last significant coefficient. The context model for an element in significant map is selected based on the coded neighboring elements in the significant map. Since a diagonal scan may go either way, it is necessary to check if the top-right element or bottom-left element is available for a given current element in significant map coding and decoding. This causes additional branch operations. The experimental results indicate that this adaptive scan scheme achieves only negligible performance gain, but at the expense of additional memory requirements and increased computational complexity.
[0043] In an example according to the principles of the invention, a zigzag scan 200, which is a zigzag scan, is used for significance map coding and decoding when CABAC/PIPE is selected. TMuC0.7 may be modified to replace the adaptive scan with the zigzag scan 200 for larger transform units, (i.e., transform units having an array larger than 8x8). As an example, Fig.2 shows the zigzag scan for a 16x16 array. Since the scan pattern is fixed, the neighborhood for the context selection is also fixed. Additional memory requirements and computation complexity associated with the adaptive scan in TMuC0.7 no longer exists and an adaptive context selection may be utilized, such as adaptive context criteria 300 shown in FIG 3, and described above. [0044] The utilization of the adaptive context model selection with zigzag scan improves coding efficiency as inefficiencies in transform processing are reduced. These include inefficiencies based on overhead otherwise associated with computational complexities including tracking the count of coded significant transform coefficients located in the bottom-left half or in the top-right half of a transform, performing branch operations and making scan selections for coefficients in significance map coding and decoding.
[0045] Referring again to FIG 1 , the coding system 1 10 includes an input interface 130, a controller 1 1 1 , a counter 1 12, a frame memory 1 13, an encoding unit 1 14, a transmitter buffer 1 15 and an output interface 135. The decoding system 140 includes a receiver buffer 150, a decoding unit 151 , a frame memory 152 and a controller 153. The coding system 1 10 and the decoding system 140 are coupled to each other via a transmission path including a compressed bitstream 105. The controller 1 1 1 of the coding system 1 10 controls the amount of data to be transmitted on the basis of the capacity of the receiver buffer 150 and may include other parameters such as the amount of data per a unit of time. The controller 1 1 1 controls the encoding unit 1 14, to prevent the occurrence of a failure of a received signal decoding operation of the decoding system 140. The controller 1 1 1 may be a processor or include, for example, a microcomputer having a processor, a random access memory and a read only memory.
[0046] Source pictures 120 supplied from, for example, a content provider may include a video sequence of frames including source pictures in the video sequence. The source pictures 120 may be uncompressed or compressed. If the source pictures 120 is uncompressed, the coding system 1 10 may be associated with an encoding function. If the source pictures 120 is compressed, the coding system 1 10 may be associated with a transcoding function. Coding units may be derived from the source pictures utilizing the controller 1 1 1 . The frame memory 1 13 may have a first area which may used for storing the incoming source pictures from the source pictures 120 and a second area may be used for reading out the source pictures and outputting them to the encoding unit 1 14. The controller 1 1 1 may output an area switching control signal 123 to the frame memory 1 13. The area switching control signal 123 may indicate whether the first area or the second area is to be utilized.
[0047] The controller 1 1 1 outputs an encoding control signal 124 to the encoding unit 1 14. The encoding control signal 124 causes the encoding unit 1 14 to start an encoding operation such as preparing the coding units based on a source picture. In response to the encoding control signal 124 from the controller 1 1 1 , the encoding unit 1 14 starts to read out the prepared coding units to a high- efficiency encoding process, such as a prediction coding process or a transform coding process which process the prepared coding units generating video compression data based on the source pictures associated with the coding units.
[0048] The encoding unit 1 14 may package the generated video compression data in a packetized elementary stream (PES) including video packets. The encoding unit 1 14 may map the video packets into an encoded video signal 122 using control information and a program time stamp (PTS) and the encoded video signal 122 may be signaled to the transmitter buffer 1 15.
[0049] The encoded video signal 122 including the generated video compression data may be stored in the transmitter buffer 1 14. The information amount counter 1 12 is incremented to indicate the total amount of data in the transmitted buffer 1 15. As data is retrieved and removed from the buffer, the counter 1 12 may be decremented to reflect the amount of data in the transmitter buffer 1 14. The occupied area information signal 126 may be transmitted to the counter 1 12 to indicate whether data from the encoding unit 1 14 has been added or removed from the transmitted buffer 1 15 so the counter 1 12 may be incremented or decremented. The controller 1 1 1 may control the production of video packets produced by the encoding unit 1 14 on the basis of the occupied area information 126 which may be communicated in order to prevent an overflow or underflow from taking place in the transmitter buffer 1 15. [0050] The infornnation amount counter 1 12 may be reset in response to a preset signal 128 generated and output by the controller 1 1 1 . After the information counter 1 12 is reset, it may count data output by the encoding unit 1 14 and obtain the amount of video compression data and/or video packets which has been generated. Then, the information amount counter 1 12 may supply the controller 1 1 1 with an information amount signal 129 representative of the obtained amount of information. The controller 1 1 1 may control the encoding unit 1 14 so that there is no overflow at the transmitter buffer 1 15.
[0051] The decoding system 140 includes an input interface 170, a receiver buffer 150, a controller 153, a frame memory 152, a decoding unit 151 and an output interface 175. The receiver buffer 150 of the decoding system 140 may temporarily store the compressed bitstream 105 including the received video compression data and video packets based on the source pictures from the source pictures 120. The decoding system 140 may read the control information and presentation time stamp information associated with video packets in the received data and output a frame number signal 163 which is applied to the controller 153. The controller 153 may supervise the counted number of frames at a predetermined interval, for instance, each time the decoding unit 151 completes a decoding operation.
[0052] When the frame number signal 163 indicates the receiver buffer 150 is at a predetermined capacity, the controller 153 may output a decoding start signal 164 to the decoding unit 151 . When the frame number signal 163 indicates the receiver buffer 150 is at less than a predetermined capacity, the controller 153 may wait for the occurrence of a situation in which the counted number of frames becomes equal to the predetermined amount. When the frame number signal 163 indicates the receiver buffer 150 is at the predetermined capacity, the controller 153 may output the decoding start signal 164. The encoded video packets and video compression data may be decoded in a monotonic order (i.e., increasing or decreasing) based on presentation time stamps associated with the encoded video packets. [0053] In response to the decoding start signal 164, the decoding unit 151 may decode data amounting to one picture associated with a frame and compressed video data associated with the picture associated with video packets from the receiver buffer 150. The decoding unit 151 may write a decoded video signal 162 into the frame memory 152. The frame memory 152 may have a first area into which the decoded video signal is written, and a second area used for reading out decoded pictures 160 to the output interface 175.
[0054] According to different examples, the coding system 1 10 may be incorporated or otherwise associated with a transcoder or an encoding apparatus at a headend and the decoding system 140 may be incorporated or otherwise associated with a downstream device, such as a mobile device, a set top box or a transcoder. These may be utilized separately or together in methods of coding and/or decoding utilizing adaptive context model selection with zigzag scan in processing transform units. Various manners in which the coding system 1 10 and the decoding system 140 may be implemented are described in greater detail below with respect to FIGs 5, 6 and 7, which depict flow diagrams of methods 500, 600 and 700.
[0055] Method 500 is a method for preparing a coded significance map utilizing adaptive context model selection with zigzag scan. Method 600 is a method for coding utilizing coding units and coded significance maps prepared utilizing transform units processed using adaptive context model selection with zigzag scan. Method 700 is a method for decoding utilizing compression data generated utilizing coding units and coded significance maps prepared utilizing transform units processed using adaptive context model selection with zigzag scan. It is apparent to those of ordinary skill in the art that the methods 500, 600 and 700 represent generalized illustrations and that other steps may be added and existing steps may be removed, modified or rearranged without departing from the scope of the methods 500, 600 and 700. The descriptions of the methods 500, 600 and 700 are made with particular reference to the coding system 1 10 and the decoding system 140 depicted in FIG 1 . It should, however, be understood that the methods 500, 600 and 700 may be implemented in systems and/or devices which differ from the coding system 1 10 and the decoding system 140 without departing from the scope of the methods 500, 600 and 700.
[0056] With reference to the method 500 in FIG 5, at step 501 , the controller 1 1 1 associated with the coding system 1 10 partitioning the source pictures into coding units, such by a quad tree format.
[0057] At step 502, the controller 1 1 1 , generates transform units, including at least one transform unit having a transform array, including transform elements assigned as entries to y-x locations of the transform array, based on residual measures associated with the coding units. The transform units may be generated following a prediction process also used in generating the video compression data. [0058] At step 503, the controller 1 1 1 processes the generated transform units by generating a significance map having a significance map array with y-x locations corresponding to the y-x locations in the transform array. Step 503 may be subdivided into steps 503A-503B as shown below.
[0059] At step 503A, the controller 1 1 1 and the encoding unit 1 14 scan, utilizing a zigzag scanning pattern, a plurality of significance map elements in the significance map array.
[0060] At step 503B, the controller 1 1 1 determines a context model for coding a significance map element of the plurality of significance map elements based on a value associated with at least one neighbor significance map element of the significance map element in the significance map.
[0061] At step 503C, the controller 1 1 1 and the encoding unit 1 14 codes the significance map element utilizing the determined context model to form a coded significance map element of the significance map. This coding process may be an entropy coding process to reduce the y-x array of the significance map to a simpler matrix.
[0062] With reference to the method 600 in FIG. 6, at step 601 , the interface 130 and the frame memory 1 13 of the coding system 1 10 receives the source pictures 120 including source pictures.
[0063] At step 602, the controller 1 1 1 prepares coding units and transform units including transform units based on the source pictures. The preparing may be performed as described above with respect to method 500.
[0064] At step 603, the controller 1 1 1 and the encoding unit 1 14 process the prepared transform units generating video compression data based on the coding units.
[0065] At step 604, the controller 1 1 1 and the encoding unit 1 14 package the generated video compression data.
[0066] At step 605, the controller 1 1 1 and the transmitter buffer 1 15 transmit the packaged video compression data in compressed bitstream 105 via the interface 135.
[0067] With reference to the method 700 in FIG. 7, at step 701 , the decoding system 140 receives the compressed bitstream 105 including the video compression data via the interface 170 and the receiver buffer 150. [0068] At step 702, the decoding system 140 receives residual pictures associated with the video compression data via the interface 170 and the receiver buffer 150.
[0069] At step 703, the decoding unit 151 and the controller 153 process the received video compression data. [0070] At step 704, the decoding unit 151 and the controller 153 generate reconstructed pictures based on the processed video compression data and the received residual pictures. [0071] At step 705, the decoding unit 151 and the controller 153 package the generated reconstructed pictures and signal them to the frame memory 152.
[0072] At step 706, the controller 153 signals the generated reconstructed pictures in the decoded signal 180 via the interface 175. [0073] Some or all of the methods and operations described above may be provided as machine readable instructions, such as a utility, a computer program, etc., stored on a computer readable storage medium, which may be non-transitory such as hardware storage devices or other types of storage devices. For example, they may exist as program(s) comprised of program instructions in source code, object code, executable code or other formats.
[0074] An example of a computer readable storage media includes a conventional computer system RAM, ROM, EPROM, EEPROM, and magnetic or optical disks or tapes. Concrete examples of the foregoing include distribution of the programs on a CD ROM. It is therefore to be understood that any electronic device capable of executing the above-described functions may perform those functions enumerated above.
[0075] Referring to FIG. 8, there is shown a platform 800, which may be employed as a computing device in a system for coding or decoding utilizing adaptive context model selection with zigzag scan, such as coding system 100 and/or decoding system 200. The platform 800 may also be used for an upstream encoding apparatus, a transcoder, or a downstream device such as a set top box, a handset, a mobile phone or other mobile device, a transcoder and other devices and apparatuses which may utilize adaptive context model selection with zigzag scan and associated coding units and transform units processed using adaptive context model selection with zigzag scan. It is understood that the illustration of the platform 800 is a generalized illustration and that the platform 800 may include additional components and that some of the components described may be removed and/or modified without departing from a scope of the platform 800.
[0076] The platform 800 includes processor(s) 801 , such as a central processing unit; a display 802, such as a monitor; an interface 803, such as a simple input interface and/or a network interface to a Local Area Network (LAN), a wireless 802.1 1 x LAN, a 3G or 4G mobile WAN or a WiMax WAN; and a computer-readable medium 804. Each of these components may be operatively coupled to a bus 808. For example, the bus 808 may be an EISA, a PCI, a USB, a FireWire, a NuBus, or a PDS.
[0077] A computer readable medium (CRM), such as CRM 804 may be any suitable medium which participates in providing instructions to the processor(s) 801 for execution. For example, the CRM 804 may be non-volatile media, such as an optical or a magnetic disk; volatile media, such as memory; and transmission media, such as coaxial cables, copper wire, and fiber optics.
Transmission media can also take the form of acoustic, light, or radio frequency waves. The CRM 804 may also store other instructions or instruction sets, including word processors, browsers, email, instant messaging, media players, and telephony code.
[0078] The CRM 804 may also store an operating system 805, such as MAC OS, MS WINDOWS, UNIX, or LINUX; applications 806, network applications, word processors, spreadsheet applications, browsers, email, instant messaging, media players such as games or mobile applications (e.g., "apps"); and a data structure managing application 807. The operating system 805 may be multi-user, multiprocessing, multitasking, multithreading, real-time and the like. The operating system 805 may also perform basic tasks such as recognizing input from the interface 803, including from input devices, such as a keyboard or a keypad; sending output to the display 802 and keeping track of files and directories on CRM 804; controlling peripheral devices, such as disk drives, printers, image capture devices; and managing traffic on the bus 808. The applications 806 may include various components for establishing and maintaining network connections, such as code or instructions for implementing communication protocols including TCP/IP, HTTP, Ethernet, USB, and FireWire.
[0079] A data structure managing application, such as data structure managing application 807 provides various code components for building/updating a computer readable system (CRS) architecture, for a nonvolatile memory, as described above. In certain examples, some or all of the processes performed by the data structure managing application 807 may be integrated into the operating system 805. In certain examples, the processes may be at least partially implemented in digital electronic circuitry, in computer hardware, firmware, code, instruction sets, or any combination thereof.
[0080] According to principles of the invention, there are systems, methods, and computer readable mediums (CRMs) which provide for coding and decoding utilizing adaptive context model selection with zigzag scan. By utilizing adaptive context model selection with zigzag scan, inefficiencies in transform processing are reduced. These include inefficiencies based on overhead otherwise associated with computational complexities including tracking the count of coded significant transform coefficients located in the bottom-left half or in the top-right half of a transform, performing branch operations and making scan selections for coefficients in significance map coding and decoding.
Although described specifically throughout the entirety of the instant disclosure, representative examples have utility over a wide range of applications, and the above discussion is not intended and should not be construed to be limiting. The terms, descriptions and figures used herein are set forth by way of illustration only and are not meant as limitations. Those skilled in the art recognize that many variations are possible within the spirit and scope of the examples. While the examples have been described with reference to examples, those skilled in the art are able to make various modifications to the described examples without departing from the scope of the examples as described in the following claims, and their equivalents.

Claims

What is claimed is:
1 . A system for coding, the system comprising:
a processor configured to prepare video compression data based on source pictures, the preparing including
partitioning the source pictures into coding units,
generating at least one transform unit having a transform array including transform coefficients assigned as entries to y-x locations of the transform array, based on residual measures associated with the coding units, and
processing the generated transform unit, the processing including generating a significance map, having a significance map array with y-x locations corresponding to the y-x locations of the transform array, scanning, utilizing a zigzag scanning pattern, a plurality of significance map elements in the significance map array, and
determining, utilizing the zigzag scanning pattern, a context model for coding a significance map element of the plurality of significance map elements based on a value associated with at least one coded neighbor significance map element of the significance map element in the significance map array.
2. The system of claim 1 , wherein a significance map element having a y-x location of one of (0, 0), (0, 1 ) and (1 , 0) in the significance map is coded utilizing a predetermined context model.
3. The system of claim 1 , wherein a significance map element having a y-x location of (0, x>1 ) in the significance map array is coded utilizing a selected context model determined by a value associated with at least one neighbor significance map element having a y-x location in the significance map array of (0, x-1 ), (0,x-2), (1 , x-2) and, if x is an even number, (1 , x-1 ).
4. The system of claim 1 , wherein a significance map element having a y-x location of (y>1 , 0) in the significance map array is coded utilizing a selected context model determined by a value associated with at least one neighbor significance map element having a y-x location in the significance map array of (y-1 , 0), (y-2, 0), (y-2, 1 ) and, if y is an odd number, (y-1 , 1 ).
5. The system of claim 1 , wherein a significance map element having a y-x location of (y>0, x>0) in the significance map array is coded utilizing a selected context model determined by a value associated with at least one neighbor significance map element having a y-x location in the significance map array of (y-1 , x-1 ), (y-1 , x), (y, x-1 ),
if x is larger than 1 , (y-1 , x-2) and (y, x-2),
if x is larger than 1 and y is smaller than one less than a height of the significance map array, (y+1 , x-2),
if y is larger than 1 , (y-2, x-1 ) and (y-2, x),
if y is larger than 1 and x is smaller than one less than a width of the significance map array, (y-2, x+1 )
if the sum of x and y is an odd number and x is smaller than one less than a width of the significance map array, (y-1 , x+1 ), and
if the sum of x and y is an even number and y is smaller than one less than a height of the significance map array, (y+1 , x-1 ).
6. The system of claim 1 , wherein the processing of the generated transform unit includes coding the significance map element utilizing the determined context model.
7. The system of claim 1 , wherein residual measures associated with the coding units are generated based on a prediction process performed on prediction units based on the coding units.
8. The system of claim 1 , wherein the significance map is associated with a significance map array size of one of 8x8, 16x16, 32x32, 64x64, 128x128 and 256x256 entries.
9. A method for coding, the method comprising
preparing video compression data based on source pictures utilizing a processor, the preparing including
partitioning the source pictures into coding units,
generating at least one transform unit having a transform array including transform coefficients assigned as entries to y-x locations of the transform array, based on residual measures associated with the coding units, and
processing the generated transform unit, the processing including generating a significance map, having a significance map array with y-x locations corresponding to the y-x locations of the transform array, scanning, utilizing a zigzag scanning pattern, a plurality of significance map elements in the significance map array, and
determining, utilizing the zigzag scanning pattern, a context model for coding a significance map element of the plurality of significance map elements based on a value associated with at least one coded neighbor significance map element of the significance map element in the significance map array.
10. A non-transitory computer readable medium storing computer readable instructions that when executed by a computer system perform a method for coding, the method comprising:
preparing video compression data based on source pictures utilizing a processor, the preparing including
partitioning the source pictures into coding units, generating at least one transform unit having a transform array including transform coefficients assigned as entries to y-x locations of the transform array, based on residual measures associated with the coding units, and
processing the generated transform unit, the processing including generating a significance map, having a significance map array with y-x locations corresponding to the y-x locations of the transform array, scanning, utilizing a zigzag scanning pattern, a plurality of significance map elements in the significance map array, and
determining, utilizing the zigzag scanning pattern, a context model for coding a significance map element of the plurality of significance map elements based on a value associated with at least one coded neighbor significance map element of the significance map element in the significance map array.
1 1 . A system for decoding, the system comprising:
an interface configured to receive video compression data; and
a processor configured to process the received video compression data, wherein the received video compression data is based on processed transform units, based on source pictures, and the processed transform units are prepared by steps including
partitioning the source pictures into coding units,
generating at least one transform unit having a transform array including transform coefficients assigned as entries to y-x locations of the transform array, based on residual measures associated with the coding units, and
processing the generated transform unit, the processing including generating a significance map, having a significance map array with y-x locations corresponding to the y-x locations of the transform array, scanning, utilizing a zigzag scanning pattern, a plurality of significance map elements in the significance map array, and
determining, utilizing the zigzag scanning pattern, a context model for coding a significance map element of the plurality of significance map elements based on a value associated with at least one coded neighbor significance map element of the significance map element in the significance map array.
12. The system of claim 1 1 , wherein a significance map element having a y-x location of one of (0, 0), (0, 1 ) and (1 , 0) in the significance map is coded utilizing a predetermined context model.
13. The system of claim 1 1 , wherein a significance map element having a y-x location of (0, x>1 ) in the significance map array is coded utilizing a selected context model determined by a value associated with at least one neighbor significance map element having a y-x location in the significance map array of (0, x-1 ), (0,x-2), (1 , x-2) and, if x is an even number, (1 , x-1 ).
14. The system of claim 1 1 , wherein a significance map element having a y-x location of (y>1 , 0) in the significance map array is coded utilizing a selected context model determined by a value associated with at least one neighbor significance map element having a y-x location in the significance map array of (y-1 , 0), (y-2, 0), (y-2, 1 ) and, if y is an odd number, (y-1 , 1 ).
15. The system of claim 1 1 , wherein a significance map element having a y-x location of (y>0, x>0) in the significance map array is coded utilizing a selected context model determined by a value associated with at least one neighbor significance map element having a y-x location in the significance map array of (y-1 , x-1 ), (y-1 , x), (y, x-1 ),
if x is larger than 1 , (y-1 , x-2) and (y, x-2), if x is larger than 1 and y is smaller than one less than a height of the significance map array, (y+1 , x-2),
if y is larger than 1 , (y-2, x-1 ) and (y-2, x),
if y is larger than 1 and x is smaller than one less than a width of the significance map array, (y-2, x+1 )
if the sum of x and y is an odd number and x is smaller than one less than a width of the significance map array, (y-1 , x+1 ), and
if the sum of x and y is an even number and y is smaller than one less than a height of the significance map array, (y+1 , x-1 ).
16. The system of claim 1 1 , wherein the processing of the generated transform unit includes coding the significance map element utilizing the determined context model.
17. The system of claim 1 1 , wherein residual measures associated with coding units are generated based on a prediction process performed on prediction units based on the coding units.
18. The system of claim 1 1 , wherein the significance map is associated with a significance map array size of one of 8x8, 16x16, 32x32, 64x64, 128x128 and
256x256 entries.
19. A method for decoding, the method comprising:
receiving video compression data; and
processing the received video compression data, utilizing a processor, wherein the received video compression data is based on processed transform units, based on source pictures, and the processed transform units are prepared by steps including
partitioning the source pictures into coding units, generating at least one transform unit having a transform array including transform coefficients assigned as entries to y-x locations of the transform array, based on residual measures associated with the coding units, and
processing the generated transform unit, the processing including generating a significance map, having a significance map array with y-x locations corresponding to the y-x locations of the transform array, scanning, utilizing a zigzag scanning pattern, a plurality of significance map elements in the significance map array, and
determining, utilizing the zigzag scanning pattern, a context model for coding a significance map element of the plurality of significance map elements based on a value associated with at least one coded neighbor significance map element of the significance map element in the significance map array.
20. A non-transitory computer readable medium storing computer readable instructions that when executed by a computer system perform a method for decoding, the method comprising:
receiving video compression data; and
processing the received video compression data, utilizing a processor, wherein the received video compression data is based on processed transform units, based on source pictures, and the processed transform units are prepared by steps including
partitioning the source pictures into coding units,
generating at least one transform unit having a transform array including transform coefficients assigned as entries to y-x locations of the transform array, based on residual measures associated with the coding units, and
processing the generated transform unit, the processing including generating a significance map, having a significance map array with y-x locations corresponding to the y-x locations of the transform array, scanning, utilizing a zigzag scanning pattern, a plurality of significance map elements in the significance map array, and
determining, utilizing the zigzag scanning pattern, a context model for coding a significance map element of the plurality of significance map elements based on a value associated with at least one coded neighbor significance map element of the significance map element in the significance map array.
EP11779258.0A2010-10-052011-10-05Coding and decoding utilizing adaptive context model selection with zigzag scanCeasedEP2606648A1 (en)

Applications Claiming Priority (3)

Application NumberPriority DateFiling DateTitle
US38993210P2010-10-052010-10-05
US13/253,385US9172967B2 (en)2010-10-052011-10-05Coding and decoding utilizing adaptive context model selection with zigzag scan
PCT/US2011/054999WO2012048055A1 (en)2010-10-052011-10-05Coding and decoding utilizing adaptive context model selection with zigzag scan

Publications (1)

Publication NumberPublication Date
EP2606648A1true EP2606648A1 (en)2013-06-26

Family

ID=45889823

Family Applications (1)

Application NumberTitlePriority DateFiling Date
EP11779258.0ACeasedEP2606648A1 (en)2010-10-052011-10-05Coding and decoding utilizing adaptive context model selection with zigzag scan

Country Status (6)

CountryLink
US (1)US9172967B2 (en)
EP (1)EP2606648A1 (en)
KR (1)KR20130054408A (en)
CA (1)CA2810899C (en)
MX (1)MX2013003557A (en)
WO (1)WO2012048055A1 (en)

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
US8599932B2 (en)2009-12-182013-12-03General Instrument CorporationCarriage systems encoding or decoding JPEG 2000 video
CN107071460B (en)*2010-12-142020-03-06M&K控股株式会社 Equipment for encoding moving pictures
US9398300B2 (en)2011-10-072016-07-19Texas Instruments IncorporatedMethod, system and apparatus for intra-prediction in video signal processing using combinable blocks
US8891630B2 (en)*2011-10-242014-11-18Blackberry LimitedSignificance map encoding and decoding using partition set based context assignment
US9924162B2 (en)*2012-01-192018-03-20Sun Patent TrustImage decoding method including switching a decoding order to either a fixed processing order or an adaptive processing order
US9106918B2 (en)2012-01-202015-08-11Sony CorporationCoefficient coding harmonization in HEVC
WO2017082698A1 (en)*2015-11-112017-05-18삼성전자 주식회사Method and apparatus for decoding video, and method and apparatus for encoding video
US10405003B2 (en)2017-01-202019-09-03Google LlcImage compression based on semantic relevance
US10797723B2 (en)2017-03-142020-10-06International Business Machines CorporationBuilding a context model ensemble in a context mixing compressor

Family Cites Families (95)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
JPS60186179A (en)1984-03-061985-09-21Nec CorpSystem and device for predictive coding of picture signal
JP2743434B2 (en)1989-02-171998-04-22日本ビクター株式会社 Motion compensated interframe predictive coding circuit
JPH02272970A (en)1989-04-141990-11-07Sony CorpData processing circuit
US5150209A (en)1990-05-111992-09-22Picturetel CorporationHierarchical entropy coded lattice threshold quantization encoding method and apparatus for image and video compression
US5260783A (en)1991-02-211993-11-09Gte Laboratories IncorporatedLayered DCT video coder for packet switched ATM networks
US5461423A (en)1992-05-291995-10-24Sony CorporationApparatus for generating a motion vector with half-pixel precision for use in compressing a digital motion picture signal
KR970009408B1 (en)1994-01-181997-06-13대우전자 주식회사 Inter / Intra Table Selection Circuit
KR100213018B1 (en)1994-07-301999-08-02윤종용 Video encoding device
US5708473A (en)1994-08-301998-01-13Hughes Aircraft CompanyTwo stage video film compression method and system
KR0178198B1 (en)1995-03-281999-05-01배순훈Apparatus for encoding an image signal
US5936673A (en)1995-05-261999-08-10Intel CorporationTemporal tile staggering for block based video compression
KR0153671B1 (en)1995-06-301998-11-16배순훈 Rate controllers for high definition television encoders
WO1997003516A1 (en)1995-07-111997-01-30Telefonaktiebolaget Lm Ericsson (Publ)Video coding
CA2180189C (en)1995-08-032001-07-03Satoru AdachiVariable length coded data transmission device
GB9519923D0 (en)1995-09-291995-11-29Philips Electronics NvMotion estimation for predictive image coding
KR0130916Y1 (en)1996-01-061998-12-15성기웅 Drainage cover
JP3157101B2 (en)1996-03-082001-04-16沖電気工業株式会社 Image encoding method and image encoding device
CN1126268C (en)1996-03-152003-10-29皇家菲利浦电子有限公司Method of and device for coding digital information signal
DE19721728C2 (en)1997-05-242001-07-12Byk Chemie Gmbh Dispersants for pigments or fillers based on acrylic acid alkyl ester polymers, use and process for producing them
JP3381827B2 (en)1997-06-042003-03-04富士ゼロックス株式会社 Color image encoding device and color image decoding device
SE512291C2 (en)1997-09-232000-02-28Ericsson Telefon Ab L M Embedded DCT-based still image coding algorithm
US6501860B1 (en)1998-01-192002-12-31Canon Kabushiki KaishaDigital signal coding and decoding based on subbands
JP3856262B2 (en)1998-03-092006-12-13日本ビクター株式会社 Motion compensation encoding apparatus, motion compensation encoding method, and motion compensation code recording medium
JPH11289544A (en)1998-04-021999-10-19Sony CorpMotion detector and its method
US6314208B1 (en)1998-07-212001-11-06Hewlett-Packard CompanySystem for variable quantization in JPEG for compound documents
WO2000031878A1 (en)1998-11-202000-06-02Interval Research CorporationLow cost video compression using fast, modified z-coding of wavelet pyramids
US6418166B1 (en)1998-11-302002-07-09Microsoft CorporationMotion estimation and block matching pattern
EP1035735A3 (en)1999-03-122007-09-05Kabushiki Kaisha ToshibaMoving image coding and decoding apparatus optimised for the application of the Real Time Protocol (RTP)
JP3302939B2 (en)1999-03-122002-07-15アールシーエー トムソン ライセンシング コーポレイシヨン Video signal decompressor for independently compressed even and odd field data
WO2001010135A1 (en)1999-07-292001-02-08Mitsubishi Denki Kabushiki KaishaMoving vector detecting method
US6671319B1 (en)1999-12-282003-12-30Sony CorporationMethods and apparatus for motion estimation using neighboring macroblocks
KR100750092B1 (en)2000-01-282007-08-21삼성전자주식회사 Variable length coding method and apparatus
US6661925B1 (en)2000-03-222003-12-09Board Of Supervisors Of Louisiana State University & Agricultural & Mechanical CollegeFunctional set compression
US6522784B1 (en)2000-04-112003-02-18International Business Machines CorporationEnhanced compression of gray-level images
KR100856398B1 (en)2000-05-172008-09-04삼성전자주식회사 Variable length coding and decoding method using multiple mapping tables and apparatus therefor
KR100708091B1 (en)2000-06-132007-04-16삼성전자주식회사 Apparatus and method for frame rate conversion using bidirectional motion vector
FI120125B (en)2000-08-212009-06-30Nokia Corp Image Coding
US9143546B2 (en)2000-10-032015-09-22Realtime Data LlcSystem and method for data feed acceleration and encryption
JP2004512785A (en)*2000-10-242004-04-22アイボール ネットワークス インコーポレイテッド Scalable video compression based on DCT
TWI241536B (en)2001-03-072005-10-11Pts CorpMethod and apparatus for estimating motion of image region
US7483581B2 (en)2001-07-022009-01-27Qualcomm IncorporatedApparatus and method for encoding digital image data in a lossless manner
US6856701B2 (en)2001-09-142005-02-15Nokia CorporationMethod and system for context-based adaptive binary arithmetic coding
KR100642043B1 (en)2001-09-142006-11-03가부시키가이샤 엔티티 도코모 Coding method, decoding method, coding device, decoding device, image processing system, and storage medium
DE10204617B4 (en)2002-02-052005-02-03Siemens Ag Methods and apparatus for compressing and decompressing a video data stream
US7116831B2 (en)2002-04-102006-10-03Microsoft CorporationChrominance motion vector rounding
JP3807342B2 (en)2002-04-252006-08-09三菱電機株式会社 Digital signal encoding apparatus, digital signal decoding apparatus, digital signal arithmetic encoding method, and digital signal arithmetic decoding method
EP2367358A1 (en)2002-04-262011-09-21NTT DoCoMo, Inc.Image encoding apparatus, image decoding apparatus, image encoding method, image decoding method, image encoding program, and image decoding program
US6907079B2 (en)2002-05-012005-06-14Thomson Licensing S.A.Deblocking filter conditioned on pixel brightness
EP1500281A2 (en)2002-05-022005-01-26Fraunhofer-Gesellschaft Zur Förderung Der Angewandten Forschung E.V.Method and arrangement for encoding transformation coefficients in image and/or video encoders and decoders, corresponding computer program, and corresponding computer-readable storage medium
US7469012B2 (en)2002-05-142008-12-23Broadcom CorporationSystem and method for transcoding entropy-coded bitstreams
JP2004015501A (en)2002-06-072004-01-15Nec CorpApparatus and method for encoding moving picture
KR100865034B1 (en)2002-07-182008-10-23엘지전자 주식회사Method for predicting motion vector
US7336720B2 (en)2002-09-272008-02-26Vanguard Software Solutions, Inc.Real-time video coding/decoding
US20040120398A1 (en)2002-12-192004-06-24Ximin ZhangSystem and method for adaptive field and frame video encoding using rate-distortion characteristics
US20040131117A1 (en)2003-01-072004-07-08Sheraizin Vitaly S.Method and apparatus for improving MPEG picture compression
US7373005B2 (en)2003-04-102008-05-13Micron Technology, Inc.Compression system for integrated sensor devices
US8824553B2 (en)2003-05-122014-09-02Google Inc.Video compression method
JP4419458B2 (en)2003-07-142010-02-24リコープリンティングシステムズ株式会社 Inkjet head manufacturing method
US7379608B2 (en)*2003-12-042008-05-27Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung, E.V.Arithmetic coding for transforming video and picture data units
US20050201470A1 (en)2004-03-122005-09-15John SieversIntra block walk around refresh for H.264
JP2006060813A (en)2004-08-202006-03-02Polycom Inc Error concealment in video decoders.
US20060078049A1 (en)*2004-10-132006-04-13Nokia CorporationMethod and system for entropy coding/decoding of a video bit stream for fine granularity scalability
US7620103B2 (en)2004-12-102009-11-17Lsi CorporationProgrammable quantization dead zone and threshold for standard-based H.264 and/or VC1 video encoding
NO322043B1 (en)2004-12-302006-08-07Tandberg Telecom As Procedure for simplified entropy coding
US8311119B2 (en)2004-12-312012-11-13Microsoft CorporationAdaptive coefficient scan order
US7706443B2 (en)2005-03-112010-04-27General Instrument CorporationMethod, article of manufacture, and apparatus for high quality, fast intra coding usable for creating digital video content
EP1768415A1 (en)2005-09-272007-03-28Matsushita Electric Industrial Co., Ltd.Adaptive scan order of DCT coefficients and its signaling
US20070025441A1 (en)2005-07-282007-02-01Nokia CorporationMethod, module, device and system for rate control provision for video encoders capable of variable bit rate encoding
EP1958453B1 (en)2005-11-302017-08-09Koninklijke Philips N.V.Encoding method and apparatus applying coefficient reordering
US20070136742A1 (en)2005-12-132007-06-14General Instrument CorporationMethod, apparatus and system for replacing advertisements in recorded video content
US8315308B2 (en)*2006-01-112012-11-20Qualcomm IncorporatedVideo coding with fine granularity spatial scalability
EP1982518A4 (en)2006-01-122010-06-16Lg Electronics IncProcessing multiview video
US20100290568A1 (en)2006-03-312010-11-18Hajime SuzukiDecoding frequency channelised signals
US8254700B1 (en)2006-10-032012-08-28Adobe Systems IncorporatedOptimized method and system for entropy coding
JP4717780B2 (en)2006-11-012011-07-06キヤノン株式会社 Encoding apparatus and control method thereof
JP5026092B2 (en)2007-01-122012-09-12三菱電機株式会社 Moving picture decoding apparatus and moving picture decoding method
US7949195B2 (en)2007-01-162011-05-24Cisco Technology, Inc.Per block breakpoint determining for hybrid variable length coding
KR101356733B1 (en)*2007-03-072014-02-05삼성전자주식회사Method and apparatus for Context Adaptive Binary Arithmetic Coding and decoding
DE102007020292A1 (en)2007-04-302008-11-13Siemens Ag Method for compressing data using run-length coding, in particular for medical image data
KR101539240B1 (en)2007-06-142015-07-30삼성전자주식회사Method and apparatus for encoding and decoding image data
US8571104B2 (en)2007-06-152013-10-29Qualcomm, IncorporatedAdaptive coefficient scanning in video coding
US8331444B2 (en)2007-06-262012-12-11Qualcomm IncorporatedSub-band scanning techniques for entropy coding of sub-bands
US8401083B2 (en)2007-09-182013-03-19Ubiquity Holdings, IncExtreme video compression over a fixed bandwidth channel
US8265162B2 (en)2007-10-012012-09-11Cisco Technology, Inc.Context adaptive position and amplitude coding of coefficients for video compression
US8891615B2 (en)2008-01-082014-11-18Qualcomm IncorporatedQuantization based on rate-distortion modeling for CABAC coders
KR101291196B1 (en)2008-01-252013-07-31삼성전자주식회사Video encoding method and apparatus, and video decoding method and apparatus
US20100098169A1 (en)2008-10-162010-04-22Texas Instruments IncorporatedMethod and apparatus for motion estimation using compressed reference frame
US7932843B2 (en)2008-10-172011-04-26Texas Instruments IncorporatedParallel CABAC decoding for video decompression
KR101783061B1 (en)2009-08-212017-09-28톰슨 라이센싱Methods and apparatus for explicit updates for symbol probabilities of an entropy encoder or decoder
US8340448B2 (en)2009-10-062012-12-25Cisco Technology, Inc.Locally variable quantization and hybrid variable length coding for image and video compression
US8344917B2 (en)2010-09-302013-01-01Sharp Laboratories Of America, Inc.Methods and systems for context initialization in video coding and decoding
RU2010140334A (en)2010-10-012012-04-10ЭлЭсАй Корпорейшн (US) IN-FRAME MODE PREDICTION FOR VIDEO TRANSCODER
US8891617B2 (en)2011-01-182014-11-18Google Inc.Method and system for processing video data
US8953690B2 (en)2011-02-162015-02-10Google Technology Holdings LLCMethod and system for processing video data
US8938001B1 (en)2011-04-052015-01-20Google Inc.Apparatus and method for coding using combinations

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
DETLEV MARPE ET AL: "Context-based adaptive binary arithmetic coding in the H.264/AVC video compression standard", 21 May 2003 (2003-05-21), XP055382532, Retrieved from the Internet <URL:http://iphome.hhi.de/wiegand/assets/pdfs/csvt_cabac_0305.pdf> [retrieved on 20170619]*
See also references ofWO2012048055A1*
SZE V ET AL: "TE12: Evaluation of transform coefficient coding (HHI_TRANSFORM_CODING) with tool breakdown", 3. JCT-VC MEETING; 94. MPEG MEETING; 7-10-2010 - 15-10-2010; GUANGZHOU; (JOINT COLLABORATIVE TEAM ON VIDEO CODING OF ISO/IEC JTC1/SC29/WG11 AND ITU-T SG.16 ); URL: HTTP://WFTP3.ITU.INT/AV-ARCH/JCTVC-SITE/,, no. JCTVC-C059, 2 October 2010 (2010-10-02), XP030007766*

Also Published As

Publication numberPublication date
CA2810899C (en)2016-08-09
WO2012048055A1 (en)2012-04-12
US9172967B2 (en)2015-10-27
KR20130054408A (en)2013-05-24
CA2810899A1 (en)2012-04-12
MX2013003557A (en)2013-05-01
US20120082234A1 (en)2012-04-05

Similar Documents

PublicationPublication DateTitle
US20120082235A1 (en)Coding and decoding utilizing context model selection with adaptive scan pattern
CA2810899C (en)Coding and decoding utilizing adaptive context model selection with zigzag scan
US9554141B2 (en)Intra block copy for intra slices in high efficiency video coding (HEVC)
JP7247216B2 (en) Image processing method and apparatus therefor
JP5718363B2 (en) Video encoding / decoding method and apparatus using large size transform unit
US10623742B2 (en)Method of determining binary codewords for transform coefficients
CN111294599B (en)Video decoding method, video encoding method and device
CN110650349B (en)Image encoding method, decoding method, encoder, decoder and storage medium
WO2012134204A2 (en)In-loop filtering method and apparatus for same
CN103748875A (en)Method and device for video coding applying parition-based filters, and storage medium
KR101530758B1 (en)Method and apparatus for intra prediction using adaptive filtering
US11297341B2 (en)Adaptive in-loop filter with multiple feature-based classifications
US11343513B2 (en)Image encoding method and decoding method, encoder, decoder, and storage medium
EP4395312A1 (en)Multimedia data processing method and apparatus, device, computer-readable storage medium and computer program product
KR102767882B1 (en) Method and device for intra prediction
EP2606645A1 (en)Coding and decoding utilizing context model selection with adaptive scan pattern
CN111587575B (en) Method and device for determining scan order of transform coefficients based on high-frequency zeroing
US11595652B2 (en)Explicit signaling of extended long term reference picture retention
RU2808004C2 (en)Method and device for internal prediction based on internal subsegments in image coding system
RU2815810C2 (en)Encoding information on set of transformation kernels
HK40064959B (en)Multimedia data processing method, equipment, device and storage medium
HK40064959A (en)Multimedia data processing method, equipment, device and storage medium
CN103548354A (en)Coding and decoding utilizing adaptive context model selection with zigzag scan
CN116980609A (en)Video data processing method, device, storage medium and equipment
CN120019645A (en)Loop filtering and video encoding and decoding method, device and system based on neural network

Legal Events

DateCodeTitleDescription
PUAIPublic reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text:ORIGINAL CODE: 0009012

17PRequest for examination filed

Effective date:20130321

AKDesignated contracting states

Kind code of ref document:A1

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

RAP1Party data changed (applicant data changed or rights of an application transferred)

Owner name:MOTOROLA MOBILITY LLC

DAXRequest for extension of the european patent (deleted)
17QFirst examination report despatched

Effective date:20150428

RAP1Party data changed (applicant data changed or rights of an application transferred)

Owner name:GOOGLE TECHNOLOGY HOLDINGS LLC

REGReference to a national code

Ref country code:DE

Ref legal event code:R003

STAAInformation on the status of an ep patent application or granted ep patent

Free format text:STATUS: THE APPLICATION HAS BEEN REFUSED

18RApplication refused

Effective date:20180122

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

Effective date:20230524


[8]ページ先頭

©2009-2025 Movatter.jp