Data acquired over long periods of time like High Definition (HD) videos or records from a sensor over long time intervals, have to be efficiently compressed, to reduce their size. The compression has also to allow efficient access to random parts of the data upon request from the users. Efficient compression is usually achieved with prediction between data points at successive time instants. However, this creates dependencies between the compressed representations, which is contrary to the idea of random access. Prediction methods rely in particular on reference data points, used to predict other data points. The placement of these references balances compression efficiency and random access. Existing solutions to position the references use ad hoc methods. In this paper, we study this joint problem of compression efficiency and random access. We introduce the storage cost as a measure of the compression efficiency and the transmission cost for the random access ability. We express the reference placement problem that trades storage with transmission cost as an integer linear programming problem. Considering additional assumptions on the sources and coding methods reduces the complexity of the search space of the optimization problem. Moreover, we show that the classical periodic placement of the references is optimal, when the encoding costs of each data point are equal and when requests of successive data points are made. In this particular case, a closed-form expression of the optimal period is derived. Finally, the proposed optimal placement strategy is compared with an ad hoc method, where the references correspond to sources where the prediction does not help reducing significantly the encoding cost. The proposed optimal algorithm shows a bit saving of -20% with respect to the ad hoc method.

This paper presents a new method based on recent optimization technique to detect slow-moving landslides (1,2-norm is the most suitable norm for this detection problem, compared to pure ℓ1-norm or ℓ2-norm. Moreover, an outlier estimation step is included that sets apart the Gaussian noise from locally sparse processing errors in the data. The performance of this approach is tested by applying it both on synthetic data and on a time series of displacements fields over 16 dates in the Colca Valley, Peru. This detection presents commission and omission errors for landslides of 29% and 14%, respectively, using a medium resolution (10 m) data set of optical satellite images. It detects all important landslides, already known from field investigations. Moreover, it also points out other smaller or unknown landslides, increasing the existing slow-moving landslide inventory by +50%.

In this paper, we propose a method for moving-source localization based on beamforming output and on sparse representation of the source positions. The goal of this method is to achieve spatial deconvolution of the beamforming, to provide accurate source localization for pass-by experiments. To perform this deconvolution, we use a smooth approximation of ℓ1/ℓ2[1], which is well suited for the recovery of sparse signals. We validate this method on simulated data, and compare it to the DAMAS-MS method [2], one of the classical methods used in beamforming deconvolution.

This paper proposes a novel approach for echo-like multiple removal in two-dimensional seismic images. It is based on constrained adaptive filtering associated with geometric wavelets. Approximate templates of multiple reflections are assumed to be available and they are matched to multiple reflections throughout estimated finite impulse response filters. The problem is formulated under a constrained convex optimization form where the data of interest and filters are estimated jointly. Proximal approaches are used to perform the minimization of the derived criterion. The effectiveness of the proposed approach is demonstrated with various noise levels on realistic simulated data and on field seismic data.

The ℓ1/ℓ2ratio regularization function has shown good performance for retrieving sparse signals in a number of recent works, in the context of blind deconvolution. Indeed, it benefits from a scale invariance property much desirable in the blind context. However, the ℓ1/ℓ2function raises some difficulties when solving the nonconvex and nonsmooth minimization problems resulting from the use of such a penalty term in current restoration methods. In this paper, we propose a new penalty based on a smooth approximation to the ℓ1/ℓ2function. In addition, we develop a proximal-based algorithm to solve variational problems involving this function and we derive theoretical convergence results. We demonstrate the effectiveness of our method through a comparison with a recent alternating optimization strategy dealing with the exact ℓ1/ℓ2term, on an application to seismic data blind deconvolution.

Random and structured noise both affect seismic data, hiding the reflections of interest (primaries) that carry meaningful geophysical interpretation. When the structured noise is composed of multiple reflections, its adaptive cancellation is obtained through time-varying filtering, compensating inaccuracies in given approximate templates. The under-determined problem can then be formulated as a convex optimization one, providing estimates of both filters and primaries. Within this framework, the criterion to be minimized mainly consists of two parts: a data fidelity term and hard constraints modeling a priori information. This formulation may avoid, or at least facilitate, some parameter determination tasks, usually difficult to perform in inverse problems. Not only classical constraints, such as sparsity, are considered here, but also constraints expressed through hyperplanes, onto which the projection is easy to compute. The latter constraints lead to improved performance by further constraining the space of geophysically sound solutions.

Both random and structured perturbations affect seismic data. Their removal, to unveil meaningful geophysical information, requires additional priors. Seismic multiples are one form of structured perturbations related to wave-field bouncing. In this paper, we model these undesired signals through a time-varying filtering process accounting for inaccuracies in amplitude, time-shift and average frequency of available templates. We recast the problem of jointly estimating the filters and the signal of interest (primary) in a new convex variational formulation, allowing the incorporation of knowledge about the noise statistics. By making some physically plausible assumptions about the slow time variations of the filters, and by adopting a potential promoting the sparsity of the primary in a wavelet frame, we design a primal-dual algorithm which yields good performance in the provided simulation examples.