Scalable Neural Video Representation Compression
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Electrical Engineering. The day in electrical engineering: signals, systems and the hardware that carries them.
Rosa: I'm Rosa.
Dev: And I'm Dev, here with Taro.
Rosa: We're looking at the paper: "Scalable Neural Video Representation Compression".
Dev: Here's the gist of the paper. Scalable video coding (SVC) encodes a video into a layered bitstream consisting of a base layer and one or multiple enhancement layers, enabling decoding at different bitrate/quality/resolution operating points to accommodate diverse device capabilities and network conditions The Problem Addressed Research on scalable INR-based compression remains in its infancy because these methods support scalable coding by introducing additional network layers, which couple the bitrate with the decoding complexity and also cannot achieve comparable performance with strong scalable/non-scalable codecs <ref:2609.04273#pg3> Existing approaches typically focus on a single type of scalability, including spatial resolution
3: , reconstruction quality
20: , or human and machine vision
12, 18: <ref:2609.04273#pg5> Furthermore, most existing scalable neural video codecs are built on autoencoder-based architectures, while scalability in INR-based codecs has not been fully explored <ref:2609.04273#pg6> Pioneering works in scalable INR-based codecs attempt to bridge this gap by partitioning the model into a base layer/block (for the lowest quality or resolution), together with stacked enhancement layers or blocks for progressive refinement
8, 50, 51, 53: <ref:2609.04273#pg7> However, several limitations remain regarding complexity coupling and sub-optimal rate-distortion performance <ref:2609.04273#pg7> S-NVRC Architecture The proposed S-NVRC adopts a coarse-to-fine prefix for feature grids and a nested prefix for network layers, which scale bitrate and decoding complexity, respectively <ref:2609.04273#pg2> The system organizes the scalable representation into K levels, indexed by k = 0,..., K − 1 from the lowest to the highest <ref:2609.04273#pg2> Each level is configured by lk = (Gk, αk), where Gk is the number of feature grids it decodes and αk is the scaling ratio applied to the width of the network it runs <ref:2609.04273#pg2> This design allows S-NVRC to operate in three scaling modes: bitstream scaling, complexity scaling, and joint bitrate and complexity scaling <ref:2609.04273#pg2> Scalable Feature Grids The feature grids exhibit strong spatial-temporal correlations and can, therefore, be efficiently compressed using context-adaptive entropy coding
24, 26, 29: <ref:2609.04273#pg2> At decoding level k, the network layers decode only a coarse-to-fine prefix of the grids, g0,..., gGk−1, where the prefix length Gk is non-decreasing in k with GK−1 = G <ref:2609.04273#pg4> Since the grids are multi-resolution, a short prefix captures the coarse structure of the video, while each further grid, decoded at a higher level, refines it with finer detail <ref:2609.04273#pg2> The size of grid gi scales with the spatio-temporal resolution it covers, on the order of TiHiWiCi values, so the finer grids are far larger than the coarse ones and dominate the rate <ref:2609.04273#pg2> Scalable Network Layers The INR design mainly follows HiNeRV++
28: with high resolution feature grids
27: (as shown in Figure 2) <ref:2609.04273#pg2> Its main building block is based on ConvNeXt
38: <ref:2609.04273#pg2> For each output pixel, the depth-wise convolution with an s × s kernel incurs d s squared multiply-accumulate operations, whereas the MLP costs 2dh; since h >> s squared, the decoding complexity is primarily determined by the MLP <ref:2609.04273#pg2> We make the MLP slimmable: at level k, each block runs only a prefix of its hidden channels, a width hk = αkh that is non-decreasing in k with hK−1 = αK−1h = h and αK−1 = 1 <ref:2609.04273#pg4> Running at width hk reduces the MLP cost from 2dh to 2dhk, so the per-pixel decoding complexity scales linearly with the network width <ref:2609.04273#pg4> Layered Entropy Coding and Training S-NVRC encodes a video once into a single bitstream, from which any level lk can be decoded by truncation at a rate close to that of a bitstream dedicated to that level <ref:2609.04273#pg2> The entropy model then factorizes the joint distribution of the coded parameters as p(mK−1) = K Y−1 k=0 p(∆k mk−1) <ref:2609.04273#pg6> This allows the encoder to emit increments sequentially, ensuring that truncating the stream after ∆k yields a self-contained substream that decodes exactly the parameters in mk <ref:2609.04273#pg2> To achieve end-to-end optimization for rate-distortion trade off, we use L = K X−1 k=0 Rk + λk D(Vk, V gt) <ref:2609.04273#pg6> We control the number of samples at each level during batch optimization with gradient descent to balance the quality of the samples at various levels <ref:2609.04273#pg6> Quantitative Results Under the single-layered bitstream setting (Bottom), S-NVRC achieves consistent coding gains over the scalable baselines, with 57.6%, 5.6%, 43.7%, and 70.2% BD-rate savings (PSNR) over NSVC, ML-VTM, SHVC, and DHVC on UVG, respectively <ref:2609.04273#pg2> Even in the conventional per-QP setting (Top), S-NVRC still yields BD-rate savings over the scalable codecs at the Top-OP <ref:2609.04273#pg2> The default configuration scales the rate and complexity jointly, giving the best overall trade-off <ref:2609.04273#pg2> This paper presents S-NVRC, a scalable INR-based video codec that encodes a video once into a single layered bitstream and decodes it across a wide range of operating points by decoupling bitrate from decoding complexity <ref:2609.04273#pg2> Our method substantially outperforms scalable codecs such as SHVC under the single-bitstream setting across all test datasets, while also approaching the non-scalable INR upper bounds at the top operating point <ref:2609.04273#pg2> The explicit parameter structure of INRs—separable feature grids and decoder weights, which is naturally suited to fine-grained, multi-axis scalable coding, points to a promising path for adaptable neural video delivery <ref:2609.
Paper summary: Rosa: So we're looking at this paper called Scalable Neural Video Representation Compression. Basically, the main idea here is taking something that already does scalable video coding and applying it to these neural video codecs, which are using implicit neural representations.
Dev: Right. The core thesis is that you can encode a video once into a single layered bitstream with a base layer and then some enhancement layers on top, so you can decode it at different quality or resolution levels depending on what the device or network can handle >
Taro: But the problem they are tackling is that existing research on INR-based codecs hasn't really explored scalability yet. Most of those approaches only focus on one way to scale, like just spatial resolution, reconstruction quality, or human vision >
Rosa: Exactly. They point out that most existing scalable neural video codecs are built around autoencoder architectures, but the way they handle scalability in INR-based models hasn't been fully investigated >
Dev: They do try to bridge this gap by splitting the model into a base layer and then stacking enhancement layers for progressive refinement, but they found that this design couples two things: the bitrate and the decoding complexity >
Taro: That's a big deal because it means that every time you add another scale level, you increase how hard it is to decode whatever quality or resolution you are targeting >
Rosa: So, what they propose in this paper, Scalable Neural Video Representation Compression, is a specific way to do this: they use a coarse-to-fine prefix for the feature grids and a nested prefix for the network layers >
Dev: That structure lets them scale both bitrate and decoding complexity at the same time using K levels, indexed from zero up to K minus one >
Taro: And each level is set by two things: G sub k, which is the number of feature grids it decodes, and alpha sub k, which is the scaling ratio applied to the width of the network running at that level >
Paper summary: Rosa: That means they can operate in three different modes: scaling the bitstream itself, scaling complexity by changing how much you run on those networks, or even joint bitrate and complexity scaling >
Dev: Let's talk about those feature grids. The paper says these feature grids have strong spatial-temporal correlations, which means you can compress them really well using context adaptive entropy coding >
Taro: At any decoding level k, the network layers only decode a coarse to fine prefix of the grids, and this prefix length is non decreasing as k goes up >
Rosa: So, a short prefix captures the big picture structure of the video at lower levels, and then each further grid refines that detail when you decode at a higher level >
Dev: The size of each grid scales with the spatio temporal resolution it covers, which is on the order of TiHiWiCi values >
Taro: That means the finer grids are way bigger than the coarse ones, and those finer grids end up dominating the rate for higher levels >
Rosa: Moving to network layers, they follow a design similar to HiNeRV++, using high resolution feature grids and building blocks based on ConvNeXt >
Dev: They make the MLP part of the model slimmable by only running a prefix of its hidden channels at each level k, with the width hk scaling as alpha sub k times h >
Taro: That reduction in network width changes the cost for that part from two d h operations to two d h sub k operations, which means per pixel decoding complexity scales linearly with the network width >
Rosa: The whole point of this layered entropy coding is that they encode the video once into one bitstream, and you can decode any level lk just by truncating it at a rate that's close to what you'd expect for just that specific level >
Dev: The entropy model they use factorizes the distribution of the coded parameters as p of m sub K minus one equals sigma over k from zero p delta k over m sub k minus one >
Paper summary: Taro: This factorization allows the encoder to emit increments sequentially, which means truncating after a specific increment yields a self contained substream that decodes exactly what you need >
Rosa: For training, they use this loss function L equals K times sum over k from zero R k plus lambda sub k D of V sub k D V gt >
Dev: They control the number of samples at each level during batch optimization with gradient descent to balance the quality across all those different levels >
Taro: The results they show under a single layered bitstream setting are quite strong, achieving coding gains over scalable baselines like NSVC, ML-VTM, SHVC, and DHVC on UVG >
Rosa: And they also show that even in the conventional per QP setting at the top operating point, Scalable Neural Video Representation Compression still gives BD rate savings over those other scalable codecs >
Dev: The default configuration scales both the rate and complexity together to get what they say is the best overall trade off >
Taro: The paper points out a limitation, though. They say that because of this coupling of bitrate and complexity, adding more layers does increase the decoding complexity at every higher operating point >
Rosa: So, what does this mean for us practically? It means if you want to use this scalable approach, you have to be careful about how many levels you add because the decoder gets harder to run >
Dev: And they also mention that their method is built on INR designs, and that because of the way those feature grids and decoder weights are separable, it points toward a promising path for adaptable neural video delivery >
Taro: It suggests a direction where the model structure itself is naturally suited for fine grained coding across multiple axes, which could lead to better ways to deliver neural video than what we see now >
Rosa: So that's the main idea: scalable INR-based codecs that decouple bitrate from decoding complexity, and they show it works really well compared to other scalable methods >
Conclusion: Rosa: So, this paper is about Scalable Neural Video Representation Compression, and it shows how you can encode a video just once but decode it at totally different quality levels depending on what your device can handle.
Dev: Right. The authors are tackling that issue where existing neural video codecs only scale in one direction, like just spatial resolution or reconstruction quality, and this one tries to fix that by scaling both the bitrate and the decoding complexity at the same time.
Rosa: Basically, they use a system where you have a base layer for the lowest quality or resolution, and then you stack enhancement layers on top for progressive refinement.
Dev: But what they are doing specifically is using coarse-to-fine feature grids and nested network layers, which lets them control that scaling by changing how many feature grids you use and how wide the network becomes at each level.
Rosa: It means you can choose to scale the rate, or scale the complexity of decoding, or even do both at the same time. It’s a flexible system.
Dev: The results show that this method actually performs better than some of those existing scalable neural codecs when you only look at the bitstream scaling aspect. They're seeing consistent gains over things like SHVC and ML-VTM on various test sets.
Rosa: And even when they look at the conventional per-quality setting, it still beats those other scalable methods at the highest quality point.
Dev: It sounds promising because they structure the neural representation itself—the feature grids and decoder weights—in a way that naturally lends itself to this kind of fine-grained scaling.
Rosa: Exactly. It suggests a way forward for making neural video delivery more adaptable, where you can tailor it perfectly to whatever hardware or network conditions are actually available at that moment.
Tianhao Peng, Ho Man Kwan, Fan Zhang, Shan Liu, David Bull
University of Bristol · Tencent Media Lab
eess.IV, cs.CV, cs.MM
Submitted: 2026-09-02
Updated: 2026-11-03
License: http://creativecommons.org/licenses/by/4.0/
Importance score: 94/100
The gist: Scalable video coding (SVC) encodes a video into a layered bitstream consisting of a base layer and one or multiple enhancement layers…
Key concepts
- Scalable Video Coding (SVC)
- SVC encodes video into a layered stream with a base layer and optional enhancement layers. This allows the receiver to decode the video at various quality or resolution levels by only using different parts of the bitstream, accommodating different network conditions.
- S-NVRC Architecture
- The proposed architecture uses a coarse-to-fine prefix for feature grids and nested prefixes for network layers. These structures allow S-NVRC to scale both the bitrate (how much data is sent) and the decoding complexity (how hard it is to decode) independently.
- Scalable Feature Grids
- The video features are organized into multiple grids, where each level decodes a coarse prefix of these grids. Coarser grids capture the overall structure of the video, while finer grids add more detail, allowing progressive refinement during decoding.
- Slimmable Network Layers
- The network layers are made 'slimmable' by only running a prefix of their hidden channels at each decoding level. This reduces the computational cost (complexity) linearly with the network width, ensuring that higher quality levels don't drastically increase the decoding time.
Terminology
Summary
Scalable video coding (SVC) encodes a video into a layered bitstream consisting of a base layer and one or multiple enhancement layers, enabling decoding at different bitrate/quality/resolution operating points to accommodate diverse device capabilities and network conditions
The Problem Addressed
Research on scalable INR-based compression remains in its infancy because these methods support scalable coding by introducing additional network layers, which couple the bitrate with the decoding complexity and also cannot achieve comparable performance with strong scalable/non-scalable codecs <ref:2609.04273#pg3> Existing approaches typically focus on a single type of scalability, including spatial resolution [3], reconstruction quality [20], or human and machine vision [12, 18] <ref:2609. p. 1 While this paradigm has been standardized in
conventional video coding frameworks [4, 44], some recent
works have revisited scalability for neural video coding. Existing approaches, however, typically focus on a single type
of scalability, including spatial resolution [3], reconstruction
quality [20], or human and machine vision [12, 18]. Existing approaches, however, typically focus on a single type
of scalability, including spatial resolution [3], reconstruction
quality [20], or human and machine vision [12, 18]. Furthermore, most existing scalable neural video codecs are
built on autoencoder-based architectures, while scalability
in INR-based codecs has not been fully explored. Furthermore, most existing scalable neural video codecs are
built on autoencoder-based architectures, while scalability
in INR-based codecs has not been fully explored. Pioneering works in scalable INR-based codecs attempt
to bridge this gap by partitioning the model into a base
layer/block (for the lowest quality or resolution), together
with stacked enhancement layers or blocks for progressive
refinement [8, 50, 51, 53]. However, several limitations remain. First, while
adding additional layers or blocks yields additional operating points, the decoding complexity is tied to the number of
scales, increasing at every higher operating point.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
S-NVRC Architecture
The proposed S-NVRC adopts a coarse-to-fine prefix for feature grids and a nested prefix for network layers, which scale bitrate and decoding complexity, respectively <ref:2609.04273#pg2> The system organizes the scalable representation into K levels, indexed by k = 0,. p. 3 Following the recent INR-based
codec, NVRC [26] and its efficient variants [28], we adopt
high-resolution feature grids that deliver strong reconstruction performance at low complexity, while leveraging the
hierarchical compression framework for efficiently coding
the high-resolution features. As shown in Figure 2, we organize the scalable representation into K levels, indexed by k = 0, . As shown in Figure 2, we organize the scalable representation into K levels, indexed by k = 0, . , K − 1
from the lowest to the highest. , K − 1
from the lowest to the highest. Each level is configured
by ℓk = (Gk, αk), where Gk is the number of feature grids
it decodes and αk is the scaling ratio applied to the width of
the network it runs. These two dimensions primarily decouple the scaling of the bitrate and the decoding complexity,
where Gk mainly scales the bitrate of a particular operating
point, and αk controls its complexity with little impact on the
bitrate. This design allows S-NVRC to operate in three scaling modes: bitstream scaling, complexity scaling, and joint
bitstream and complexity scaling, providing great flexibility
for different use cases.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Scalable Feature Grids
The feature grids exhibit strong spatial-temporal correlations and can, therefore, be efficiently compressed using context-adaptive entropy coding [24, 26, 29] <ref:2609.04273#pg2> At decoding level k, the network layers decode only a coarse-to-fine prefix of the grids, g0,. p. 4 Each grid is injected into the
decoder through interpolation followed by a projection. At decoding level k, the network layers decode only a
coarse-to-fine prefix of the grids, g0, . At decoding level k, the network layers decode only a
coarse-to-fine prefix of the grids, g0, . , gGk−1, where the
prefix length Gk is non-decreasing in k with GK−1 = G. , gGk−1, where the
prefix length Gk is non-decreasing in k with GK−1 = G. Since the grids are multi-resolution, a short prefix captures
the coarse structure of the video, while each further grid,
decoded at a higher level, refines it with finer detail. Therefore, the masked grids can be zero-filled instead of
actually decoding those grid parameters from the bitstream
while running the ordinary forward pass. The size of grid gi scales with the spatio-temporal resolution it covers, on the order of TiHiWiCi values, so the finer
grids are far larger than the coarse ones and dominate the rate.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Scalable Network Layers
The INR design mainly follows HiNeRV++ [28] with high resolution feature grids [27] (as shown in Figure 2) <ref:2609.04273#pg2> Its main building block is based on ConvNeXt [38] <ref:2609. p. 4 Scalable Network Layers
Our deployed INR design mainly follows HiNeRV++ [28]
with high resolution feature grids [27] (as shown in Figure 2),
which contain multiple decoding stages. Its main building
block based on ConvNeXt [38]: a depth-wise convolution
followed by a two-layer MLP that expands the channel dimension d to a hidden width h and projects it back. Its main building
block based on ConvNeXt [38]: a depth-wise convolution
followed by a two-layer MLP that expands the channel dimension d to a hidden width h and projects it back. For
each output pixel, the depth-wise convolution with an s × s
kernel incurs d s2 multiply-accumulate operations, whereas
the MLP costs 2dh; since h ≫ s
2
, the decoding complexity
is primarily determined by the MLP. For
each output pixel, the depth-wise convolution with an s × s
kernel incurs d s2 multiply-accumulate operations, whereas
the MLP costs 2dh; since h ≫ s
2
, the decoding complexity
is primarily determined by the MLP. We, therefore, make the
MLP slimmable: at level k, each block runs only a prefix of
its hidden channels, a width hk = αkh that is non-decreasing
in k with hK−1 = αK−1h = h and αK−1 = 1. We, therefore, make the
MLP slimmable: at level k, each block runs only a prefix of
its hidden channels, a width hk = αkh that is non-decreasing
in k with hK−1 = αK−1h = h and αK−1 = 1. Running at width hk reduces the MLP cost from 2dh to
2dhk, so the per-pixel decoding complexity scales linearly
with the network width.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Layered Entropy Coding and Training
S-NVRC encodes a video once into a single bitstream, from which any level lk can be decoded by truncation at a rate close to that of a bitstream dedicated to that level <ref:2609.04273#pg2> The entropy model then factorizes the joint distribution of the coded parameters as p(mK−1) = K Y−1 k=0 p(∆k mk−1) <ref:2609. p. 4 We ensure this by coding in
scalability order: the feature grids are coded in a coarse-tofine order of increasing spatial resolution, while the network
weights are coded according to their channel order. The
entropy model then factorizes the joint distribution of the
coded parameters as (5)
Here, each increment ∆k is coded under a distribution
that depends only on previously coded parameters mk−1:
the grids through the autoregressive grid entropy model
[24, 26, 29], and the network weights through the positionconditioned factorized weight entropy model [26]. Since no
factor depends on future increments, truncating the stream after ∆k yields a self-contained substream that decodes exactly
the parameters in mk. (6)
Where Vk is the reconstruction at the k-th level. To enable
end-to-end optimization for the rate-distortion trade off, it is
possible to optimize the single scale rate-distortion objective
for encoding [26] with
Lnaive = R +
K
X−1
k=0
λk D(Vk, V gt). We found that this
prevents some cases when multiple operating points could
be collapsed (See Table 3). In addition, we control the number of samples at each
level during batch optimization with gradient descent to balance the quality of the samples at various levels.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Quantitative Results
Under the single-layered bitstream setting (Bottom), S-NVRC achieves consistent coding gains over the scalable baselines, with 57.6%, 5.6%, 43.7%, and 70.2% BD-rate savings (PSNR) over NSVC, ML-VTM, SHVC, and DHVC on UVG, respectively <ref:2609. p. 6 7%, and 70. 2% BD-rate savings (PSNR) over NSVC, ML-VTM, SHVC, and DHVC on
UVG, respectively. 2% BD-rate savings (PSNR) over NSVC, ML-VTM, SHVC, and DHVC on
UVG, respectively. Even in the conventional per-QP setting
(Top), S-NVRC still yields BD-rate savings over the scalable
codecs at the Top-OP, as well as over conventional codecs
Table 2. plications such as fast previewing. Our default configuration
scales the rate and the complexity jointly, giving the best
overall trade-off: it combines competitive RD performance
with low decoding complexity at the lower operating points,
and it can span a wider quality and bitrate range than the
other two settings.Where the paper says it
Where the paper says it
Where the paper says it
Conclusion
This paper presents S-NVRC, a scalable INR-based video codec that encodes a video once into a single layered bitstream and decodes it across a wide range of operating points by decoupling bitrate from decoding complexity <ref:2609.04273#pg2> Our method substantially outperforms scalable codecs such as SHVC under the single-bitstream setting across all test datasets, while also approaching the non-scalable INR upper bounds at the top operating point <ref:2609. p. 7 Conclusion
This paper presents S-NVRC, a scalable INR-based video
codec that encodes a video once into a single layered bitstream and decodes it across a wide range of operating
points by decoupling bitrate from decoding complexity. Our method substantially outperforms scalable codecs such
as SHVC under the single-bitstream setting across all test
datasets, while also approaching the non-scalable INR upper
bounds at the top operating point. axes, such as frame rate, and reducing the per-video overfitting cost that INR codecs incur at encoding time. More
broadly, our results indicate that the explicit parameter structure of INRs—separable feature grids and decoder weights,
which is naturally suited to fine-grained, multi-axis scalable
coding, points to a promising path for adaptable neural video
delivery.Where the paper says it
Where the paper says it
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Scalable video coding for heterogeneous devices can be achieved by encoding a single bitstream that supports multiple operating points, allowing decoding at different bitrate, quality, and complexity scales.
-
The system can serve diverse device capabilities and network conditions simultaneously by utilizing a
single embedded bitstream
where each layer operates at a different decoding complexity and bitrate. -
AI systems can achieve fast decoding and competitive coding efficiency compared to scene-agnostic neural codecs by leveraging implicit neural representations (INRs) that are fitted to individual videos.
-
The proposed S-NVRC codec enables independent control over rate and decoding complexity scalability, which is described as
decoupled scaling over the bitrate and the complexity can be achieved by scaling the number of grids and weight parameters across different levels.
-
A single model can be trained so that
all operating points are jointly rate-distortion optimal, monotonic,
ensuring competitive performance at every operating point across a wide range of bitrates and complexities. -
The system can provide flexible complexity scalability by ordering feature grids from coarse to fine and nesting network layer channels, such that
a coarse-to-fine prefix of feature grids mainly controls the bitrate, while a nested prefix of the network layers determines the decoding complexity.
-
The system can achieve improved rate-distortion performance compared to existing scalable INR codecs by employing an
end-to-end multi-level training framework
that jointly optimizes rate and distortion across all operating points in a single pass. -
AI systems can adapt their reconstruction quality and decoding cost independently; specifically,
width scaling, combined with the ordered coarse-to-fine grids, allows complexity and rate to be controlled along separate axes.
Abstract
Scalable video coding (SVC) encodes a video into a layered bitstream of a base layer and one or more enhancement layers, enabling decoding at different bitrate/quality/resolution operating points for diverse devices and network conditions. SVC has been incorporated into major video coding standards and has recently attracted growing interest for both scene-agnostic and scene-adaptive neural video codecs. Among the latter, implicit neural representation (INR) based codecs overfit a compact neural network to an individual video, offering fast decoding and competitive coding efficiency. However, research on scalable INR-based compression remains in its infancy: existing methods introduce additional network layers, which couple the bitrate with the decoding complexity and cannot match strong scalable/non-scalable codecs. This paper proposes S-NVRC, a scalable INR-based video codec that jointly supports fine-grained bitrate and decoding complexity scalability from a single embedded bitstream. It adopts a coarse-to-fine prefix for feature grids and a nested prefix for network layers, which scale bitrate and decoding complexity, respectively. With a single encoding, S-NVRC spans a wide range of bitrate and decoding complexity and outperforms SHM-12.4 and the multi-layer VTM-20.0 by 43.7% and 5.6% in BD-rate on the UVG dataset.
Sources
- Layer Normalization
- COIN: COmpression with Implicit Neural representations
- Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Coding
- NVRC: Neural Video Representation Compression
- Ultra-lightweight Neural Video Representation Compression
- Overfitting for Fun and Profit: Instance-Adaptive Data Compression
- Boosting Neural Representations for Videos with a Conditional Decoder
- Implicit Neural Video Compression
Related papers
- HDNet: High-resolution Dual-domain Learning for Spectral Compressive Imaging
- Mask-guided Spectral-wise Transformer for Efficient Hyperspectral Image Reconstruction
- FDIR: Fidelity-Anchored Decompressed Image Restoration for Human and Machine Perception
- A Disease-Centric Vision-Language Foundation Model for Precision Oncology in Kidney Cancer
- CADS: A Comprehensive Anatomical Dataset and Segmentation for Whole-Body Anatomy in Computed Tomography
- Task-Aware Bitrate Thresholds for Codec-Robust Ultrasound Segmentation