CONTEXT CODING FOR TRANSFORM JUMP MODE

Abstract

Devices, systems, and methods for coefficient coding in transform-hopping mode are described. An example method for video processing includes determining, for encoding one or more video blocks in a video region of visual media data into a bitstream representation of the visual media data, a maximum allowable dimension up to which a current video block of the one or more video blocks is permitted to be encoded using a transform-hopping mode so that a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation without applying a transform; and including a syntax element indicative of the maximum allowable dimension in the bitstream representation.

Description

CONTEXT CODING FOR TRANSFORM JUMP MODE Cross-reference to related applications In accordance with applicable patent law and / or the rules under the Paris Convention, this application is made in a timely manner to claim priority to International Patent Application No. PCT / CN2019 / 083366, filed on April 19, 2019. For all purposes under the law, the full disclosure of the above-mentioned application is incorporated by reference as part of the disclosure of this application. Field of invention This document relates to technologies, systems, and devices for encoding and decoding video and images. Background of the invention Digital video accounts for the largest use of bandwidth on the internet and other digital communication networks. As the number of connected user devices capable of receiving and displaying video increases, the demand for bandwidth for digital video use is expected to continue growing. Brief Description of the Invention This paper describes devices, systems, and methods related to digital video coding, and specifically to transform-hopping coefficient coding for video coding. The methods described can be applied to both existing video coding standards (e.g., High Efficiency Video Coding (HEVC)) and future video coding standards (e.g., Versatile Video Coding (VVC)). In one example, a method for visual media processing is disclosed. The method includes determining, for encoding one or more video blocks in a video region of visual media data into a bitstream representation of the visual media data, a maximum allowable dimension up to which a current video block of the one or more video blocks is permitted to be encoded using a transform hopping mode so that a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation without applying a transform; and including a syntax element indicative of the maximum allowable dimension in the bitstream representation. In another example, a method for processing visual media is disclosed. The method includes parsing a syntax element of a bitstream representation of visual media data comprising a video region comprising one or more video blocks, wherein the syntax element is indicative of a maximum allowable dimension up to which the current video block of one or more blocks of a video region is permitted to be encoded using a jump mode. QLC7Ln / L7n7 / E / Yli transformed in which a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation without applying a transform; and generating a decoded video region from the bitstream representation by decoding one or more video blocks according to the maximum allowed dimension. In yet another example, a method for processing visual media is disclosed. The method includes determining that a current video block of visual media data is encoded using a transform-hopping mode; and performing, based on this determination, a conversion between the current video block and a bitstream representation of the visual media data, wherein, during the conversion, the current video block is divided into a plurality of coefficient groups and the signaling of an encoded block flag is excluded for at least one of the plurality of coefficient groups in the bitstream representation, wherein, in the transform-hopping mode, a prediction error residue is represented between the current video block and a reference video block in the bitstream representation without applying a transformation. In yet another example, a method for processing visual media is disclosed. The method includes determining that an actual video block of visual media data is encoded using a transform-hopping mode; and performing, based on this determination, a conversion between the actual video block and a bitstream representation of the visual media data, wherein, during the conversion, the actual video block is divided into a plurality of coefficient groups, wherein, in the transform-hopping mode, a residue of a prediction error between the actual video block and a reference video block is represented in the bitstream representation without applying a transformation, and further wherein, during the conversion, a coefficient scan order of the plurality of coefficient groups is determined based, at least in part, on an indication in the bitstream representation. In yet another example, a method for visual media processing is disclosed. The method includes using, to encode a current video block in a video region of visual media data into a bitstream representation of the visual media data, a transform hopping mode in which a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation without applying a transform; and selecting a sign flag context of the current video block according to sign flags of one or more neighboring video blocks in a coefficient group associated with the current video block based on the division of the current video block into a plurality of coefficient groups. In yet another example, a method for visual media processing is disclosed. The method includes analyzing a bitstream representation of visual media data comprising a video region comprising a current video block to identify a sign flag context used in a transform-hopping mode in which a prediction error residue between the current video block and a reference video block is represented in the bitstream representation without applying a transform; and generating the decoded video region from the bitstream representation such that the sign flag context is in accordance with the sign flags of one or more neighboring video blocks in a coefficient group associated with the current video block based on the division of the current video block into a plurality of coefficient groups. In yet another example, a method for visual media processing is disclosed. The method includes determining a current coefficient position associated with a current video block of visual media data when the current video block is divided into a plurality of coefficient positions; deriving, at least on the basis of sign flags of one or more neighboring coefficients, a sign flag context for the current coefficient; and generating, on the basis of the context, a sign flag for the current coefficient, wherein the sign flag of the current coefficient is used in a transform-jump mode in which the current video block is encoded without applying a transform. In yet another example, a method for processing visual media is disclosed. The method includes determining, for encoding one or more video blocks in a video region of visual media data into a bitstream representation of the visual media data, based on the satisfaction of at least one rule that a chroma transform hopping mode is applicable to a current video block, wherein, in the chroma transform hopping mode, a residual of a prediction error between the current video block and a reference video block is represented in the bitstream representation of the visual media data without applying a transformation; and including a syntax element indicative of the chroma transform hopping mode in the bitstream representation. In yet another example, a method for processing visual media is disclosed. The method includes parsing a syntax element of a bitstream representation of visual media data comprising a video region comprising one or more video blocks that satisfies at least one rule associated with applying a chroma transform hopping mode, wherein, in the chroma transform hopping mode, a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation of the visual media data without applying a transformation; and generating a decoded video region from the bitstream representation by decoding the one or more video blocks. In yet another example, a method for processing visual media is disclosed. The method includes making a decision to encode one or more video blocks in a video region of visual media data into a bitstream representation of the visual media data, with respect to a selective application of a transform-hopping mode to the current video block based on a condition; and including a syntax element indicative of the condition in the bitstream representation, wherein, in the transform-hopping mode, a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation of the visual media data without applying a transformation. In yet another example, a method for processing visual media is disclosed. The method includes parsing a syntax element of a bitstream representation of visual media data comprising a video region comprising one or more video blocks, wherein the syntax element is indicative of a condition related to the use of a transform hopping mode in which a prediction error residue between the current video block and a reference video block in the bitstream representation is represented without applying a transform; and generating a decoded video region from the bitstream representation by decoding the one or more video blocks according to the condition. In yet another example, a method for processing visual media is disclosed. The method includes making a decision to encode one or more video blocks in a video region of visual media data into a bitstream representation of the visual media data, with respect to a selective application of the Quantized Residual Block Differential Pulse Code Modulation (QR-BDPCM) technique based on an indication of a transform hopping mode in the bitstream representation, wherein, in the transform hopping mode, a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation of the visual media data without applying a transformation, wherein, in the QR-BDPCM technique, the residue of the prediction error is quantized and encoded by entropy in a horizontal and / or vertical direction;and include, in the bitstream representation, an indication of the selective application of the QR-BDPCM technique. In yet another example, a method for processing visual media is disclosed. The method includes analyzing a syntax element of a bitstream representation of visual media data comprising a video region comprising one or more video blocks, wherein the syntax element is indicative of a selective application of the Quantized Residual Block Differential Pulse Code Modulation (QR-BDPCM) technique based on an indication of a transform hopping mode in the bitstream representation, wherein, in the transform hopping mode, a prediction error residue between the current video block and a reference video block is quantized and encoded;and generating a decoded video region from the bitstream representation without applying a transformation, wherein, in the QR-BDPCM technique, the prediction error residue is quantized and encoded by entropy in a horizontal and / or vertical direction; and generating a decoded video region from the bitstream representation by decoding one or more video blocks according to the maximum allowed dimension. In yet another example, a method for processing visual media is disclosed. The method includes making a decision to encode one or more video blocks in a video region of visual media data into a bitstream representation of the visual media data, with respect to a selective application of a separate or dual tree based on a condition; and including a syntax element indicative of the selective application of the separate or dual tree to the bitstream representation. In yet another example, a method for processing visual media is disclosed. The method includes parsing a syntax element of a bitstream representation of visual media data comprising a video region comprising one or more video blocks, wherein the syntax element is indicative of a selective mapping of a separate or dual tree based on or QLCZLn / LZnZ / E / Yli inferred from a condition; and generate a decoded video region from the bitstream representation by decoding one or more video blocks according to the syntax element. In yet another example, a video encoder or decoding device comprising a processor configured to implement a method described above is disclosed. In another example, a computer-readable program medium is disclosed. The medium stores code that incorporates processor-executable instructions to implement one of the described methods. These and other aspects are also disclosed in this document. Brief description of the drawings Figure 1 shows an example of intrablock copying. Figure 2 shows an example of a block coded in palette mode. Figure 3 shows an example of using a palette predictor to signal palette inputs. Figure 4 shows an example of horizontal and vertical cross-sectional scans. Figure 5 shows an example of palette index encoding. Figure 6 shows an example of multi-type tree splitting modes. Figure 7 shows an example of samples used to derive parameters in a cross-component linear model (CCLM) prediction mode. Figure 8 shows an example architecture for luma mapping with chroma scaling modification. Figures 9A-9E are flowcharts for examples of video processing methods. Figure 10 is a block diagram of an example of a hardware platform for implementing a visual media decoding or visual media encoding technique QLCZLn / LZnZ / E / Yli described in this document. Figure 11 is a block diagram of an example video processing system in where the described techniques can be implemented. Figure 12 is a flowchart of an example method for visual media processing. Figure 13 is a flowchart of an example method for visual media processing. Figure 14 is a flowchart of an example method for visual media processing. Figure 15 is a flowchart of an example method for visual media processing. Figure 16 is a flowchart of an example method for visual media processing. Figure 17 is a flowchart of an example method for visual media processing. Figure 18 is a flowchart of an example method for media processing. visuals. Figure 19 visuals. It is a flowchart of an example method for media processing Figure 20 visuals. It is a flowchart of an example method for media processing Figure 21 visuals. It is a flowchart of an example method for media processing Figure 22 visuals. It is a flowchart of an example method for media processing Figure 23 visuals. It is a flowchart of an example method for media processing Figure 24 visuals. It is a flowchart of an example method for media processing Figure 25 visuals. It is a flowchart of an example method for media processing Figure 26 visuals. It is a flowchart of an example method for media processing Detailed description of the invention This document provides various techniques that can be used by an image or video bitstream decoder to improve the quality of decompressed or decoded digital images or videos. For brevity, the term “video” is used herein to include both a sequence of images (traditionally referred to as video) and individual images. Furthermore, a video encoder can also implement these techniques during the encoding process to reconstruct decoded frames for further encoding. The section headings used in this document are for ease of understanding and do not limit the modalities and techniques to the corresponding sections. As such, the modalities in one section may be combined with modalities from other sections. 1. Summary of the Invention This document relates to video encoding / decoding technologies. Specifically, it relates to coefficient coding in a transform-hopping mode for video coding. It can be applied to existing video coding standards such as HEVC, or to the Versatile Video Coding (VVC) standard that is being finalized. It may also be applicable to future video coding standards or video codecs. 2. Initial Analysis Video coding standards have evolved primarily through the development of well-known ITU-T and ISO / IEC standards. The ITU-T produced H.261 and H.263, ISO / IEC produced MPEG-1 and MPEG-4 Visual, and the two organizations jointly produced the H.262 / MPEG-2 Video and H.264 / Advanced Video Coding (AVC) MPEG-4 and H.265 / HEVC standards [1,2]. Since H.262, video coding standards have been based on a hybrid video coding structure that uses both time prediction and transform coding. To explore future video coding technologies beyond HEVC, the Joint Video Exploration Team (JVET) was jointly founded by VCEG and MPEG in 2015. Since then, JVET has adopted many new methods and incorporated them into the reference software called the Joint Exploration Model (JEM).In April 2018, the Joint Video Expert Team (JVET) was created between VCEG (Q6 / 16) and ISO / IEC JTC1 SC29 / WG11 (MPEG) to work on the VVC standard aimed at a 50% reduction in bit rate compared to HEVC. The latest version of the VCC draft, i.e., Versatile Video Coding (Draft 4), can be found at: http: / / phenix.it-sudparis.eu / jvet / doc_end_user / current_document.php?¡d=5755 The latest VVC reference software, called VTM, can be found at: https: / / vcgit.hhi.fraunhofer.de / jvet / VVCSoftware_VTM / tags / VTM-4.0 Intrablock copy Intra-block copying (IBC), also known as current-image reference, has been adopted in HEVC Screen Content Coding Extensions (HEVC-SCC) and the current VVC test model (VTM-4.0). IBC extends the motion compensation concept from inter-frame coding to intra-frame coding. As shown in Figure 1, the current block is predicted by a reference block in the same image when IBC is applied. The samples in the reference block must have been reconstructed before the current block is encoded or decoded. While IBC is not as efficient for most camera-captured sequences, it shows significant coding gains for screen content. This is because there are many repeating patterns, such as icons and text characters, in a screen content image. IBC can effectively eliminate redundancy between these repeating patterns.In HEVC-SCC, an inter-encoding unit (CU) can apply IBC if it chooses the current image as its reference image. The MV is renamed a block vector (BV) in this case, and a BV always has integer pixel precision. To be compatible with HEVC Main Profile, the current image is marked as a "long-term" reference image in the decoded image buffer (DPB). It should be noted that similarly, in multiple 3D video display / encoding standards, the inter-view reference image is also marked as a long-term reference image. After a BV (Between Verification) operation to find its reference block, the prediction can be generated by copying the reference block. The remainder can be obtained by subtracting the reference pixels from the original signals. Then, the transform and quantization can be applied as in other encoding modes. However, when a reference block is outside the image, overlaps with the current block, is outside the reconstructed area, or is outside the valid area restricted by certain constraints, some or all pixel values ​​are undefined. There are essentially two solutions to handle this problem. One is to prevent this situation, for example, through bitstream conformance. The other is to apply padding for these undefined pixel values. The following sub-sections describe these solutions in detail. IBC in HEVC screen content encoding extensions In HEVC screen content encoding extensions, when a block uses the current image as a reference, it must ensure that the entire reference block is within the available reconstructed area, as stated in the following specification text: The offsetX and offsetY variables are derived as follows: offsetX = (ChromaArrayType = = 0) ? 0 : (mvCLX[0] & 0x7 ? 2 : 0) (8-106) offsetY = (ChromaArrayType = = 0) ? 0 : (mvCLX[1 ] & 0x7 ? 2 : 0) (8-107) It is a bitstream conformance requirement that when the reference image is the current image, the luma motion vector mvLX obeys the following restrictions: When the derivation process for scan order block availability z as specified in clause 6.4.1 is invoked with (xCurr, yCurr) set equal to (xCb, yCb) and neighbor luma location (xNbY, yNbY) set equal to (xPb + (mvLX [0] » 2) - offsetX, yPb + (mvLX [1] » 2) offsetY) as inputs, the output will be equal to TRUE. When the derivation process for scan order block availability z as specified in clause 6.4.1 is invoked with (xCurr, yCurr) set equal to (xCb, yCb) and neighbor luma location (xNbY, yNbY) set equal to (xPb + (mvLX [0] » 2) + nPbW- 1 + offsetX, yPb + (mvLX [1] » 2) + nPbH - 1 + offsetY) as inputs, the output will be equal to TRUE. One or both of the following conditions will be met: The value of (mvLX[0] » 2) + nPbW + xB1 + offsetX is less than or equal to 0. The value of (mvLX[1] » 2) + nPbH + yB1 + offsetY is less than or equal to 0. The following conditions will be met: (xPb + (mvLX[0] » 2) + nPbSw - 1 + offsetX) / CtbSizeY - xCurr / CtbSizeY <= yCurr / CtbSizeY - (yPb + (mvLX[1] » 2) + nPbSh - 1 + offsetY) / CtbSizeY (8-108) Therefore, the case where the reference block overlaps with the current block or the reference block is outside the image will not occur. There is no need to fill the reference or prediction block. IBC in VVC test model In the current VVC test model, i.e., the VTM-4.0 design, the entire reference block must be within the current coding tree unit (CTU) and does not overlap with the current block. Therefore, there is no need to fill in the reference or prediction block. The IBC flag is coded as a prediction mode for the current CU. Therefore, there are a total of three prediction modes—MODEJNTRA, MODEJNTER, and MODEJBC—for each CU. IBC fusion mode In IBC merge mode, an index pointing to an entry in the IBC merge candidate list is analyzed from the bitstream. The construction of the IBC merge list can be summarized according to the following sequence of steps: Step 1: Derivation of space candidates Step 2: Insertion of HMVP candidates Step 3: Insertion of average candidates by pairs In the derivation of spatial merge candidates, a maximum of four merge candidates are selected from the candidates located in positions A1, B1, BO, AO, and B2. The derivation order is A1, B1, BO, AO, and B2. Position B2 is considered only when any PU from positions A1, B1, BO, or AO is unavailable (for example, because it belongs to another slice or tile) or is not encoded in IBC mode. After the candidate in position A1 is added, the insertion of the remaining candidates is subject to a redundancy check that ensures candidates with the same motion information are excluded from the list, thus improving coding efficiency. After inserting the spatial candidates, if the IBC merge list size is still smaller than the maximum IBC merge list size, IBC candidates can be inserted from the HMVP table. Redundancy checking is performed when inserting the candidates from HMVP. Finally, the average peer candidates are inserted into the IBC merger list. When a reference block identified by a merge candidate is outside the image, or overlaps with the current block, or outside the reconstructed area, or outside the valid area restricted by some constraints, the merge candidate is called an invalid merge candidate. It is noted that invalid merger candidates can be inserted into the IBC merger list. IBC AMVP Mode In IBC AMVP mode, an AMVP index point is parsed into an entry in the IBC AMVP list from the bitstream. The construction of the IBC AMVP list can be summarized according to the following sequence of steps: Step 1: Derivation of space candidates Check AO, A1 until a candidate is available. Check BO, B1, B2 until a candidate is found. Step 2: Insertion of HMVP candidates Step 3: Insertion of zero candidates After inserting the spatial candidates, if the IBC AMVP list size is still smaller than the maximum IBC AMVP list size, IBC candidates can be inserted from the HMVP table. Finally, zero candidates are included in the IBC AMVP list. Adaptive Motion Vector Resolution (AMVR) In HEVC, motion vector differences (MVDs) (between the actual motion vector and the predicted motion vector of a control unit) are signaled in quarter-luma sample units when `use_integer_mv_flag` is equal to 0 in the segment header. In VVC, an adaptive motion vector resolution (AMVR) scheme is introduced at the control unit level. AMVR allows the control unit's MVDs to be encoded with varying precision. Depending on the mode (normal AMVP mode or affine AVMP mode) for the current control unit, the current control unit's MVDs can be adaptively selected as follows: Q LC7 LO / L7A7 / B / YI Normal AMVP mode: quarter luma sample, full luma sample, or four luma sample. Affine AMVP mode: four luma sample, whole luma sample, or 1 / 16 luma sample. The CU-level MVD resolution indication is conditionally signaled if the current CU has at least one non-zero MVD component. If all MVD components (i.e., horizontal and vertical MVDs for the LO reference list and the L1 reference list) are zero, a quarter-luma sample MVD resolution is inferred. For a CU that has at least one non-zero MVD component, a first flag is signaled to indicate whether quarter-luma sampled MVD precision is used for the CU. If the first flag is 0, no further signaling is required, and quarter-luma sampled MVD precision is used for the actual CU. Otherwise, a second flag is signaled to indicate whether whole-luma sampled or four-luma sampled MVD precision is used for the normal AMVP CU. The same second flag is used to indicate whether whole-luma sampled or 1 / 16-luma sampled MVD precision is used for the affine AMVP CU. To ensure that the reconstructed VM has the desired precision (quarter-luma sampled, whole-luma sampled, or four-luma sampled), the motion vector predictors for the CU are rounded to the same precision as the VMD before being summed together with the VMD.Motion vector predictors are rounded to zero (i.e., a negative motion vector predictor is rounded to positive infinity and a positive motion vector predictor is rounded to negative infinity). The encoder determines the motion vector resolution for the current CU using RD verification. To avoid always performing a CU-level RD verification three times for each MVD resolution, in VTM4, RD verification for MVD accuracies other than quarter-luma sampling is only invoked conditionally. For normal AVMP mode, the RD cost of quarter-luma sampling MVD accuracy and whole-luma sampling MVD accuracy is first calculated. Then, the RD cost of the whole-luma sampling MVD accuracy is compared to that of the quarter-luma sampling MVD accuracy to decide whether further RD verification of the four-luma sampling MVD accuracy is necessary. When the RD cost for the quarter-luma sampling MVD accuracy is much lower than that of the whole-luma sampling MVD accuracy, the RD verification of the four-luma sampling MVD accuracy is skipped.For the affine AMVP mode, if the affine intermode is not selected after verifying the speed-distortion costs of the affine fusion / jump mode, the fusion / jump mode, the normal AMVP mode with quarter-luma sample MVD precision, and the affine AMVP mode with quarter-luma sample MVD precision, then the affine intermodes with 1 / 16-luma sample MV precision and 1 pei sample MV precision are not verified. Furthermore, the affinity parameters obtained in the quarter-luma VM precision affine intermode are used as the initial search point in the 1 / 16-luma sample precision and quarter-luma sample affine intermodes. Palette mode The basic idea behind a palette mode is that the samples in the CU are represented by a QLC7Ln / L7n7 / E / Yli is a small set of representative color values. This set is known as the palette. It is also possible to indicate a sample that is outside the palette by signaling an avoidance symbol followed by component values ​​(possibly quantized). This is illustrated in Figure 2. Palette mode in HEVC Screen Content Encoding Extensions (HEVC-SCC) In palette mode in HEVC-SCC, a predictive form is used to encode the palette and index map. Encoding of palette inputs For encoding palette inputs, a palette predictor is maintained. The maximum palette size, as well as the palette predictor, are signaled in the SPS. In HEVC-SCC, a palette predictor initializer present flag is introduced in the PPS. When this flag is 1, the inputs for initializing the palette predictor are signaled in the bitstream. The palette predictor is initialized at the beginning of each CTU row, each segment, and each tile. Depending on the value of the palette predictor initializer present flag, the palette predictor is either reset to 0 or initialized using the palette predictor initializer inputs signaled in the PPS. In HEVC-SCC, a palette predictor initializer of size 0 was enabled to allow explicit disabling of palette predictor initialization at the PPS level. For each entry in the palette predictor, a reuse flag is signaled to indicate whether it is part of the current palette. This is illustrated in Figure 3. The reuse flags are sent using zero-path length encoding. After this, the number of new palette entries is signaled using the Golomb exponential order code 0. Finally, the component values ​​for the new palette entries are signaled. Palette index coding The palette indices are encoded using horizontal and vertical transpose scans as shown in Figure 4. The scan order is explicitly signaled in the bitstream using the palette_transpose_flag. For the remainder of this subsection, horizontal scanning is assumed. Palette indices are encoded using two main palette sample modes: 'INDEX' and 'COPY_ABOVE'. As explained earlier, the evasion symbol is also indicated as an 'INDEX' mode, and an index equal to the maximum palette size is assigned. The mode is signaled using a flag, except for the top row or when the previous mode was 'COPY_ABOVE'. In 'COPY_ABOVE' mode, the palette index of the sample in the previous row is copied. In 'INDEX' mode, the palette index is explicitly indicated. For both 'INDEX' and 'COPY_ABOVE' modes, a run value is specified, indicating the number of subsequent samples that are also encoded using the same mode. When the evasion symbol is part of the traversal in 'INDEX' or 'COPY_ABOVE' mode, the evasion component values ​​are signaled for each evasion symbol. The encoding of palette indices is illustrated in Figure 5. This syntax order is achieved as follows. First, the number of index values ​​for the CU is signaled. This is followed by signaling the actual index values ​​for the entire CU using truncated binary encoding. Both the number of indices and the index values ​​are encoded in skip mode. This groups the index-related skip ranges together. Next, the palette sample mode (if needed) and execution are signaled in an interleaved manner. Finally, the evasion component values ​​corresponding to the evasion samples for the entire CU are grouped and encoded in skip mode. An additional syntax element, last_run_type_flag, is specified after the index values. This syntax element, along with the number of indices, eliminates the need to flag the run type for the last run in the block. In HEVC-SCC, palette mode is also enabled for 4:2:2, 4:2:0, and monochromatic chroma formats. Signaling of palette inputs and palette indices is nearly identical for all chroma formats. For non-monochromatic formats, each palette input consists of three components. For the monochromatic format, each palette input consists of a single component. For undersampled chroma addresses, chroma samples are associated with luma sample indices that are divisible by two. After reconstructing the palette indices for the CU, if a sample has only one associated component, only the first component of the palette input is used. The only difference in signaling is for the evasion component values. For each evasion sample, the number of evasion component values ​​signaled can vary depending on the number of components associated with that sample. Coefficient coding in transform jump mode In JVET-M0464 and JVET-N0280, several modifications to the transform hop (TS) mode coding coefficients are proposed in order to adapt the residual coding to the statistics and signal characteristics of the transform hop levels. The proposed modifications are listed below. No last significant scan position: Since the residual signal reflects the spatial residue after prediction and no energy compaction per transform is performed for TS, the higher probability of zeros at the end or negligible levels in the lower right corner of the transform block no longer occurs. Therefore, the last significant scan position signal is omitted in this case. Subblock CBF: The absence of the last significant scan position signaling requires that the subblock CBF signaling with coded_sub_block_flag for TS be modified as follows: Due to quantization, the insignificance sequence mentioned above may still occur locally within a transform block. Therefore, the last significant scan position is removed as described above, and the coded_sub_block_flag is encoded for all subblocks. The coded_sub_block_flag for the subblock covering the DC frequency position (upper left subblock) presents a special case. In VVC Draft 3, the coded_sub_block_flag for this subblock is never stated and is always inferred to be equal to 1. When the last significant scan position is located in another subblock, it means there is at least one level QLCZLn / LZnZ / E / Yli significant outside the DC subblock. Consequently, the DC subblock can contain only zero / non-significant levels, although it is inferred that the coded_sub_block_flag for this subblock is equal to 1. With the absence of the last scan position information in TS, the coded_sub_block_flag for each subblock is indicated. This also includes the coded_sub_block_flag for the DC subblock, except when all other coded_sub_block_flag syntax elements are already equal to 0. In this case, it is inferred that the coded_sub_block_flag DC is equal to 1 (inferDcSbCbf=1). Since there has to be at least one meaningful level in this DC subblock, the syntax element sig_coeff_flag for the first position at (0,0) is not indicated and it is inferred to be equal to 1 (inferSbDcSigCoeffFIag =1) instead if all other syntax elements sig_coeff_flag in this DC subblock are equal to 0 or the context modeling for coded_sub_block_flag is changed.The context model index is calculated as the sum of the coded_sub_block_flag to the left and the coded_sub_block_flag above the current subblock instead of a logical disjunction of both. Context modeling of sig_coeff_flag: The local template in the sig_coeff_flag context model is modified to include only the left neighbor (NBo) and the above neighbor (NBi) of the current scan position. The context model offset is simply the number of significant neighbor positions sig_coeff_flag[NBo] + sig_coeff_flag[NBi]. Therefore, the selection of different context sets depending on the diagonal d within the current transform block is eliminated. This results in three context models and a single context model set to encode the sig_coeff_flag. Context modeling of abs level qt1 flaa and par level flaa: An individual context model is used for abs_level_gt1_flag and par_level_flag. coding of abs remainder: Although the empirical distribution of absolute remainder levels of transform jumps typically still follows a Laplacian or geometric distribution, larger stationary conditions exist than for absolute transform coefficient levels. In particular, the variance within a consecutive realization window is greater for absolute remainder levels. This motivates the following modifications to the binarization of the abs_remainder syntax and context modeling: Using a higher cutoff value in binarization—that is, the transition point from encoding with sig_coeff_flag, abs_level_gt1_flag, par_level_flag, and abs_level_gt3_flag to Rice codes for abs_remainder—and dedicated context models for each span position results in greater compression efficiency. Increasing the cutoff will result in more flags greater than X, for example, introducing abs_level_gt5_flag, abs_level_gt7_flag, and so on until a cutoff is reached. The cutoff itself is fixed at 5 (numGtFlags=5). The template for deriving the Rice parameter is modified; that is, only the neighbor to the left and the neighbor above the current scan position are considered similar to the local template for sig_coeff_flag context modeling. Context modeling of the sign coefficient flag: Due to stationary conditions within the sign sequence and the fact that the prediction residual is often biased, signs can be encoded using context models, even when the overall empirical distribution is nearly uniform. A dedicated context model is used for sign encoding, and the sign is analyzed after the sign coefficient flag to maintain all context-encoded segments together. Quantized Residual Block Differential Pulse Code Modulation (QRBDPCM) In JVET-M0413, a quantized residual block differential pulse coding modulation (QR-BDPCM) is proposed to efficiently encode the screen content. The prediction directions used in QR-BDPCM can be vertical or horizontal. Intraprediction is performed across the entire block by copying the sample in the prediction direction (horizontal or vertical), similar to intraprediction. The residual is quantified, and the delta between the quantified residual and its predictor value (horizontal or vertical) is encoded. This can be described as follows: For a block of size M (rows) × N (columns), let rt j, 0 <i < Μ - 1, 0 < j < N - 1 sea el residuo predicción después de realizar intrapredicción horizontalmente (que copia el valor de pixeles del vecino izquierdo a través de la línea de bloque predicha por línea) o verticalmente (que copia la línea del vecino superior a cada línea en el bloque predicho) usando muestras no filtradas de muestras de límite de bloque superior o izquierdo.Let Q(rlJ~), 0 < i < M - 1, 0 < j < N - 1 denote the quantized version of the residual rtJ, where the residual is the difference between the original block and the predicted block values. Then, the DPCM block is applied to the quantized residual samples, resulting in a modified M × N matrix R with elements (j). When denoting vertical BDPCM: .=fi = 0, 0 <j<(N — l)riJ0<;<0V-l) For horizontal prediction, similar rules apply, and the residual quantified samples are obtained by . í Q^j). 0 < i < (M — 1), / = 0riJ\Q(.rij) ~ Q(ri,(j-iy)> 0 <i<(M-l\ 1<;<(Λ / -1)' The residual quantified samples ñj are sent to the decoder. On the decoder side, the above calculations are reversed to produce Q(riJ'), 0 < i < M 1, 0 < j < N - 1. For the vertical prediction case, Qin.j) = 0 < i < (Μ — 1), 0<;<(Nl). In the horizontal case, QQbfeZLofe 0<í<(Ml), 0 < j < (N — 1). The inverse quantified residuals are added to the intrablock prediction values ​​to produce the reconstructed sample values. The main benefit of this scheme is that the inverse DPCM can be done on the fly during coefficient analysis by simply adding the predictor as the coefficients are analyzed, or it can be performed after the analysis. The text changes from the QR-BDPCM draft are shown below. 7.3.6.5 Coding Unit Syntax Coding unit(xO, yO, cbWidth, cbHeight, treeType) { Descriptor ifftile group type != 1 | | sps ¡be enabled flag) { ifftreeType != DUAL TREE CHROMA) cu skip flagfxOlfyO] aefv) iffcu skip flagfxOlfyO] = = 0 && tile group type != 1) pred mode flag aefv) if(((tile_groupjype = = 1 && cu_skíp_flag[xO][yO] = =0) | | (tile_group_type != 1 && CuPredMode[xO][yO] != MODEJNTRA)) && sps ¡be enabled flag) pred mode ibe flag aefv) ] iffCuPredModefxOlfyO] = = MODE INTRA) { if(pred_modejlag = = MODEJNTRA && (cldx == 0 ) && (cbWidth <= 32) && (CbHeight <= 32)) { bdpcm flagfxOlfyO] aefv) if(bdpcm flagfxOlfyO]) { bdpcm dir flagfxOlfyO] aefv)} else { if(sps_pcm_enabledjlag && cbWidth >- MinlpcmCbSizeY && cbWidth <= MaxIpcmCbSizeY && cbHeight >= MinlpcmCbSizeY && cbHeight <= MaxIpcmCbSizeY) pem flagfxOlfyO] aefv) if(pcm flagfxOlfyO]) { whileflbyte alignedf)) pem alignment zero bit f(1) pem sample(cbWidth, cbHeight,treeType)} else { ifftreeType = = SINGLE_TREE | | treeType DUAL TREE LUMA) { ifffyO % CtbSizeY) > 0) intra luma ref idxfxO]fyO] aefv) if (intraJuma_refJdx[xO][yO] = = 0 && (cbWidth <= MaxTbSizeY | | cbHeight <= MaxTbSizeY) && (cbWidth * cbHeight > MinTbSizeY * MinTbSizeY)) intra subpartitions mode flagfxOlfyO] aefv) if(intra_subpartitions_modeJlag[xO][yO] = = 1 && cbWidth <= MaxTbSizeY && cbHeight <= MaxTbSizeY) intra subpartitions split flagfxOlfyO] aefv) if(intraJuma_refJdx[xO][yO] == 0 && intra subpartitions mode flagfxOlfyO] = = 0) intra luma mpm flagfxOlfyO] aefv) iffintra luma mpm flagfxOlfyO]) intra luma mpm idxfxOlfyO] aefv) else intra luma mpm remainderfxOlfyO] aefv) ]} ifftreeType = = SINGLE_TREE | | treeType DUAL TREE CHROMA) intra chroma pred modefxOlfyO] aefv)}} else ifftreeType != DUAL_TREE_CHROMA) { Γ MODEJNTER or MODEJBC 7}, bdpcm_flag[xO][yO] equal to 1 specifies that a bdpcm_dir_flag is present in the encoding unit that includes the luma encoding block at location (xO, yO). bdpcm_dir_flag[xO][yO] equal to 0 specifies that the prediction direction to be used in a bdpcm block is horizontal; otherwise, it is vertical. Partition structure Partitioning the CTUs using a tree structure In HEVC, a CTU is divided into CUs using a quaternary tree structure, denoted as the encoding tree, to accommodate various local features. The decision of whether to encode an image area using inter-image (temporal) or intra-image (spatial) prediction is made at the leaf CU level. Each leaf CU can be further divided into one, two, or four PUs, depending on the PU division type. Within a PU, the same prediction process is applied, and the relevant information is passed to the decoder one per PU. After obtaining the residual block by applying the prediction process based on the PU division type, a leaf CU can be partitioned into transform units (TUs) according to another quaternary tree structure similar to the encoding tree for the CU. One of the key features of the HEVC structure is its multiple partitioning concepts, including CUs, PUs, and TUs.In VVC, a quad tree with a nested multitype tree that uses structured segmentation of binary and ternary splits replaces the concepts of multiple partition unit types; that is, it eliminates the separation of the CU, PU, ​​and TU concepts except when necessary for CUs that are too large for the maximum transform length, and it supports more flexibility for CU partition shapes. In the coding tree structure, a CU can be square or rectangular. A coding tree unit (CTU) is first split using a quad tree structure (also known as a quad tree). Then, the leaf nodes of the quad tree can be further partitioned using a multitype tree structure.As shown in Figure 6, there are four types of splitting in the multi-type tree structure: vertical binary split (SPLIT_BT_VER), horizontal binary split (SPLIT_BT_HOR), vertical ternary split (SPLIT_TT_VER), and horizontal ternary split (SPLIT_TT_HOR). The leaf nodes of the multi-type tree are called coding units (CUs). Unless the CU is too large for the maximum transform length, this splitting is used for prediction and transform processing without any additional partitioning. This means that, in most cases, the CU, PU, ​​and TU have the same block size in the quad tree with a nested multi-type tree coding block structure. The exception occurs when the maximum supported transform length is less than the width or height of the CU's color component. Furthermore, the luma and chroma components have separate partitioning structures in the I tiles. Cross-component linear model prediction To reduce cross-component redundancy, a cross-component linear model (CCLM) prediction mode is used in the VTM4, for which chroma samples are predicted based on reconstructed luma samples from the same CU using a linear model as follows: predc(i,j) = a · recL'(i,j) + β where predc(i,j) represents the predicted chroma samples in a CU and recL(i,j) represents the undersampled reconstructed luma samples from the same CU. The linear model parameters a and β are derived from the relationship between the luma and chroma values ​​of two samples, which are the luma sample with the minimum and maximum sample values ​​within the set of undersampled neighboring luma samples, and their corresponding chroma samples. The linear model parameters a and β are obtained according to the following equations. Ya ~Yb“ Xa-Xbβ = Yb-a-Xb Where Ya and Xa represent the luma and chroma values ​​of the luma sample with the maximum luma sample value. YXb and Yb represent the luma and chroma values ​​of the luma sample with the minimum luma sample, respectively. Figure 7 shows an example of the location of the left and top samples and the sample of the current block involved in CCLM mode. Luma mapping with chroma scale modification (LMCS) In VTM4, a coding tool called luma mapping with chroma scaling modification (LMCS) is added as a new processing block before the loop filters. LMCS has two main components: 1) loop mapping of the luma component based on piecewise linear adaptive models; 2) for the chroma components, luma-dependent residual chroma scaling modification is applied. Figure 8 shows the LMCS architecture from the decoder's perspective. The shaded blocks in Figure 8 indicate where processing is applied in the mapped domain; these include inverse quantization, inverse transform, luma intraprediction, and the addition of the luma prediction along with the luma residual.The unshaded blocks in Figure 8 indicate where processing is applied in the original (i.e., unmapped) domain; these include loop filters such as unblocking, ALF, and SAO, motion-compensated prediction, intraprediction of chroma, addition of the chroma prediction along with the chroma residue, and storage of decoded images as reference images. The light yellow shaded blocks in Figure 8 are the new LMCS functional blocks, which include forward and inverse mapping of the luma signal and a luma-dependent chroma scaling process. Like most other tools in VVC, LMCS can be enabled / disabled at the sequence level using an SPS flag. 3. Examples of problems solved by modality Although coefficient coding in JVET-N0280 can achieve encoding benefits in screen content coding, the encoding coefficients and transform jump (TS) mode may still have some drawbacks. (1) The maximum width or height allowed for TS mode is controlled by a common value in PPS, which may limit flexibility. (2) Each coding group (CG) needs to signal a cbf flag for TS mode which can increase the overhead cost. (3) The coefficient scan order does not consider the intraprediction mode. (4) Sign flag encoding only uses one context. (5) Transform jump is not supported in the chroma component. (6) The transform jump flag is applied in all prediction modes, which increases overhead cost and coding complexity. 4. Examples of modalities The inventions detailed below should be considered as examples to explain general concepts. These inventions should not be interpreted restrictively. Furthermore, these inventions can be combined in any way. 1. The indications of the maximum width and height allowed for the transform jump can both be signaled in the SPS / VPS / PPS / image header / segment header / tile group header / LCU row / LCU group. a. In one example, the maximum allowed width and height for the transform jump can be indicated by different signaled messages in the SPS / VPS / PPS / image header / segment header / tile group header / LCU row / LCU group. b. In one example, the maximum allowed width and / or height can be signaled first in the SPS / PPS, then updated in the image header / segment header / tile group header / LCU row / LCU group. 2. A TS-coded block can be divided into several coefficient groups (CG) and the signaling of the coded block flag (Cbf) of at least one CG can be skipped. a. In one example, the signaling of all Cbf flags of the CG can be omitted, for example, for a TS-coded block. b. In one example, the CG skipped cbf flags can be inferred to 1 for TS mode c. For example, whether the CG Cbf flags are partially or completely skipped may depend on the encoded mode. i. In one example, for TS-coded intrablocks, the signaling of all CG Cbf flags is skipped. d. In one example, the Cbf flag jumped from a CG can be inferred based on i. A signaled message in the SPS / VPS / PPS / image header / segment header / tile group header / LCU row / LCU group / LCU / CU i. The position of the GC iii. Block dimension of the current block and / or its neighboring blocks iv. Block shape of the current block and / or its neighboring blocks v. The most probable modes of the current block and / or its neighboring blocks. vi. Prediction modes (Intra / Inter) of the neighboring blocks of the current block. QLC7Ln / L7n7 / E / Yli vii. Intraprediction modes of neighboring blocks of the current block viii. Movement vectors of neighboring blocks of the current block ix. Indication of the QR-BDPCM modes of the neighboring block of the current block x. Current quantization parameter of the current block and / or that of its neighboring blocks xii. Indication of the color format (such as 4:2:0, 4:4:4) xii. Single / dual encoding tree structure xiii. Segment / mosaic group type and / or image type 3. The scan order of coefficients in TS-coded blocks may depend on a signaled message in the SPS / VPS / PPS / image header / segment header / mosaic group header / LCU row / LCU group / LCU / CU. a. Alternatively, the scan order of CG and / or coefficient may depend on the intraprediction mode when using TS i. In one example, the scan order can be vertical if the intraprediction mode is horizontally dominated 1. In one example, the scan order can be vertical if the intraprediction mode index ranges from 2 to 34. 2. In one example, the scan order can be vertical if the intraprediction mode index varies from 2 to 33. i. In one example, the scan order can be vertical if the intraprediction mode is vertically dominated 1. In one example, the scan order may be vertical if the intraprediction mode index varies from 34-66. 2. In one example, the scan order can be vertical if the intraprediction mode index varies from 35-66. iii. In one example, the scan order can be horizontal if the intraprediction mode is vertically dominated 1. In one example, the scan order can be vertical if the intraprediction mode index ranges from 34 to 66. 2. In one example, the scan order can be vertical if the intraprediction mode index varies from 35 to 66. iv. In one example, the scan order can be horizontal if the intraprediction mode is horizontally dominated 1. In one example, the scan order can be vertical if the intraprediction mode index ranges from 2 to 34. 2. In one example, the scan order can be vertical if the intraprediction mode index varies from 2 to 33. 4. It is proposed that the sign flag encoding context may depend on the neighbor information in a coefficient block for TS mode. QLC7Ln / L7n7 / E / Yli a. In one example, the encoding context of the current sign flag may depend on the value of neighboring sign flags for TS mode. i. In one example, the encoding context of the current sign flag may depend on the value of the sign flags of the left and / or above neighbors. 1. In one example, the context of the current sign flag can be derived as C= (L + A), where C is the context id, L is the sign flag of its left neighbor, and A is the sign flag of its neighbor above. 2. In one example, the context of the current sign flag can be derived as C= (L + A*2), where C is the context id, L is the sign flag of its left neighbor, and A is the sign flag of its neighbor above. 3. In one example, the context of the current sign flag can be derived as C = (L*2 + A), where C is the context id, L is the sign flag of its left neighbor, and A is the sign flag of its neighbor above it. In one example, the encoding context of the current sign flag may depend on the value of the sign flags of the left neighbors, above neighbors, and left neighbor above. iii. In one example, the encoding context of the current sign flag may depend on the value of the sign flags of left neighbors, above, left neighbor above, right neighbor above. b. In one example, the encoding context of the current sign flag may depend on the position of the coefficient. i. In one example, the context of the sign flag may be different in different positions. i. In one example, the sign flag context may depend on x+y, where x and y are the horizontal and vertical positions of a position. In one example, the sign flag context may depend on min(x,y), where x and y are the horizontal and vertical positions of a position. iv. In one example, the sign flag context may depend on max(x,y) where x and y are the horizontal and vertical positions of a position. 5. It is proposed that the chroma transformation jump mode be supported. a. In one example, the use of chroma transform hopping mode can be based on a message signaled in the SPS / VPS / PPS / picture header / segment header / tile group header / LCU row / LCU group / LCU / CU / video data unit. b. Alternatively, the use of the chroma transform jump mode can be based on the decoded information from one or more previously encoded representative blocks in the same color component or other color components. i. In one example, the chroma key TS flag indication can be inferred as false if the representative block TS flag indication is false. Alternatively, the chroma key TS flag indication can be inferred as true if the representative block TS flag indication is true. i. In one example, the representative block can be a luma block or a chroma block. iii. In one example, the representative block could be any block within the co-located luma block. iv. In one example, the representative block could be one of the chroma blocks neighboring the current chroma block. v. In one example, the representative block may be the block that covers the corresponding luma sample of the central chroma sample within the current chroma block. vi. In one example, the representative block might be the block that covers the corresponding luma sample of the lower right chroma sample within the current chroma block. 6. Whether and / or how the transform hopping mode is applied may depend on a message signaled in the SPS / VPS / PPS / picture header / segment header / tile group header / LCU row / LCU group / LCU / CU / video data unit. a. In one example, the indication of when and / or how the transformation jump mode is applied may depend on i. Block dimension of the current block and / or its neighboring blocks ii. Block shape of the current block and / or its neighboring blocks iii. The most probable modes of the current block and / or its neighboring blocks iv. Prediction modes (Intra / Inter) of the neighboring blocks of the current block v. Intraprediction modes of the blocks neighboring the current block vi. Movement vectors of the blocks neighboring the current block vii. Indication of the QR-BDPCM modes of the block neighboring the current block viii. Current quantization parameter of the current block and / or that of its neighboring blocks ix. Indication of the color format (such as 4:2:0, 4:4:4) x. Single / dual encoding tree structure x1. Segment / mosaic group type and / or image type x11. Temporal layer ID b. In one example, the transform hopping mode can be applied when the prediction mode is an IBC mode and the block width and / or height is less than / greater than / equal to a threshold i. In one example, the threshold could be 4, 8, 16 or 32. ii. In one example, the threshold can be signaled in the bit stream. iii. In one example, the threshold can be based on 1. A signaled message in the SPS / VPS / PPS / image header / segment header / tile group header / LCU row / LCU group / LCU / CU 2. Block dimension of the current block and / or its neighboring blocks 3. Block shape of the current block and / or its neighboring blocks 4. The most probable modes of the current block and / or its neighboring blocks 5. Prediction modes (Intra / inter) of neighboring blocks of the current block 6. Intraprediction modes of neighboring blocks of the current block QLC7Ln / L7n7 / E / Yli 7. Movement vectors of neighboring blocks of the current block 8. Indication of the QR-BDPCM modes of the neighboring block of the current block 9. Current quantization parameter of the current block and / or that of its neighboring blocks 10. Indication of the color format (such as 4:2:0, 4:4:4) 11. Single / dual coding tree structure 12. Segment group / mosaic type and / or image type 13. Temporary layer ID 7. If the TS mode indication is signaled, it may depend on the decoded / derived intraprediction mode. a. Alternatively, it may also depend on the allowed intraprediction modes / directions used in QR-BDPCM encoded blocks and the use of QR-BDPCM. b. For a decoded or derived intraprediction mode, if it is part of allowed sets of intraprediction modes / addresses used in QR-BDPCM encoded blocks, the TS flag signaling can be skipped. i. In an example, if QR-BDPCM is allowed to encode a segment / image / mosaic / brick, vertical and horizontal modes are two allowed modes in the QR-BDPCM process, and the decoded / derived intramode is either vertical or horizontal mode, then the TS mode indication is not signaled. c. In one example, it can be inferred that the transform hop mode is activated when the QR-BDPCM mode indication (e.g., bdpcm_flag) is 1. d. The above method can be applied based on i. A signaled message in the SPS / VPS / PPS / image header / segment header / tile group header / LCU row / LCU group / LCU / CU ii. Block dimension of the current block and / or its neighboring blocks iii. Block shape of the current block and / or its neighboring blocks iv. The most probable modes of the current block and / or its neighboring blocks v. Prediction modes (Intra / lnter) of neighboring blocks of the current block vi. Intraprediction modes of neighboring blocks of the current block vii. Movement vectors of neighboring blocks of the current block viii. Indication of the QR-BDPCM modes of the neighboring block of the current block ix. Current quantization parameter of the current block and / or that of its neighboring blocks x. Indication of color format (such as 4:2:0, 4:4:4) xii. Single / dual encoding tree structure xii. Segment / mosaic group type and / or image type xiii. Temporal layer ID 8. Whether and / or how QR-BDPCM is applied may depend on the TS mode indication. a. In one example, the indication of whether QR-BDPCM should be applied can be signaled at a transform unit (TU) level instead of being signaled at CU. i. In one example, the indication of whether QR-BDPCM should be applied can be signaled after QLC7Ln / L7n7 / E / Yli that applies the TS mode indication to a TU. b. In one example, QR-BDPCM is treated as a special case of TS mode. i. When a block is encoded using TS mode, an additional flag can be signaled to indicate whether QR-BDPCM or conventional TS mode is being used. If QR-BDPCM is used, the prediction direction used in QR-BDPCM can also be signaled. i. Alternatively, when a block is encoded in TS mode, another flag can be signaled to indicate that QR-BDPCM type (e.g., QR-BDPCM based on horizontal / vertical prediction direction) or conventional TS mode is applied. c. In one example, the indication of whether QR-BDPCM should be applied can be inferred based on the TS mode indication. i. In one example, the indication of whether QR-BDPCM should be applied in a luma and / or chroma block can be inferred as true if the indication of whether the transform jump flag should be applied in the same block is true. Alternatively, if the indication of whether the transform jump flag should be applied in a luma and / or chroma block is true, the indication of whether QR-BDPCM should be applied in the same block can be inferred as true. i. In one example, the indication of whether QR-BDPCM should be applied in a luma and / or chroma block can be inferred as false if the indication of whether the transform jump flag should be applied in the same block is false. Alternatively, if the indication of whether the transform jump flag should be applied in a luma and / or chroma block is false, the indication of whether QR-BDPCM should be applied in the same block can be inferred as false. 9. Whether and / or how a single / dual tree is applied may depend on a signaled message in the SPS / VPS / PPS / image header / segment header / tile group header / LCU row / LCU group / LCU / CU / video data unit. a. In one example, the indication of whether to apply a single / dual tree may depend on whether the current video data unit / segment / tile / LCU / LCU row / LCU group / segment is determined to be screen content. i. Furthermore, in one example, if a segment / tile / LCU / LCU row / LCU group / video data unit is determined as such, the screen content may depend on 1. a message / flag signaled in the SPS / VPS / PPS / image header / segment header / tile group header / LCU row / LCU group / LCU / CU / video data unit. 2. Block dimension of the current CTU and / or its neighboring CTUs 3. Block shape of the current CTU and / or its neighboring CTUs 4. Current quantification parameter of the current CTU and / or that of its neighboring CTUs 5. Indication of the color format (such as 4:2:0, 4:4:4) 6. Segment / Tile / LCU / LCU Row / LCU Group / Previous Video Data Unit Single / Dual Encoding Tree Structure Type 7. Segment group / mosaic type and / or image type 8. Temporary layer ID QLC7Ln / L7n7 / E / Yli b. In one example, the indication of whether a single / dual tree should be applied can be inferred, which may depend on i. a signaled message in the SPS / VPS / PPS / image header / segment header / tile group header / LCU row / LCU group / LCU / CU / video data unit. i. Hash success ratio of IBC / Inter modes on previously encoded images / mosaic / segments / reconstructed region ii. Block dimension of the current CTU and / or its neighboring CTUs iv. Block shape of the current CTU and / or its neighboring CTUs v. Current quantization parameter of the current CTU and / or its neighboring CTUs vi. Indication of the color format (such as 4:2:0, 4:4:4) vil. Single / dual encoding tree structure type of the segment / mosaic / LCU / LCU row / LCU group / previous video data unit viii. Segment / mosaic group type and / or picture type ix. Temporal layer ID c. In one example, the indication of whether CCLM and / or LMCS should be applied may depend on the type of single / dual coding tree structure i. In one example, the indication CCLM and / or LMCS can be inferred as false when using a single / dual tree. d. In one example, the indication of whether to apply single / dual tree (i.e., CTU-level adaptation of single tree or dual tree) may depend on whether the indication to activate dual tree (e.g., qtbtt_dual_tree_intra_flag) is true. i. Alternatively, if the dual tree for a sequence / segment / tile / brick is not triggered (e.g., qtbtt_dual_tree_intra_flag is false), the indication of whether a single / dual tree should be applied at a lower level (e.g., CTU) can be inferred to be false. 1. Alternatively, if dual tree is enabled (e.g., qtbtt_dual_tree_intra_flag is true), it can signal whether to apply single / dual tree to a video unit smaller than sequence / slice / tile / brick. e. In one example, the indication of whether to apply single / dual tree (i.e., CTU-level adaptation of single tree or dual tree) may depend on whether a flag at a level higher than the CTU level (e.g., sps_asdt_flag and / or slice_asdt_flag) is true. i. Alternatively, in addition, if a flag at a level higher than the CTU level (e.g., sps_asdt_flag and / or slice_asdt_flag) is false, the indication of whether to apply a single / dual tree (i.e., CTU-level adaptation of a single tree or a dual tree) can be inferred to be false. f. The above methods may also be applicable to a case of individual tree partitioning or individual / dual encoding tree structure type. 10. If IBC is activated, it may depend on the type of encoding tree structure. a. In one example, for a given type of encoding tree structure (e.g., dual tree), one can skip ahead and infer the IBC mode indication signaling and / or block vectors used in Q LC7 LO / L7A7 / B / YI IBC mode. b. In one example, the IBC mode indication can be inferred as false when the dual encoding tree structure type is applied. c. In one example, the IBC mode indication of a luma block can be inferred as false when the dual encoding tree structure type is applied. d. In one example, the IBC mode indication of a chroma block can be inferred as false when the dual encoding tree structure type is applied. e. In one example, the IBC mode indication can be inferred based on i. a signaled message in the SPS / VPS / PPS / image header / segment header / tile group header / LCU row / LCU group / LCU / CU / video data unit. i. Hash success ratio of IBC / Inter modes on previously encoded images / mosaic / segments / reconstructed region iii. Block dimension of the current CTU and / or its neighboring CTUs iv. Block shape of the current CTU and / or its neighboring CTUs v. Current quantization parameter of the current CTU and / or its neighboring CTUs vi. Indication of the color format (such as 4:2:0, 4:4:4) vii. Encoding tree structure type of the previous segment / mosaic / LCU / LCU row / LCU group / video data unit viii. Segment / mosaic group type and / or image type ix. Temporal layer ID 11. Whether CCLM is activated may depend on the type of encoding tree structure. a. In one example, for a given type of encoding tree structure (e.g., dual tree), one can skip and infer CCLM mode indication signaling and / or other CCLM mode-related syntax. b. In one example, the CCLM mode indication can be inferred as false when the dual encoding tree structure type is applied. c. In one example, the indication of CCLM mode, when the dual encoding tree structure type is applied, can be inferred based on i. a signaled message in the SPS / VPS / PPS / image header / segment header / tile group header / LCU row / LCU group / LCU / CU / video data unit. i. Hash success ratio of IBC / Inter modes on previously encoded images / mosaic / segments / reconstructed region iii. Block dimension of the current CTU and / or its neighboring CTUs iv. Block shape of the current CTU and / or its neighboring CTUs v. Current quantization parameter of the current CTU and / or its neighboring CTUs vi. Indication of the color format (such as 4:2:0, 4:4:4) vii. Encoding tree structure type of the previous segment / tile / LCU / LCU row / LCU group / video data unit QLCZLn / LZnZ / E / YU viii. Segment group / mosaic type and / or image type ix. Temporal layer ID 12. Whether LMCS is enabled for chroma components may depend on the type of encoding tree structure. a. In one example, for a given encoding tree structure type (e.g., dual tree), one can skip and infer LMCS indication signaling for chroma components and / or other LMCS mode-related syntax. b. In one example, the LMCS indication for chroma components can be inferred as false when the dual encoding tree structure type is applied. c. In one example, the LMCS indication for chroma components, when the dual coding tree structure type is applied, can be inferred based on i. a signaled message in the SPS / VPS / PPS / image header / segment header / tile group header / LCU row / LCU group / LCU / CU / video data unit. i. Hash success ratio of IBC / Inter modes on previously encoded images / mosaic / segments / reconstructed region iii. Block dimension of the current CTU and / or its neighboring CTUs iv. Block shape of the current CTU and / or its neighboring CTUs v. Current quantization parameter of the current CTU and / or its neighboring CTUs vi. Indication of the color format (such as 4:2:0, 4:4:4) vii. Encoding tree structure type of the previous segment / mosaic / LCU / LCU row / LCU group / video data unit viii. Segment / mosaic group type and / or image type ix. Temporal layer ID 13. The coding tree structure may depend on whether or not IBC is used. a. In one example, the dual tree structure and the IBC method may not be activated simultaneously at a sequence / image / mosaic / brick / CTU / VPDU / 32x32 block / 64x32 block / 32x64 block level. b. Alternatively, in addition, in one example, if the IBC method is activated, the dual tree structure can be deactivated at a level of one sequence / image / tile / brick / CTU / VPDU / 32x32 block / 64x32 block / 32x64 block. c. In one example, when IBC is used in a region, the chroma encoding tree structure can be aligned with the luma encoding tree structure i. In an example, the region can be a sequence / image / mosaic / brick / CTU / VPDU / 32x32 block / 64x32 block / 32x64 block. i. In one example, when a co-located luma block is split into subblocks, the chroma block can be split into subblocks if it is allowed to be split. iii. In one example, it is possible to infer if and how a chroma block is divided from the encoding structure of its co-located luma block. QLC7Ln / L7n7 / E / Yli iv. In one example, when the chroma coding tree structure is inferred from the luma coding tree structure, the signals to encode the chroma coding tree structure can be omitted. v. In one example, a flag can be used to indicate whether the chroma encoding structure can be inferred from the luma encoding structure or not. The flag signaling may depend on 1. A signaled message in the SPS / VPS / PPS / image header / segment header / tile group header / LCU row / LCU group / LCU / CU / video data unit. 2. The hash success ratio of IBC / Inter modes on previously encoded images / mosaic / segments / reconstructed region 3. Block dimension of the current CTU and / or its neighboring CTUs 4. Block shape of the current CTU and / or its neighboring CTUs 5. Current quantification parameter of the current CTU and / or that of its neighboring CTUs 6. Indication of the color format (such as 4:2:0, 4:4:4) 7. Segment / Tile / LCU / LCU Row / LCU Group / Video Data Unit Encoding Tree Structure Type above 8. Segment group / mosaic type and / or image type 9. Temporary layer ID 14. If palette encoding mode is activated, it may depend on the type of encoding tree structure. a. In one example, for a given type of encoding tree structure (e.g., dual tree), one can skip and infer the pallet encoding mode indication signaling. b. In one example, the palette encoding mode indication can be inferred as false when the dual encoding tree structure type is applied. c. In one example, the palette encoding mode indication of a luma block can be inferred as false when the dual encoding tree structure type is applied. d. In one example, the palette encoding mode indication of a chroma block can be inferred as false when the dual encoding tree structure type is applied. e. In one example, the indication of the inferred palette encoding mode can be based on i. a signaled message in the SPS / VPS / PPS / image header / segment header / tile group header / LCU row / LCU group / LCU / CU / video data unit. i. Hash success ratio of IBC / Inter modes on previously encoded images / mosaic / segments / reconstructed region iii. Block dimension of the current CTU and / or its neighboring CTUs iv. Block shape of the current CTU and / or its neighboring CTUs v. Current quantization parameter of the current CTU and / or its neighboring CTUs vi. Indication of the color format (such as 4:2:0, 4:4:4) vii. Encoding tree structure type of the segment / tile / LCU / LCU row / group QLC7Ln / L7n7 / E / Yli LCU / Previous Video Data Unit viii. Segment / Tile Group Type and / or Image Type ix. Temporal Layer ID 15. The encoding tree structure may depend on whether or not the palette encoding mode is used. a. In one example, when palette encoding mode is used in a region, the chroma encoding tree structure can be aligned with the luma encoding tree structure. i. In one example, the region may be a sequence / image / mosaic / brick / CTU / VPDU / 32x32 block / 64x32 block. i. In one example, when a co-located luma block is split into subblocks, the chroma block may be split into subblocks if it is allowed to be split. iii. In one example, it is possible to infer if and how a chroma block is divided from the encoding structure of its co-located luma block. iv. In one example, when the chroma coding tree structure is inferred from the luma coding tree structure, the signals to encode the chroma coding tree structure can be omitted. v. In one example, a flag can be used to indicate whether the chroma encoding structure can be inferred from the luma encoding structure or not. The flag signaling may depend on 1. A signaled message in the SPS / VPS / PPS / image header / segment header / tile group header / LCU row / LCU group / LCU / CU / video data unit. 2. The hash success ratio of IBC / Inter modes on previously encoded images / mosaic / segments / reconstructed region 3. Block dimension of the current CTU and / or its neighboring CTUs 4. Block shape of the current CTU and / or its neighboring CTUs 5. Current quantification parameter of the current CTU and / or that of its neighboring CTUs 6. Indication of the color format (such as 4:2:0, 4:4:4) 7. Segment / Tile / LCU / LCU Row / LCU Group / Video Data Unit Encoding Tree Structure Type above 8. Segment group / mosaic type and / or image type 9. Temporary layer ID 16. The move / block vector of a subblock / sample in an IBC-coded chroma block can be derived from the first available IBC-coded subregion within the co-located luma block. a. In one example, a scan order of subregions can be defined within the co-located luma block, such as the raster scan order. b. In one example, a subregion can be defined as the minimum encoding unit / minimum transform unit. c. In one example, the full sample block / movement vector in an IBC chroma mode QLC7Ln / L7n7 / E / Yli can be derived based on the movement vector of the upper leftmost sample encoded in an IBC node or intermode in the co-located luma block. 17. A motion / block vector can be signaled in IBC chroma mode. a. In one example, the difference between a motion vector and a motion vector predictor can be pointed out. i. In one example, the motion vector predictor can be derived based on the motion vectors of a co-located luma block, neighboring luma blocks of the co-located luma block, and neighboring chroma blocks of the current chroma block. 1. In one example, the motion vector / block predictor can be derived based on the motion vector of the upper left sample in the co-located luma block. 2. In one example, the motion / block vector predictor can be derived based on the sample motion vector with a central position in the co-located luma block. 3. In one example, the motion vector / block predictor can be derived based on the motion vector of the upper leftmost sample encoded in an IBC mode or intermode in the co-located luma block. i. In one example, the motion vector predictor associated with a subregion of the luma component can be scaled before being used as a predictor. In one example, the block vector can be derived from neighboring (adjacent or non-adjacent) motion vectors / chroma block vectors. b. In one example, a list of candidate block vectors can be constructed and an index to the list can be signaled. i. In one example, the candidate list may include movement vectors / block vectors of co-located luma blocks, neighboring luma blocks of co-located luma blocks, and neighboring chroma blocks. c. In one example, the indication of the AMVR flag can be inferred i. In one example, the AMVR flag indication can be inferred as false (0) in a block encoded in IBC chroma mode. ii. In one example, the motion vector difference indication can be inferred to integer precision in a block encoded in IBC chroma mode. d. In one example, a separate HMVP table can be used in IBC chroma mode. i. In one example, the size of the chroma HMVP table and the luma HMVP table may be different. e. In one example, the signaling of a block / motion vector in IBC chroma mode can be based on i. If all sub-regions within the co-located luma block are encoded with the IBC mode. 1. If yes, it is not necessary to signal the chroma block block vector. Otherwise, chroma block block vectors can be signaled. i. If all sub-regions within the co-located luma block are encoded with IBC mode and QLC7Ln / L7n7 / E / Yli all associated block vectors are valid. 1. If yes, it is not necessary to signal the chroma block block vector. Otherwise, chroma block block vectors can be signaled. iii. a signaled message in the SPS / VPS / PPS / image header / segment header / tile group header / LCU row / LCU group / LCU / CU / video data unit. iv. The hash success ratio of IBC / Inter modes on previously encoded images / mosaic / segments / reconstructed region v. Block dimension of the current CTU and / or its neighboring CTUs vi. Block shape of the current CTU and / or its neighboring CTUs vii. Current quantization parameter of the current CTU and / or its neighboring CTUs viii. Indication of the color format (such as 4:2:0, 4:4:4) ix. Encoding tree structure type of the previous segment / tile / LCU / LCU row / LCU group / video data unit x. Segment / mosaic group type and / or image type x¡. Temporal layer ID 18. Single tree and dual / separate tree selection / signaling may be at the level below CTU / CTB a. In one example, the selection / signaling of single tree and separate / dual tree may be at the VPDU level. b. In one example, single tree and separate / dual tree selection / signaling may be at a level where explicit partition tree signaling begins. The examples described above can be incorporated into the context of the methods described below, for example, methods 900, 910, 920, 930 and 940, which can be implemented in a video decoder or a video encoder. An example method for video processing includes performing a conversion between a current video block and a bitstream representation of a video comprising the current video block, wherein the conversion selectively uses a transform hopping mode for the conversion based on a flag included in the bitstream representation, and wherein, using the transform hopping mode, a residue of a prediction error of the current video block is represented in the bitstream representation without applying a transform. In some modes, the indicator is a maximum allowed width and a maximum allowed height for the transform jump mode. In some modes, the maximum allowed width and height are specified in a sequence parameter set (SPS), a video parameter set (VPS), a picture parameter set (PPS), a picture header, a segment header, a tile group header, a row of larger encoding units (LCUs), or a group of LCUs. In some models, the maximum permitted width and height are indicated in different messages. QLC7Ln / L7n7 / E / Yli In some modes, the maximum allowed width and height are signaled in a sequence parameter set (SPS) or a picture parameter set (PPS), and where an updated value of the maximum allowed width and height is signaled in a picture header, a segment header, a tile group header, a row of larger encoding units (LCUs), or a group of LCUs. Figure 9A shows a flowchart of another example method for video processing. Method 900 includes, in step 902, determining that a current video block is encoded using a transform hopping mode. Method 900 includes, in step 904, performing, based on the determination, a conversion between the current video block and a bitstream representation of a video comprising the current video block. In some modes, the current video block is divided into a plurality of coefficient groups, and the bitstream representation omits the signaling of a coded block flag for at least one of the plurality of coefficient groups. In one example, the bitstream representation omits the signaling of the coded block flag for each of the plurality of coefficient groups. In some modes, the omitted encoded block flag in the signaling in the bitstream representation is inferred based on one or more of the following: (1) a message signaled in a sequence parameter set (SPS), a video parameter set (VPS), a picture parameter set (PPS), a picture header, a segment header, a tile group header, a larger encoding unit (LCU), an LCU row, an LCU group, or an encoding unit (CU), (2) a position of at least one of the plurality of coefficient groups, (3) a block dimension of the current video block or at least one neighboring block of the current video block, (4) a block shape of the current video block or at least one neighboring block, (5) a most likely mode of the current video block or at least one neighboring block, (6) a prediction mode of at least one neighboring block,(7) an intraprediction mode of at least one neighboring block, (8) one or more motion vectors of at least one neighboring block, (9) an indication of a quantized residual block differential pulse-code modulation (QR-BDPCM) mode of at least one neighboring block, (10) a current quantization (QP) parameter of the current video block or at least one neighboring block, (11) an indication of a color format of the current video block, (12) a separate or dual encoding tree structure associated with the current video block, or (13) a segment type, a tile group type, or a picture type of the current video block. In some modes, the current video block is divided into a plurality of coefficient groups, and Method 900 further includes the step of determining a coefficient scan order for the plurality of coefficient groups. In one example, the coefficient scan order is based on a message signaled in a sequence parameter set (SPS), a video parameter set (VPS), a picture parameter set (PPS), a picture header, a segment header, a tile group header, a larger encoding unit (LCU), an LCU row, an LCU group, or an encoding unit (CU). In some modes, the number of coefficient groups or the coefficient scan order is based on the current video block's intraprediction mode. In one example, the coefficient scan order is vertical, and the intraprediction mode is horizontally dominated. In another example, the coefficient scan order is horizontal, and the intraprediction mode is horizontally dominated. For example, an intraprediction mode index ranges from 2 to 33 or from 2 to 34. In some modes, the number of coefficient groups or the coefficient scan order is based on the intraprediction mode of the current video block. In one example, the coefficient scan order is vertical, and the intraprediction mode is vertically dominated. In another example, the coefficient scan order is horizontal, and the intraprediction mode is vertically dominated. For example, an intraprediction mode index might range from 34 to 66 or from 35 to 66. In some modes, a sign flag's context is based on neighboring information in a coefficient block associated with the current video block. In one example, the sign flag's context is further based on a coefficient position within the coefficient block. In another example, the sign flag's context is based on (x+y), min(x, y), or max(x, y), where x and y are the horizontal and vertical values ​​of the coefficient position, respectively. Figure 9B shows a flowchart of yet another example method for video processing. Method 910 includes, in step 912, determining, for a current video block, which chroma transform hopping mode is applied. Method 910 includes, in step 914, performing, based on the determination, a conversion between the current video block and a bitstream representation of a video comprising the current video block. In some modes, the determination is based on a message signaled in a sequence parameter set (SPS), a video parameter set (VPS), a picture parameter set (PPS), a picture header, a segment header, a tile group header, a larger encoding unit (LCU), an LCU row, an LCU group, an encoding unit (CU), or a video data unit. In some modes, the determination is based on decoded information from one or more representative video blocks that were decoded before the conversion, and where a sample in each of the one or more representative video blocks and the current video block is based on common color information. In one example, the one or more representative video blocks comprise a luma block or a chroma block. In another example, the one or more representative video blocks comprise a block within a co-located luma block. Figure 9C shows a flowchart of yet another example method for video processing. Method 920 includes, in step 922, making a decision, during a conversion between a current video block and a bitstream representation of a video comprising the current video block, regarding a selective application of a transform jump mode to the current video block based on a condition. Method 920 includes, in step 924, performing the conversion based on the decision. In some modes, the condition is based on a message signaled in a sequence parameter set (SPS), a video parameter set (VPS), a picture parameter set (PPS), a picture header, a segment header, a tile group header, a larger encoding unit (LCU), an LCU row, an LCU group, an encoding unit (CU), or a video data unit. In some modes, the condition is based on one or more of the following: (1) a block dimension of the current video block or at least one neighboring block of the current video block, (2) a block shape of the current video block or at least one neighboring block, (3) a most probable mode of the current video block or at least one neighboring block, (4) a prediction mode of at least one neighboring block, (5) an intraprediction mode of at least one neighboring block, (6) one or more motion vectors of at least one neighboring block, (7) an indication of a quantized residual block differential pulse-code modulation (QR-BDPCM) mode of at least one neighboring block, (8) a current quantization (QP) parameter of the current video block or at least one neighboring block, (9) an indication of a color format of the current video block,(10) a separate or dual encoding tree structure associated with the current video block, (11) a segment type, tile group, or picture type of the current video block, or (12) a temporal layer identification (ID). In some modes, the transform hopping mode is applied, a prediction mode for the current video block is an inter-block copy (IBC) mode, and the width or height of the current video block is compared to a threshold. In one example, the threshold is signaled in the bitstream representation. In another example, the threshold is 4, 8, 16, or 32. In yet another example, the threshold is based on one or more of the following: (1) a signaled message in a sequence parameter set (SPS), a video parameter set (VPS), a picture parameter set (PPS), a picture header, a segment header, a tile group header, a larger encoding unit (LCU), an LCU row, an LCU group, or an encoding unit (CU), (2) a temporal layer identification (ID), (3) a block dimension of the current video block or at least one neighboring block of the current video block, (4) a block shape of the current video block or at least one neighboring block, (5) a most probable mode of the current video block or at least one neighboring block, (6) a prediction mode of at least one neighboring block, (7) an intraprediction mode of at least one neighboring block, (8) one or more motion vectors of at least one neighboring block,(9) an indication of a quantized residual block differential pulse-code modulation (QR-BDPCM) mode of at least one neighboring block, (10) a current quantization (QP) parameter of the current video block or at least one neighboring block, (11) an indication of a color format of the current video block, (12) a separate or dual encoding tree structure associated with the current video block, or (13) a segment type, tile group type, or picture type of the current video block. Figure 9D shows a flowchart of yet another example method for video processing. Method 930 includes, in step 932, making a decision, during a conversion between a current video block and a bitstream representation of a video comprising the current video block, regarding a selective application of quantized residual block differential pulse-code modulation (QR-BDPCM) based on an indication of a transform hopping mode in the bitstream representation. Method 930 includes, in step 934, performing the conversion based on the decision. In some modes, the transform jump mode indication is signaled at a transform unit (TU) level. Figure 9E shows a flowchart of yet another example method for video processing. Method 940 includes, in step 942, making a decision, during a conversion between an actual video block and a bitstream representation of a video comprising the actual video block, regarding selective application of a separate or double tree based on a condition. Method 940 includes, in step 944, performing the conversion based on the decision. In some modes, the condition is based on a message signaled in a sequence parameter set (SPS), a video parameter set (VPS), a picture parameter set (PPS), a picture header, a segment header, a tile group header, a larger encoding unit (LCU), an LCU row, an LCU group, an encoding unit (CU), or a video data unit. In some modes, the condition is based on determining whether a segment, tile, larger encoding unit (LCU), LCU row, LCU group, or video data unit comprising the current video block is screen content. In one example, the determination is based on one or more of the following: (1) a message signaled in a sequence parameter set (SPS), video parameter set (VPS), picture parameter set (PPS), picture header, segment header, tile group header, the LCU, LCU row, LCU group, encoding unit (CU), or video data unit, (2) a block dimension of the current video block or at least one neighboring block of the current video block, (3) a block shape of the current video block or at least one neighboring block, (4) a current quantization parameter (QP) of the current video block or at least one neighboring block.(5) an indication of a color format of the current video block, (6) a separate or dual encoding tree structure associated with the current video block, (7) a segment type, tile group type, or picture type of the current video block, or (8) a temporal layer identification (ID). Figure 10 is a block diagram of a video processing device 1000. The device 1000 can be used to implement one or more of the methods described herein. The device 1000 can be incorporated into a smartphone, tablet, computer, Internet of Things (IoT) receiver, etc. The device 1000 may include one or more processors 1002, one or more memories 1004, and video processing hardware 1006. The processor(s) 1002 can be configured to implement one or more methods (including, but not limited to, methods 900, 910, 920, 930, and 940) described herein. The memory(s) 1004 can be used to store data and code used to implement the methods and techniques described herein. The 1006 video processing hardware can be used to implement, in hardware circuits, some of the techniques described in this document. In some modalities, video coding methods can be implemented using an apparatus that is implemented on a hardware platform as disclosed with respect to Figure 10. In some modalities, for example, described in items 5 and 10 and following above, a video processing method includes determining whether the intrablock copy mode is applicable or not for a conversion between an actual video block of a video and a bitstream representation based on a type of encoding tree structure corresponding to the actual video block; and performing the conversion based on the determination. In the previous method, the bitstream representation excludes an indication of the intra-block copy mode. In other words, the bitstream does not carry explicit IBC mode signaling. In the above method, the type of encoding tree structure is a dual encoding tree structure and the determination is that the intrablock copy mode is not applicable. Figure 11 is a block diagram showing an example 1100 video processing system in which various techniques described herein can be implemented. Different implementations may include some or all of the components of the 1100 system. The 1100 system may include input 1102 for receiving video content. The video content may be received in a raw or uncompressed format, for example, 8- or 10-bit multi-component pixel values, or it may be in a compressed or encoded format. Input 1102 may represent a network interface, a peripheral bus interface, or a storage interface. Examples of network interfaces include wired interfaces such as Ethernet, passive optical network (PON), etc., and wireless interfaces such as Wi-Fi or cellular interfaces. The 1100 system may include an encoding component 1104 that can implement the various encoding or coding methods described herein. The encoding component 1104 can reduce the average video bitrate from input 1102 to the output of the encoding component 1104 to produce an encoded representation of the video. Therefore, encoding techniques are sometimes called video compression or video transcoding techniques. The output of the encoding component 1104 can be stored or transmitted over a connected communication, as represented by component 1106. The stored or transmitted (or encoded) bitstream representation of the video received at input 1102 can be used by component 1108 to generate pixel values ​​or viewable video that is sent to a display interface 1110.The process of generating user-viewable video from a bitstream representation is sometimes called video decompression. Furthermore, while certain video processing operations are referred to as encoding operations or tools, it's worth noting that encoding tools or operations are used in an encoder, and the corresponding decoding tools or operations that reverse the encoding results are performed by a decoder. Examples of peripheral bus interfaces or display interfaces include Universal Serial Bus (USB), High-Definition Multimedia Interface (HDMI), DisplayPort, and others. Examples of storage interfaces include SATA (Serial Advanced Technology Junction), PCI, IDE, and similar interfaces. The techniques described herein can be incorporated into various electronic devices such as mobile phones, laptops, smartphones, and other devices capable of digital data processing and / or video display. Figure 12 is a flowchart of an example method for encoding visual media. The steps in this flowchart are discussed in relation to Example Mode 1 discussed in Section 4 of this document. In step 1202, the process determines, for encoding one or more video blocks in a video region of visual media data into a bitstream representation of the visual media data, a maximum allowable dimension up to which a current video block of the one or more video blocks is permitted to be encoded using a transform hopping mode so that a remainder of a prediction error between the current video block and a reference video block is represented in the bitstream representation without applying a transform. In step 1204, the process includes a syntax element indicative of the maximum allowable dimension in the bitstream representation. Figure 13 is a flowchart of an example method for decoding visual media. The steps in this flowchart are discussed in relation to Example Mode 1 discussed in Section 4 of this document. In step 1302, the process analyzes a syntax element of a bitstream representation of visual media data comprising a video region comprising one or more video blocks, wherein the syntax element is indicative of a maximum allowable dimension up to which the current video block of one or more blocks of a video region is permitted to be encoded using a transform hopping mode in which a residue of a prediction error between the current video block and a reference video block in the bitstream representation is represented without applying a transform.In step 1304, the process generates a decoded video region from the bitstream representation by decoding one or more video blocks according to the maximum allowed dimension. Figure 14 is a flowchart of an example method for visual media processing. The steps in this flowchart are discussed in relation to Example Mode 2 discussed in Section 4 of this document. In step 1402, the process determines that an actual video block of visual media data is encoded using a transform hopping mode. In step 1404, the process performs, based on this determination, a conversion between the actual video block and a bitstream representation of the visual media data, wherein, during the conversion, the actual video block is divided into a plurality of coefficient groups and the signaling of an encoded block flag is excluded for at least one of the plurality of coefficient groups in the bitstream representation, wherein, in the transform hopping mode, a residue is represented QLC7Ln / L7n7 / E / Yli of a prediction error between the current video block and a reference video block in the bitstream representation without applying a transformation. Figure 15 is a flowchart of an example method for visual media processing. The steps in this flowchart are discussed in relation to Example Mode 3 discussed in Section 4 of this document. In step 1502, the process determines that a current video block of visual media data is encoded using a transform hopping mode.In step 1504, the process performs, based on the determination, a conversion between the current video block and a bitstream representation of the visual media data, wherein, during the conversion, the current video block is divided into a plurality of coefficient groups, wherein, in transform hop mode, a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation without applying a transformation, and further wherein, during the conversion, a coefficient scan order of the plurality of coefficient groups is determined based, at least in part, on an indication in the bitstream representation. Figure 16 is a flowchart of an example method for encoding visual media. The steps in this flowchart are discussed in relation to Example Mode 4 discussed in Section 4 of this document. In step 1602, the process uses, to encode a current video block in a video region of visual media data into a bitstream representation of the visual media data, a transform hopping mode in which a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation without applying a transform. In step 1604, the process selects a sign flag context from the current video block according to sign flags of one or more neighboring video blocks in a coefficient group associated with the current video block based on the division of the current video block into a plurality of coefficient groups.Figure 17 is a flowchart of an example method for decoding visual media. The steps in this flowchart are discussed in relation to Example Mode 4 discussed in Section 4 of this document. In step 1702, the process analyzes a bitstream representation of visual media data comprising a video region comprising a current video block to identify a sign flag context used in a transform hop mode in which a prediction error residue between the current video block and a reference video block is represented in the bitstream representation without applying a transform.In step 1704, the process generates the decoded video region from the bitstream representation so that the sign flag context is in accordance with sign flags of one or more neighboring video blocks in a coefficient group associated with the current video block based on the division of the current video block into a plurality of coefficient groups. Figure 18 is a flowchart of an example method for visual media processing. In step 1802, the process determines a current coefficient position associated with a current video block of visual media data when the current video block is divided into a plurality of coefficient positions. In step 1804, the process derives, based at least on sign flags of one or more neighboring coefficients, a sign flag context for the current coefficient. In step 1806, the process generates, based on the context, a sign flag for the current coefficient, wherein the sign flag of the current coefficient is used in a transform-jump mode in which the current video block is encoded without applying a transform. Figure 19 is a flowchart of an example method for encoding visual media. The steps in this flowchart are discussed in relation to Example Mode 5 discussed in Section 4 of this document. In step 1902, the process determines, to encode one or more video blocks in a video region of visual media data into a bitstream representation of the visual media data, based on the satisfaction of at least one rule that a chroma transform hopping mode is applicable to a current video block, wherein, in the chroma transform hopping mode, a residual of a prediction error between the current video block and a reference video block is represented in the bitstream representation of the visual media data without applying a transform.In step 1904, the process includes a syntax element indicative of the chroma transformation jump mode in the bitstream representation. Figure 20 is a flowchart of an example method for decoding visual media. The steps in this flowchart are discussed in relation to Example Mode 5 discussed in Section 4 of this document. In step 2002, the process parses a syntax element of a bitstream representation of visual media data comprising a video region consisting of one or more video blocks that satisfy at least one rule associated with applying a chroma transform hopping mode, wherein, in the chroma transform hopping mode, a residual of a prediction error between the current video block and a reference video block is represented in the bitstream representation of the visual media data without applying a transform. In step 2004, the process generates a decoded video region from the bitstream representation by decoding the one or more video blocks. Figure 21 is a flowchart of an example method for encoding visual media. The steps in this flowchart are discussed in relation to Example Mode 6 discussed in Section 4 of this document. In step 2102, the process makes a decision to encode one or more video blocks in a video region of visual media data into a bitstream representation of the visual media data, with respect to a selective application of a transform-hopping mode to the current video block based on a condition. In step 2104, the process includes a syntax element indicative of the condition in the bitstream representation, where, in transform-hopping mode, a residual of a prediction error between the current video block and a reference video block is represented in the bitstream representation of the visual media data without applying a transformation. Figure 22 is a flowchart of an example method for decoding visual media. The steps in this flowchart are discussed in relation to Example Mode 6 discussed in Section 4 of this document. In step 2202, the process parses a syntax element of a bitstream representation of visual media data comprising a video region consisting of one or more video blocks, wherein the syntax element is indicative of a condition related to the use of a transform hopping mode in which a prediction error residue between the current video block and a reference video block in the bitstream representation is represented without applying a transform. In step 2204, the process generates a decoded video region from the bitstream representation by decoding the one or more video blocks according to the condition. Figure 23 is a flowchart of an example method for encoding visual media. The steps in this flowchart are discussed in relation to Example Modality 8, which is discussed in Section 4 of this document.In step 2302, the process makes a decision to encode one or more video blocks in a video region of visual media data into a bitstream representation of the visual media data, with respect to a selective application of the quantized residual block differential pulse-code modulation (QR-BDPCM) technique based on an indication of a transform hopping mode in the bitstream representation, wherein, in the transform hopping mode, a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation of the visual media data without applying a transformation, wherein, in the QR-BDPCM technique, the residue of the prediction error is quantized and encoded by entropy in a horizontal and / or vertical direction.In step 2304, the process includes, in the bitstream representation, an indication of the selective application of the QR-BDPCM technique. Figure 24 is a flowchart of an example method for decoding visual media. The steps in this flowchart are discussed in relation to Example Modality 8, which is discussed in Section 4 of this document.In step 2402, the process analyzes a syntax element of a bitstream representation of visual media data comprising a video region comprising one or more video blocks, wherein the syntax element is indicative of a selective application of the quantized residual block differential pulse-code modulation (QR-BDPCM) technique based on an indication of a transform hopping mode in the bitstream representation, wherein, in the transform hopping mode, a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation of the visual media data without applying a transformation, wherein, in the QR-BDPCM technique, the residue of the prediction error is quantized and encoded in a horizontal and / or vertical direction.In step 2404, the process generates a decoded video region from the bitstream representation by decoding one or more video blocks according to the maximum allowed dimension. Figure 25 is a flowchart of an example method for encoding visual media. The steps in this flowchart are discussed in relation to Example Modality 9, discussed in Section 4 of this document. In step 2502, the process makes a decision to encode one or more video blocks in a region of visual media data into a stream representation of QLCZLn / LZnZ / E / Yli bits of the visual media data, with respect to a selective application of a separate or dual tree based on a condition. In step 2504, the process includes a syntax element indicative of the selective application of the separate or dual tree to the bitstream representation. Figure 26 is a flowchart of an example method for decoding visual media. The steps in this flowchart are discussed in relation to Example Modality 9 discussed in Section 4 of this document. In step 2602, the process parses a syntax element of a bitstream representation of visual media data comprising a video region comprising one or more video blocks, wherein the syntax element is indicative of a selective application of a separate or dual tree based on or inferred from a condition. In step 2604, the process generates a decoded video region from the bitstream representation by decoding the one or more video blocks according to the syntax element. Some forms of this document are now presented in a clause-based format. A1. A method for encoding visual media, comprising: To determine, for encoding one or more video blocks in a video region of visual media data into a bitstream representation of the visual media data, a maximum allowable dimension up to which an actual video block of the one or more video blocks is allowed to be encoded using a transform hopping mode so that a residue of a prediction error between the actual video block and a reference video block is represented in the bitstream representation without applying a transform; and to include a syntax element indicative of the maximum allowable dimension in the bitstream representation. A2. A method for decoding visual media, comprising: analyzing a syntax element of a bitstream representation of visual media data comprising a video region comprising one or more video blocks, wherein the syntax element is indicative of a maximum allowable dimension up to which the current video block is allowed to be encoded from one or more blocks of a video region using a transform hopping mode in which a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation without applying a transform; and generating a decoded video region from the bitstream representation by decoding the one or more video blocks according to the maximum allowable dimension. A3. The method of any one or more of clauses A1-A2, wherein the maximum allowable dimension includes a maximum allowable width and a maximum allowable height associated with the transform jump mode. A4. The method of clause A3, wherein the maximum allowable width and height are signaled in a sequence parameter set (SPS), a video parameter set (VPS), a picture parameter set (PPS), a picture header, a segment header, a tile group header, a row of larger encoding units (LCUs), or a group of LCUs. A5. The method of any one or more of clauses A1-A3, where the maximum width The allowed QLCZLn / LZnZ / E / YU and the maximum allowed height are signaled in different messages in the bitstream representation. A6. The method of any one or more of clauses A1-A2, wherein the initial values ​​of the maximum allowable width and maximum allowable height are signaled in a sequence parameter set (SPS) or a picture parameter set (PPS), and further wherein the updated values ​​of the maximum allowable width and maximum allowable height are signaled in a picture header, a segment header, a tile group header, a row of larger encoding units (LCUs), or a group of LCUs. A7. The method of any one or more of clauses A2-A6, wherein generating the decoded video region comprises decoding one or more video blocks without using the transform hopping mode. A8. The method of any one or more of clauses A2-A6, wherein the generation of the decoded video region comprises decoding one or more video blocks based on the use of the transform hopping mode. A9. A method for processing visual media, comprising: determining that a current video block of visual media data is encoded using a transform hopping mode; and performing, based on the determination of, a conversion between the current video block and a bitstream representation of the visual media data, wherein, during the conversion, the current video block is divided into a plurality of coefficient groups and the signaling of an encoded block flag is excluded for at least one of the plurality of coefficient groups in the bitstream representation, wherein, in the transform hopping mode, a residue of a prediction error is represented between the current video block and a reference video block in the bitstream representation without applying a transformation. A10. The method of clause A9, wherein the signaling of a coded block flag for each of the plurality of coefficient groups is excluded in the bitstream representation. A11. The method of any one or more of clause A9-A10, wherein the encoded block flag for the plurality of excluded coefficient groups in the bitstream representation is inferred as a fixed value. A12. The method of clause A11, where the fixed value is one. A13. The method of any or more of clauses A9-A12, further comprising: Based on a prediction mode of the current video block, make a determination to selectively activate or deactivate the coded block flag signaling for the plurality of coefficient groups. A14. The method of clause A13, wherein, if the prediction mode is an intraprediction mode, the coded block flag signaling for the plurality of coefficient groups is excluded in the bitstream representation. Q LC7 LO / L7A7 / B / YI A15. The method of any one or more of clauses A9-A14, wherein the excluded encoded block flag in the signaling in the bitstream representation is inferred on the basis of one or more of the following: (1) a signaled message in a sequence parameter set (SPS), a video parameter set (VPS), a picture parameter set (PPS), a picture header, a segment header, a tile group header, a larger encoding unit (LCU), an LCU row, an LCU group, or an encoding unit (CU), (2) a position of at least one of the plurality of coefficient groups, (3) a block dimension of the current video block or at least one neighboring block of the current video block, (4) a block shape of the current video block or the at least one neighboring block, (5) a most probable mode of the current video block or the at least one neighboring block, (6) a prediction mode of the at least one neighboring block, (7) an intraprediction mode of the at least one neighboring block, (8) one or more motion vectors of the at least one neighboring block,(9) an indication of a quantized residual block differential pulse-code modulation (QR-BDPCM) mode of at least one neighboring block, (10) a current quantization (QP) parameter of the current video block or at least one neighboring block, (11) an indication of a color format of the current video block, (12) a separate or dual encoding tree structure associated with the current video block, or (13) a segment type, tile group type, or picture type of the current video block. A16. A method for processing visual media, further comprising: determining that a current video block of visual media data is encoded using a transform hopping mode; and performing, based on the determination, a conversion between the current video block and a bitstream representation of the visual media data, wherein, during the conversion, the current video block is divided into a plurality of coefficient groups, wherein, in the transform hopping mode, a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation without applying a transformation, and further wherein, during the conversion, a coefficient scan order of the plurality of coefficient groups is determined based, at least in part, on an indication in the bitstream representation. A17. The method of clause A16, wherein the coefficient scan order is based on a message signaled in a sequence parameter set (SPS), a video parameter set (VPS), a picture parameter set (PPS), a picture header, a segment header, a tile group header, a larger encoding unit (LCU), a row LCU, a group of LCUs or a coding unit (CU). A18. The method of clause A17, wherein, in transform jump mode, the plurality of coefficient groups or coefficient scan order is based on an intraprediction mode of the current video block. A19. The method of clause A18, wherein the coefficient scan order is vertical, and wherein the intraprediction mode is horizontally dominated. A20. The method of clause A18, wherein the coefficient scan order is horizontal and the intraprediction mode is horizontally dominated. A21. The method of any one or more of clauses A19-A20, wherein an index of the intraprediction mode ranges from 2 to 33 or from 2 to 34. A22. The method of clause A18, wherein the coefficient scan order is vertical, and wherein the intraprediction mode is vertically dominated. A23. The method of clause A18, wherein the coefficient scan order is horizontal and the intraprediction mode is vertically dominated. A24. The method of any one or more of clauses A22-A23, wherein an index of the intraprediction mode ranges from 34 to 66 or from 35 to 66. A25. The method of any one or more of clauses A9-A24, wherein the conversion includes generating the bitstream representation from the current video block. A65. The method of any one or more of clauses A9-A24, wherein the conversion includes generating pixel values ​​of the current video block from the bitstream representation. C1. A method for encoding visual media, comprising: to determine, to encode one or more video blocks in a video region of visual media data into a bitstream representation of the visual media data, based on the satisfaction of at least one rule that a chroma transform hopping mode is applicable in a current video block, wherein, in the chroma transform hopping mode, a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation of the visual media data without applying a transformation; and to include a syntax element indicative of the chroma transform hopping mode in the bitstream representation. C2. A method for decoding visual media, comprising: analyzing a syntax element of a bitstream representation of visual media data comprising a video region comprising one or more video blocks that satisfies at least one rule associated with the application of a chroma transform hopping mode, wherein, in the chroma transform hopping mode, a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation of the visual media data without applying a transformation; and generating a decoded video region from the bitstream representation by decoding the one or more video blocks. C3. The method of any one or more of clauses C1-C2, wherein the determination is based on a message signaled in a sequence parameter set (SPS), a video parameter set (VPS), a picture parameter set (PPS), a picture header, a segment header, a tile group header, a larger encoding unit (LCU), an LCU row, an LCU group, an encoding unit (CU), or a video data unit associated with a bitstream representation of the visual media data. C4. The method of any one or more of clauses C2-C3, wherein the determination is based on decoded information from one or more representative video blocks decoded prior to conversion, and wherein a sample in each of the one or more representative video blocks and the current video block is based on a common color component. C5. The method of clause C4, wherein the one or more representative video blocks comprise a luma block or a chroma block. C6. The method of clause C4, wherein the one or more representative video blocks comprise a block within a co-located luma block. C7. The method of clause C4, wherein the current video block is a current chroma block, and wherein the one or more representative video blocks comprise a chroma block neighboring the current chroma block. C8. The method of clause C4, wherein the current video block is a current chroma block, and wherein the one or more representative video blocks comprise a block covering a corresponding luma sample of a central chroma sample within the current chroma block. C9. The method of clause C4, wherein the current video block is a current chroma block, and wherein the one or more representative video blocks comprise a block covering a corresponding luma sample of a lower right chroma sample within the current chroma block. D1. A method for encoding visual media, comprising: to make a decision to encode one or more video blocks in a video region of visual media data into a bitstream representation of the visual media data, with respect to a selective application of a transform hopping mode to the current video block based on a condition; and to include a syntax element indicative of the condition in the bitstream representation, wherein, in the transform hopping mode, a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation of the visual media data without applying a transform. D2. A method for decoding visual media, comprising: analyzing a syntax element of a bitstream representation of visual media data comprising a video region comprising one or more video blocks, wherein the syntax element is indicative of a condition related to the use of a transform hopping mode in which a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation without applying a transform; and generating a decoded video region from the bitstream representation by decoding the one or more video blocks according to the condition. D3. The method of clause D1, wherein the syntax element is pointed to in a sequence parameter set (SPS), a video parameter set (VPS), a picture parameter set (PPS), a picture header, a segment header, a tile group header, a larger encoding unit (LCU), an LCU row, an LCU group, an encoding unit (CU), or a video data unit. D4. The method of any one or more of clauses D1-D3, wherein the condition is based on one or more of the following: (1) a block dimension of the current video block or at least one neighboring block of the current video block, (2) a block shape of the current video block or at least one neighboring block, (3) a most probable mode of the current video block or at least one neighboring block, (4) a prediction mode of at least one neighboring block, (5) an intraprediction mode of at least one neighboring block, (6) one or more motion vectors of at least one neighboring block, (7) an indication of a quantized residual block differential pulse-code modulation (QR-BDPCM) mode of at least one neighboring block, (8) a current quantization parameter (QP) of the current video block or at least one neighboring block, (9) an indication of a color format of the current video block, (10) a separate or dual encoding tree structure associated with the current video block, (11) a segment type,a tile group type or image type of the current video block; or (12) a temporary layer identification (ID). D5. The method of clause D4, wherein the transform hopping mode is applied when a prediction mode of the current video block is an interblock copy (IBC) mode, and further wherein a width or height of the current video block satisfies a threshold. D6. The method of clause D5, where the threshold is signaled in the bitstream representation. D7. The method of clause D6, where a threshold value is 4, 8, 16 or 32. D8. The method of any one or more of clauses D5-D7, wherein the threshold is based on one or more of the following: (1) a signaled message in a sequence parameter set (SPS), a video parameter set (VPS), a picture parameter set (PPS), a picture header, a segment header, a tile group header, a larger encoding unit (LCU), an LCU row, an LCU group, or an encoding unit (CU), (2) a temporal layer identification (ID), (3) a block dimension of the current video block or at least one neighboring block of the current video block, (4) a block shape of the current video block or at least one neighboring block, (5) a most probable mode of the current video block or at least one neighboring block, (6) a prediction mode of at least one neighboring block, (7) an intraprediction mode of at least one neighboring block, (8) one or more motion vectors of at least one neighboring block,(9) an indication of a quantized residual block differential pulse-code modulation (QR-BDPCM) mode of at least one neighboring block, (10) a current quantization (QP) parameter of the current video block or at least one neighboring block, (11) an indication of a color format of the current video block, (12) a separate or dual encoding tree structure associated with the current video block, or (13) a segment type, tile group type, or picture type of the current video block. E1. A method for encoding visual media, comprising: making a decision to encode one or more video blocks in a video region of visual media data into a bitstream representation of the visual media data, with respect to a selective application of the Quantized Residual Block Differential Pulse Code Modulation (QR-BDPCM) technique based on an indication of a transform hopping mode in the bitstream representation, wherein, in the transform hopping mode, a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation of the visual media data without applying a transformation, wherein, in the QR-BDPCM technique, the residue of the prediction error is quantized and encoded by entropy in a horizontal and / or vertical direction; and which includes, in the bitstream representation, an indication of the selective application of the QR-BDPCM technique. E2. A method for decoding visual media, comprising: analyzing a syntax element of a bitstream representation of visual media data comprising a video region comprising one or more video blocks, wherein the syntax element is indicative of a selective application of the Quantized Residual Block Differential Pulse Code Modulation (QR-BDPCM) technique based on an indication of a transform hopping mode in the bitstream representation, wherein, in the transform hopping mode, a prediction error residue between the current video block and a reference video block is represented in the bitstream representation of the visual media data without applying a transformation, wherein, in the QR-BDPCM technique, the prediction error residue is quantized and encoded in a horizontal and / or vertical direction; and QLCZLn / LZnZ / E / Yli generate a decoded video region from the bitstream representation by decoding one or more video blocks according to the maximum allowed dimension. E3. The method of any one or more of clauses E1-E2, wherein the transform hop mode indication is signaled at a transform unit (TU) level associated with the current video block. E4. The method of any one or more of clauses E1-E3, wherein, in the bitstream representation, the syntax element indicative of the application of the QR-BDPCM technique in the current video block is included after the transform hop mode indication. E5. The method of clause E4, wherein a first flag is used in the bitstream representation to indicate the transform hopping mode and a second flag is used in the bitstream representation to indicate the selective application of the QR-BDPCM technique. E6. The method of clause E5, wherein a third flag is used to indicate the application of a type QR-BDPCM technique based on the horizontal prediction direction and a fourth flag is used to indicate the application of type QR-BDPCM technique based on the vertical prediction direction. E7. The method of clause E5, where a value of the second flag is inferred from a value of the first flag. E8. The method of clause E5, wherein a value of the first flag is not signaled and is inferred from a value of the second flag. E9. The method of clause E8, where the value of the first flag is not stated and is inferred as true, when the value of the second flag is true. E10. The method of clause E7, wherein the first flag and the second flag take Boolean values, which further comprise: By determining that the value of the first flag is a true boolean, the value of the second flag is inferred as a true boolean. E11. The method of clause E7, wherein the first flag and the second flag take Boolean values, which further comprise: By determining that the value of the first flag is a false boolean, infer the value of the second flag as a false boolean. F1. A method for encoding visual media, comprising: to make a decision, to encode one or more video blocks in a video region of visual media data into a bitstream representation of the visual media data, with respect to a selective application of a separate or dual tree based on a condition; and to include a syntax element indicative of the selective application of the separate or dual tree to the bitstream representation. F2. A method for decoding visual media, comprising: analyzing a syntax element of a bitstream representation of visual media data comprising a video region comprising one or more video blocks, wherein the syntax element is indicative of a selective application of a separate or dual tree based on or inferred from a condition; and generating a decoded video region from the bitstream representation by decoding the one or more video blocks according to the syntax element. F3. The method of any one or more of clauses F1-F2, wherein the condition is based on a message signaled in a sequence parameter set (SPS), a video parameter set (VPS), a picture parameter set (PPS), a picture header, a segment header, a tile group header, a larger encoding unit (LCU), an LCU row, an LCU group, an encoding unit (CU), or a video data unit. F4. The method of any one or more of clauses F1-F2, wherein the condition is based on determining whether a segment, tile, larger encoding unit (LCU), LCU row, LCU group, or video data unit comprising the current video block is screen content. F5. The method of clause F3, where the condition includes one or more of the following: (1) a signaled message in a sequence parameter set (SPS), a video parameter set (VPS), a picture parameter set (PPS), a picture header, a segment header, a tile group header, the LCU, the LCU row, the LCU group, the encoding unit (CU), or the video data unit, (2) a block dimension of the current video block or at least one neighboring block of the current video block, (3) a block shape of the current video block or at least one neighboring block, (4) a current quantization parameter (QP) of the current video block or at least one neighboring block, (5) an indication of a color format of the current video block, (6) a separate or dual encoding tree structure associated with the current video block, (7) a segment type, a tile group type, or a picture type of the current video block; or (8) a temporal layer identification (ID). F6. A video encoding apparatus comprising a processor configured to implement a method mentioned in any one or more of clauses A1-F5. F7. A video decoding apparatus comprising a processor configured to implement a method mentioned in any one or more of clauses A1-F5. F8. A computer-readable medium having code stored therein, code that incorporates processor-executable instructions to implement a method mentioned in any one or more of clauses A1-F5. B1. A method for encoding visual media, comprising: To use, for encoding a current video block in a video region of visual media data in a bitstream representation of the visual media data, a transform hopping mode in which a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation without applying a transform; and to select a sign flag context of the current video block according to sign flags of one or more neighboring video blocks in a coefficient group associated with the current video block based on the division of the current video block into a plurality of coefficient groups. B2. A method for decoding visual media, comprising: Analyze a bitstream representation of visual media data comprising a video region comprising a current video block to identify a sign flag context used in a transform hopping mode in which a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation without applying a transform; and generate the decoded video region from the bitstream representation such that the sign flag context is in accordance with sign flags of one or more neighboring video blocks in a coefficient group associated with the current video block based on the division of the current video block into a plurality of coefficient groups. B3. The method of any one or more of clauses B1-B2, wherein the one or more video blocks neighboring the current video block include: left neighbors and / or neighbors above and / or left neighbors above and / or right neighbors above. B4. The method of any one or more of clauses B1-B3, wherein a relationship between the sign flag context of the current video block and a sign flag of one or more neighboring video blocks is expressed as: C= (L + A), where C is a context id of the sign flag context of the current video block, L is a sign flag of a left neighbor of the current video block, and A is a sign flag of a neighbor above the current video block. B5. The method of any one or more of clauses B1-B3, wherein a relationship between the sign flag context of the current video block and a sign flag of one or more neighboring video blocks is expressed as: C= (L + A*2), where C is a context id of the sign flag context of the current video block, L is a sign flag of a left neighbor of the current video block, and A is a sign flag of a neighbor above the current video block. B6. The method of any one or more of clauses B1-B3, wherein a relationship between the sign flag context of the current video block and a sign flag of one or more neighboring video blocks is expressed as: C= (L*2 + A), where C is a context id of the sign flag context of the current video block, L is a sign flag of a left neighbor of the current video block, and A is a sign flag of a neighbor above the current video block. B7. The method of any one or more of clauses B1-B3, where the context of the The sign flag of the current video block, QLC7Ln / L7n7 / E / Yli, is based on the sign flags of one or more neighboring video blocks according to the following rule: If the sign flags of a pair of neighboring video blocks are both negative, the rule specifies the selection of a first sign flag context. B8. A method for processing visual media, comprising: determine a position of a current coefficient associated with a current video block of visual media data when the current video block is split into a plurality of coefficient positions; Derive, at least on the basis of sign flags of one or more neighboring coefficients, a sign flag context for the current coefficient; and generate, on the basis of the context, a sign flag for the current coefficient, wherein the sign flag of the current coefficient is used in a transform hopping mode in which the current video block is encoded without applying a transform. B9. The method of clause B8, wherein the one or more neighbor coefficients of the current video block include: left neighbors and / or above neighbors. B10. The method of clause B8, wherein the sign flag context for the current coefficient is further based on the position of the current coefficient. B11. The method of clause B8, wherein the visual media processing comprises decoding the current video block from the bitstream representation. B12. The method of clause B8, wherein the visual media processing comprises encoding the current video block into the bitstream representation. B13. The method of any one or more of clauses B1-B3 or B8-B12, wherein the sign flag context of the current video block is based on the sign flags of one or more neighboring video blocks according to the following rule: If only one sign flag from a pair of neighboring video blocks is negative, the rule specifies the selection of a second sign flag context. B14. The method of any one or more of clauses B1-B3 or B8-B12, wherein the sign flag context of the current video block is based on the sign flags of one or more neighboring video blocks according to the following rule: If the sign flags of a pair of neighboring video blocks are both positive, the rule specifies the selection of a third sign flag context. B15. The method of any one or more of clauses B1-B3 or B8-B12, wherein the context of the sign flag of the current video block is further based on a position of a coefficient group in the plurality of coefficient groups. B16. The method of clause B10, wherein the sign flag context is based on at least one of: (x+y), min(x, y) or max(x, y), where x and y are a horizontal and a vertical value of the coefficient group position, respectively. B17. A video encoding apparatus comprising a processor configured to implement a method mentioned in any one or more of clauses B1-B16. B18. A video decoding apparatus comprising a processor configured to implement a method mentioned in any one or more of clauses B1-B16. B19. A computer-readable medium having code stored therein, code that incorporates processor-executable instructions to implement a method mentioned in any one or more of clauses B1-B19. In this document, the term “video processing” or “visual media processing” may refer to video encoding, video decoding, video compression, or video decompression. For example, video compression algorithms can be applied during the conversion of a video's pixel representation to a corresponding bitstream representation, or vice versa. The bitstream representation of a video block may, for example, correspond to bits that are contiguous or spread across different locations within the bitstream, as defined by the syntax. For instance, a macroblock may be encoded in terms of transformed and encoded error residual values, and also using bits in headers and other fields within the bitstream. From the foregoing, it will be appreciated that specific modalities of the technology described herein were presented for illustrative purposes, but various modifications can be made without departing from the scope of the invention. Therefore, the technology described herein is not limited except by the appended claims. The implementations of the subject matter and functional operations described in this patent document may be implemented in various systems, digital electronic circuits, or computer software, firmware, or hardware, including the structures described in this specification and their structural equivalents, or in combinations thereof. The implementations of the subject matter described in this specification may be implemented as one or more computer program products, that is, one or more computer program instruction modules encoded on a tangible, non-transient, computer-readable medium for execution by, or to control the operation of, a data processing apparatus.A computer-readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a material composition that produces a machine-readable propagated signal, or a combination of one or more of these. The term "data processing unit" or "data processing apparatus" includes all apparatus, devices, and machines for processing data, including, by way of example, a programmable processor, a computer, or multiple processors or computers. The apparatus may include, in addition to hardware, code that creates an execution environment for the computer program in question, for example, code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of these. A computer program (also known as a program, software, software application, script, or code) can be written in any programming language, including compiled or interpreted languages, and can be implemented in any form, including as a standalone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program can be stored in a portion of a file containing other programs or data (for example, one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (for example, files that store one or more modules, subprograms, or code snippets).A computer program can be implemented to run on one computer or on multiple computers located at one site or distributed across multiple sites and interconnected by a communication network. The processes and logic flows described in this specification can be implemented by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can also be implemented by, and the apparatus can also be implemented as, special-purpose logic circuitry, for example, an FPGA (field-programmable gate array) or an ASIC (application-specific integrated circuit). The processors suitable for running a computer program include, for example, general-purpose and special-purpose microprocessors, and one or more processors of any type of digital computer. Generally, a processor will receive instructions and data from read-only memory, random-access memory, or both. The essential elements of a computer are a processor to execute instructions and one or more memory devices to store instructions and data. Generally, a computer will also include, or be operationally coupled to receive data or transfer data to, or both, one or more mass storage devices to store data, such as magnetic, magneto-optical, or optical disks. However, a computer does not necessarily need to have these devices.Computer-readable media suitable for storing computer program instructions and data include all forms of memory devices, media, and non-volatile memory, including, for example, semiconductor memory devices such as EPROM, EEPROM, and flash memory devices. The processor and memory may be supplemented with, or incorporated into, special-purpose logic circuitry. The specification, along with the drawings, is intended to be considered as an example only, where "as an example" means an example. As used herein, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. Furthermore, the use of "or" is intended to include "and / or," unless the context clearly indicates otherwise. While this patent document contains many details, these should not be interpreted as limitations on the scope of any invention or what can be claimed, but rather as descriptions of features that may be specific to particular modalities of QLC7Ln / L7n7 / E / Yli particular inventions. Certain features disclosed in this patent document in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, several features disclosed in the context of an individual embodiment can also be implemented in multiple separate embodiments or in any suitable subcombination. Furthermore, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features of a claimed combination may in some cases be removed from the combination, and the claimed combination may be directed to a subcombination or a variation of a subcombination. Similarly, while the operations are depicted in the drawings in a particular order, this should not be construed as requiring that these operations be performed in the specific order shown or sequentially, or that all the illustrated operations be performed, to achieve the desired results. Furthermore, the separation of various system components in the embodiments described in this patent document should not be construed as requiring such separation in all embodiments. Only a few implementations and examples are disclosed, and other implementations, improvements, and variations may be made based on what is disclosed and illustrated in this patent document. 5. Additional modalities of the described technology 5.1 Dual tree related modality Changes beyond the draft provided by JVET-N1001-v7 are highlighted in bold, underlined, and italicized text. The bold, all-caps font below and elsewhere in this document indicates text that may potentially be removed from the VVC standard. 5.1.1 Modality #1 seq parameter set rbsp() { Descriptor ...... qtbtt dual tree intra flag u(1) if(qtbtt dual tree intra flag) sps asdt flag u(1) partition constraints override enabled flag u(1) ...... 5.1.2 Modality #2 7.3.2.3 RBSP Sequence Parameter Set Syntax seq parameter set rbsp() { Descriptor sps decoding parameter set id u(4) sps mmvd enabled flag u(1) if(sps mmvd enabled flag) sps fpel mmvd enabled flag u(1) sos asdt flaq udi sps triangle enabled flag u(1)} 5.1.3 Modality #3 7.3.5 Segment Header Syntax 7.3.5.1 General Segment Header Syntax slice header() { Descriptor slice pie parameter set id ue (v) if (slice type != I) {} if((weighted_pred_flag && slice_type = = P) | | (weighted bipred flag && slice type = = B))} else if (sps ¡be enabled flag) six minus max num merge cand ue (v) ifisps asdt flaq) slice asdt flaq u(1) slice qp delta se(v)} sps_asdt_flag equal to 1 specifies that the proposed method can be activated in the current sequence. Equal to 0 specifies that the proposed method cannot be activated in the current sequence. When qtbtt_dual_tree_intra_flag is not present, it is inferred to be equal to 0. `slice_asdt_flag` equal to 1 specifies that the proposed method can be activated in the current slice. Equal to 0 specifies that the proposed method cannot be activated in the current slice. When `slice_ASDT_flag` is not present, it is inferred to be equal to 0. 7.3.7.2 Coding Tree Unit Syntax coding tree unit() { Descriptor xCtb = (CtbAddrlnRs % PicWidthlnCtbsY) « CtbLog2SizeY yCtb = (CtbAddrlnRs / PicWidthlnCtbsY) « CtbLog2SizeY if(slice asdt flag) ctu dual tree intra flag ae(v) if(slice_type == I && QTBTT_DUAL_TREE_INTRA_FLAG && ctu_ dual tree intra flag) dual tree implicit qt split (xCtb, yCtb, CtbSizeY, 0) Else codenq tree(xCtb, yCtb, CtbSizeY, CtbSizeY, 1,0, 0, 0, 0, 0, SINGLE TREE)} ctu_dual_tree_intra_flag equal to 1 specifies that the current CTU employs a dual tree encoding structure. Equal to 0 specifies that the current CTU employs a single tree encoding structure. When ctu_dual_tree_intra_flag is not present, it is inferred to be equal to 0. 5.1.4 Modality #4 7.3.5 Segment Header Syntax 7.3 .5.1 General segment header syntax slice header() { Descriptor slice pie parameter set id ue (v) if (slice type != I) {} if((weighted_pred_flag && slice_type = = P) 11 (weighted bipred flag && slice type = = B))} else if (sps ¡be enabled flag) six minus max num merge cand ue (v) if(sps asdt flag && qtbtt dual tree intra flag) slice asdt flag u(1) slice qp delta se(v) ) sps_asdt_flag equal to 1 specifies that the proposed method can be activated in the current sequence. Equal to 0 specifies that the proposed method cannot be activated in the current sequence. When qtbtt_dual_tree_intra_flag is not present, it is inferred to be equal to 0. `slice_asdt_flag` equal to 1 specifies that the proposed method can be activated in the current slice. Equal to 0 specifies that the proposed method cannot be activated in the current slice. When `slice_ASDT_flag` is not present, it is inferred to be equal to 0. 7.3.7.2 Coding Tree Unit Syntax coding tree unit() { Descriptor xCtb = (CtbAddrlnRs % PicWidthlnCtbsY) « CtbLog2SizeY yCtb = (CtbAddrlnRs / PicWidthlnCtbsY) « CtbLog2SizeY if(slice asdt flag) ctu dual tree intra flag ue (v) if(slice type = = I && qtbtt dual tree intra flag && ctu dual tree intra flag) dual tree implicit qt split (xCtb, yCtb, CtbSizeY, 0) else coding_tree(xCtb, yCtb, CtbSizeY, CtbSizeY, 1, 0, 0, 0, 0, 0, SINGLE TREE)} Q LC7 LO / ίZΖΠZ / Β / YΙΛΙ ctu_ dual_tree_intra_flag equal to 1 specifies that the current CTU employs a dual tree encoding structure. Equal to 0 specifies that the current CTU employs an individual tree encoding structure. When ctu_dual_tree_intra_flag is not present, it is inferred to be equal to 0. 5.2 Modality related to IBC 7.3.7.5 Coding Unit Syntax coding unit(x0, yO, cbWidth, cbHeight, treeType) { Descriptor if(slice type != I | | sps ¡be enabled flag) { if(treeType != DUALTREECHROMA ¡(cbWidth = = 4 && cbHeight = = 4 && Isps ¡be enabled flag)) && cu skip flag[x0][y01 ae(v) f(cu_skip_flag[xO][yO] = = 0 && slice_type && !(cbWidth = = 4 && cbHeight = = 4)) != I pred mode flag ae(v) if(((slice_type = = I && cu_skip_flag[x0][y0] = =0) | | (slice_type != I && (CuPredMode[x0][y0] != MODEJNTRA | | (cbWidth = = 4 && cbHeight = = 4 && cu_skip_flag[xO][yO] = = 0)))) && sps_ibc_enabled_flag && (cbWidth != 128 || cbHeight != 128) && (treeType != DUAL TREE CHROMA) pred mode ibe flag ae(v)} ) 8.6 Decoding process for IBC prediction-mode encoded coding units 8.6.1 General decoding process for IBC prediction-mode encoded coding units The inputs for this process are: a luma location (xCb, yCb) that specifies the top-left sample of the current encoding block with respect to the top-left luma sample of the current image, a cbWidth variable that specifies the width of the current encoding block in luma samples, a cbHeight variable that specifies the height of the current encoding block in luma samples, a treeType variable that specifies whether a single or dual tree is used and if a dual tree is used, specifies whether the current tree corresponds to the luma or chroma components. The output of this process is a reconstructed image modified before loop filtering. The derivation process for quantization parameters as 8.7.1 is specified in the clause is invoked with the luma location (xCb, yCb), the width of the current encoding block in luma samples cbWidth and the height of the current encoding block in luma samples cbHeight, and the treeType variable as inputs. The decoding process for encoding units encoded in prediction mode consists of the following steps in order: 1. The motion vector components of the current encoding unit are derived as follows: 1. IF TREETYPE IS EQUAL TO SINGLETREE OR DUALTREELUMA, THE FOLLOWING APPLIES: - The derivation process for motion vector components as specified in clause 8.6.2.1 is invoked with the luma encoding block location (xCb, yCb), the luma encoding block width cbWidth and the luma encoding block height cbHeight as inputs, and the luma motion vector mvL[0][0] as output. - When treeType is equal to SINGLE_TREE, the derivation process for chroma movement vectors in clause 8.6.2.5 is invoked with luma movement vector mvL[0][0] as input, and chroma movement vector mvC[0][0] as output. - The number of luma encoding subblocks in the horizontal direction numSbX and in the vertical direction numSbY are set equal to 1. 1. OTHERWISE, IF TREETYPE IS EQUAL TO DUAL TREE CHROMA, THE FOLLOWING APPLIES: - THE NUMBER OF LUMA CODING SUBBLOCKS IN THE HORIZONTAL DIRECTION (NUMSBX) AND IN THE VERTICAL DIRECTION (NUMSBY) WILL BE OBTAINED AS FOLLOWS: NUMSBX = (CBWIDTH » 2) (8-871) NUMSBY = (CBHEIGHT » 2) (8-872) - THE MVC[XSBIDX][YSBIDX] CHROMA MOTION VECTORS ARE DERIVED AS FOLLOWS FOR XSBIDX = 0..NUMSBX - 1, YSBIDX = 0..NUMSBY - 1: - THE LUMA MOTION VECTOR MVL[XSBIDX][YSBIDX] IS DERIVED AS FOLLOWS: - THE LOCATION (XCUY, YCUY) OF THE CO-LOCATED LUMA CODING UNIT IS DEFINED AS FOLLOWS: QLCZLn / LZnZ / E / YU XCUY = XCB + XSBIDX*4 (8-873) YCUY = YCB + YSBIDX*4 (8-874) - IF CUPREDMODE[XCUY][YCUY] IS EQUAL TO MODEINTRA, THE FOLLOWING APPLIES. MVL[XSBIDX][YSBIDX][O] = 0 (8-875) MVL[XSBIDX][YSBIDX][1] = 0 (8-876) PREDFLAGLO[XSBIDX][YSBIDX] = 0 (8-877) PREDFLAGL1[XSBIDX][YSBIDX] = 0 (8-878) - OTHERWISE (CUPREDMODE [XCUY][YCUY] IS EQUAL TO MODEIBC), THE FOLLOWING APPLIES: MVL[XSBIDX][YSBIDX][0]=MVL0[XCUY][YCUY][0] (8-879) MVL[XSBIDX][YSBIDX][1]=MVL0[XCUY][YCUY][1] (8-880) PREDFLAGLO[XSBIDX][YSBIDX] = 1 (8-881) PREDFLAGL1[XSBIDX][YSBIDX] = 0 (8-882) - THE DERIVATION PROCESS FOR CHROMA MOTION VECTORS IN CLAUSE 8.6.2.5 IS INVOKED WITH MVL[XSBIDX][YSBIDX] AS INPUTS, AND MVC[XSBIDX][YSBIDX] AS OUTPUT. - IT IS A BITFLOW CONFORMITY REQUIREMENT THAT THE MVC[XSBIDX][YSBIDX] CHROMA MOTION VECTOR OBEYS THE FOLLOWING RESTRICTIONS: - WHEN THE DERIVATION PROCESS FOR BLOCK AVAILABILITY AS SPECIFIED IN CLAUSE 6.4.X [ED. (BB): THE NEIGHBORING BLOCK AVAILABILITY VERIFICATION PROCESS TBD] IS INVOKED WITH THE CURRENT CHROMA LOCATION (XCURR, YCURR) SET EQUAL TO (XCB / SUBWIDTHC, YCB / SUBHEIGHTC) AND THE NEIGHBORING CHROMA LOCATION (XCB / SUBWIDTHC + (MVC[XSBIDX][YSBIDX][OJ » 5), YCB / SUBHEIGHTC + (MVC[XSBIDX][YSBIDX][1J » 5)) AS INPUTS, THE OUTPUT WILL BE EQUAL TO TRUE. - WHEN THE DERIVATION PROCESS FOR BLOCK AVAILABILITY AS SPECIFIED IN CLAUSE 6.4.X [ED. (BB): THE PROCESS OF VERIFYING NEIGHBOR BLOCK AVAILABILITY [TBD] IS INVOKED WITH THE CURRENT CHROMA LOCATION (XCURR, YCURR) SET EQUAL TO (XCB / SUBWIDTHC, YCB / SUBHEIGHTC) AND THE NEIGHBOR CHROMA LOCATION (XCB / SUBWIDTHC + (MVC[XSBIDX][YSBIDX][O] » 5) + CBWIDTH / SUBWIDTHC - 1, YCB / SUBHEIGHTC + (MVC[XSBIDX][YSBIDX][1] » 5) + CBHEIGHT / SUBHEIGHTC - 1) AS INPUTS, THE OUTPUT WILL BE TRUE. - ONE OR BOTH OF THE FOLLOWING CONDITIONS MUST BE MET: - (MVC[XSBIDX][YSBIDX][O] » 5) + XSBIDX * 2 + 2 IS LESS THAN OR EQUAL TO 0. - (MVC[XSBIDX][YSBIDX][1] » 5) + YSBIDX * 2 + 2 IS LESS THAN OR EQUAL TO 0. 2. The prediction samples of the current encoding unit are derived as follows: - IF TREETYPE IS EQUAL TO SINGLETREE OR DUAL TREE LUMA, THE PREDICTION SAMPLES OF THE CURRENT ENCODING UNIT ARE DERIVED AS FOLLOWS: QLC7Ln / L7n7 / E / Yli The decoding process for ibc blocks as specified in clause 8.6.3.1 is invoked with the luma encoding block location (xCb, yCb), the luma encoding block width cbWidth and the luma encoding block height cbHeight, the number of luma encoding subblocks in the horizontal direction numSbX and in the vertical direction numSbY, the luma movement vectors mvL [xSbldx] [ySbldx] with xSbldx = 0.. numSbX - 1 and ySbldx = 0.. numSbY - 1, the variable cldx set equal to 0 as inputs, and the ibc prediction samples (predSamples) which are an array (cbWidth)x(cbHeight) predSamples l of prediction luma samples as outputs. - Otherwise, if TreeType is equal to SINGLE_TREE OR DUAL_TREE_CROMA, the prediction samples for the current encoding unit are derived as follows: The ibc block decoding process as specified in clause 8.6.3.1 is invoked with the luma encoding block location (xCb, yCb), the luma encoding block width cbWidth and the luma encoding block height cbHeight, the number of luma encoding subblocks in the horizontal direction numSbX and in the vertical direction numSbY, the chroma movement vectors mvC [xSbldx] [ySbldx] with xSbldx = 0.. numSbX - 1, and ySbldx = 0.. numSbY - 1 and the variable cldx set equal to 1 as inputs, and the ibc prediction samples (predSamples) which are an array (cbWidth / 2)x(cbHeight / 2) predSamples cb of prediction chroma samples for the chroma components Cb as outputs. The decoding process for ibc blocks as specified in clause 8.6.3.1 is invoked with the luma encoding block location (xCb, yCb), the luma encoding block width cbWidth and the luma encoding block height cbHeight, the number of luma encoding subblocks in the horizontal direction numSbX and in the vertical direction numSbY, the chroma movement vectors mvC[xSbldx][ySbldx] with xSbldx = 0.. numSbX - 1 and ySbldx = 0.. numSbY - 1 and the variable cldx set equal to 2 as inputs, and the ibc prediction samples (predSamples) which are an array (cbWidth / 2)x(cbHeight / 2) predSamples cr of prediction chroma samples for the chroma components Cr as outputs. 3. The variables NumSbX[xCb][yCb] and NumSbY[xCb][yCb] are set equal to numSbX and numSbY, respectively. 4. Residual samples from the current coding unit are derived as follows: - WHEN TREETYPE IS EQUAL TO SINGLETREE OR TREETYPE IS EQUAL TO DUAL_TREE_LUMA, the decoding process for the residual signal of encoding blocks encoded in interprediction mode as specified in clause 8.5.8 is invoked with location (xTbO, yTbO) set equal to luma location (xCb, yCb), width nTbW set equal to luma encoding block width cbWidth, height nTbH set equal to luma encoding block height cbHeight and variable cldxset equal to 0 as inputs, and array resSamples l as output. - When treeType is equal to SINGLE TREE OR TREETYPE IS EQUAL TO DUAL TREE CHROMA, the decoding process for the residual signal of the encoding blocks encoded in interprediction mode as specified in clause 8.5.8 is invoked with location (xTbO, yTbO) set QLC7Ln / L7n7 / E / Yli equals the chroma location (xCb / 2, yCb / 2), the width nTbW set equal to the chroma encoding block width cbWidth / 2, the height nTbH set equal to the chroma encoding block height cbHeight / 2 and the variable cldxset equal to 1 as inputs, and the array resSamples cb as output. - When treeType is equal to SINGLETREE OR TREETYPE IS EQUAL to DUALTREECROMA, the decoding process for the residual signal of the encoding blocks encoded in interprediction mode as specified in clause 8.5.8 is invoked with location (xTbO, yTbO) set equal to chroma location (xCb / 2, yCb / 2), width nTbW set equal to chroma encoding block width cbWidth / 2, height nTbH set equal to chroma encoding block height cbHeight / 2 and cldxset variable equal to 2 as inputs, and the resSamples cr array as output. 5. The reconstructed samples of the current encoding unit are derived as follows: - WHEN TREETYPE IS EQUAL TO SINGLE TREE OR TREETYPE IS EQUAL TO DUALTREELUMA, the image reconstruction process for a color component as specified in clause 8.7.5 is invoked with block location (xB, yB) set equal to (xCb, yCb), block width bWidth set equal to cbWidth, block height bHeight set equal to cbHeight, variable cldx equal to 0, array (cbWidth)x(cbHeight) predSamples set equal to predSamples and array (cbWidth)x(cbHeight) resSamples set equal to resSamples as inputs, and the output is a reconstructed image modified before loop filtering. - When treeType is equal to SINGLE TREE OR TREETYPE IS EQUAL TO DUAL TREE CROMA, the image reconstruction process for a color component as specified in clause 8.7.5 is invoked with block location (xB, yB) set equal to (xCb / 2, yCb / 2), block width bWidth set equal to cbWidth / 2, block height bHeight set equal to cbHeight / 2, variable cldx set equal to 1, array (cbWidth / 2)x(cbHeight / 2) predSamples set equal to predSamples Cb and array (cbWidth / 2)x(cbHeight / 2) resSamples set equal to resSamples Cb as inputs, and the output is a reconstructed image modified before loop filtering. - When treeType is equal to SINGLE TREE OR TREETYPE IS EQUAL TO DUAL TREE CROMA, the image reconstruction process for a color component as specified in clause 8.7.5 is invoked with block location (xB, yB) set equal to (xCb / 2, yCb / 2), block width bWidth set equal to cbWidth / 2, block height bHeight set equal to cbHeight / 2, variable cldx set equal to 2, array (cbWidth / 2)x(cbHeight / 2) predSamples set equal to predSamples Cr and array (cbWidth / 2)x(cbHeight / 2) resSamples set equal to resSamples Cr as inputs, and the output is a reconstructed image modified before loop filtering.

Claims

1. A method for encoding visual media, comprising: using, to encode a current video block in a video region of visual media data in a bitstream representation of the visual media data, a transform hopping mode in which a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation without applying a transform; and selecting a sign flag context of the current video block according to sign flags of one or more neighboring video blocks in a coefficient group associated with the current video block based on the division of the current video block into a plurality of coefficient groups.

2. A method for decoding visual media, comprising: analyzing a bitstream representation of visual media data comprising a video region comprising a current video block to identify a sign flag context used in a transform hopping mode in which a residue of a prediction error between the current video block and a reference video block is represented in the bitstream representation without applying a transform; and generating the decoded video region from the bitstream representation such that the sign flag context is in accordance with sign flags of one or more neighboring video blocks in a coefficient group associated with the current video block based on the division of the current video block into a plurality of coefficient groups.

3. The method according to any one or more of claims 1-2, wherein the one or more video blocks neighboring the current video block include: left neighbors and / or neighbors above and / or left neighbors above and / or right neighbors above.

4. The method according to any one or more of claims 1-3, wherein a relationship between the sign flag context of the current video block and a sign flag of one or more neighboring video blocks is expressed as: C = (L + A), where C is a context id of the sign flag context of the current video block, L is a sign flag of a left neighbor of the current video block, and A is a sign flag of a neighbor above the current video block.

5. The method according to any one or more of claims 1-3, wherein a relationship between the sign flag context of the current video block and a sign flag of one or more neighboring video blocks is expressed as: C= (L + A*2), where C is a sign flag context id of the current video block, L is a sign flag of a left neighbor of the current video block, and A is a sign flag of a neighbor above the current video block.

6. The method according to any one or more of claims 1-3, wherein a relationship between the sign flag context of the current video block and a sign flag of one or more neighboring video blocks is expressed as: C= (L*2 + A), where C is a sign flag context id of the current video block, L is a sign flag of a left neighbor of the current video block, and A is a sign flag of a neighbor above the current video block.

7. The method according to any one or more of claims 1-3, wherein the sign flag context of the current video block is based on the sign flags of one or more neighboring video blocks according to the following rule: if the sign flags of a pair of neighboring video blocks are both negative, the rule specifies the selection of a first sign flag context.

8. A method for processing visual media, comprising: determining a current coefficient position associated with a current video block of visual media data when the current video block is divided into a plurality of coefficient positions; deriving, at least on the basis of sign flags of one or more neighboring coefficients, a sign flag context for the current coefficient; and generating, on the basis of the context, a sign flag for the current coefficient, wherein the sign flag of the current coefficient is used in a transform-jump mode in which the current video block is encoded without applying a transform.

9. The method according to claim 8, wherein the one or more neighbor coefficients of the current video block include: left neighbors and / or above neighbors.

10. The method according to claim 8, wherein the sign flag context for the current coefficient is further based on the position of the current coefficient.

11. The method according to claim 8, wherein the visual media processing comprises decoding the current video block from the bitstream representation.

12. The method according to claim 8, wherein the visual media processing comprises encoding the current video block into the bitstream representation.

13. The method according to any one or more of claims 1 to 3 or 8 to 12, wherein the sign flag context of the current video block is based on the sign flags of one or more neighboring video blocks according to the following rule: if only one sign flag of a pair of neighboring video blocks is negative, the rule specifies the selection of a second sign flag context.

14. The method according to any one or more of claims 1 to 3 or 8 to 12, wherein the sign flag context of the current video block is based on the sign flags of one or more neighboring video blocks according to the following rule: if the sign flags of a pair of neighboring video blocks are both positive, the rule specifies the selection of a third sign flag context.

15. The method according to any one or more of claims 1 to 3 or 8 to 12, wherein the context of the current video block sign flag is further based on a QLC7Ln / L7n7 / E / Yli position of a coefficient group in the plurality of coefficient groups.

16. The method according to claim 10, wherein the sign flag context is based on at least one of: (x+y), min(x, y) or max(x, y), where x and y are a horizontal value and a vertical value of the coefficient group position, respectively.

17. A video encoding apparatus comprising a processor configured to implement a method according to any one or more of claims 1 to 16.

18. A video decoding apparatus comprising a processor configured to implement a method according to any one or more of claims 1 to 16.

19. A computer-readable medium having code stored therein, the code incorporating processor-executable instructions to implement a method according to any one or more of claims 1 to 16.

Images