WO2020041306A1 - Procédé et dispositif de prédiction intra - Google Patents

Procédé et dispositif de prédiction intra Download PDF

Info

Publication number
WO2020041306A1
WO2020041306A1 PCT/US2019/047257 US2019047257W WO2020041306A1 WO 2020041306 A1 WO2020041306 A1 WO 2020041306A1 US 2019047257 W US2019047257 W US 2019047257W WO 2020041306 A1 WO2020041306 A1 WO 2020041306A1
Authority
WO
WIPO (PCT)
Prior art keywords
luma
samples
block
value
reconstructed
Prior art date
Application number
PCT/US2019/047257
Other languages
English (en)
Inventor
Xiang Ma
Jianle Chen
Haitao Yang
Original Assignee
Futurewei Technologies, Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Futurewei Technologies, Inc. filed Critical Futurewei Technologies, Inc.
Publication of WO2020041306A1 publication Critical patent/WO2020041306A1/fr

Links

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/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/593—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving spatial prediction techniques
    • 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/105—Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for 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/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/11—Selection of coding mode or of prediction mode among a plurality of spatial predictive coding modes
    • 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/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
    • H04N19/167—Position within a video image, e.g. region of interest [ROI]
    • 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/186—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 colour or a chrominance component

Definitions

  • the present disclosure generally relates to the field of video coding and more particularly, to the field of intra-prediction.
  • Video compression devices often use software and/or hardware at the source to code the video data prior to transmission or storage, thereby decreasing the quantity of data needed to represent digital video images.
  • the compressed data is then received at the destination by a video decompression device that decodes the video data.
  • High Efficiency Video Coding is the latest video compression issued by ISO/IEC Moving Picture Experts Group (MEPG) and ITU-T Video Coding Experts Group as ISO/IEC 23008-2 MPEG-H Part 2 or called ITU-T H.265, and offers about double the data compression ratio at the same level of video quality, or substantially improved video quality at the same bit rate.
  • MEPG Moving Picture Experts Group
  • ITU-T H.265 ITU-T Video Coding Experts Group
  • Intra prediction can be used when there is no available reference picture, or when inter predication coding is not used for the current block or picture, for instance in I frame or I slice.
  • the reference samples of intra prediction are usually derived from previously coded (or reconstructed) neighboring blocks in the same picture. For example, both in H.264/AVC and H.265/HEVC, the boundary samples of adjacent blocks are used as reference for intra prediction.
  • intra prediction modes In order to cover different texture or structural character, there are many different intra prediction modes. In each mode, a different prediction signal derivation method is used. For example, H.265/HEVC supports a total of 35 intra prediction modes.
  • FIG. 6 illustrates example intra prediction modes of H.265/HEVC, according to an implementation.
  • the decoded boundary samples of adjacent blocks are used as reference.
  • the encoder selects the best luma intra prediction mode of each block from 35 options: 33 directional prediction modes, a DC mode and a Planar mode.
  • the mapping between the intra prediction direction and the intra prediction mode number is specified in FIG. 6. It should be noted that 65 or even more intra prediction modes are developed in the latest video coding technology, for instance, VVC (versatile video coding), which can capture arbitrary edge directions presented in natural video,
  • FIG. 7 illustrates example reference samples for a block, according to an implementation.
  • the block“CUR”, labeled as the block 710 represents the current block to predict.
  • the reference sample block, labeled as the block 720 includes samples along the boundary of adjacent constructed blocks are used as reference samples.
  • the prediction signal can be derived by mapping the reference samples according to a specific method which is indicated by the intra prediction mode.
  • Some or all of the reference samples may not be available for intra prediction due to several reasons. For example, samples outside of the picture, slice, or tile are considered unavailable for prediction.
  • reference samples belonging to inter-predicted PUs are omitted in order to avoid error propagation from potentially erroneously received and reconstructed prior pictures.
  • HEVC it allows the use of all its prediction modes after substituting the non-available reference samples. For the case with none of the reference samples available, all the reference samples are substituted by a nominal average sample value for a given bit depth (e.g., 128 for 8-bit data). If there is at least one reference sample marked as available for intra prediction, the unavailable reference samples are substituted by using the available reference samples.
  • the unavailable reference samples are substituted by scanning the reference samples in clock-wise direction and using the latest available sample value for the unavailable ones. And if the first sample in clock-wise direction scanning is not available, it is will be substituted by the first encountered available reference sample when scanning the samples in the order of clock-wise direction.
  • the“substitution” also can be called padding, the substituted also can be called padded.
  • Constrained intra prediction is a tool to avoid spatial noise propagations caused by spatial intra prediction with encoder-decoder mismatched reference pixels.
  • the encoder-decoder mismatched reference pixels can appear when packet loss happens in transmitting inter-coded slices. They can also appear when lossy decoder-side memory compression is used.
  • constrained intra prediction is enabled, inter-predicted samples are marked as not available or unavailable for intra prediction, and those marked unavailable can be padded with a padding method as disclosed above for performing the full intra prediction estimation in encoding side or intra prediction in decoding side.
  • Cross-component linear model prediction is one of the intra prediction modes that are used to reduce the cross-component redundancy during the intra prediction mode.
  • pred c (i,j) represents the predicted chroma samples and rec L (i,j ) represents the downsampled corresponding reconstructed luma samples.
  • Parameters a and b are derived by minimizing the regression error between the neighbouring reconstructed luma and chroma samples around the current luma block and current chroma block as follows:
  • FIG. 8 illustrates example CCLM operations, according to an implementation.
  • FIG. 8 shows the location of the left and above causal samples and the sample of the current block involved in the CCLM mode. This regression error minimization computation is also performed as part of the decoding process, not just as an encoder search operation, so no syntax is used to convey the a and b values.
  • FIG. 9 illustrates example MaxMin operations, according to an implementation.
  • the linear model coefficients parameters a and b are deblrived by using 2 points, the 2 points (couple of Luma and chroma) (A, B) are the minimum and maximum values inside the set of neighboring Luma samples, as depicted in FIG. 9.
  • the 2 points (couple of Luma and chroma) (A, B) are chose from the down-sampled luma neighboring reconstructed samples, and the chroma neighboring reconstructed samples.
  • the CCLM luma-to-chroma prediction mode is added as one additional chroma intra prediction mode.
  • one more rate-distortion (RD) cost checks for the chroma components are added for selecting the chroma intra prediction mode.
  • FIG. 10 illustrates example templates, according to an implementation.
  • the Luma’ block represents the down-sampled luma part or current luma block which has a same spatial resolution with chroma part.
  • Top templates represent the top neighboring reconstructed chroma samples and the corresponding down-sampled top neighboring reconstructed luma samples.
  • Left templates represent the left neighboring reconstructed chroma samples and the corresponding down-sampled left neighboring reconstructed luma samples.
  • the top neighboring reconstructed chroma samples can be referred to as top chroma template.
  • the corresponding down-sampled left neighboring reconstructed luma samples can be referred to as left luma template.
  • FIG. 11 illustrates example LM coefficient derivation for un-available samples, according to an implementation.
  • a chroma block Ccur if the existing sample is un-available in top template, like samples in A2 part are marked un-available, then the top template will not be used to LM coefficient derivation. And if the existing sample is un-available in the top template, like samples in B2 part is marked un-available, then the left template will not be used to LM coefficients derivation, which will degrade the coding performance of intra prediction.
  • Embodiments of the present disclosure provide intra prediction apparatuses and methods for encoding and decoding an image.
  • a method for cross-component prediction of video data includes: downsampling, by at least one hardware processor, a reconstructed luma block to obtain a downsampled luma block, where the reconstructed luma block corresponds to a chroma block; generating, by the at least one hardware processor, parameters of a linear model (LM); and generating, by the at least one hardware processor, predicted chroma values of the chroma block based on the parameters and the downsampled luma block.
  • LM linear model
  • a non-transitory computer-readable medium storing computer instructions for cross-component prediction of video data, that when executed by one or more hardware processors, cause the one or more hardware processors to perform operations including: downsampling a reconstructed luma block to obtain a downsampled luma block, wherein the reconstructed luma block corresponds to a chroma block; generating parameters of a linear model (LM); and generating predicted chroma values of the chroma block based on the parameters and the downsampled luma block.
  • LM linear model
  • an electronic device includes a non-transitory memory storage comprising instructions; and one or more hardware processors in communication with the memory storage, wherein the one or more hardware processors execute the instructions to: downsample a reconstructed luma block to obtain a downsampled luma block, wherein the reconstructed luma block corresponds to a chroma block; generate parameters of a linear model (LM); and generate predicted chroma values of the chroma block based on the parameters and the downsampled luma block.
  • LM linear model
  • the previously described implementation is implementable using a computer- implemented method; a non-transitory, computer-readable medium storing computer-readable instructions to perform the computer-implemented method; and a computer-implemented system comprising a computer memory interoperably coupled with a hardware processor configured to perform the computer-implemented method and the instructions stored on the non-transitory, computer-readable medium.
  • FIG. 1A is a block diagram illustrating an example coding system, according to an implementation.
  • FIG. 1B is a block diagram illustrating an example video coding system, according to an implementation.
  • FIG. 2 is a block diagram illustrating an example video encoder, according to an implementation.
  • FIG. 3 is a block diagram illustrating an example of a video decoder, according to an implementation.
  • FIG. 4 is a schematic diagram of a network device, according to an implementation.
  • FIG. 5 is a schematic block diagram of an apparatus, according to an implementation.
  • FIG. 6 illustrates example intra prediction modes, according to an implementation.
  • FIG. 7 illustrates example references samples for a block, according to an implementation.
  • FIG. 8 illustrates example Cross-component linear model prediction (CCLM) operations, according to an implementation.
  • CCLM Cross-component linear model prediction
  • FIG. 9 illustrates example MaxMin operations, according to an implementation.
  • FIG. 10 illustrates example templates, according to an implementation.
  • FIG. 11 illustrates example linear model (LM) coefficients derivation for un-available samples, according to an implementation.
  • LM linear model
  • FIG. 12 illustrates example blocks of un-available samples, according to an implementation.
  • FIG. 13 illustrates an example operation for handling un-available samples, according to an implementation.
  • FIG. 14 illustrates another example operation for handling un-available samples, according to an implementation.
  • FIG. 15 illustrates yet another example operation for handling un-available samples, according to an implementation.
  • FIG. 16 illustrates an example flowchart for handling un-available samples, according to an implementation.
  • FIG. 17 illustrates another example flowchart for handling un-available samples, according to an implementation.
  • FIG. 18 illustrates yet another example flowchart for handling un-available samples, according to an implementation.
  • FIG. 19 illustrates yet another example flowchart for handling un-available samples, according to an implementation.
  • FIG. 20 is a flow diagram illustrating an example method for cross-component prediction of video data, according to an implementation.
  • FIG. 1 A is a block diagram illustrating an example coding system 10 that may utilize bidirectional prediction techniques.
  • the coding system 10 includes a source device 12 that provides encoded video data to be decoded at a later time by a destination device 14.
  • the source device 12 may provide the video data to destination device 14 via a computer-readable medium 16.
  • Source device 12 and destination device 14 may comprise any of a wide range of devices, including desktop computers, notebook (i.e., laptop) computers, tablet computers, set-top boxes, telephone handsets such as“smart” phones,“smart” pads, televisions, cameras, display devices, digital media players, video gaming consoles, video streaming devices, or the like.
  • source device 12 and destination device 14 may be equipped for wireless communication.
  • Destination device 14 may receive the encoded video data to be decoded via computer-readable medium 16.
  • Computer-readable medium 16 may comprise any type of medium or device capable of moving the encoded video data from source device 12 to destination device 14.
  • computer-readable medium 16 may comprise a communication medium to enable source device 12 to transmit encoded video data directly to destination device 14 in real-time.
  • the encoded video data may be modulated according to a communication standard, such as a wireless communication protocol, and transmitted to destination device 14.
  • the communication medium may comprise any wireless or wired communication medium, such as a radio frequency (RF) spectrum or one or more physical transmission lines.
  • the communication medium may form part of a packet-based network, such as a local area network, a wide-area network, or a global network such as the Internet.
  • the communication medium may include routers, switches, base stations, or any other equipment that may be useful to facilitate communication from source device 12 to destination device 14.
  • encoded data may be output from output interface 22 to a storage device.
  • encoded data may be accessed from the storage device by input interface.
  • the storage device may include any of a variety of distributed or locally accessed data storage media such as a hard drive, Blu-ray discs, digital video disks (DVD)s, Compact Disc Read-Only Memories (CD-ROMs), flash memory, volatile or non-volatile memory, or any other suitable digital storage media for storing encoded video data.
  • the storage device may correspond to a file server or another intermediate storage device that may store the encoded video generated by source device 12. Destination device 14 may access stored video data from the storage device via streaming or download.
  • the file server may be any type of server capable of storing encoded video data and transmitting that encoded video data to the destination device 14.
  • Example file servers include a web server (e.g., for a website), a file transfer protocol (FTP) server, network attached storage (NAS) devices, or a local disk drive.
  • Destination device 14 may access the encoded video data through any standard data connection, including an Internet connection. This may include a wireless channel (e.g., a Wi-Fi connection), a wired connection (e.g., digital subscriber line (DSL), cable modem, etc.), or a combination of both, that is suitable for accessing encoded video data stored on a file server.
  • the transmission of encoded video data from the storage device may be a streaming transmission, a download transmission, or a combination thereof.
  • the techniques of this disclosure are not necessarily limited to wireless applications or settings.
  • the techniques may be applied to video coding in support of any of a variety of multimedia applications, such as over-the-air television broadcasts, cable television transmissions, satellite television transmissions, Internet streaming video transmissions, such as dynamic adaptive streaming over HTTP (DASH), digital video that is encoded onto a data storage medium, decoding of digital video stored on a data storage medium, or other applications.
  • coding system 10 may be configured to support one-way or two-way video transmission to support applications such as video streaming, video playback, video broadcasting, and/or video telephony.
  • source device 12 includes video source 18, video encoder 20, and output interface 22.
  • Destination device 14 includes input interface 28, video decoder 30, and display device 32.
  • video encoder 20 of source device 12 and/or the video decoder 30 of the destination device 14 may be configured to apply the techniques for bidirectional prediction.
  • a source device and a destination device may include other components or arrangements.
  • source device 12 may receive video data from an external video source, such as an external camera.
  • destination device 14 may interface with an external display device, rather than including an integrated display device.
  • the illustrated coding system 10 of FIG. 1A is merely one example.
  • Techniques for bidirectional prediction may be performed by any digital video encoding and/or decoding device.
  • the techniques of this disclosure generally are performed by a video coding device, the techniques may also be performed by a video encoder/decoder, typically referred to as a “CODEC.”
  • the techniques of this disclosure may also be performed by a video preprocessor.
  • the video encoder and/or the decoder may be a graphics processing unit (GPU) or a similar device.
  • GPU graphics processing unit
  • Source device 12 and destination device 14 are merely examples of such coding devices in which source device 12 generates coded video data for transmission to destination device 14.
  • source device 12 and destination device 14 may operate in a substantially symmetrical manner such that each of the source and destination devices 12, 14 includes video encoding and decoding components.
  • coding system 10 may support one way or two-way video transmission between devices 12, 14, e.g., for video streaming, video playback, video broadcasting, or video telephony.
  • Video source 18 of source device 12 may include a video capture device, such as a video camera, a video archive containing previously captured video, and/or a video feed interface to receive video from a video content provider.
  • video source 18 may generate computer graphics-based data as the source video, or a combination of live video, archived video, and computer-generated video.
  • source device 12 and destination device 14 may form so-called camera phones or video phones.
  • the techniques described in this disclosure may be applicable to video coding in general, and may be applied to wireless and/or wired applications.
  • the captured, pre captured, or computer-generated video may be encoded by video encoder 20.
  • the encoded video information may then be output by output interface 22 onto a computer-readable medium 16.
  • Computer-readable medium 16 may include transient media, such as a wireless broadcast or wired network transmission, or storage media (that is, non-transitory storage media), such as a hard disk, flash drive, compact disc, digital video disc, Blu-ray disc, or other computer- readable media.
  • a network server may receive encoded video data from source device 12 and provide the encoded video data to destination device 14, e.g., via network transmission.
  • a computing device of a medium production facility such as a disc stamping facility, may receive encoded video data from source device 12 and produce a disc containing the encoded video data. Therefore, computer-readable medium 16 may be understood to include one or more computer-readable media of various forms, in various examples.
  • Input interface 28 of destination device 14 receives information from computer- readable medium 16.
  • the information of computer-readable medium 16 may include syntax information defined by video encoder 20, which is also used by video decoder 30, that includes syntax elements that describe characteristics and/or processing of blocks and other coded units, e.g., group of pictures (GOPs).
  • Display device 32 displays the decoded video data to a user, and may comprise any of a variety of display devices such as a cathode ray tube (CRT), a liquid crystal display (LCD), a plasma display, an organic light emitting diode (OLED) display, or another type of display device.
  • CTR cathode ray tube
  • LCD liquid crystal display
  • plasma display e.g., a plasma display
  • OLED organic light emitting diode
  • Video encoder 20 and video decoder 30 may operate according to a video coding standard, such as the High Efficiency Video Coding (HEVC) standard presently under development, and may conform to the HEVC Test Model (HM).
  • video encoder 20 and video decoder 30 may operate according to other proprietary or industry standards, such as the International Telecommunications Union Telecommunication Standardization Sector (ITU-T) H.264 standard, alternatively referred to as Motion Picture Expert Group (MPEG)-4, Part 10, Advanced Video Coding (AVC), H.265/HEVC, or extensions of such standards.
  • ITU-T International Telecommunications Union Telecommunication Standardization Sector
  • MPEG Motion Picture Expert Group
  • AVC Advanced Video Coding
  • H.265/HEVC H.265/HEVC
  • video encoder 20 and video decoder 30 may each be integrated with an audio encoder and decoder, and may include appropriate multiplexer-demultiplexer (MUX- DEMUX) units, or other hardware and software, to handle encoding of both audio and video in a common data stream or separate data streams.
  • MUX-DEMUX units may conform to the ITU H.223 multiplexer protocol, or other protocols such as the user datagram protocol (UDP).
  • Video encoder 20 and video decoder 30 each may be implemented as any of a variety of suitable encoder circuitry, such as one or more microprocessors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs), discrete logic, software, hardware, firmware, or any combinations thereof.
  • DSPs digital signal processors
  • ASICs application specific integrated circuits
  • FPGAs field programmable gate arrays
  • a device may store instructions for the software in a suitable, non-transitory computer-readable medium and execute the instructions in hardware using one or more processors to perform the techniques of this disclosure.
  • Each of video encoder 20 and video decoder 30 may be included in one or more encoders or decoders, either of which may be integrated as part of a combined encoder/decoder (CODEC) in a respective device.
  • a device including video encoder 20 and/or video decoder 30 may comprise an integrated circuit, a microprocessor, and/or a wireless communication device, such as a cellular telephone.
  • Fig. 1B is an illustrative diagram of an example video coding system 40, according to an implementation.
  • the video coding system 40 can include the encoder 200 as will be illustrated in FIG. 2, the decoder 300 as will be illustrated in FIG. 3, or a combination thereof.
  • the system 40 can implement techniques of this present disclosure e.g., the merge estimation in the inter prediction.
  • video coding system 40 may include imaging device(s) 41, video encoder 20, video decoder 30 (and/or a video coder implemented via logic circuitry 47 of processing unit(s) 46), an antenna 42, one or more processor(s) 43, one or more memory store(s) 44, and/or a display device 45.
  • imaging device(s) 41, antenna 42, processing unit(s) 46, logic circuitry 47, video encoder 20, video decoder 30, processor(s) 43, memory store(s) 44, and/or display device 45 may be capable of communication with one another.
  • video coding system 40 may include only video encoder 20 or only video decoder 30 in various practical scenarios.
  • video coding system 40 may include antenna 42. Antenna 42 may be configured to transmit or receive an encoded bitstream of video data, for example. Furthermore, in some examples, video coding system 40 may include display device 45. Display device 45 may be configured to present video data. As shown, in some examples, logic circuitry 54 may be implemented via processing unit(s) 46. Processing unit(s) 46 may include application-specific integrated circuit (ASIC) logic, graphics processor(s), general purpose processor(s), or the like. Video coding system 40 also may include optional processor(s) 43, which may similarly include application-specific integrated circuit (ASIC) logic, graphics processor(s), general purpose processor(s), or the like.
  • ASIC application-specific integrated circuit
  • logic circuitry 54 may be implemented via hardware, video coding dedicated hardware, or the like, and processor(s) 43 may implemented general purpose software, operating systems, or the like.
  • memory store(s) 44 may be any type of memory such as volatile memory (e.g., Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), etc.) or non-volatile memory (e.g., flash memory, etc.), and so forth.
  • memory store(s) 44 may be implemented by cache memory.
  • logic circuitry 54 may access memory store(s) 44 (for implementation of an image buffer for example).
  • logic circuitry 47 and/or processing unit(s) 46 may include memory stores (e.g., cache or the like) for the implementation of an image buffer or the like.
  • video encoder 20 implemented via logic circuitry 47 may include an image buffer (e.g., via either processing unit(s) 46 or memory store(s) 44) and a graphics processing unit (e.g., via processing unit(s) 46).
  • the graphics processing unit may be communicatively coupled to the image buffer.
  • the graphics processing unit may include video encoder 20 as implemented via logic circuitry 47 to embody the various modules as discussed with respect to FIG. 2 and/or any other encoder system or subsystem described herein.
  • the logic circuitry may be configured to perform the various operations as discussed herein.
  • Video decoder 30 may be implemented in a similar manner as implemented via logic circuitry 47 to embody the various modules as discussed with respect to decoder 300 of FIG. 3 and/or any other decoder system or subsystem described herein.
  • video decoder 30 may be implemented via logic circuitry may include an image buffer (e.g., via either processing unit(s) 46 or memory store(s) 44)) and a graphics processing unit (e.g., via processing unit(s) 46).
  • the graphics processing unit may be communicatively coupled to the image buffer.
  • the graphics processing unit may include video decoder 30 as implemented via logic circuitry 47 to embody the various modules as discussed with respect to FIG. 3 and/or any other decoder system or subsystem described herein.
  • antenna 42 of video coding system 40 may be configured to receive an encoded bitstream of video data.
  • the encoded bitstream may include data, indicators, index values, mode selection data, or the like associated with encoding a video frame as discussed herein, such as data associated with the coding partition (e.g., transform coefficients or quantized transform coefficients, optional indicators (as discussed), and/or data defining the coding partition).
  • Video coding system 40 may also include video decoder 30 coupled to antenna 42 and configured to decode the encoded bitstream.
  • the display device 45 configured to present video frames.
  • FIG. 2 is a block diagram illustrating an example of video encoder 200 that can implement the techniques of the present disclosure.
  • Video encoder 200 may perform intra- and inter-coding of video blocks within video slices.
  • Intra-coding relies on spatial prediction to reduce or remove spatial redundancy in video within a given video frame or picture.
  • Inter-coding relies on temporal prediction to reduce or remove temporal redundancy in video within adjacent frames or pictures of a video sequence.
  • Intra-mode may refer to any of several spatial based coding modes.
  • Inter-modes such as uni-directional prediction (P mode) or bi-prediction (B mode), may refer to any of several temporal-based coding modes.
  • FIG. 2 shows a schematic/conceptual block diagram of an example video encoder 200 that is configured to implement the techniques of the present disclosure.
  • the video encoder 200 comprises a residual calculation unit 204, a transform processing unit 206, a quantization unit 208, an inverse quantization unit 210, and inverse transform processing unit 212, a reconstruction unit 214, a buffer unit 216, a loop filter unit 220, a decoded picture buffer (DPB) 230, a prediction processing unit 260 and an entropy encoding unit 270.
  • the prediction processing unit 260 may include an inter estimation 242, inter prediction unit 244, an intra estimation 252, an intra prediction unit 254 and a mode selection unit 262.
  • Inter prediction unit 244 may further include a motion compensation unit (not shown).
  • a video encoder 200, as shown in FIG. 2, may also be referred to as a hybrid video encoder or a video encoder according to a hybrid video codec.
  • the residual calculation unit 204, the transform processing unit 206, the quantization unit 208, the prediction processing unit 260 and the entropy encoding unit 270 form a forward signal path of the encoder 200
  • the inverse quantization unit 210, the inverse transform processing unit 212, the reconstruction unit 214, the buffer 216, the loop filter 220, the decoded picture buffer (DPB) 230, prediction processing unit 260 form a backward signal path of the encoder, wherein the backward signal path of the encoder corresponds to the signal path of the decoder (see decoder 300 in Fig. 3).
  • the encoder 200 is configured to receive, e.g., by input 202, a picture block 201.
  • the picture block 201 is block of a picture, e.g., picture of a sequence of pictures forming a video or video sequence.
  • the picture block 201 may also be referred to as current picture block or picture block to be coded, and the picture as current picture or picture to be coded (in particular in video coding to distinguish the current picture from other pictures, e.g., previously encoded and/or decoded pictures of the same video sequence, i.e., the video sequence which also comprises the current picture).
  • Embodiments of the encoder 200 may comprise a partitioning unit (not shown in FIG. 2) configured to partition the picture into a plurality of blocks, e.g., picture block 201, typically into a plurality of non-overlapping blocks.
  • the partitioning unit may be configured to use the same block size for all pictures of a video sequence and the corresponding grid defining the block size, or to change the block size between pictures or subsets or groups of pictures, and partition each picture into the corresponding blocks.
  • a set of coding tree units may be generated.
  • Each of the CTUs may comprise a coding tree block of luma samples, two corresponding coding tree blocks of chroma samples, and syntax structures used to code the samples of the coding tree blocks.
  • a CTU may comprise a single coding tree block and syntax structures used to code the samples of the coding tree block.
  • a coding tree block may be an N*N block of samples.
  • a CTU may also be referred to as a“tree block” or a“largest coding unit” (LCU).
  • the CTUs of HEVC may be broadly analogous to the macroblocks of other standards, such as H.264/AVC.
  • a CTU is not necessarily limited to a particular size and may include one or more coding units (CUs).
  • a slice may include an integer number of CTUs ordered consecutively in a raster scan order.
  • a CTU is split into CUs by using a quad-tree structure denoted as coding tree to adapt to various local characteristics.
  • the decision whether to code a picture area using inter picture (temporal) or intra-picture (spatial) prediction is made at the CU level.
  • a CU may comprise a coding block of luma samples and two corresponding coding blocks of chroma samples of a picture that has a luma sample array, a Cb sample array, and a Cr sample array, and syntax structures used to code the samples of the coding blocks.
  • a CU may comprise a single coding block and syntax structures used to code the samples of the coding block.
  • a coding block is an N*N block of samples.
  • a CU may be the same size of a CTU.
  • Each CU is coded with one coding mode, which could be, e.g., an intra coding mode or an inter coding mode. Other coding modes are also possible.
  • Encoder 200 receives video data. Encoder 200 may encode each CTU in a slice of a picture of the video data. As part of encoding a CTU, prediction processing unit 260 or another processing unit( including but not limited to unit of encoder 200 shown in figure 2) of encoder 200 may perform partitioning to divide the CTBs of the CTU into progressively - smaller blocks. The smaller blocks may be coding blocks of CUs.
  • Syntax data within a bitstream may also define a size for the CTU.
  • a slice includes a number of consecutive CTUs in coding order.
  • a video frame or image or picture may be partitioned into one or more slices.
  • each tree block may be split into coding units (CUs) according to a quad-tree.
  • a quad-tree data structure includes one node per CU, with a root node corresponding to the treeblock (e.g., CTU). If a CU is split into four sub- CUs, the node corresponding to the CU includes four child nodes, each of which corresponds to one of the sub-CUs.
  • the plurality of nodes in a quad-tree structure includes leaf nodes and non leaf nodes.
  • the leaf nodes have no child nodes in the tree structure (i.e., the leaf nodes are not further split).
  • The, non-leaf nodes include a root node of the tree structure. For each respective non-root node of the plurality of nodes, the respective non-root node corresponds to a sub-CU of a CU corresponding to a parent node in the tree structure of the respective non-root node. Each respective non-leaf node has one or more child nodes in the tree structure.
  • Each node of the quad-tree data structure may provide syntax data for the corresponding CU.
  • a node in the quad-tree may include a split flag, indicating whether the CU corresponding to the node is split into sub-CUs.
  • Syntax elements for a CU may be defined recursively, and may depend on whether the CU is split into sub-CUs. If a CU is not split further, it is referred as a leaf-CU. If a block of CU is split further, it may be generally referred to as a non-leaf-CU.
  • each level of partitioning is a quad-tree split into four sub- CUs.
  • the black CU is an example of a leaf-node (i.e., a block that is not further split).
  • a CU has a similar purpose as a macroblock of the H.264 standard, except that a CU does not have a size distinction.
  • a tree block may be split into four child nodes (also referred to as sub-CUs), and each child node may in turn be a parent node and be split into another four child nodes.
  • Syntax data associated with a coded bitstream may define a maximum number of times a tree block may be split, referred to as a maximum CU depth, and may also define a minimum size of the coding nodes.
  • a bitstream may also define a smallest coding unit (SCU).
  • SCU smallest coding unit
  • the term“block” is used to refer to any of a CU, PU, or TU, in the context of HEVC, or similar data structures in the context of other standards (e.g., macroblocks and sub-blocks thereof in H.264/AVC).
  • each CU can be further split into one, two or four PUs according to the PU splitting type. Inside one PU, the same prediction process is applied and the relevant information is transmitted to the decoder on a PU basis. After obtaining the residual block by applying the prediction process based on the PU splitting type, a CU can be partitioned into transform units (TUs) according to another quad-tree structure similar to the coding tree for the CU.
  • transform units TUs
  • One of key feature of the HEVC structure is that it has the multiple partition conceptions including CU, PU, and TU. PUs may be partitioned to be non-square in shape.
  • Syntax data associated with a CU may also describe, for example, partitioning of the CU into one or more PUs.
  • a TU can be square or non-square (e.g., rectangular) in shape and syntax data associated with a CU may describe, for example, partitioning of the CU into one or more Tus according to a quad-tree. Partitioning modes may differ between whether the CU is skip or direct mode encoded, intra prediction mode encoded, or inter-prediction mode encoded.
  • a size of the CU corresponds to a size of the coding node and may be square or non-square (e.g., rectangular) in shape.
  • the size of the CU may range from 4x4 pixels (or 8x8 pixels) up to the size of the tree block with a maximum of 128x 128 pixels or greater (for example, 256x256 pixels).
  • encoder 200 may generate a residual block for the CU.
  • encoder 100 may generate a luma residual block for the CU.
  • Each sample in the CU's luma residual block indicates a difference between a luma sample in the CU's predictive luma block and a corresponding sample in the CU's original luma coding block.
  • encoder 200 may generate a Cb residual block for the CU.
  • Each sample in the Cb residual block of a CU may indicate a difference between a Cb sample in the CU's predictive Cb block and a corresponding sample in the CU's original Cb coding block.
  • Encoder 100 may also generate a Cr residual block for the CU.
  • Each sample in the CU's Cr residual block may indicate a difference between a Cr sample in the CU's predictive Cr block and a corresponding sample in the CU's original Cr coding block.
  • encoder 100 skips application of the transforms to the transform block.
  • encoder 200 may treat residual sample values in the same way as transform coefficients.
  • the following discussion of transform coefficients and coefficient blocks may be applicable to transform blocks of residual samples.
  • encoder 200 may quantize the coefficient block to possibly reduce the amount of data used to represent the coefficient block, potentially providing further compression. Quantization generally refers to a process in which a range of values is compressed to a single value.
  • encoder 200 may entropy encode syntax elements indicating the quantized transform coefficients. For example, encoder 200 may perform Context-Adaptive Binary Arithmetic Coding (CABAC) or other entropy coding techniques on the syntax elements indicating the quantized transform coefficients.
  • CABAC Context-Adaptive Binary Arithmetic Coding
  • Encoder 200 may output a bitstream of encoded picture data 271 that includes a sequence of bits that form a representation of coded pictures and associated data. Thus, the bitstream comprises an encoded representation of video data.
  • Decoder 300 may also then apply the same MTT partitioning as was performed by encoder 200. In some examples, how a picture of video data was partitioned by encoder 200 may be determined by applying the same set of predefined rules at decoder 300. However, in many situations, encoder 200 may determine a particular partition structure and partition type to use based on rate-distortion criteria for the particular picture of video data being coded.
  • encoder 200 may signal syntax elements in the encoded bitstream that indicate how the picture, and CTUs of the picture, are to be partitioned. Decoder 300 may parse such syntax elements and partition the picture and CTUs accordingly.
  • the prediction processing unit 260 of video encoder 200 may be configured to perform any combination of the partitioning techniques described above, especially, for the motion estimation, and the details will be described later.
  • the picture block 201 again is or can be regarded as a two-dimensional array or matrix of samples with intensity values (sample values), although of smaller dimension than the picture.
  • the picture block 201 may comprise, e.g., one sample array (e.g., a luma array in case of a monochrome picture) or three sample arrays (e.g., a luma and two chroma arrays in case of a color picture) or any other number and/or kind of arrays depending on the color format applied.
  • the number of samples in horizontal and vertical direction (or axis) of the picture block 201 define the size of picture block 201.
  • Encoder 200 is configured encode the picture block by block, e.g. the encoding and prediction are performed per picture block 201.
  • the residual calculation unit 204 is configured to calculate a residual block 205 based on the picture block 201 and a prediction block 265 (further details about the prediction block 265 are provided later), e.g., by subtracting sample values of the prediction block 265 from sample values of the picture block 201, sample by sample (pixel by pixel) to obtain the residual block 205 in the sample domain.
  • the transform processing unit 206 is configured to apply a transform, e.g. a discrete cosine transform (DCT) or discrete sine transform (DST), on the sample values of the residual block 205 to obtain transform coefficients 207 in a transform domain.
  • the transform coefficients 207 may also be referred to as transform residual coefficients and represent the residual block 205 in the transform domain.
  • the transform processing unit 206 may be configured to apply integer approximations of DCT/DST, such as the transforms specified for HEVC/H.265. Compared to an orthogonal DCT transform, such integer approximations are typically scaled by a certain factor.
  • scaling factors are typically chosen based on certain constraints like scaling factors being a power of two for shift operation, bit depth of the transform coefficients, tradeoff between accuracy and implementation costs, etc.
  • Specific scaling factors are, for example, specified for the inverse transform, e.g. by inverse transform processing unit 212, at a decoder 300 (and the corresponding inverse transform, e.g., by inverse transform processing unit 212 at an video encoder 20) and corresponding scaling factors for the forward transform, e.g., by transform processing unit 206, at an encoder 200 may be specified accordingly.
  • the quantization unit 208 is configured to quantize the transform coefficients 207 to obtain quantized transform coefficients 209, e.g., by applying scalar quantization or vector quantization.
  • the quantized transform coefficients 209 may also be referred to as quantized residual coefficients 209.
  • the quantization process may reduce the bit depth associated with some or all of the transform coefficients 207. For example, an n-bit Transform coefficient may be rounded down to an m-bit Transform coefficient during quantization, where n is greater than m.
  • the degree of quantization may be modified by adjusting a quantization parameter (QP). For example for scalar quantization, different scaling may be applied to achieve finer or coarser quantization.
  • QP quantization parameter
  • the applicable quantization step size may be indicated by a quantization parameter (QP).
  • QP quantization parameter
  • the quantization parameter may for example be an index to a predefined set of applicable quantization step sizes.
  • small quantization parameters may correspond to fine quantization (small quantization step sizes) and large quantization parameters may correspond to coarse quantization (large quantization step sizes) or vice versa.
  • the quantization may include division by a quantization step size and corresponding or inverse dequantization, e.g., by inverse quantization unit 210, may include multiplication by the quantization step size.
  • Embodiments according to some standards may be configured to use a quantization parameter to determine the quantization step size.
  • the quantization step size may be calculated based on a quantization parameter using a fixed point approximation of an equation including division. Additional scaling factors may be introduced for quantization and dequantization to restore the norm of the residual block, which might get modified because of the scaling used in the fixed point approximation of the equation for quantization step size and quantization parameter.
  • the scaling of the inverse transform and dequantization might be combined.
  • customized quantization tables may be used and signaled from an encoder to a decoder, e.g., in a bitstream.
  • the quantization is a lossy operation, wherein the loss increases with increasing quantization step sizes.
  • the inverse quantization unit 210 is configured to apply the inverse quantization of the quantization unit 208 on the quantized coefficients to obtain dequantized coefficients 211, e.g., by applying the inverse of the quantization scheme applied by the quantization unit 208 based on, or using the same quantization step size as the quantization unit 208.
  • the dequantized coefficients 211 may also be referred to as dequantized residual coefficients 211 and correspond, although typically not identical to the transform coefficients due to the loss by quantization, to the transform coefficients 207.
  • the inverse transform processing unit 212 is configured to apply the inverse transform of the transform applied by the transform processing unit 206, e.g., an inverse discrete cosine transform (DCT) or inverse discrete sine transform (DST), to obtain an inverse transform block 213 in the sample domain.
  • the inverse transform block 213 may also be referred to as inverse transform dequantized block 213 or inverse transform residual block 213.
  • the reconstruction unit 214 is configured to add the inverse transform block 2l3(i.e., reconstructed residual block 213) to the prediction block 265 to obtain a reconstructed block 215 in the sample domain, e.g., by adding the sample values of the reconstructed residual block 213 and the sample values of the prediction block 265.
  • the buffer unit 216 (or short“buffer” 216), e.g., a line buffer 216, is configured to buffer or store the reconstructed block 215 and the respective sample values, for example for intra prediction.
  • the encoder may be configured to use unfiltered reconstructed blocks and/or the respective sample values stored in buffer unit 216 for any kind of estimation and/or prediction, e.g., intra prediction.
  • Embodiments of the encoder 200 may be configured such that, e.g., the buffer unit 216 is not only used for storing the reconstructed blocks 215 for intra prediction unit 254 but also for the loop filter unit 220 (not shown in FIG. 2), and/or such that, e.g., the buffer unit 216 and the decoded picture buffer 230 form one buffer. Further embodiments may be configured to use filtered blocks 221 and/or blocks or samples from the decoded picture buffer 230 (both not shown in FIG. 2) as input or basis for intra prediction unit 254.
  • the loop filter unit 220 (or short“loop filter” 220), is configured to filter the reconstructed block 215 to obtain a filtered block 221, for example, to smooth pixel transitions, or otherwise improve the video quality.
  • the loop filter unit 220 is intended to represent one or more loop filters such as a de-blocking filter, a sample-adaptive offset (SAO) filter or other filters, such as, a bilateral filter or an adaptive loop filter (ALF) or a sharpening or smoothing filters or collaborative filters.
  • the loop filter unit 220 is shown in FIG. 2 as being an in loop filter, in other configurations, the loop filter unit 220 may be implemented as a post loop filter.
  • the filtered block 221 may also be referred to as filtered reconstructed block 221.
  • Decoded picture buffer 230 may store the reconstructed coding blocks after the loop filter unit 220 performs the filtering operations on the reconstructed coding blocks.
  • Embodiments of the encoder 200 may be configured to output loop filter parameters (such as sample adaptive offset information), for example, directly or entropy encoded via the entropy encoding unit 270 or any other entropy coding unit, so that, for example, a decoder 300 may receive and apply the same loop filter parameters for decoding.
  • loop filter parameters such as sample adaptive offset information
  • the decoded picture buffer (DPB) 230 may be a reference picture memory that stores reference picture data for use in encoding video data by video encoder 20.
  • the DPB 230 may be formed by any of a variety of memory devices, such as dynamic random access memory (DRAM), including synchronous DRAM (SDRAM), magnetoresistive RAM (MRAM), resistive RAM (RRAM), or other types of memory devices.
  • DRAM dynamic random access memory
  • SDRAM synchronous DRAM
  • MRAM magnetoresistive RAM
  • RRAM resistive RAM
  • the DPB 230 and the buffer 216 may be provided by the same memory device or separate memory devices.
  • the decoded picture buffer (DPB) 230 is configured to store the filtered block 221.
  • the decoded picture buffer 230 may be further configured to store other previously filtered blocks, for example, previously reconstructed and filtered blocks 221, of the same current picture or of different pictures, such as previously reconstructed pictures, and may provide complete previously reconstructed, i.e., decoded, pictures (and corresponding reference blocks and samples) and/or a partially reconstructed current picture (and corresponding reference blocks and samples), for example for inter prediction.
  • the decoded picture buffer (DPB) 230 is configured to store the reconstructed block 215.
  • the prediction processing unit 260 also referred to as block prediction processing unit 260, is configured to receive or obtain the current picture block 201 and reconstructed picture data, e.g., reference samples 217 of the same (current) picture from buffer 216 and/or reference picture data from one or a plurality of previously decoded pictures from decoded picture buffer 230, and to process such data for prediction, i.e., to provide a prediction block 265, which may be an inter-predicted block 245 or an intra-predicted block 255.
  • a prediction block 265 which may be an inter-predicted block 245 or an intra-predicted block 255.
  • Mode selection unit 262 may be configured to select a prediction mode (e.g., an intra or inter prediction mode) and/or a corresponding prediction block 245 or 255 to be used as prediction block 265 for the calculation of the residual block 205 and for the reconstruction of the reconstructed block 215.
  • a prediction mode e.g., an intra or inter prediction mode
  • a corresponding prediction block 245 or 255 to be used as prediction block 265 for the calculation of the residual block 205 and for the reconstruction of the reconstructed block 215.
  • Embodiments of the mode selection unit 262 may be configured to select the prediction mode (e.g., from those supported by prediction processing unit 260), which provides the best match or in other words the minimum residual (minimum residual means better compression for transmission or storage), or a minimum signaling overhead (minimum signaling overhead means better compression for transmission or storage), or which considers or balances both.
  • the mode selection unit 262 may be configured to determine the prediction mode based on rate distortion optimization (RDO), i.e., select the prediction mode which provides a minimum rate distortion optimization or whose associated rate distortion at least fulfills a prediction mode selection criterion.
  • RDO rate distortion optimization
  • prediction processing unit 260 e.g., prediction processing unit 260 and mode selection (e.g., by mode selection unit 262) performed by an example encoder 200 will be explained in more detail.
  • the encoder 200 is configured to determine or select the best or an optimum prediction mode from a set of (pre-determined) prediction modes.
  • the set of prediction modes may comprise, for example, intra-prediction modes and/or inter-prediction modes.
  • the set of intra-prediction modes may comprise 35 different intra-prediction modes, e.g., non-directi onal modes like a DC (or mean) mode and planar mode, or directional modes, e.g., as defined in H.265, or may comprise 67 different intra-prediction modes, e.g., non directi onal modes like a DC (or mean) mode and planar mode, or directional modes, e.g., as defined in H.266 under developing.
  • intra-prediction modes e.g., non-directi onal modes like a DC (or mean) mode and planar mode
  • directional modes e.g., as defined in H.266 under developing.
  • the set of (or possible) inter-prediction modes depend on the available reference pictures (i.e., previous at least partially decoded pictures, for example, stored in DPB 230) and other inter-prediction parameters, such as whether the whole reference picture or only a part, for example a search window area around the area of the current block, of the reference picture is used for searching for a best matching reference block, and/or for example whether pixel interpolation is applied, such as a half/semi-pel and/or quarter-pel interpolation, or not.
  • pixel interpolation such as a half/semi-pel and/or quarter-pel interpolation, or not.
  • skip mode and/or direct mode may be applied.
  • the prediction processing unit 260 may be further configured to partition the picture block 201 into smaller block partitions or sub-blocks, for example, iteratively using quad- tree-partitioning (QT), binary partitioning (BT) or triple-tree-partitioning (TT) or any combination thereof, and to perform, for example, the prediction for each of the block partitions or sub-blocks, wherein the mode selection comprises the selection of the tree-structure of the partitioned block 201 and the prediction modes applied to each of the block partitions or sub blocks.
  • QT quad- tree-partitioning
  • BT binary partitioning
  • TT triple-tree-partitioning
  • the inter prediction unit 244 may include motion estimation (ME) unit and motion compensation (MC) unit (not shown in fig.2).
  • the motion estimation unit is configured to receive or obtain the picture block 201 and a decoded picture 331, or at least one or a plurality of previously reconstructed blocks, for example, reconstructed blocks of one or a plurality of other/different previously decoded pictures 331, for motion estimation.
  • a video sequence may comprise the current picture and the previously decoded pictures 331, or in other words, the current picture and the previously decoded pictures 331 may be part of or form a sequence of pictures forming a video sequence.
  • the encoder 200 may, for example, be configured to select a reference block from a plurality of reference blocks of the same or different pictures of the plurality of other pictures and provide a reference picture (or reference picture index) and/or an offset (spatial offset) between the position (x, y coordinates) of the reference block and the position of the current block as inter prediction parameters to the motion estimation unit (not shown in fig.2).
  • This offset is also called motion vector (MV).
  • Merging is an important motion estimation tool used in HEVC and inherited to VVC.
  • the first step is to construct a merge candidate list where each of the candidates contains all motion data including the information regarding whether one or two reference picture lists are used, as well as a reference index and a motion vector for each list.
  • the merge candidate list is constructed based on the following candidates: a. up to four spatial merge candidates that are derived from five spatial neighboring blocks; b. one temporal merge candidate derived from two temporal, co located blocks; c. additional merge candidates including combined bi-predictive candidates and zero motion vector candidates.
  • the intra prediction unit 254 is further configured to determine, based on intra prediction parameters, e.g., the selected intra prediction mode, the intra prediction block 255. In any case, after selecting an intra prediction mode for a block, the intra prediction unit 254 is also configured to provide intra prediction parameter, i.e., information indicative of the selected intra prediction mode for the block to the entropy encoding unit 270. In one example, the intra prediction unit 254 may be configured to perform any combination of the intra prediction techniques described later.
  • the intra prediction unit 254 is designed to perform the following steps/method, especially, to have the CCLM performable in case any of the template/block used for CCLM including un-available samples.
  • FIG. 12 illustrates example blocks of un-available samples, according to an implementation.
  • Al Al, A2, A3 are 3 parts in the top template
  • Bl, B2, B3 are the 3 parts in left template.
  • the Lcur is the corresponding luma block of Ccur.
  • the Cl, C2, C3 are 3 parts on the top or above of Lcur
  • Dl, D2, D3 are 3 parts on the left of Lcur.
  • Lcur’ is the down-sampled block of Lcur.
  • Cl’, C2’, C3’ are the top templates of Lcur’, Dl’, D2’, D3’ are the left templates of Lcur’.
  • Cl, C2, C3 are used to down- sample to get Cl’, C2’, C3’.
  • Dl, D2, D3 are used to down-sample to get Dl’,D2’,D3’.
  • the samples marked with un-available will be padded using the available samples, then the template which the samples belong to can be used to derive the LM coefficients.
  • the unavailable samples are padded by scanning the samples in clock-wise direction and using the latest available sample value for the unavailable ones. If the bottom sample in is not available, it is will be padded by the first encountered available sample when scanning the samples in a clock-wise direction. The left-top sample will be also used for the padding process.
  • the un-available neighboring samples in current luma block are padded using a similar method. After padding the samples, the luma samples in template can be derived by using a down-sampling operation. Then, LM coefficients can be derived using an existing method.
  • FIG. 13 illustrates an example operation of handling un-available samples, according to an implementation.
  • the samples in the A2 part in the top chroma template are marked with un-available
  • the samples in the B2 part in the left chroma template are marked with un-available.
  • Neighboring samples in D2, C2 of current luma block Lcur are also marked with un-available. For the padding process:
  • the samples in B2 part will be padded using the top-most sample in the Bl part, the samples in the A2 part will be padded using the right-most sample in the Al part. [00122] For each column, the samples in the D2 part will be padded using the top-most sample in the Dl part, and for each row, the samples in the C2 part will be padded using the right-most sample in the Cl part.
  • the bottom sample in the Bl/Dl part is not available, it is will be padded by the first encountered available sample when scanning the samples in the order of clock-wise direction.
  • the left-top sample El will be also used for the padding process.
  • Dl’, D2’, D3’and Cl’, C2’, C3’ can be derived using an existing down-sampling method.
  • the LM coefficients can be derived by using the samples in Dl’, D2’, D3’and Cl’, C2’, C3’ and in Bl, B2, B3 and Al, A2, A3 using an existing method, such as the LSS method or the MaxMin method.
  • the detail padding method is not limited here, the padding method described above is the method in HEVC, while other padding methods also can be used. Such as: using the interpolation based on the nearest available samples on the 2-side of the un-available samples; and copying the nearest available sample of the un-available sample;
  • the second method (using padding method, down-sampling then padding).
  • the difference between second method and the first method is the order of the down-sampling operation and the padding operation for luma part:
  • the first method after padding the neighboring samples marked with un-available in the luma block, then the down- sampling process are applied to get the samples in the luma template.
  • the down-sampling process is applied before the padding process.
  • the neighboring samples of current luma block will be used for down-sampling, to get the luma samples in the luma template, therefore, some samples will be un-available in the luma template.
  • the padding operation will be applied to get the values of the un-available samples in the luma template.
  • FIG. 14 illustrates an example operation of handling un-available samples based on the second method, according to an implementation.
  • the padding method is not limited here.
  • the third method (use the available samples, no padding method). [00132] The difference between the third method and the first and second methods is that in the first and second method, the unavailable samples will be padded using the available samples, to derive the LM coefficients. In the third method, only the available samples in the template will be used to derive the LM coefficients.
  • FIG. 15 illustrates yet another example operation of handling un-available samples, according to an implementation.
  • the samples in B2 and A2 which are marked with un-available, will not be used to derive the LM coefficients. Therefore, the samples in C2’ and D2’ do not need to be derived by padding or down-sampling. Only the samples in DL, D3’, Cl’, C3’ and Bl, B3, Al, A3 will be used to derive the LM coefficients using an existing method, such as the LSS method or the MaxMin method.
  • the LM coefficients deriving method will be selected adaptively, based on the number of available template samples, which means that, if the number of available template samples is a number of power of 2, then LSS method will be used, otherwise, the MaxMin method will be used.
  • the available samples in the template which the un-available sample belongs to, can also used to derive the LM coefficients. If the number of available template samples is a number of power of 2, then LSS method will be used, otherwise, the MaxMin method will be used.
  • the un-available sample in the template (luma template and the chroma template) will be padded using the available samples, then the template can be used to derive the LM coefficients.
  • the un-available samples in the chroma template will be padded using the available samples.
  • the un-available neighboring samples in the corresponding luma block will be padded using the available samples, then the samples in the luma template can be derived by down-sampling.
  • the fourth method only the available samples in the template will be used to derive the LM coefficients, without the padding operation.
  • the LM coefficients deriving method will be selected adaptively, based on the number of available template samples.
  • the methods proposed in this patent is used to prepare the template samples to derive the LM coefficients, the method belongs to the intra prediction module. Therefore, it exists both on the decoder side and the encoder side and, the selection operation in the encoder and the decoder is the same.
  • a chroma block For a chroma block, to get its prediction using a CCLM mode, first, it is needed to obtain the corresponding down-sampled luma samples, then the template samples must be prepared to calculate the LM coefficients using an existing method, and then get the prediction of current chroma block using the derived LM coefficients and the down-sampled luma block using equation (1).
  • Embodiment 1 is related to the first method described above.
  • Embodiment 2 is related to the second method described in above.
  • Embodiment 3 is related to the third method described in above.
  • Embodiment 4 is related to the fourth method described in above.
  • Embodiment 1 using padding method, padding then down-sampling
  • FIG. 16 illustrates an example flowchart of handling un-available samples, according to an implementation.
  • FIG. 16 includes the following steps:
  • Step 1 get the down-sampled luma block
  • the down-sampling method can use the existing method.
  • DCT discrete cosine transform
  • bilinear filter bilinear filter
  • Step 2 get the template samples
  • the template samples will be used to derive the LM coefficients.
  • the template samples means the luma template samples and the chroma template samples.
  • Step 2.1 Padding the un-available neighboring samples of current luma block
  • a padding operation will be applied using the available samples. For example, for each column, and for each row, the unavailable samples are padded by scanning the samples in a clock-wise direction and using the latest available sample value for the unavailable ones. If the first sample in is not available, it is will be padded by the first encountered available sample when scanning the samples in a clock-wise direction.
  • Step 2.2 Get the luma template samples
  • a down-sampling operation After getting the neighboring samples of current block, a down-sampling operation will be applied to get the luma template samples.
  • existing method can be used, like 6-taps filter ⁇ 1,2,1, 1,2,1 ⁇ , or 2-taps ⁇ 1,1 ⁇ , and so on.
  • Step 2.3 Padding the un-available chroma template samples
  • the un-available chroma template samples will be padded using the available chroma template samples.
  • the unavailable samples are padded by scanning the samples in a clock-wise direction and using the latest available sample value for the unavailable ones If the first sample is not available, it will be padded by the first encountered available sample when scanning the samples in the order of clock-wise direction.
  • Step 3 calculate the linear model coefficients
  • Embodiment 2 using padding method, down-sampling then padding
  • the neighboring samples of current luma block will be used to down-sampling, to get the luma samples in the luma template, therefore, some samples will be un-available in the luma template. Then the padding operation will be applied to get the values of the un-available samples in the luma template.
  • FIG. 17 illustrates an example flowchart of step 2, according to an implementation.
  • FIG. 17 includes the following sub-steps for Step 2: [00171] Step 2.1 Get the luma template samples using the available neighboring luma samples of current luma block
  • Step 2.2 Padding the un-available luma template samples using the available luma samples
  • padding operation will be applied using the available samples.
  • the unavailable samples are padded by scanning the samples in clock-wise direction and using the latest available sample value for the unavailable ones. And if the first sample in is not available, it is will be padded by the first encountered available sample when scanning the samples in the order of clock-wise direction.
  • Step 2.3 Padding the un-available chroma template samples
  • the un-available chroma template samples will be padded using the available chroma template samples.
  • the unavailable samples are padded by scanning the samples in clock wise direction and using the latest available sample value for the unavailable ones. And if the first sample in is not available, it is will be padded by the first encountered available sample when scanning the samples in the order of clock-wise direction.
  • Embodiment 3 use the available samples, no padding method.
  • FIG. 18 illustrates yet another example flowchart of handling un-available samples, according to an implementation.
  • FIG. 18 includes the following steps:
  • Step 1 get the down-sampled luma block
  • Step 2 get the available template samples
  • the template samples will be used to derive the LM coefficients.
  • the template samples means the luma template samples and the chroma template samples.
  • the method to get available template samples means: for luma template, using the available neighboring samples to get the available luma template samples by down-sampling. And then, the available template samples are get.
  • Step 3 Calculate the linear model coefficients, using available template samples
  • Step 4 get the prediction
  • Embodiment 4 adaptively selecting the LM coefficients deriving method
  • the LM coefficients deriving method will be selected adaptively, based on the number of available template samples, for the detail, if the number of available template samples is a number of power of 2, then LSS method will be used, otherwise, the MaxMin method will be used.
  • FIG. 19 illustrates yet another example flowchart of handling un-available samples, according to an implementation.
  • FIG. 19 includes the following steps:
  • Step 1 get the down-sampled luma block
  • Step 2 get the available template samples
  • Step 3 Calculate the linear model coefficients, using LM coefficients deriving method adaptively selected based on the number of available template samples
  • Step 4 get the prediction.
  • JCTVC-D094 Constrained Intra Prediction Scheme for Flexible-Sized Prediction Units in HEVC
  • the entropy encoding unit 270 is configured to apply an entropy encoding algorithm or scheme (e.g., a variable length coding (VLC) scheme, an context adaptive VLC scheme (CALVC), an arithmetic coding scheme, a context adaptive binary arithmetic coding (CABAC), syntax-based context-adaptive binary arithmetic coding (SBAC), probability interval partitioning entropy (PIPE) coding or another entropy encoding methodology or technique) on the quantized residual coefficients 209, inter prediction parameters, intra prediction parameters, and/or loop filter parameters, individually or j ointly (or not at all) to obtain encoded picture data which can be output by the output 272, e.g., in the form of an encoded bitstream 21.
  • VLC variable length coding
  • CABAC context adaptive binary arithmetic coding
  • SBAC syntax-based context-adaptive binary arithmetic coding
  • PIPE probability interval partitioning entropy
  • the encoded bitstream 21 may be transmitted to video decoder 30, or archived for later transmission or retrieval by video decoder 30.
  • the entropy encoding unit 270 can be further configured to entropy encode the other syntax elements for the current video slice being coded.
  • a non-transform based encoder 200 can quantize the residual signal directly without the transform processing unit 206 for certain blocks or frames.
  • an encoder 200 can have the quantization unit 208 and the inverse quantization unit 210 combined into a single unit.
  • FIG. 3 shows an example video decoder 300 that is configured to implement the techniques of this present disclosure.
  • the video decoder 300 configured to receive encoded picture data (e.g., encoded bitstream) 271, for example encoded by encoder 200, to obtain a decoded picture 331.
  • encoded picture data e.g., encoded bitstream
  • video decoder 300 receives video data, e.g., an encoded video bitstream that represents picture blocks of an encoded video slice and associated syntax elements, from video encoder 200.
  • the decoder 300 comprises an entropy decoding unit 304, an inverse quantization unit 310, an inverse transform processing unit 312, a reconstruction unit 314, a buffer 316, a loop filter unit 320, a decoded picture buffer 330 and a prediction processing unit 360.
  • the prediction processing unit 360 may include an inter prediction unit 344, an intra prediction unit 354, and a mode selection unit 362.
  • Video decoder 300 may, in some examples, perform a decoding pass generally reciprocal to the encoding pass described with respect to video encoder 200 from FIG. 2.
  • the entropy decoding unit 304 is configured to perform entropy decoding to the encoded picture data 271 to obtain, for example, quantized coefficients 309 and/or decoded coding parameters (not shown in Fig. 3), e.g., (decoded) any or all of inter prediction parameters, intra prediction parameter, loop filter parameters, and/or other syntax elements. Entropy decoding unit 304 is further configured to forward inter prediction parameters, intra prediction parameter and/or other syntax elements to the prediction processing unit 360. Video decoder 300 may receive the syntax elements at the video slice level and/or the video block level.
  • the inverse quantization unit 310 may be identical in function to the inverse quantization unit 110
  • the inverse transform processing unit 312 may be identical in function to the inverse transform processing unit 112
  • the reconstruction unit 314 may be identical in function reconstruction unit 114
  • the buffer 316 may be identical in function to the buffer 116
  • the loop filter 320 may be identical in function to the loop filter 120
  • the decoded picture buffer 330 may be identical in function to the decoded picture buffer 130.
  • the prediction processing unit 360 may comprise an inter prediction unit 344 and an intra prediction unit 354, wherein the inter prediction unit 344 may resemble the inter prediction unit 144 in function, and the intra prediction unit 354 may resemble the intra prediction unit 154 in function.
  • the prediction processing unit 360 is typically configured to perform the block prediction and/or obtain the prediction block 365 from the encoded data and to receive or obtain (explicitly or implicitly) the prediction related parameters and/or the information about the selected prediction mode, e.g., from the entropy decoding unit 304.
  • intra prediction unit 354 of prediction processing unit 360 is configured to generate prediction block 365 for a picture block of the current video slice based on a signaled intra prediction mode and data from previously decoded blocks of the current frame or picture.
  • inter prediction unit 344 e.g. motion compensation unit
  • the prediction blocks may be produced from one of the reference pictures within one of the reference picture lists.
  • Video decoder 300 may construct the reference frame lists, List 0 and List 1, using default construction techniques based on reference pictures stored in DPB 330.
  • Prediction processing unit 360 is configured to determine prediction information for a video block of the current video slice by parsing the motion vectors and other syntax elements, and uses the prediction information to produce the prediction blocks for the current video block being decoded. For example, the prediction processing unit 360 uses some of the received syntax elements to determine a prediction mode (e.g., intra or inter prediction) used to code the video blocks of the video slice, an inter prediction slice type (e.g., B slice, P slice, or GPB slice), construction information for one or more of the reference picture lists for the slice, motion vectors for each inter encoded video block of the slice, inter prediction status for each inter coded video block of the slice, and other information to decode the video blocks in the current video slice.
  • a prediction mode e.g., intra or inter prediction
  • an inter prediction slice type e.g., B slice, P slice, or GPB slice
  • Inverse quantization unit 310 is configured to inverse quantize, i.e., de-quantize, the quantized transform coefficients provided in the bitstream and decoded by entropy decoding unit 304.
  • the inverse quantization process may include use of a quantization parameter calculated by video encoder 100 for each video block in the video slice to determine a degree of quantization and, likewise, a degree of inverse quantization that can be applied.
  • Inverse transform processing unit 312 is configured to apply an inverse transform, e.g., an inverse DCT, an inverse integer transform, or a conceptually similar inverse transform process, to the transform coefficients in order to produce residual blocks in the pixel domain.
  • an inverse transform e.g., an inverse DCT, an inverse integer transform, or a conceptually similar inverse transform process
  • the reconstruction unit 314 is configured to add the inverse transform block 313 (also referred to as reconstructed residual block 313) to the prediction block 365 to obtain a reconstructed block 315 in the sample domain, e.g., by adding the sample values of the reconstructed residual block 313 and the sample values of the prediction block 365.
  • the inverse transform block 313 also referred to as reconstructed residual block 313
  • the loop filter unit 320 (either in the coding loop or after the coding loop) is configured to filter the reconstructed block 315 to obtain a filtered block 321, e.g., to smooth pixel transitions, or otherwise improve the video quality.
  • the loop filter unit 320 may be configured to perform any combination of the filtering techniques described later.
  • the loop filter unit 320 is intended to represent one or more loop filters such as a de-blocking filter, a sample-adaptive offset (SAO) filter or other filters, for example, a bilateral filter or an adaptive loop filter (ALF) or a sharpening or smoothing filters or collaborative filters.
  • SAO sample-adaptive offset
  • ALF adaptive loop filter
  • the loop filter unit 320 is shown in FIG. 3 as being an in loop filter, in other configurations, the loop filter unit 320 may be implemented as a post loop filter.
  • decoded video blocks in a given frame or picture are then stored in decoded picture buffer 330, which stores reference pictures used for subsequent motion compensation.
  • the decoder 300 is configured to output the decoded picture 331, e.g. via output 332, for presentation or viewing to a user.
  • FIG. 4 is a schematic diagram of a network device 400 (e.g., a coding device) according to an embodiment of the disclosure.
  • the network device 400 is suitable for implementing the disclosed embodiments as described herein.
  • the network device 400 may be a decoder such as video decoder 300 of FIG. 1A or an encoder such as video encoder 200 of FIG. 1A. In an embodiment, the network device 400 may be one or more components of the video decoder 300 of FIG. 1A or the video encoder 200 of FIG. 1A as described above.
  • the network device 400 comprises ingress ports 410 and receiver units (Rx) 420 for receiving data; a processor, logic unit, or central processing unit (CPU) 430 to process the data; transmitter units (Tx) 440 and egress ports 450 for transmitting the data; and a memory 460 for storing the data.
  • the network device 400 may also comprise optical-to-electrical (OE) components and electrical-to-optical (EO) components coupled to the ingress ports 410, the receiver units 420, the transmitter units 440, and the egress ports 450 for egress or ingress of optical or electrical signals.
  • OE optical-to-electrical
  • EO electrical-to-optical
  • the processor 430 is implemented by hardware and software.
  • the processor 430 may be implemented as one or more CPU chips, cores (e.g., as a multi-core processor), FPGAs, ASICs, and DSPs.
  • the processor 430 is in communication with the ingress ports 410, receiver units 420, transmitter units 440, egress ports 450, and memory 460.
  • the processor 430 comprises a coding module 470.
  • the coding module 470 implements the disclosed embodiments described above. For instance, the coding module 470 implements, processes, prepares, or provides the various coding operations. The inclusion of the coding module 470 therefore provides a substantial improvement to the functionality of the network device 400 and effects a transformation of the network device 400 to a different state.
  • the coding module 470 is implemented as instructions stored in the memory 460 and executed by the processor 430.
  • the memory 460 comprises one or more disks, tape drives, and solid-state drives and may be used as an over-flow data storage device, to store programs when such programs are selected for execution, and to store instructions and data that are read during program execution.
  • the memory 460 may be volatile and/or non-volatile and may be read-only memory (ROM), random access memory (RAM), ternary content-addressable memory (TCAM), and/or static random-access memory (SRAM).
  • FIG. 5 is a schematic block diagram of an apparatus 500 that can be used to implement the source device 12 or the destination device 14, according to an implementation.
  • the apparatus 500 can implement techniques of this present disclosure.
  • the apparatus 500 can be in the form of a computing system including multiple computing devices, or in the form of a single computing device, for example, a mobile phone, a tablet computer, a laptop computer, a notebook computer, a desktop computer, and the like.
  • a processor 502 in the apparatus 500 can be a central processing unit.
  • the processor 502 can be any other type of device, or multiple devices, capable of manipulating or processing information now-existing or hereafter developed.
  • the disclosed implementations can be practiced with a single processor as shown, e.g., the processor 502, advantages in speed and efficiency can be achieved using more than one processor.
  • a memory 504 in the apparatus 500 can be a read only memory (ROM) device or a random access memory (RAM) device in an implementation. Any other suitable type of storage device can be used as the memory 504.
  • the memory 504 can include code and data 506 that is accessed by the processor 502 using a bus 512.
  • the memory 504 can further include an operating system 508 and application programs 510, the application programs 510 including at least one program that permits the processor 502 to perform the methods described here.
  • the application programs 510 can include applications 1 through N, which further include a video coding application that performs the methods described here.
  • the apparatus 500 can also include additional memory in the form of a secondary storage 514, which can, for example, be a memory card used with a mobile computing device. Because the video communication sessions may contain a significant amount of information, they can be stored in whole or in part in the secondary storage 514 and loaded into the memory 504 as needed for processing.
  • the apparatus 500 can also include one or more output devices, such as a display 518.
  • the display 518 may be, in one example, a touch sensitive display that combines a display with a touch sensitive element that is operable to sense touch inputs.
  • the display 518 can be coupled to the processor 502 via the bus 512.
  • Other output devices that permit a user to program or otherwise use the apparatus 500 can be provided in addition to or as an alternative to the display 518.
  • the output device is or includes a display
  • the display can be implemented in various ways, including by a liquid crystal display (LCD), a cathode-ray tube (CRT) display, a plasma display or light emitting diode (LED) display, such as an organic LED (OLED) display.
  • LCD liquid crystal display
  • CRT cathode-ray tube
  • LED light emitting diode
  • OLED organic LED
  • the apparatus 500 can also include or be in communication with an image sensing device 520, for example a camera, or any other image-sensing device 520 now existing or hereafter developed that can sense an image such as the image of a user operating the apparatus 500.
  • the image-sensing device 520 can be positioned such that it is directed toward the user operating the apparatus 500.
  • the position and optical axis of the image-sensing device 520 can be configured such that the field of vision includes an area that is directly adj acent to the display 518 and from which the display 518 is visible.
  • the apparatus 500 can also include or be in communication with a sound-sensing device 522, for example a microphone, or any other sound-sensing device now existing or hereafter developed that can sense sounds near the apparatus 500.
  • the sound-sensing device 522 can be positioned such that it is directed toward the user operating the apparatus 500 and can be configured to receive sounds, for example, speech or other utterances, made by the user while the user operates the apparatus 500.
  • FIG. 5 depicts the processor 502 and the memory 504 of the apparatus 500 as being integrated into a single unit, other configurations can be utilized.
  • the operations of the processor 502 can be distributed across multiple machines (each machine having one or more of processors) that can be coupled directly or across a local area or other network.
  • the memory 504 can be distributed across multiple machines such as a network-based memory or memory in multiple machines performing the operations of the apparatus 500.
  • the bus 5 l2of the apparatus 500 can be composed of multiple buses.
  • the secondary storage 514 can be directly coupled to the other components of the apparatus 500 or can be accessed via a network and can comprise a single integrated unit such as a memory card or multiple units such as multiple memory cards.
  • the apparatus 500 can thus be implemented in a wide variety of configurations.
  • FIG. 20 is a flow diagram 2000 illustrating an example method for cross component prediction of video data, according to an implementation.
  • the method 2000 may be performed by the device described in this disclosure, or any suitable system, environment, software, and hardware, or a combination of systems, environments, software, and hardware, as appropriate.
  • various steps of the method 2020 can be run in parallel, in combination, in loops, or in any order.
  • the example method 2000 begins at 2002, where a reconstructed luma block is downsampled by at least one hardware processor to obtain a downsampled luma block.
  • the reconstructed luma block corresponds to a chroma block.
  • the at least one hardware processor generates parameters of a linear model (LM).
  • the at least one hardware processor generates predicted chroma values of the chroma block based on the parameters and the downsampled luma block.
  • LM linear model
  • a method for cross-component prediction of video data includes: downsampling, by at least one hardware processor, a reconstructed luma block to obtain a downsampled luma block, where the reconstructed luma block corresponds to a chroma block; generating, by the at least one hardware processor, parameters of a linear model (LM); and generating, by at least one hardware processor, predicted chroma values of the chroma block based on the parameters and the downsampled luma block.
  • LM linear model
  • LM includes one or more of followings: a cross-component linear model (CCLM) mode, a multi-directional linear model (MDLM) mode, and a multiple model linear model (MMLM) mode.
  • CCLM cross-component linear model
  • MDLM multi-directional linear model
  • MMLM multiple model linear model
  • a sixth feature combinable with any of the previous features, where the method further includes encoding or decoding a video image using the predicted chroma values.
  • a non-transitory computer-readable medium storing computer instructions for cross-component prediction of video data, that when executed by one or more hardware processors, cause the one or more hardware processors to perform operations including: downsampling a reconstructed luma block to obtain a downsampled luma block, wherein the reconstructed luma block corresponds to a chroma block; generating parameters of a linear model (LM); and generating predicted chroma values of the chroma block based on the parameters and the downsampled luma block.
  • LM linear model
  • a second feature, combinable with any of the previous or following features, where the generating parameters of the LM includes: obtaining a second set of reconstructed neighboring luma downsampled samples, where the second set of reconstructed neighboring luma downsampled samples correspond to N column of luma samples at left of the reconstructed luma block, N is an positive integer, and 0 ⁇ N ⁇ 3; obtaining a second set of reconstructed neighboring chrome samples, where the second set of reconstructed neighboring chrome samples correspond to a column of chrome samples at left of the chrome block; and deriving, based on the second set of reconstructed neighboring luma downsampled samples and the second set of reconstructed neighboring chrome samples, the parameters of the LM.
  • a fourth feature, combinable with any of the previous or following features, where the generating parameters of the LM includes: obtaining a second set of reconstructed neighboring luma downsampled samples, where the second set of reconstructed neighboring luma downsampled samples correspond to N column of luma samples at left of the reconstructed luma block, N is an positive integer, and 0 ⁇ N ⁇ 3; determining a max luma value and a min luma value from the second set of reconstructed neighboring luma downsampled samples; determining, based on positions of the max luma value and the min luma value in the second set of reconstructed neighboring luma downsampled samples, a first chroma value corresponding the max luma value and a second chroma value corresponding to the min luma value; and determining the parameters of the LM based on the max luma value, the min luma value, the first chroma value, and the second chroma value
  • LM includes one or more of followings: a cross-component linear model (CCLM) mode, a multi-directional linear model (MDLM) mode, and a multiple model linear model (MMLM) mode.
  • CCLM cross-component linear model
  • MDLM multi-directional linear model
  • MMLM multiple model linear model
  • a sixth feature combinable with any of the previous features, where the operations further include encoding or decoding a video image using the predicted chroma values.
  • an electronic device includes a non-transitory memory storage comprising instructions; and one or more hardware processors in communication with the memory storage, wherein the one or more hardware processors execute the instructions to: downsample a reconstructed luma block to obtain a downsampled luma block, wherein the reconstructed luma block corresponds to a chroma block; generate parameters of a linear model (LM); and generate predicted chroma values of the chroma block based on the parameters and the downsampled luma block.
  • LM linear model
  • a first feature combinable with any of the following features, where the one or more hardware processors execute the instructions to: obtain a first set of reconstructed neighboring luma downsampled samples, where the first set of reconstructed neighboring luma downsampled samples correspond to a row of luma samples above the reconstructed luma block; obtain a first set of reconstructed neighboring chrome samples, where the first set of reconstructed neighboring chrome samples correspond to a row of chrome samples above the chrome block; and derive, based on the first set of reconstructed neighboring luma downsampled samples and the first set of reconstructed neighboring chrome samples, the parameters of the LM.
  • a second feature, combinable with any of the previous or following features, where the one or more hardware processors execute the instructions to: obtain a second set of reconstructed neighboring luma downsampled samples, where the second set of reconstructed neighboring luma downsampled samples correspond to N column of luma samples at left of the reconstructed luma block, N is an positive integer, and 0 ⁇ N ⁇ 3; obtain a second set of reconstructed neighboring chrome samples, where the second set of reconstructed neighboring chrome samples correspond to a column of chrome samples at left of the chrome block; and derive, based on the second set of reconstructed neighboring luma downsampled samples and the second set of reconstructed neighboring chrome samples, the parameters of the LM.
  • LM includes one or more of followings: a cross-component linear model (CCLM) mode, a multi-directional linear model (MDLM) mode, and a multiple model linear model (MMLM) mode.
  • CCLM cross-component linear model
  • MDLM multi-directional linear model
  • MMLM multiple model linear model
  • a sixth feature combinable with any of the previous features, where the one or more hardware processors execute the instructions to encode or decode a video image using the predicted chroma values.
  • Computer-readable media may include computer-readable storage media, which corresponds to a tangible medium such as data storage media, or communication media including any medium that facilitates transfer of a computer program from one place to another, e.g., according to a communication protocol.
  • Computer-readable media generally may correspond to (1) tangible computer- readable storage media which is non-transitory or (2) a communication medium such as a signal or carrier wave.
  • Data storage media may be any available media that can be accessed by one or more computers or one or more processors to retrieve instructions, code and/or data structures for implementation of the techniques described in this disclosure.
  • a computer program product may include a computer-readable medium.
  • such computer-readable storage media can comprise RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage, or other magnetic storage devices, flash memory, or any other medium that can be used to store desired program code in the form of instructions or data structures and that can be accessed by a computer. Also, any connection is properly termed a computer-readable medium.
  • coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave are included in the definition of medium.
  • DSL digital subscriber line
  • computer-readable storage media and data storage media do not include connections, carrier waves, signals, or other transitory media, but are instead directed to non-transitory, tangible storage media.
  • Disk and disc includes compact disc (CD), laser disc, optical disc, digital versatile disc (DVD), floppy disk and Blu-ray disc, where disks usually reproduce data magnetically, while discs reproduce data optically with lasers. Combinations of the above should also be included within the scope of computer-readable media.
  • processors such as one or more digital signal processors (DSPs), general purpose microprocessors, application specific integrated circuits (ASICs), field programmable logic arrays (FPGAs), or other equivalent integrated or discrete logic circuitry.
  • DSPs digital signal processors
  • ASICs application specific integrated circuits
  • FPGAs field programmable logic arrays
  • the term“processor,” as used herein may refer to any of the foregoing structure or any other structure suitable for implementation of the techniques described herein.
  • the functionality described herein may be provided within dedicated hardware and/or software modules configured for encoding and decoding, or incorporated in a combined codec. Also, the techniques could be fully implemented in one or more circuits or logic elements.
  • the techniques of this disclosure may be implemented in a wide variety of devices or apparatuses, including a wireless handset, an integrated circuit (IC) or a set of ICs (e.g., a chip set).
  • IC integrated circuit
  • a set of ICs e.g., a chip set.
  • Various components, modules, or units are described in this disclosure to emphasize functional aspects of devices configured to perform the disclosed techniques, but do not necessarily require realization by different hardware units. Rather, as described above, various units may be combined in a codec hardware unit or provided by a collection of inter operative hardware units, including one or more processors as described above, in conjunction with suitable software and/or firmware.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

Selon un exemple, l'invention concerne un procédé de prédiction inter-composantes de données vidéo qui comprend : le sous-échantillonnage, par au moins un processeur matériel, d'un bloc de luminance reconstruit pour obtenir un bloc de luminance sous-échantillonné, le bloc de luminance reconstruit correspondant à un bloc de chrominance ; la génération, par le ou les processeurs matériels, de paramètres d'un modèle linéaire (LM) ; et la génération, par le ou les processeurs matériels, de valeurs de chrominance prédites du bloc de chrominance sur la base des paramètres et du bloc de luminance sous-échantillonné.
PCT/US2019/047257 2018-08-21 2019-08-20 Procédé et dispositif de prédiction intra WO2020041306A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201862720134P 2018-08-21 2018-08-21
US62/720,134 2018-08-21

Publications (1)

Publication Number Publication Date
WO2020041306A1 true WO2020041306A1 (fr) 2020-02-27

Family

ID=69591100

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2019/047257 WO2020041306A1 (fr) 2018-08-21 2019-08-20 Procédé et dispositif de prédiction intra

Country Status (1)

Country Link
WO (1) WO2020041306A1 (fr)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20210314575A1 (en) * 2020-04-07 2021-10-07 Tencent America LLC Method and apparatus for video coding
CN115834897A (zh) * 2023-01-28 2023-03-21 深圳传音控股股份有限公司 处理方法、处理设备及存储介质
WO2023116704A1 (fr) * 2021-12-21 2023-06-29 Mediatek Inc. Prédiction de modèle linéaire trans-composante multi-modèle

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160277762A1 (en) * 2015-03-20 2016-09-22 Qualcomm Incorporated Downsampling process for linear model prediction mode
US20170244975A1 (en) * 2014-10-28 2017-08-24 Mediatek Singapore Pte. Ltd. Method of Guided Cross-Component Prediction for Video Coding

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170244975A1 (en) * 2014-10-28 2017-08-24 Mediatek Singapore Pte. Ltd. Method of Guided Cross-Component Prediction for Video Coding
US20160277762A1 (en) * 2015-03-20 2016-09-22 Qualcomm Incorporated Downsampling process for linear model prediction mode

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20210314575A1 (en) * 2020-04-07 2021-10-07 Tencent America LLC Method and apparatus for video coding
WO2021207026A1 (fr) 2020-04-07 2021-10-14 Tencent America LLC Procédé et appareil de vidéocodage
CN114503570A (zh) * 2020-04-07 2022-05-13 腾讯美国有限责任公司 视频编解码的方法和装置
EP3991424A4 (fr) * 2020-04-07 2022-08-17 Tencent America LLC Procédé et appareil de vidéocodage
JP2022552381A (ja) * 2020-04-07 2022-12-15 テンセント・アメリカ・エルエルシー ビデオ復号の方法、装置、およびコンピュータプログラム
US11575909B2 (en) * 2020-04-07 2023-02-07 Tencent America LLC Method and apparatus for video coding
JP7378608B2 (ja) 2020-04-07 2023-11-13 テンセント・アメリカ・エルエルシー ビデオ復号の方法、装置、およびコンピュータプログラム
WO2023116704A1 (fr) * 2021-12-21 2023-06-29 Mediatek Inc. Prédiction de modèle linéaire trans-composante multi-modèle
CN115834897A (zh) * 2023-01-28 2023-03-21 深圳传音控股股份有限公司 处理方法、处理设备及存储介质

Similar Documents

Publication Publication Date Title
AU2019353560B2 (en) Intra prediction method and device
AU2019303720B2 (en) Video encoder, video decoder, and corresponding encoding and decoding methods
US20210227229A1 (en) Intra prediction method and device
US20190089952A1 (en) Bidirectional Weighted Intra Prediction
US11659175B2 (en) Coding method, device, system with merge mode
WO2020041306A1 (fr) Procédé et dispositif de prédiction intra
KR20220024877A (ko) 이중 예측 옵티컬 플로 계산 및 이중 예측 보정에서 블록 레벨 경계 샘플 그레이디언트 계산을 위한 정수 그리드 참조 샘플의 위치를 계산하는 방법
KR102438149B1 (ko) 비디오 코딩을 위한 위치 종속 공간 가변 변환
WO2020182196A1 (fr) Procédé, dispositif, et système de codage avec liste de mpm partagée
KR20210024092A (ko) 비디오 코딩에서의 경계 블록 파티셔닝
WO2019072210A1 (fr) Restriction sur la déduction de taille de sous-bloc pour inter-prédiction affine
CA3115177C (fr) Procede et dispositif d'intra-prediction
US20210274198A1 (en) Intra prediction method and device

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: 19852173

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19852173

Country of ref document: EP

Kind code of ref document: A1