CN114449278A - Arbitrary ratio down-sampling transcoding method and device based on information reuse - Google Patents

Arbitrary ratio down-sampling transcoding method and device based on information reuse Download PDF

Info

Publication number
CN114449278A
CN114449278A CN202011230711.XA CN202011230711A CN114449278A CN 114449278 A CN114449278 A CN 114449278A CN 202011230711 A CN202011230711 A CN 202011230711A CN 114449278 A CN114449278 A CN 114449278A
Authority
CN
China
Prior art keywords
depth
information
mode
frame type
prediction
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.)
Granted
Application number
CN202011230711.XA
Other languages
Chinese (zh)
Other versions
CN114449278B (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.)
Peking University
Original Assignee
Peking University
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 Peking University filed Critical Peking University
Priority to CN202011230711.XA priority Critical patent/CN114449278B/en
Publication of CN114449278A publication Critical patent/CN114449278A/en
Application granted granted Critical
Publication of CN114449278B publication Critical patent/CN114449278B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/56—Motion estimation with initialisation of the vector search, e.g. estimating a good candidate to initiate a search
    • 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/132—Sampling, masking or truncation of coding units, e.g. adaptive resampling, frame skipping, frame interpolation or high-frequency transform coefficient masking
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/567—Motion estimation based on rate distortion criteria
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/577—Motion compensation with bidirectional frame interpolation, i.e. using B-pictures

Landscapes

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

Abstract

The invention discloses an arbitrary ratio down-sampling transcoding method and device based on information reuse. In the process of decoding a video, frame type information, CU depth information and CU mode information are stored; in the recoding process, reusing the stored frame type information, directly assigning the stored frame type information to the recoded video, and skipping the decision process of the frame type; in the re-encoding process, reusing the stored CU depth information, calculating the CU prediction depth by using the CU depth information, and determining whether to divide the current CU according to the CU prediction depth; and in the re-encoding process, using the saved CU mode information to perform Skip mode quick decision. The invention accelerates the reprogramming process by utilizing the mapping relation between the depth information and the mode information of the coding blocks, supports down-sampling transcoding with any ratio, and can obtain better acceleration effect under the condition of acceptable quality loss.

Description

Arbitrary ratio down-sampling transcoding method and device based on information reuse
Technical Field
The invention relates to the field of Video Coding and decoding, and aims to improve the reprogramming process of down-sampling transcoding in a High Efficiency Video Coding (HEVC) Video Coding standard, and accelerate the current resolution Video Coding by utilizing the depth information and the mode information of a Coding block coded by the original resolution. The invention not only supports down-sampling transcoding with any ratio, but also more effectively improves the speed of video recoding.
Background
Downsampling transcoding is widely applied in situations where the video transmission bandwidth is limited. With the continuous popularization of smart phones, more videos need to be uploaded or shared through the mobile phones, and the bandwidth and the computing resources of the mobile phones are very limited. On the other hand, HEVC is a currently mainstream video coding standard, and has the characteristics of high compression efficiency and high computational complexity. Therefore, how to accelerate the video encoding speed is very critical.
In the down-sampling transcoding process, the video needs to go through a decoding and re-encoding process. Since the decoding information and the re-encoding process are for the same video content, much of the information is similar, the re-encoding process can speed up the encoding of the video by utilizing the information generated during the decoding process. The whole down-sampling transcoding basic flow is shown in fig. 1. The specific method comprises the following steps:
decoding an original code stream, and storing some coding information of a coded original video in a decoding process, for example: information related to a frame structure, depth information of a Coding Unit (CU), mode information of a Coding Unit, motion vector information, and the like.
And secondly, re-encoding the decoded video, wherein in the process of re-encoding the video, because the front and back encoded videos are different only in resolution, and the time domain and space domain information of the videos are not changed basically, the decision process of encoding, especially the search process of Rate Distortion Optimization (RDO), can be accelerated by utilizing the stored decoding information. Some unnecessary searching processes are skipped to achieve the purpose of speed-up.
Some of the current downsampling transcoding methods mainly have the following problems. Some methods, although capable of achieving good acceleration effects, can only be used when the down-sampling ratio is an integer power of 2 because of the limitations of the algorithm. Other methods, while capable of down-sampling at any rate, do not speed up significantly enough or suffer from a large loss of quality.
Disclosure of Invention
The invention optimizes the re-encoding process of the transcoding process, solves the problem of CU alignment of down-sampling transcoding at any ratio by using a depth and mode information mapping mode, accelerates the video encoding process by using a more effective decision algorithm, and controls the quality loss within a reasonable range.
The technical scheme adopted by the invention is as follows:
an arbitrary ratio down-sampling transcoding method based on information reuse comprises the following steps:
in the process of decoding the video, storing frame type information, CU depth information and CU mode information;
in the recoding process, reusing the stored frame type information, directly assigning the stored frame type information to the recoded video, and skipping the decision process of the frame type;
in the re-encoding process, reusing the stored CU depth information, calculating the CU prediction depth by using the CU depth information, and determining whether to divide the current CU according to the CU prediction depth;
and in the re-encoding process, using the saved CU mode information to perform Skip mode quick decision.
Further, the frame type information, the CU depth information, and the CU mode information are stored in an encoding block with a basic storage unit of 8 × 8 size.
Further, the calculating the CU prediction depth using the CU depth information includes:
mapping the original CU depth information to obtain a matrix for storing the depth information, and then taking a depth mean value d of the overlapped part of the current CU block and the original blockavgNamely, the following formula is used:
Figure BDA0002765104170000021
where X denotes an overlapped block, X denotes an overlapped area, dxDenotes CU depth of an overlapped block, N denotes the number of overlapped blocks located in an overlapped region;
then use the followingDetermine the CU prediction depth by the formula, where rwAnd rhDownsampling ratios representing width and depth, respectively:
Dpred＝davg+0.5·log2(rw·rh)；
and finally, rounding the prediction depth of the CU:
Figure BDA0002765104170000022
further, the deciding whether to partition the current CU according to the CU prediction depth includes:
counting the maximum division depth, the minimum division depth and the average division depth in the corresponding region, wherein the average division depth is a D value;
if the difference value between the maximum division depth and the minimum division depth is too large, determining the depth range of CU division search according to the average division depth; otherwise, determining the depth range of CU partition search according to the average partition depth;
partition searches that are not within the depth range are skipped directly.
Further, the performing Skip mode fast decision by using the saved CU mode information includes: skipping search calculation of other inter-frame prediction modes if the mode of the current CU block is determined to be the Skip mode; and if not, continuously traversing other inter-frame prediction modes, and adopting rate distortion optimization to decide the most appropriate mode.
Further, the mode of the current CU block is determined to be a Skip mode, and the determination method is as follows: and converting the inter-frame prediction mode information into a mode matrix, mapping the current CU block into the mode matrix according to a sampling ratio, then calculating the area ratio occupied by the Skip mode in the matrix as the weight of the Skip mode, and judging that the mode of the current CU block is the Skip mode when the weight of the Skip mode is greater than a given threshold value.
Based on the same inventive concept, the invention also provides an arbitrary ratio down-sampling transcoding device based on information reuse, which adopts the method and comprises the following steps:
the information storage module is used for storing the frame type information, the CU depth information and the CU mode information in the process of decoding the video;
the information reusing module is used for reusing the stored frame type information in the recoding process, directly assigning the stored frame type information to the recoded video and skipping the decision process of the frame type; in addition, the stored CU depth information is reused in the re-encoding process, the CU prediction depth is calculated by utilizing the CU depth information, and whether the current CU is divided or not is determined according to the CU prediction depth; and, during the re-encoding process, the stored CU mode information is used for fast Skip mode decision.
The invention has the following beneficial effects:
compared with other methods based on down-sampling transcoding, the invention accelerates the reprogramming process by utilizing the mapping relation between the coding block depth information and the mode information (the coding block depth information and the mode information of the original code stream are mapped into the coding block depth information and the mode information after down-sampling according to a certain rule). Compared with other downsampling transcoding methods, the method disclosed by the invention not only supports downsampling transcoding at any ratio, but also can obtain a better acceleration effect under the condition of acceptable quality loss.
Drawings
Fig. 1 is a downsampling transcoding flow diagram.
Fig. 2 is a schematic diagram of a CU depth prediction process. Including Depth mapping (Depth mapping) and Depth prediction (Depth prediction).
Detailed Description
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, the present invention shall be described in further detail with reference to the following detailed description and accompanying drawings.
The invention is optimized from the following two aspects:
1. considering that the characteristics of the video content are not changed before and after, the frame structure of the original video can be directly reused to accelerate the video coding, and meanwhile, in order to ensure that other modules (such as code rate control) are not influenced when the frame structure is reused, the invention reuses the original frame type information, and the part is also the basis of the subsequent CU depth information reuse and Skip mode quick decision.
2. The recursive process of CU depth decision is pruned by using the original CU depth information, thereby speeding up the depth decision process. On the other hand, the Skip mode is the simplest mode of the inter-prediction modes, and if the prediction mode can be quickly judged to be the Skip mode, traversal calculation can be skipped for other modes, so that the encoding time is reduced.
For the transcoding process in fig. 1, the method of the present invention is mainly divided into the following steps:
in the decoding process, frame types, CU depth information and CU mode information are stored. Meanwhile, the basic storage unit of the present invention is an encoding block of 8 × 8 size, considering the storage space and the calculation amount of information reuse at the time of re-encoding.
Reuse of frame type information. Before the Coding Tree Unit (CTU) division and rate distortion optimization, a preceding frame list exists, which temporarily stores a plurality of video frames to be coded, down-samples all the video frames at a 2:1 ratio, divides the down-sampled video in a fixed-size block manner of 8x8 (corresponding to 16x16 of the original video), and performs rate distortion analysis to obtain an RD-cost (rate distortion cost) of each block. x265 in the pre-analysis process, advanced coding tools of various coding ends are realized, and scene switching, adaptive frame structures and the like are mainly realized. In these coding tools, scene switching requires calculation of reference costs of all directly adjacent frames, and the adaptive frame structure algorithm requires calculation of reference costs of each frame and each of the first 1 to maxfbrames +1 frames (where maxfbrames is the maximum bidirectional prediction frame number), which are parts that require consumption of a large amount of computational resources. Due to the homogeneity of the content, scenes among videos with the same source and different resolutions, objects and the motion of the objects are basically consistent, and therefore the optimal frame structures of the videos with the different resolutions and scene switching detection results are basically consistent. The multiplexed video can directly use the entire frame structure of the analysis path video, thereby avoiding a repeated frame structure analysis process. Meanwhile, the same frame structure can bring convenience to the multiplexing of subsequent rate distortion information. When in reprogramming, the original frame type information is directly assigned to the reprogramming video, and the decision process of the frame type is skipped.
And reusing the CU depth information. During the re-encoding, the CU prediction depth is calculated in the manner shown in fig. 2.
First, the original CU depth information is mapped, that is, as shown in fig. 1, the original CU depth information is extracted, and a matrix storing depth information is obtained with 8 × 8 CUs as a basic unit. Then, the depth of the part where the current CU block and the original block have overlap is averaged, which is expressed by the following formula:
Figure BDA0002765104170000041
where X denotes an overlapped block, X denotes an overlapped area, dxDenotes the CU depth of the overlapped block, and N denotes the number of overlapped blocks located in the overlapped region.
After obtaining the mean value, the final predicted CU depth is determined by the following formula, considering that the depth deviation occurs after the resolution change:
Dpred＝davg+0.5·log2(rw·rh)
wherein r iswAnd rhRepresenting the down-sampling ratio of width and depth, respectively. Since the depth information is an integer and must be within 0-3, rounding the predicted depth is performed:
Figure BDA0002765104170000042
after the depth of each basic block is predicted, whether the current CU is divided is determined by the following modes:
1) counting the maximum division depth, the minimum division depth and the average division depth in the corresponding region (each CTU only needs to be counted once to avoid repeated calculation); the maximum and minimum partition depths are the maximum and minimum values of the CU depth of the overlapped block within the overlapped region block. The average division depth is the D value.
2) If the difference between the maximum and minimum partition depths is too large (whether the difference is too large can be judged by setting a threshold), a fast algorithm is not used, namely, the depth range of the CU partition search is not determined according to the average partition depth.
3) Otherwise, determining the depth range of the CU partition search according to the average partition depth.
4) Partition searches that are not within the depth range are skipped directly.
Fast decision of Skip mode. Skip mode refers to a special inter-prediction mode that does not use any information to encode, and can save a great number of bits. The principle is that a predicted motion vector is directly used as the motion vector during decoding, the motion vector is used for motion compensation to obtain a predicted pixel value, and the predicted pixel value is directly used as a true pixel value. Prediction of a Skip mode is similar to CU depth prediction, CU inter-prediction mode information is converted into a mode matrix in a depth matrix (a matrix obtained by mapping original depth information), that is, the inter-prediction mode converts the mode information into a mode information matrix in a manner similar to depth information mapping, then the current CU block is mapped into the mode matrix according to a sampling ratio, then an area ratio occupied by the Skip mode in the matrix is calculated as a weight of the mode, and a final encoding flow is determined by the weight of the Skip mode according to a certain rule. The specific determination method is as follows:
Figure BDA0002765104170000051
wherein, WiI is the number of different modes, X represents the CU block of the overlap region, X represents the overlap region, Y represents the CU block of the mode i of the overlap region, Y represents the weight of each modeiAn overlap region with a pattern i is indicated, and "1" is a count flag. Here only the Skip mode is used for fast decision making. When the weight of the Skip mode is larger than a given threshold value, judging that the mode of the current CU block is the Skip mode, and skipping the search calculation of other inter-frame prediction modes; otherwise, continue traversing otherAnd (4) inter-frame prediction mode, and adopting normal RDO to decide the most appropriate mode.
The process of re-encoding can be accelerated by using the frame type information obtained in the step (c), the CU partition result obtained in the step (c), and the most appropriate inter-frame prediction mode decided in the step (c). The method comprises the following specific steps:
1) skipping the process of judging the frame type of the recoding, and directly adopting the frame type information in the step II;
2) when the CU is divided, dividing according to the mode in the third step;
3) and when the CU mode is decided, rapidly judging whether the Skip mode is used or not according to the mode of the step (iv).
Based on the same inventive concept, another embodiment of the present invention provides an arbitrary ratio down-sampling transcoding apparatus based on information reuse, which uses the above method, and includes:
the information storage module is used for storing the frame type information, the CU depth information and the CU mode information in the process of decoding the video;
the information reusing module is used for reusing the stored frame type information in the recoding process, directly assigning the stored frame type information to the recoded video and skipping the decision process of the frame type; in addition, the stored CU depth information is reused in the re-encoding process, the CU prediction depth is calculated by utilizing the CU depth information, and whether the current CU is divided or not is determined according to the CU prediction depth; and, during the re-encoding process, the stored CU mode information is used for fast Skip mode decision.
Based on the same inventive concept, another embodiment of the present invention provides an electronic device (computer, server, smartphone, etc.) comprising a memory storing a computer program configured to be executed by the processor, and a processor, the computer program comprising instructions for performing the steps of the inventive method.
Based on the same inventive concept, another embodiment of the present invention provides a computer-readable storage medium (e.g., ROM/RAM, magnetic disk, optical disk) storing a computer program, which when executed by a computer, performs the steps of the inventive method.
The foregoing disclosure of the specific embodiments of the present invention and the accompanying drawings is directed to an understanding of the present invention and its implementation, and it will be appreciated by those skilled in the art that various alternatives, modifications, and variations may be made without departing from the spirit and scope of the invention. The present invention should not be limited to the disclosure of the embodiments and drawings in the specification, and the scope of the present invention is defined by the scope of the claims.

Claims (10)

1. An arbitrary ratio down-sampling transcoding method based on information reuse is characterized by comprising the following steps:
in the process of decoding the video, storing frame type information, CU depth information and CU mode information;
in the recoding process, reusing the stored frame type information, directly assigning the stored frame type information to the recoded video, and skipping the decision process of the frame type;
in the re-encoding process, reusing the stored CU depth information, calculating the CU prediction depth by using the CU depth information, and determining whether to divide the current CU according to the CU prediction depth;
and in the re-encoding process, using the saved CU mode information to perform Skip mode quick decision.
2. The method of claim 1, wherein the frame type information, the CU depth information, and the CU mode information are stored in a basic unit of 8x8 size coding blocks.
3. The method of claim 1, wherein the calculating the CU predicted depth using the CU depth information comprises:
mapping the original CU depth information to obtain a matrix for storing the depth information, and overlapping the current CU block and the original blockDepth averaging of parts davgNamely, the following formula is used:
Figure FDA0002765104160000011
where X denotes an overlapped block, X denotes an overlapped area, dxDenotes CU depth of an overlapped block, N denotes the number of overlapped blocks located in an overlapped region;
the CU predicted depth is then determined using the following formula, where rwAnd rhDownsampling ratios representing width and depth, respectively:
Dpred＝davg+0.5·log2(rw·rh)；
and finally, rounding the CU prediction depth: d ═ min (3, [ D ]pred])。
4. The method of claim 3, wherein the deciding whether to partition the current CU according to the CU prediction depth comprises:
counting the maximum division depth, the minimum division depth and the average division depth in the corresponding region, wherein the average division depth is a D value;
if the difference value between the maximum division depth and the minimum division depth is too large, determining the depth range of CU division search according to the average division depth; otherwise, determining the depth range of CU partition search according to the average partition depth;
partition searches that are not within the depth range are skipped directly.
5. The method of claim 1, wherein the using the saved CU mode information for Skip mode fast decision making comprises: skipping search calculation of other inter-frame prediction modes if the mode of the current CU block is determined to be the Skip mode; and if not, continuously traversing other inter-frame prediction modes, and adopting rate distortion optimization to decide the most appropriate mode.
6. The method according to claim 5, wherein the mode of the current CU block is determined to be Skip mode by: and converting the inter-frame prediction mode information into a mode matrix, mapping the current CU block into the mode matrix according to a sampling ratio, then calculating the area ratio occupied by the Skip mode in the matrix as the weight of the Skip mode, and judging that the mode of the current CU block is the Skip mode when the weight of the Skip mode is greater than a given threshold value.
7. The method of claim 6, wherein the weights for different modes are calculated using the following formula:
Figure FDA0002765104160000021
wherein, WiI is the number of different modes, X represents the CU block of the overlap region, X represents the overlap region, Y represents the CU block of the mode i of the overlap region, Y represents the weight of each modeiAn overlap region with a pattern i is indicated.
8. An arbitrary ratio down-sampling transcoding device based on information reuse and adopting the method of any claim 1 to 7, characterized by comprising:
the information storage module is used for storing the frame type information, the CU depth information and the CU mode information in the process of decoding the video;
the information reusing module is used for reusing the stored frame type information in the recoding process, directly assigning the stored frame type information to the recoded video and skipping the decision process of the frame type; in addition, the stored CU depth information is reused in the re-encoding process, the CU prediction depth is calculated by utilizing the CU depth information, and whether the current CU is divided or not is determined according to the CU prediction depth; and, during the re-encoding process, the stored CU mode information is used for fast Skip mode decision.
9. An electronic apparatus, comprising a memory and a processor, the memory storing a computer program configured to be executed by the processor, the computer program comprising instructions for performing the method of any of claims 1 to 7.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program which, when executed by a computer, implements the method of any one of claims 1 to 7.
CN202011230711.XA 2020-11-06 2020-11-06 Method and device for transcoding downsampled at any ratio based on information reuse Active CN114449278B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011230711.XA CN114449278B (en) 2020-11-06 2020-11-06 Method and device for transcoding downsampled at any ratio based on information reuse

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011230711.XA CN114449278B (en) 2020-11-06 2020-11-06 Method and device for transcoding downsampled at any ratio based on information reuse

Publications (2)

Publication Number Publication Date
CN114449278A true CN114449278A (en) 2022-05-06
CN114449278B CN114449278B (en) 2023-07-18

Family

ID=81361849

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011230711.XA Active CN114449278B (en) 2020-11-06 2020-11-06 Method and device for transcoding downsampled at any ratio based on information reuse

Country Status (1)

Country Link
CN (1) CN114449278B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015025237A2 (en) * 2013-07-26 2015-02-26 Riversilica Technologies Pvt Ltd A method and system for transcoding a digital video
CN105430407A (en) * 2015-12-03 2016-03-23 同济大学 Fast inter-frame mode decision methods applied to transcoding from H.264 to HEVC
CN106131573A (en) * 2016-06-27 2016-11-16 中南大学 A kind of HEVC spatial resolution code-transferring method
CN106210721A (en) * 2016-07-05 2016-12-07 中南大学 A kind of HEVC quick code check code-transferring method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2015025237A2 (en) * 2013-07-26 2015-02-26 Riversilica Technologies Pvt Ltd A method and system for transcoding a digital video
CN105430407A (en) * 2015-12-03 2016-03-23 同济大学 Fast inter-frame mode decision methods applied to transcoding from H.264 to HEVC
CN106131573A (en) * 2016-06-27 2016-11-16 中南大学 A kind of HEVC spatial resolution code-transferring method
CN106210721A (en) * 2016-07-05 2016-12-07 中南大学 A kind of HEVC quick code check code-transferring method

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
WEISHENG HU; YAOHUI JIN; WEIQIANG SUN; WEI GUO; JUN SUN; JUN ZHO: "Architecture and Performance of Multicast Optical Network", 《 2007 CONFERENCE ON LASERS AND ELECTRO-OPTICS - PACIFIC RIM》 *
王涛；孙俊: "基于H.264的可伸缩编码技术—视频编码与传输的新趋势", 《中国传媒科技》 *

Also Published As

Publication number Publication date
CN114449278B (en) 2023-07-18

Similar Documents

Publication Publication Date Title
US11528506B2 (en) Intra-prediction using a cross-component linear model in video coding
CN111147867B (en) Multifunctional video coding CU partition rapid decision-making method and storage medium
KR20170059040A (en) Optimal mode decision unit of video encoder and video encoding method using the optimal mode decision
CN110087087A (en) VVC interframe encode unit prediction mode shifts to an earlier date decision and block divides and shifts to an earlier date terminating method
CN104811696B (en) A kind of coding method of video data and device
Shen et al. Ultra fast H. 264/AVC to HEVC transcoder
CN101087417A (en) Picture coding device
US20150208094A1 (en) Apparatus and method for determining dct size based on transform depth
CN115426494B (en) Encoder, decoder and corresponding methods using compressed MV storage
Belghith et al. A new fast motion estimation algorithm using fast mode decision for high-efficiency video coding standard
US20130336398A1 (en) Method and device for intra-prediction
CN109302616A (en) A kind of HEVC Inter Prediction High-speed Algorithm based on RC prediction
EP4262203A1 (en) Method and apparatus for video predictive coding
CN110351552B (en) Fast coding method in video coding
Yang et al. Fast intra encoding decisions for high efficiency video coding standard
CN111355959A (en) Image block division method and device
CN106658024A (en) Fast video coding method
CN114449278B (en) Method and device for transcoding downsampled at any ratio based on information reuse
Li et al. Efficient search and mode prediction algorithms for motion estimation in H. 264/AVC
CN107343199B (en) Rapid adaptive compensation method for sampling points in HEVC (high efficiency video coding)
CN105933718A (en) Coding unit partitioning method and device
EP4262205A1 (en) Video predictive coding method and apparatus
CN113365077B (en) Inter-frame prediction method, encoder, decoder, computer-readable storage medium
CN112565767B (en) Video decoding method, video encoding method and related equipment
CN114827618B (en) Video encoding method, video decoding method and related equipment

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