Search Results for "JVET-K031"
Found 21 document(s)
Search documents
Use number, keyword, author, or MPEG number. Filter by meeting when needed.
Not signed in yet.
Abstract
This document reports a cross-check of JVET-K0319 on TCQ with high throughput coefficient coding. The simulations were conducted using the common test conditions. The results provided by the proponents were verified.
Loading full meeting notes...
JVET-K0513 Cross-check of JVET-K0319: CE7-related: TCQ with high throughput coefficient coding [L. Zhang (Bytedance)] [late]
References:
Decisions
JVET-K0513 Cross-check of JVET-K0319: CE7-related: TCQ with high throughput coefficient coding [L. Zhang (Bytedance)] [late]
Citation
Abstract not available in document
Loading full meeting notes...
JVET-K0494 Crosscheck of JVET-K0318 (CE2-2.1.1-related: HEVC luma filters and decisions for chroma deblocking) [C.-M. Tsai (MediaTek)] [late]
References:
Decisions
JVET-K0494 Crosscheck of JVET-K0318 (CE2-2.1.1-related: HEVC luma filters and decisions for chroma deblocking) [C.-M. Tsai (MediaTek)] [late]
Citation
Abstract
A strawman design for signaling constraints in a profile_tier_level( ) syntax structure in the SPS is proposed to enable describing decoder capabilities needed to decode a bitstream. It is based upon the VTM2 design in JVET-K1001-v5. The proposed design draws from the concepts proposed in JVET-K0312, and is intended as a starting point for discussion, rather than as a fully finalized solution.
Loading full meeting notes...
JVET-L0044 AHG15: Proposed interoperability point syntax [J. Boyce, Z. Deng, S. Wong, L. Xu (Intel)]
A strawman design for signalling constraints in a profile_tier_level( ) syntax structure in the SPS is proposed to enable describing decoder capabilities needed to decode a bitstream. It is based upon the VTM2 design in JVET-K1001-v5. The proposed design draws from the concepts proposed in JVET-K0312, and is intended as a starting point for discussion, rather than as a fully finalized solution.
A user-registered subprofile value could be indicated. The proposed size for this was 8 bits (which would limit the number of subprofile values that could exist.
It was discussed that T.35 could be used for this. For example, there could be a fixed length of 4 bytes formatted using T.35 (or always 8 bytes).
It was discussed whether or not it is desirable to omit flags that are not relevant because of the values of some earlier flags.
The concept of having some constraints that apply to the whole bitstream while having lower level syntax to indicate whether a feature is being used on a more localized basis (e.g., within a CVS) was in the contribution.
References:
JVET-K0063
JVET-K0072
JVET-K0096
JVET-K0122
JVET-K0171
JVET-K0173
JVET-K0184
JVET-K0190
JVET-K0230
JVET-K0232
JVET-K0237
JVET-K0251
JVET-K0307
JVET-K0310
JVET-K0312
JVET-K0315
JVET-K0337
JVET-K0346
JVET-K0351
JVET-K0357
JVET-K0368
JVET-K0369
JVET-K0371
JVET-K0500
JVET-K0529
JVET-K0554
JVET-K0556
JVET-K1001
JVET-K1005
Cited:
Decisions
The concept of having some constraints that apply to the whole bitstream while having lower level syntax to indicate whether a feature is being used on a more localized basis (e.g., within a CVS) was in the contribution.
Citation
Abstract
This contribution proposes a requirement for VVC to enable signaling of interoperability points defined by third parties, which are subsets of the profiles & levels defined by JVET in the VVC specification. These interoperability points will be used to define decoder capabilities needed to decode a bitstream. To fulfill this requirement, syntax is proposed for profile/level signaling, including a non-normative user-registered sub-profile indicator and an extensive set of normative constraint flags to indicate disabling of tools within a profile. Tool enabling flags in sequence parameter set (SPS) may be conditionally present based upon the values of the constraint flags.
Loading full meeting notes...
JVET-K0311 Interoperability point signalling for VVC [J. Boyce (Intel), X. Ducloux (Harmonic), A. Hinds (CableLabs), S. Wenger (Tencent)]
This contribution proposed a requirement for VVC to enable signalling of interoperability points defined by third parties, which are proposed to be subsets of the profiles & levels defined by JVET in the VVC specification. These interoperability points would be used to define decoder capabilities needed to decode a bitstream. Syntax is proposed for profile/level signalling, including a non-normative user-registered sub-profile indicator and an extensive set of normative constraint flags to indicate disabling of tools within a profile. Tool enabling flags in the sequence parameter set (SPS) may be conditionally present based upon the values of the constraint flags. See the notes for the joint discussion of this contribution in section 11.5.
Software dev...
References:
Cited:
Decisions
Discussion of the contributions on this subject was allocated to a BoG (coordinated by F. Bossen) – see the notes for JVET-K0562.
Citation
Abstract
This contribution proposes additional reporting of adjusted decoder runtimes in future “tool on” and “tool off” tests, based upon the frequency of the tool usage in the coded bitstream. A proposed revision to the AHG13 tool on/off reporting template is provided, which reports the percentage of pixels directly impacted by the tool, as well as the adjusted decoder runtime. A BMS decoder software patch for two example BMS tools is also provided.
Loading full meeting notes...
JVET-K0312 AHG13: Reporting of adjusted decoder runtimes in tool on/off tests [J. Boyce, D. Gurulev, V. Aristarkhov (Intel), A. Tourapis (Apple)]
The notes and recommendation recorded for this contribution are from its review in the BoG JVET-K0562.
This contribution proposes additional reporting of adjusted decoder runtimes in future “tool on” and “tool off” tests, based upon the frequency of the tool usage in the coded bitstream. A proposed revision to the AHG13 tool on/off reporting template is provided, which reports the percentage of pixels directly impacted by the tool, as well as the adjusted decoder runtime. A BMS decoder software patch for two example BMS tools is also provided.
In the v3 version of the document, the reporting template contains data for the Affine tool for the VTM tool-on test from AHG13, and some errors in the reporting template were corrected.
Comment: Unify wi...
Cited:
Decisions
Recommendation: Add tool usage metrics to SW. SW coordinators to determine best implementation (e.g., with or without dtrace). Encourage CU-level tool proponents to add and report such metrics.
Citation
Abstract
This contribution proposes to use HEVC luma filters and decisions for chroma deblocking with some minor adaptations in decisions. For BMS it also applies deblocking of implicit TU boundaries after deblocking of sub-block boundaries from motion prediction to ensure that implicit TU boundaries can be deblocked with more than 1 pixel even when it exist sub-block boundaries 4 samples from the implicit TU boundary. The modifications are implemented on top of CE2-2.1.1.
Loading full meeting notes...
JVET-K0318 CE2-2.1.1-related: HEVC luma filters and decisions for chroma deblocking [K. Andersson, Z. Zhang, R. Sjöberg (Ericsson)]
This contribution proposes to use HEVC luma filters and decisions for chroma deblocking with some minor adaptations in decisions. For BMS it also applies deblocking of implicit TU boundaries after deblocking of sub-block boundaries from motion prediction to ensure that implicit TU boundaries can be deblocked with more than 1 pixel even when it exist sub-block boundaries 4 samples from the implicit TU boundary. The modifications are implemented on top of CE2-2.1.1.
The proposed solution is claimed to improve subjective quality especially notable for Campfire at low bit rates. It also provides a luma,Cb,Cr BD rate impact of −0.19%, −0.18%, 0.17% / −0.18%, −2.20%, −2.22% / −0.12%,−1.89%, −1.69% for AI/RA/LD compared to VTM-1.0 and −0.12%, −1.08%, −0.93% / −0.12...
References:
PATENTS:
US4638351A
0.34
1987-01-20
CN115176470B
0.32
2025-05-27
JP2024023524A
0.30
2024-02-21
JP7754907B2
0.28
2025-10-15
CN114946180A
0.26
2022-08-26
WO2021139707A1
0.24
2021-07-15
CN114982237A
0.22
2022-08-30
KR102641796B1
0.20
2024-03-04
Decisions
Further study in a CE was planned.
Citation
Abstract
Trellis coded quantization (TCQ) together with a coupled coefficient coding scheme was proposed in [1]. It may degrade CABAC throughput compared with the coefficient coding in HEVC or the current JEM design. To improve the throughput and maintain most of the gain reported in CE7 [2], this contribution proposes a modified TCQ with a coupled coefficient coding scheme. The simulation results show -3.98% AI, -2.58% RA, and -1.80% LDB BD-rate reduction compared with VTM-1.0 anchor, and -1.99% AI, -1.37% RA, and -0.98% LDB BD-rate reduction compared with BMS-1.0.
Loading full meeting notes...
JVET-K0319 CE7-related: TCQ with high throughput coefficient coding [J. Dong, M. Coban, M. Karczewicz (Qualcomm)]
This is another proposed variation of TCQ (a.k.a. dependent quantization). This was trying to combine the JEM coefficient coding with TCQ. Detailed presentation was not requested, although the proponent may wish to include it in the planned CE.
References:
PATENTS:
US20250274599A1
0.72
2025-08-28
US10904548B2
0.34
2021-01-26
US20200077117A1
0.32
2020-03-05
EP3906679A1
0.30
2021-11-10
US11134273B2
0.28
2021-09-28
US11128876B2
0.26
2021-09-21
US11451840B2
0.24
2022-09-20
CN121711481A
0.22
2026-03-20
Decisions
This is another proposed variation of TCQ (a.k.a. dependent quantization). This was trying to combine the JEM coefficient coding with TCQ. Detailed presentation was not requested, although the proponent may wish to include it in the planned CE.
Citation
Abstract
This document reports the tool-on results for Sign Data Hiding (SDH), which is included in HEVC but not included in VTM or BMS. This document also breaks out the performance gains of SDH for specific test sequence classes and encoding modes.
Loading full meeting notes...
JVET-K0310 AHG13: Sign Data Hiding [P. Yin, S. McCarthy, F. Pu, T. Lu, W. Husak, T. Chen (Dolby), T. Tsukuba (Sony)]
It was said that sign data hiding can provide 0.9% on AI and 0.7% on RA for the VTM with 3–4% encoder increase (and no decoder complexity increase). See also the AHG13 report, which indicated that the previous non-inclusion of SDH in VVC had a larger impact on coding efficiency than other removed features relative to HEVC (other having 0.4% impact or less, and in RA it was the only one with a significant impact), and had a good tradeoff of coding efficiency and complexity.
Decision: Adopt SDH into WD/VTM (can only be used when dependent quantization is disabled).
CE8 related – Current picture referencing (1)
Contributions in this category were discussed Saturday 14 July 1145 (chaired by GJS).
References:
Decisions
adopted
Adopt SDH into WD/VTM (can only be used when dependent quantization is disabled)
Citation
Abstract
The contribution proposes a method for implicitly partitioning CTUs or CUs spanning across a picture boundary. Specifically, for picture dimensions that are not an integer multiple of the CTU size, CTUs at the right and/or bottom of the picture will contain pixel regions that do not correspond to the intended, reconstructed image. In the proposed method, these CTUs undergo implicit partitioning that makes use of the available square and rectangular partitioning types until all the samples at the leaf of the partitioning tree created using implicit splits do not span across the picture boundary. The implicit splits can include both quad tree and binary tree splits. Moreover, the quad-tree splitting can be further controlled by receiving a minimum number of required quad-tree splits of the CTU within a parameter set. Experimental results show that the proposed method achieves a coding efficiency improvement of 0.23% and 0.28% relative to the VTM and BMS, respectively, using CTC random access test conditions. This includes a gain of 0.45% and 0.56%, respectively, for the Class B test sequences. In all cases, the impact on encoder run-time is measured to be in the range of 102%-106%.
Loading full meeting notes...
JVET-K0317 CE1: Implicit QT and BT Partitions on Picture Boundary (Test 2.0.14) [W. Zhu, K. Misra, A. Segall (Sharp)]
References:
Cited:
Decisions
JVET-K0317 CE1: Implicit QT and BT Partitions on Picture Boundary (Test 2.0.14) [W. Zhu, K. Misra, A. Segall (Sharp)]
Citation
Abstract
The contribution proposes a method for implicitly partitioning CTUs or CUs spanning across a picture boundary. Specifically, for picture dimensions that are not an integer multiple of the CTU size, CTUs at the right and/or bottom of the picture will contain pixel regions that do not correspond to the intended, reconstructed image. In the proposed method, these CTUs undergo implicit partitioning that makes use of the available square and rectangular partitioning types until all the samples at the leaf of the partitioning tree created using implicit splits do not span across the picture boundary. The implicit splits can include both quad tree and binary tree splits. Moreover, the quad-tree splitting can be further controlled by receiving a minimum number of required quad-tree splits of the CTU within a parameter set. Experimental results show that the proposed method achieves a coding efficiency improvement of 0.20% and 0.25% relative to the VTM and BMS, respectively, using CTC random access test conditions. This includes a gain of 0.42% and 0.54%, respectively, for the Class B test sequences. In all cases, the impact on encoder run-time is measured to be in the range of 102%-108%.
Loading full meeting notes...
JVET-K0316 CE1: Implicit QT,BT and MTT Partitions on Picture Boundary (Test 2.0.15) [W. Zhu, K. Misra, A. Segall (Sharp)]
References:
Cited:
Decisions
JVET-K0316 CE1: Implicit QT,BT and MTT Partitions on Picture Boundary (Test 2.0.15) [W. Zhu, K. Misra, A. Segall (Sharp)]
Citation
Abstract
In this proposal, it is proposed to share the same set of contexts for the BT/TT split flag for both horizontal and vertical directions. As a result, the number of contexts used for signaling the binary and triple trees is reduced from 12 context to 9 contexts. Calculation of cxIdBT and btSCtxId is unchanged, and it is asserted that the experimental results show that its impact to coding performance is negligible. Specifically:
Loading full meeting notes...
JVET-K0314 CE1 Partition Signalling Context Reduction (Test 1.0.11) [J. Zhao, W. Zhu, K. Misra, A. Segall (Sharp)]
References:
Decisions
JVET-K0314 CE1 Partition Signalling Context Reduction (Test 1.0.11) [J. Zhao, W. Zhu, K. Misra, A. Segall (Sharp)]
Citation
Abstract
The contribution proposes a deblocking process designed to reduce the blocking artifacts resulting from the use of large transforms and large block sizes. Compared to the deblocking approach in the VVC draft 1[1], the process incorporates stronger filters for both luma and chroma. Additionally, the process includes a control process that considers the block sizes on both sides of the boundary being deblocked. In the proposal, the proposed stronger filters are used for luma samples that correspond to larger block sizes, while the existing VVC deblocking filters are used for luma samples corresponding to smaller block sizes. For chroma, the stronger filter is applied when chroma samples on either sides of the deblocking boundary belong to a large block. It is asserted that the proposed deblocking approach improves subjective quality at low bit-rates when compared with the deblocking process existing in the VTM software.
Loading full meeting notes...
JVET-K0315 CE2: Deblocking Improvements for Large CUs (Test 2.1.7) [W. Zhu, K. Misra, A. Segall, P. Cowan (Sharp)]
References:
PATENTS:
US11470357B2
0.34
2022-10-11
US20240406458A1
0.32
2024-12-05
US20260075252A1
0.30
2026-03-12
US20250254364A1
0.28
2025-08-07
US20240163459A1
0.26
2024-05-16
WO2023280311A1
0.24
2023-01-12
WO2023051624A1
0.22
2023-04-06
US20240048770A1
0.20
2024-02-08
Decisions
JVET-K0315 CE2: Deblocking Improvements for Large CUs (Test 2.1.7) [W. Zhu, K. Misra, A. Segall, P. Cowan (Sharp)]
Citation
Abstract
This report summarizes the activities of the Exploration Experiment 1 (EE1) performed between the 39th and 40th JVET meetings to evaluate Neural Network-based Video Coding (NNVC) technologies, analyze their performance, evaluate their complexity aspects, and clarify training procedure. Two teleconferences have been conducted during this meeting circle. Four categories of experiments were included into EE: LOP NN-based filter, VLOP NN-based filter, NN-Inter and NN-based super resolution.
Loading full meeting notes...
JVET-AN0023 EE1: Summary report of exploration experiment on neural network-based video coding [E. Alshina, R. Chang, F. Galpin, Yue Li, Yun Li, M. Santamaria, T. Shao, J. Ström, Z. Xie (EE coordinators)]
Code base for the EE1 tests was NNVC14.0, anchor is default configuration of NNVC-14.0 (NN-Intra and LOP6 filter enabled). NNVC common test conditions, results and complexity reporting template were be used.
For proposals in all categories, proponents used AhG11 training set, which consists of DIV2K, BVI-DVC, TVD. NN-based Inter tools were trained using Vimeo 90K triplet. Comparison is done between tests which use the same sub-set of training data.
For tests competing with technologies in NNVC it was agreed to configure the proposed solution targeting the complexity close to existing NNVC tool, but not exceeding it:
kMAC/pxl of EE1 test kMAC/pxl NNVC (must),
the number of channels (bot...
Decisions
adopted
Adopt JVET-AN0195 EE1-3.5 (re-training the current DRF model)
Citation
Abstract
This document summarizes the activity of AHG13: “Tool reporting procedure” between the 11th Meeting in Ljubljana, SI (10-18 July 2018) and the 12th meeting in Macao, CN (3-12 Oct. 2018). Tool on/off experimental results vs. VTM and BMS anchors are provided for the tools specified in JVET-K1005, which include the VTM and BMS tools.
Loading full meeting notes...
JVET-L0013 JVET AHG report: Tool reporting procedure (AHG13) [W.-J. Chien, J. Boyce (co-chairs), R. Chernyak, K. Choi, R. Hashimoto, Y. He, Y.-W. Huang, S. Liu]
This document summarizes the activity of AHG13: “Tool reporting procedure” between the 11th Meeting in Ljubljana, SI (10–18 July 2018) and the 12th meeting in Macao, CN (3–12 Oct. 2018). Tool on/off experimental results vs. VTM and BMS anchors are provided for the tools specified in JVET-K1005, which include the VTM and BMS tools.
The initial version of JVET-K1005 “Methodology and reporting template for tool testing” was provided on Aug 3rd, with updates provided on Sept. 26th. The document contained a reporting template.
All tests described in JVET-J1005 were conducted. VTM tool tests were conducted on BMS-2.0.1 software with VTM configuration and BMS tool tests were conducted on BMS-2.1 software with VTM configuration (for tool...
References:
JVET-D0120
JVET-J1005
JVET-K0063
JVET-K0072
JVET-K0076
JVET-K0096
JVET-K0122
JVET-K0171
JVET-K0173
JVET-K0184
JVET-K0190
JVET-K0217
JVET-K0230
JVET-K0232
JVET-K0237
JVET-K0248
JVET-K0251
JVET-K0307
JVET-K0310
JVET-K0315
JVET-K0337
JVET-K0346
JVET-K0351
JVET-K0357
JVET-K0368
JVET-K0369
JVET-K0371
JVET-K0485
JVET-K0500
JVET-K0529
JVET-K0554
JVET-K0556
JVET-K1005
JVET-L0201
Cited:
Decisions
noted
In the discussion, there was a discussion of “WIP” and “67IPM”. It was noted that these had been considered together as a package (measured above as providing 0.2%+0.6% for AI, about half that for RA) and part of the rationale was that these were not really adding significant decoder complexity. There had also been a bit more gain from an MPM design change proposed that was not included.
Citation
Abstract
This document reports the work of the JVET ad hoc group on draft text and test model algorithm description editing (AHG2) between the 11th meeting in Ljubljana, SI (10-18 July 2018) and the 12th meeting in Macao, CN (3-12 October 2018).
Loading full meeting notes...
JVET-L0002 JVET AHG report: Draft text and test model algorithm description editing (AHG2) [B. Bross, J. Chen, J. Boyce, S. Kim, S. Liu, Y. Ye]
This document reports the work of the JVET ad hoc group on draft text and test model algorithm description editing (AHG2) between the 11th meeting in Ljubljana, SI (10–18 July 2018) and the 12th meeting in Macao, CN (3–12 October 2018).
The first draft of Versatile Video Coding (VVC D1) includes a quadtree with nested multi-type tree using binary and ternary splits coding block structure as the initial new coding feature of VVC. At the 11th JVET meeting, it was decided to include more coding features for intra picture-prediction, inter-picture prediction, transform coefficient coding, transform, adaptive loop filtering and a starting basis for high-level syntax in the second draft of Versatile Video Coding (VVC D2) and the VVC Test Model 2 (VTM2)...
References:
JVET-J1001
JVET-J1002
JVET-K0002
JVET-K0052
JVET-K0063
JVET-K0072
JVET-K0103
JVET-K0122
JVET-K0184
JVET-K0190
JVET-K0230
JVET-K0251
JVET-K0310
JVET-K0325
JVET-K0337
JVET-K0346
JVET-K0351
JVET-K0357
JVET-K0367
JVET-K0371
JVET-K0500
JVET-K0529
JVET-K0554
JVET-K0556
JVET-K0565
JVET-K1001
JVET-K1002
JVET-L0104
JVET-L0122
JVET-L0137
JVET-L0216
JVET-L0362
JVET-L0396
JVET-L0428
JVET-L0453
JVET-L0468
JVET-L0553
Decisions
Add SAO as found in HEVC to the draft standard
Citation
Abstract
The purpose of this Core Experiment (CE) is to investigate the coding tools related to palette mode on top of the Test Model, including (1) interrelationship with CPR (2) study the complexity impact of the two palette variants and IBC. Test can be summarized as follows:
Loading full meeting notes...
JVET-K1035 Description of Core Experiment 15 (CE15): Palette mode [Y.-C. Sun, Y. H. Chao, X. Xu]
Discussion Tuesday morning Track B (JRO):
Investigate the palette variant proposed in JVET-K0411 and HEVC-SCC palette mode
Investigate interrelationship with CPR
Study the complexity impact of the two palette variants and CPR (in coordination with CE8)
(Initial version presented Wednesday 1430 (GJS & JRO.)
Future meeting plans, expressions of thanks, and closing of the meeting
Future meeting plans were established according to the following guidelines:
Meeting under ITU-T SG 16 auspices when it meets (starting meetings on the Tuesday or Wednesday of the first week and closing it on the Tuesday or Wednesday of the second week of the SG 16 meeting – a total of 6–7.5 meeting days), and
Otherwise meeting under ISO/IEC JTC 1/SC 29/WG 11 auspices when it meets (starting meetings on the Wednesday or...
References:
Decisions
Weifei Zhu (Sharp)
Citation