Pansharpening first aims at fusing a panchromatic image with a multispectral image to generate an image with the high spatial resolution of the former and the spectral resolution of the latter. In the last decade many algorithms have been presented in the literature for pansharpening using multispectral data. With the increasing availability of hyperspectral systems these methods are now extending to hyperspectral images. In this work, we attempt to compare new pansharpening techniques designed for hyperspectral data with some of the state of the art methods for multispectral pansharpening, which have been adapted for hyperspectral data. Nine methods from different classes are analysed: component substitution, multiresolution analysis, hybrid, Bayesian and matrix decomposition approaches. These techniques are evaluated with the Wald’s Procol on one dataset to characterize their performances and their robustness.

We develop a representation of reverse-time migration (RTM) in terms of Fourier integral operators, the canonical relations of which are graphs. Through the dyadic parabolic decomposition of phase space, we obtain the solution of the wave equation with a boundary source and homogeneous initial conditions using wave packets. On this basis, we develop a numerical procedure for the reverse-time continuation from the boundary of scattering data and for RTM. The algorithms are derived from those we recently developed for the discrete approximate evaluation of the action of Fourier integral operators and inherit their conceptual and numerical properties.

Dictionary learning is a powerful approach for sparse representation. However, the numerical complexity of classical dictionary learning methods restricts their use to atoms with small supports such as patches. In a previous work, we introduced a model based on a composition of convolutions with sparse kernels to build large dictionary atoms with a low computational cost. The subject of this work is to consider this model at the next level, i.e., to build a full dictionary of atoms from convolutions of sparse kernels. Moreover, we further reduce the size of the representation space by organizing the convolution kernels used to build atoms into a tree structure. The performance of the method is tested for the construction of a curvelet dictionary with a known code.

Abstract In this paper, we study the problem of gateway placement in an hybrid mobile ad hoc-satellite network. We propose a genetic algorithm based approach to solve this multi-criteria optimization problem. The analysis of the proposed algorithm is made by means of simulations. Topology dynamics are also taken into account since the node mobility will impact the gateway placement decisions. Our solution shows promising results and displays unmatched flexibility with respect to the optimization criteria.

This paper presents a variational-based approach for fusing hyperspectral and multispectral images. The fusion problem is formulated as an inverse problem whose solution is the target image assumed to live in a lower dimensional subspace. A sparse regularization term is carefully designed, relying on a decomposition of the scene on a set of dictionaries. The dictionary atoms and the supports of the corresponding active coding coefficients are learned from the observed images. Then, conditionally on these dictionaries and supports, the fusion problem is solved via alternating optimization with respect to the target image (using the alternating direction method of multipliers) and the coding coefficients. Simulation results demonstrate the efficiency of the proposed algorithm when compared with state-of-the-art fusion methods.

In this paper, we provide a proof for the conjecture made by Abu Surra et al. [1] to simplify the computation of ensemble input output weight enumerators for protograph-based low density parity check (LDPC) codes. Furthermore, we propose a new method to compute more efficiently the ensemble weight enumerator. This approach can be applied particularly to lighten the computations for high rate codes, generalized LDPC codes or spatially coupled LDPC codes.

Remote sensing images are images of the Earth acquired from planes or satellites. Many different sensors have been developed to image the earth surface, including optical, SAR and hyperspectral images. Change detection on datasets of multitemporal images is one of the main interest of these images. The case where the dataset consist of images acquired by the same sensor has been thoroughly studied, however, dealing with heterogeneous images is very common nowadays. To deal with these images, we proposed a statistical model which describe the joint distribution of their pixel intensity. On unchanged areas, we expect the parameter vector of the model to belong to a manifold. The distance of the model parameter to the manifold can be thus be used as a similarity measure, and the manifold can be learned using images where no changes are present. In this talk I will present the statistical model, its parameter estimation, and the manifold learning approach. The results obtained with this method will be compared with those of other classical similarity measures.

We present a new delay-based transport protocol named FLOWER, that aims at providing a Lower-than-Best-Effort (LBE) service for background traffic using the remaining network capacity. The objective is to propose an alternative to the Low Extra Delay Background Transport (LEDBAT) widely deployed within the official BitTorrent client. Indeed, besides its intra-fairness problem, known as latecomer unfairness, LEDBAT can be too aggressive against TCP, making it ill suited for providing LBE services over certain networks such as constrained wireless networks. By using a fuzzy controller to modulate the sending rate, FLOWER aims to solve LEDBAT issues while fulfilling the role of a LBE protocol. Our simulation results show that FLOWER can carry LBE traffic in network scenarios where LEDBAT can not while solving the latecomer unfairness problem.