WO2012099433A2 - Procédé de codage entropique utilisant une table de mise en correspondance d'indices, appareil et procédé de codage/décodage d'image utilisant ledit procédé de codage entropique - Google Patents

Procédé de codage entropique utilisant une table de mise en correspondance d'indices, appareil et procédé de codage/décodage d'image utilisant ledit procédé de codage entropique Download PDF

Info

Publication number
WO2012099433A2
WO2012099433A2 PCT/KR2012/000540 KR2012000540W WO2012099433A2 WO 2012099433 A2 WO2012099433 A2 WO 2012099433A2 KR 2012000540 W KR2012000540 W KR 2012000540W WO 2012099433 A2 WO2012099433 A2 WO 2012099433A2
Authority
WO
WIPO (PCT)
Prior art keywords
code number
mapping table
index mapping
updating
code
Prior art date
Application number
PCT/KR2012/000540
Other languages
English (en)
Korean (ko)
Other versions
WO2012099433A3 (fr
Inventor
김종호
김휘용
임성창
이하현
이진호
정세윤
최진수
김진웅
안치득
Original Assignee
한국전자통신연구원
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
Priority claimed from KR1020110049246A external-priority patent/KR20120084639A/ko
Application filed by 한국전자통신연구원 filed Critical 한국전자통신연구원
Priority to US13/980,521 priority Critical patent/US9053525B2/en
Publication of WO2012099433A2 publication Critical patent/WO2012099433A2/fr
Publication of WO2012099433A3 publication Critical patent/WO2012099433A3/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
    • H04N19/1887—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a variable length codeword
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
    • H04N19/61—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding in combination with predictive coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
    • H04N19/91—Entropy coding, e.g. variable length coding [VLC] or arithmetic coding

Definitions

  • the present invention relates to an image encoding / decoding technique, and more particularly, to an entropy coding method using an index mapping table, and an apparatus and method using the same.
  • an inter prediction technique for predicting pixel values included in a current picture from a previous and / or subsequent picture in time, and predicting pixel values included in a current picture using pixel information in the current picture.
  • An intra prediction technique an entropy encoding technique of allocating a short code to a symbol with a high frequency of appearance and a long code to a symbol with a low frequency of appearance may be used.
  • a method of decoding an image by referring to an inverse codeword mapping table, an input codeword is mapped to a code number, and the mapped code number is converted into a table index. Updating the inverse index mapping table based on at least one of a calculating step and a cumulative number of occurrences of the code number, a number of consecutive occurrences of the code number, encoding and decoding information of neighboring blocks, and threshold information for updating the inverse index mapping table. It may include a step.
  • the updating of the reverse index mapping table may include updating the reverse index mapping table by swapping a code number one code smaller than the code number and the code number when the number of occurrences of the code number is greater than a predetermined threshold.
  • the updating of the inverse index mapping table may include: dividing a code number included in the inverse index mapping table into a plurality of code number groups, and generating the first code number group to which the code number belongs is greater than a predetermined threshold. And updating a reverse index mapping table by swapping a code number of a second code number group including a code number smaller than a code number of a first code number group with a code number of the first code number group.
  • the updating of the reverse index mapping table may include updating a reverse index mapping table by swapping a code number smaller than the code number and the code number when the number of consecutive occurrences of the code number is greater than a predetermined threshold. .
  • the updating of the reverse index mapping table may be updating the reverse index mapping table on a periodic basis based on the global cumulative number of times of the code number.
  • the updating of the reverse index mapping table may be performed by dividing a code number included in the reverse index mapping table into a plurality of code number groups, and by the unit of a predetermined period based on a global cumulative number of code numbers belonging to each code number group.
  • the reverse index mapping table may be updated.
  • the updating of the inverse index mapping table may include updating the inverse index mapping table based on a global cumulative number of occurrences calculated by giving a predetermined weight to the number of occurrences of the code number when the number of consecutive occurrences of the code number is greater than a predetermined threshold.
  • the updating may be a step.
  • the updating of the reverse index mapping table may include updating the reverse index mapping table based on a global cumulative occurrence number of code numbers included in the reverse index mapping table when the number of consecutive occurrences of the code number is greater than a predetermined threshold. It may be a step.
  • the threshold information for updating the inverse index mapping table may be information that is adaptively changed based on the number of consecutive occurrences of a code number, the cumulative occurrence number of the code number, and the decoding information of a neighboring block.
  • the updating of the inverse index mapping table may include comparing the number of global occurrences of the code number with the number of global occurrences of the higher code number and comparing the number of global occurrences of the higher code number with a higher number than the global number of occurrences of the code number.
  • the method may include updating a reverse index mapping table by swapping a code number having a larger value and the code number.
  • the updating of the inverse index mapping table may include comparing a global occurrence number of the code number with a global occurrence number of an upper code number that is one less than the code number, so that the global occurrence number of the upper code number is greater than the global occurrence number of the code number. If large, it may be a step of swapping the code number and the higher code number.
  • the updating of the reverse index mapping table may include updating the reverse index mapping table by varying the size of the code number swapped with the code number based on the number of consecutive occurrences of the code number.
  • the updating of the inverse index mapping table may include classifying code numbers included in the inverse index mapping table into a plurality of code number groups, and using one counter of a global cumulative counter or a local cumulative counter for each code number group.
  • the reverse index mapping table may be updated by applying different thresholds for updating the index mapping table to a code number group.
  • the image decoding method may further include normalizing when the cumulative occurrence number of the inverse index mapping table is greater than or equal to a specific value. Normalizing the cumulative occurrence number of the inverse index mapping table by normalizing by dividing the cumulative occurrence number for each symbol by the maximum value / minimum value of the cumulative occurrence number, and the cumulative occurrence number for each symbol when the cumulative occurrence number for each symbol is greater than or equal to a specific value. It may be one step of normalizing by dividing by 1/2 or a specific value and normalizing by giving different weights to the cumulative occurrence number.
  • the updating of the reverse index mapping table may include updating the reverse index mapping table when the difference value is greater than a predetermined threshold value based on a difference value between an upper code number and a cumulative occurrence frequency of the code number. .
  • a code number for indexing the combined symbol is grouped according to the characteristics of a symbol to use one counter in the grouped group. The number of occurrences of the symbol may be counted, and the code number may be swapped in the group unit.
  • the image decoding apparatus for achieving the above-described second object of the present invention maps the codeword inputted with reference to the inverse codeword mapping table to the code number, and maps the mapped code number to the table.
  • An inverse index based on at least one of a table index calculating unit calculated by an index and a cumulative occurrence number of code numbers, consecutive occurrences of a code number, information about encoding and decoding of neighboring blocks, and threshold information for updating an inverse index mapping table; It may include a reverse index mapping table calculator for updating the mapping table.
  • the entropy coding method using the index mapping table and the apparatus using the method according to the embodiment of the present invention can increase the encoding and decoding efficiency by rearranging the index mapping table according to an arbitrary condition.
  • FIG. 1 is a block diagram illustrating an image encoding apparatus according to an embodiment of the present invention.
  • FIG. 2 is a block diagram illustrating a configuration of an image decoding apparatus according to another embodiment of the present invention.
  • FIG. 3 is a flowchart illustrating an entropy encoding method according to an embodiment of the present invention.
  • FIG. 4 is a conceptual diagram illustrating a process of mapping a symbol value to a code number according to an embodiment of the present invention.
  • FIG. 5 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • FIG. 6 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • FIG. 7 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • FIG. 8 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • FIG. 9 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • FIG. 10 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • FIG. 11 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • FIG. 12 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • FIG. 13 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • FIG. 14 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • 15 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • 16 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • FIG. 17 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • FIG. 18 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • FIG. 19 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • FIG. 20 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • 21 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • 22 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • 23 is a flowchart illustrating a decoding method according to an embodiment of the present invention.
  • 24 is a conceptual diagram illustrating a method of updating a reverse index mapping table according to an embodiment of the present invention.
  • 25 is a conceptual diagram illustrating a method of updating a reverse index mapping table according to an embodiment of the present invention.
  • 26 is a conceptual diagram illustrating a method of updating an inverse index mapping table according to an embodiment of the present invention.
  • FIG. 27 is a conceptual diagram illustrating a reverse index mapping table update method according to an embodiment of the present invention.
  • FIG. 28 is a conceptual diagram illustrating a method of updating an inverse index mapping table according to an embodiment of the present invention.
  • 29 is a conceptual diagram illustrating a method of updating an inverse index mapping table according to an embodiment of the present invention.
  • FIG. 30 is a conceptual diagram illustrating a reverse index mapping table update method according to an embodiment of the present invention.
  • FIG. 31 is a conceptual diagram illustrating a part of an image decoding device according to an embodiment of the present invention.
  • first and second may be used to describe various components, but the components should not be limited by the terms. The terms are used only for the purpose of distinguishing one component from another.
  • the first component may be referred to as the second component, and similarly, the second component may also be referred to as the first component.
  • FIG. 1 is a block diagram illustrating an image encoding apparatus according to an embodiment of the present invention.
  • the image encoding apparatus 100 may include a motion predictor 111, a motion compensator 112, an intra predictor 120, a switch 115, a subtractor 125, and a converter 130. And a quantization unit 140, an entropy encoding unit 150, an inverse quantization unit 160, an inverse transform unit 170, an adder 175, a filter unit 180, and a reference image buffer 190.
  • the image encoding apparatus 100 encodes an input image in an intra mode or an inter mode and outputs a bitstream.
  • intra prediction may be used in the same meaning as intra prediction and inter prediction.
  • an intra prediction method and an inter prediction method may be selectively used for the prediction unit.
  • the image encoding apparatus 100 generates a prediction block for the original block of the input image and then encodes a difference between the original block and the prediction block.
  • the intra prediction unit 120 may perform spatial prediction using pixel values of an already encoded block around the current block. Generate a predictive block.
  • the motion predictor 111 finds a motion vector in the reference image stored in the reference image buffer 190 that best matches the input block in the motion prediction process.
  • the motion compensator 112 generates a prediction block by performing motion compensation using the motion vector.
  • the subtractor 125 generates a residual block by the difference between the input block and the generated prediction block.
  • the transform unit 130 performs a transform on the residual block and outputs a transform coefficient.
  • the quantization unit 140 quantizes the input transform coefficient according to the quantization parameter and outputs a quantized coefficient.
  • the entropy encoder 150 entropy codes the input quantized coefficients according to a probability distribution and outputs a bit stream.
  • the entropy encoder 150 maps an input codeword to a code number with reference to a codeword mapping table, calculates the mapped code number as a table index, and accumulates the number of occurrences of the code number and the code.
  • the index mapping table may be updated based on at least one of a number of consecutive occurrences of the number, information about encoding and decoding of neighboring blocks, and threshold information for updating the index mapping table.
  • the quantized coefficients are inversely quantized by the inverse quantizer 160 and inversely transformed by the inverse transformer 170.
  • the inverse quantized and inverse transformed coefficients are added to the prediction block by the adder 175 and a reconstruction block is generated.
  • the reconstruction block passes through the filter unit 180, and the filter unit 180 applies at least one or more of a deblocking filter, a sample adaptive offset (SAO), and an adaptive loop filter (ALF) to the reconstruction block or the reconstruction picture. can do.
  • the filter unit 180 may be referred to as an adaptive in-loop filter.
  • the deblocking filter can remove block distortion generated at the boundary between blocks.
  • SAO may add an appropriate offset value to pixel values to compensate for coding errors.
  • the ALF may perform filtering based on a value obtained by comparing the reconstructed image with the original image, and may be performed only when high efficiency is applied.
  • the reconstructed block that has passed through the filter unit 180 is stored in the reference image buffer 190.
  • FIG. 2 is a block diagram illustrating a configuration of an image decoding apparatus according to another embodiment of the present invention.
  • the image decoding apparatus 200 may include an entropy decoder 210, an inverse quantizer 220, an inverse transformer 230, an intra predictor 240, a motion compensator 250, and a filter. 260 and a reference picture buffer 270.
  • the image decoding apparatus 200 receives a bitstream output from the encoder and performs decoding in an intra mode or an inter mode, and outputs a reconstructed image, that is, a reconstructed image.
  • the prediction block is generated using the intra prediction mode
  • the prediction block is generated using the inter prediction method.
  • the image decoding apparatus 200 obtains a residual block from the input bitstream, generates a prediction block, adds the residual block and the prediction block, and generates a reconstructed block, that is, a reconstruction block.
  • the entropy decoder 210 entropy decodes the input bitstream according to a probability distribution and outputs quantized coefficients.
  • the quantized coefficients are inversely quantized by the inverse quantizer 220 and inversely transformed by the inverse transformer 230, and as a result of the inverse quantization / inverse transformation of the quantized coefficients, a residual block is generated.
  • the entropy decoding unit 210 maps an input codeword to a code number by referring to an inverse codeword mapping table, calculates the mapped code number as a table index, and accumulates the number of occurrences of the code number,
  • the inverse index mapping table may be updated based on at least one of the number of consecutive occurrences of the code number, information about the decoding and decoding of neighboring blocks, and threshold information for updating the inverse index mapping table.
  • the intra prediction unit 240 (or the inter prediction unit) generates a prediction block by performing spatial prediction using pixel values of blocks that are already encoded around the current block.
  • the motion compensator 250 In the inter prediction mode, the motion compensator 250 generates a predictive block by performing motion compensation using the motion vector and the reference image stored in the reference image buffer 270.
  • the filter unit 260 may apply at least one or more of the deblocking filter, SAO, and ALF to the reconstructed block or the reconstructed picture.
  • the filter unit 260 outputs a reconstructed image, that is, a reconstructed image.
  • the reconstructed picture may be stored in the reference picture buffer 270 to be used for inter prediction.
  • Methods for improving the prediction performance of the encoding / decoding apparatus include a method of increasing the accuracy of an interpolation image and a method of predicting a difference signal.
  • the difference signal is a signal representing the difference between the original image and the predicted image.
  • the "difference signal” may be used by being replaced with “difference signal”, “residual block” or “difference block” according to the context, and those skilled in the art may affect the spirit and the essence of the invention. This can be distinguished to the extent that it does not give.
  • a coding unit is used as a coding unit for convenience of description, but may also be a unit for performing decoding as well as encoding.
  • an encoding / decoding method of an intra prediction mode using two candidate intra prediction modes described with reference to FIGS. 3 to 10 according to an embodiment of the present invention is implemented according to the functions of the respective modules described above with reference to FIGS. 1 and 2.
  • These encoders and decoders are included in the scope of the present invention. That is, in the embodiment of the present invention, the image encoding method and the image decoding method to be described later may be performed by each component included in the image encoder and the image decoder described above with reference to FIGS. 1 and 2.
  • the meaning of the component may include not only the hardware meaning but also a software processing unit that may be performed through an algorithm.
  • FIG. 3 is a flowchart illustrating an entropy encoding method according to an embodiment of the present invention.
  • symbol values are mapped to corresponding table indexes on the index mapping table, and mapped table index values are mapped to code numbers on the index mapping table (step S300).
  • the symbol value may be a syntax element value representing a transform coefficient value, a prediction mode, a cbf, a ref index, and the like. These symbol values may be calculated as table index values through an enumeration process.
  • a table in which such symbol values are enumerated and code numbers are mapped is defined as an index mapping table, but is defined as a sorting table rather than an index mapping table. It may be.
  • FIG. 4 is a conceptual diagram illustrating a process of mapping a symbol value to a code number according to an embodiment of the present invention.
  • an arbitrary symbol value is calculated as a table index value through an enumeration process (400).
  • the calculated table index value is calculated as a code number value using the index mapping table 410 (410).
  • the index mapping table may consist of a table index to which symbol values are mapped and a code number to which a table index is mapped. Whenever a specific symbol value occurs, the table index corresponding to the specific symbol value and the code number mapped to it are updated to update the index mapping table so that symbol values with high probability can be mapped to short codewords. do.
  • the decoder can decode codeword information in the same manner as the encoder in the reverse direction.
  • code words may be generated using various binary coding methods according to symbols.
  • the index mapping table is updated (step S320).
  • At least one of the cumulative occurrence number of code numbers, the consecutive occurrence number of code numbers, sub-decoding information of neighboring blocks, and threshold information for updating the inverse index mapping table may be used.
  • the cumulative occurrence count of the symbol value for updating the index mapping table may be the local accumulation count or the global accumulation count.
  • the global cumulative occurrence count is a value representing the cumulative occurrence count of the table index corresponding to each symbol and may be a value for comparing the occurrence probability for each symbol value or table index without being reset.
  • the global cumulative occurrence count is not initialized even if the predetermined threshold is satisfied.
  • the local cumulative occurrence count is a cumulative issuance count of a table index corresponding to each symbol and may be initialized when a specific value such as a preset threshold is satisfied.
  • the threshold is a value arbitrarily set by using the surrounding encoding information.
  • the threshold is determined whether or not to update the index mapping table when the cumulative number of occurrences of the region is greater than or equal to or greater than the threshold value according to a predetermined condition.
  • the threshold value of 3 may indicate that the index mapping table is updated when the local cumulative number of times is 3 or more.
  • the number of local cumulative occurrences and the number of global cumulative occurrences may be calculated for each symbol value or may be calculated by grouping several symbols.
  • normalization may be performed when the global cumulative occurrence number exceeds a specific value.
  • a normalization method for example, a method of dividing a cumulative occurrence number of symbols by a maximum value / minimum value of a cumulative occurrence number, and dividing a cumulative number of occurrences of a symbol by a half or a specific value when the cumulative occurrence number of symbols is a specific value or more. Normalization can be performed in a variety of ways, such as by giving a different weight to the cumulative number of occurrences, or by counting.
  • the number of consecutive occurrences of the symbol value may be used to update the index mapping table.
  • a particular symbol value occurs continuously, it is possible to determine whether a specific symbol is generated continuously by assuming that the same symbol value is likely to come out in the next block, thereby determining whether to update the index mapping table.
  • the number of consecutive occurrences can be calculated by grouping the symbol values.
  • the index mapping table in order to update the index mapping table, it may be based on encoding information of neighboring blocks.
  • the index mapping table may be updated using information such as symbol values and code numbers of neighboring blocks.
  • FIG. 5 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • the number of local cumulative issuances of the symbol value or the table index may be compared with the threshold to determine whether to update the sort table.
  • the present invention discloses a method of counting the number of occurrences of the table index and swapping the code number, for convenience of description, but in another embodiment of the present invention, it is also possible to swap the table index. Included in the scope of rights.
  • the threshold may be a predetermined value and may be the number of occurrences of the table index. In addition, the threshold may vary for any unit such as a frame or slice and may be applied differently for each symbol.
  • the index mapping table may be updated.
  • code number 3 mapped to table index 12 on the index mapping table and code number 2 of 3, which is a table index value, may be swapped at the top of the table index. That is, the code number mapped to the current table index and the code number smaller than the code number mapped to the current table index can be swapped.
  • the local cumulative counter value for comparing with the threshold may be initialized unlike the global cumulative counter.
  • FIG. 6 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • the index mapping table may be updated by grouping symbols, obtaining a local cumulative occurrence count for each group, and comparing the threshold value with a threshold value.
  • the global cumulative occurrence count and the local cumulative occurrence count of the index group including the table index value may be increased by one.
  • the index mapping table may be updated.
  • the index mapping table can be updated by exchanging the code number mapped to the current index group and the code number of the upper index group mapped to a code number smaller than the current index group for each group.
  • FIG. 7 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • the index mapping table may be updated based on the number of consecutive occurrences.
  • the index mapping table may be updated when the number of consecutive occurrences of the current table index value is four times.
  • a code number smaller than the code number mapped to the current table index value may be exchanged with the code number value of the current table index. Since the code number mapped to the table index value 12 is 2, the code number 1 can be used as the code number value mapped to the current table index 12 by swapping the code number 1 and the code number smaller than 2.
  • FIG. 8 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • the index mapping table may rearrange the table based on the global accumulation count. For example, if 12 occurs as a table index value, the global cumulative occurrence count of the table index can be increased by one, and all code numbers in the index mapping table can be rearranged based on the increased global cumulative occurrence count.
  • the global cumulative occurrence number may be updated as a specific unit such as a frame or a slice changes. That is, the cumulative occurrence number may be stored in units of frames or slices, and an updated index mapping table may be used when encoding the next frame or slice based on the cumulative occurrence number.
  • the index mapping table may be updated for each period by setting a certain period even within a specific unit.
  • the code number may be changed in descending order based on the number of occurrences of other indexes on the index mapping table.
  • the number of global cumulative occurrences accumulated when a specific table index occurs continuously can be increased by weighting the number of cumulative occurrences when a specific table index occurs continuously (for example, when a specific table index occurs three times in a row). Increase the number of occurrences by two rather than one).
  • a method of exchanging code numbers on a table index may be used when the global cumulative occurrence number is greater than or equal to a threshold by setting a specific threshold.
  • a threshold may be set as a threshold for a code number smaller than a code number mapped to a current table index, and a code number mapped to a table index may be exchanged only when the cumulative occurrence exceeds the threshold. Can be used.
  • FIG. 9 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • a table index of an index mapping table may be divided into predetermined index groups and mapped.
  • the global cumulative occurrence count can be increased by group, and the index mapping table can be updated by changing the mapping of the code number based on the increased global cumulative occurrence count.
  • the global cumulative occurrence count of the group corresponding to the table index 12 may be increased, and the index mapping table may be rearranged based on the global cumulative occurrence count.
  • FIG. 10 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • a global cumulative occurrence count of a specific table index may be calculated by increasing a weighted value of the global cumulative occurrence number instead of 1. Can be.
  • the weighted number of consecutive occurrences is three. If a particular table index value occurs three or more times in a row, and the table index value occurs four times in a row, the global cumulative number of occurrences is two instead of one. You can increase the number of global occurrences of the table index by increasing the weight by using.
  • FIG. 11 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • an index mapping table may be updated based on the global cumulative occurrence number when a specific symbol occurs continuously. For example, if the threshold of the number of consecutive occurrences is set to 3, the table index 12 occurs, and if the table index 12 occurs three times, the number of consecutive occurrences becomes 4, so that the index mapping table can be updated beyond the threshold.
  • the update of the index mapping table may be performed by using a method of exchanging a code number mapped to a currently generated table index and a code number smaller than a code number mapped to a currently generated table index.
  • a method of changing a preset threshold value under a specific condition may be used. For example, when a particular symbol is generated continuously, the preset threshold value can be reduced. If the threshold for updating the existing index mapping table is four times when a particular symbol occurs seven times in a row, the threshold is reduced to three times, so that the index mapping table can be updated more quickly when a particular symbol occurs continuously.
  • the magnitude of the threshold may be adjusted according to the magnitude of the cumulative occurrence number. For example, when the global cumulative occurrence count of a particular symbol is 30% or more, the index mapping table update may occur more quickly by changing the threshold value from the existing threshold value 4 to 3.
  • FIG. 12 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • a threshold size may be adjusted based on encoding information of a neighboring block. For example, when a symbol value of neighboring blocks is equal to a target symbol value, the threshold value may be reduced from 4 to 3.
  • the encoding information eg, block size, reference picture, motion vector, etc.
  • the threshold may be changed. . That is, when there are many blocks in which the symbol values of encoded neighboring blocks are the same as the current block, the probability of the same symbol value appearing in the next block may be increased.
  • the same block can be decoded by using a short codeword value when decoding the same block so that an update on the code number occurs more easily on the index mapping table. Whether several neighboring blocks should be equal to the symbol value of the current block can be adaptively changed according to the number of consecutive occurrences.
  • the size of updating the code number corresponding to the table index on the index mapping table may be different.
  • the code number of the symbol value or the corresponding table index is replaced with the higher code number up one level. That is, the code number of the table index corresponding to the current symbol value is exchanged with one less than the code number of the table index.
  • the code number of the table index corresponding to the symbol value when the index mapping table is updated may be increased by one or more steps in consideration of various factors such as the cumulative / continuous occurrence of the symbol value and the surrounding encoding information. You can swap with a code number (a code number that is more than one less than the current code number).
  • the updated code number can be expressed as Max (0, current code number-1), and if you replace the current code number with one or more higher levels,
  • the code number to be updated is Max (0, current code number-a), and a can be a variable that can be changed by various factors. Larger a may have a higher code number.
  • a variable such as a may be defined and used as an update variable.
  • the update variable may change according to the number of consecutive occurrences of the table index or symbol.
  • the current code number can be replaced with the higher code number value on the second level up to two smaller than the code number value of one small up value and the symbol or table index. Is generated 5 times in a row, the higher code number value and place where 3 is smaller than the current code number above 3 steps can be changed.
  • FIG. 13 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • a code number having a global cumulative occurrence number that is greater than the global cumulative occurrence number of the current table index instead of a code number immediately above. can be exchanged for a larger code number. For example, if the global cumulative occurrence number of the current table index is 41, the index mapping table is changed by changing a value greater than 0, the code number of 70, the global cumulative occurrence number of values greater than 41, to the code number of the current table index. Can be updated.
  • FIG. 14 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • a code number exchange operation may be performed through a plurality of steps.
  • the global cumulative variable of the table index value is increased by 1 to 41.
  • Number 3 and code number 2 can be exchanged.
  • the next step is to compare the global cumulative variable of the table index value 12 mapped to code number 2 by the code number exchange step described above and the global cumulative variable of the table index mapped to code number 1, which is the code number higher than code number 2. If the global cumulative variable mapped to number 1 is smaller, code number 2 mapped to table index 12 may be exchanged with code number 1. That is, unlike FIG. 13, the index mapping table may be swapped based on the global cumulative variable values of the table indexes mapped to higher code numbers.
  • 15 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • a code number swapped when a specific symbol or an index mapping table occurs a predetermined number of times in succession may be a code number of a plurality of levels higher. For example, if the code number updated after five consecutive table indexes is 3 minus 3 from the current code number, 12 is generated as the table index and the table index is generated 5 times. A code number mapped to 12 subtracts 3, and 0 may be mapped to table index 12. That is, when a specific symbol is generated continuously, the index mapping table can be updated more quickly by exchanging the code number of the symbol with a code number of a plurality of levels.
  • the number of times of updating the alignment table may be set differently according to arbitrary units such as coding units, frames, slices, and GOPs.
  • the complexity caused by updating the index mapping table can be reduced by using the method of updating the index mapping table at regular intervals such as frame 2 and GOP 10.
  • the index mapping table can be updated by using the global cumulative occurrence count and the local cumulative occurrence count for each group.
  • the index mapping table may be divided into a first group and a second group to use a global cumulative counter for the first group and a local cumulative counter for the second group.
  • the index mapping table may be updated by applying different threshold values between the first group and the second group. For example, in order to update the index mapping table, the global cumulative occurrence count of the table indexes of the first group may be applied in the first group, and the local cumulative occurrence count of the table indexes of the second group may be applied in the second group. have.
  • 16 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • the first group may update the index mapping table using the global cumulative occurrence number
  • the second group may update the index mapping table using the local cumulative occurrence number
  • the number of cumulative occurrences of the second group that counts the local cumulative occurrences may increase.
  • the table index value in the index mapping table may be swapped with the table index value having the above code number. If the number of occurrences of a particular table index satisfies the threshold, the local cumulative counter may be initialized. If the threshold value is set to 1, the index mapping table may be updated as the symbol value changes, that is, the index mapping table is updated whenever a symbol (value) occurs.
  • the decoder may receive a code number and increase the number of occurrences of a table index value corresponding to the code number, and a swapping process of the inverse index mapping table may occur in the same manner as the encoder.
  • FIG. 17 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • the index mapping table may be updated.
  • the global cumulative occurrence number of the table index 3 may be increased by one.
  • the index mapping table can be updated because it is greater than 10, the cumulative number of occurrences of the upper table index. Groups using global cumulative variables use the global cumulative counter, so the cumulative occurrence count is not initialized.
  • 10 is set as a threshold and the index mapping table is set when the number of occurrences of the table index is 10 or more. Can be updated.
  • the threshold of group 1 of FIG. 17 is called the global cumulative occurrence number of a table having a code number less than the current code number and the threshold value of group 2 is 1. lets do it.
  • a table index corresponding to group 1 it is possible to determine whether to update the table by comparing the cumulative occurrence times with the higher code number.
  • a table index corresponding to group 2 occurs, an unconditional table update occurs.
  • the threshold may be determined as the global cumulative occurrence number of a table index having a code number smaller than the current code number, as described above, and the mapping index table is updated using the aforementioned global cumulative occurrence count. Can be updated using any method.
  • the decoder may receive a code number and increase the number of occurrences of a table index value corresponding to the code number, and a swapping process of the inverse index mapping table may occur in the same manner as the encoder.
  • FIG. 18 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • the cumulative occurrence number for each symbol may be 1/2.
  • the cumulative occurrence number may be normalized to prevent the cumulative occurrence number from increasing. For example, a method of dividing a cumulative occurrence number of symbols by a maximum value / minimum value of a cumulative occurrence number of times, a method of dividing a cumulative occurrence number of symbols by a half or a specific value when the cumulative occurrence number of symbols is a specific value or more, Various methods can be used, such as a method of calculating by giving different weights to the cumulative occurrence number.
  • the decoder may receive a code number and increase the number of occurrences of a table index value corresponding to the code number, and a swapping process of the inverse index mapping table may occur in the same manner as the encoder.
  • FIG. 19 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • a different weight may be given to the cumulative occurrence count to normalize the occurrence count of the table index. For example, since the symbols located at the top of the index mapping table have a high probability of occurrence, the normalization is performed by giving a higher weight to the cumulative number of occurrences of the symbols located at the top, thereby reducing the reduction in the number of occurrences of the upper symbols. Normalization can be performed by the cumulative number of occurrences reflecting the tendency of the index. As another method, the cumulative occurrence number may be normalized by dividing the cumulative occurrence number into predetermined intervals and applying different weight values to each interval.
  • a weight table may be placed, and the weight table may be multiplied by the weight table and the number of occurrences to have a normalized value.
  • the decoder may perform the same normalization process as described above.
  • FIG. 20 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • the index mapping table may be updated based on a difference value of the global accumulation count. For example, if the difference between the number of occurrences of the table index mapped in order of the code number is small, the difference between the code number 1 and the code number 0 is -2, the difference between the code number 2 and the code number 1 is 0, The difference between the code number 3 and the code number 2 is -4, and the difference between the code number 4 and the code number 3 is 1, and the difference between the cumulative occurrences of the table indexes mapped to the code number may be calculated. When the difference value of the cumulative occurrence number is greater than 0, the index mapping table may be rearranged when the number of occurrences of the table index is greater than the lower code number than the upper code number. If the difference value of the cumulative occurrence count is set to a threshold value other than 0, the index mapping table may be rearranged.
  • a method (B) of updating an index mapping table based on the cumulative occurrence count may also be used.
  • the index mapping table may be sorted.
  • the decoder may receive a code number and increase the number of occurrences of a table index value corresponding to the code number, and a swapping process of the inverse index mapping table may occur in the same manner as the encoder.
  • 21 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • FIG. 21 there is shown a method of sharing a counter by grouping symbols having similar characteristics in performing a grouping to calculate a cumulative occurrence number.
  • Table 1 below shows the prediction mode and the division method corresponding to the prediction mode.
  • the prediction mode and the split mode according to the prediction mode may be grouped into three groups according to the prediction mode.
  • a specific symbol when calculating a cumulative occurrence count, a specific symbol may be grouped based on the characteristics of the symbol, and when a table index corresponding to each group occurs, the global and local cumulative occurrence counts of the corresponding group are increased. You can.
  • the cumulative occurrence number of a group including the table index value 7 may be increased.
  • the codeword value mapped to the grouped table index value may be changed. That is, the code number mapped to the table index value included in the group may be changed based on the number of occurrences accumulated for each group.
  • the decoder may receive a code number and increase the number of occurrences of a table index value corresponding to the code number, and a swapping process of the inverse index mapping table may occur in the same manner as the encoder.
  • 22 is a conceptual diagram illustrating a method of updating an index mapping table according to an embodiment of the present invention.
  • counting may be performed by applying different weights for each symbol to a joint coded symbol.
  • a cu_split_pred_part_mode symbol encoded by combining split_coding_unit_flag, merge_flag, PredMode, and PartMode may be indexed as shown in Table 2 below.
  • the cu_split_pred_part_mode indexed in Table 2 can be indexed using a counter as shown in Table 3 below.
  • the indexed cu_split_pred_part_mode may be counted using one counter for symbol values 0 to 4, and one counter for symbol values 5 to 7 is used. Can be indexed. That is, Counter # 6 can perform counting when three combinations of PredMode and PartMode (symbol value indexes 5, 6, and 7) occur.
  • a method of counting the number of occurrences of a corresponding symbol by applying the same counter to three combinations of two symbols that is, applying a counter for counting the number of occurrences of a specific symbol may be used.
  • counting can be performed on the index values.
  • one counter may be applied to each symbol index, but one counter may be applied to a plurality of specific symbol indices to count the number of occurrences of the symbol.
  • the information used for updating the inverse index mapping table in the decoder is basically the same as the information used for updating the index mapping table in the encoder, and the methods of updating the table are also the same.
  • the input is a table index and the code number that is mapped to the table index is updated.
  • the code index is the input value and the table index that is mapped to the code number or code number is swapped so that the reverse index mapping table There is a difference in that it is updated.
  • an embodiment of the present invention discloses a method of updating a reverse index mapping table by swapping table indexes, it is also possible to update by swapping code numbers, and such embodiments are also included in the scope of the present invention.
  • the reverse index mapping table updating process which is a decoding process of some of the contents disclosed in FIGS. 4 to 22, will be described. It can be done in the decoding method in the reverse direction and such embodiments are also included in the scope of the present invention.
  • 23 is a flowchart illustrating a decoding method according to an embodiment of the present invention.
  • the input codeword is mapped to a code number by referring to the inverse codeword mapping table, and the mapped code number is calculated as a table index (step S2300).
  • the codeword generated through the encoding step may be input, and the received codeword may be mapped to a code number. That is, the decoding process may be performed in a reverse process of the encoding step, and the mapping may be performed by the code number. The calculated code number may be restored to a symbol value using the index mapping table.
  • the reverse index mapping table is updated (step S2310).
  • the decoding method like the encoding method, maps an input codeword to a code number by referring to an inverse codeword mapping table, calculates the mapped code number as a table index, accumulates the number of occurrences of the code number, and consecutive generation of the code number.
  • a method of updating the inverse index mapping table based on at least one of the number of times, the sub-decoding information of the neighboring block, and the threshold information for updating the inverse index mapping table may be used.
  • the inverse index mapping table may be updated in the same manner as the index mapping table is updated in the encoding process.
  • only a part of the inverse index mapping table updating process is started, but all of the index mapping table updating processes disclosed in the above-described encoding process may be used and are included in the scope of the present invention.
  • 24 is a conceptual diagram illustrating a method of updating a reverse index mapping table according to an embodiment of the present invention.
  • the table index value mapped to the code number is mapped to the upper code number.
  • 25 is a conceptual diagram illustrating a method of updating a reverse index mapping table according to an embodiment of the present invention.
  • the inverse index mapping table may be updated based on the global accumulation count.
  • the global cumulative occurrence number may increase the number of occurrences of the table index 1 corresponding to the received code number after receiving the code number.
  • the index mapping table may be updated so that a small code number is mapped to a large global cumulative number based on the global cumulative number of increased table index occurrences.
  • 26 is a conceptual diagram illustrating a method of updating an inverse index mapping table according to an embodiment of the present invention.
  • the global cumulative occurrence number of the corresponding table index may be increased to a value greater than one. For example, if the threshold number of consecutive occurrences is set to 6 and a specific code number occurs more than six times in a row, the global cumulative occurrence number of the corresponding table index may be increased by two instead of one. By increasing the number of global cumulative occurrences in this way, when a large number of specific code numbers occur, the index mapping table can be updated to reflect this tendency.
  • FIG. 27 is a conceptual diagram illustrating a reverse index mapping table update method according to an embodiment of the present invention.
  • the inverse index mapping table may be updated using the number of consecutive occurrences of the code number as a threshold. For example, when the threshold of the number of consecutive occurrences of the code number for updating the reverse index mapping table is 3, the reverse index mapping table may be updated when the specific code number occurs 4 times consecutively.
  • the decoder may adjust the size of the threshold according to the number of consecutive occurrences of a specific code number, the accumulated number of occurrences of a specific code number, and the decoding information of a neighboring block.
  • FIG. 28 is a conceptual diagram illustrating a method of updating an inverse index mapping table according to an embodiment of the present invention.
  • an inverse index mapping table may be updated according to a cumulative occurrence of a symbol value or a table index. For example, when the code number is 3, the cumulative occurrence count of the table index value corresponding to the code number 3 may be increased. Based on the increased cumulative occurrence count, the table index value and the table index value having the smallest code number among the table indexes having the smallest cumulative occurrence count are smaller than their own code numbers. The table index value and the current table index value of a code number existing in a plurality of steps rather than a step up based on the global cumulative occurrence count may be exchanged.
  • 29 is a conceptual diagram illustrating a method of updating an inverse index mapping table according to an embodiment of the present invention.
  • the inverse index mapping table may be updated using a plurality of steps.
  • the inverse index mapping table can be updated by comparing the global cumulative occurrence count with the global cumulative occurrence count of a table index having a code number one less than the current code number 3.
  • the cumulative number of occurrences is compared by comparing the table index value with the one that is less than the updated code number and the incremented table index value based on the updated code number and the table index value. If the global cumulative occurrence count of the increased table index value is larger, the table index value with one smaller code number and the table index value with the increased cumulative occurrence number can be exchanged. That is, the index mapping table may be updated through a plurality of comparison steps.
  • FIG. 30 is a conceptual diagram illustrating a reverse index mapping table update method according to an embodiment of the present invention.
  • a table index mapped to a code number continuously generated based on the number of consecutive occurrences is swapped with a table index mapped to a code number of a plurality of levels. Can be updated.
  • the size of updating the table indexes on the inverse index mapping table is set to 3, and the code number of one or more steps above the code number of the consecutively generated code number is set. You can exchange table index values with table index values for the current code number.
  • FIG. 31 is a conceptual diagram illustrating a part of an image decoding device according to an embodiment of the present invention.
  • the image decoding apparatus may include a table index calculator 3100 and an inverse index mapping table calculator 3150.
  • the table index calculator may map an input codeword to a code number by referring to an inverse codeword mapping table and calculate the mapped code number as a table index.
  • the inverse index mapping calculator 3150 performs an inverse index based on at least one of information on a cumulative number of occurrences of a code number, a number of consecutive occurrences of a code number, encoding and decoding of neighboring blocks, and threshold information for updating an inverse index mapping table. You can update the mapping table.
  • the inverse index mapping calculator may perform the above-described inverse index mapping table update process and normalization process.
  • FIGS. 3 to 30 may be performed in some of the image encoder and the image decoder disclosed in FIGS. 1 and 2, and these embodiments are included in the scope of the present invention.

Landscapes

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

Abstract

La présente invention concerne un procédé de codage entropique utilisant une table de mise en correspondance d'indices et un appareil utilisant ledit procédé. Un procédé de décodage d'image comprend : une étape de mise en correspondance d'un mot de code entré avec un numéro de code en référence à une table de mise en correspondance inverse de mots de code, suivie du calcul du numéro de code mis en correspondance pour former un indice de la table ; et une étape de mise à jour de la table de mise en correspondance inverse sur la base du nombre accumulé d'occurrences du numéro de code, du nombre d'occurrences séquentielles du numéro de code, des informations de codage/décodage du bloc voisin et/ou des informations de valeur de seuil afin de mettre à jour la table de mise en correspondance d'indices inverse. Selon la présente invention, une table de mise en correspondance d'indices est réalignée sur la base d'une certaine condition, améliorant de cette façon l'efficacité du codage/décodage.
PCT/KR2012/000540 2011-01-20 2012-01-20 Procédé de codage entropique utilisant une table de mise en correspondance d'indices, appareil et procédé de codage/décodage d'image utilisant ledit procédé de codage entropique WO2012099433A2 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US13/980,521 US9053525B2 (en) 2011-01-20 2012-01-20 Entropy coding method using an index mapping table, and image-encoding/decoding apparatus and method using said entropy coding method

Applications Claiming Priority (8)

Application Number Priority Date Filing Date Title
KR10-2011-0005707 2011-01-20
KR20110005707 2011-01-20
KR10-2011-0049246 2011-05-24
KR1020110049246A KR20120084639A (ko) 2011-01-20 2011-05-24 엔트로피 부호화를 위한 적응적 정렬 테이블
KR20110092189A KR20120084648A (ko) 2011-01-20 2011-09-09 엔트로피 부호화를 위한 적응적 정렬 테이블
KR10-2011-0092189 2011-09-09
KR10-2012-0006574 2012-01-20
KR20120006574A KR20120084688A (ko) 2011-01-20 2012-01-20 인덱스 매핑 테이블을 이용한 엔트로피 코딩 방법 및 이러한 방법을 사용하는 영상 부호화/복호화 장치 및 방법

Publications (2)

Publication Number Publication Date
WO2012099433A2 true WO2012099433A2 (fr) 2012-07-26
WO2012099433A3 WO2012099433A3 (fr) 2012-12-06

Family

ID=46516264

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2012/000540 WO2012099433A2 (fr) 2011-01-20 2012-01-20 Procédé de codage entropique utilisant une table de mise en correspondance d'indices, appareil et procédé de codage/décodage d'image utilisant ledit procédé de codage entropique

Country Status (1)

Country Link
WO (1) WO2012099433A2 (fr)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040070525A1 (en) * 2002-06-20 2004-04-15 Nokia Corporation Method and a system for variable-length decoding, and a device for the localization of codewords
US20050146451A1 (en) * 2002-04-26 2005-07-07 Ntt Docomo, Inc. Signal encoding method, signal decoding method, signal encoding apparatus, signal decoding apparatus, signal encoding program, and signal decoding program
US20060158355A1 (en) * 2005-01-14 2006-07-20 Sungkyunkwan University Methods of and apparatuses for adaptive entropy encoding and adaptive entropy decoding for scalable video encoding
US20090153378A1 (en) * 2002-04-25 2009-06-18 Shunichi Sekiguchi Digital signal coding apparatus, digital signal decoding apparatus; digital signal arithmetic coding method, and digital signal arithmetic decoding method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090153378A1 (en) * 2002-04-25 2009-06-18 Shunichi Sekiguchi Digital signal coding apparatus, digital signal decoding apparatus; digital signal arithmetic coding method, and digital signal arithmetic decoding method
US20050146451A1 (en) * 2002-04-26 2005-07-07 Ntt Docomo, Inc. Signal encoding method, signal decoding method, signal encoding apparatus, signal decoding apparatus, signal encoding program, and signal decoding program
US20040070525A1 (en) * 2002-06-20 2004-04-15 Nokia Corporation Method and a system for variable-length decoding, and a device for the localization of codewords
US20060158355A1 (en) * 2005-01-14 2006-07-20 Sungkyunkwan University Methods of and apparatuses for adaptive entropy encoding and adaptive entropy decoding for scalable video encoding

Also Published As

Publication number Publication date
WO2012099433A3 (fr) 2012-12-06

Similar Documents

Publication Publication Date Title
US11076175B2 (en) Video encoding method for encoding division block, video decoding method for decoding division block, and recording medium for implementing the same
KR102015374B1 (ko) 색차 성분 양자화 매개 변수 결정 방법 및 이러한 방법을 사용하는 장치
KR101937213B1 (ko) 인트라 예측 모드 부호화/복호화 방법 및 컴퓨터로 읽을 수 있는 기록 매체
CN106576172B (zh) 用于编码/解码图像的方法和使用该方法的装置
US9686551B2 (en) Content adaptive entropy coding of partitions data for next generation video
US10623742B2 (en) Method of determining binary codewords for transform coefficients
US9270988B2 (en) Method of determining binary codewords for transform coefficients
US20130188729A1 (en) Method of determining binary codewords for transform coefficients
US20170041606A1 (en) Video encoding device and video encoding method
CN111742552B (zh) 环路滤波的方法与装置
US8938001B1 (en) Apparatus and method for coding using combinations
KR20120084688A (ko) 인덱스 매핑 테이블을 이용한 엔트로피 코딩 방법 및 이러한 방법을 사용하는 영상 부호화/복호화 장치 및 방법
JP2024506213A (ja) 符号化復号方法、装置及びそのデバイス
WO2012099433A2 (fr) Procédé de codage entropique utilisant une table de mise en correspondance d'indices, appareil et procédé de codage/décodage d'image utilisant ledit procédé de codage entropique
WO2012118359A2 (fr) Procédé permettant de déterminer un paramètre de quantification de composant de différence de couleur et dispositif utilisant ledit procédé
KR20120095814A (ko) 복수 참조 영상을 이용한 영상 부복호화 방법 및 이러한 방법을 사용하는 장치
WO2022174467A1 (fr) Procédé de prédiction intra-trame, codeur, décodeur, et support de stockage
JP4847423B2 (ja) 動画像符号化装置、および、コンピュータプログラム
KR101802304B1 (ko) 하다마드 변환을 이용한 부호화 방법 및 이러한 방법을 사용하는 장치
CN115834882A (zh) 一种帧内预测方法、装置、电子设备及存储介质
WO2012115434A2 (fr) Procédé permettant de coder et de décoder des images au moyen d'une pluralité d'images de référence et dispositif utilisant ce procédé
KR20130107611A (ko) 상향식 예측 모드 방법을 사용한 영상 부복호화 방법 및 이러한 방법을 사용하는 장치
KR20120100838A (ko) 적응적 임계치를 이용한 엔트로피 부복호화 방법 및 이러한 방법을 사용하는 장치
JP2016127486A (ja) インデックス演算装置、プログラム及び方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 12737046

Country of ref document: EP

Kind code of ref document: A2

WWE Wipo information: entry into national phase

Ref document number: 13980521

Country of ref document: US

NENP Non-entry into the national phase in:

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 12737046

Country of ref document: EP

Kind code of ref document: A2