WO2013005969A2 - 비디오 데이터의 재생 상태 식별을 위한 비디오 데이터의 다중화 방법 및 장치, 역다중화 방법 및 장치 - Google Patents
비디오 데이터의 재생 상태 식별을 위한 비디오 데이터의 다중화 방법 및 장치, 역다중화 방법 및 장치 Download PDFInfo
- Publication number
- WO2013005969A2 WO2013005969A2 PCT/KR2012/005256 KR2012005256W WO2013005969A2 WO 2013005969 A2 WO2013005969 A2 WO 2013005969A2 KR 2012005256 W KR2012005256 W KR 2012005256W WO 2013005969 A2 WO2013005969 A2 WO 2013005969A2
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- picture
- unit
- coding
- data
- depth
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 74
- 230000005540 biological transmission Effects 0.000 claims abstract description 52
- 238000005192 partition Methods 0.000 claims description 143
- 230000009466 transformation Effects 0.000 claims description 44
- 238000010586 diagram Methods 0.000 description 20
- 238000006243 chemical reaction Methods 0.000 description 15
- 230000003139 buffering effect Effects 0.000 description 10
- 239000000284 extract Substances 0.000 description 5
- 238000004891 communication Methods 0.000 description 4
- 230000007423 decrease Effects 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 230000011218 segmentation Effects 0.000 description 3
- 230000000007 visual effect Effects 0.000 description 3
- 230000003111 delayed effect Effects 0.000 description 2
- 238000001914 filtration Methods 0.000 description 2
- 238000013139 quantization Methods 0.000 description 2
- 101100317178 Caenorhabditis elegans vps-26 gene Proteins 0.000 description 1
- 238000007906 compression Methods 0.000 description 1
- 230000006835 compression Effects 0.000 description 1
- 239000000470 constituent Substances 0.000 description 1
- 238000013144 data compression Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000000605 extraction Methods 0.000 description 1
- 239000000945 filler Substances 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
- 230000000153 supplemental effect Effects 0.000 description 1
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/46—Embedding additional information in the video signal during the compression process
-
- 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/30—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using hierarchical techniques, e.g. scalability
-
- 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/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/188—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a video data packet, e.g. a network abstraction layer [NAL] unit
-
- 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/423—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 characterised by memory arrangements
- H04N19/426—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 characterised by memory arrangements using memory downsizing methods
-
- 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
-
- 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
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
- H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
- H04N21/238—Interfacing the downstream path of the transmission network, e.g. adapting the transmission rate of a video stream to network bandwidth; Processing of multiplex streams
- H04N21/2387—Stream processing in response to a playback request from an end-user, e.g. for trick-play
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
- H04N21/41—Structure of client; Structure of client peripherals
- H04N21/426—Internal components of the client ; Characteristics thereof
- H04N21/42607—Internal components of the client ; Characteristics thereof for processing the incoming bitstream
- H04N21/42623—Internal components of the client ; Characteristics thereof for processing the incoming bitstream involving specific decryption arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client
- H04N21/65—Transmission of management data between client and server
- H04N21/658—Transmission by the client directed to the server
- H04N21/6587—Control parameters, e.g. trick play commands, viewpoint selection
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/80—Generation or processing of content or additional data by content creator independently of the distribution process; Content per se
- H04N21/83—Generation or processing of protective or descriptive data associated with content; Content structuring
- H04N21/845—Structuring of content, e.g. decomposing content into time segments
- H04N21/8455—Structuring of content, e.g. decomposing content into time segments involving pointers to the content, e.g. pointers to the I-frames of the video stream
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N7/00—Television systems
- H04N7/24—Systems for the transmission of television signals using pulse code modulation
Definitions
- the present invention relates to a method and apparatus for encoding and decoding a video, and more particularly, to a method for multiplexing / demultiplexing video data so that an intra picture reproduced on a decoding side can be identified in a random access or normal reproduction state. And to an apparatus.
- ITU-T H.261 ISO / IEC MPEG-1 Visual
- ITU-T H.262 ISO / IEC MPEG-2 Visual
- ITU-T H.264 ISO / IEC MPEG-4 Visual
- ITU-T H.261 ISO / IEC MPEG-1 Visual
- ITU-T H.262 ISO / IEC MPEG-2 Visual
- ITU-T H.264 ISO / IEC MPEG-4 Visual
- ITU-T H In a video codec such as .264 (ISO / IEC MPEG-4 AVC), a macroblock is predicted and encoded by inter prediction or intra prediction, and the encoded image data is generated by outputting a bitstream according to a predetermined format defined by each video codec. do.
- the technical problem to be solved by the present invention is to define a new type of intra picture for random access reproduction, and to identify a general reproduction state and a reproduction state by random access in terms of hardware or software related to a decoding apparatus. will be.
- Embodiments of the present invention make it possible to identify a reproduction state of an intra picture through syntax included in predetermined transmission data.
- FIG. 1 is a block diagram of a video encoding apparatus according to an embodiment of the present invention.
- FIG. 2 is a block diagram of a video decoding apparatus according to an embodiment of the present invention.
- FIG. 3 illustrates a concept of coding units, according to an embodiment of the present invention.
- FIG. 4 is a block diagram of an image encoder based on coding units, according to an embodiment of the present invention.
- FIG. 5 is a block diagram of an image decoder based on coding units, according to an embodiment of the present invention.
- FIG. 6 is a diagram of deeper coding units according to depths, and partitions, according to an embodiment of the present invention.
- FIG. 7 illustrates a relationship between coding units and transformation units, according to an embodiment of the present invention.
- FIG. 8 illustrates encoding information according to depths, according to an embodiment of the present invention.
- FIG. 9 is a diagram of deeper coding units according to depths, according to an embodiment of the present invention.
- 10, 11, and 12 illustrate a relationship between a coding unit, a prediction unit, and a frequency transformation unit, according to an embodiment of the present invention.
- FIG. 13 illustrates a relationship between coding units, prediction units, and transformation units, according to encoding mode information of Table 1.
- 14A and 14B are diagrams for describing a decoding process of a CRA picture during normal playback and random access according to an embodiment of the present invention.
- FIG. 15 is a diagram illustrating a configuration of a video data multiplexing device according to an embodiment of the present invention.
- 16 is a diagram illustrating a configuration of an NAL unit according to an embodiment of the present invention.
- 17A and 17B are diagrams for describing a decoding process of a CRA picture during normal playback and random access according to another embodiment of the present invention.
- FIG. 18 is a flowchart illustrating a method of multiplexing video data according to an embodiment of the present invention.
- FIG. 19 illustrates a configuration of a video data demultiplexing apparatus according to an embodiment of the present invention.
- 20 is a flowchart illustrating a method of demultiplexing video data according to an embodiment of the present invention.
- a multiplexing method of video data comprises the steps of: encoding pictures constituting the video data based on a data unit of a hierarchical structure; When there is a transmission request of the encoded data from a decoding apparatus, determining whether the transmission request is a request for normal reproduction or a request for random access; And transmission unit data multiplexed with an intra picture having leading pictures encoded in a display order as an intra picture to be used for random access before the intra picture but after the intra picture in a coding order. And adding a predetermined syntax indicating whether the intra picture is an intra picture provided according to a request according to normal reproduction or a request for random access.
- An apparatus for multiplexing video data includes a video encoder for encoding pictures constituting the video data based on a data unit having a hierarchical structure; A reproduction state identification unit determining whether the transmission request is a request for normal reproduction or a random access when there is a request for transmission of the encoded data from a decoding apparatus; And transmission unit data obtained by multiplexing an intra picture having leading pictures encoded in the display order as an intra picture used for random access but before the intra picture but after the intra picture in a coding order according to the determination result. And a multiplexer for adding a predetermined syntax indicating whether the intra picture is an intra picture provided according to a request according to normal reproduction or a request for random access.
- a method of demultiplexing video data comprising: receiving transmission unit data multiplexed with a bitstream obtained by encoding pictures constituting the video data based on a hierarchical data unit; From the transmission unit data multiplexed with an intra picture having leading pictures decoded as an intra picture used for random access among the transmission unit data in the display order but before the intra picture in the decoding order after the intra picture in decoding order, Obtaining a predetermined syntax indicating whether an intra picture is a picture to be decoded according to a state of normal reproduction and random access; And identifying whether the intra picture is a picture normally played or a random access picture based on the obtained syntax.
- An apparatus for demultiplexing video data receives transmission unit data obtained by multiplexing a bitstream obtained by encoding pictures constituting the video data based on a data unit having a hierarchical structure, and transmits the transmission unit data.
- An intra picture used for random access wherein the intra picture is generalized from transmission unit data multiplexed with an intra picture having leading pictures decoded before the intra picture in the decoding order but after the intra picture in decoding order.
- a demultiplexer for obtaining a predetermined syntax indicating whether a picture is decoded according to a state of reproduction and random access; And a reproduction state identification unit for identifying whether the intra picture is a normal picture or a random access picture based on the obtained syntax.
- an image includes a still image, a moving image, and may be referred to as a video.
- an image frame may be referred to as a picture.
- FIG. 1 is a block diagram of a video encoding apparatus according to an embodiment of the present invention.
- the video encoding apparatus 100 includes a maximum coding unit splitter 110, a coding unit determiner 120, and an outputter 130.
- the maximum coding unit splitter 110 may partition the current picture based on the maximum coding unit that is a coding unit of the maximum size for the current picture of the image. If the current picture is larger than the maximum coding unit, image data of the current picture may be split into at least one maximum coding unit.
- the maximum coding unit may be a data unit having a size of 32x32, 64x64, 128x128, 256x256, etc., and may be a square data unit having a square power of 2 with a horizontal and vertical size greater than eight.
- the image data may be output to the coding unit determiner 120 for at least one maximum coding unit.
- the coding unit according to an embodiment may be characterized by a maximum size and depth.
- the depth indicates the number of times the coding unit is spatially divided from the maximum coding unit, and as the depth increases, the coding unit for each depth may be split from the maximum coding unit to the minimum coding unit.
- the depth of the largest coding unit is the highest depth and the minimum coding unit may be defined as the lowest coding unit.
- the maximum coding unit decreases as the depth increases, the size of the coding unit for each depth decreases, and thus, the coding unit of the higher depth may include coding units of a plurality of lower depths.
- the image data of the current picture may be divided into maximum coding units according to the maximum size of the coding unit, and each maximum coding unit may include coding units divided by depths. Since the maximum coding unit is divided according to depths, image data of a spatial domain included in the maximum coding unit may be hierarchically classified according to depths.
- the maximum depth and the maximum size of the coding unit that limit the total number of times of hierarchically dividing the height and the width of the maximum coding unit may be preset.
- the coding unit determiner 120 encodes at least one divided region obtained by dividing the region of the largest coding unit for each depth, and determines a depth at which the final encoding result is output for each of the at least one divided region. That is, the coding unit determiner 120 encodes the image data in coding units according to depths for each maximum coding unit of the current picture, and selects a depth at which the smallest coding error occurs to determine the coding depth. The determined coded depth and the image data for each maximum coding unit are output to the outputter 130.
- Image data in the largest coding unit is encoded based on coding units according to depths according to at least one depth less than or equal to the maximum depth, and encoding results based on the coding units for each depth are compared. As a result of comparing the encoding error of the coding units according to depths, a depth having the smallest encoding error may be selected. At least one coding depth may be determined for each maximum coding unit.
- the coding unit is divided into hierarchically and the number of coding units increases.
- a coding error of each data is measured, and whether or not division into a lower depth is determined. Therefore, even in the data included in one largest coding unit, since the encoding error for each depth is different according to the position, the coding depth may be differently determined according to the position. Accordingly, one or more coding depths may be set for one maximum coding unit, and data of the maximum coding unit may be partitioned according to coding units of one or more coding depths.
- the coding unit determiner 120 may determine coding units having a tree structure included in the current maximum coding unit.
- the coding units having a tree structure according to an embodiment include coding units having a depth determined as a coding depth among all deeper coding units included in the maximum coding unit.
- the coding unit of the coding depth may be hierarchically determined according to the depth in the same region within the maximum coding unit, and may be independently determined for the other regions.
- the coded depth for the current region may be determined independently of the coded depth for the other region.
- the maximum depth according to an embodiment is an index related to the number of divisions from the maximum coding unit to the minimum coding unit.
- the first maximum depth according to an embodiment may represent the total number of divisions from the maximum coding unit to the minimum coding unit.
- the second maximum depth according to an embodiment may represent the total number of depth levels from the maximum coding unit to the minimum coding unit. For example, when the depth of the largest coding unit is 0, the depth of the coding unit obtained by dividing the largest coding unit once may be set to 1, and the depth of the coding unit divided twice may be set to 2. In this case, if the coding unit divided four times from the maximum coding unit is the minimum coding unit, since depth levels of 0, 1, 2, 3, and 4 exist, the first maximum depth is set to 4 and the second maximum depth is set to 5. Can be.
- Predictive coding and frequency transform of the largest coding unit may be performed. Similarly, the prediction encoding and the frequency transformation are performed based on depth-wise coding units for each maximum coding unit and for each depth below the maximum depth.
- encoding including prediction coding and frequency transformation should be performed on all the coding units for each depth generated as the depth deepens.
- the prediction encoding and the frequency transformation will be described based on the coding unit of the current depth among at least one maximum coding unit.
- the video encoding apparatus 100 may variously select a size or shape of a data unit for encoding image data.
- the encoding of the image data is performed through prediction encoding, frequency conversion, entropy encoding, and the like.
- the same data unit may be used in every step, or the data unit may be changed in steps.
- the video encoding apparatus 100 may select not only a coding unit for encoding the image data, but also a data unit different from the coding unit in order to perform predictive encoding of the image data in the coding unit.
- prediction encoding may be performed based on a coding unit of a coding depth, that is, a more strange undivided coding unit, according to an embodiment.
- a more strange undivided coding unit that is the basis of prediction coding is referred to as a 'prediction unit'.
- the partition in which the prediction unit is divided may include a data unit in which at least one of the prediction unit and the height and the width of the prediction unit are divided.
- the partition type includes not only symmetric partitions in which the height or width of the prediction unit is divided by a symmetrical ratio, but also partitions divided in an asymmetrical ratio, such as 1: n or n: 1, by a geometric form. It may optionally include partitioned partitions, arbitrary types of partitions, and the like.
- the prediction mode of the prediction unit may be at least one of an intra mode, an inter mode, and a skip mode.
- the intra mode and the inter mode may be performed on partitions having sizes of 2N ⁇ 2N, 2N ⁇ N, N ⁇ 2N, and N ⁇ N.
- the skip mode may be performed only for partitions having a size of 2N ⁇ 2N.
- the encoding may be performed independently for each prediction unit within the coding unit to select a prediction mode having the smallest encoding error.
- the video encoding apparatus 100 may perform frequency conversion of image data of a coding unit based on not only a coding unit for encoding image data, but also a data unit different from the coding unit.
- frequency conversion may be performed based on a data unit having a size smaller than or equal to the coding unit.
- the data unit for frequency conversion may include a data unit for an intra mode and a data unit for an inter mode.
- the data unit on which the frequency conversion is based may be referred to as a 'conversion unit'.
- the residual data of the coding unit may be partitioned according to the transform unit having a tree structure according to the transform depth.
- a transform depth indicating a number of divisions between the height and the width of the coding unit divided to the transform unit may be set. For example, if the size of the transform unit of the current coding unit of size 2Nx2N is 2Nx2N, the transform depth is 0, the transform depth 1 if the size of the transform unit is NxN, and the transform depth 2 if the size of the transform unit is N / 2xN / 2. Can be. That is, the transformation unit having a tree structure may also be set for the transformation unit according to the transformation depth.
- the encoded information for each coded depth requires not only the coded depth but also prediction related information and frequency transform related information. Accordingly, the coding unit determiner 120 may determine not only a coding depth that generates a minimum coding error, but also a partition type obtained by dividing a prediction unit into partitions, a prediction mode for each prediction unit, and a size of a transformation unit for frequency transformation. .
- a method of determining a coding unit and a partition according to a tree structure of a maximum coding unit according to an embodiment will be described later in detail with reference to FIGS. 3 to 12.
- the coding unit determiner 120 may measure a coding error of coding units according to depths using a Lagrangian Multiplier-based rate-distortion optimization technique.
- the output unit 130 outputs the image data of the maximum coding unit encoded based on the at least one coded depth determined by the coding unit determiner 120 and the information about the encoding modes according to depths in the form of a bit stream.
- the encoded image data may be a result of encoding residual data of the image.
- the information about the encoding modes according to depths may include encoding depth information, partition type information of a prediction unit, prediction mode information, size information of a transformation unit, and the like.
- the coded depth information may be defined using depth-specific segmentation information indicating whether to encode to a coding unit of a lower depth without encoding to the current depth. If the current depth of the current coding unit is a coding depth, since the current coding unit is encoded in a coding unit of the current depth, split information of the current depth may be defined so that it is no longer divided into lower depths. On the contrary, if the current depth of the current coding unit is not the coding depth, encoding should be attempted using the coding unit of the lower depth, and thus split information of the current depth may be defined to be divided into coding units of the lower depth.
- encoding is performed on the coding unit divided into the coding units of the lower depth. Since at least one coding unit of a lower depth exists in the coding unit of the current depth, encoding may be repeatedly performed for each coding unit of each lower depth, and recursive coding may be performed for each coding unit of the same depth.
- coding units having a tree structure are determined in one largest coding unit and information about at least one coding mode should be determined for each coding unit of a coding depth, information about at least one coding mode may be determined for one maximum coding unit. Can be.
- the coding depth may be different for each location, and thus information about the coded depth and the coding mode may be set for the data.
- the output unit 130 may allocate encoding information about a corresponding coding depth and an encoding mode to at least one of a coding unit, a prediction unit, and a minimum unit included in the maximum coding unit. .
- a minimum unit is a square data unit having a minimum coding unit, which is a lowest coding depth, divided into four pieces, and has a maximum size that may be included in all coding units, prediction units, and transformation units included in the maximum coding unit. It may be a square data unit.
- the encoding information output through the output unit 130 may be classified into encoding information according to depth coding units and encoding information according to prediction units.
- the encoding information for each coding unit according to depth may include prediction mode information and partition size information.
- the encoding information transmitted for each prediction unit includes information about an estimation direction of the inter mode, information about a reference image index of the inter mode, information about a motion vector, information about a chroma component of an intra mode, and information about an inter mode of an intra mode. And the like.
- information about a maximum size and information about a maximum depth of a coding unit defined for each picture, slice, or GOP may be inserted in a header of a bitstream.
- the maximum coding unit splitter 110 and the coding unit determiner 120 determine a reference frame of each image frame constituting the image sequence by performing motion prediction and compensation on each image frame of the image sequence for each coding unit. It corresponds to a video coding layer for encoding each image frame using the determined reference frame.
- the output unit 130 may include a syntax (max_dec_frame buffering) indicating a maximum size of a buffer required for decoding an image frame in a decoder, a syntax (num_reorder_frames) indicating a number of image frames requiring reordering, and an image sequence.
- syntax (max_latency_increase) representing the latency information of the image frame having the largest difference in encoding order and display order among the constituent image frames is mapped in units of a network abstraction layer (hereinafter referred to as NAL). Create a bitstream.
- a coding unit according to depths is a coding unit having a size in which a height and a width of a coding unit of one layer higher depth are divided by half. That is, if the size of the coding unit of the current depth is 2Nx2N, the size of the coding unit of the lower depth is NxN.
- the current coding unit having a size of 2N ⁇ 2N may include up to four lower depth coding units having a size of N ⁇ N.
- the video encoding apparatus 100 determines a coding unit having an optimal shape and size for each maximum coding unit based on the size and the maximum depth of the maximum coding unit determined in consideration of characteristics of the current picture.
- coding units having a tree structure may be configured.
- an optimal coding mode may be determined in consideration of image characteristics of coding units having various image sizes.
- the video encoding apparatus may adjust the coding unit in consideration of the image characteristics while increasing the maximum size of the coding unit in consideration of the size of the image, thereby increasing image compression efficiency.
- FIG. 2 is a block diagram of a video decoding apparatus according to an embodiment of the present invention.
- the video decoding apparatus 200 includes a receiver 210, an image data and encoding information extractor 220, and an image data decoder 230.
- Definitions of various terms such as coding units, depths, prediction units, transformation units, and information about various encoding modes for various processings of the video decoding apparatus 200 according to an embodiment may include the video encoding apparatus 100 of FIG. 1 and the video encoding apparatus 100. Same as described above with reference.
- the receiver 210 receives and parses a bitstream of an encoded video.
- the image data and encoding information extractor 220 extracts image data encoded for each coding unit from the parsed bitstream according to coding units having a tree structure for each maximum coding unit, and outputs the encoded image data to the image data decoder 230.
- the image data and encoding information extractor 220 may extract information about a maximum size of a coding unit of the current picture from a header for the current picture.
- the image data and encoding information extractor 220 extracts information about a coded depth and an encoding mode for the coding units having a tree structure for each maximum coding unit, from the parsed bitstream.
- the extracted information about the coded depth and the coding mode is output to the image data decoder 230. That is, the image data of the bit string may be divided into maximum coding units so that the image data decoder 230 may decode the image data for each maximum coding unit.
- the information about the coded depth and the encoding mode for each largest coding unit may be set with respect to one or more coded depth information, and the information about the coding mode according to the coded depths may include partition type information, prediction mode information, and transformation unit of the corresponding coding unit. May include size information and the like.
- split information for each depth may be extracted as the coded depth information.
- the information about the coded depth and the encoding mode according to the maximum coding units extracted by the image data and the encoding information extractor 220 may be encoded according to the depth according to the maximum coding unit, as in the video encoding apparatus 100 according to an embodiment.
- the image data and the encoding information extractor 220 may determine the predetermined data.
- Information about a coded depth and an encoding mode may be extracted for each unit. If the information about the coded depth and the coding mode of the maximum coding unit is recorded for each of the predetermined data units, the predetermined data units having the information about the same coded depth and the coding mode are inferred as data units included in the same maximum coding unit. Can be.
- the image data decoder 230 reconstructs the current picture by decoding image data of each maximum coding unit based on the information about the coded depth and the encoding mode for each maximum coding unit. That is, the image data decoder 230 may decode the encoded image data based on the read partition type, the prediction mode, and the transformation unit for each coding unit among the coding units having the tree structure included in the maximum coding unit. Can be.
- the decoding process may include a prediction process including intra prediction and motion compensation, and a frequency inverse transform process.
- the image data decoder 230 may perform intra prediction or motion compensation according to each partition and prediction mode for each coding unit based on partition type information and prediction mode information of the prediction unit of the coding unit for each coding depth. .
- the image data decoder 230 may perform frequency inverse transformation according to each transformation unit for each coding unit based on size information of the transformation unit of the coding unit for each coding depth, for a frequency inverse transformation for each maximum coding unit. have.
- the image data decoder 230 may determine the coded depth of the current maximum coding unit by using the split information for each depth. If the split information indicates that the split information is no longer split at the current depth, the current depth is the coded depth. Therefore, the image data decoder 230 may decode the coding unit of the current depth using the partition type, the prediction mode, and the transformation unit size information of the prediction unit with respect to the image data of the current maximum coding unit.
- the image data decoder 230 It may be regarded as one data unit to be decoded in the same encoding mode.
- the receiver 210 and the image data and encoding information extractor 220 may include a syntax (max_dec_frame buffering) indicating a maximum size of a buffer required to decode an image frame in a decoder, and a syntax indicating a number of image frames requiring reordering ( num_reorder_frames and a syntax (max_latency_increase) indicating the latency information of the image frame having the largest difference in decoding order and display order among the image frames constituting the image sequence from the bitstream to the image data decoder 230.
- Decryption is performed at the outputting network abstraction layer.
- the video decoding apparatus 200 may obtain information about a coding unit that generates a minimum coding error by recursively encoding each maximum coding unit in an encoding process, and use the same to decode the current picture. have. That is, decoding of encoded image data of coding units having a tree structure determined as an optimal coding unit for each maximum coding unit can be performed.
- the image data can be efficiently used according to the coding unit size and the encoding mode that are adaptively determined according to the characteristics of the image by using the information about the optimum encoding mode transmitted from the encoding end. Can be decoded and restored.
- 3 illustrates a concept of hierarchical coding units.
- a size of a coding unit may be expressed by a width x height, and may include 32x32, 16x16, and 8x8 from a coding unit having a size of 64x64.
- Coding units of size 64x64 may be partitioned into partitions of size 64x64, 64x32, 32x64, and 32x32, coding units of size 32x32 are partitions of size 32x32, 32x16, 16x32, and 16x16, and coding units of size 16x16 are 16x16.
- Coding units of size 8x8 may be divided into partitions of size 8x8, 8x4, 4x8, and 4x4, into partitions of 16x8, 8x16, and 8x8.
- the resolution is set to 1920x1080, the maximum size of the coding unit is 64, and the maximum depth is 2.
- the resolution is set to 1920x1080, the maximum size of the coding unit is 64, and the maximum depth is 3.
- the resolution is set to 352x288, the maximum size of the coding unit is 16, and the maximum depth is 1.
- the maximum depth illustrated in FIG. 3 represents the total number of divisions from the maximum coding unit to the minimum coding unit.
- the maximum size of the coding size is relatively large not only to improve the coding efficiency but also to accurately shape the image characteristics. Accordingly, the video data 310 or 320 having a higher resolution than the video data 330 may be selected to have a maximum size of 64.
- the coding unit 315 of the video data 310 is divided twice from a maximum coding unit having a long axis size of 64, and the depth is deepened by two layers, so that the long axis size is 32, 16. Up to coding units may be included.
- the coding unit 335 of the video data 330 is divided once from coding units having a long axis size of 16, and the depth is deepened by one layer to increase the long axis size to 8. Up to coding units may be included.
- the coding unit 325 of the video data 320 is divided three times from the largest coding unit having a long axis size of 64, and the depth is three layers deep, so that the long axis size is 32, 16. , Up to 8 coding units may be included. As the depth increases, the expressive power of the detailed information may be improved.
- FIG. 4 is a block diagram of an image encoder based on coding units, according to an embodiment of the present invention.
- the image encoder 400 includes operations performed by the encoding unit determiner 120 of the video encoding apparatus 100 to encode image data. That is, the intra predictor 410 performs intra prediction on the coding unit of the intra mode among the current frame 405, and the motion estimator 420 and the motion compensator 425 are the current frame 405 of the inter mode. And the inter frame estimation and motion compensation using the reference frame 495.
- Data output from the intra predictor 410, the motion estimator 420, and the motion compensator 425 is output as a quantized transform coefficient through the frequency converter 430 and the quantizer 440.
- the quantized transform coefficients are restored to the data of the spatial domain through the inverse quantizer 460 and the frequency inverse transformer 470, and the recovered data of the spatial domain is passed through the deblocking block 480 and the loop filtering unit 490. It is post-processed and output to the reference frame 495.
- the quantized transform coefficients may be output to the bitstream 455 through the entropy encoder 450.
- the entropy encoder 450 may include a maximum decoding frame buffering syntax (max_dec_frame buffering) indicating a maximum size of a buffer required for decoding an image frame in a decoder, and a reordering frame number syntax indicating a number of image frames requiring reordering (num_reorder_frames). And a maximum delay increment syntax (max_latency_increase) for determining a maximum delay frame syntax (MaxLatencyFrame) or a maximum delay frame syntax (MaxLatencyFrame) representing a maximum value of a difference between an encoding order and a display order of the image frames constituting the image sequence.
- the bitstream may be generated by mapping in units.
- the entropy encoder 450 may determine a maximum decoding frame buffering syntax (max_dec_frame buffering) indicating the maximum size of a buffer required for decoding an image frame in the decoder, and the number of image frames that need to be rearranged.
- Sequence Parameter Set which is header information including information related to encoding of the entire video sequence, indicating maximum number of reordering frames (num_reorder_frames) and maximum delayed frame syntax (max_atency_increase) for determining the maximum delayed frame syntax (MaxLatencyFrame). (Hereinafter referred to as 'SPS') as an essential component.
- an intra predictor 410, a motion estimator 420, a motion compensator 425, and a frequency converter that are components of the image encoder 400 may be used.
- 430, quantization unit 440, entropy encoding unit 450, inverse quantization unit 460, frequency inverse transform unit 470, deblocking unit 480, and loop filtering unit 490 are all the maximum coding units. In each case, an operation based on each coding unit among the coding units having a tree structure should be performed in consideration of the maximum depth.
- the intra predictor 410, the motion estimator 420, and the motion compensator 425 partition each coding unit among coding units having a tree structure in consideration of the maximum size and the maximum depth of the current maximum coding unit.
- a prediction mode, and the frequency converter 430 should determine the size of a transform unit in each coding unit among the coding units having a tree structure.
- FIG. 5 is a block diagram of an image decoder based on coding units, according to an embodiment of the present invention.
- the bitstream 505 is parsed through the parsing unit 510, and the encoded image data to be decoded and information about encoding necessary for decoding are parsed.
- the parser 510 includes a maximum decoding frame buffering syntax (max_dec_frame buffering) indicating the maximum size of a buffer required to decode an image frame included as an essential component in the SPS, and the number of rearranged frames indicating the number of image frames requiring reordering.
- a maximum delay increase syntax (max_latency_increase) for determining syntax (num_reorder_frames) and maximum delay frame syntax (MaxLatencyFrame) is obtained from the bitstream and output to the entropy decoder 520.
- maximum delay increase syntax max_latency_increase
- MaxLatencyFrame maximum delay frame syntax
- the parser 510 and the entropy decoder 520 are illustrated as separate components, but the process of acquiring the syntax data related to the encoded image data and the acquisition of the image data performed by the parser 510 is performed. May be implemented to be performed by the entropy decoding unit 520.
- the encoded image data is output as inverse quantized data through the entropy decoder 520 and the inverse quantizer 530, and the image data of the spatial domain is restored through the frequency inverse transformer 540.
- the intra prediction unit 550 performs intra prediction on the coding unit of the intra mode, and the motion compensator 560 uses the reference frame 585 together to apply the coding unit of the inter mode. Perform motion compensation for the
- the image frame data reconstructed through the intra predictor 550 and the motion compensator 560 is post-processed by the deblocking unit 570 and output to the DPB 580 which is a decoded picture buffer.
- the DPB 580 is a decoded picture buffer that stores the decoded image frame for storing the reference frame, switching the display order of the image frame, and outputting the image frame. While the DPB 580 stores the decoded image frame, the maximum decoding frame buffering syntax (max_dec_frame buffering) indicating the maximum buffer size required to normally decode the image frame output from the parser 510 or the entropy decoder 520. Set the maximum size of the buffer required for normal decoding of the video sequence using.
- the DPB 580 is first decoded and stored by using a maximum delay increase syntax (max_latency_increase) for determining a reordering frame number syntax (num_reorder_frames) indicating the number of image frames requiring reordering and a maximum delay frame syntax (MaxLatencyFrame). It may be determined whether to output a reference image frame. A detailed process of outputting the reference image frame stored in the DPB 580 will be described later.
- a maximum delay increase syntax (max_latency_increase) for determining a reordering frame number syntax (num_reorder_frames) indicating the number of image frames requiring reordering
- MaxLatencyFrame maximum delay frame syntax
- step-by-step operations after the parser 510 of the image decoder 500 may be performed.
- the parser 510, the entropy decoder 520, the inverse quantizer 530, and the frequency inverse transform unit which are components of the image decoder 500 may be used.
- the 540, the intra predictor 550, the motion compensator 560, and the deblocking unit 570 may perform decoding operations based on coding units having a tree structure for each maximum coding unit.
- the intra predictor 550 and the motion compensator 560 determine partitions and a prediction mode for each coding unit having a tree structure
- the frequency inverse transformer 540 may determine the size of the transform unit for each coding unit. have.
- FIG. 6 is a diagram of deeper coding units according to depths, and partitions, according to an embodiment of the present invention.
- the video encoding apparatus 100 according to an embodiment and the video decoding apparatus 200 according to an embodiment use hierarchical coding units to consider image characteristics.
- the maximum height, width, and maximum depth of the coding unit may be adaptively determined according to the characteristics of the image, and may be variously set according to a user's request. According to the maximum size of the preset coding unit, the size of the coding unit for each depth may be determined.
- the hierarchical structure 600 of a coding unit illustrates a case in which a maximum height and a width of a coding unit are 64 and a maximum depth is four. Since the depth deepens along the vertical axis of the hierarchical structure 600 of the coding unit according to an embodiment, the height and the width of the coding unit for each depth are divided. In addition, a prediction unit and a partition on which the prediction encoding of each depth-based coding unit is shown along the horizontal axis of the hierarchical structure 600 of the coding unit are illustrated.
- the coding unit 610 has a depth of 0 as the largest coding unit of the hierarchical structure 600 of the coding unit, and the size, ie, the height and width, of the coding unit is 64x64.
- the depth is deeper along the vertical axis, the coding unit 620 of depth 1 having a size of 32x32, the coding unit 630 of depth 2 having a size of 16x16, the coding unit 640 of depth 3 having a size of 8x8, and the depth 4 of depth 4x4.
- the coding unit 650 exists.
- a coding unit 650 having a depth of 4 having a size of 4 ⁇ 4 is a minimum coding unit.
- Prediction units and partitions of the coding unit are arranged along the horizontal axis for each depth. That is, if the coding unit 610 of size 64x64 having a depth of zero is a prediction unit, the prediction unit may include a partition 610 of size 64x64, partitions 612 of size 64x32, and size included in the coding unit 610 of size 64x64. 32x64 partitions 614, 32x32 partitions 616.
- the prediction unit of the coding unit 620 having a size of 32x32 having a depth of 1 includes a partition 620 of size 32x32, partitions 622 of size 32x16 and a partition of size 16x32 included in the coding unit 620 of size 32x32. 624, partitions 626 of size 16x16.
- the prediction unit of the coding unit 630 of size 16x16 having a depth of 2 includes a partition 630 of size 16x16, partitions 632 of size 16x8, and a partition of size 8x16 included in the coding unit 630 of size 16x16. 634, partitions 636 of size 8x8.
- the prediction unit of the coding unit 640 of size 8x8 having a depth of 3 includes a partition 640 of size 8x8, partitions 642 of size 8x4 and a partition of size 4x8 included in the coding unit 640 of size 8x8. 644, partitions 646 of size 4x4.
- the coding unit 650 of size 4x4 having a depth of 4 is the minimum coding unit and the coding unit of the lowest depth, and the corresponding prediction unit may also be set only as the partition 650 having a size of 4x4.
- the coding unit determiner 120 of the video encoding apparatus 100 may determine a coding depth of the maximum coding unit 610.
- the number of deeper coding units according to depths for including data having the same range and size increases as the depth increases. For example, four coding units of depth 2 are required for data included in one coding unit of depth 1. Therefore, in order to compare the encoding results of the same data for each depth, each of the coding units having one depth 1 and four coding units having four depths 2 should be encoded.
- encoding may be performed for each prediction unit of a coding unit according to depths along a horizontal axis of the hierarchical structure 600 of the coding unit, and a representative coding error, which is the smallest coding error at a corresponding depth, may be selected. .
- a depth deeper along the vertical axis of the hierarchical structure 600 of the coding unit the encoding may be performed for each depth, and the minimum coding error may be searched by comparing the representative coding error for each depth.
- the depth and the partition in which the minimum coding error occurs in the maximum coding unit 610 may be selected as the coding depth and the partition type of the maximum coding unit 610.
- FIG. 7 illustrates a relationship between coding units and transformation units, according to an embodiment of the present invention.
- the video encoding apparatus 100 encodes or decodes an image in coding units having a size smaller than or equal to the maximum coding unit for each maximum coding unit.
- the size of a transform unit for frequency transformation during the encoding process may be selected based on a data unit that is not larger than each coding unit.
- the 32x32 transform unit 720 may be selected. Frequency conversion can be performed using the above.
- the data of the 64x64 coding unit 710 is encoded by performing frequency transformation on the 32x32, 16x16, 8x8, and 4x4 transform units having a size of 64x64 or less, and the transform unit having the least error with the original is obtained. Can be selected.
- FIG. 8 illustrates encoding information according to depths, according to an embodiment of the present invention.
- the output unit 130 of the video encoding apparatus 100 is information about an encoding mode, and information about a partition type 800 and information 810 about a prediction mode for each coding unit of each coded depth.
- the information 820 about the size of the transformation unit may be encoded and transmitted.
- the information about the partition type 800 is a data unit for predictive encoding of the current coding unit and indicates information about a partition type in which the prediction unit of the current coding unit is divided.
- the current coding unit CU_0 of size 2Nx2N may be any one of a partition 802 of size 2Nx2N, a partition 804 of size 2NxN, a partition 806 of size Nx2N, and a partition 808 of size NxN. It can be divided and used.
- the information 800 about the partition type of the current coding unit represents one of a partition 802 of size 2Nx2N, a partition 804 of size 2NxN, a partition 806 of size Nx2N, and a partition 808 of size NxN. It is set to.
- Information 810 relating to the prediction mode indicates the prediction mode of each partition. For example, through the information 810 about the prediction mode, whether the partition indicated by the information 800 about the partition type is performed in one of the intra mode 812, the inter mode 814, and the skip mode 816 is performed. Whether or not can be set.
- the information about the transform unit size 820 indicates whether to transform the current coding unit based on the transform unit.
- the transform unit may be one of a first intra transform unit size 822, a second intra transform unit size 824, a first inter transform unit size 826, and a second intra transform unit size 828. have.
- the image data and encoding information extractor 210 of the video decoding apparatus 200 may include information about a partition type 800, information 810 about a prediction mode, and transformation for each depth-based coding unit. Information 820 about the unit size may be extracted and used for decoding.
- FIG. 9 is a diagram of deeper coding units according to depths, according to an embodiment of the present invention.
- Segmentation information may be used to indicate a change in depth.
- the split information indicates whether a coding unit of a current depth is split into coding units of a lower depth.
- the prediction unit 910 for predictive encoding of the coding unit 900 having depth 0 and 2N_0x2N_0 size includes a partition type 912 having a size of 2N_0x2N_0, a partition type 914 having a size of 2N_0xN_0, a partition type 916 having a size of N_0x2N_0, and a N_0xN_0 It may include a partition type 918 of size. Although only partitions 912, 914, 916, and 918 in which the prediction unit is divided by a symmetrical ratio are illustrated, as described above, the partition type is not limited thereto, and asymmetric partitions, arbitrary partitions, geometric partitions, and the like. It may include.
- prediction coding For each partition type, prediction coding must be performed repeatedly for one 2N_0x2N_0 partition, two 2N_0xN_0 partitions, two N_0x2N_0 partitions, and four N_0xN_0 partitions.
- prediction encoding For partitions having a size 2N_0x2N_0, a size N_0x2N_0, a size 2N_0xN_0, and a size N_0xN_0, prediction encoding may be performed in an intra mode and an inter mode. The skip mode may be performed only for prediction encoding on partitions having a size of 2N_0x2N_0.
- the depth 0 is changed to 1 and split (920), and the encoding is repeatedly performed on the depth 2 and the coding units 930 of the partition type having the size N_0xN_0.
- the depth 1 is changed to the depth 2 and divided (950), and repeatedly for the depth 2 and the coding units 960 of the size N_2xN_2.
- the encoding may be performed to search for a minimum encoding error.
- the split information for each depth may be set until the depth d-1, and the split information may be set up to the depth d-2. That is, when encoding is performed from the depth d-2 to the depth d-1 to the depth d-1, the prediction encoding of the coding unit 980 of the depth d-1 and the size 2N_ (d-1) x2N_ (d-1)
- the prediction unit for 990 is a partition type 992 of size 2N_ (d-1) x2N_ (d-1), partition type 994 of size 2N_ (d-1) xN_ (d-1), size A partition type 996 of N_ (d-1) x2N_ (d-1) and a partition type 998 of size N_ (d-1) xN_ (d-1) may be included.
- one partition 2N_ (d-1) x2N_ (d-1), two partitions 2N_ (d-1) xN_ (d-1), two sizes N_ (d-1) x2N_ Prediction encoding is repeatedly performed for each partition of (d-1) and four partitions of size N_ (d-1) xN_ (d-1), so that a partition type having a minimum encoding error may be searched. .
- the coding unit CU_ (d-1) of the depth d-1 is no longer
- the encoding depth of the current maximum coding unit 900 may be determined as the depth d-1, and the partition type may be determined as N_ (d-1) xN_ (d-1) without going through a division process into lower depths.
- split information is not set for the coding unit 952 having the depth d-1.
- the data unit 999 may be referred to as a 'minimum unit' for the current maximum coding unit.
- the minimum unit may be a square data unit having a size obtained by dividing the minimum coding unit, which is the lowest coding depth, into four divisions.
- the video encoding apparatus 100 compares the encoding errors for each depth of the coding unit 900, selects a depth at which the smallest encoding error occurs, and determines a coding depth.
- the partition type and the prediction mode may be set to the encoding mode of the coded depth.
- the depth with the smallest error can be determined by comparing the minimum coding errors for all depths of depths 0, 1, ..., d-1, d, and can be determined as the coding depth.
- the coded depth, the partition type of the prediction unit, and the prediction mode may be encoded and transmitted as information about an encoding mode.
- the coding unit since the coding unit must be split from the depth 0 to the coded depth, only the split information of the coded depth is set to '0', and the split information for each depth except the coded depth should be set to '1'.
- the image data and encoding information extractor 220 of the video decoding apparatus 200 may extract information about a coding depth and a prediction unit for the coding unit 900 and use the same to decode the coding unit 912. Can be.
- the video decoding apparatus 200 may identify a depth having split information of '0' as a coding depth using split information according to depths, and may use it for decoding by using information about an encoding mode for a corresponding depth. have.
- 10, 11, and 12 illustrate a relationship between a coding unit, a prediction unit, and a frequency transformation unit, according to an embodiment of the present invention.
- the coding units 1010 are coding units according to coding depths determined by the video encoding apparatus 100 according to an embodiment with respect to the maximum coding unit.
- the prediction unit 1060 is partitions of prediction units of each coding depth of each coding depth among the coding units 1010, and the transformation unit 1070 is transformation units of each coding depth for each coding depth.
- the depth-based coding units 1010 have a depth of 0
- the coding units 1012 and 1054 have a depth of 1
- the coding units 1014, 1016, 1018, 1028, 1050, and 1052 have depths.
- coding units 1020, 1022, 1024, 1026, 1030, 1032, and 1048 have a depth of three
- coding units 1040, 1042, 1044, and 1046 have a depth of four.
- partitions 1014, 1016, 1022, 1032, 1048, 1050, 1052, and 1054 of the prediction units 1060 are obtained by splitting coding units. That is, partitions 1014, 1022, 1050, and 1054 are partition types of 2NxN, partitions 1016, 1048, and 1052 are partition types of Nx2N, and partitions 1032 are partition types of NxN. Prediction units and partitions of the coding units 1010 according to depths are smaller than or equal to each coding unit.
- the image data of the part 1052 of the transformation units 1070 may be frequency transformed or inversely transformed in a data unit having a smaller size than the coding unit.
- the transformation units 1014, 1016, 1022, 1032, 1048, 1050, 1052, and 1054 are data units having different sizes or shapes when compared to corresponding prediction units and partitions among the prediction units 1060. That is, the video encoding apparatus 100 according to an embodiment and the video decoding apparatus 200 according to the embodiment may be an intra prediction / motion estimation / motion compensation operation and a frequency transform / inverse transform operation for the same coding unit. Each can be performed based on separate data units.
- coding is performed recursively for each coding unit having a hierarchical structure for each largest coding unit to determine an optimal coding unit.
- coding units having a recursive tree structure may be configured.
- the encoding information may include split information about a coding unit, partition type information, prediction mode information, and transformation unit size information. Table 1 below shows an example that can be set in the video encoding apparatus 100 and the video decoding apparatus 200 according to an embodiment.
- the output unit 130 of the video encoding apparatus 100 outputs encoding information about coding units having a tree structure
- the encoding information extraction unit of the video decoding apparatus 200 according to an embodiment 220 may extract encoding information about coding units having a tree structure from the received bitstream.
- the split information indicates whether the current coding unit is split into coding units of a lower depth. If the split information of the current depth d is 0, partition type information, prediction mode, and transform unit size information are defined for the coded depth because the depth in which the current coding unit is no longer divided into the lower coding units is a coded depth. Can be. If it is to be further split by the split information, encoding should be performed independently for each coding unit of the divided four lower depths.
- the prediction mode may be represented by one of an intra mode, an inter mode, and a skip mode.
- Intra mode and inter mode can be defined in all partition types, and skip mode can be defined only in partition type 2Nx2N.
- the partition type information indicates the symmetric partition types 2Nx2N, 2NxN, Nx2N, and NxN, in which the height or width of the prediction unit is divided by the symmetric ratio, and the asymmetric partition types 2NxnU, 2NxnD, nLx2N, nRx2N, which are divided by the asymmetric ratio.
- the asymmetric partition types 2NxnU and 2NxnD are divided into heights 1: 3 and 3: 1, respectively, and the asymmetric partition types nLx2N and nRx2N are divided into 1: 3 and 3: 1 widths, respectively.
- the conversion unit size may be set to two kinds of sizes in the intra mode and two kinds of sizes in the inter mode. That is, if the transformation unit split information is 0, the size of the transformation unit is set to the size 2Nx2N of the current coding unit. If the transform unit split information is 1, a transform unit having a size obtained by dividing the current coding unit may be set. In addition, if the partition type for the current coding unit having a size of 2Nx2N is a symmetric partition type, the size of the transform unit may be set to NxN, and if the asymmetric partition type is N / 2xN / 2.
- Encoding information of coding units having a tree structure may be allocated to at least one of a coding unit, a prediction unit, and a minimum unit unit of a coding depth.
- the coding unit of the coding depth may include at least one prediction unit and at least one minimum unit having the same encoding information.
- the encoding information held by each adjacent data unit is checked, it may be determined whether the adjacent data units are included in the coding unit having the same coding depth.
- the coding unit of the corresponding coding depth may be identified by using the encoding information held by the data unit, the distribution of the coded depths within the maximum coding unit may be inferred.
- the encoding information of the data unit in the depth-specific coding unit adjacent to the current coding unit may be directly referred to and used.
- the prediction coding when the prediction coding is performed by referring to the neighboring coding unit, the data adjacent to the current coding unit in the coding unit according to depths is encoded by using the encoding information of the adjacent coding units according to depths.
- the neighboring coding unit may be referred to by searching.
- FIG. 13 illustrates a relationship between coding units, prediction units, and transformation units, according to encoding mode information of Table 1.
- the maximum coding unit 1300 includes coding units 1302, 1304, 1306, 1312, 1314, 1316, and 1318 of a coded depth. Since one coding unit 1318 is a coding unit of a coded depth, split information may be set to zero.
- the partition type information of the coding unit 1318 having a size of 2Nx2N is partition type 2Nx2N 1322, 2NxN 1324, Nx2N 1326, NxN 1328, 2NxnU 1332, 2NxnD 1334, nLx2N (1336). And nRx2N 1338.
- partition type information is set to one of symmetric partition types 2Nx2N (1322), 2NxN (1324), Nx2N (1326), and NxN (1328)
- the conversion unit of size 2Nx2N when the conversion unit partition information (TU size flag) is 0 1134 is set, and if the transform unit split information is 1, a transform unit 1344 of size NxN may be set.
- the partition type information is set to one of the asymmetric partition types 2NxnU (1332), 2NxnD (1334), nLx2N (1336), and nRx2N (1338), if the conversion unit partition information (TU size flag) is 0, a conversion unit of size 2Nx2N ( 1352 is set, and if the transform unit split information is 1, a transform unit 1354 of size N / 2 ⁇ N / 2 may be set.
- the video encoding apparatus 100 and the video decoding apparatus 200 perform encoding and decoding by dividing the maximum coding unit into coding units smaller than or equal to the maximum coding unit.
- Data encoded in the video encoding apparatus 100 is multiplexed using a transmission data unit suitable for a protocol or a format of a communication channel, a storage media, a video editing system, a media framework, and the like. The unit is transmitted to the video decoding apparatus 200.
- the video decoding apparatus 200 When the video decoding apparatus 200 reproduces the video data, the video decoding apparatus 200 restores and reproduces the video data according to one of a trick play method and a normal play method.
- the trick play method includes a normal play method, a fast forward method, a fast backward method, and a random access method.
- the general reproduction method is a method of sequentially processing and reproducing all pictures included in video data.
- the fast forward or fast backward method is a method of forwarding or backwarding according to a reproduction speed and selecting and playing a reference picture, i.e., an I picture, every predetermined period.
- the random access method is a method of performing playback by skipping to a key picture of a predetermined position, that is, an I picture.
- an Instantaneous Decoder Refresh (IDR) picture is used as a key picture for random access.
- the IDR picture is an intra picture that refreshes the decoding apparatus at the moment of decoding the picture.
- the decoded picture buffer (DPB) marks a previously decoded picture except a IDR picture as a picture that is no longer referenced when the IDR picture is decoded, and the POC (Picture Order Count) is also initialized.
- POC Picture Order Count
- a picture to be decoded after the IDR picture is always behind the IDR picture in the display order, and can be decoded without reference to the picture before the IDR picture.
- a clean random access (CRA) picture is used as a key picture for random access in addition to the IDR picture.
- the CRA picture may be referred to as a clean decoding refresh (CDR) picture or a deferred decoding refresh (DDR) picture.
- a CRA picture is an intra picture and represents an intra picture having pictures that are encoded (or decoded) in advance of the display order but later than the CRA picture in the encoding (or decoding) order.
- a picture in a GOP same as a CRA picture, leading a picture that is encoded (or decoded) before the CRA picture but later encoded (or decoded) than the CRA picture in the encoding (or decoding) order. It is defined as a picture.
- IDR pictures and CRA pictures are both intra pictures that can be encoded (decoded) without referring to other pictures, and are common in that they are key pictures for random access, but IDR pictures are followed by pictures in the encoding (decoding) order.
- the IDR picture is not preceded in the display order, as described above, the CRA picture follows the encoding (decoding) order, but there are leading pictures in the display order.
- the decoding order and encoding order mean the processing order of pictures on the decoding side and the encoding side, respectively, and the encoding order of the pictures is the same as the decoding order. Therefore, in the following description of the present invention, the encoding order may mean a decoding order, and the decoding order may also mean an encoding order.
- 14A and 14B are diagrams for describing a decoding process of a CRA picture during normal playback and random access according to an embodiment of the present invention.
- Bi and bi are bi-predictive pictures predicted using L0 prediction and L1 prediction, and i indicates a display order, that is, a POC.
- Bi denoted by a capital letter indicates a picture used as a reference picture of another picture
- bi denoted by a lowercase letter refers to a picture that is not used as a reference picture of another picture.
- the leading pictures 1420 decoded after the CRA 24 picture 1410 may be normally decoded with reference to a previously decoded reference picture.
- B 22 picture 1421 is B 18 picture L0 prediction and CRA 24 picture 1410 using the L1 prediction that refers to the city, the normal playback when that bi-directional prediction B 22 pictures which are referred to 1401 ( The 1421 may be normally decoded with reference to the CRA 24 picture 1410 and the B 18 picture 1401 previously decoded and stored in the DPB 1430.
- the L0 prediction for the prediction of the B 22 picture 1421 is performed by the reference picture in the L0 direction.
- the reference picture is determined based on the index.
- the B 6 picture 1402 previously decoded and stored in the DPB 1440 may be determined as a reference picture for L0 prediction of the B 22 picture 1421.
- the reference picture for L0 prediction of the B 22 picture 1421 should be the B 18 picture 1401, the reference picture between the B 6 picture 1402 and the CRA 24 picture 1410 due to random access. The pictures referring to them cannot be decoded normally.
- leading pictures 1420 are pictures that are displayed before the CRA 24 picture in the display order, the leading pictures 1420 are displayed after the CRA 24 picture 1410 is decoded and displayed through random access. ) Are not displayed and do not need to be decrypted.
- the video decoding apparatus 200 merely sequentially decodes and outputs input video data, whether the leading pictures 1420 are pictures decoded after the CRA 24 picture 1410 in normal playback, Otherwise, it is not possible to identify whether the picture is decoded after the CRA 24 picture 1410 by random access. In other words, the position of the video decoding apparatus 200 can not tell whether the CRA 24 picture 1410 is not that the current picture is decoded according to the random access picture to be decoded according to the normal reproduction.
- embodiments of the present invention decode a CRA picture to predetermined transmission unit data multiplexed with a coded CRA picture to distinguish whether the CRA picture is a picture decoded according to random access or a picture decoded according to normal reproduction. It provides a multiplexing scheme and a demultiplexing scheme that adds syntax for identifying a.
- FIG. 15 is a diagram illustrating a configuration of a video data multiplexing device according to an embodiment of the present invention.
- a video data multiplexing apparatus 1500 includes a video encoder 1510, a multiplexer 1520, and a reproduction state identifier 1530.
- the video encoder 1510 corresponds to the image encoding apparatus 100 of FIG. 1 described above, and the video is based on the hierarchical coding unit described above in the video coding layer that processes the encoding process of the video data itself. Encode the data.
- the multiplexer 1520 multiplexes the video data using a transmission data unit suitable for a protocol or a storage format of a communication channel, a storage media, a video editing system, a media framework, or the like. As described below, the multiplexer 1520 may multiplex video data using an NAL unit which is a transmission unit in a network abstraction layer (NAL).
- NAL network abstraction layer
- the playback state identification unit 1530 may transmit a request for transmission of video data encoded by a client connected through a communication channel, a device managing a storage medium, a video editing system, a media framework (hereinafter, collectively referred to as a "decoding device"), and the like. If so, it is identified whether this transmission request is for sequentially playing video data provided in accordance with normal playback or for transmitting video data for random access.
- the reproduction state identification unit 1530 may compare the display time of the picture requested from the decoding apparatus with the display time of the picture currently displayed on the decoding apparatus to identify whether the request for transmitting the video data is a request for transmitting the video data by random access. Can be.
- the multiplexer 1520 is based on the result of the determination of the reproduction state identification unit 1530, any of a request for normal access and a request for random access in a NAL unit including information on a CRA picture, which is a key picture for random access. A predetermined syntax indicating whether a CRA picture is provided upon request is added.
- 16 is a diagram illustrating a configuration of an NAL unit according to an embodiment of the present invention.
- the NAL unit 1600 includes two parts, a NAL header 1610 and a raw byte sequence payload (RBSP) 1620.
- the RBSP fill bit 1630 is a length adjusting bit pasted to the rear of the RBSP 1620 to express the length of the RBSP 1620 in multiples of 8 bits.
- the RBSP fill bit 1630 consists of consecutive '0's starting from' 1 'and then determined according to the length of the RBSP 1620, having a pattern such as' 100 ....' and the first bit value. Searching for '1' may determine the last bit position of the RBSP 1620 just before it.
- the NAL header 1610 includes a flag (nal_ref_idc) indicating whether or not a slice including the corresponding NAL unit 1600 is a reference picture is included.
- the NAL header 1610 according to an embodiment has a status indicating whether a CRA picture is provided in response to a request for normal access and a request for random access in a NAL unit including information on the above-described CRA picture.
- An identification syntax 1612 is included.
- the state identification syntax 1612 for identifying the reproduction state of such a CRA picture may be included in an identifier (nal unit type) indicating the type of the NAL unit 1600. That is, the NAL unit multiplexed with the CRA picture provided according to the request according to normal reproduction and the NAL unit multiplexed with the CRA picture provided according to the request for random access may be set to have different types of identifiers (nal unit type). Can be.
- Table 2 shows an example of the type of the NAL unit 1600 according to the value of the identifier nal_unit_type.
- nal_unit_type Type of NAL Unit 0 Unspecified One Picture slices other than RAP, TFD, and TLA pictures 2 TFD picture slice 3 TLA picture slice, not TFD 4,5 Slice of CRA Picture 6,7 Slice of BLA Picture 8 Slice of IDR Picture 9-24 Reserved for future expansion 25 VPS 26 SPS 27 PPS 28 APS 29 AU Delimiter 30 Filler data 31 Supplemental Enhancement Information (SEI) 32-47 Reserved for future expansion 48-63 Unspecified
- the multiplexer 1520 may identify an NAL unit multiplexed with a CRA picture provided according to a request for normal reproduction and an NAL unit multiplexed with a CRA picture provided according to a request for random access, as shown in Table 2 below.
- Table 2 By assigning different values of 4 and 5 as (nal_unit_type), respectively, the NAL unit having information on the CRA picture is signaled which of the CRA picture provided by normal playback and the CRA picture provided by random access. Can be.
- the multiplexer 1520 is a syntax added to a header of a NAL unit.
- the multiplexer 1520 is a NAL unit multiplexed with a CRA picture provided according to a request for normal reproduction and a NAL unit multiplexed with a CRA picture provided according to a request for random access. May use flags set to have different values of either 0 or 1, respectively.
- 17A and 17B are diagrams for describing a decoding process of a CRA picture during normal playback and random access according to another embodiment of the present invention.
- the multiplexer 1520 adds type information directly indicating a reproduction state of a CRA picture to the NAL unit. According to another embodiment, the multiplexer 1520, instead of directly signaling a playback state type of the CRA picture, counters of the decoded key pictures prior to the CRA picture and reference of the leading pictures, in advance of the decoding order, before the CRA picture. Information on the POC of the picture used as the picture can be used to identify whether the CRA is in a normal playback state or in a state reproduced by random access.
- B 38 pictures 1710 and B 40 pictures 1720 referenced by leading pictures b 41 , B 42 , and b 43 pictures as pictures to be decoded before the CRA 44 picture.
- the B 38 picture 1710 is referred to by a B 42 picture which is a leading picture
- the B 40 picture 1720 is referred to by a b 41 which is a leading picture.
- the B 38 picture 1710 and the B 40 picture 1720 used as reference pictures of the leading pictures are defined as brother pictures.
- the reason for defining such a sibling picture is that a POC of a sibling picture can be used to identify whether a CRA picture is in a normal play state or a play state by random access.
- the B 38 picture 1710 and the B 40 picture 1720 that were previously decoded at the time of decoding the CRA 44 picture are divided into DPBs. Stored at 1740.
- CRA if 44 brother-picture in a slice header of the picture B 38 picture 1710 of the POC value 38 and, B POC value, 40 of 40 picture 1720 are added, the decoding side DPB (1740 from the decoding time of the CRA 44 picture ) on whether, CRA 44 picture is that the picture to be reproduced by random access, a picture to be reproduced in accordance with the normal playback by comparing the POC of brother-picture included in the POC with the slice header of the CRA 44 the picture of the picture before the decoding to the stored Can be identified.
- the POC information of such sibling pictures may confuse whether the current CRA 44 picture is a picture by random access or a picture reproduced by normal reproduction.
- B 40 picture 1745 The POC value of 40 is stored, and since the POC value of the sibling picture included in the slice header of the CRA 44 picture is equal to the POC value of the previous picture stored in the DPB, the current CRA 44 picture is reproduced by normal playback. It can be mistaken as a picture. As such, the reason why the POC information of the sibling picture alone cannot accurately identify the playback state of the CRA picture is that the POC is reset every time the IDR picture is decoded. This is because a case may have a POC equal to a POC of sibling pictures.
- the multiplexer 1520 may reset the POC or encode the CRA picture during the process of encoding not only the POC information of the sibling picture but also pictures prior to the CRA picture in the syntax of the transmission unit data of the CRA picture.
- a PDC POC discontinuity counter
- PDC PDC discontinuity counter
- the multiplexer 1520 increases the PDC by 1 each time a POC is reset or a CRA picture is encoded in the process of encoding pictures. Since the POC is reset every time the IDR picture is encoded, the value of the PDC increases by 1 every time the IDR picture is encoded, and the value of the PDC also increases by 1 even when the previous CRA picture except for the current CRA 44 picture is encoded.
- the multiplexer 1520 adds the PDC value to the header 1740 of the transmission unit data of the CRA picture together with the POC of the sibling picture.
- the decoding side increases the PDC by 1 each time the POC is reset, i.e., decodes the IDR picture or decodes the CRA picture in the process of decoding the input transmission unit data.
- the decoding side increases the PDC by 1 each time the POC is reset, i.e., decodes the IDR picture or decodes the CRA picture in the process of decoding the input transmission unit data.
- the PDC value included in the header 1730 of multiplexing the CRA 44 pictures at the time of decoding the CRA 44 picture transmission unit of data it decodes the picture in the decoding side
- the counted PDC values 1745 are all equal to three.
- the PDC value 1785 is determined at the time when the CRA 44 picture is decoded by random access. It has a value of 2, which is different from 3, which is a PDC value included in the transmission data header 1770 multiplexed with the CRA 44 picture. Accordingly, the decoding side may determine that the current CRA picture is a picture reproduced by random access based on the mismatch of the PDC values.
- FIG. 18 is a flowchart illustrating a method of multiplexing video data according to an embodiment of the present invention.
- the video encoder 1510 encodes pictures constituting video data based on a data unit having a hierarchical structure.
- the video encoder 1510 hierarchically hierarchically according to a depth indicating the number of spatial divisions of the largest coding unit for at least one largest coding unit that divides a picture constituting a video into coding units having the largest size. From among the coding units according to depths, coding units having a tree structure including coding units of coding depths are determined, partitions for prediction coding are determined for each coding unit of the coding depths, and transformation units of a hierarchical structure are determined. The transformation is performed on the basis of the transformation unit according to the tree structure. In determining the hierarchical data unit, an optimal hierarchical data unit structure may be determined based on a RD (Rate Distortion) cost.
- RD Red Distortion
- the reproduction state identification unit 1530 determines whether the transmission request is a request for normal reproduction or a request for random access.
- the decoding apparatus collectively refers to a device that stores, plays, or edits encoded video data.
- the decoding apparatus may be a client connected through a communication channel, an apparatus for managing storage media, a video editing system, a media framework, and the like.
- the multiplexer 1520 may transmit a request for random access and a request for normal reproduction according to the determination result of operation 1820 on transmission unit data multiplexed with a CRA picture, which is an intra picture having leading pictures. It adds a certain syntax that indicates which of the requests is a CRA picture provided according to the request.
- a leading picture refers to a picture that is encoded before the CRA picture in the display order but after the CRA picture in the encoding order.
- the transmission unit data may be a NAL data unit.
- the multiplexer 1520 may include an NAL unit multiplexed with a CRA picture provided according to a request for normal reproduction and an intra picture provided according to a request for random access to an nal unit type indicating a type of the NAL unit.
- An identifier (nal unit type) may be added to the header of the NAL unit so that the multiplexed NAL unit has a different type of identifier (nal unit type).
- the multiplexer 1520 may set the NAL header to 0 according to whether the NRA unit multiplexes the CRA picture provided according to a request for normal reproduction and the NAL unit multiplexed the CRA picture provided according to a request for random access. Alternatively, a flag having a value of 1 may be added.
- the multiplexer 1520 obtains a POC discontinuity counter that increases by 1 each time a POC is reset or a CRA picture is encoded in the process of multiplexing pictures, and the POC information of the sibling picture of the CRA picture is obtained.
- picture order discontinuity counter can be added to the header of NAL unit.
- FIG. 19 illustrates a configuration of a video data demultiplexing apparatus according to an embodiment of the present invention.
- a video data demultiplexing apparatus 1900 includes a video decoder 1910, a demultiplexer 1920, and a playback state identifier 1930.
- the demultiplexer 1920 receives transmission unit data transmitted from the video data multiplexing apparatus 1500 of FIG. 15, that is, NAL unit data, and reproduces a normal CRA picture from NAL unit data obtained by multiplexing a CRA picture among the NAL unit data. And a syntax indicating which picture is decoded according to a state of random access.
- the reproduction state identification unit 1930 determines whether the CRA picture is a CRA picture in a normal reproduction state or a reproduction state by random access using the C acquired syntax.
- the NAL unit multiplexes the CRA picture provided in response to a request for normal reproduction to the nal unit type indicating the type of the NAL unit, and the NAL multiplexed the intra picture provided in response to a request for random access.
- the reproduction state identifier 1930 may recognize the decoding state of the current CRA picture through the values of these identifiers (nal unit types).
- the header of the NAL unit has a value of 0 or 1
- the reproduction state identification unit 1930 can know the decoding state of the current CRA picture from this flag information.
- the reproduction state identification unit 1930 may perform the IDR picture or the CRA in the process of decoding the previous pictures. Each time the picture is decoded, the PDC is increased, and it is determined whether the PDC acquired from the header of the NAL unit and the PDC counted in the decoding process are identical at the time of decoding the current CRA picture. In addition, the reproduction state identification unit 1930 determines whether the POC value of the sibling picture of the CRA picture included in the header of the NAL unit and the POC value of the previous pictures stored in the DPB at the decoding time of the current CRA picture are identical.
- the reproduction state identification unit 1930 determines that the current CRA picture is reproduced by random access, and the sameness of the PDC values of the PDC and the sibling picture is determined. If satisfied, it is determined that the current CRA picture is a picture reproduced by normal reproduction. If the current CRA picture is a picture reproduced by random access, since the leading pictures of the current CRA picture do not need to be decoded, the playback state identifier 1930 does not need to decode the leading pictures after the current CRA picture. The video decoder 1910 notifies.
- the video decoder 1910 corresponds to the image decoding apparatus 200 of FIG. 2 or the image decoding apparatus 500 of FIG. 5, and the video decoding unit 1910 may encode encoded image data and encoded data from an NAL unit.
- the decoding is performed by obtaining partition information, partition type information, prediction mode information, transform unit size information, and parameter set information related to a coding process used for generating.
- 20 is a flowchart illustrating a method of demultiplexing video data according to an embodiment of the present invention.
- the demultiplexer 1920 receives transmission unit data obtained by multiplexing a bitstream obtained by encoding pictures constituting video data based on a hierarchical structure of data units.
- the transmission unit data may be NAL unit data.
- the demultiplexer 1920 obtains a predetermined syntax indicating whether the CRA picture is a picture decoded according to a state of normal reproduction and random access from the NAL unit data multiplexed with the CRA picture among the NAL unit data. .
- the reproduction state identification unit 1930 identifies whether the CRA picture is a normal reproduced picture or a random access picture based on the obtained syntax. As described above, when the decoding state of the CRA picture is signaled through an identifier (nal unit type) in a header of a NAL unit, the reproduction state identification unit 1930 may determine the current CRA picture of the current CRA picture through the value of this identifier (nal unit type). The decryption state can be known. If a flag having a value of 0 or 1 is added to the header of the NAL unit, the reproduction state identification unit 1930 may recognize the decoding state of the current CRA picture from such flag information.
- the reproduction state identification unit 1930 may store the PDC counter and DPB obtained in the decoding process.
- the decoding state of the current CRA picture may be determined by determining whether the POC values of previous pictures, the PDC counter included in the NAL unit header, and the POCs of sibling pictures are the same.
- the leading pictures of the CRA picture are not displayed and do not need to be decoded.
- the system resource of the decoding side can be saved by not decoding the leading pictures of the CRA picture.
- the invention can also be embodied as computer readable code on a computer readable recording medium.
- the computer-readable recording medium includes all kinds of recording devices in which data that can be read by a computer system is stored. Examples of computer-readable recording media include ROM, RAM, CD-ROM, magnetic tape, floppy disk, optical data storage device, and the like.
- the computer readable recording medium can also be distributed over network coupled computer systems so that the computer readable code is stored and executed in a distributed fashion.
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
- Television Signal Processing For Recording (AREA)
- Time-Division Multiplex Systems (AREA)
- Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
- Signal Processing For Digital Recording And Reproducing (AREA)
Abstract
Description
분할 정보 0 (현재 심도 d의 크기 2Nx2N의 부호화 단위에 대한 부호화) | 분할 정보 1 | ||||
예측 모드 | 파티션 타입 | 변환 단위 크기 | 하위 심도 d+1의 부호화 단위들마다 반복적 부호화 | ||
인트라 인터스킵 (2Nx2N만) | 대칭형 파티션 타입 | 비대칭형 파티션 타입 | 변환 단위 분할 정보 0 | 변환 단위 분할 정보 1 | |
2Nx2N2NxNNx2NNxN | 2NxnU2NxnDnLx2NnRx2N | 2Nx2N | NxN (대칭형 파티션 타입) N/2xN/2 (비대칭형 파티션 타입) |
nal_unit_type | NAL 단위의 종류 |
0 | 미정의(Unspecified) |
1 | RAP, TFD, TLA 픽처 이외의 픽처 슬라이스 |
2 | TFD 픽처 슬라이스 |
3 | TFD가 아닌 TLA 픽처 슬라이스 |
4,5 | CRA 픽처의 슬라이스 |
6,7 | BLA 픽처의 슬라이스 |
8 | IDR 픽처의 슬라이스 |
9-24 | 장래 확장을 위해 사용(Reserved) |
25 | VPS |
26 | SPS |
27 | PPS |
28 | APS |
29 | AU 구분자(Access Unit Delimiter) |
30 | Filler data |
31 | Supplemental Enhancement Information(SEI) |
32-47 | 장래 확장을 위해 사용(Reserved) |
48-63 | 미정의(Unspecified) |
Claims (15)
- 비디오 데이터의 재생 상태 식별을 위한 비디오 데이터의 다중화 방법에 있어서,계층적 구조의 데이터 단위에 기초하여 상기 비디오 데이터를 구성하는 픽처들을 부호화하는 단계;복호화 장치로부터 상기 부호화된 데이터의 전송 요청이 있는 경우, 상기 전송 요청이 일반 재생에 따른 요청인지, 랜덤 액세스를 위한 요청인지 여부를 판단하는 단계; 및랜덤 액세스에 이용되는 인트라 픽처로서 상기 인트라 픽처보다 표시 순서상 앞서지만 부호화 순서상 상기 인트라 픽처보다 이후에 부호화되는 리딩(leading) 픽처들을 갖는 인트라 픽처를 다중화한 전송 단위 데이터에, 상기 판단 결과에 따라 상기 인트라 픽처가 일반 재생에 따른 요청 및 랜덤 액세스를 위한 요청 중 어떤 요청에 따라 제공되는 인트라 픽처인지를 나타내는 소정의 신택스를 부가하는 단계를 포함하는 것을 특징으로 하는 비디오 데이터의 다중화 방법.
- 제 1항에 있어서,상기 전송 단위 데이터는네트워크 추상 계층(Network Adaptive Layer:NAL) 단위의 데이터인 것을 특징으로 하는 비디오 데이터의 다중화 방법.
- 제 2항에 있어서,상기 소정의 신택스는상기 NAL 단위의 유형을 나타내는 식별자(nal unit type)이며, 상기 일반 재생에 따른 요청에 따라 제공되는 인트라 픽처를 다중화한 NAL 단위 및 상기 랜덤 액세스를 위한 요청에 따라 제공되는 인트라 픽처를 다중화한 NAL 단위가 서로 다른 유형의 식별자(nal unit type)를 갖도록 설정되는 것을 특징으로 하는 비디오 데이터의 다중화 방법.
- 제 1항에 있어서,상기 신택스를 부가하는 단계는상기 인트라 픽처보다 부호화 순서상 앞서면서, 상기 리딩 픽처들의 참조 픽처로 이용되는 형제 픽처의 POC(Picture Order Count)를 상기 전송 단위 데이터에 부가하는 단계;상기 인트라 픽처보다 이전의 픽처들을 부호화하는 과정 중에서 POC가 리셋되거나 상기 인트라 픽처를 부호화할 때마다 카운트가 증가하는 픽처 순서 불연속 카운터를 획득하는 단계;상기 픽처 순서 불연속 카운터를 상기 전송 단위 데이터에 부가하는 단계를 포함하는 것을 특징으로 하는 비디오 데이터의 다중화 방법.
- 제 1항에 있어서,상기 부호화하는 단계는상기 비디오를 구성하는 픽처를 최대 크기의 부호화 단위로 분할한 적어도 하나의 최대 부호화 단위마다, 상기 최대 부호화 단위의 공간적 분할 횟수를 나타내는 심도에 따라 계층적으로 구성되는 심도별 부호화 단위들 중에서, 부호화 심도의 부호화 단위들을 포함하는 트리 구조에 따른 부호화 단위들을 결정하고, 상기 부호화 심도의 부호화 단위마다 예측 부호화를 위한 파티션을 결정하며, 계층적 구조의 변환 단위들을 기초로 변환을 수행하여 트리 구조에 따른 변환 단위들을 결정하는 단계를 포함하는 것을 특징으로 하는 비디오 데이터의 다중화 방법.
- 비디오 데이터의 재생 상태 식별을 위한 비디오 데이터의 다중화 장치에 있어서,계층적 구조의 데이터 단위에 기초하여 상기 비디오 데이터를 구성하는 픽처들을 부호화하는 비디오 부호화부;복호화 장치로부터 상기 부호화된 데이터의 전송 요청이 있는 경우, 상기 전송 요청이 일반 재생에 따른 요청인지, 랜덤 액세스를 위한 요청인지 여부를 판단하는 재생 상태 식별부; 및랜덤 액세스에 이용되는 인트라 픽처로서 상기 인트라 픽처보다 표시 순서상 앞서지만 부호화 순서상 상기 인트라 픽처 이후에 부호화되는 리딩(leading) 픽처들을 갖는 인트라 픽처를 다중화한 전송 단위 데이터에, 상기 판단 결과에 따라 상기 인트라 픽처가 일반 재생에 따른 요청 및 랜덤 액세스를 위한 요청 중 어떤 요청에 따라 제공되는 인트라 픽처인지를 나타내는 소정의 신택스를 부가하는 다중화부를 포함하는 것을 특징으로 하는 비디오 데이터의 다중화 장치.
- 비디오 데이터의 재생 상태 식별을 위한 비디오 데이터의 역다중화 방법에 있어서,계층적 구조의 데이터 단위에 기초하여 상기 비디오 데이터를 구성하는 픽처들을 부호화한 비트스트림을 다중화한 전송 단위 데이터를 수신하는 단계;상기 전송 단위 데이터 중 랜덤 액세스에 이용되는 인트라 픽처로서 상기 인트라 픽처보다 표시 순서상 앞서지만 복호화 순서상 상기 인트라 픽처 이후에 복호화되는 리딩(leading) 픽처들을 갖는 인트라 픽처를 다중화한 전송 단위 데이터로부터, 상기 인트라 픽처가 일반 재생 및 랜덤 액세스 중 어떤 상태에 따라 복호화되는 픽처인지를 나타내는 소정의 신택스를 획득하는 단계; 및상기 획득된 신택스에 기초하여 상기 인트라 픽처가 일반 재생되는 픽처인지, 랜덤 액세스 픽처인지를 식별하는 단계를 포함하는 것을 특징으로 하는 비디오 데이터의 역다중화 방법.
- 제 7항에 있어서,상기 전송 단위 데이터는네트워크 추상 계층(Network Adaptive Layer:NAL) 단위의 데이터인 것을 특징으로 하는 비디오 데이터의 역다중화 방법.
- 제 8항에 있어서,상기 소정의 신택스는상기 NAL 단위의 유형을 나타내는 식별자(nal unit type)이며, 일반 재생에 따른 요청에 따라 제공되는 인트라 픽처를 다중화한 NAL 단위 및 랜덤 액세스를 위한 요청에 따라 제공되는 인트라 픽처를 다중화한 NAL 단위가 서로 다른 유형의 식별자(nal unit type)를 갖도록 설정되는 것을 특징으로 하는 비디오 데이터의 역다중화 방법.
- 제 7항에 있어서,상기 신택스는상기 인트라 픽처보다 부호화 순서상 앞서면서 상기 리딩 픽처들의 참조 픽처로 이용되는 형제 픽처의 POC(Picture Order Count) 및 상기 인트라 픽처보다 이전의 픽처들을 복호화하는 과정 중에서 POC가 리셋되거나 상기 인트라 픽처를 복호화할 때마다 카운트가 증가하는 픽처 순서 불연속 카운터인 것을 특징으로 하는 비디오 데이터의 역다중화 방법.
- 제 10항에 있어서,상기 식별하는 단계는상기 인트라 픽처보다 이전의 픽처들을 복호화하는 과정에서 POC가 리셋되거나 상기 인트라 픽처를 복호화할 때마다 복호화기의 픽처 순서 불연속 카운터를 증가시키는 단계;상기 전송 단위 데이터로부터 획득된 픽처 순서 불연속 카운터와 상기 복호화기의 픽처 순서 불연속 카운터를 비교하는 단계; 및상기 비교 결과에 기초하여 상기 인트라 픽처가 일반 재생인지, 랜덤 액세스에 따른 재생인지를 판단하는 단계를 포함하는 것을 특징으로 하는 비디오 데이터의 역다중화 방법.
- 제 11항에 있어서,상기 판단하는 단계는상기 전송 단위 데이터로부터 획득된 픽처 순서 불연속 카운터와 상기 복호화기의 픽처 순서 불연속 카운터가 불일치하는 경우, 상기 인트라 픽처를 랜덤 액세스에 따라 재생되는 픽처인 것으로 판단하는 것을 특징으로 하는 비디오 데이터의 역다중화 방법.
- 제 7항에 있어서,상기 인트라 픽처가 랜덤 액세스에 따라 복호화되는 픽처인 경우, 상기 리딩 픽처들에 대한 복호화 과정을 스킵하는 단계를 더 포함하는 것을 특징으로 하는 비디오 데이터의 역다중화 방법.
- 제 7항에 있어서,상기 비트스트림은 상기 비디오를 구성하는 픽처를 최대 크기의 부호화 단위로 분할한 적어도 하나의 최대 부호화 단위마다, 상기 최대 부호화 단위의 공간적 분할 횟수를 나타내는 심도에 따라 계층적으로 구성되는 심도별 부호화 단위들 중에서, 부호화 심도의 부호화 단위들을 포함하는 트리 구조에 따른 부호화 단위들을 결정하고, 상기 부호화 심도의 부호화 단위마다 예측 부호화를 위한 파티션을 결정하며, 계층적 구조의 변환 단위들을 기초로 변환을 수행하여 트리 구조에 따른 변환 단위들을 결정하여 부호화 된 것을 특징으로 하는 비디오 데이터의 역다중화 방법.
- 비디오 데이터의 재생 상태 식별을 위한 비디오 데이터의 역다중화 장치에 있어서,계층적 구조의 데이터 단위에 기초하여 상기 비디오 데이터를 구성하는 픽처들을 부호화한 비트스트림을 다중화한 전송 단위 데이터를 수신하고, 상기 전송 단위 데이터 중 랜덤 액세스에 이용되는 인트라 픽처로서 상기 인트라 픽처보다 표시 순서상 앞서지만 복호화 순서상 상기 인트라 픽처 이후에 복호화되는 리딩(leading) 픽처들을 갖는 인트라 픽처를 다중화한 전송 단위 데이터로부터, 상기 인트라 픽처가 일반 재생 및 랜덤 액세스 중 어떤 상태에 따라 복호화되는 픽처인지를 나타내는 소정의 신택스를 획득하는 역다중화부; 및상기 획득된 신택스에 기초하여 상기 인트라 픽처가 일반 재생되는 픽처인지, 랜덤 액세스 픽처인지를 식별하는 재생 상태 식별부를 포함하는 것을 특징으로 하는 비디오 데이터의 역다중화 장치.
Priority Applications (31)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
LTEP12806944.0T LT2728861T (lt) | 2011-07-02 | 2012-07-02 | Vaizdo duomenų multipleksavimo ir demultipleksavimo būdas ir aparatas vaizdo atkūrimo būklei nustatyti |
MX2014000048A MX2014000048A (es) | 2011-07-02 | 2012-07-02 | Metodo y aparato para multiplexar y desmultiplexar datos de video para identificar el estado de reproduccion de los datos de video. |
CN201280042854.5A CN103765908B (zh) | 2011-07-02 | 2012-07-02 | 用于对视频数据进行复用和解复用以识别视频数据的再现状态的方法和设备 |
PL12806944T PL2728861T3 (pl) | 2011-07-02 | 2012-07-02 | Sposób i urządzenie do multipleksowania i demultipleksowania danych wideo w celu identyfikowania stanu odtwarzania danych wideo |
EP18196488.3A EP3439299A1 (en) | 2011-07-02 | 2012-07-02 | Apparatus for multiplexing and demultiplexing video data to identify reproducing state of video data |
AU2012278485A AU2012278485B2 (en) | 2011-07-02 | 2012-07-02 | Method and apparatus for multiplexing and demultiplexing video data to identify reproducing state of video data. |
DK12806944.0T DK2728861T3 (en) | 2011-07-02 | 2012-07-02 | Method and apparatus for multiplexing and demultiplexing video data to identify the reproduction state of video data. |
EP12806944.0A EP2728861B1 (en) | 2011-07-02 | 2012-07-02 | Method and apparatus for multiplexing and demultiplexing video data to identify reproducing state of video data. |
SI201231084T SI2728861T1 (sl) | 2011-07-02 | 2012-07-02 | Postopek in naprava za multipleksiranje in demultipleksiranje video podatkov, za identifikacijo stanje reprodukcije video podatkov |
CA2840893A CA2840893C (en) | 2011-07-02 | 2012-07-02 | Method and apparatus for multiplexing and demultiplexing video data to identify reproducing state of video data |
MX2015003071A MX337077B (es) | 2011-07-02 | 2012-07-02 | Metodo y aparato para multiplexar y desmultiplexar datos de video para identificar el estado de reproduccion de los datos de video. |
RU2014103489/07A RU2014103489A (ru) | 2011-07-02 | 2012-07-02 | Способ и устройство для мультиплексирования и демультиплексирования видеоданных, чтобы идентифицировать состояние воспроизведения видеоданных |
ES12806944.0T ES2642839T3 (es) | 2011-07-02 | 2012-07-02 | Procedimiento y aparato de multiplexión y desmultiplexión de datos de vídeo para identificar el estado de reproducción de datos de vídeo |
RS20170994A RS56448B1 (sr) | 2011-07-02 | 2012-07-02 | Metod i aparat za multipleksiranje i demultipleksiranje video podataka za identifikovanje stanja reprodukcije video podataka |
US14/130,600 US9788003B2 (en) | 2011-07-02 | 2012-07-02 | Method and apparatus for multiplexing and demultiplexing video data to identify reproducing state of video data |
EP17187918.2A EP3267681B1 (en) | 2011-07-02 | 2012-07-02 | Apparatus for multiplexing and demultiplexing video data to identify reproducing state of video data |
JP2014518821A JP5905960B2 (ja) | 2011-07-02 | 2012-07-02 | ビデオデータの再生状態識別のためのビデオデータの多重化方法及び装置、逆多重化方法及び装置 |
PL17187918T PL3267681T3 (pl) | 2011-07-02 | 2012-07-02 | Urządzenie do multipleksowania i demultipleksowania danych wideo w celu identyfikacji stanu reprodukowania danych wideo |
BR112013033902A BR112013033902A2 (pt) | 2011-07-02 | 2012-07-02 | método para multiplexar dados de vídeo, a fim de identificar um estado de reprodução dos dados de vídeo, aparelho para multiplexar dados de vídeo, a fim de identificar um estado de reprodução dos dados de vídeo, método para demultiplexar dados de vídeo, a fim de identificar um estado de reprodução dos dados de vídeo, e aparelho para demultiplexar dados de vídeo, a fim de identificar um estado de reprodução dos dados de vídeo |
MX2015003072A MX337078B (es) | 2011-07-02 | 2012-07-02 | Metodo y aparato para multiplexar y desmultiplexar datos de video para identificar el estado de reproduccion de los datos de video. |
ZA2014/00764A ZA201400764B (en) | 2011-07-02 | 2014-01-31 | Method and apparatus for multiplexing and demultiplexing video data to identify reproducing state of video data |
US14/848,633 US20150382002A1 (en) | 2011-07-02 | 2015-09-09 | Method and apparatus for multiplexing and demultiplexing video data to identify reproducing state of video data |
AU2017201284A AU2017201284B2 (en) | 2011-07-02 | 2017-02-24 | Method and apparatus for multiplexing and demultiplexing video data to identify reproducing state of video data |
PH12017501053A PH12017501053A1 (en) | 2011-07-02 | 2017-06-06 | Method and apparatus for multiplexing and demultiplexing video data to identify reproducing state of video data |
PH12017501056A PH12017501056A1 (en) | 2011-07-02 | 2017-06-06 | Method and apparatus for multiplexing and demultiplexing video data to identify reproducing state of video data |
PH12017501054A PH12017501054A1 (en) | 2011-07-02 | 2017-06-06 | Method and apparatus for multiplexing and demultiplexing video data to identify reproducing state of video data |
PH12017501055A PH12017501055A1 (en) | 2011-07-02 | 2017-06-06 | Method and apparatus for multiplexing and demultiplexing video data to identify reproducing state of video data |
HRP20171487TT HRP20171487T1 (hr) | 2011-07-02 | 2017-10-05 | Postupak i ureðaj za multipleksiranje i demultipleksiranje video podataka za identificiranje stanja reprodukcije video podataka |
CY20171101150T CY1119757T1 (el) | 2011-07-02 | 2017-11-02 | Μεθοδος και συσκευη για την πολυπλεξια και την αποπολυπλεξια δεδομενων βιντεο για τον προσδιορισμο της καταστασης αναπαραγωγης των δεδομενων βιντεο |
AU2018203606A AU2018203606A1 (en) | 2011-07-02 | 2018-05-22 | Method and apparatus for multiplexing and demultiplexing video data to identify reproducing state of video data |
CY181101284T CY1120978T1 (el) | 2011-07-02 | 2018-12-03 | Συσκευη για πολυπλεξια και αποπολυπλεξια δεδομενων βιντεο για τον προσδιορισμο της καταστασης αναπαραγωγης των δεδομενων βιντεο |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US201161504178P | 2011-07-02 | 2011-07-02 | |
US61/504,178 | 2011-07-02 | ||
US201161552549P | 2011-10-28 | 2011-10-28 | |
US61/552,549 | 2011-10-28 |
Related Child Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US14/130,600 A-371-Of-International US9788003B2 (en) | 2011-07-02 | 2012-07-02 | Method and apparatus for multiplexing and demultiplexing video data to identify reproducing state of video data |
US14/848,633 Continuation US20150382002A1 (en) | 2011-07-02 | 2015-09-09 | Method and apparatus for multiplexing and demultiplexing video data to identify reproducing state of video data |
Publications (2)
Publication Number | Publication Date |
---|---|
WO2013005969A2 true WO2013005969A2 (ko) | 2013-01-10 |
WO2013005969A3 WO2013005969A3 (ko) | 2013-02-28 |
Family
ID=47437548
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/KR2012/005256 WO2013005969A2 (ko) | 2011-07-02 | 2012-07-02 | 비디오 데이터의 재생 상태 식별을 위한 비디오 데이터의 다중화 방법 및 장치, 역다중화 방법 및 장치 |
Country Status (26)
Country | Link |
---|---|
US (2) | US9788003B2 (ko) |
EP (3) | EP3267681B1 (ko) |
JP (3) | JP5905960B2 (ko) |
KR (7) | KR101457895B1 (ko) |
CN (5) | CN107623856A (ko) |
AU (3) | AU2012278485B2 (ko) |
BR (1) | BR112013033902A2 (ko) |
CA (1) | CA2840893C (ko) |
CY (2) | CY1119757T1 (ko) |
DK (2) | DK2728861T3 (ko) |
ES (2) | ES2642839T3 (ko) |
HR (2) | HRP20171487T1 (ko) |
HU (2) | HUE042458T2 (ko) |
LT (2) | LT3267681T (ko) |
MX (3) | MX337077B (ko) |
MY (1) | MY168370A (ko) |
PH (4) | PH12017501054A1 (ko) |
PL (2) | PL3267681T3 (ko) |
PT (2) | PT2728861T (ko) |
RS (2) | RS57976B1 (ko) |
RU (3) | RU2636131C1 (ko) |
SG (1) | SG10201505182UA (ko) |
SI (2) | SI3267681T1 (ko) |
TW (5) | TWI578765B (ko) |
WO (1) | WO2013005969A2 (ko) |
ZA (1) | ZA201400764B (ko) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2015526024A (ja) * | 2012-06-28 | 2015-09-07 | クゥアルコム・インコーポレイテッドQualcomm Incorporated | ビデオコーディングにおける長期参照ピクチャのランダムアクセスおよびシグナリング |
Families Citing this family (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
ES2642839T3 (es) * | 2011-07-02 | 2017-11-20 | Samsung Electronics Co., Ltd. | Procedimiento y aparato de multiplexión y desmultiplexión de datos de vídeo para identificar el estado de reproducción de datos de vídeo |
US9237356B2 (en) | 2011-09-23 | 2016-01-12 | Qualcomm Incorporated | Reference picture list construction for video coding |
US9264717B2 (en) * | 2011-10-31 | 2016-02-16 | Qualcomm Incorporated | Random access with advanced decoded picture buffer (DPB) management in video coding |
US9432694B2 (en) * | 2012-03-06 | 2016-08-30 | Apple Inc. | Signal shaping techniques for video data that is susceptible to banding artifacts |
US9516308B2 (en) | 2012-04-27 | 2016-12-06 | Qualcomm Incorporated | Parameter set updates in video coding |
US9736476B2 (en) * | 2012-04-27 | 2017-08-15 | Qualcomm Incorporated | Full random access from clean random access pictures in video coding |
JP6045222B2 (ja) * | 2012-06-28 | 2016-12-14 | 株式会社Nttドコモ | 動画像予測復号装置、方法及びプログラム |
CN105308964A (zh) * | 2013-04-12 | 2016-02-03 | 三星电子株式会社 | 用于随机访问的多层视频编码方法及其装置以及用于随机访问的多层视频解码方法及其装置 |
EP3010232A4 (en) | 2013-06-12 | 2017-01-25 | Mitsubishi Electric Corporation | Image encoding device, image encoding method, image decoding device, and image decoding method |
US10264272B2 (en) * | 2013-10-15 | 2019-04-16 | Qualcomm Incorporated | Device and method for scalable coding of video information |
WO2015060699A1 (ko) * | 2013-10-26 | 2015-04-30 | 삼성전자 주식회사 | 멀티 레이어 비디오 부호화 방법 및 장치, 멀티 레이어 비디오 복호화 방법 및 장치 |
US10283091B2 (en) * | 2014-10-13 | 2019-05-07 | Microsoft Technology Licensing, Llc | Buffer optimization |
KR102477964B1 (ko) * | 2015-10-12 | 2022-12-16 | 삼성전자주식회사 | 미디어 전송 시스템에서 비디오 비트스트림의 임의 접근 및 재생을 가능하게 하는 기법 |
JP6854716B2 (ja) * | 2017-07-05 | 2021-04-07 | キヤノン株式会社 | 画像処理装置、画像処理方法 |
US11310560B2 (en) * | 2019-05-17 | 2022-04-19 | Samsung Electronics Co., Ltd. | Bitstream merger and extractor |
GB2608748B (en) * | 2020-03-06 | 2024-08-07 | Uv Partners Inc | UV disinfection platform |
Family Cites Families (44)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP3860323B2 (ja) | 1997-10-27 | 2006-12-20 | 三菱電機株式会社 | 画像復号化装置、画像復号化方法 |
TW416220B (en) | 1998-01-23 | 2000-12-21 | Matsushita Electric Ind Co Ltd | Image transmitting method, image processing method, image processing device, and data storing medium |
US7366402B2 (en) * | 2000-06-02 | 2008-04-29 | Lg Electronics Inc. | Method and apparatus of recording a high definition digital television broadcast signal |
WO2003047250A2 (en) | 2001-11-30 | 2003-06-05 | Matsushita Electric Industrial Co., Ltd. | A method and an apparatus for stream conversion, a method and an apparatus for data recording, and data recording medium |
US7149247B2 (en) | 2002-01-22 | 2006-12-12 | Microsoft Corporation | Methods and systems for encoding and decoding video data to enable random access and splicing |
JP3852366B2 (ja) | 2002-04-26 | 2006-11-29 | ソニー株式会社 | 符号化装置および方法、復号装置および方法、並びにプログラム |
WO2004008735A2 (en) | 2002-07-16 | 2004-01-22 | Nokia Corporation | A method for random access and gradual picture refresh in video coding |
US20040260827A1 (en) | 2003-06-19 | 2004-12-23 | Nokia Corporation | Stream switching based on gradual decoder refresh |
US7924921B2 (en) | 2003-09-07 | 2011-04-12 | Microsoft Corporation | Signaling coding and display options in entry point headers |
KR20050078099A (ko) | 2004-01-30 | 2005-08-04 | 삼성전자주식회사 | 적응적으로 키 프레임을 삽입하는 비디오 코딩 장치 및 방법 |
EP2207183B8 (en) | 2004-04-28 | 2012-08-08 | Panasonic Corporation | Moving picture stream generation apparatus, moving picture coding apparatus, moving picture multiplexing apparatus and moving picture decoding apparatus |
CN101036391B (zh) | 2004-10-07 | 2011-01-26 | 松下电器产业株式会社 | 画面编码装置和画面解码装置 |
CN101180883B (zh) | 2005-04-13 | 2016-02-03 | 诺基亚公司 | 用于有效地编码和解码视频数据的方法、设备和系统 |
TWI264951B (en) | 2005-05-19 | 2006-10-21 | Cheertek Inc | Deblock filter method for applying on video encoding/decoding and the apparatus thereof |
US8565303B2 (en) * | 2006-03-30 | 2013-10-22 | Lg Electronics Inc. | Method and apparatus for decoding/encoding a video signal |
JP4737003B2 (ja) * | 2006-08-10 | 2011-07-27 | ソニー株式会社 | 編集装置、編集方法、編集プログラムおよび編集システム |
JP4793366B2 (ja) * | 2006-10-13 | 2011-10-12 | 日本ビクター株式会社 | 多視点画像符号化装置、多視点画像符号化方法、多視点画像符号化プログラム、多視点画像復号装置、多視点画像復号方法、及び多視点画像復号プログラム |
US20080095228A1 (en) * | 2006-10-20 | 2008-04-24 | Nokia Corporation | System and method for providing picture output indications in video coding |
CN103024444B (zh) | 2006-11-14 | 2015-11-18 | 高通股份有限公司 | 用于信道切换的系统及方法 |
CN101198052B (zh) | 2006-12-04 | 2010-05-19 | 华为技术有限公司 | 一种视频编码方法、解码方法及其装置 |
US20080159407A1 (en) | 2006-12-28 | 2008-07-03 | Yang Nick Y | Mechanism for a parallel processing in-loop deblock filter |
US20080170528A1 (en) * | 2007-01-12 | 2008-07-17 | Peter Bosch | Method of multicasting base and enhancement layers of a video stream |
KR101142379B1 (ko) | 2007-02-14 | 2012-05-18 | 삼성전자주식회사 | 디지털 방송 재생 방법 및 장치, 디지털 방송 녹화 방법 |
CN101257624B (zh) | 2007-02-27 | 2011-08-24 | 华为技术有限公司 | 实现随机访问的方法及解码器 |
KR101107815B1 (ko) * | 2007-05-04 | 2012-02-06 | 노키아 코포레이션 | 멀티미디어 컨테이너 파일의 수신 힌트 트랙으로의 미디어 스트림 기록 방법 및 장치, 컴퓨터 판독가능 매체 |
US20080317124A1 (en) * | 2007-06-25 | 2008-12-25 | Sukhee Cho | Multi-view video coding system, decoding system, bitstream extraction system for decoding base view and supporting view random access |
BRPI0818444A2 (pt) | 2007-10-12 | 2016-10-11 | Qualcomm Inc | codificação adaptativa de informação de cabeçalho de bloco de vídeo |
CN101459840B (zh) * | 2007-12-13 | 2010-04-21 | 华为技术有限公司 | 视频图像编码和解码方法及装置和系统 |
CN101222616B (zh) * | 2008-01-22 | 2011-08-10 | 中兴通讯股份有限公司 | 点播服务中的mpeg传送流的传输处理方法 |
JP5170708B2 (ja) * | 2008-01-24 | 2013-03-27 | 日本電気株式会社 | 動画像ストリーム加工方法及び装置、それを用いた動画像再生装置並びに動画像配信装置 |
KR101517768B1 (ko) * | 2008-07-02 | 2015-05-06 | 삼성전자주식회사 | 영상의 부호화 방법 및 장치, 그 복호화 방법 및 장치 |
JP2010062529A (ja) * | 2008-08-04 | 2010-03-18 | Toshiba Corp | 半導体装置の製造方法 |
TW201032597A (en) * | 2009-01-28 | 2010-09-01 | Nokia Corp | Method and apparatus for video coding and decoding |
KR101457894B1 (ko) * | 2009-10-28 | 2014-11-05 | 삼성전자주식회사 | 영상 부호화 방법 및 장치, 복호화 방법 및 장치 |
JP2011199396A (ja) | 2010-03-17 | 2011-10-06 | Ntt Docomo Inc | 動画像予測符号化装置、動画像予測符号化方法、動画像予測符号化プログラム、動画像予測復号装置、動画像予測復号方法、及び動画像予測復号プログラム |
KR101503269B1 (ko) * | 2010-04-05 | 2015-03-17 | 삼성전자주식회사 | 영상 부호화 단위에 대한 인트라 예측 모드 결정 방법 및 장치, 및 영상 복호화 단위에 대한 인트라 예측 모드 결정 방법 및 장치 |
US9516379B2 (en) * | 2011-03-08 | 2016-12-06 | Qualcomm Incorporated | Buffer management in video codecs |
US9706227B2 (en) * | 2011-03-10 | 2017-07-11 | Qualcomm Incorporated | Video coding techniques for coding dependent pictures after random access |
ES2642839T3 (es) * | 2011-07-02 | 2017-11-20 | Samsung Electronics Co., Ltd. | Procedimiento y aparato de multiplexión y desmultiplexión de datos de vídeo para identificar el estado de reproducción de datos de vídeo |
EP2732626A1 (en) * | 2011-07-15 | 2014-05-21 | Telefonaktiebolaget L M Ericsson (PUBL) | An encoder and method thereof for assigning a lowest layer identity to clean random access pictures |
US9674525B2 (en) * | 2011-07-28 | 2017-06-06 | Qualcomm Incorporated | Multiview video coding |
US9357275B2 (en) * | 2011-09-06 | 2016-05-31 | Qualcomm Incorporated | Network streaming of coded video data |
US9736476B2 (en) | 2012-04-27 | 2017-08-15 | Qualcomm Incorporated | Full random access from clean random access pictures in video coding |
US9225978B2 (en) | 2012-06-28 | 2015-12-29 | Qualcomm Incorporated | Streaming adaption based on clean random access (CRA) pictures |
-
2012
- 2012-07-02 ES ES12806944.0T patent/ES2642839T3/es active Active
- 2012-07-02 EP EP17187918.2A patent/EP3267681B1/en active Active
- 2012-07-02 MX MX2015003071A patent/MX337077B/es unknown
- 2012-07-02 SI SI201231469T patent/SI3267681T1/sl unknown
- 2012-07-02 CN CN201710910140.6A patent/CN107623856A/zh not_active Withdrawn
- 2012-07-02 DK DK12806944.0T patent/DK2728861T3/en active
- 2012-07-02 ES ES17187918T patent/ES2699503T3/es active Active
- 2012-07-02 RS RS20181433A patent/RS57976B1/sr unknown
- 2012-07-02 CA CA2840893A patent/CA2840893C/en not_active Expired - Fee Related
- 2012-07-02 CN CN201710904788.2A patent/CN107454417A/zh not_active Withdrawn
- 2012-07-02 RS RS20170994A patent/RS56448B1/sr unknown
- 2012-07-02 TW TW105110841A patent/TWI578765B/zh not_active IP Right Cessation
- 2012-07-02 LT LTEP17187918.2T patent/LT3267681T/lt unknown
- 2012-07-02 RU RU2016129590A patent/RU2636131C1/ru not_active IP Right Cessation
- 2012-07-02 WO PCT/KR2012/005256 patent/WO2013005969A2/ko active Application Filing
- 2012-07-02 CN CN201710910516.3A patent/CN107820094A/zh not_active Withdrawn
- 2012-07-02 RU RU2014103489/07A patent/RU2014103489A/ru not_active Application Discontinuation
- 2012-07-02 SI SI201231084T patent/SI2728861T1/sl unknown
- 2012-07-02 EP EP12806944.0A patent/EP2728861B1/en active Active
- 2012-07-02 PL PL17187918T patent/PL3267681T3/pl unknown
- 2012-07-02 CN CN201280042854.5A patent/CN103765908B/zh not_active Expired - Fee Related
- 2012-07-02 HU HUE17187918A patent/HUE042458T2/hu unknown
- 2012-07-02 MX MX2014000048A patent/MX2014000048A/es active IP Right Grant
- 2012-07-02 MX MX2015003072A patent/MX337078B/es unknown
- 2012-07-02 AU AU2012278485A patent/AU2012278485B2/en not_active Ceased
- 2012-07-02 JP JP2014518821A patent/JP5905960B2/ja active Active
- 2012-07-02 SG SG10201505182UA patent/SG10201505182UA/en unknown
- 2012-07-02 BR BR112013033902A patent/BR112013033902A2/pt not_active Application Discontinuation
- 2012-07-02 TW TW106105704A patent/TWI604720B/zh not_active IP Right Cessation
- 2012-07-02 MY MYPI2013004679A patent/MY168370A/en unknown
- 2012-07-02 PT PT128069440T patent/PT2728861T/pt unknown
- 2012-07-02 EP EP18196488.3A patent/EP3439299A1/en not_active Withdrawn
- 2012-07-02 TW TW101123830A patent/TWI535272B/zh not_active IP Right Cessation
- 2012-07-02 DK DK17187918.2T patent/DK3267681T3/en active
- 2012-07-02 US US14/130,600 patent/US9788003B2/en not_active Expired - Fee Related
- 2012-07-02 LT LTEP12806944.0T patent/LT2728861T/lt unknown
- 2012-07-02 CN CN201710907233.3A patent/CN107483980A/zh not_active Withdrawn
- 2012-07-02 KR KR1020120071986A patent/KR101457895B1/ko active IP Right Grant
- 2012-07-02 HU HUE12806944A patent/HUE035904T2/en unknown
- 2012-07-02 PL PL12806944T patent/PL2728861T3/pl unknown
- 2012-07-02 TW TW106132889A patent/TWI637628B/zh not_active IP Right Cessation
- 2012-07-02 TW TW104122835A patent/TWI526053B/zh not_active IP Right Cessation
- 2012-07-02 PT PT17187918T patent/PT3267681T/pt unknown
-
2014
- 2014-01-31 ZA ZA2014/00764A patent/ZA201400764B/en unknown
- 2014-05-16 KR KR1020140059297A patent/KR101661696B1/ko active IP Right Grant
- 2014-10-29 KR KR1020140148737A patent/KR101648557B1/ko active IP Right Grant
-
2015
- 2015-09-09 US US14/848,633 patent/US20150382002A1/en not_active Abandoned
-
2016
- 2016-03-17 JP JP2016053464A patent/JP6185620B2/ja not_active Expired - Fee Related
- 2016-08-09 KR KR1020160101220A patent/KR101748178B1/ko active IP Right Grant
- 2016-09-26 KR KR1020160123376A patent/KR101753370B1/ko active IP Right Grant
-
2017
- 2017-02-24 AU AU2017201284A patent/AU2017201284B2/en not_active Ceased
- 2017-06-06 PH PH12017501054A patent/PH12017501054A1/en unknown
- 2017-06-06 PH PH12017501056A patent/PH12017501056A1/en unknown
- 2017-06-06 PH PH12017501055A patent/PH12017501055A1/en unknown
- 2017-06-06 PH PH12017501053A patent/PH12017501053A1/en unknown
- 2017-06-27 KR KR1020170081393A patent/KR101872978B1/ko active IP Right Grant
- 2017-07-27 JP JP2017145227A patent/JP6486421B2/ja not_active Expired - Fee Related
- 2017-10-05 HR HRP20171487TT patent/HRP20171487T1/hr unknown
- 2017-11-02 CY CY20171101150T patent/CY1119757T1/el unknown
- 2017-11-02 RU RU2017138244A patent/RU2668284C1/ru not_active IP Right Cessation
-
2018
- 2018-05-22 AU AU2018203606A patent/AU2018203606A1/en not_active Abandoned
- 2018-06-25 KR KR1020180073018A patent/KR101997039B1/ko active IP Right Grant
- 2018-11-22 HR HRP20181956TT patent/HRP20181956T1/hr unknown
- 2018-12-03 CY CY181101284T patent/CY1120978T1/el unknown
Non-Patent Citations (2)
Title |
---|
None |
See also references of EP2728861A4 |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2015526024A (ja) * | 2012-06-28 | 2015-09-07 | クゥアルコム・インコーポレイテッドQualcomm Incorporated | ビデオコーディングにおける長期参照ピクチャのランダムアクセスおよびシグナリング |
Also Published As
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2013005969A2 (ko) | 비디오 데이터의 재생 상태 식별을 위한 비디오 데이터의 다중화 방법 및 장치, 역다중화 방법 및 장치 | |
WO2013077665A1 (ko) | 복호화기의 버퍼 관리를 위한 영상 부호화 방법 및 장치, 그 영상 복호화 방법 및 장치 | |
WO2013157797A1 (ko) | 다계층 비디오 부호화 방법 및 장치, 다계층 비디오 복호화 방법 및 장치 | |
WO2014109607A1 (ko) | 멀티 레이어 비디오 부호화 방법 및 장치, 멀티 레이어 비디오 복호화 방법 및 장치 | |
WO2011129621A2 (ko) | 트리 구조의 부호화 단위에 기초한 예측 단위를 이용하는 비디오 부호화 방법과 그 장치, 및 비디오 복호화 방법 및 그 장치 | |
WO2014007596A1 (ko) | 다계층 비디오 부호화 방법 및 장치, 다계층 비디오 복호화 방법 및 장치 | |
WO2014007550A1 (ko) | 시간적 스케일러빌러티를 갖는 비디오 부호화 방법 및 장치, 시간적 스케일러빌러티를 갖는 비디오 복호화 방법 및 장치 | |
WO2011019250A4 (en) | Method and apparatus for encoding video, and method and apparatus for decoding video | |
WO2013162258A1 (ko) | 다시점 비디오 부호화 방법 및 장치, 다시점 비디오 복호화 방법 및 장치 | |
WO2014051410A1 (ko) | 랜덤 액세스를 위한 비디오 부호화 방법 및 장치, 비디오 복호화 방법 및 장치 | |
WO2013005968A2 (ko) | 계층적 구조의 데이터 단위를 이용한 엔트로피 부호화 방법 및 장치, 복호화 방법 및 장치 | |
WO2013002586A2 (ko) | 영상의 인트라 예측 부호화, 복호화 방법 및 장치 | |
WO2013109122A1 (ko) | 계층적 부호화 단위에 따라 스캔 순서를 변경하는 비디오 부호화 방법 및 장치, 비디오 복호화 방법 및 장치 | |
WO2014163456A1 (ko) | 멀티 레이어 비디오의 복호화 방법 및 장치, 멀티 레이어 비디오의 부호화 방법 및 장치 | |
WO2011126281A2 (en) | Method and apparatus for encoding video by performing in-loop filtering based on tree-structured data unit, and method and apparatus for decoding video by performing the same | |
WO2011010900A2 (ko) | 영상의 부호화 방법 및 장치, 영상 복호화 방법 및 장치 | |
WO2012124961A2 (ko) | 영상의 부호화 방법 및 장치, 그 복호화 방법 및 장치 | |
WO2013005963A2 (ko) | 콜로케이티드 영상을 이용한 인터 예측을 수반하는 비디오 부호화 방법 및 그 장치, 비디오 복호화 방법 및 그 장치 | |
WO2014051409A1 (ko) | 참조 픽처 정보를 이용한 병렬 처리 비디오 부호화 방법 및 장치, 병렬 처리 비디오 복호화 방법 및 장치 | |
WO2013109124A1 (ko) | 쌍방향 예측 및 블록 병합을 제한하는 비디오 부호화 방법 및 장치, 비디오 복호화 방법 및 장치 | |
WO2015056955A1 (ko) | 다시점 비디오 부호화 방법 및 장치, 다시점 비디오 복호화 방법 및 장치 | |
WO2014116047A1 (ko) | 비디오 부호화 방법 및 장치, 비디오 복호화 방법 및 장치 | |
WO2021201515A1 (ko) | Hls를 시그널링하는 영상 부호화/복호화 방법, 장치 및 비트스트림을 저장한 컴퓨터 판독 가능한 기록 매체 | |
WO2013157796A1 (ko) | 병렬 처리를 위한 비디오 부호화 방법 및 장치, 비디오 복호화 방법 및 장치 | |
WO2020242145A1 (ko) | 적응적 파라미터 셋을 사용하는 비디오 코딩 방법 및 장치 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 12806944 Country of ref document: EP Kind code of ref document: A2 |
|
ENP | Entry into the national phase |
Ref document number: 2014518821 Country of ref document: JP Kind code of ref document: A |
|
ENP | Entry into the national phase |
Ref document number: 2840893 Country of ref document: CA |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 14130600 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: MX/A/2014/000048 Country of ref document: MX |
|
ENP | Entry into the national phase |
Ref document number: 2012278485 Country of ref document: AU Date of ref document: 20120702 Kind code of ref document: A |
|
REEP | Request for entry into the european phase |
Ref document number: 2012806944 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2012806944 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: 2014103489 Country of ref document: RU Kind code of ref document: A |
|
REG | Reference to national code |
Ref country code: BR Ref legal event code: B01A Ref document number: 112013033902 Country of ref document: BR |
|
WWE | Wipo information: entry into national phase |
Ref document number: 12017501054 Country of ref document: PH Ref document number: 12017501056 Country of ref document: PH Ref document number: 12017501053 Country of ref document: PH Ref document number: 12017501055 Country of ref document: PH |
|
REG | Reference to national code |
Ref country code: BR Ref legal event code: B01E Ref document number: 112013033902 Country of ref document: BR |
|
ENP | Entry into the national phase |
Ref document number: 112013033902 Country of ref document: BR Kind code of ref document: A2 Effective date: 20131230 |