Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.33120

IAR: An Interaction-Aware Approach to Post-Seek Recovery in Adaptive HLS Streaming

Mahdi Naseri Majd·Amirfarhad Farhadi
View original source ↗Read source document ↗Export metadata ↓

Abstract

After an unbuffered seek, an adaptive bitrate (ABR) player has little forward buffer at the new position, while its controller may retain a bandwidth estimate from earlier downloads. An expensive first request can delay resumption; later requests may interrupt playback while the buffer rebuilds. We introduce Interaction-Aware Recovery (IAR), a temporary layer around the hls.js ABR controller. After an unbuffered seek, IAR discounts the inherited estimate (γ=0.15) to set a representation ceiling. Normal adaptation continues below it until 8 s of forward buffer has been rebuilt. In a 200-run paired study spanning four network profiles, ten seek positions, and five strategies, a conservative first request reduced resume delay by a paired median of 2.008 s relative to standard hls.js. Keeping a low ceiling through recovery reduced later interruption under stronger degradation but lowered early presented bitrate. IAR and Fixed-Low-Recovery both used L0 in this campaign, so the results did not show an additional benefit from deriving the ceiling from inherited bandwidth. In 60 additional runs under a fixed Moderate profile, we reset the estimator to six controlled scalar priors. IAR's ceiling changed from L0 to L1 and L2 at the predicted thresholds. Resume and recovery times increased at those transitions; presented bitrate varied non-monotonically and was highest at L2. No stalls occurred. These reset-created priors do not reproduce complete, naturally evolved exponentially weighted moving average (EWMA) histories. The results show the benefits and presented-quality costs of conservative post-seek recovery, without establishing an advantage for a history-derived ceiling over a fixed low ceiling.

Explore related subjects

eess.IVcs.MM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mahdi Naseri Majd, Amirfarhad Farhadi. 2026-10-23. IAR: An Interaction-Aware Approach to Post-Seek Recovery in Adaptive HLS Streaming. https://arxiv.org/abs/2610.33120

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

RPL-UIE: Reference-Guided Prior Learning for Content-Preserving Underwater Image Enhancement

Underwater image enhancement (UIE) aims to recover clear images from observations degraded by wavelength-dependent absorption, scattering, and spatially nonuniform degradation. Although existing generative methods can handle complex degradations, they may still generate visually appealing results while compromising content preservation, thereby degrading downstream visual perception. To improve content preservation, we extract spatial priors characterizing appearance and photometric properties from ground-truth images to provide stable guidance for enhancement. To bridge the gap between training with ground-truth references and inference without references, we propose reference-guided prior learning for underwater image enhancement (RPL-UIE), a two-stage teacher-student framework. The teacher network extracts stable priors from ground-truth images, while the student network takes only degraded images as input and learns to mimic the teacher's prior extraction capability. We further design Residual Prior Refinement Diffusion (RPRD) and Frequency-Aware Prior Residual Calibration (FPRC) to reduce the prior discrepancy between the teacher and student. RPRD progressively predicts corrections in the residual space, while FPRC preserves stable low-frequency residuals and selectively modulates high-frequency details. Experiments on multiple underwater image datasets show that RPL-UIE achieves competitive enhancement performance. For the engineering application of underwater visual perception, downstream object detection and instance segmentation experiments show that RPL-UIE improves visual quality while better preserving object structures and semantic content needed for reliable perception. Tests on real-world data collected by a custom-built remotely operated vehicle (ROV) further demonstrate its effectiveness and practical applicability.

eess.IV↗
arXiv2026

Learning Optimal Lattice Vector Quantizers for End-to-end Neural Image Compression

It is customary to deploy uniform scalar quantization in the end-to-end optimized Neural image compression methods, instead of more powerful vector quantization, due to the high complexity of the latter. Lattice vector quantization (LVQ), on the other hand, presents a compelling alternative, which can exploit inter-feature dependencies more effectively while keeping computational efficiency almost the same as scalar quantization. However, traditional LVQ structures are designed/optimized for uniform source distributions, hence nonadaptive and suboptimal for real source distributions of latent code space for Neural image compression tasks. In this paper, we propose a novel learning method to overcome this weakness by designing the rate-distortion optimal lattice vector quantization (OLVQ) codebooks with respect to the sample statistics of the latent features to be compressed. By being able to better fit the LVQ structures to any given latent sample distribution, the proposed OLVQ method improves the rate-distortion performances of the existing quantization schemes in neural image compression significantly, while retaining the amenability of uniform scalar quantization. Code is available at: https://github.com/xzhang9308/OLVQ.

eess.IV↗
arXiv2026

Deep Pseudo-Proximal Map: A Self-Supervised Data-Fitting Agent for Iterative Reconstruction

Iterative algorithms for inverse imaging problems split reconstruction into alternating subproblems, one of which requires evaluating the data-fitting proximal map. In many practical cases, this proximal map has no analytic solution and so must be approximated by an inner loop solver at every iteration, compounding the cost of the outer reconstruction loop. To address this, we propose the pseudo-proximal map (PPM), a reformulation of the data-fitting proximal map as the minimum mean square error estimate of a synthetic probabilistic model. We implement the deep PPM as a self-supervised neural network trained only on sampled Gaussian noise, requiring no ground-truth training images. The deep PPM can be trained for any operator for which the forward model $A$ and its transpose $A^T$ can be evaluated, with provable equivalence to the proximal map when $A$ is linear. We validate the deep PPM on Gaussian deblurring and 4x super-resolution, where the proximal map has an analytic solution, and on X-ray computed tomography (XCT), where no analytic solution exists. Used as the data-fitting agent within an iterative reconstruction method, the deep PPM reproduces the reference reconstruction to within 1% NRMSE for all three operators, and for XCT, it replaces the inner conjugate-gradient loop with a single network evaluation that is 18x faster.

eess.IV↗