arXiv subjects

Yehuda Dar

Publications and source records attributed to Yehuda Dar.

24 records · Page 2Linked to original sources

arXiv2018

System-Aware Compression

Many information systems employ lossy compression as a crucial intermediate stage among other processing components. While the important distortion is defined by the system's input and output signals, the compression usually ignores the system structure, therefore, leading to an overall sub-optimal rate-distortion performance. In this paper we propose a compression methodology for an operational rate-distortion optimization considering a known system layout, modeled using linear operators and noise. Using the alternating direction method of multipliers (ADMM) technique, we show that the design of the new globally-optimized compression reduces to a standard compression of a "system adjusted" signal. Essentially, the proposed framework leverages standard compression techniques to address practical settings of the noisy source coding problem. We further explain the main ideas of our method by theoretically studying the case of a cyclo-stationary Gaussian signal. We present experimental results for coding of one-dimensional signals and for video compression using the HEVC standard, showing significant gains by the adjustment to an acquisition-rendering system.

cs.IT↗

arXiv2018

On High-Resolution Adaptive Sampling of Deterministic Signals

In this work we study the topic of high-resolution adaptive sampling of a given deterministic signal and establish a connection with classic approaches to high-rate quantization. Specifically, we formulate solutions for the task of optimal high-resolution sampling, counterparts of well-known results for high-rate quantization. Our results reveal that the optimal high-resolution sampling structure is determined by the density of the signal-gradient energy, just as the probability-density-function defines the optimal high-rate quantization form. This paper has three main contributions: the first is establishing a fundamental paradigm bridging the topics of sampling and quantization. The second is a theoretical analysis of nonuniform sampling relevant to the emerging field of high-resolution signal processing. The third is a new practical approach to nonuniform sampling of one-dimensional signals that enables reconstruction based only on the sampling time-points and the signal extrema locations and values. Experiments for signal sampling and coding showed that our method outperforms an optimized tree-structured sampling technique.

cs.IT↗

arXiv2018

Compression for Multiple Reconstructions

In this work we propose a method for optimizing the lossy compression for a network of diverse reconstruction systems. We focus on adapting a standard image compression method to a set of candidate displays, presenting the decompressed signals to viewers. Each display is modeled as a linear operator applied after decompression, and its probability to serve a network user. We formulate a complicated operational rate-distortion optimization trading-off the network's expected mean-squared reconstruction error and the compression bit-cost. Using the alternating direction method of multipliers (ADMM) we develop an iterative procedure where the network structure is separated from the compression method, enabling the reliance on standard compression techniques. We present experimental results showing our method to be the best approach for adjusting high bit-rate image compression (using the state-of-the-art HEVC standard) to a set of displays modeled as blur degradations.

cs.MM↗

arXiv2016

Postprocessing of Compressed Images via Sequential Denoising

In this work we propose a novel postprocessing technique for compression-artifact reduction. Our approach is based on posing this task as an inverse problem, with a regularization that leverages on existing state-of-the-art image denoising algorithms. We rely on the recently proposed Plug-and-Play Prior framework, suggesting the solution of general inverse problems via Alternating Direction Method of Multipliers (ADMM), leading to a sequence of Gaussian denoising steps. A key feature in our scheme is a linearization of the compression-decompression process, so as to get a formulation that can be optimized. In addition, we supply a thorough analysis of this linear approximation for several basic compression procedures. The proposed method is suitable for diverse compression techniques that rely on transform coding. Specifically, we demonstrate impressive gains in image quality for several leading compression methods - JPEG, JPEG2000, and HEVC.

cs.CV↗

arXiv2015

Improving Low Bit-Rate Video Coding using Spatio-Temporal Down-Scaling

Good quality video coding for low bit-rate applications is important for transmission over narrow-bandwidth channels and for storage with limited memory capacity. In this work, we develop a previous analysis for image compression at low bit-rates to adapt it to video signals. Improving compression using down-scaling in the spatial and temporal dimensions is examined. We show, both theoretically and experimentally, that at low bit-rates, we benefit from applying spatio-temporal scaling. The proposed method includes down-scaling before the compression and a corresponding up-scaling afterwards, while the codec itself is left unmodified. We propose analytic models for low bit-rate compression and spatio-temporal scaling operations. Specifically, we use theoretic models of motion-compensated prediction of available and absent frames as in coding and frame-rate up-conversion (FRUC) applications, respectively. The proposed models are designed for multi-resolution analysis. In addition, we formulate a bit-allocation procedure and propose a method for estimating good down-scaling factors of a given video based on its second-order statistics and the given bit-budget. We validate our model with experimental results of H.264 compression.

cs.MM↗

arXiv2014

Motion-Compensated Coding and Frame-Rate Up-Conversion: Models and Analysis

Block-based motion estimation (ME) and compensation (MC) techniques are widely used in modern video processing algorithms and compression systems. The great variety of video applications and devices results in numerous compression specifications. Specifically, there is a diversity of frame-rates and bit-rates. In this paper, we study the effect of frame-rate and compression bit-rate on block-based ME and MC as commonly utilized in inter-frame coding and frame-rate up conversion (FRUC). This joint examination yields a comprehensive foundation for comparing MC procedures in coding and FRUC. First, the video signal is modeled as a noisy translational motion of an image. Then, we theoretically model the motion-compensated prediction of an available and absent frames as in coding and FRUC applications, respectively. The theoretic MC-prediction error is further analyzed and its autocorrelation function is calculated for coding and FRUC applications. We show a linear relation between the variance of the MC-prediction error and temporal-distance. While the affecting distance in MC-coding is between the predicted and reference frames, MC-FRUC is affected by the distance between the available frames used for the interpolation. Moreover, the dependency in temporal-distance implies an inverse effect of the frame-rate. FRUC performance analysis considers the prediction error variance, since it equals to the mean-squared-error of the interpolation. However, MC-coding analysis requires the entire autocorrelation function of the error; hence, analytic simplicity is beneficial. Therefore, we propose two constructions of a separable autocorrelation function for prediction error in MC-coding. We conclude by comparing our estimations with experimental results.

cs.MM↗