Systems and methods for video encoding

US2026012654A1 · US · A1

Patent metadata
FieldValue
Publication numberUS-2026012654-A1
Application numberUS-202519329550-A
CountryUS
Kind codeA1
Filing dateSep 15, 2025
Priority dateDec 6, 2020
Publication dateJan 8, 2026
Grant date

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

The present disclosure relates to systems and methods for video encoding. The systems may determine a current string in a coding unit (CU) of an image frame. The current string may include one or more pixels. The systems may determine, based on a first pixel in the current string, a reference matching pixel of the first pixel by searching a searching area. The searching area may include a plurality of matching pixels The systems may determine, based on the reference matching pixel and matching patterns, a count of matching pixels in each of a plurality of groups, corresponding to the matching patterns, of the current string. The systems may further determine, based on counts of matching pixels in the plurality of groups corresponding to the matching patterns, a target prediction of the current string.

First claim

Opening claim text (preview).

What is claimed is: 1 . A video decoding method based on strings, comprising: obtaining a bitstream, parsing syntactic elements from the bitstream, the syntactic elements including a prediction pattern for a current to-be-decoded block; and in response to determining that the prediction pattern for the current to-be-decoded block is a string prediction (SP) pattern, performing a following process: for a to-be-decoded string, obtaining a string vector (SV) and a flip pattern of the to-be-decoded string from the syntactic elements; determining a matching string of the to-be-decoded string based on the SV; obtaining a flipped matching string by flipping the matching string according to the flip pattern; and obtaining a decoded string by decoding the to-be-decoded string based on the flipped matching string. 2 . The method of claim 1 , further comprising: in response to determining that syntactic elements corresponding to the to-be-decoded string include a flag indicating to perform string prediction refinement (SPR), smoothing intra-string pixels and/or string boundaries of the decoded string corresponding to the to-be-decoded string. 3 . The method of claim 1 , wherein the flip pattern is a symmetric flip pattern, and the obtaining a flipped matching string by flipping the matching string according to the flip pattern includes: selecting at least one pixel in the matching string of the to-be-decoded string as a flip axis; flipping one or more pixels in the matching string located at a first side of the flip axis to a second side of the flip axis; and flipping one or more pixels in the matching string located at the second side of the flip axis to the first side of the flip axis. 4 . The method of claim 3 , wherein the to-be-decoded string includes a plurality of pixel rows, the selecting at least one pixel in the matching string of the to-be-decoded string as a flip axis includes: selecting one pixel in each pixel row as a flip axis for the each pixel row. 5 . The method of claim 1 , wherein the flip pattern is a multi-axis flip pattern, and the obtaining a flipped matching string by flipping the matching string according to the flip pattern includes: selecting a plurality of discontinuous pixels in the matching string in a same pixel row of the to-be-decoded string as flip axes; flipping a part of pixels between two adjacent flip axes according to one of the two adjacent flip axes close the part of pixels; and flipping the other part of pixels between the two adjacent flip axes according to the other of the two adjacent flip axes. 6 . The method of claim 1 , wherein the flip pattern is a complete flip pattern, and the obtaining a flipped matching string by flipping the matching string according to the flip pattern includes: completely reversing orders of pixels in the matching string of the to-be-decoded string. 7 . The method of claim 1 , wherein in response to determining that the to-be-decoded string is at a coding unit (CU) level, the method further comprises: parsing a horizontal component and a vertical component of the SV of the to-be-decoded string from the bitstream; determining whether the vertical component of the SV of the to-be-decoded string is less than 1 and the horizontal component of the SV of the to-be-decoded string is equal to 0; in response to determining that the vertical component of the SV of the to-be-decoded string is not less than 1 and/or the horizontal component of the SV of the to-be-decoded string is not equal to 0, determining whether the vertical component of the SV of the to-be-decoded string is non-zero; and in response to determining that the vertical component of the SV of the to-be-decoded string is 0, parsing a difference between an absolute value of the horizontal component of the SV of the to-be-decoded string from the bitstream and a second parameter offset, wherein: in response to that a length of the to-be-decoded string is less than a width of the CU corresponding to the to-be-decoded string, determining that the second parameter offset is equal to the length of the to-be-decoded string, and in response to that the length of the to-be-decoded string is greater than or equal to the width of the CU corresponding to the to-be-decoded string, determining that the second parameter offset is equal to a first parameter offset plus 1, the first parameter offset being less than or equal to the absolute value of the horizontal component of the SV of the to-be-decoded string and the width of the CU. 8 . The method of claim 1 , wherein in response to determining that the to-be-decoded string is at an ordinary level, the method further comprises: parsing a horizontal component and a vertical component of the SV of the to-be-decoded string from the bitstream; determining whether the vertical component of the SV of the to-be-decoded string is less than 1 and the horizontal component of the SV of the to-be-decoded string is equal to 0; in response to determining that the vertical component of the SV of the to-be-decoded string is not less than 1 and/or the horizontal component of the SV of the to-be-decoded string is not equal to 0, determining whether the vertical component of the SV of the to-be-decoded string is non-zero; and in response to determining that the vertical component of the SV of the to-be-decoded string is 0, determining whether an index of a pixel row where a starting position of the to-be-decoded string is located is an odd number; and in response to determining that the index of the pixel row where the starting position of the to-be-decoded string is located is not an odd number, parsing a difference between an absolute value of the horizontal component of the SV of the to-be-decoded string from the bitstream and a second parameter offset, wherein: in response to that a length of the to-be-decoded string is less than a width of a coding unit (CU) corresponding to the to-be-decoded string, determining that the second parameter offset is equal to the length of the to-be-decoded string, and in response to that the length of the to-be-decoded string is greater than or equal to the width of the CU corresponding to the to-be-decoded string, determining that the second parameter offset is equal to a first parameter offset plus 1, the first parameter offset being less than or equal to the absolute value of the horizontal component of the SV of the corresponding to the to-be-decoded string and the width of the CU. 9 . The method of claim 1 , wherein the to-be-decoded string is a cross-line string that includes at least two pixel rows, the syntactic elements do not include a syntactic element corresponding to a unit basis vector of the to-be-decoded string. 10 . A video decoding system based on strings, comprising: at least one storage device including a set of instructions; and at least one processor in communication with the at least one storage device, wherein when executing the set of instructions, the at least one processor is configured to perform operations including: obtaining a bitstream, parsing syntactic elements from the bitstream, the syntactic elements including a prediction pattern for a current to-be-decoded block; and in response to determining that the prediction pattern for the current to-be-decoded block is a string prediction (SP) pattern, performing a following process: for a to-be-decoded string, obtaining a string vector (SV) and a flip pattern of the to-be-decoded string from the syntactic elements; determining a matching string of the to-be-decoded string based on the SV; obtaining a flipped matching string by flipping the matching string according to the flip pattern; and obtaining a

Assignees

Inventors

Classifications

  • H04N19/176Primary

    the region being a block, e.g. a macroblock · CPC title

  • Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction · CPC title

  • characterised by the adaptation method, adaptation tool or adaptation type used for the adaptive coding · CPC title

  • Decoders specially adapted therefor, e.g. video decoders which are asymmetric with respect to the encoder · CPC title

  • involving spatial prediction techniques · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US2026012654A1 cover?
The present disclosure relates to systems and methods for video encoding. The systems may determine a current string in a coding unit (CU) of an image frame. The current string may include one or more pixels. The systems may determine, based on a first pixel in the current string, a reference matching pixel of the first pixel by searching a searching area. The searching area may include a plura…
Who is the assignee on this patent?
Zhejiang Dahua Technology Co
What technology area does this patent fall under?
Primary CPC classification H04N19/176. Mapped technology areas include Electricity.
When was this patent published?
Publication date Thu Jan 08 2026 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).