US20150181218A1 - Image encoding apparatus, method of image encoding, and recording medium, image decoding apparatus, method of image decoding, and recording medium - Google Patents

Image encoding apparatus, method of image encoding, and recording medium, image decoding apparatus, method of image decoding, and recording medium Download PDF

Info

Publication number
US20150181218A1
US20150181218A1 US14/411,287 US201314411287A US2015181218A1 US 20150181218 A1 US20150181218 A1 US 20150181218A1 US 201314411287 A US201314411287 A US 201314411287A US 2015181218 A1 US2015181218 A1 US 2015181218A1
Authority
US
United States
Prior art keywords
data
block line
tile
block
encoded
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
US14/411,287
Other languages
English (en)
Inventor
Koji Okawa
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.)
Canon Inc
Original Assignee
Canon Inc
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 Canon Inc filed Critical Canon Inc
Assigned to CANON KABUSHIKI KAISHA reassignment CANON KABUSHIKI KAISHA ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: OKAWA, KOJI
Publication of US20150181218A1 publication Critical patent/US20150181218A1/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/70—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by syntax aspects related to video coding, e.g. related to compression standards
    • 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/119—Adaptive subdivision aspects, e.g. subdivision of a picture into rectangular or non-rectangular coding blocks
    • 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/174—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 slice, e.g. a line of blocks or a group of blocks
    • 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/42—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation
    • H04N19/436—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation using parallelised computational arrangements
    • 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/44—Decoders specially adapted therefor, e.g. video decoders which are asymmetric with respect to the encoder
    • 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/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/513—Processing of motion vectors
    • 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/46—Embedding additional information in the video signal during the compression process

Definitions

  • the present invention relates to an image encoding apparatus, a method of image encoding, and a recording medium, an image decoding apparatus, a method of image decoding, and a recording medium.
  • the invention relates to encoding and decoding based on parallel processing of images in which each picture is divided into rectangular tiles.
  • H.264 H.264/MPEG-4 AVC
  • ITU-T H.264 03/2010 Advanced video coding for generic audio visual services
  • each picture can be divided into a plurality of slices and image data can be encoded on a slice-by-slice basis.
  • the slices have little dependence on one another. Accordingly, the slices can be subjected to encoding or decoding in parallel.
  • One of significant benefits of the division into slices is that the execution of parallel processing by, for example, a multicore CPU enables reduction of processing time.
  • each slice is encoded by a related-art binary arithmetic encoding scheme used in H.264.
  • each syntax element is binarized, thus generating a binary signal.
  • Each syntax element is assigned the probability of occurrence as a table (hereinafter, “probability table”) in advance.
  • the binary signal is subjected to arithmetic encoding based on the probability table.
  • the probability table is used as decoding information for decoding subsequent symbols during decoding and is used as encoding information for encoding subsequent symbols during encoding.
  • the probability table is updated based on statistical information indicating whether the encoded binary signal is a symbol assigned higher probability or not.
  • JCT-VC Joint Collaborative Team on Video Coding
  • Wavefront the probability table upon encoding of a plurality of blocks at predetermined positions is used for the left block in the next line, thus achieving parallel encoding of blocks on a line-by-line basis while preventing a reduction in encoding efficiency.
  • Wavefront has been mainly described with respect to encoding, the same applies to decoding.
  • the schemes for enhancing the parallelism include tiling. According to this technique, tiles allow a picture to be divided into rectangular regions that can independently be processed. Thus, high throughput can be achieved by parallel encoding/decoding and the capacity of a memory included in each of an encoding apparatus and a decoding apparatus can be reduced.
  • processing such as tiling or Wavefront
  • a symbol tiles_or_entropy_coding_sync_idc If the symbol has a value of 0, this means that a picture is composed of a single tile and Wavefront parallel processing is not performed. If the symbol has a value of 1, this means that the picture is composed of a plurality of tiles but Wavefront parallel processing is not performed. If the symbol has a value of 2, this means that the picture is composed of a single tile and parallel processing, such as Wavefront, is performed. If the symbol has a value of 3, this means that the picture is composed of a single tile, Wavefront parallel processing is not performed, and entropy slices which can independently be decoded are used.
  • the present invention provides an encoding format that enables multi-stage parallel processing to enhance parallelism of processes and achieve high-speed encoding and decoding.
  • the present invention provides an image decoding apparatus that decodes encoded data obtained by dividing a frame of image data into rectangular tiles and encoding the image data on a tile-by-tile basis, the apparatus including the following elements.
  • a deriving unit is configured to derive tile data division information, tile data position information, block line data division information, and block line data position information from the encoded data.
  • the tile data division information indicates whether the encoded data is composed of tile data items that serve as encoded data items of the tiles.
  • the tile data position information indicates positions of the tile data items.
  • the block line data division information indicates whether each tile data item is composed of first block line data and second block line data, the first block line data serving as encoded data of a first block line that is a set of blocks arranged linearly, the second block line data serving as encoded data of a second block line next to the first block line.
  • the block line data position information indicates a position of the second block line data.
  • a first decoding unit is configured to decode the first block line data based on the information derived by the deriving unit.
  • a second decoding unit is configured to decode the second block line data based on the information derived by the deriving unit and decoding information obtained by decoding encoded data of a block in a predetermined position belonging to the first block line.
  • an encoding format that enables multi-stage parallel processing is provided, thus enhancing the parallelism of processes and achieving high-speed encoding and decoding.
  • FIG. 1 is a diagram illustrating an image encoding format to be decoded by an image decoding apparatus according to a first embodiment.
  • FIG. 2 is a diagram illustrating division of an image into tiles.
  • FIG. 3 is a diagram illustrating division of a tile into block lines.
  • FIG. 4 is a block diagram illustrating a configuration of each of the image decoding apparatus according to the first embodiment and an image decoding apparatus according to a second embodiment.
  • FIG. 5 is a flowchart illustrating an operation of the image decoding apparatus according to each of the first and second embodiments.
  • FIG. 6 is a flowchart illustrating a process of top block line decoding in each of the first and second embodiments.
  • FIG. 7 is a flowchart illustrating a process of non-top block line decoding in the first and second embodiments.
  • FIG. 8 is a flowchart illustrating a process of block decoding in the first and second embodiments.
  • FIG. 9 is a flowchart illustrating a process of determination of the size of tile data in the first embodiment.
  • FIG. 10 is a diagram illustrating an image encoding format to be decoded by the image decoding apparatus according to the second embodiment.
  • FIG. 11 is a flowchart illustrating a method of determination of the size of tile data in the second embodiment.
  • FIG. 12 is a flowchart illustrating a method of determination of the size of block line data in the second embodiment.
  • FIG. 13 is a block diagram illustrating a configuration of an image encoding apparatus according to each of a third embodiment and a fourth embodiment.
  • FIG. 14 is a flowchart illustrating an operation of the image encoding apparatus according to the third embodiment.
  • FIG. 15 is a flowchart illustrating a process of top block line encoding in the third embodiment.
  • FIG. 16 is a flowchart illustrating a process of block encoding in the third embodiment.
  • FIG. 17 is a flowchart illustrating a process of non-top block line encoding in the third embodiment.
  • FIG. 18 is a flowchart illustrating a process of calculating position information in the third embodiment.
  • FIG. 19 is a block diagram illustrating a configuration of each tile decoding unit in the first and second embodiments.
  • FIG. 20 is a flowchart illustrating a process of tile decoding in the first and second embodiments.
  • FIG. 21 is a flowchart illustrating a process of determination of the size of block line data in the first embodiment.
  • FIG. 22 is a flowchart illustrating a process of calculating position information in the fourth embodiment.
  • FIG. 23 is a block diagram illustrating a configuration of each tile encoding unit in the third and fourth embodiments.
  • FIG. 24 is a flowchart illustrating a process of tile encoding in the third and fourth embodiments.
  • FIG. 25 is a block diagram illustrating an exemplary configuration of hardware of a computer applicable to each decoding apparatus according to the present invention.
  • each block is composed of 16 horizontal pixels ⁇ 16 vertical pixels and encoding or decoding is performed on a block-by-block basis.
  • each block is composed of 16 ⁇ 16 pixels in the present embodiment, the present invention is not limited thereto.
  • Each block may be composed of 32 ⁇ 32 pixels or 64 ⁇ 64 pixels.
  • each tile is composed of 240 horizontal blocks ⁇ 135 vertical blocks.
  • the tile is further divided into a plurality of block lines.
  • Each block line is a set of blocks arranged linearly in the tile as illustrated in FIG. 3 .
  • each square defined by thin lines denotes a block 301 and each rectangle defined by thick lines denotes a block line 302 .
  • FIG. 1 illustrates a format of HEVC-encoded data in the present embodiment.
  • the encoded data includes a sequence parameter set that is header information containing information about sequence encoding.
  • the encoded data further includes a picture parameter set that is header information containing information about picture encoding, a slice header that is header information containing information about slice encoding, and multiple encoded data items of tiles.
  • the picture parameter set includes tile data division information and block line data division information.
  • the slice header includes tile data position information and block line data position information.
  • the picture parameter set includes, as the tile data division information, a flag TileFlag indicating whether a frame has been divided into tiles and image data of each tile has been encoded. If the flag TileFlag has a value of 1, this indicates that the frame has been divided into tiles and image data of each tile has been encoded. If the flag TileFlag does not have a value of 1, this indicates that the frame encoded has not been divided into tiles. In the case where the flag TileFlag has a value of 1, information num_tile_columns_minus1 indicating the number of horizontal tiles in the frame, information num_tile_rows_minus1 indicating the number of vertical tiles, and a flag uniform_spacing_flag indicating the shape of a tile are arranged.
  • the information num_tile_columns_minus1 has a value obtained by subtracting 1 from the actual number of horizontal tiles in the frame.
  • the information num_tile_rows_minus1 has a value obtained by subtracting 1 from the actual number of vertical tiles. Referring to FIG. 1 , N denotes the number of tiles in a slice, the number of tiles being uniquely determined by (num_tile_columns_minus1+1) ⁇ (num_tile_rows_minus1 +1).
  • the flag uniform_spacing_flag indicates whether the tiles in the frame have the same size. If this flag has a value of 1, this indicates that the tiles have the same size.
  • the picture parameter set includes, as the block line data division information, a flag WPPFlag. If the flag WPPFlag has a value of 1, this indicates that each of the tiles has been divided into block lines and image data of each block line has been encoded.
  • the block line data division information and the tile data division information include different flags in the present embodiment, the present invention is not limited thereto. It is only required to know that tile data division and block line data division are used in combination. For example, a syntax element indicating the combination of the two flags may be provided and be defined as follows.
  • this syntax element has a value of 0, this means the absence of tile data division and block line data division. If the syntax element has a value of 1, this means the presence of tile data division and the absence of block line data division. If the syntax element has a value of 2, this means the absence of tile data division and the presence of block line data division. If the syntax element has a value of 3, this means the presence of tile data division and block line data division.
  • the slice header includes the tile data position information if the flag TileFlag has a value of 1, and further includes the block line data position information if the flag WPPFlag has a value of 1.
  • the tile data position information includes a syntax element num_tile_entry_point_offsets and syntax elements tile_entry_point_offset.
  • the block line data position information includes sets equal in number to the tiles, each set including a syntax element num_wpp_entry_point_offsets and syntax elements wpp_entry_point_offset.
  • the syntax element num_tile_entry_point_offsets has a value obtained by subtracting 1 from N that indicates the number of tiles in the slice.
  • the syntax element num_wpp_entry_point_offsets has a value obtained by subtracting 1 from M that indicates the number of block lines in the tile. If the flag TileFlag has a value of 0, the syntax element num_tile_entry_point_offsets is treated as having a value of 0. If the flag WPPFlag has a value of 0, a symbol corresponding to the syntax element num_wpp_entry_point_offsets is omitted and the syntax element num_wpp_entry_point_offsets is treated as having a value of 0.
  • the syntax element num_tile_entry_point_offsets indicates the number of entry points of encoded data items of the tiles in the slice.
  • the number of entry points of encoded data items of the tiles is uniquely determined by the number of tiles included in the slice. When the number of tiles is 2, the number of entry points is 1. When the number of tiles is 4, the number of entry points is 3.
  • the frame is composed of a single slice including four tiles. That is, the syntax element num_tile_entry_point_offsets has a value of 3.
  • the syntax elements tile_entry_point_offset each indicate an entry point of encoded data of the tile, namely, a leading position of the encoded data of the tile.
  • the number of syntax elements tile_entry_point_offset is equal to the value indicated by the syntax element num_tile_entry_point_offsets.
  • a syntax element tile_entry_point_offset[i] indicates an entry point of encoded data of the ith tile. Since it is known that encoded data of the zeroth tile (Tile 0 ) immediately follows the slice header, an entry point of the zeroth tile is omitted. The size of encoded data of the (i ⁇ 1)th tile has been encoded as the syntax element tile_entry_point_offset[i]. If the syntax element num_tile_entry_point_offsets has a value of 0, no mention is made of the syntax elements tile_entry_point_offset because the syntax elements tile_entry_point_offset are not needed.
  • the syntax element num_wpp_entry_point_offsets indicates the number of entry points of encoded data items of block lines belonging to the tile. Since the number of vertical blocks in each tile is 135 in the present embodiment, the syntax element num_wpp_entry_point_offsets has a value of 134.
  • the syntax elements wpp_entry_point_offset each indicate an entry point of encoded data of the block line, namely, a leading position of the encoded data of the block line.
  • a syntax element wpp_entry_point_offset[j] indicates an entry point of encoded data of the jth block line.
  • the syntax element wpp_entry_point_offset is omitted.
  • the size of encoded data of the (j ⁇ 1)th block line has been encoded as the syntax element wpp_entry_point_offset[j]. If the syntax element num_wpp_entry_point_offsets has a value of 0, no mention is made of the syntax elements wpp_entry_point_offset because the syntax elements wpp_entry_point_offset are not needed.
  • FIG. 4 illustrates a configuration of the image decoding apparatus for decoding encoded data in the above-described image encoding format.
  • a bit stream analyzing unit 401 is configured to analyze a header including a sequence parameter set, a picture parameter set, and a slice header of input encoded data.
  • Decoding units 402 and 403 are configured to decode the input encoded data based on input encoded parameters on a tile-by-tile basis. Although the two tile decoding units are arranged in the present embodiment, the present invention is not limited thereto.
  • a tile image data merging unit 404 is configured to merge image data generated by the first tile decoding unit 402 and image data generated by the second tile decoding unit 403 and output the resultant data.
  • the bit stream analyzing unit 401 analyzes the picture parameter set and the slice header to derive tile data division information, block line data division information, tile data position information, and block line data position information.
  • the bit stream analyzing unit 401 supplies the encoded data following the header to the first tile decoding unit 402 or the second tile decoding unit 403 based on the above-described information. Note that a leading tile is the zeroth tile. If target blocks belong to an even-numbered tile, the encoded data of the tile is supplied to the first tile decoding unit 402 . If the target blocks belong to an odd-numbered tile, the encoded data of the tile is supplied to the second tile decoding unit 403 . In FIG. 2 , the encoded data items of Tile 0 and Tile 2 are decoded by the first tile decoding unit 402 and the encoded data items of Tile 1 and Tile 3 are decoded by the second tile decoding unit 403 .
  • the first tile decoding unit 402 and the second tile decoding unit 403 will be described in detail below with reference to FIG. 19 , which is a block diagram of the decoding unit.
  • a selector 1901 is configured to determine whether a target block belongs to an even-numbered block line in the tile.
  • the selector 1901 is supplied with encoded data on a tile-by-tile basis. If the block belongs to an even-numbered block line, the selector 1901 outputs the encoded data of the block line to a first block line decoding section 1902 . If the block does not belong to an even-numbered block line, the selector 1901 outputs the encoded data of the block line to a second block line decoding section 1903 .
  • the first and second block line decoding sections 1902 and 1903 are configured to decode input encoded data of a block line on a block-by-block basis. As regards decoding, arithmetic decoding is performed.
  • the arithmetic decoding generates and updates a probability table.
  • a first probability table storage section 1904 is configured to store a probability table, generated by the first block line decoding section 1902 , as decoding information.
  • a second probability table storage section 1905 is configured to store a probability table, generated by the second block line decoding section 1903 , as decoding information.
  • a block line image data merging section 1906 is configured to merge image data generated by the first block line decoding section 1902 and image data generated by the second block line decoding section 1903 and output the resultant image data.
  • encoded data of white blocks belonging to even-numbered block lines including the top block line (zeroth line) is decoded by the first block line decoding section 1902 and encoded data of hatched blocks belonging to odd-numbered block lines is decoded by the second block line decoding section 1903 .
  • a first block line and a second block line are arranged next to each other.
  • each block line decoding section first, a probability table for a binary signal of encoded data to be decoded is selected and arithmetic decoding is performed based on the probability table to generate quantization coefficients. Subsequently, the quantization coefficients are subjected to inverse quantization based on quantization parameters, thus generating transform coefficients. Then, the transform coefficients are subjected to inverse orthogonal transform, thus generating prediction errors. Lastly, intra-frame prediction with reference to pixels surrounding the target block or inter-frame prediction with reference to another frame is performed, thus generating image data of the target block.
  • encoded data is supplied on a frame-by-frame basis.
  • Each frame is composed of a plurality of tiles, each tile is divided into blocks, and encoded data is decoded on a block-by-block basis.
  • data is input on a frame-by-frame basis in the present embodiment, data may be input on a slice-by-slice basis, the slice being obtained by dividing the frame.
  • intra-prediction decoding will be described in the present embodiment for ease of explanation, decoding is not limited thereto.
  • the present embodiment may be applied to inter-prediction decoding.
  • step S 501 the bit stream analyzing unit 401 analyzes a header of an input bit stream.
  • the sequence parameter set, the picture parameter set, and the slice header are analyzed.
  • the flags TileFlag and WPPFlag in the picture parameter set are analyzed and the tile data position information and the block line data position information are derived from the slice header.
  • step S 502 a variable CurTile is initialized to 0.
  • the variable CurTile indicates the number of a target tile.
  • the bit stream analyzing unit 401 determines the amount of transmission data (or the size of encoded data of the target tile) to be transmitted to the first tile decoding unit 402 or the second tile decoding unit 403 .
  • step S 901 whether the target tile is the last tile in the frame is determined. If the target tile is the last tile (YES in step S 901 ), the process proceeds to step S 902 . If NO in step S 901 , the process proceeds to step S 903 .
  • step S 902 the size of data from the leading end of encoded data of the target tile to the next NAL unit is set as the amount of transmission data.
  • the NAL unit is a container that stores the sequence parameter set, the picture parameter set, an encoded slice and so on. Since a specific bit sequence, for example, 0x000001, is included in the leading end of data of the NAL unit, the leading end of data can be correctly identified.
  • step S 903 the value of a syntax element tile_entry_point_offset[CurTile+1] indicating the size of encoded data of the (CurTile)th tile is read and the transmission data amount is determined.
  • step S 504 tile decoding is performed in the first tile decoding unit 402 or the second tile decoding unit 403 .
  • the bit stream analyzing unit 401 outputs encoded data of an even-numbered tile to the first tile decoding unit 402 and outputs encoded data of an odd-numbered tile to the second tile decoding unit 403 such that data as much as the size determined in step S 503 is transmitted.
  • the tile decoding will be described in detail later.
  • step S 505 the tile image data merging unit 404 merges tile image data output from the first tile decoding unit 402 and tile image data output from the second tile decoding unit 403 to generate decoded image data and outputs the data.
  • step S 506 whether decoding of encoded data of all of the tiles in the frame has been completed is determined. If the one frame decoding has been completed (YES in step S 506 ), the one frame decoding is terminated. If the decoding has not been completed, the process proceeds to step S 507 . In step S 507 , the variable CurTile is incremented by one. This means that the next tile becomes a target tile.
  • step S 504 The tile decoding in step S 504 will now be described in detail with reference to a flowchart of FIG. 20 .
  • a variable CurBL is initialized to 0.
  • the variable CurBL indicates the number of a target block line.
  • step S 2002 the amount of transmission data (or the size of encoded data of the target block line) to be transmitted to the first block line decoding section 1902 or the second block line decoding section 1903 by the selector 1901 is determined. A process of determination of the transmission data amount will be described in detail later.
  • step S 2003 whether the target block line is the top block line in the tile is determined. If it is the top block line (YES in step S 2003 ), the process proceeds to step S 2004 . If NO in step S 2003 , the process proceeds to step S 2005 .
  • step S 2004 encoded data of the top block line in the tile is decoded to generate image data of the block line. Details of processing in step S 2004 will be described later.
  • step S 2005 encoded data of a block line other than the top block line is decoded to generate image data of the block line.
  • block line decoding whether the target block line is an even-numbered or odd-numbered block line is determined based on the variable CurBL by the selector 1901 . If the target block line is an even-numbered block line, the encoded data of the target block line is decoded by the first block line decoding section 1902 . If the target block line is an odd-numbered block line, the encoded data of the target block line is decoded by the second block line decoding section 1903 .
  • the encoded data items of the block lines are decoded in parallel on a block-line-by-block-line basis by the first and second block line decoding sections 1902 and 1903 . Details of the decoding will also be described later.
  • step S 2006 the block line image data merging section 1906 merges image data of the block lines output from the first block line decoding section 1902 and image data of the block lines output from the second block line decoding section 1903 to generate tile image data and outputs the data.
  • step S 2007 whether decoding of encoded data of all of the block lines in the tile has been completed is determined. If the decoding has been completed (YES in step S 2007 ), the tile decoding is terminated. If NO in step S 2007 , the process proceeds to step S 2008 .
  • step S 2008 the variable CurBL is incremented by one. This means that the next block line in the target tile becomes a target block line.
  • step S 2002 the processing or process of determination of the size of block line data in the bit stream analyzing unit 401 will be described in detail with reference to a flowchart of FIG. 21 . In this process, the variable CurBL indicating the number of a target block line and the variable CurTile indicating the number of a target tile are given as inputs.
  • step S 2101 whether the target block line is the last block line in the tile is determined. If it is the last block line (YES in step S 2101 ), the process proceeds to step S 2103 . If NO in step S 2101 , the process proceeds to step S 2102 .
  • step S 2102 the value of a syntax element wpp_entry_point_offset[CurTile+1][CurBL+1] indicating the size of encoded data of the (CurBL)th block line in the (CurTile)th tile is read and the amount of transmission data is determined.
  • step S 2103 whether the target tile is the last tile in the frame is determined. If it is the last tile (YES in step S 2103 ), the process proceeds to step S 2104 . If NO in step S 2103 , the process proceeds to step S 2105 .
  • step S 2104 the size of data from the leading end of encoded data of the target block line to the next NAL unit is set as the amount of transmission data of the last block line in the last tile. Since a specific bit sequence, such as 0x000001, is included in the leading end of data of the NAL unit, the leading end of data can be correctly identified.
  • step S 2105 the size of data of the last block line in a tile other than the last tile is determined as the amount of transmission data.
  • the size of data of the last block line in the tile is not given as a syntax element wpp_entry_point_offset.
  • the size of data of the last block line is therefore calculated by subtracting the sizes of data of the processed tiles from the value of a syntax element tile_entry_point_offset[CurTile+1] indicating the size of encoded data of the target tile.
  • step S 2004 in FIG. 20 Processing (process of top block line decoding) in step S 2004 in FIG. 20 will be described in detail below with reference to a flowchart of FIG. 6 .
  • encoded data of the target block line is supplied through the selector 1901 to the first block line decoding section 1902 , in which the data is decoded.
  • the selector 1901 outputs the encoded data as much as the transmission data amount (or the size of encoded data of the target block line) determined in step S 2002 to the first block line decoding section 1902 .
  • step S 601 the probability table is initialized by a predetermined method.
  • the initialized probability table is used for arithmetic decoding of the first binary signal in the left block of the block line and is updated at any time in step S 602 , which will be described later.
  • the probability table used for arithmetic decoding of a binary signal in the first block of a block line will be referred to as a “block line reference probability table”.
  • step S 602 the encoded data is decoded on a block-by-block basis by the first block line decoding section 1902 , thus generating image data.
  • the block-by-block basis decoding in step S 602 will now be described in detail with reference to a flowchart of FIG. 8 .
  • step S 801 encoded data is subjected to arithmetic decoding based on the probability table, thus generating a binary signal. Furthermore, the binary signal, binarized by any of various binarization schemes such as unary binarization and fixed length binarization, is decoded for each syntax element in a manner similar to H.264, thus generating a syntax element including a quantization coefficient.
  • step S 802 the probability table is updated based on whether the arithmetically decoded binary signal is a symbol with higher probability.
  • step S 803 whether all of the syntax elements in the block have been arithmetically decoded is determined.
  • step S 803 If all of the syntax elements have been arithmetically decoded (YES in step S 803 ), the process proceeds to step S 804 . If NO in step S 803 , the process returns to step S 801 . The next syntax element is decoded.
  • step S 804 the quantization coefficients are subjected to inverse quantization, thus generating transform coefficients. Furthermore, the transform coefficients are subjected to inverse orthogonal transform, thus generating prediction errors.
  • step S 805 intra-prediction is performed based on pixels surrounding the target block, thus generating predicted image data. Furthermore, the prediction errors are added to the predicted image data, thus generating image data on a block-by-block basis.
  • step S 603 whether a condition for storing the probability table is satisfied is determined.
  • a criterion as to whether a predetermined number of blocks are located between the block decoded in step S 602 and the left end of the block line is the condition for storing the probability table. If the above condition is satisfied (YES in step S 603 ), the process proceeds to step S 604 and the probability table is stored as a first probability table in the first probability table storage section 1904 . If the condition is not satisfied, the process proceeds to step S 605 .
  • the first probability table is used as a block line reference probability table used for decoding of encoded data of the left block in the next block line.
  • step S 605 whether decoding of encoded data of all of the blocks in the target block line has been completed is determined. If the decoding has been completed (YES in step S 605 ), the top block line decoding is terminated. If NO in step S 605 , the process returns to step S 602 and the next block in the raster order is decoded.
  • step S 2005 in FIG. 20 Processing (or process of non-top block line decoding) in step S 2005 in FIG. 20 will be described in detail with reference to a flowchart of FIG. 7 .
  • the target block line is an even-numbered block line
  • encoded data of the target block line is supplied to and decoded by the first block line decoding section 1902 .
  • the target block line is an odd-numbered block line
  • the encoded data of the target block line is supplied to and decoded by the second block line decoding section 1903 .
  • the selector 1901 outputs the encoded data as much as the transmission data amount (or the size of the encoded data of the target block line) determined in step S 2002 to the first block line decoding section 1902 or the second block line decoding section 1903 .
  • a process of decoding encoded data of an odd-numbered block line in the second block line decoding section 1903 will now be described below.
  • step S 701 the first probability table is supplied as the block line reference probability table from the first probability table storage section 1904 .
  • step S 704 the probability table is stored as a second probability table to the second probability table storage section 1905 .
  • the second probability table is used as a block line reference probability table for arithmetic decoding of encoded data of the left block in the next block line.
  • Processing in step S 705 is the same as that in step S 605 .
  • step S 705 whether decoding of encoded data of all of the blocks in the odd-numbered block line has been completed is determined. A process of decoding encoded data of an even-numbered block line in the first block line decoding section 1902 will now be described below.
  • step S 701 the second probability table is supplied as the block line reference probability table from the second probability table storage section 1905 . Since processing in steps S 702 to S 705 is the same as that in steps S 602 to S 605 , explanation is omitted.
  • the above-described configuration and operation enable the leading end of encoded data of each tile and the leading end of encoded data of each block line to be correctly identified. Accordingly, the data can be decoded in parallel on a tile-by-tile basis and the data of each tile can be further decoded in parallel on a block-line-by-block-line basis. Consequently, the division of a frame into tiles and the division of each tile into block lines allow enhancement of both parallelism and encoding efficiency.
  • one frame is divided into a plurality of tiles that are rectangular regions in the same way as in the first embodiment. Since tile arrangement in the second embodiment is the same as that in the first embodiment illustrated in FIG. 2 , explanation is omitted.
  • FIG. 10 illustrates a format of HEVC-encoded data in the present embodiment.
  • the encoded data of FIG. 10 is the same as that in the first embodiment, except for the slice header. Accordingly, only the slice header will be described below.
  • the slice header includes, as position information, a syntax element num_entry_point_offsets and syntax elements entry_point_offset.
  • the syntax element num_entry_point_offsets has a value obtained by subtracting 1 from N that indicates the number of tiles in a slice.
  • a syntax element entry_point_offset[i] indicates an entry point of encoded data of the ith tile. Since it is known that encoded data of the zeroth tile immediately follows the slice header, an entry point of the zeroth tile is omitted. The size of encoded data of the (i ⁇ 1)th tile has been encoded as the syntax element entry_point_offset[i].
  • the syntax element num_entry_point_offsets has a value obtained by subtracting 1 from the number of block lines in the slice.
  • the syntax element entry_point_offset[i] indicates an entry point of encoded data of the ith block line. Since it is known that encoded data of the zeroth block line immediately follows the slice header, an entry point of the zeroth block line is omitted.
  • the size of encoded data of the (i ⁇ 1)th block line has been encoded as the syntax element entry_point_offset[i].
  • the syntax element num_entry_point_offsets has a value obtained by subtracting 1 from the product of the number N of tiles in the slice and the number M of block lines in each tile.
  • the syntax element entry_point_offset[i] indicates an entry point of encoded data of the ith block line. Since it is known that encoded data of the zeroth block line immediately follows the slice header, an entry point of the zeroth block line is omitted.
  • the size of encoded data of the (i ⁇ 1)th block line has been encoded as the syntax element entry_point_offset[i].
  • the syntax element num_entry_point_offsets is treated as having a value of 0.
  • the flag TileFlag and the flag WPPFlag each have a value of 1.
  • Encoded data in the image encoding format is decoded. Since the image decoding apparatus according to the present embodiment has the same configuration as that in the first embodiment illustrated in FIGS. 4 and 19 , explanation is omitted.
  • step S 501 the flags TileFlag and WPPFlag in the picture parameter set are analyzed in the same way as in the first embodiment, thus deriving position information from the slice header.
  • step S 502 a variable CurTile is initialized to 0.
  • step S 503 the amount of transmission data to be transmitted to the first tile decoding unit 402 or the second tile decoding unit 403 is determined in the bit stream analyzing unit 401 by a different process from that in the first embodiment.
  • step S 1103 the number of entry points in a target tile is determined based on the number of vertical blocks in the tile and the sum of values of syntax elements entry_point_offset is set as the amount of transmission data.
  • the number of vertical blocks in the tile is 135, which is fixed. Accordingly, the sum of values of syntax elements entry_point_offset[CurTile*135+1] to entry_point_offset[(CurTile+1)*135] is set as the transmission data amount.
  • the tiles have different numbers of vertical blocks, the numbers of block lines of the tiles which have been processed are added to determine the position of a syntax element entry_point_offset[] from which addition starts.
  • step S 504 tile decoding is performed by the first tile decoding unit 402 or the second tile decoding unit 403 in the same way as in the first embodiment.
  • the tile decoding in step S 504 will be described with reference to the flowchart of FIG. 20 in a manner similar to the first embodiment.
  • the process of FIG. 20 in the present embodiment is the same as that in the first embodiment, except for processing of determination of the size of block line data in step S 2002 . Accordingly, only step S 2002 will be described with reference to FIG. 12 in the present embodiment.
  • step S 1201 whether a target block line is the last block line in the frame is determined by the bit stream analyzing unit 401 . If the target block line is the last block line (YES in step S 1201 ), the process proceeds to step S 1203 . If NO in step S 1201 , the process proceeds to step S 1202 .
  • step S 1202 the value of a syntax element entry_point_offset indicating the size of encoded data of the target block line is read to determine the transmission data amount.
  • the process of determination of the size of block line data is terminated.
  • the syntax element entry_point_offset[CurTile ⁇ 135+CurBL+1] is read.
  • the sum of the numbers of vertical blocks of the tiles processed has to be replaced with a value of CurTile ⁇ 135.
  • step S 1203 the size of data from the leading end of encoded data of the target block line to the next NAL unit is set as the amount of transmission data.
  • the process of determination of the size of block line data is terminated. Since a specific bit sequence, for example, 0x000001, is included in the leading end of data of the NAL unit, the leading end of data can be correctly identified.
  • each entry point is represented by the size of encoded data of a block line. Accordingly, it is unnecessary to separately provide information related to the entry points of tiles and information related to the entry points of block lines. Consequently, parallel decoding can be achieved with a smaller amount of information.
  • one frame is divided into a plurality of tiles that are rectangular regions in the same way as in the first embodiment. Since tile arrangement in the third embodiment is the same as that in FIG. 2 in the first embodiment, explanation is omitted. Note that the tile arrangement is not limited to that in FIG. 2 .
  • FIG. 1 illustrates the format of an HEVC-encoded stream in the present embodiment
  • explanation is omitted because it is the same as that in the first embodiment.
  • FIG. 13 illustrates a configuration of the image encoding apparatus for generating an encoded stream in the image encoding format.
  • a tile selector 1301 is configured to determine whether a target block belongs to an even-numbered tile. If the block belongs to an even-numbered tile, the tile selector 1301 outputs data of the block to a first tile encoding unit 1302 . If the block does not belong to an even-numbered tile, the tile selector 1301 outputs the data of the block to a second tile encoding unit 1303 .
  • the first and second tile encoding units 1302 and 1303 are configured to encode input image data of blocks on a tile-by-tile basis, each block being composed of n ⁇ n pixels (n is a positive integer greater than or equal to 2). Although arrangement of two tile encoding units is described in the present embodiment, the present invention is not limited thereto.
  • image data items of Tile 0 and Tile 2 are encoded by the first tile encoding unit 1302 and image data items of Tile 1 and Tile 3 are encoded by the second tile encoding unit 1303 .
  • the first tile encoding unit 1302 and the second tile encoding unit 1303 will be described in detail with reference to a block diagram of FIG. 23 .
  • a block line selector 2301 is configured to determine whether a target block belongs to an even-numbered block line in the tile and select an output destination depending on the result of determination.
  • a first block line encoding section 2302 is configured to encode image data of a block belonging to an even-numbered block line.
  • a second block line encoding section 2303 is configured to encode image data of a block belonging to an odd-numbered block line.
  • a first probability table storage section 2304 is configured to store a probability table generated by the first block line encoding section 2302 as encoding information. In the following description, the probability table stored in the first probability table storage section 2304 will be referred to as a first probability table.
  • a second probability table storage section 2305 is configured to store a probability table generated by the second block line encoding section 2303 as encoding information.
  • the probability table stored in the second probability table storage section 2305 will be referred to as a second probability table.
  • a block line data merging section 2306 is configured to merge encoded data generated by the first block line encoding section 2302 and encoded data generated by the second block line encoding section 2303 and output the merged data together with encoding parameters including position information.
  • the block line selector 2301 is supplied with image data on a tile-by-tile basis. If a target block belongs to an even-numbered block line, the block line selector 2301 outputs data of the block to the first block line encoding section 2302 . If the target block does not belong to an even-numbered block line, the block line selector 2301 outputs the data of the block to the second block line encoding section 2303 . Referring to FIG. 3 , image data of the white blocks indicating the even-numbered block lines is encoded by the first block line encoding section 2302 and image data of the hatched blocks indicating the odd-numbered block lines is encoded by the second block line encoding section 2303 .
  • top block line is the zeroth line
  • image data of the top block line is encoded by the first block line encoding section 2302 .
  • a process of encoding using the first block line encoding section 2302 and the second block line encoding section 2303 will be described in detail later.
  • a merging unit 1304 is configured to merge encoded data and encoding parameters generated by the first tile encoding unit 1302 and encoded data and encoding parameters generated by the second tile encoding unit 1303 into a bit stream and output the bit stream.
  • the merging unit 1304 merges division information, such as the flags TileFlag and WPPFlag, into a picture parameter set and merge position information into a slice header and outputs the bit stream.
  • images are input on a frame-by-frame basis.
  • Each frame is composed of a plurality of tiles, each tile is divided into a plurality of blocks, and image data is encoded on a block-by-block basis.
  • the images are input on a frame-by-frame basis in the present embodiment, the images may be input on a slice-by-slice basis, the slices being obtained by dividing the frame.
  • intra-prediction encoding will be described in the present embodiment for ease of explanation, encoding is not limited thereto. The present embodiment may be applied to inter-prediction encoding.
  • step S 1401 a variable CurTile indicating the number of a target tile is initialized to 0.
  • step S 1402 tile encoding is performed in the first tile encoding unit 1302 or the second tile encoding unit 1303 .
  • the tile selector 1301 transmits data of an even-numbered tile to the first tile encoding unit 1302 and transmits data of an odd-numbered tile to the second tile encoding unit 1303 .
  • the tile encoding will be described in detail with reference to a flowchart of FIG. 24 .
  • step S 2401 a variable CurBL indicating the number of a target block line is initialized to 0.
  • step S 2402 whether the target block line is the top block line in the tile is determined. If the target block line is the top block line (YES in step S 2402 ), the process proceeds to step S 2403 . If NO in step S 2402 , the process proceeds to step S 2404 .
  • step S 2403 the top block line in the tile is encoded.
  • step S 2404 data of a block line other than the top block line is encoded. Encoding in these steps will be described in detail later.
  • step S 2405 position information (syntax elements tile_entry_point_offset and syntax elements wpp_entry_point_offset) to be contained in the slice header is set. Processing in this step will also be described in detail later.
  • step S 2406 encoded data output from the first block line encoding section 2302 and encoded data output from the second block line encoding section 2303 are merged by the block line data merging section 2306 .
  • the merged encoded data is merged with encoding parameters including the position information calculated in step S 2405 and the resultant encoded data is output.
  • step S 2407 whether encoding of data of all of the block lines in the tile has been completed is determined. If the encoding has been completed (YES in step S 2407 ), the tile encoding is terminated. If NO in step S 2407 , the process proceeds to step S 2408 .
  • step S 2408 the variable CurBL is incremented by one. This means that the next block line in the target tile becomes a target block line.
  • step S 1403 whether encoding of data of all of the tiles in the frame has been completed is determined. If the encoding has been completed (YES in step S 1403 ), the process proceeds to step S 1405 . If NO in step S 1403 , the process proceeds to step S 1404 . In step S 1404 , the variable CurTile indicating the tile number is incremented by one. This means that the next tile becomes a target tile. In step S 1405 , encoded data output from the first tile encoding unit 1302 and encoded data output from the second tile encoding unit 1303 are merged by the merging unit 1304 . In addition, the merged encoded data and encoding parameters including the position information calculated in step S 2405 are merged into a bit stream and the bit stream is output.
  • step S 2403 The block line encodings included in the process of tile encoding in FIG. 24 will be described in detail below.
  • the processing (or process of top block line encoding)in step S 2403 will be described in detail with reference to a flowchart of FIG. 15 . Since the top block line is an even-numbered block line, image data of the target block line is supplied through the tile selector 1301 to the first tile encoding unit 1302 and the image data is encoded by the first tile encoding unit 1302 .
  • step S 1501 the probability table is initialized by a predetermined method.
  • the initialized probability table is used for arithmetic encoding of a first binary signal of the left block in the block line and is updated at any time in step S 1502 , which will be described later.
  • the probability table used for arithmetic encoding of a binary signal of the first block in the block line will be referred to as a block line reference probability table.
  • step S 1502 image data is encoded on a block-by-block basis by the first tile encoding unit 1302 , thus generating encoded data.
  • Block encoding in step S 1502 will be described in detail with reference to a flowchart of FIG. 16 .
  • step S 1601 intra-prediction using pixels surrounding the block is performed on input image data of the block, thus generating prediction errors.
  • the prediction errors are subjected to orthogonal transform, thus generating transform coefficients.
  • the transform coefficients are quantized using quantization parameters determined based on, for example, image characteristics and the amount of symbols, thus generating quantization coefficients.
  • step S 1603 a syntax element indicating, for example, a quantization parameter or a prediction mode, is binarized, thus generating a binary signal.
  • Various binarization schemes such as unary binarization and fixed length binarization, are used while being switched for each syntax element in a manner similar to H.264.
  • step S 1604 the probability table is updated based on whether the arithmetically encoded binary signal is a symbol with higher possibility.
  • step S 1605 whether all of the syntax elements in the block have been arithmetically encoded is determined. If all of the syntax elements have been arithmetically encoded (YES in step S 1605 ), the block encoding is terminated. If NO in step S 1605 , the process returns to step S 1603 , in which the next syntax element is encoded.
  • step S 1503 whether a condition for storing the probability table is satisfied is determined.
  • a criterion as to whether a predetermined number of blocks are located between the block encoded in step S 1502 and the left end of the block line is the condition for storing the probability table. If the above condition is satisfied (YES in step S 1503 ), the process proceeds to step S 1504 .
  • the probability table is stored as a first probability table to the first probability table storage section 2304 . If the condition is not satisfied, the process proceeds to step S 1505 .
  • the first probability table is used as the block line reference probability table for encoding of image data of the left block in the next block line.
  • step S 1505 whether encoding of data of all of the blocks in the target block line has been completed is determined. If the encoding has been completed (YES in step S 1505 ), the top block line encoding is terminated. If NO in step S 1505 , the process returns to step S 1502 and image data of the next block in the raster order is encoded.
  • step S 2404 in FIG. 24 Processing (or process of non-top block line encoding) in step S 2404 in FIG. 24 will be described in detail with reference to a flowchart of FIG. 17 .
  • a target block line is an even-numbered block line
  • image data of the target block line is supplied to and encoded by the first block line encoding section 2302 .
  • the target block line is an odd-numbered block line
  • the image data of the target block line is supplied to and encoded by the second block line encoding section 2303 .
  • a process of encoding image data of an odd-numbered block line in the second block line encoding section 2303 will now be described below.
  • step S 1701 the first probability table is supplied as the block line reference probability table from the first probability table storage section 2304 . Since processing in steps S 1702 and S 1703 is the same as that in steps S 1502 and S 1503 , explanation is omitted.
  • step S 1704 the probability table is stored as a second probability table to the second probability table storage section 2305 .
  • the second probability table is used as a block line reference probability table for arithmetic encoding of image data of the left block in the next block line. Processing in step S 1705 is the same as that in step S 1505 .
  • step S 1705 whether encoding of image data of all of the blocks in the odd-numbered block line has been completed is determined.
  • step S 1701 the second probability table is supplied as the block line reference probability table from the second probability table storage section 2305 . Since processing in steps S 1702 to S 1704 is the same as that in steps S 1502 to S 1504 , explanation is omitted.
  • step S 1705 whether encoding of image data of all of the blocks in the even-numbered block line has been completed is determined.
  • step S 2405 in FIG. 24 Processing or process of calculating position information in step S 2405 in FIG. 24 will be described in detail with reference to a flowchart of FIG. 18 .
  • the variable CurBL and the variable CurTile are given as inputs.
  • step S 1801 whether a target block line is the last block line in a target tile is determined. If it is the last block line (YES in step S 1801 ), the process proceeds to step S 1803 . If NO in step S 1801 , the process proceeds to step S 1802 .
  • step S 1802 the size of encoded data of the target block line is set as a syntax element wpp_entry_point_offset[CurTile+1][CurBL+1].
  • a syntax element wpp_entry_point_offset[CurTile][CurBL] indicates the size of encoded data of the (CurBL)th block line in the (CurTile)th tile.
  • step S 1803 whether the target tile is the last tile in the frame is determined. If it is the last tile, the process of calculating position information is terminated. If the target tile is not the last tile, the process proceeds to step S 1804 . If the target tile is the last tile, this means that the target block line is the last block line in the last tile. Information about the entry point of the block line is not encoded as a syntax element.
  • step S 1804 the size of encoded data of the target tile is set as a syntax element tile_entry_point_offset[CurTile+1] that indicates the size of encoded data of the (CurTile)th tile.
  • Values of syntax elements wpp_entry_point_offset[] and syntax elements tile_entry_point_offset[] are merged into the slice header in step S 1405 in FIG. 14 .
  • the above-described configuration and operation enable division of an image into tiles and parallel encoding on a block-line-by-block-line basis. Accordingly, high-speed encoding can be achieved. Furthermore, since the leading end of encoded data of each tile and the leading end of encoded data of each block line can be correctly identified, a bit stream capable of being decoded in parallel on a tile-by-tile basis and being decoded in parallel on a block-line-by-block-line basis in each tile can be encoded. Thus, since a frame can be divided into tiles and each tile can be divided into block lines, both parallelism and encoding efficiency can be enhanced.
  • one frame is divided into a plurality of tiles that are rectangular regions in the same way as in the first embodiment. Since tile arrangement in the fourth embodiment is the same as that in the first embodiment illustrated in FIG. 2 , explanation is omitted. Note that the tile arrangement is not limited to this arrangement.
  • FIG. 10 The encoded stream in FIG. 10 is the same as that in the second embodiment. All of the entry points are indicated by entry points of block lines.
  • FIGS. 13 and 23 illustrate a configuration (components) of the image encoding apparatus according to the present embodiment, the image encoding apparatus generating an encoded stream in the image encoding format according to the present embodiment. Since the image encoding apparatus according to the present embodiment has the same configuration as that in the third embodiment, explanation is omitted.
  • An operation of the image encoding apparatus according to the present embodiment is the same as that in the third embodiment, except for the processing of calculating position information in step S 2405 in FIG. 24 . Accordingly, only processing in step S 2405 will be described with reference to FIG. 22 .
  • step S 2201 whether a target block line is the last block line in a frame is determined. If it is the last block line (YES in step S 2201 ), the process of calculating position information is terminated. If the target block line is not the last block line, the process proceeds to step S 2202 . If the target block line is the last block line, information about an entry point of the block line is not encoded as a syntax element.
  • step S 2202 the size of encoded data of the target block line is set as a syntax element entry_point_offset.
  • the size of encoded data of the (CurBL)th block line in the (CurTile)th tile is set as a syntax element entry_point_offset[CurTile ⁇ 135+CurBL+1]. If the tiles have different numbers of vertical blocks, it is necessary to replace the sum of the numbers of vertical blocks in the tiles processed with a value of CurTile ⁇ 135.
  • the position information entry_point_offset obtained in step S 2405 in FIG. 24 is merged as a syntax element into a slice header in step S 1405 in the same way as in the third embodiment.
  • the above-described configuration and operation enable division of an image into tiles and parallel encoding on a block-line-by-block-line basis. Accordingly, high-speed encoding can be achieved. Furthermore, since the leading end of encoded data of each tile and the leading end of encoded data of each block line can be correctly identified, a bit stream capable of being decoded in parallel on a tile-by-tile basis and being decoded in parallel on a block-line-by-block-line basis in each tile can be encoded.
  • each entry point is represented by the size of encoded data of a block line. Accordingly, it is unnecessary to separately provide information related to the entry points of the tiles and information related to the entry points of the block lines. Consequently, a stream capable of being subjected to parallel decoding with a smaller amount of information can be encoded.
  • FIGS. 4 , 13 , 19 , and 23 are constructed by hardware. Processes performed by the processing units and sections in FIGS. 4 , 13 , 19 , and 23 may be implemented by computer programs.
  • FIG. 25 is a block diagram illustrating an exemplary configuration of hardware of a computer applicable to the image processing (decoding and encoding) apparatuses according to the above-described embodiments.
  • a CPU 2501 is configured to perform overall control of the computer based on computer programs and data stored in a RAM 2502 and a ROM 2503 and execute the above-described processes, performed by the image processing apparatuses according to the embodiments.
  • the CPU 2501 functions as the processing units and sections illustrated in FIGS. 4 , 13 , 19 , and 23 .
  • the RAM 2502 has an area for temporarily storing a computer program and data loaded from an external storage 2506 and data obtained through an interface (UF) 2507 from an external device.
  • the RAM 2502 further has a work area used for execution of various processes by the CPU 2501 .
  • the RAM 2502 can function as a frame memory or appropriately provide various areas.
  • the ROM 2503 stores setting data of the computer, a boot program, and the like.
  • An operation unit 2504 includes a keyboard and a mouse. When operated by a user of the computer, the operation unit 2504 can input various instructions to the CPU 2501 .
  • An output unit 2505 outputs a result of processing by the CPU 2501 .
  • the output unit 2505 can be constructed by a display device, e.g., a liquid crystal display, such that the result of processing can be displayed.
  • the external storage 2506 functions as a mass storage, such as a hard disk drive.
  • the external storage 2506 stores an operating system (OS) and computer programs for allowing the CPU 2501 to achieve functions of the units and sections illustrated in FIGS. 4 , 13 , 19 , and 23 .
  • the external storage 2506 may further store images to be processed.
  • the computer programs and data stored in the external storage 2506 are appropriately loaded to the RAM 2502 under the control of the CPU 2501 and serve as targets to be processed by the CPU 2501 .
  • the I/F 2507 can be connected to networks, such as a local area network (LAN) and the Internet, and other devices, such as a projector and a display device.
  • the computer can receive and transmit various pieces of information through the I/F 2507 .
  • a bus 2508 connects the above-described components.
  • aspects of the present invention can also be realized by a computer of a system or apparatus (or devices such as a CPU or MPU) that reads out and executes a program recorded on a memory device to perform the functions of the above-described embodiment(s), and by a method, the steps of which are performed by a computer of a system or apparatus by, for example, reading out and executing a program recorded on a memory device to perform the functions of the above-described embodiment(s).
  • the program is provided to the computer for example via a network or from a recording medium of various types serving as the memory device (e.g., computer-readable medium).

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Computing Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)
US14/411,287 2012-06-29 2013-06-26 Image encoding apparatus, method of image encoding, and recording medium, image decoding apparatus, method of image decoding, and recording medium Abandoned US20150181218A1 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
JP2012-147153 2012-06-29
JP2012147153A JP6080405B2 (ja) 2012-06-29 2012-06-29 画像符号化装置、画像符号化方法及びプログラム、画像復号装置、画像復号方法及びプログラム
PCT/JP2013/004003 WO2014002497A1 (en) 2012-06-29 2013-06-26 Image encoding apparatus, method of image encoding, and recording medium, image decoding apparatus, method of image decoding, and recording medium

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2013/004003 A-371-Of-International WO2014002497A1 (en) 2012-06-29 2013-06-26 Image encoding apparatus, method of image encoding, and recording medium, image decoding apparatus, method of image decoding, and recording medium

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US15/657,580 Continuation US9979978B2 (en) 2012-06-29 2017-07-24 Image encoding apparatus, method of image encoding, and recording medium, image decoding apparatus, method of image decoding, and recording medium

Publications (1)

Publication Number Publication Date
US20150181218A1 true US20150181218A1 (en) 2015-06-25

Family

ID=48874459

Family Applications (3)

Application Number Title Priority Date Filing Date
US14/411,287 Abandoned US20150181218A1 (en) 2012-06-29 2013-06-26 Image encoding apparatus, method of image encoding, and recording medium, image decoding apparatus, method of image decoding, and recording medium
US15/657,580 Active US9979978B2 (en) 2012-06-29 2017-07-24 Image encoding apparatus, method of image encoding, and recording medium, image decoding apparatus, method of image decoding, and recording medium
US15/959,672 Active US10218991B2 (en) 2012-06-29 2018-04-23 Image encoding apparatus, method of image encoding, and recording medium, image decoding apparatus, method of image decoding, and recording medium

Family Applications After (2)

Application Number Title Priority Date Filing Date
US15/657,580 Active US9979978B2 (en) 2012-06-29 2017-07-24 Image encoding apparatus, method of image encoding, and recording medium, image decoding apparatus, method of image decoding, and recording medium
US15/959,672 Active US10218991B2 (en) 2012-06-29 2018-04-23 Image encoding apparatus, method of image encoding, and recording medium, image decoding apparatus, method of image decoding, and recording medium

Country Status (6)

Country Link
US (3) US20150181218A1 (ko)
EP (2) EP2868087A1 (ko)
JP (1) JP6080405B2 (ko)
KR (3) KR101791858B1 (ko)
CN (7) CN107509082B (ko)
WO (1) WO2014002497A1 (ko)

Cited By (16)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140003531A1 (en) * 2012-06-29 2014-01-02 Qualcomm Incorporated Tiles and wavefront parallel processing
US20170251209A1 (en) * 2014-09-30 2017-08-31 Telefonaktiebolaget Lm Ericsson (Publ) Encoding and Decoding a video Frame in Separate Processing Units
US9794574B2 (en) 2016-01-11 2017-10-17 Google Inc. Adaptive tile data size coding for video and image compression
US10063872B2 (en) 2015-09-11 2018-08-28 Facebook, Inc. Segment based encoding of video
US20180324425A1 (en) * 2011-11-07 2018-11-08 Canon Kabushiki Kaisha Image coding apparatus, image coding method, image decoding apparatus, image decoding method, and program
CN109644275A (zh) * 2016-09-07 2019-04-16 高通股份有限公司 用于视频译码的树型译码
US10341561B2 (en) * 2015-09-11 2019-07-02 Facebook, Inc. Distributed image stabilization
US10375156B2 (en) 2015-09-11 2019-08-06 Facebook, Inc. Using worker nodes in a distributed video encoding system
US10499070B2 (en) 2015-09-11 2019-12-03 Facebook, Inc. Key frame placement for distributed video encoding
US10506235B2 (en) 2015-09-11 2019-12-10 Facebook, Inc. Distributed control of video encoding speeds
US10602153B2 (en) 2015-09-11 2020-03-24 Facebook, Inc. Ultra-high video compression
US10602157B2 (en) 2015-09-11 2020-03-24 Facebook, Inc. Variable bitrate control for distributed video encoding
US10743009B2 (en) 2015-05-20 2020-08-11 Socionext Inc. Image processing apparatus and image processing method
US10951916B2 (en) * 2017-03-03 2021-03-16 Sk Telecom Co., Ltd. Apparatus and method for video encoding or decoding
US11223813B2 (en) * 2017-01-10 2022-01-11 Samsung Electronics Co., Ltd Method and apparatus for generating metadata for 3D images
US20240064408A1 (en) * 2016-10-04 2024-02-22 B1 Institute Of Image Technology, Inc. Image data encoding/decoding method and apparatus

Families Citing this family (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8308363B2 (en) 2006-05-23 2012-11-13 Kraft Foods Global Brands Llc Package integrity indicator for container closure
US8408792B2 (en) 2007-03-30 2013-04-02 Kraft Foods Global Brands Llc Package integrity indicating closure
US20100018974A1 (en) 2008-07-24 2010-01-28 Deborah Lyzenga Package integrity indicating closure
GB0819200D0 (en) 2008-10-20 2008-11-26 Cadbury Holdings Ltd Packaging
US9708104B2 (en) 2010-05-18 2017-07-18 Intercontinental Great Brands Llc Reclosable flexible packaging and methods for manufacturing same
US9656783B2 (en) 2010-05-18 2017-05-23 Intercontinental Great Brands Llc Reclosable flexible packaging and methods for manufacturing same
PL2686251T3 (pl) 2011-03-17 2015-10-30 Intercontinental Great Brands Llc Opakowania z elastycznej folii z możliwością wielokrotnego zamykania, laminat, metoda i przyrząd do ich produkcji
JP6080405B2 (ja) * 2012-06-29 2017-02-15 キヤノン株式会社 画像符号化装置、画像符号化方法及びプログラム、画像復号装置、画像復号方法及びプログラム
US10271076B2 (en) 2014-06-30 2019-04-23 Sony Corporation File generation device and method, and content playback device and method
GB2564731B (en) 2014-10-14 2019-05-29 Canon Kk Description of image composition with HEVC still image file format
KR20210025732A (ko) * 2016-10-04 2021-03-09 주식회사 비원영상기술연구소 영상 데이터 부호화/복호화 방법 및 장치
CN110832863B (zh) * 2017-06-30 2023-01-06 华为技术有限公司 用于处理视频序列帧的编码器、解码器、计算机程序和计算机程序产品
KR20240023240A (ko) * 2017-07-06 2024-02-20 삼성전자주식회사 영상 부호화 방법 및 장치, 영상 복호화 방법 및 장치
CN113228671B (zh) 2018-12-28 2022-12-02 华为技术有限公司 通过将图像划分成包括图块的条带对图像进行译码的设备和方法及计算机可读存储介质
JP2021002773A (ja) * 2019-06-21 2021-01-07 キヤノン株式会社 画像符号化装置、画像復号装置、画像符号化方法、画像復号方法
JP7403246B2 (ja) 2019-06-21 2023-12-22 キヤノン株式会社 画像復号装置、画像復号方法
JP7403245B2 (ja) 2019-06-21 2023-12-22 キヤノン株式会社 画像復号装置、画像復号方法
JP2021044708A (ja) 2019-09-11 2021-03-18 キヤノン株式会社 画像符号化装置、画像符号化方法及びプログラム、画像復号装置、画像復号方法及びプログラム
WO2021101066A1 (ko) * 2019-11-22 2021-05-27 엘지전자 주식회사 비디오 또는 영상 코딩 시스템에서의 엔트리 포인트 관련 정보에 기반한 영상 코딩 방법
EP4068786A4 (en) * 2019-11-28 2023-10-11 LG Electronics Inc. METHOD AND DEVICE FOR SIGNALING INFORMATION RELATING TO A SLICE OF AN IMAGE/VIDEO ENCODING/DECODING SYSTEM
KR102192631B1 (ko) * 2019-11-28 2020-12-17 주식회사우경정보기술 병렬 포렌식 마킹 장치 및 방법
EP3975119A1 (en) 2020-08-27 2022-03-30 Canon Kabushiki Kaisha Device, information processing apparatus, control method therefor, and program

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120230428A1 (en) * 2011-03-10 2012-09-13 Christopher Andrew Segall Video decoder for slices
US20140247875A1 (en) * 2011-10-31 2014-09-04 Mitsubishi Electric Corporation Video decoding device and video decoding method
US20140334557A1 (en) * 2012-01-20 2014-11-13 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. Coding concept allowing parallel processing, transport demultiplexer and video bitstream
US20150117538A1 (en) * 2012-04-16 2015-04-30 Telefonaktiebolaget L M Ericsson (Publ) Fixed tile structure flag indicating parallel processing possibility for a sequence of compressed video

Family Cites Families (33)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP4257503B2 (ja) * 2003-04-25 2009-04-22 富士ゼロックス株式会社 画像処理装置及び画像処理方法
DE102004038110B3 (de) * 2004-08-05 2005-12-29 Siemens Ag Verfahren zum Codieren und Decodieren, sowie Codier- und Decodiervorrichtung zur Videocodierung
US7813432B2 (en) * 2004-12-30 2010-10-12 Intel Corporation Offset buffer for intra-prediction of digital video
JP4937741B2 (ja) * 2005-01-07 2012-05-23 日本電信電話株式会社 映像符号化方法及び装置、映像復号方法及び装置、それらのプログラムおよびそれらプログラムを記録した記録媒体
US7606429B2 (en) * 2005-03-25 2009-10-20 Ati Technologies Ulc Block-based image compression method and apparatus
US9077960B2 (en) * 2005-08-12 2015-07-07 Microsoft Corporation Non-zero coefficient block pattern coding
WO2007066710A1 (ja) * 2005-12-07 2007-06-14 Sony Corporation 符号化装置、符号化方法および符号化プログラム、ならびに、復号装置、復号方法および復号プログラム
JPWO2007066709A1 (ja) * 2005-12-07 2009-05-21 ソニー株式会社 符号化装置、符号化方法および符号化プログラム、ならびに、復号装置、復号方法および復号プログラム
JP2007189518A (ja) * 2006-01-13 2007-07-26 Matsushita Electric Ind Co Ltd 信号処理装置、撮像装置、ネットワークカメラシステム及び映像システム
US7831103B2 (en) * 2006-03-17 2010-11-09 Tata Consultancy Services Limited Digital images
EP2023637A4 (en) * 2006-05-24 2010-06-16 Panasonic Corp IMAGE DECODING DEVICE
JP2008219100A (ja) * 2007-02-28 2008-09-18 Oki Electric Ind Co Ltd 予測画像生成装置、方法及びプログラム、並びに、画像符号化装置、方法及びプログラム
CN101394559B (zh) * 2007-09-21 2010-10-27 扬智科技股份有限公司 动态图像处理方法、译码方法及其装置
US8432975B2 (en) * 2008-01-18 2013-04-30 Mediatek Inc. Apparatus and method for processing a picture frame
US8542748B2 (en) * 2008-03-28 2013-09-24 Sharp Laboratories Of America, Inc. Methods and systems for parallel video encoding and decoding
JP5756921B2 (ja) * 2008-06-10 2015-07-29 パナソニックＩｐマネジメント株式会社 画像復号装置、画像復号方法、画像符号化装置、画像符号化方法、プログラムおよび集積回路
US8311111B2 (en) 2008-09-11 2012-11-13 Google Inc. System and method for decoding using parallel processing
EP2346255B1 (en) * 2008-10-10 2015-04-08 Panasonic Corporation Image decoding apparatus and image decoding method
JP5340289B2 (ja) * 2008-11-10 2013-11-13 パナソニック株式会社 画像復号装置、画像復号方法、集積回路及びプログラム
JP5173873B2 (ja) * 2008-11-20 2013-04-03 キヤノン株式会社 画像符号化装置及びその制御方法
JP5343703B2 (ja) * 2009-05-22 2013-11-13 ソニー株式会社 復号処理装置、復号処理方法、およびプログラム
KR101773009B1 (ko) * 2009-06-29 2017-08-30 톰슨 라이센싱 코딩되지 않은 구문에 대한 적응 확률 갱신을 위한 방법 및 장치
JP2011217082A (ja) 2010-03-31 2011-10-27 Jvc Kenwood Corp 画像符号化装置、画像符号化方法、画像符号化プログラム、画像復号装置、画像復号方法及び画像復号プログラム
US20110249735A1 (en) * 2010-04-09 2011-10-13 Jie Zhao Methods and Systems for Intra Prediction
JP5489845B2 (ja) * 2010-04-27 2014-05-14 キヤノン株式会社 画像符号化装置及びその制御方法、並びに、プログラム及び記憶媒体
US8681162B2 (en) * 2010-10-15 2014-03-25 Via Technologies, Inc. Systems and methods for video processing
CN102457725A (zh) * 2010-10-18 2012-05-16 曜鹏科技股份有限公司 影像编码资料暂存装置及其影像编码资料暂存方法
US9060174B2 (en) * 2010-12-28 2015-06-16 Fish Dive, Inc. Method and system for selectively breaking prediction in video coding
JP2012147153A (ja) 2011-01-11 2012-08-02 Renesas Electronics Corp 半導体集積回路およびその動作方法
KR20120084639A (ko) * 2011-01-20 2012-07-30 한국전자통신연구원 엔트로피 부호화를 위한 적응적 정렬 테이블
JP6080375B2 (ja) * 2011-11-07 2017-02-15 キヤノン株式会社 画像符号化装置、画像符号化方法及びプログラム、画像復号装置、画像復号方法及びプログラム
RU2710908C2 (ru) * 2012-04-13 2020-01-14 ДжиИ Видео Компрешн, ЭлЭлСи Кодирование изображений с малой задержкой
JP6080405B2 (ja) * 2012-06-29 2017-02-15 キヤノン株式会社 画像符号化装置、画像符号化方法及びプログラム、画像復号装置、画像復号方法及びプログラム

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120230428A1 (en) * 2011-03-10 2012-09-13 Christopher Andrew Segall Video decoder for slices
US20140247875A1 (en) * 2011-10-31 2014-09-04 Mitsubishi Electric Corporation Video decoding device and video decoding method
US20140334557A1 (en) * 2012-01-20 2014-11-13 Fraunhofer-Gesellschaft Zur Foerderung Der Angewandten Forschung E.V. Coding concept allowing parallel processing, transport demultiplexer and video bitstream
US20150117538A1 (en) * 2012-04-16 2015-04-30 Telefonaktiebolaget L M Ericsson (Publ) Fixed tile structure flag indicating parallel processing possibility for a sequence of compressed video

Cited By (22)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10609369B2 (en) * 2011-11-07 2020-03-31 Canon Kabushiki Kaisha Image coding apparatus, image coding method, image decoding apparatus, image decoding method, and program
US20180324425A1 (en) * 2011-11-07 2018-11-08 Canon Kabushiki Kaisha Image coding apparatus, image coding method, image decoding apparatus, image decoding method, and program
US9621905B2 (en) * 2012-06-29 2017-04-11 Qualcomm Incorporated Tiles and wavefront parallel processing
US20140003531A1 (en) * 2012-06-29 2014-01-02 Qualcomm Incorporated Tiles and wavefront parallel processing
US10547838B2 (en) * 2014-09-30 2020-01-28 Telefonaktiebolaget Lm Ericsson (Publ) Encoding and decoding a video frame in separate processing units
US20170251209A1 (en) * 2014-09-30 2017-08-31 Telefonaktiebolaget Lm Ericsson (Publ) Encoding and Decoding a video Frame in Separate Processing Units
US10743009B2 (en) 2015-05-20 2020-08-11 Socionext Inc. Image processing apparatus and image processing method
US10063872B2 (en) 2015-09-11 2018-08-28 Facebook, Inc. Segment based encoding of video
US10602157B2 (en) 2015-09-11 2020-03-24 Facebook, Inc. Variable bitrate control for distributed video encoding
US10375156B2 (en) 2015-09-11 2019-08-06 Facebook, Inc. Using worker nodes in a distributed video encoding system
US10499070B2 (en) 2015-09-11 2019-12-03 Facebook, Inc. Key frame placement for distributed video encoding
US10506235B2 (en) 2015-09-11 2019-12-10 Facebook, Inc. Distributed control of video encoding speeds
US10341561B2 (en) * 2015-09-11 2019-07-02 Facebook, Inc. Distributed image stabilization
US10602153B2 (en) 2015-09-11 2020-03-24 Facebook, Inc. Ultra-high video compression
US10021398B2 (en) * 2016-01-11 2018-07-10 Google Llc Adaptive tile data size coding for video and image compression
US9794574B2 (en) 2016-01-11 2017-10-17 Google Inc. Adaptive tile data size coding for video and image compression
CN109644275A (zh) * 2016-09-07 2019-04-16 高通股份有限公司 用于视频译码的树型译码
US11743508B2 (en) 2016-09-07 2023-08-29 Qualcomm Incorporated Tree-type coding for video coding
US20240064408A1 (en) * 2016-10-04 2024-02-22 B1 Institute Of Image Technology, Inc. Image data encoding/decoding method and apparatus
US11949994B2 (en) * 2016-10-04 2024-04-02 B1 Institute Of Image Technology, Inc. Image data encoding/decoding method and apparatus
US11223813B2 (en) * 2017-01-10 2022-01-11 Samsung Electronics Co., Ltd Method and apparatus for generating metadata for 3D images
US10951916B2 (en) * 2017-03-03 2021-03-16 Sk Telecom Co., Ltd. Apparatus and method for video encoding or decoding

Also Published As

Publication number Publication date
CN107483966B (zh) 2020-10-30
KR101888375B1 (ko) 2018-08-14
JP2014011638A (ja) 2014-01-20
CN107517389A (zh) 2017-12-26
CN107483951A (zh) 2017-12-15
WO2014002497A1 (en) 2014-01-03
CN107172441B (zh) 2020-01-17
US10218991B2 (en) 2019-02-26
JP6080405B2 (ja) 2017-02-15
KR20170122841A (ko) 2017-11-06
CN104396259A (zh) 2015-03-04
CN107509082B (zh) 2020-03-17
EP2868087A1 (en) 2015-05-06
CN107509082A (zh) 2017-12-22
KR20150024922A (ko) 2015-03-09
CN107483966A (zh) 2017-12-15
CN107517389B (zh) 2020-03-17
KR20170021901A (ko) 2017-02-28
US20170324970A1 (en) 2017-11-09
CN104396259B (zh) 2017-10-31
US9979978B2 (en) 2018-05-22
KR101791858B1 (ko) 2017-10-31
CN107743241B (zh) 2020-05-05
EP3291555A1 (en) 2018-03-07
US20180242009A1 (en) 2018-08-23
CN107483951B (zh) 2020-03-17
CN107743241A (zh) 2018-02-27
KR101710017B1 (ko) 2017-02-24
CN107172441A (zh) 2017-09-15

Similar Documents

Publication Publication Date Title
US10218991B2 (en) Image encoding apparatus, method of image encoding, and recording medium, image decoding apparatus, method of image decoding, and recording medium
US10645401B2 (en) Image coding apparatus, image coding method, image decoding apparatus, image decoding method, and storage medium
US11647190B2 (en) Image coding apparatus, image coding method, image decoding apparatus, image decoding method, and program
EP2659675B1 (en) Method for picture segmentation using columns
US20180048903A1 (en) Image encoding apparatus, image encoding method, and recording medium; and image decoding apparatus, image decoding method, and recording medium
US10158863B2 (en) Image coding apparatus, image coding method, and recording medium, and image decoding apparatus, image decoding method, and recording medium
US20100067582A1 (en) Image Encoding or Decoding Method and Device, with Parallelization of Processing Over Several Processors and Coprocessors, Corresponding Computer-Readable Storage Medium
US9219926B2 (en) Image encoding apparatus, image encoding method and program, image decoding apparatus, image decoding method and program
JP2018198439A (ja) 画像符号化装置、および画像復号装置
JP2020039162A (ja) 画像符号化装置、および画像復号装置

Legal Events

Date Code Title Description
AS Assignment

Owner name: CANON KABUSHIKI KAISHA, JAPAN

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:OKAWA, KOJI;REEL/FRAME:035644/0500

Effective date: 20141209

STCB Information on status: application discontinuation

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