# US 2024/0205394 A1 · Method, device, and medium for video processing > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2024/0205394 A1 - Document ID: US20240205394A1 - Status: Published application - Kind: A1 - Application number: 18/288,015 - Filed: 2022-04-21 - Published: 2024-06-20 - Earliest claimed: 2021-04-23 - Assignees: Bytedance Inc. - Applicants: Bytedance Inc. - Inventors: Kai ZHANG; Li ZHANG - Web page: https://patentgrep.com/patent/US20240205394A1 ## CPC - H04N 19/117: Filters, e.g. for pre-processing or post-processing (sub-band filter banks H04N19/635) - H04N 19/46: Embedding additional information in the video signal during the compression process (H04N19/517, H04N19/68, H04N19/70 take precedence) - H04N 19/159: Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction - H04N 19/82: involving filtering within a prediction loop - H04N 19/86: involving reduction of coding artifacts, e.g. of blockiness - H04N 19/88: involving rearrangement of data among different coding units, e.g. shuffling, interleaving, scrambling or permutation of pixel data or permutation of transform coefficient data among different blocks - H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION ## Abstract Embodiments of the present disclosure provide a solution for video processing. A method for video processing is proposed. The method comprises: reordering a plurality of samples in a region of a video during a conversion between the region and a bitstream of the video; and performing the conversion based on the reordered plurality of samples. Compared with the conventional solution, the proposed method can advantageously improve the coding efficiency. ## Claims ### Claim at position 1 1-51. (canceled) ### Claim 52 A method of video processing, comprising: reordering a plurality of samples in a region of a video during a conversion between the region and a bitstream of the video; and performing the conversion based on the reordered plurality of samples. ### Claim 53 (depends on 52) The method of claim 52, wherein the plurality of samples comprise at least one type of samples, the at least one type of samples comprising: a plurality of original samples before encoding, a plurality of prediction samples, a plurality of reconstruction samples, a plurality of transformed samples, a plurality of samples before inverse-transform, a plurality of samples before deblocking filtering, a plurality of samples after deblocking filtering, a plurality of samples before sample adaptive offset (SAO) processing, a plurality of samples after SAO processing, a plurality of samples before adaptive loop-filter (ALF) processing, a plurality of samples after ALF processing, a plurality of samples before post processing, and/or a plurality of samples after post processing. ### Claim 54 (depends on 52) The method of claim 52, wherein the plurality of samples are reordered at more than one stage; or wherein the plurality of samples comprises at least two types of samples, and the at least two types of samples are reordered in different reordering schemes, or are reordered in the same reordering scheme. ### Claim 55 (depends on 52) The method of claim 52, wherein at least one respective reordered position of at least one sample of the plurality of samples is different from at least one respective original position of the at least one sample of the plurality of samples. ### Claim 56 (depends on 52) The method of claim 52, wherein at least one respective reordered position of at least one sample of the plurality of samples is the same as at least one respective original position of at least one sample of the plurality of samples. ### Claim 57 (depends on 52) The method of claim 52, wherein the plurality of samples are reordering in at least one reordering scheme, the at least one reordering scheme comprising a horizontal flip, a vertical flip, a horizontal-vertical flip, a shift and/or a rotation. ### Claim 58 (depends on 52) The method of claim 52, wherein at least one sample of the plurality of samples is processed by at least one auxiliary procedure before and/or after the reordering. ### Claim 59 (depends on 58) The method of claim 58, wherein the at least one auxiliary procedure comprises at least one of: adding at least one offset to the at least one sample, multiplying the at least one sample by at least one factor, clipping the at least one sample, filtering the at least one sample, or modifying the at least one sample based on T(X), wherein X represents a sample of the at least one sample and T represents a function. ### Claim 60 (depends on 52) The method of claim 52, wherein at least one of a first indication of whether to apply the reordering or a second indication of a reordering scheme for the reordering is included in the bitstream. ### Claim 61 (depends on 60) The method of claim 60, wherein the first indication or the second indication is coded with context coding. ### Claim 62 (depends on 60) The method of claim 60, wherein the at least one of the first and second indications is derived from coding information associated with the region. ### Claim 63 (depends on 62) The method of claim 62, wherein the coding information comprises at least one of: dimensions of the region, at least one coding mode of the region, at least one motion information associated with the region, at least one intra-prediction mode associated with the region, at least one inter-prediction mode associated with the region, at least one quantization parameter (QP) associated with the region, coding tree splitting information associated with the region, or at least one color format and/or color component associated with the region. ### Claim 64 (depends on 60) The method of claim 60, wherein at least one of a parsing scheme or a decoding scheme for the region depends on: whether the reordering is applied, and/or the reordering scheme for the reordering. ### Claim 65 (depends on 64) The method of claim 64, wherein the bitstream further includes a third indication whether the reordering is applied. ### Claim 66 (depends on 64) The method of claim 64, wherein the at least one of the parsing scheme or the decoding scheme comprises a scanning order and/or a filtering scheme. ### Claim 67 (depends on 60) The method of claim 60, wherein the region comprises a block coded with an Intra-Block Copy (IBC) mode, and the bitstream further comprises: a fourth indication whether the plurality of samples comprise a plurality of reconstruction samples, and/or a fifth indication of at least one reordering scheme for reconstruction samples. ### Claim 68 (depends on 67) The method of claim 67, wherein the fourth indication or the fifth indication is coded with context coding. ### Claim 69 (depends on 68) The method of claim 68, wherein the fifth indication is included in the bitstream if the plurality of samples comprise the plurality of reconstruction samples. ### Claim 70 An apparatus for processing video data comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to: reorder a plurality of samples in a region of a video during a conversion between the region and a bitstream of the video; and perform the conversion based on the reordered plurality of samples. ### Claim 71 A non-transitory computer-readable storage medium storing instructions that cause a processor to: reorder a plurality of samples in a region of a video during a conversion between the region and a bitstream of the video; and perform the conversion based on the reordered plurality of samples.