CN109246430B - Virtual reality 360-degree video fast intra prediction and CU partition advance decision - Google Patents

Virtual reality 360-degree video fast intra prediction and CU partition advance decision Download PDF

Info

Publication number
CN109246430B
CN109246430B CN201811059096.3A CN201811059096A CN109246430B CN 109246430 B CN109246430 B CN 109246430B CN 201811059096 A CN201811059096 A CN 201811059096A CN 109246430 B CN109246430 B CN 109246430B
Authority
CN
China
Prior art keywords
coding
candidate list
bit number
candidate
threshold
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201811059096.3A
Other languages
Chinese (zh)
Other versions
CN109246430A (en
Inventor
张萌萌
刘志
徐才
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
North China University of Technology
Original Assignee
North China University of Technology
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 North China University of Technology filed Critical North China University of Technology
Priority to CN201811059096.3A priority Critical patent/CN109246430B/en
Publication of CN109246430A publication Critical patent/CN109246430A/en
Application granted granted Critical
Publication of CN109246430B publication Critical patent/CN109246430B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/102Methods 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/12Selection from among a plurality of transforms or standards, e.g. selection between discrete cosine transform [DCT] and sub-band transform or selection between H.263 and H.264
    • H04N19/122Selection of transform size, e.g. 8x8 or 2x4x8 DCT; Selection of sub-band transforms of varying structure or type
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134Methods 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/136Incoming video signal characteristics or properties
    • H04N19/137Motion inside a coding unit, e.g. average field, frame or block difference
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/10Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
    • H04N19/134Methods 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/146Data rate or code amount at the encoder output
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/44Decoders specially adapted therefor, e.g. video decoders which are asymmetric with respect to the encoder
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/593Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving spatial prediction techniques

Landscapes

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

Abstract

A method for fast coding of cubic format (CMP) virtual reality 360 degree video content in High Efficiency Video Coding (HEVC), the method comprising reducing prediction modes according to a candidate list of hadamard transforms and making advanced partitioning decisions of Coding Units (CUs) using the number of coding bits as a threshold, wherein the reducing prediction modes according to the result of the candidate list after hadamard transforms perform the following operations: and analyzing a first candidate mode of the candidate list after Hadamard transformation, changing the candidate list according to the size of the prediction unit to obtain a new candidate list, and determining whether to perform a most probable mode process according to the size of the prediction unit. The CU early division decision by using the coding bit number as a threshold value performs the following operations: and carrying out statistical analysis on the CUs with different Quantization Parameters (QPs) and different depths to obtain a CU partition coding bit number threshold value for judging whether the CU partition is ended in advance.

Description

Virtual reality 360-degree video fast intra prediction and CU partition advance decision
Combined research
The application is jointly researched by information institute of northern industry university and Beijing traffic university, and obtains the following fund subsidies: national science fund (No.61103113, No.60903066), talent intensive education and deepening plan project (PHR201008187) of higher school belonging to Beijing city; a natural science fund (BK2011455) in Jiangsu province, a natural science fund (No.4102049) in Beijing City, and a new teacher fund (No.20090009120006) in the department of education; national 973 project (2012CB316400), central college basic research fund (No. 2011JBM214).
Technical Field
The present invention relates to the field of image and video processing, and more particularly to fast intra coding and CU early partitioning decisions for virtual reality 360 degree video CMP formats in High Efficiency Video Coding (HEVC).
Background
In 4 months 2010, two international Video coding standards organizations VCEG and MPEG established Video compression joint group JCT-vc (joint Video coding), which together develop a high efficiency Video coding hevc (high efficiency Video coding) standard, also known as h.265. The main objective of the HEVC standard is to achieve a large increase in coding efficiency with the previous generation standard h.264/AVC, especially for high resolution video sequences. The goal is to reduce the code rate to 50% of the h.264 standard at the same video quality (PSNR).
With the further development of hardware device technology and network communication technology, virtual reality technology becomes a focus again, and virtual reality video is an important part of virtual reality technology, and the research significance thereof is extremely important. In order to efficiently encode higher resolution and virtual reality Video, Joint Video expansion Team (jfet) was jointly established by VCEG and MPEG to jointly study future Video encoding.
The virtual reality video has the characteristics of high resolution, immersion, interactivity and the like, is greatly different from the traditional video, and cannot be directly coded by using the traditional video coding technology due to the 360-degree surrounding characteristic, and the coding scheme provided by the JFET is to map the 360-degree spherical video to a 2D plane and then code the video by using the traditional video coding technology (HEVC). The encoding for virtual reality video is therefore divided into two parts: and mapping the spherical video into a plane video, and encoding the plane video. For this reason, jfet extends 360Lib for video projection conversion on the basis of the test model HM of HEVC.
From the mapping of spherical video to planar video, considering pixel loss and coding efficiency after mapping, jfet studies mapping schemes summarizing erp (equivalent projection), cmp (cube projection), and the like, and optimizations of different mapping schemes in several conferences. The cube mapping projects according to each plane corresponding to the spherical surface, video pixel stretching conditions in the projection process basically do not exist, spherical surface video information is segmented, and projection from the spherical surface to the plane can be completed by splicing 6 projection surfaces.
HEVC is optimized through development over a decade, and high-definition video can be efficiently encoded, but the problem of low encoding efficiency still exists for the huge data volume of virtual reality 360-degree video.
Disclosure of Invention
In the present invention, a method for fast coding of virtual reality 360 degree video in High Efficiency Video Coding (HEVC) is proposed, the method comprising reducing prediction modes according to the result of a candidate list after hadamard transform and making Coding Unit (CU) partitioning decision ahead using the number of coding bits as a threshold.
Wherein the reducing the prediction mode according to the result of the candidate list after hadamard transform performs the following operations:
1) if the current PU size is 8x8 or 4x4, go to step 2; if the current PU size is 64x64, 32x32 or 16x16, jumping to step 7;
2) analyzing the first candidate mode of the candidate list after Hadamard transformation, and jumping to the step 3 if the first candidate mode of the candidate list is an angle mode; if the first candidate mode of the candidate list is not the angle mode, jumping to step 4;
3) and if the absolute value of the difference value of the first two modes is less than or equal to 3, judging as an adjacent mode. Jumping to step 5 if the first two modes are adjacent modes, and jumping to step 6 if the two modes are not adjacent;
4) and only the DC mode and the Planar mode are reserved, the modification of the candidate list is completed, and the MPM process is entered.
5) And (3) reserving a first mode in the candidate list, adding 2 modes respectively on the left and the right of the candidate list, and adding 4 modes in total into the candidate list to finish the modification of the candidate list and enter an MPM process. (ii) a
6) And the candidate list only keeps the first two non-adjacent modes, completes the modification of the candidate list and enters the MPM process.
7) If the first candidate mode of the candidate list is the angle mode, the MPM procedure is entered keeping the candidate list unchanged.
8) If the first candidate mode of the candidate list is not the angle mode, only the DC and Planar modes are retained, and then the RDO is performed directly skipping the MPM process.
The CU early division decision by using the coding bit number as a threshold value performs the following operations: and carrying out statistical analysis on CUs with different Quantization Parameters (QPs) and different depths to obtain a CU partition coding bit number threshold, comparing each depth coding bit number with the CU partition coding bit number threshold obtained by experiments, and judging whether to finish partitioning in advance.
According to another aspect, the present invention proposes a video codec employing the above method or apparatus.
According to another aspect, the invention proposes a computer program product comprising instructions which, when executed by a processor, perform the above-mentioned method.
Drawings
Fig. 1 shows a flow chart of encoding of virtual reality 360-degree video.
Fig. 2 shows a flow diagram of a method according to an embodiment of the invention.
Fig. 2a shows a flow diagram of a method for candidate list mode modification for PUs with depth greater than 2 according to one embodiment of the invention.
1) Analyzing the first candidate mode of the candidate list after Hadamard transformation, and jumping to the step 3 if the first candidate mode of the candidate list is an angle mode; if the first candidate mode of the candidate list is not the angle mode, jumping to step 4;
2) and if the absolute value of the difference value of the first two modes is less than or equal to 3, judging as an adjacent mode. Jumping to step 5 if the first two modes are adjacent modes, and jumping to step 6 if the two modes are not adjacent;
3) and only the DC mode and the Planar mode are reserved, the modification of the candidate list is completed, and the MPM process is entered.
4) And (3) reserving a first mode in the candidate list, adding 2 modes respectively on the left and the right of the candidate list, and adding 4 modes in total into the candidate list to finish the modification of the candidate list and enter an MPM process. (ii) a
5) And the candidate list only keeps the first two non-adjacent modes, completes the modification of the candidate list and enters the MPM process.
Fig. 2b shows a flow diagram of a method for candidate list mode modification for PUs having a depth of 2 or less according to one embodiment of the invention.
1) If the first candidate mode of the candidate list is the angle mode, the MPM procedure is entered keeping the candidate list unchanged.
2) If the first candidate mode of the candidate list is not the angle mode, only the DC and Planar modes are retained, and then the RDO is performed directly skipping the MPM process.
Comparing the bit number of each depth coding with a threshold, and stopping further division when the bit number of the CU is smaller than the threshold; and when the bit number of the CU is larger than the threshold, adding 1 to the depth, and continuously judging the relation between the bit number and the threshold until the deepest CU.
FIG. 3 shows the coding bit number threshold for different QPs and different depths of a CU
Detailed Description
Various aspects are now described with reference to the drawings. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of one or more aspects. It may be evident, however, that such aspect(s) may be practiced without these specific details.
As used in this application, the terms "component," "module," "system," and the like are intended to refer to a computer-related entity, such as but not limited to hardware, firmware, a combination of hardware and software, or software in execution. For example, a component may be, but is not limited to: a process running on a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a computing device and the computing device can be a component. One or more components can reside within a process and/or thread of execution and a component can be localized on one computer and/or distributed between two or more computers. In addition, these components can execute from various computer readable media having various data structures stored thereon. The components may communicate by way of local and/or remote processes such as in accordance with a signal having one or more data packets, e.g., data from one component interacting with another component in a local system, distributed system, and/or across a network such as the internet with other systems by way of the signal.
Fig. 1 shows a flow chart of encoding of virtual reality 360-degree video. Since the virtual reality 360-degree video is a spherical video and cannot be directly encoded by using the existing encoding standard, the spherical video is mapped onto a 2D plane, and then encoded and decoded by using HEVC. And obtaining the spherical video through inverse mapping transformation after decoding is finished.
The global video mapping format in fig. 1 and the overall architecture of the encoder architecture of HEVC are not described in this application. More specifically, the present invention is primarily directed to fast algorithms for virtual reality 360 degree video intra-coding.
Overview of the method
The intra-frame coding in HEVC is used to remove the spatial correlation of each frame of image of a video, and the coding meaning of removing the spatial correlation of each frame of image is more significant for a virtual reality 360-degree video with a huge data volume. When the CMP projection format is used, although no obvious stretching of pixel information is brought, some angle modes can be meaningless during splicing, so that the mode optimization algorithm is used in the method to save the encoding time. In addition, in CU division, the coding bit number is used as a threshold value to carry out rapid division decision, and coding time is further saved.
1. Pattern optimization
Wherein the reducing the prediction mode according to the result of the candidate list after hadamard transform performs the following operations:
1) if the current PU size is 8x8 or 4x4, go to step 2; if the current PU size is 64x64, 32x32 or 16x16, jumping to step 7;
2) analyzing the first candidate mode of the candidate list after Hadamard transformation, and jumping to the step 3 if the first candidate mode of the candidate list is an angle mode; if the first candidate mode of the candidate list is not the angle mode, jumping to step 4;
3) and if the absolute value of the difference value of the first two modes is less than or equal to 3, judging as an adjacent mode. Jumping to step 5 if the first two modes are adjacent modes, and jumping to step 6 if the two modes are not adjacent;
4) only DC and Planar modes are reserved, the candidate list is modified, and an MPM process is started;
5) the first mode of the candidate list is reserved, 2 left modes and 2 right modes of the candidate list are added into the candidate list, 4 modes in total are added into the candidate list, the candidate list is modified, and the MPM process is started;
6) only the first two non-adjacent modes are reserved in the candidate list, the candidate list is modified, and the MPM process is started;
7) if the first candidate mode of the candidate list is the angle mode, keeping the candidate list unchanged and entering the MPM process;
8) if the first candidate mode of the candidate list is not the angle mode, only the DC and Planar modes are retained, and then the RDO is performed directly skipping the MPM process. As shown in fig. 2 b.
2. Coding bit number based quick partitioning of CU
For the cases of QP of 22, 27, 32 and 37, respectively obtaining a CU partition bit number threshold value according to experiments under the conditions that the sizes of CUs are 64x64, 32x32 and 16x16, comparing the bit number of each depth coding with the threshold value, and terminating further partition when the bit number of the CU is smaller than the threshold value; and when the bit number of the CU is larger than the threshold, adding 1 to the depth, and continuously judging the relation between the bit number and the threshold until the deepest CU.
The above-described embodiments of the present invention may all be implemented as HEVC-based encoders. The HEVC-based encoding flow is illustrated in fig. 1. Those skilled in the art will appreciate that the decoder may be implemented as software, hardware, and/or firmware.
When implemented in hardware, the video encoder may be implemented or performed with a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration. Additionally, at least one processor may include one or more modules operable to perform one or more of the steps and/or operations described above.
When the video encoder is implemented in hardware circuitry, such as an ASIC, FPGA, or the like, it may include various circuit blocks configured to perform various functions. Those skilled in the art can design and implement these circuits in various ways to achieve the various functions disclosed herein, depending on various constraints imposed on the overall system.
While the foregoing disclosure discusses illustrative aspects and/or embodiments, it should be noted that many changes and modifications could be made herein without departing from the scope of the described aspects and/or embodiments as defined by the appended claims. Furthermore, although elements of the described aspects and/or embodiments may be described or claimed in the singular, the plural is contemplated unless limitation to the singular is explicitly stated. Additionally, all or a portion of any aspect and/or embodiment may be utilized with all or a portion of any other aspect and/or embodiment, unless stated to the contrary.

Claims (4)

1. A method for fast intra coding of cubic format (CMP) virtual reality 360 degree video content in High Efficiency Video Coding (HEVC), comprising reducing prediction modes according to a hadamard transformed candidate list and making advanced partitioning decisions of Coding Units (CUs) using the number of coding bits as a threshold, wherein the reducing prediction modes according to the hadamard transformed candidate list perform the following operations: analyzing the results of the hadamard-transformed candidate list, if the current Prediction Unit (PU) size is 8x8 or 4x4, the first candidate mode is analyzed: if the candidate patterns are the angle patterns, further analyzing whether the previous two candidate patterns are adjacent, and if so, keeping the first candidate pattern and 4 adjacent patterns thereof; if not, only keeping the first two modes; if not, only the DC and Planar modes are reserved and then the Most Probable Mode (MPM) process is performed;
if the current Prediction Unit (PU) size is 64x64, 32x32, or 16x16, the first candidate pattern is analyzed: if the angle mode is the angle mode, the MPM process is carried out without changing; if not, only the DC and Planar modes are retained, the Rate Distortion Optimization (RDO) is performed directly skipping the MPM process,
wherein, the CU advance partition decision is performed by using the number of coded bits as a threshold, and the following operations are performed: performing statistical analysis on CUs with different quantization parameters and different depths to obtain a CU partition coding bit number threshold, comparing each depth coding bit number with the CU partition coding bit number threshold obtained by experiments, and stopping partitioning if the coding bit number of the CU with the current depth is smaller than the threshold; and if the coding bit number of the CU at the current depth is larger than the threshold value, adding 1 to the depth, and further analyzing the CU bit number until the deepest layer.
2. An apparatus for fast intra coding of cubic format (CMP) virtual reality 360 degree video content in High Efficiency Video Coding (HEVC), comprising reducing prediction modes according to the outcome of a hadamard transformed candidate list and making advanced partitioning decisions of Coding Units (CUs) using the number of coding bits as a threshold, wherein the reducing prediction modes according to the outcome of the hadamard transformed candidate list performs the following operations: analyzing the results of the hadamard-transformed candidate list, if the current Prediction Unit (PU) size is 8x8 or 4x4, the first candidate mode is analyzed: if the candidate patterns are the angle patterns, further analyzing whether the previous two candidate patterns are adjacent, and if so, keeping the first candidate pattern and 4 adjacent patterns thereof; if not, only the first two modes are reserved; if not, only the DC and Planar modes are reserved and then the Most Probable Mode (MPM) process is performed;
if the current Prediction Unit (PU) size is 64x64, 32x32, or 16x16, the first candidate pattern is analyzed: if the angle mode is the angle mode, the mode is not changed, and then the MPM process is carried out; if not, only the DC and Planar modes are retained and then the MPM process is skipped for direct Rate Distortion Optimization (RDO),
wherein, the CU advance partition decision is performed by using the number of coded bits as a threshold, and the following operations are performed: performing statistical analysis on CUs with different quantization parameters and different depths to obtain a CU partition coding bit number threshold, comparing each depth coding bit number with the CU partition coding bit number threshold obtained by experiments, and stopping partitioning if the coding bit number of the CU with the current depth is smaller than the threshold; and if the coding bit number of the CU at the current depth is larger than the threshold value, adding 1 to the depth, and further analyzing the CU bit number until the deepest layer.
3. A video codec comprising the apparatus of claim 2.
4. A video decoder for decoding an encoded video stream generated by performing the method of claim 1 or encoded by the apparatus of claim 2.
CN201811059096.3A 2018-09-06 2018-09-06 Virtual reality 360-degree video fast intra prediction and CU partition advance decision Active CN109246430B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811059096.3A CN109246430B (en) 2018-09-06 2018-09-06 Virtual reality 360-degree video fast intra prediction and CU partition advance decision

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811059096.3A CN109246430B (en) 2018-09-06 2018-09-06 Virtual reality 360-degree video fast intra prediction and CU partition advance decision

Publications (2)

Publication Number Publication Date
CN109246430A CN109246430A (en) 2019-01-18
CN109246430B true CN109246430B (en) 2022-02-01

Family

ID=65067482

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811059096.3A Active CN109246430B (en) 2018-09-06 2018-09-06 Virtual reality 360-degree video fast intra prediction and CU partition advance decision

Country Status (1)

Country Link
CN (1) CN109246430B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110062228B (en) * 2019-03-18 2022-04-05 北方工业大学 WMSE-based 360-degree video fast intra-frame prediction algorithm
CN110868593B (en) * 2019-11-18 2022-01-28 北方工业大学 Video CU fast partitioning based on regional decision tree
CN111277839B (en) * 2020-03-06 2022-03-22 北京工业大学 Self-adaptive QP (quantization parameter) adjustment method for coding cube projection format
CN113596444B (en) * 2021-05-19 2022-07-19 西安邮电大学 360-degree video intra-frame prediction mode decision method

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104639940A (en) * 2015-03-06 2015-05-20 宁波大学 Quick HEVC (High Efficiency Video Coding) inter-frame prediction mode selection method
CN105120292A (en) * 2015-09-09 2015-12-02 厦门大学 Video coding intra-frame prediction method based on image texture features
CN105491385A (en) * 2015-12-02 2016-04-13 同济大学 Quick deciding method for division of HEVC intraframe coding units
CN106131547A (en) * 2016-07-12 2016-11-16 北京大学深圳研究生院 The high-speed decision method of intra prediction mode in Video coding
CN106534860A (en) * 2016-11-21 2017-03-22 天津大学 Screen content coding method based on content analysis

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB201308073D0 (en) * 2013-05-03 2013-06-12 Imagination Tech Ltd Encoding an image

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104639940A (en) * 2015-03-06 2015-05-20 宁波大学 Quick HEVC (High Efficiency Video Coding) inter-frame prediction mode selection method
CN105120292A (en) * 2015-09-09 2015-12-02 厦门大学 Video coding intra-frame prediction method based on image texture features
CN105491385A (en) * 2015-12-02 2016-04-13 同济大学 Quick deciding method for division of HEVC intraframe coding units
CN106131547A (en) * 2016-07-12 2016-11-16 北京大学深圳研究生院 The high-speed decision method of intra prediction mode in Video coding
CN106534860A (en) * 2016-11-21 2017-03-22 天津大学 Screen content coding method based on content analysis

Also Published As

Publication number Publication date
CN109246430A (en) 2019-01-18

Similar Documents

Publication Publication Date Title
JP6931690B2 (en) How to encode content and arithmetic units
CN109246430B (en) Virtual reality 360-degree video fast intra prediction and CU partition advance decision
US10523951B2 (en) Systems and methods for processing a digital image
JP6037341B2 (en) Method for decoding video
US10750169B2 (en) Method and apparatus for intra chroma coding in image and video coding
TWI524780B (en) Multiple sign bit hiding within a transform unit
US10116942B2 (en) Method and apparatus for decoding a video using an intra prediction
US10602186B2 (en) Systems and methods for mask based processing of a block of a digital image
CN109068142B (en) 360-degree video intra-frame prediction rapid decision-making method, device, coder-decoder and medium
WO2015124058A1 (en) Coding and decoding method and device
US11153564B2 (en) Systems and methods for processing a block of a digital image
CN103533355B (en) A kind of HEVC fast encoding method
CN103975599A (en) Method, device, and program for coding and decoding of images
CN108810549B (en) Low-power-consumption-oriented streaming media playing method
CN104883566A (en) Rapid algorithm suitable for intra-frame prediction block size division of HEVC standard
CN105791865B (en) Intra-frame prediction and deblocking filtering method
CN102984524A (en) Video coding and decoding method based on block layer decomposition
CN110971897B (en) Method, apparatus and system for encoding and decoding intra prediction mode of chrominance component
CN109889831B (en) Method, encoder and apparatus for 360 degree video intra mode selection based on CU size
Si et al. A fast mode decision algorithm for intra prediction in high efficiency video coding
CN109889842B (en) Virtual reality video CU partitioning algorithm based on KNN classifier
CN118414826A (en) System and method for video coding using image segmentation
WO2022047129A1 (en) Methods and systems for combined lossless and lossy coding
CN114365498A (en) Inter-frame prediction method, encoder, decoder, and storage medium
CN117014600A (en) Video processing method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant