US20120294361A1 - Image coding apparatus - Google Patents

Image coding apparatus Download PDF

Info

Publication number
US20120294361A1
US20120294361A1 US13/575,373 US201113575373A US2012294361A1 US 20120294361 A1 US20120294361 A1 US 20120294361A1 US 201113575373 A US201113575373 A US 201113575373A US 2012294361 A1 US2012294361 A1 US 2012294361A1
Authority
US
United States
Prior art keywords
frames
macroblocks
frame
determination part
intra
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US13/575,373
Other languages
English (en)
Inventor
Hiromu Hasegawa
Toshimitsu Tatsuka
Takeaki Komuro
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
MegaChips Corp
Original Assignee
MegaChips Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by MegaChips Corp filed Critical MegaChips Corp
Assigned to MEGACHIPS CORPORATION reassignment MEGACHIPS CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: HASEGAWA, HIROMU, KOMURO, TAKEAKI, TATSUKA, TOSHIMITSU
Publication of US20120294361A1 publication Critical patent/US20120294361A1/en
Abandoned legal-status Critical Current

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/17—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 an image region, e.g. an object
    • H04N19/176—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 an image region, e.g. an object the region being a block, e.g. a macroblock
    • 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/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
    • H04N19/103—Selection of coding mode or of prediction mode
    • H04N19/107—Selection of coding mode or of prediction mode between spatial and temporal predictive coding, e.g. picture refresh
    • 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/17—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 an image region, e.g. an object
    • H04N19/172—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 an image region, e.g. an object the region being a picture, frame or field

Definitions

  • the present invention relates to an apparatus for coding images to generate compressed images, and more particularly to an apparatus which uses an intra coding process and an inter coding process to code images.
  • an intra coding process and an inter coding process are used.
  • the intra coding process coding is completed within a frame to be coded, without using any reference frames.
  • the inter coding process coding for a frame to be coded is performed by using one or more reference frames.
  • All macroblocks included in an I picture are coded by the intra coding process.
  • Macroblocks included in a P picture and a B picture are coded by the inter coding process. Since all the macroblocks in the I picture are intra-coded, the amount of generated codes in the I picture is larger than that in the P picture or the B picture. Even in the H.264 where an intra prediction technique is used, the amount of generated codes in the I picture is still larger than that in the P picture or the B picture.
  • Non-Patent Document 1 a compressed image data including an I picture in which all macroblocks in a frame are intra-coded is not appropriate for a low-delay system since there is a possibility of causing a delay in the processing of the I picture. Then, proposed is a coding method shown in Non-Patent Document 1.
  • Non-Patent Document 1 no I picture in which all macroblocks in a frame are intra-coded is used.
  • intra macroblocks are arranged on a slice-by-slice basis. All macroblocks in a slice within a frame are coded as intra macroblocks to be directly subjected to DCT without using any prediction. Such a slice is termed an “intraslice”. By shifting a place to which the intraslice is applied on a frame-by-frame basis, the intraslice makes the rounds of the whole screen in a certain cycle and the screen is thereby refreshed. Since the amount of generated codes required for the intraslice is smaller than that required for the I picture, it is possible to reduce the buffer size and decrease the delay.
  • Non-Patent Document 2 similarly, disclosed is a technique using the intraslice.
  • Non-Patent Documents 1 and 2 With the intraslice, it is possible to disperse intrablocks in a GOP (Group of Pictures).
  • the intra macroblocks are dispersed on a macroblock-by-macroblock basis. Even in a case using the technique shown in Patent Document 1, since the intra macroblocks are moved at certain intervals, the positions of the intra macroblocks are disadvantageously noticeable.
  • the present invention is intended for an image coding apparatus.
  • the image coding apparatus comprises a block count determination part for determining the number of intra macroblocks to be included in each frame, a position determination part for determining respective spatial positions of the intra macroblocks to be included in each frame in the frame, and a coding part for arranging the intra macroblocks, the number of which is determined by the block count determination part, in each frame on the basis of the positions determined by the position determination part, to thereby perform coding.
  • the position determination part arranges the intra macroblocks to be included in each frame at random positions in the frame.
  • the intra macroblocks are dispersed in a time direction. This technique is adaptable to a low-delay system. Further, it is possible to reduce the buffer size.
  • the intra macroblocks can be arranged at random in a spatial direction.
  • the boundaries of the intra macroblocks thereby become unnoticeable and it is therefore possible to improve the image quality.
  • the image coding apparatus comprises a position determination part for determining respective spatial positions of intra macroblocks to be included in each frame in the frame; and a coding part for arranging the intra macroblocks in each frame on the basis of the positions determined by the position determination part, to thereby perform coding.
  • the position determination part arranges the intra macroblocks so that there is a difference in the motion of the intra macroblocks in a time direction between even-numbered frames and odd-numbered frames.
  • FIG. 1 is a block diagram showing an image coding apparatus
  • FIG. 2 is a view showing a frame image consisting of macroblocks M 0 to M 23 ;
  • FIG. 3 is a view showing patterns for the number of macroblocks to be allocated in a time direction
  • FIG. 4 is a view showing a number row L 1 for macroblocks and a number row L 2 for shuffled macroblocks;
  • FIG. 5 is a view showing block numbers of macroblocks to be intra-coded in each of frames
  • FIG. 6 is a view showing a spatial arrangement of the intra macroblocks in each of the frames
  • FIG. 7 is a view showing a frame number of the frame in which each macroblock is to be intra-coded
  • FIG. 8 is a view showing the number of allocated macroblocks to be intra-coded in each of the frames
  • FIG. 9A is a view showing an exemplary arrangement of intra macroblocks, which is achieved by using a function
  • FIG. 9B is a view showing another exemplary arrangement of intra macroblocks, which is achieved by using a function
  • FIG. 9C is a view showing still another exemplary arrangement of intra macroblocks, which is achieved by using a function
  • FIG. 9D is a view showing yet another exemplary arrangement of intra macroblocks, which is achieved by using a function.
  • FIG. 9E is a view showing a further exemplary arrangement of intra macroblocks, which is achieved by using a function.
  • FIG. 1 is a block diagram showing an image coding apparatus 1 in accordance with a first preferred embodiment.
  • the image coding apparatus 1 comprises a coding part 11 , a block count determination part 12 , and a position determination part 13 .
  • the coding part 11 receives uncompressed image data 21 .
  • the coding part 11 performs an image coding process on the received uncompressed image data 21 , to thereby output compressed image data 22 .
  • the coding part 11 performs the image coding process using a coding system such as MPEG2, H.264, or the like.
  • the block count determination part 12 determines the number of intra macroblocks to be allocated to each frame.
  • the image coding apparatus 1 of the first preferred embodiment does not use any I picture in which all macroblocks are intra-coded.
  • the image coding apparatus 1 of the first preferred embodiment arranges the intra macroblocks dispersedly in a time direction.
  • the block count determination part 12 determines allocation of the intra macroblocks in the time direction.
  • the block count determination part 12 arranges the intra macroblocks so that all the macroblocks in a frame may be intra-coded once within a refresh cycle.
  • a group of images in the refresh cycle corresponds to one GOP (Group of Pictures).
  • the position determination part 13 determines respective positions of the intra macroblocks in a spatial direction in each frame.
  • the position determination part 13 arranges the intra macroblocks in each frame so that all the macroblocks in one frame may be intra-coded once within the refresh cycle.
  • the block count determination part 12 determines the number of intra macroblocks to be allocated to each frame.
  • FIG. 2 a case where one frame consists of twenty-four macroblocks M 0 to M 23 is taken as an example.
  • One frame consists of six macroblocks wide and four macroblocks long.
  • discussion will be made assuming that the refresh cycle corresponds to ten frames. In other words, during the elapse of ten frames, all the macroblocks M 0 to M 23 need to be intra-coded once.
  • the block count determination part 12 allocates timings at which the twenty-four macroblocks are intra-coded so that the timings may be dispersed as evenly as possible in the ten frames. First, the block count determination part 12 divides the number M of macroblocks in one frame by the number N of frames in the refresh cycle, as expressed by the following Eq. 1.
  • Eq. 1 S is the quotient of M divided by N and R is the remainder. M, N, S, and R are all positive integers. R is an integer smaller than N.
  • Eq. 1 can be expressed by the following Eq. 2.
  • the block count determination part 12 first determines to allocate two intra macroblocks to each of all the frames. The block count determination part 12 further evenly allocates the remaining four intra macroblocks within the refresh cycle.
  • the block count determination part 12 first determines to allocate S intra macroblocks to each of all the frames.
  • the block count determination part 12 further evenly allocates the remaining R intra macroblocks within the refresh cycle. When the remainder R is 0, processing is completed by allocating S intra macroblocks to each of all the frames.
  • the block count determination part 12 divides the number N of frames in the refresh cycle by the remainder R, as expressed by the following Eq. 3.
  • Eq. 3 D is the quotient of N divided by R and Q is the remainder. D is a positive integer. Q is a positive integer smaller than R.
  • Eq. 3 can be expressed by the following Eq. 4.
  • the block count determination part 12 determines to dispersedly dispose two of the remaining four intra macroblocks at an interval of two frames and the other two of the remaining four intra macroblocks at an interval of three frames.
  • the block count determination part 12 determines to dispersedly dispose (R ⁇ Q) of the remaining R intra macroblocks at an interval of D frames and Q of the remaining R intra macroblocks at an interval of (D+1) frames.
  • R ⁇ Q dispersedly dispose
  • the block count determination part 12 determines allocation on the basis of the following standard rules.
  • (R ⁇ Q) of the remaining R intra macroblocks are dispersedly disposed at an interval of D frames and Q of the remaining R intra macroblocks are dispersedly disposed at an interval of (D+1) frames.
  • the block count determination part 12 allocates (S+1) intra macroblocks to each of (R ⁇ Q) frames which are disposed at an interval of D frames and Q frames which are disposed at an interval of (D+1) frames and allocates S intra macroblocks to each of the remaining (N ⁇ R) frames.
  • the block count determination part 12 arranges the macroblocks dispersedly in the time direction, and since S or (S+1) intra macroblocks are disposed in each of the frames, the difference in the number of intra macroblocks to be allocated to each frame among all the frames is at most one. Further, since the frames each including (S+1) intra macroblocks are disposed at an interval of D frames or (D+1) frames, the difference in the frame interval is at most one.
  • FIG. 3 shows arrangement patterns of the intra macroblocks.
  • FIG. 3 shows the number of intra macroblocks allocated to each of ten frames F 0 to F 9 .
  • Cases 1 , 2 , and 4 do not conform to the above Standard Rule 3.
  • the frames each including (S+1) intra macroblocks are disposed at an interval of D frames or (D+1) frames and the difference in the frame interval is at most one. Cases 1 and 2 largely fall outside this condition.
  • Case 4 from FIG. 3 , the frames each including three intra macroblocks appears to be evenly disposed. Since the frame F 0 follows the frame F 9 , however, the frames each including three intra macroblocks consecutively appear and therefore Case 4 does not conform to this condition for the same reason as that for Cases 1 and 2 .
  • Cases 3 , 5 , and 6 satisfies the above Standard Rule 3.
  • the frames each including three intra macroblocks are concentrated in the frames F 0 to F 4 .
  • the block count determination part 12 determines Cases 5 and 6 as allocation patterns of the intra macroblocks in accordance with the following algorithm.
  • the frames each including (S+1) intra macroblocks include those which are disposed at an interval of D frames and those which are disposed at an interval of (D+1) frames.
  • the block count determination part 12 dispersedly disposes the frames each including (S+1) intra macroblocks so that the (D+1) frame interval may be disposed as evenly as possible in the time direction. It is assumed herein that each of those which are disposed at an interval of (D+1) frames among the frames each including (S+1) intra macroblocks is referred to as a “frame A” and each of those which are disposed at an interval of D frames is referred to as a “frame B”. In FIG. 3 , the frame A and the frame B are indicated distinguishably in Cases 3 , 5 , and 6 .
  • the block count determination part 12 disposes the frames A so that the dispersion in the distance between one frame A and another frame A may be as small as possible. In accordance with this algorithm, Case 3 in which variation in the distance between the frames A is large is excluded. Any one of Cases 5 and 6 may be selected.
  • the block count determination part 12 can take, for example, a rule that the D frame interval is first disposed. In this case, Case 6 is selected.
  • the position determination part 13 determines respective positions of intra macroblocks in a frame in the spatial direction.
  • the position determination part 13 first shuffles a row of macroblock numbers by using random numbers, to thereby generate a new row of macroblock numbers.
  • the macroblocks are given numbers from M 0 to M 23 from the upper left of a frame toward the lower right.
  • the position determination part 13 shuffles a number row L 1 for the macroblocks, in which the numbers are arranged in order from M 0 to M 23 , by using the random numbers and generates such a new number row L 2 for the macroblocks as shown in FIG. 4 .
  • the position determination part 13 next determines the macroblocks to be intra-coded in each frame in accordance with the number of intra macroblocks in each frame which is determined by the block count determination part 12 , as shown in FIG. 5 .
  • the block count determination part 12 selects Case 6 in FIG. 3 .
  • the respective numbers of intra macroblocks in the frames numbered in order of F 0 , F 1 , F 2 . . . , F 9 are determined to be 3, 2, 3, 2, 2, 3, 2, 3, 2, and 2.
  • the position determination part 13 determines the first three macroblocks in the number row L 2 as the macroblocks to be intra-coded in the frame F 0 .
  • the position determination part 13 determines the 4-th and 5-th macroblocks in the number row L 2 as the macroblocks to be intra-coded in the frame F 1 .
  • the position determination part 13 determines the 6-th to 8-th macroblocks in the number row L 2 as the macroblocks to be intra-coded in the frame F 2 .
  • the respective positions of the macroblocks to be intra-coded in each of all the frames are determined.
  • FIG. 6 shows the respective positions of the macroblocks to be intra-coded in each of all the frames.
  • the hatched macroblocks are macroblocks to be intra-coded. It can be seen that the intra macroblocks are irregularly arranged in each frame. It can be also seen that the number of intra macroblocks are arranged in a balanced manner in the time direction.
  • FIG. 7 is a view showing in which frame each macroblock in a frame is to be intra-coded.
  • the matrix of FIG. 7 corresponds to that of FIG. 2 .
  • the macroblock M 0 in FIG. 2 is to be intra-coded in the frame F 2 as shown in FIG. 7 .
  • the macroblock M 8 in FIG. 2 is to be intra-coded in the frame F 7 as shown in FIG. 7 .
  • the coding part 11 codes the uncompressed image data 21 on the basis of the allocation of the macroblocks in the time direction, which is determined by the block count determination part 12 , and the arrangement of the macroblocks in the spatial direction, which is determined by the position determination part 13 .
  • the coding part 11 outputs the compressed image data 22 after coding.
  • the intra macroblocks are randomly arranged in each frame. Since there is no regularity in the arrangement of the intra macroblocks in the spatial direction, the boundary between the intra macroblocks and the inter macroblocks become unnoticeable. This avoids the degradation in image quality due to clear difference in image quality, unlike the case using the intraslice. Further, it is possible to solve the problem that the spatial positions of the intra macroblocks are regularly moved and this causes the intra macroblocks to be noticeable.
  • the number of macroblocks are evenly allocated in the refresh cycle. Therefore, the amount of codes is evenly dispersed. Unlike the case using the I pictures, the amount of codes does not oscillate. This reduces the buffer size and the image data can be used in a low-delay system.
  • a blank frame represents the frame including S intra macroblocks and a hatched frame represents the frame including (S+1) intra macroblocks.
  • R takes a number from 1 to 14, how the frames each including (S+1) intra macroblocks are arranged are shown in this figure.
  • the frames each including (S+1) intra macroblocks are evenly disposed.
  • Some of the hatched frames, which are given the sign “A”, are the above-described frames A and the other hatched frames which are given the sign “B” are the above-described frames B. It can be seen that the hatched frames are evenly disposed and the frames A are also evenly disposed.
  • Case 5 or 6 is selected out of Cases 1 to 6 shown in FIG. 3 . This is a selection according to the purpose that the intra macroblocks are disposed in the spatial direction as evenly as possible and the amount of generated codes is made uniform.
  • This variation uses a method in which the intra macroblocks which are important for image quality are disposed in the first half of the refresh cycle wherever possible.
  • This selection method is effective in a case where the code amount control is performed in a unit of GOP.
  • the code amount control is performed in a unit of GOP, by disposing the intra macroblocks which are important for image quality in the first half of the refresh cycle wherever possible, it is possible to solve a problem that a certain amount of bits to be allocated to the intra macroblocks in the second half of the refresh cycle run short. This is because lack of bits to be allocated to the intra macroblocks causes the degradation in image quality.
  • the block count determination part 12 selects Case 2 .
  • the block count determination part 12 may select Case 3 on the basis of overall determination of the above Standard Rule 3 and the idea that the intra macroblocks should be disposed in the first half wherever possible.
  • Case 6 is finally selected. This selection conforms to the idea of this variation that the intra macroblocks should be disposed in the first half wherever possible.
  • the arrangement of the intra macroblocks is determined by using a function. It is assumed herein that the current frame number is Y 1 and the number of macroblocks in a line direction is Y 2 . As expressed by Eq. 5, it is assumed that the quotient of Y 1 divided by Y 2 is Y 3 and the remainder is Y 4 .
  • Y 5 is determined as expressed by Eq. 7, where a fractional portion of Y 4 /2 is rounded down.
  • the macroblock to be processed is determined to be an intra macroblock.
  • the second preferred embodiment by using a function, it can be determined whether to intra-code each macroblock. Since the intra macroblocks are dispersedly disposed in a frame, no degradation in image quality is caused.
  • the image coding apparatus 1 of the second preferred embodiment comprises no block count determination part 12 shown in FIG. 1 .
  • the position determination part 13 determines the frames in which the intra macroblocks are to be allocated and the position of each of the intra macroblocks in the frame.
  • FIGS. 9A to 9E are views showing the intra macroblocks arranged in accordance with the second preferred embodiment.
  • FIGS. 9A to 9E show frames with Nos. 0 to 4, respectively.
  • the hatched macroblocks represent intra macroblocks.
  • the positions of the intra macroblocks are not random but determined by using the above-discussed function.
  • the second preferred embodiment it is possible to differentiate the moving directions of the intra macroblocks between the even-numbered frames and the odd-numbered frames.
  • the intra macroblocks in all the frames perform the same motion in the time direction, the intra macroblocks become noticeable and this causes degradation in image quality.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
US13/575,373 2010-01-28 2011-01-18 Image coding apparatus Abandoned US20120294361A1 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
JP2010-016241 2010-01-28
JP2010016241A JP5441734B2 (ja) 2010-01-28 2010-01-28 画像符号化装置
PCT/JP2011/050737 WO2011093169A1 (ja) 2010-01-28 2011-01-18 画像符号化装置

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2011/050737 A-371-Of-International WO2011093169A1 (ja) 2010-01-28 2011-01-18 画像符号化装置

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US14/936,075 Division US9693069B2 (en) 2010-01-28 2015-11-09 Image coding apparatus

Publications (1)

Publication Number Publication Date
US20120294361A1 true US20120294361A1 (en) 2012-11-22

Family

ID=44319161

Family Applications (2)

Application Number Title Priority Date Filing Date
US13/575,373 Abandoned US20120294361A1 (en) 2010-01-28 2011-01-18 Image coding apparatus
US14/936,075 Expired - Fee Related US9693069B2 (en) 2010-01-28 2015-11-09 Image coding apparatus

Family Applications After (1)

Application Number Title Priority Date Filing Date
US14/936,075 Expired - Fee Related US9693069B2 (en) 2010-01-28 2015-11-09 Image coding apparatus

Country Status (3)

Country Link
US (2) US20120294361A1 (ja)
JP (1) JP5441734B2 (ja)
WO (1) WO2011093169A1 (ja)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9749624B2 (en) 2012-09-19 2017-08-29 Megachips Corporation Moving image coding apparatus and moving image coding method

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0698295A (ja) * 1992-09-11 1994-04-08 Sanyo Electric Co Ltd 画像圧縮符号化回路
US20060056519A1 (en) * 2001-12-21 2006-03-16 Michael Horowitz Dynamic intra-coded macroblock refresh interval for video error concealment

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3122108B2 (ja) * 1990-02-28 2001-01-09 ソニー株式会社 映像信号符号化方法及びその装置
JPH05244582A (ja) * 1992-02-28 1993-09-21 Fujitsu Ltd ランダムリフレッシュ制御信号発生回路
KR0166725B1 (ko) 1993-06-30 1999-03-20 김광호 강제인트라-프레임부호화방법
JPH08126004A (ja) * 1994-10-21 1996-05-17 Mitsubishi Electric Corp 画像符号化装置
GB9620176D0 (en) * 1996-09-27 1996-11-13 Digi Media Vision Ltd Method and apparatus for encoding data
JP2002176652A (ja) * 2000-12-07 2002-06-21 Matsushita Electric Ind Co Ltd 映像符号化方法及び映像符号化装置
JP2002369208A (ja) * 2001-06-12 2002-12-20 Mitsubishi Electric Corp 映像信号符号化装置および映像信号符号化方法
JP4649615B2 (ja) 2006-02-16 2011-03-16 国立大学法人三重大学 映像符号化、復号化装置および映像符号化、復号化方法、並びにそれらのプログラム
JP2008258952A (ja) 2007-04-05 2008-10-23 Ibex Technology Co Ltd 符号化装置、符号化プログラムおよび符号化方法

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH0698295A (ja) * 1992-09-11 1994-04-08 Sanyo Electric Co Ltd 画像圧縮符号化回路
US20060056519A1 (en) * 2001-12-21 2006-03-16 Michael Horowitz Dynamic intra-coded macroblock refresh interval for video error concealment

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9749624B2 (en) 2012-09-19 2017-08-29 Megachips Corporation Moving image coding apparatus and moving image coding method

Also Published As

Publication number Publication date
US20160065971A1 (en) 2016-03-03
US9693069B2 (en) 2017-06-27
WO2011093169A1 (ja) 2011-08-04
JP2011155543A (ja) 2011-08-11
JP5441734B2 (ja) 2014-03-12

Similar Documents

Publication Publication Date Title
KR102504298B1 (ko) 파티션 기반 인트라 코딩 개념
US10623741B2 (en) Method and apparatus for sub-picture based raster scanning coding order
JP4567551B2 (ja) 参照ピクチャの選択方法
US20180048903A1 (en) Image encoding apparatus, image encoding method, and recording medium; and image decoding apparatus, image decoding method, and recording medium
JP2006521071A5 (ja)
JP5343703B2 (ja) 復号処理装置、復号処理方法、およびプログラム
US20230070926A1 (en) Video encoding and decoding method using tiles and tile groups, and video encoding and decoding device using tiles and tile groups
US8699807B2 (en) Image coding apparatus
US11962785B2 (en) Video encoding method and decoding method using tiles and slices, and video encoding device and decoding device using tiles and slices
US9693069B2 (en) Image coding apparatus
US9554131B1 (en) Multi-slice/tile encoder with overlapping spatial sections
JP2011182284A (ja) 画像符号化装置、画像符号化復号化システム、画像符号化方法、画像表示方法
JP5700728B2 (ja) 画像符号化装置
US8731312B2 (en) Image coding apparatus
JP2022524815A (ja) 実装効率の良いパーティションベースのイントラ符号化概念
US11388414B2 (en) Device and method for allocating code amounts to intra prediction modes
KR20090037410A (ko) 레퍼런스 픽쳐 선택 방법
JP2013110466A (ja) 動画像符号化装置
KR20090037412A (ko) 레퍼런스 픽쳐 선택 방법
KR20090037413A (ko) 레퍼런스 픽쳐 선택 방법
KR20090034841A (ko) 레퍼런스 픽쳐 선택 방법
KR20090037411A (ko) 레퍼런스 픽쳐 선택 방법

Legal Events

Date Code Title Description
AS Assignment

Owner name: MEGACHIPS CORPORATION, JAPAN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:HASEGAWA, HIROMU;TATSUKA, TOSHIMITSU;KOMURO, TAKEAKI;REEL/FRAME:028710/0878

Effective date: 20120605

STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION