Sign In to Follow Application
View All Documents & Correspondence

Video Image Coding Method Video Image Decoding Method Video Image Coding Device Video Image Decoding Device And Video Image Coding Decoding Device

Abstract: With a video image coding method with which processing efficiency is effected: first information among a plurality of types of Sample Adaptive Offset (SAO) information which is employed in SAO which is a process which applies an offset value to a pixel value of a pixel which is included in an image which is generated with coding of an input image is coded by context adaptive binary arithmetic coding in which a variable probability value is employed (S11); second information and third information among the plurality of types of SAO information are coded contiguously by bypass arithmetic coding in which a fixed probability value is employed (S12); and the coded second information and third information is positioned after the coded first information in a bitstream.

Get Free WhatsApp Updates!
Notices, Deadlines & Correspondence

Patent Information

Application #
Filing Date
06 January 2014
Publication Number
39/2014
Publication Type
INA
Invention Field
COMMUNICATION
Status
Email
patent@depenning.com
Parent Application
Patent Number
Legal Status
Grant Date
2021-10-11
Renewal Date

Applicants

PANASONIC CORPORATION
1006 Oaza Kadoma Kadoma shi Osaka 5718501

Inventors

1. SASAI Hisao
C/O PANASONIC CORPORATION 1006, OAZA KADOMA, KADOMA-SHI, OSAKA 571-8501
2. TERADA Kengo
C/O PANASONIC CORPORATION 1006, OAZA KADOMA, KADOMA-SHI, OSAKA 571-8501
3. SHIBAHARA Youji
C/O PANASONIC CORPORATION 1006, OAZA KADOMA, KADOMA-SHI, OSAKA 571-8501
4. TANIKAWA Kyoko
C/O PANASONIC CORPORATION 1006, OAZA KADOMA, KADOMA-SHI, OSAKA 571-8501
5. SUGIO Toshiyasu
C/O PANASONIC CORPORATION 1006, OAZA KADOMA, KADOMA-SHI, OSAKA 571-8501
6. MATSUNOBU Toru
C/O PANASONIC CORPORATION 1006, OAZA KADOMA, KADOMA-SHI, OSAKA 571-8501

Specification

[DESCRIPTION] [Title of Invention] MOVING PICTURE CODING METHOD, MOVING PICTURE DECODING METHOD, MOVING PICTURE CODING APPARATUS, MOVING PICTURE DECODING APPARATUS, AND MOVING PICTURE CODING AND DECODING APPARATUS [Technical Field] [0001] The present invention relates to a moving picture coding method and a moving picture decoding method. [Background Art] [0002] The High Efficiency Video Coding (HEVC) standard, a next-generation image coding standard, has been examined in various ways to increase its coding efficiency (Non Patent Literature (NPL) 1). In addition, the International Telecommunication Union Telecommunication Standardization sector (ITU-T) standard typified by H.26x, and the ISO/IEC standard typified by MPEG-x exist conventionally. The latest and most advanced image coding standard has been examined as a standard next to a standard currently typified by H.264/AVC or MPEG-4 AVC (see Non Patent Literature (NPL) 2). [0003] In the HEVC standard, coding degradation reduction processing referred to as sample adaptive offset (SAO) has been examined to further reduce coding degradation (a difference between an original signal before coding and a coded and decoded signal). The SAO is offset processing—in which an offset value is added for each of predetermined regions, categories, or types, to reduce the coding degradation, and is performed on a provisionally decoded image (reconstructed image) (see Non Patent Literature. (NPL) 3). [Citation List] [Non Patent Literature] [0004] [NPL 1] Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11 9th Meeting: Geneva, CH, 27 April - 7 May 2012, JCTVC-I1003_dl, "High efficiency video coding (HEVC) text specification draft 7" [NPL 2] ITU-T Recommendation H.264 "Advanced video coding for generic audiovisual services", March, 2010 [NPL 3] Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11 9th Meeting: Geneva, CH, 27 April - 7 May 2012, JCTVC-I0602, "BoG report on integrated text of SAO adoptions on top of JCTVC-I0030" [Summary of Invention] [Technical Problem] [0005] However, a moving picture coding method and a moving picture decoding method using the SAO of NPL 3 cannot make processing efficient. [0006] In view of this, one non-limiting and exemplary embodiment provides a moving picture coding method and a moving picture decoding method that can make processing efficient. [Solution to Problem] [0007] A moving picture coding method according to an aspect of the present invention is a moving picture coding method for coding an input image to generate a bit stream, the method including: performing context adaptive binary arithmetic coding in which a variable probability value is used, on first information among multiple types of sample adaptive offset (SAO) information used for SAO that is a process of assigning an offset value to a pixel value of a pixel included in an image generated by coding the input image; and continuously performing bypass arithmetic coding in which a fixed probability value is used, on second information and third information among the multiple types of the SAO information, wherein the coded second and third information are placed after the coded first information in the bit stream. [0008] These general and specific aspects may be implemented using a system, a method, an integrated circuit, a computer program, or a computer-readable recording medium such as a CD-ROM, or any combination of systems, methods, integrated circuits, computer programs, or computer-readable recording media. [Advantageous Effects of Invention] [0009] A moving picture coding method and a moving picture decoding method in the present invention can make processing efficient. [Brief Description of Drawings] [0010] [FIG. 1A] FIG. 1A is a table showing information used for offset processing referred to as SAO. [FIG. IB] FIG. IB is a table showing other information used for offset processing referred to as SAO. [FIG. 1C] FIG. 1C is a table showing other information used for offset processing referred to as SAO. [FIG. ID] FIG. ID is a table showing other information used for offset processing referred to as SAO. [FIG. 2] FIG. 2 is a block diagram showing a functional configuration of a SAO information decoding unit. [FIG. 3] FIG. 3 is a flow chart showing an operation flow of the SAO information decoding unit. [FIG. 4] FIG. 4 is a flow chart showing context adaptive binary arithmetic decoding. [FIG. 5] FIG. 5 is a flow chart showing bypass arithmetic decoding. [FIG. 6] FIG. 6 is a flow chart showing a normalization process in an arithmetic decoding method. [FIG. 7] FIG. 7 is a block diagram showing an exemplary configuration of a moving picture decoding apparatus according to Embodiment 1. [FIG. 8] FIG. 8 is a block diagram showing a functional configuration of a SAO information decoding unit according to Embodiment 1. [FIG. 9] FIG. 9 is a flow chart showing arithmetic decoding by the SAO information decoding unit according to Embodiment 1. [FIG. 10A] FIG. 10A is a diagram for illustrating, in Embodiment 1, an exemplary sequence of parameters included in SAO information, and an exemplary decoding order of the parameters. [FIG. 10B] FIG. 10B is a diagram corresponding to the flow chart of FIG. 3 and for illustrating an exemplary sequence of parameters included in SAO information, and an exemplary decoding order of the parameters. [FIG. 10C] FIG. IOC is a diagram for illustrating, in Embodiment 1, another exemplary sequence of parameters included in SAO information, and another exemplary decoding order of the parameters. [FIG. 11] FIG. 11 is a block diagram showing an exemplary configuration of a moving picture decoding apparatus according to Embodiment 2. [FIG. 12] FIG. 12 is a flow chart showing arithmetic coding by a SAO information coding unit according to Embodiment 2. [FIG. 13A] FIG. 13A is a table showing a syntax for generating a conventional bit stream. [FIG. 13B] FIG. 13B is a table showing a syntax for generating a bit stream in Embodiment 2. [FIG. 14] FIG. 14 is a table showing a syntax for generating another bit stream in Embodiment 2. [FIG. 15A] FIG. 15A is a flow chart for a moving picture coding method in an embodiment. [FIG. 15B] FIG. 15B is a block diagram showing a moving picture coding apparatus in an embodiment. [FIG. 15C] FIG. 15C is a flow chart for a moving picture decoding method in an embodiment. [FIG. 15D] FIG. 15D is a block diagram showing a moving picture decoding apparatus in an embodiment. [FIG. 16] FIG. 16 is an overall configuration diagram of a content providing system that provides content distribution services. [FIG. 17] FIG. 17 is an overall configuration diagram of a digital broadcasting system. [FIG. 18] FIG. 18 is a block diagram showing an exemplary configuration of a television. [FIG. 19] FIG. 19 is a block diagram showing an exemplary configuration of an information reproducing/recording unit that reads and writes information from and on a recording medium that is an optical disk. [FIG. 20] FIG. 20 is a diagram showing an exemplary configuration of a recording medium that is an optical disk. [FIG. 21A] FIG. 21A is a diagram showing an exemplary cellular phone. [FIG. 21B] FIG. 21B is a block diagram showing an exemplaryconfiguration of a cellular phone. [FIG. 22] FIG. 22 is a diagram showing a structure of multiplexed data. [FIG. 23] FIG. 23 is a diagram schematically showing how each stream is multiplexed in multiplexed data. [FIG. 24] FIG. 24 is a diagram showing how a video stream is stored in a stream of PES packets in more detail. [FIG. 25] FIG. 25 is a diagram showing a structure of TS packets and source packets in multiplexed data. [FIG. 26] FIG. 26 is a diagram showing a data structure of a PMT. [FIG. 27] FIG. 27 is a diagram showing an internal structure of multiplexed data information. [FIG. 28] FIG. 28 is a diagram showing an internal configuration of stream attribute information. [FIG. 29] FIG. 29 is a flow chart showing steps for identifying video data. [FIG. 30] FIG. 30 is a block diagram showing an exemplary configuration of an integrated circuit that performs the movingpicture coding method and the moving picture decoding method according to each of embodiments. [FIG. 31] FIG. 31 is a diagram showing a configuration for switching between driving frequencies. [FIG. 32] FIG. 32 is a flow chart showing steps for identifying video data and switching between driving frequency. [FIG. 33] FIG. 33 is an exemplary look-up table in which video data standards are associated with driving frequencies. [FIG. 34A] FIG. 34A is a diagram showing an exemplary configuration for sharing a module of a signal processing unit. [FIG. 34B] FIG. 34B is a diagram showing another exemplary configuration for sharing a module of a signal processing unit. [Description of Embodiments] [0011] (Underlying Knowledge Forming Basis of the Present invention) FIGs. 1A to ID are diagrams showing four types of information used for offset processing referred to as SAO. These four types of information (parameters) are SAO type information (sao_type_idx), SAO pixel value band position information (sao_band_position), a SAO offset value (sao_offset[i]), and a SAO offset sign (sao_offset_sign[i]). It is to be noted that these information items are collectively referred to as SAO information. [0012] As shown in FIG. 1A, the SAO type information (sao_type_idx) indicates not performing offset processing or a type of offset processing to be performed. Examples of the offset processing include edge offset in which offset processing is performed on a pattern in an edge direction and band offset in which offset processing is performed on pixel values included in a certain band (range of predetermined pixel values). In addition, the edge offset is further classified into several types depending on edge directions. For instance, in NPL 3, contents indicated by SAO type information are classified into six types as shown in FIG. 1A. Arithmetic coding (context adaptive binary arithmetic coding) is performed on part of the SAO type information using a context corresponding to a variable probability value, and the part of the SAO type information is stored in a bit stream. [0013] The SAO pixel value band position information (sao_band_position) is information used for the band offset. For example, the level band (0 to 255 in the case of 8 bits) of an image signal to be processed is divided into 32 sections. The SAO pixel value band position information indicates from which section the band offset is applied to a section (at least one continuous section) among the 32 sections. For instance, in NPL 3, the number of continuous sections is four. When the SAO pixel value band position information indicates 1 and the image signal has 8 bits, the SAO pixel value band position information indicates that the offset processing is performed on the sections of pixel values 8 to 15, pixel values 16 to 23, pixel values 24 to 31, and pixel values 32 to 39. As shown by "XXXXX" In FIG. IB, the SAO pixel value band position information has a fixed length of 5 bits, is coded by bypass arithmetic coding using not a variable probability value but a fixed probability value, and is stored in a bit stream. [0014] The SAO offset value (sao_offset[i]) indicates the type of the edge offset indicated by the SAO type information or an offset value actually given to the section (the at least one continuous section) indicated by the SAO pixel value band position information. It is to be noted i indicates one of the types or sections. To put it another way, the SAO offset value indicates, for each i, an offset value corresponding to a type of the edge offset or a section of the band offset indicated by the i. For example, in NPL 3, the i takes one of four values from 0 to 3. Stated differently, in the case of an offset value for the edge offset, the SAO offset value indicates, for each edge direction (each of 0. 45, 90, and 135 degrees), a value from 0 to 7 for a corresponding one of four types of patterns (e.g., V type, A type, / type, and \ type) as the offset value. In the case of an offset value for the band offset, the SAO offset value indicates a value from 0 to 7 for a corresponding one of the four sections as the offset value. Then, the arithmetic coding is performed on part of the SAO offset value using the context, and is stored in a bit stream, (refer to FIG. 1C) [0015] The SAO offset sign (sao_offset_sign[i]) indicates the sign of the SAO offset value. It is to be noted that i is the same as the i used for the SAO offset value, and associates a SAO offset value and a SAO offset sign. For instance, in NPL 3, when the SAO type information indicates the edge offset, the SAO sign is not used, and an offset value indicated by the SAO offset value is handled as always being positive. Thus, the SAO offset sign is not described in a bit stream. In contrast, when the SAO type information indicates the band offset, SAO offset signs are used for respective SAO offset values of the four sections. Thus, the SAO offset signs are coded by the bypass arithmetic coding, and are stored in the bit stream, (refer to FIG. ID) [0016] The following describes a conventional example of a method for decoding SAO information (the four types), with reference to FIG. 2 and FIG. 3. [0017] FIG. 2 is a block diagram showing a functional configuration of a SAO information decoding unit. [0018] A SAO information decoding unit A01 performs variable length decoding (arithmetic decoding) on the SAO type information (sao_type_idx), the SAO pixel value band position information (sao_band_position), the SAO offset value (sao_offset[i]), and the SAO offset sign (sao_offset_sign[i]) that are included in the SAO information. [0019] The SAO information decoding unit A01 includes: a Sao_Type decoding unit A02 that decodes SAO type information; a Sao_Type determining unit A03 that determines a type of offset processing or the like indicated by the SAO type information; switches A04, A05, and A06; a Sao_band_position decoding unit A07 that decodes SAO pixel value band position information; a Sao_Offset decoding unit A08 that decodes a SAO offset value; a Sao_offset_sign decoding unit A09 that decodes a SAO offset sign; a data storage position setting unit A10; and a data storage unit All. The SAO information decoding unit A01 restores SAO information from a bit stream BS. [0020] The operation of the SAO information decoding unit A01 is described in details with reference to FIG. 3. [0021] FIG. 3 is a flow chart showing an exemplary operation flow of the SAO information decoding unit A01. [0022] First, the Sao_Type decoding unit A02 of the SAO information decoding unit A01 decodes SAO type information (sao_type_idx) from a bit stream BS (SB01). Next, the Sao_Type determining unit A03 determines whether or not the sao_type_idx indicates band offset in which offset processing is performed on pixel values included in a certain band (range of predetermined pixel values) (SB02). When determining that the band offset is indicated (YES in SB02), the Sao_Type determining unit A03 turns the switch A04 ON. With this, the Sao_band_position decoding unit A07 decodes SAO pixel value band position information (sao_band_position) (SB03). The data storage position setting unit A10 determines a storage position in the data storage unit All based on the decoded SAO pixel value band position information. In contrast, when determining that the band offset is not indicated (NO in SB02), the Sao_Type determining unit A03 turns the switch A04 OFF. Next, the Sao_Type determining unit A03 determines whether or not the sao_type_idx indicates that the offset processing is not to be performed (Sao off) (SB04). Here, when determining that Sao off is indicated (YES in SB04), the Sao_Type determining unit A03 turns the switches A04, A05, and A06 OFF, and terminates decoding of the SAO information. [0023] In contrast, when determining that Sao off is not indicated (NO in SB04), the Sao_Type determining unit A03 turns the switch A05 ON. With this, the Sao_Offset decoding unit A08 decodes a SAO offset value (sao_offset) from the bit stream BS (SB05). It is to be noted that the decoded SAO offset value is stored at the position in the data storage unit All set by the data storage position setting unit A10. Here, the decoding in the step SB05 is continued until a predetermined number of SAO offset values is decoded (during a period of NO in SB06). When all the SAO offset values are decoded (YES in SB06), the Sao_Type determining unit A03 determines whether or not the sao_type_idx indicates the band offset (SB07). When determining that the band offset is indicated (YES in SB07), the Sao_Type determining unit A03 turns the switch A06 ON. [0024] With this, when the decoded SAO offset value is not zero (NO in SB08), the Sao_offset_sign decoding unit A09 decodes a SAO offset sign corresponding to the SAO offset value (SB09). In this case, the SAO offset value in the data storage unit All is updated using the decoded SAO offset sign. When the decoded SAO offset value is zero (YES in SB08), the SAO offset sign has no particular meaning, and thus the Sao_offset_sign decoding unit A09 skips the decoding. Here, the Sao_offset_sign decoding unit A09 continues the decoding until a predetermined number of SAO offset signs corresponding to SAO offset values is decoded (during a period of NO in SB10). When all the SAO offset signs are decoded (YES in SB10), the SAO Information decoding unit A01 terminates the decoding of the SAO information. [0025] It is to be noted that parameters that are information items decoded in steps enclosed by double frame lines in FIG. 3 are parameters decoded by bypass arithmetic decoding in which a variable probability value is not necessary. Parameters that are information items decoded in steps enclosed by regular frame lines are parameters that are information items decoded using a variable probability value that is at least part of each of the parameters, and are dispersed in a bit stream. [0026] The following describes variable length coding such as context adaptive binary arithmetic coding using a variable probability value and bypass arithmetic coding not using a variable probability value. In H.264 or HEVC, the context adaptive binary arithmetic coding (CABAC) is one of variable length coding techniques. The CABAC is described below with reference to FIG. 4, FIG. 5, and FIG. 6. [0027] FIG. 4 is a flow chart showing context adaptive binary arithmetic decoding. It is to be noted that FIG. 4 is excerpted from NPL 2, and is as described in NPL 2, unless otherwise explained. [0028] In the context adaptive binary arithmetic decoding, first, a context (ctxldx) determined based on a signal type is inputted. [0029] Next, the value "qCodlRangeldx" is calculated from the first parameter "codlRange" showing a current state in a arithmetic decoding apparatus, and pStateldx that is a state value corresponding to ctxldx is obtained. codlRangeLPS is obtained by referring to a table (rangeTableLPS) using the two values. It is to be noted that the codlRangeLPS is a parameter showing a state in the arithmetic decoding apparatus when LPS (indicates a symbol having a low occurrence probability among symbols 0 and 1) occurs with respect to the first parameter "codlRange" showing the state in the arithmetic decoding apparatus. [0030] A value obtained by subtracting the codlRangeLPS from current codlRange is put into the codlRange (step SC01). Next, the calculated codlRange is compared to the second parameter "codlOffset" showing a state in the arithmetic decoding apparatus (step SC02). When the codlOffset is greater than or equal to the codlRange (Yes in SC02), it is determined that an LPS symbol has occurred, and a value (when valMPS = 1, 0; and when valMPS = 0, 1) different from valMPS (which is a specific value indicating a symbol having a high occurrence probability among symbols 0 and 1, and indicates 0 or 1) is set to binVal that is a decoded output value. Moreover, a value obtained by subtracting the codlRRangeLPS from the codlRange is set to the second parameter "codlOffset" showing the state in the arithmetic decoding apparatus. Because LPS has occurred, the value of the codlRangeLPS calculated in step SC01 is set to the first parameter "codlRange" showing the state in the arithmetic decoding apparatus (step SC03). It is to be noted that because a case where pStateldx that is a state value corresponding to the ctxldx is 0 (Yes in step SC05) indicates a case where the probability of the LPS is greater than that of MPS, the valMPS is replaced with the different value (when valMPS = 1, 0; and when valMPS = 0, 1) (step SC06). In contrast, when the pStateldx is not 0 (No in step SC05), the pStateldx is updated based on the translation table when the LPS occurs (step SC07). [0031] When the codlOffset is small (No in SC02), it is determined that an the MPS symbol has occurred, the valMPS is set to the binVal, the decoded output value, and the pStateldx is updated based on the translation table "transIdxMPS" when the MPS occurs (step SC04). [0032] Lastly, a normalization process (RenormD) is performed (step SC08), and the context adaptive binary arithmetic decoding is terminated. [0033] As above., in the context adaptive binary arithmetic decoding, because symbol occurrence probabilities (probability values), binary symbol occurrence probabilities, are held in association with context indexes, and are switched according to conditions (e.g., by referring to the value of an adjacent block), it is necessary to maintain a processing order. [0034] FIG. 5 is a flow chart showing bypass arithmetic decoding. It is to be noted that FIG. 5 is excerpted from NPL 2, and is as described in NPL 2, unless otherwise explained. [0035] First, the second parameter "codlOffset" showing the current state in the arithmetic decoding apparatus is shifted to the left (doubled), 1 bit is read from a bit stream, and when the read bit has 1, 1 is further added to the (doubled) value, and when the read bit has 0, the (doubled) value is set (SD01). [0036] Next, when the codlOffset is greater than or equal to the first parameter "codlRange" showing the state in the arithmetic decoding apparatus (Yes in SD02), "1" is set to the binVal, the decoded output value, a value obtained by subtracting the codlRange from the codlOffset is set to the codlOffset (step'SD03). In contrast, when the codlOffset is less than the first parameter "codlRange" showing the state in the arithmetic decoding apparatus (No in SD02), "0" is set to the binVal, the decoded output value (step SD04). [0037] FIG. 6 is a flow chart for illustrating in more detail the normalization process (RenormD) in step SC08 shown in FIG. 4. It is to be noted that FIG. 6 is excerpted from NPL 2, and is as described in NPL 2, unless otherwise explained. [0038] In the context adaptive binary arithmetic decoding, when the first parameter "codlRange" showing the state in the arithmetic decoding apparatus becomes less than 0 x 100 (hexadecimal: 256 (decimal)) (Yes in step SE01), the codlRange is shifted to the left (doubled), the second parameter "codlOffset" showing the state in the arithmetic decoding apparatus is shifted to the left (doubled), 1 bit is read from a bit stream, and when the read bit has 1, 1 is further added to the (doubled) value, and when the read bit has 0, the (doubled) value is set (SE02). [0039] When the codlRange finally becomes greater than or equal to 256 through this process (No in step SE01), the normalization process is terminated. [0040] The arithmetic decoding is performed by performing the above steps. [0041] However, as stated above, because importance is placed on enhancement of data storability in the method shown in NPL 3, a parallel processing capability in the arithmetic coding or arithmetic decoding, arrangement of coded bits, or the like is insufficient, and a redundant bit length is necessary. As a result, a burden is imposed on the coding and decoding of SAO information. [0042] In view of the above, the present invention provides a moving picture coding method, a moving picture coding apparatus, a moving picture decoding method, a moving picture decoding apparatus, and so on which can make processing efficient without reducing coding efficiency while maintaining the data storability, when the arithmetic coding or arithmetic decoding is performed on the SAO information that is information necessary for SAO. It is to be noted that hereinafter, there may be a case where the term "coding" is used in the sense of "encoding." [0043] A moving picture coding method according to an aspect of the present invention is a moving picture coding method for coding an input image to generate a bit stream, the method including: performing context adaptive binary arithmetic coding in which a variable probability value is used, on first information among multiple types of sample adaptive offset (SAO) information used for SAO that is a process of assigning an offset value to a pixel value of a pixel included in an image generated by coding the input image; and continuously performing bypass arithmetic coding in which a fixed probability value is used, on second information and third information among the multiple types of the SAO information, wherein the coded second and third information are placed after the coded first information in the bit stream. [0044] Here, the context adaptive binary arithmetic coding cannot be performed in parallel, and the bypass arithmetic coding can be performed in parallel on a bit basis. Thus, in the moving picture coding method according to the aspect of the present invention, because the bypass arithmetic coding of the second information and the bypass arithmetic coding of the third information are performed not intermittently but continuously due to the context adaptive binary arithmetic coding of the first information, it is possible to increase an amount of information that can be processed in parallel. As a result, it is possible to make the parallel processing efficient. For instance, it is possible to increase a parallel processing capability by increasing the number of bits on which the bypass arithmetic coding is performed in parallel. Moreover, because a probability value is fixed in the bypass arithmetic coding, it is possible to previously perform, before a symbol to be coded is obtained, arithmetic coding when the symbol is 0 and arithmetic coding when the symbol is 1 in parallel. In other words, it is possible to previously perform, for each occurrence pattern of symbol, arithmetic coding corresponding to the occurrence pattern. To put it differently, it is possible to previously perform look-ahead processing in the bypass arithmetic coding. Thus, it is possible to effectively use the look-ahead processing by continuously performing the bypass arithmetic coding of the second information and the bypass arithmetic coding of the third information. [0045] Furthermore, because, in the bit stream generated by the moving picture coding method according to the aspect of the present invention, the second and third information on which the bypass arithmetic coding is performed are placed after the first information on which the context adaptive binary arithmetic coding is performed, without being divided by the first information, the moving picture decoding apparatus is also allowed to easily decode the second and third information continuously by bypass arithmetic decoding. As a result, it is also possible to make the parallel processing efficient when the decoding is performed. Moreover, because, in the bit stream, the first information on which the context adaptive binary coding is performed is placed before the second and third information on which the bypass arithmetic coding is performed, the moving picture decoding apparatus is allowed to start bypass arithmetic decoding of the second information and bypass arithmetic decoding of the third information before context adaptive binary arithmetic decoding of the first information. As a result, the moving picture decoding apparatus is capable of start decoding the second and third information before the end of decoding of the first information. With this, it is possible to increase the speed of processing. [0046] Moreover, one of the second information and the third information may be sao_band_position indicating a range of pixel values to which the SAO is applied. [0047] With this, it is possible to efficiently code the sao_band_position. Moreover, for instance, when the first information is the sao_offset indicating the absolute value of an offset value, the sao_band_position is placed after the sao_offset in the bit stream. With this, in the moving picture decoding apparatus, because the sao_band_position is decoded after the sao_offset, even when the sao_offset is decoded, as long as the sao_band_position is not decoded, it is not possible to store the decoded sao_offset at a storage position in a memory associated with a range (position) of pixel values indicated by the sao_band_position. However, it is possible to appropriately apply the absolute value of the offset value indicated by the sao_offset to pixels values included in the range of pixel values indicated by the sao_band_position, by storing the decoded sao_offset in the memory regardless of the range and associating the decoded sao_offset with the sao_band_position to be decoded. As a result, it is possible to make the processing efficient and properly perform the SAO. [0048] Moreover, the other of the second information and the third information may be sao_offset_sign indicating whether an offset value is positive or negative, the offset value being assigned to a pixel value to which the SAO is applied. [0049] With this, it is possible to efficiently code the sao_offset_sign. Moreover, for example, when the first information is the sao_offset indicating the absolute value of the offset value, the sao_band_sign is placed after the sao_offset in the bit stream. Here, when the absolute value of the offset value indicated by the sao_offset is 0, it is possible to omit the sao_offset_sign. As a result, it is possible to increase coding efficiency. [0050] Moreover, in the continuously performing, the sao_band_position may be coded after the sao_offset_sign is coded [0051] With this, for Instance, when the first information is the sao_offset indicating the absolute value of the offset value, the sao_offset, the sao_offset_sign, and the sao_band_position are placed in the bit stream in this order. As a result, the moving picture decoding apparatus makes it possible to decode the sao_offset and the sao_offset_sign before the sao_band_position, and is thus capable of quickly determining an offset value assigned to a pixel value without waiting the decoding of the sao_band_position. Consequently, it is possible to readily store the offset value into the memory. [0052] Moreover, a pixel to which the SAO is applied may Include components of multiple types, and the first information, the second information, and the third information may be coded for each of the components. [0053] With this, for example, when the components of the multiple types are a luminance and a chrominance, in the bit stream, coded first information applied to the luminance and coded second information and coded third information applied to the luminance are collectively placed, and coded first information applied to the chrominance and code second information and coded third information are collectively placed. As a result, the moving picture decoding apparatus makes it possible to decode only one of SAO information applied to the luminance and SAO information applied to the chrominance as necessary. In other words, when the SAO is performed only on the luminance, it is possible to prevent the SAO information applied to the chrominance from being unnecessarily decoded. As a result, it is possible to make the processing efficient. [0054] Moreover, in the continuously performing, the bypass arithmetic coding may be further performed on at least one other information among the multiple types of the SAO information immediately before or immediately after the coding of the second information and the third information. [0055] With this, it is possible to further increase an amount of information that can be continuously processed in parallel, and thus it is possible to make the parallel processing more efficient. [0056] Moreover, the first information may be part of sao_type_idx indicating that the SAO is not to be performed or a type of the SAO. [0057] With this, It is possible to prevent parallel processing efficiency for the second information and the third information from decreasing due to the context adaptive binary arithmetic coding of the sao_type_idx. [0058] A moving picture decoding method according to another aspect of the present invention is a moving picture decoding method for decoding a coded image included in a bit stream, the method including: performing context adaptive binary arithmetic decoding in which a variable probability value is used, on first information among multiple types of SAO information that are included in the bit stream and used for sample adaptive offset (SAO) which is a process of assigning an offset value to a pixel value of a pixel included in an image generated by decoding the coded image; and continuously performing bypass arithmetic decoding in which a fixed probability value is used, on second information and third information that are among the multiple types of the SAO information and located after the first information in the bit stream. [0059] Here, the context adaptive binary arithmetic decoding cannot be performed in parallel, and the bypass arithmetic decoding can be performed in parallel on a bit basis. Thus, in the moving picture decoding method according to the other aspect of the present invention, because the bypass arithmetic decoding of the second information and the bypass arithmetic decoding of the third information are performed not intermittently but continuously due to the context adaptive binary arithmetic decoding of the first information, it is possible to increase an amount of information that can be processed in parallel. As a result, it is possible to make the parallel processing efficient. For instance, it is possible to increase a parallel processing capability by increasing the number of bits on which the bypass arithmetic decoding is performed in parallel. Moreover, because a probability value is fixed in the bypass arithmetic decoding, it is possible to previously perform, before data to be decoded is obtained, arithmetic decoding when the symbol is 0 and arithmetic decoding when the symbol is 1 in parallel. In other words, it is possible, to previously perform, for each occurrence pattern of symbol, arithmetic decoding corresponding to the occurrence pattern. To put it differently, it is possible to previously perform look-ahead processing in the bypass arithmetic decoding. Thus, it is possible to effectively use the look-ahead processing by continuously performing the bypass arithmetic decoding of the second information and the bypass arithmetic decoding of the third information. [0060] Moreover, because, in the bit stream, the first information on which the context adaptive binary coding is performed is placed before the second and third information on which the bypass arithmetic coding is performed, it is possible to start context adaptive binary arithmetic decoding of the first information before the bypass arithmetic decoding of the second information and the bypass arithmetic decoding of the third information. As a result, it is possible to start decoding the second and third information before the end of decoding of the first information. With this, it is possible to increase the speed of processing. [0061] Moreover, one of the second information and the third information may be sao_band_position indicating a range of pixel values to which the SAO is applied. [0062] With this, it is possible to efficiently decode the sao_band_position. Moreover, for instance, when the first information is the sao_offset indicating the absolute value of an offset value, the sao_band_position is placed after the sao_offset in the bit stream. With this, because the sao_band_position is decoded after the sao_offset, even when the sao_offset is decoded, as long as the sao_band_position is not decoded, it is not possible to store the decoded sao_offset at a storage position in a memory associated with a-range (position) of pixel values indicated by the sao_band_position. However, it is possible to appropriately apply the absolute value of the offset value indicated by the sao_offset to pixels values included in the range of pixel values indicated by the sao_band_position, by storing the decoded sao_offset in the memory regardless of the range and associating the decoded sao_offset with the sao_band_position to be decoded. As a result, it is possible to make the processing efficient and properly perform the SAO. [0063] Moreover, the other of the second information and the third information may be sao_offset_sign indicating whether an offset value is positive or negative, the offset value being assigned to a pixel value to which the SAO is applied. [0064] With this, it is possible to efficiently decode the sao__offset_sign. Moreover, for example, when the first information is the sao_offset indicating the absolute value of the offset value, the sao_band_sign is placed after the sao_offset in the bit stream. Here, when the absolute value of the offset value indicated by the sao_offset is 0, the sao_offset_sign is omitted. As a result, it is possible to properly decode the bit stream for which the coding efficiency is increased. [0065] Moreover, in the continuously performing, the sao_band_position may be decoded after the sao_offset_sign Is decoded. [0066] With this, for example, when the first information is the sao_offset indicating the absolute value_of the offset value, the sao_offset and the sao_offset_sign are decoded before the sao_band_position, and thus an offset value assigned to a pixel value can be quickly determined without waiting the decoding of the sao_band_position. Consequently, it is possible to readily store the offset value into the memory. [0067] Moreover, a pixel to which the SAO is applied may include components of multiple types, and the first information, the second information, and the third information may be coded for each of the components. [0068] With this, for instance, when the components of the multiple types are a luminance and a chrominance, it is possible to decode only one of SAO information applied to the luminance and SAO information applied to the chrominance as necessary. In other words, when the SAO is performed only on the luminance, it is possible to prevent the SAO information applied to the chrominance from being unnecessarily decoded. As a result, it is possible to make the processing efficient. [0069] Moreover, in the continuously performing, the bypass arithmetic decoding may be performed on at least one other information among the multiple types of the SAO information immediately before or immediately after the decoding of the second information and the third information. [0070] With this, it is possible to further increase an amount of information that can be continuously processed in parallel, and thus it is possible to make the parallel processing more efficient. [0071] Moreover, the first information may be part of sao_type_idx indicating that the SAO is not to be performed or a type of the SAO. With this, it is possible to prevent parallel processing efficiency for the second information and the third information from decreasing due to the context adaptive binary arithmetic decoding of the sao_type_idx. [0072] These general and specific aspects may be implemented using a system, a method, an integrated circuit, a computer program, or a computer-readable recording medium such as a CD-ROM, or any combination of systems, methods, integrated circuits, computer programs, or computer-readable recording media. [0073] Hereinafter, embodiments are specifically described with reference to the Drawings. [0074] Each of the embodiments described below shows a general or specific example. The numerical values, shapes, materials, structural elements, the arrangement and connection of the structural elements, steps, the processing order of the steps etc. shown in the following embodiments are mere examples, and therefore do not limit the scope of the Claims. Therefore, among the structural elements in the following embodiments, structural elements not recited in any one of the independent claims are described as arbitrary structural elements. [0075] (Embodiment 1) FIG. 7 is a block diagram showing an exemplary configuration of a moving picture decoding apparatus 100 according to Embodiment 1. [0076] The moving picture decoding apparatus 100 decodes compression-coded image data. For instance, coded image data (a bit stream) is inputted, on a block-by-block basis, to the moving picture decoding apparatus 100 as signals to be decoded (input signals). The moving picture decoding apparatus 100 reconstructs image data by performing variable length decoding, inverse quantization, and inverse transform on the inputted signals to be decoded. [0077] As shown in FIG. 7, the moving picture decoding apparatus 100 includes an entropy decoding unit 110, an inverse quantization and inverse transform unit 120, an adder 125, a loop filter 130, a memory 140, an intra prediction unit 150, a motion compensation unit 160, and an intra/inter change switch 170. [0078] The entropy decoding unit 110 performs variable length decoding on an input signal, to reconstruct a quantization coefficient. It is to be noted that here, the input signal is a signal to be decoded, and corresponds to coded image data for each block. Moreover, the entropy decoding unit 110 obtains motion data from the input signal, and outputs the obtained motion data to the motion compensation unit 160. Furthermore, the entropy decoding unit 110 performs variable length decoding on the input signal, to reconstruct SAO information, and outputs the SAO information to the loop filter 130. [0079] The inverse quantization and inverse transform unit 120 performs inverse quantization on the quantization coefficient reconstructed by the entropy decoding unit 110, to reconstruct a transform coefficient. Then, the inverse quantization and inverse transform unit 120 performs inverse transform on the reconstructed transform coefficient, to reconstruct a prediction error. [0080] The adder 125 adds the reconstructed prediction error to a prediction signal, to generate a decoded image. [0081] The loop filter 130 performs a loop filter process on the generated decoded image. The decoded image on which the loop filter process has been performed is outputted as a decoded signal. It is to be noted that the loop filter process includes SAO. [0082] The memory 140 is a memory for storing reference images used for motion compensation. Specifically, the memory 140 stores decoded images on which the loop filter process has been performed. [0083] The intra prediction unit 150 performs intra prediction to generate a prediction signal (intra-prediction signal). Specifically, the intra prediction unit 150 performs intra prediction by referring to an image around a current block to be decoded (input signal) in the decoded image generated, by the adder 125, to generate an intra-

Documents

Application Documents

# Name Date
1 116-CHENP-2014 FORM-5 06-01-2014.pdf 2014-01-06
2 116-CHENP-2014 FORM-3 06-01-2014.pdf 2014-01-06
3 116-CHENP-2014 FORM-1 06-01-2014.pdf 2014-01-06
4 116-CHENP-2014 DESCRIPTION (COMPLETE) 06-01-2014.pdf 2014-01-06
5 116-CHENP-2014 CLAIMS 06-01-2014.pdf 2014-01-06
6 116-CHENP-2014 ABSTRACT 06-01-2014.pdf 2014-01-06
7 116-CHENP-2014 POWER OF ATTORNEY 06-01-2014.pdf 2014-01-06
8 116-CHENP-2014 PCT 06-01-2014.pdf 2014-01-06
9 116-CHENP-2014 ENGLISH TRANSLATION 06-01-2014.pdf 2014-01-06
10 116-CHENP-2014 DRAWINGS 06-01-2014.pdf 2014-01-06
11 116-CHENP-2014 CORRESPONDENCE OTHERS 06-01-2014.pdf 2014-01-06
12 116-CHENP-2014 FORM-2 06-01-2014.pdf 2014-01-06
13 116-CHENP-2014.pdf 2014-01-09
14 116-CHENP-2014 FORM-3 03-07-2014.pdf 2014-07-03
15 116-CHENP-2014 CORRESPONDENCE OTHERS 03-07-2014.pdf 2014-07-03
16 116-CHENP-2014 POWER OF ATTORNEY 25-03-2015.pdf 2015-03-25
17 116-CHENP-2014 FORM-6 25-03-2015.pdf 2015-03-25
18 116-CHENP-2014 CORRESPONDENCE OTHERS 25-03-2015.pdf 2015-03-25
19 116-CHENP-2014 ASSIGNMENT 25-03-2015.pdf 2015-03-25
20 PANASONIC INTELLECTUAL PROPERTY CORPORATION OF AMERICA - 1.pdf 2015-03-26
21 PANA ASSIGNMENT.pdf 2015-03-26
22 Form 6.pdf 2015-03-26
23 Other Document [09-03-2016(online)].pdf 2016-03-09
24 Marked Copy [09-03-2016(online)].pdf 2016-03-09
25 Form 13 [09-03-2016(online)].pdf 2016-03-09
26 Description(Complete) [09-03-2016(online)].pdf 2016-03-09
27 Power of Attorney [03-11-2016(online)].pdf 2016-11-03
28 Form 6 [03-11-2016(online)].pdf 2016-11-03
29 Assignment [03-11-2016(online)].pdf 2016-11-03
30 Correspondence by Agent_Recordal Of Assignment_11-11-2016.pdf 2016-11-11
31 116-CHENP-2014-FER.pdf 2019-08-20
32 116-CHENP-2014-certified copy of translation (MANDATORY) [30-09-2019(online)].pdf 2019-09-30
33 116-CHENP-2014-PETITION UNDER RULE 137 [25-11-2019(online)].pdf 2019-11-25
34 116-CHENP-2014-OTHERS [25-11-2019(online)].pdf 2019-11-25
35 116-CHENP-2014-FORM 3 [25-11-2019(online)].pdf 2019-11-25
36 116-CHENP-2014-FER_SER_REPLY [25-11-2019(online)].pdf 2019-11-25
37 116-CHENP-2014-DRAWING [25-11-2019(online)].pdf 2019-11-25
38 116-CHENP-2014-CLAIMS [25-11-2019(online)].pdf 2019-11-25
39 116-CHENP-2014-ABSTRACT [25-11-2019(online)].pdf 2019-11-25
40 116-CHENP-2014-FORM 3 [07-01-2020(online)].pdf 2020-01-07
41 116-CHENP-2014-Written submissions and relevant documents [20-04-2021(online)].pdf 2021-04-20
42 116-CHENP-2014-Retyped Pages under Rule 14(1) [20-04-2021(online)].pdf 2021-04-20
43 116-CHENP-2014-FORM 3 [20-04-2021(online)].pdf 2021-04-20
44 116-CHENP-2014-2. Marked Copy under Rule 14(2) [20-04-2021(online)].pdf 2021-04-20
45 116-CHENP-2014-PatentCertificate11-10-2021.pdf 2021-10-11
46 116-CHENP-2014-IntimationOfGrant11-10-2021.pdf 2021-10-11
47 116-CHENP-2014-US(14)-HearingNotice-(HearingDate-06-04-2021).pdf 2021-10-17
48 116-CHENP-2014-RELEVANT DOCUMENTS [22-09-2023(online)].pdf 2023-09-22

Search Strategy

1 2019-08-2010-32-02_20-08-2019.pdf

ERegister / Renewals

3rd: 02 Nov 2021

From 17/05/2015 - To 17/05/2016

4th: 02 Nov 2021

From 17/05/2016 - To 17/05/2017

5th: 02 Nov 2021

From 17/05/2017 - To 17/05/2018

6th: 02 Nov 2021

From 17/05/2018 - To 17/05/2019

7th: 02 Nov 2021

From 17/05/2019 - To 17/05/2020

8th: 02 Nov 2021

From 17/05/2020 - To 17/05/2021

9th: 02 Nov 2021

From 17/05/2021 - To 17/05/2022

10th: 25 Mar 2022

From 17/05/2022 - To 17/05/2023

11th: 20 Apr 2023

From 17/05/2023 - To 17/05/2024

12th: 01 Apr 2024

From 17/05/2024 - To 17/05/2025

13th: 28 Mar 2025

From 17/05/2025 - To 17/05/2026