video streaming teams

Abstract: We revisit a multiterminal lossy source coding problem named successive refinement and derive the rate-distortion-perception region under the strong-sense perfect perception constraint in the presence of unlimited common randomness. Specifically, in successive refinement, one aims to compress a source sequence and allows two distinct decoders to recover the source sequence at different distortion levels. By imposing the strong-sense perfect perception constraint, our results refine the previous result by analyzing the impact of the perceptual quality. Our achievability proof is inspired by output constrained lossy source coding and our converse proof adapts the proof steps of the standard successive refinement problem. Furthermore, we provide a numerical example of the Bernoulli source to illustrate our result and show that the Bernoulli source under Hamming distortion is successively refinable even with the strong-sense perfect perception constraint.

Abstract: Tensor singular value decomposition (T-SVD), which is built upon the tensor-tensor product (t-product), has emerged as a powerful tool for processing high-dimensional visual data such as color images and videos. However, the standard t-product imposes strict dimensional compatibility constraints. Although extensions based on the semi-tensor product (STP) relax this restriction, their single-term formulations still suffer from limited approximation accuracy. Moreover, these deterministic methods incur high computational costs when processing large-scale tensor data. To address these issues, this paper introduces a novel semi-tensor product for third-order tensors under the t-product framework induced by arbitrary invertible linear transforms. The resulting tensor semi-tensor product breaks the rigid dimension matching requirement of the standard t-product, while retaining the closed-form property of T-SVD. Based on this construction, we develop a multi-term semi-tensor product singular value decomposition (MSTP-SVD), which integrates multiple orthogonal decomposition terms to significantly improve low-rank approximation accuracy compared with single-term schemes. To reduce the computational cost of multi-term modeling, we incorporate randomized projection and power iteration techniques into the MSTP-SVD framework, yielding an accelerated multi-term randomized semi-tensor product SVD (MRSTP-SVD) algorithm that achieves a balance between reconstruction accuracy and computational efficiency. Experiments on image and video compression and completion tasks demonstrate the effectiveness of the proposed method.