With the rapid development of large multimodal models (LMMs), multimodal understanding applications are emerging. As most LMM inference requests originate from edge devices with limited computational capabilities, the predominant inference pipeline involves directly forwarding the input data to an edge server which handles all computations. However, this approach introduces high transmission latency due to limited uplink bandwidth of edge devices and significant computation latency caused by the prohibitive number of visual tokens, thus hindering delay-sensitive tasks and degrading user experience. To address this challenge, we propose a task-oriented feature compression (TOFC) method for multimodal understanding in a device-edge co-inference framework, where visual features are merged by clustering and encoded by a learnable and selective entropy model before feature projection. Specifically, we employ density peaks clustering based on$K$nearest neighbors to reduce the number of visual features, thereby minimizing both data transmission and computational complexity. Subsequently, a learnable entropy model with hyperprior is utilized to encode and decode merged features, further reducing transmission overhead. To enhance compression efficiency, multiple entropy models are adaptively selected based on the characteristics of the visual features, enabling a more accurate estimation of the probability distribution. Comprehensive experiments on seven visual question answering benchmarks validate the effectiveness of the proposed TOFC method. Results show that TOFC achieves up to 52% reduction in data transmission overhead and 63% reduction in system latency while maintaining identical task performance, compared with neural compression ELIC.

The recent development of 3D Gaussian splatting (3DGS) has led to great interest in 4D dynamic spatial reconstruction. Existing approaches mainly rely on full-length multi-view videos, while there has been limited exploration of online reconstruction methods that enable on-the-fly training and per-timestep streaming. Current 3DGS-based streaming methods treat the Gaussian primitives uniformly and constantly renew the densified Gaussians. Thus, they overlook the difference between dynamic and static features and neglect the temporal continuity of the scene. To address these limitations, we propose a novel pipeline for iterative streamable 4D dynamic spatial reconstruction. It comprises three stages: a selective inheritance stage that retains priors from previous timesteps to preserve the temporal continuity, a dynamics-aware shift stage that distinguishes dynamic and static primitives and employs distinct strategies to optimize their movements, and an error-guided densification stage that efficiently identifies Gaussians requiring densification to accommodate emerging objects. Our method achieves state-of-the-art performance in online 4D reconstruction, demonstrating compact storage, the fastest on-the-fly training speed, and superior representation quality.

Existing learning-based stereo image codec adopt sophisticated transformation with simple entropy models derived from single image codecs to encode latent representations. However, those entropy models struggle to effectively capture the spatial-disparity characteristics inherent in stereo images, which leads to suboptimal rate-distortion results. In this paper, we propose a stereo image compression framework, named CAMSIC. CAMSIC independently transforms each image to latent representation and employs a powerful decoder-free Transformer entropy model to capture both spatial and disparity dependencies, by introducing a novel content-aware masked image modeling (MIM) technique. Our content-aware MIM facilitates efficient bidirectional interaction between prior information and estimated tokens, which naturally obviates the need for an extra Transformer decoder. Experiments show that our stereo image codec achieves state-of-the-art rate-distortion performance on two stereo image datasets Cityscapes and InStereo2K with fast encoding and decoding speed.

4D Gaussian Splatting (4DGS) has recently emerged as a promising technique for capturing complex dynamic 3D scenes with high fidelity. It utilizes a 4D Gaussian representation and a GPU-friendly rasterizer, enabling rapid rendering speeds. Despite its advantages, 4DGS faces significant challenges, notably the requirement of millions of 4D Gaussians, each with extensive associated attributes, leading to substantial memory and storage cost. This paper introduces a memory-efficient framework for 4DGS. We streamline the color attribute by decomposing it into a per-Gaussian direct color component with only 3 parameters and a shared lightweight alternating current color predictor. This approach eliminates the need for spherical harmonics coefficients, which typically involve up to 144 parameters in classic 4DGS, thereby creating a memory-efficient 4D Gaussian representation. Furthermore, we introduce an entropy-constrained Gaussian deformation technique that uses a deformation field to expand the action range of each Gaussian and integrates an opacity-based entropy loss to limit the number of Gaussians, thus forcing our model to use as few Gaussians as possible to fit a dynamic scene well. With simple half-precision storage and zip compression, our framework achieves a storage reduction by approximately 190$\times$ and 125$\times$ on the Technicolor and Neural 3D Video datasets, respectively, compared to the original 4DGS. Meanwhile, it maintains comparable rendering speeds and scene representation quality, setting a new standard in the field. Code is available at https://github.com/Xinjie-Q/MEGA.

Carrier frequency offset (CFO) and channel equalization are two critical problems for multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) wireless communication systems in ultra-reliable and low latency communication (URLLC). In this paper, we propose a semi-blind precoding aided structure that includes two CFO estimation approaches and an independent component analysis (ICA) based equalization scheme for MIMO OFDM systems in URLLC, requiring no pilots. We design a non-redundant balanced precoding strategy, killing two birds with one stone, where reference signals are superimposed into source signals to simultaneously allow CFO estimation and ambiguity elimination in the ICA-equalized signals. The proposed precoding-aided CFO estimation approach performs by maximizing a cost function formulated via the cross-correlations between the reference signal and the received signal. We further propose a low-complexity closed-form CFO estimation approach, by transforming the formulated cost function into a new expression. To maximize bit error rate (BER) performance, particle swarm optimization (PSO) is employed to perform the joint optimization of precoding constant and the number of OFDM blocks for CFO estimation, while avoiding exhaustive search. The proposed semi-blind precoding-aided structure provides a trade-off between performance, complexity and spectral efficiency for MIMO OFDM systems in URLLC.