This paper presents an approach to build a very high resolution digitial terrain model with the imagery provided by a stereovision bench mounted on-board a balloon flying at low altitude. The approach is a “simultaneous localization and mapping” procedure, that enables to build a spatially consistent map, by allowing to recover the balloon position with a very high accuracy: only imagery is use...

We present a new hierarchical clustering criteria which can be applied to data set. This is done after generating an initial partition by using a Topological Self Organizing Map. This criteria contains two terms which take into account two di erent errors simultaneously: the square error of the entire clustering (as the Ward criteria) and the topological structure given by the Self Organizing M...

The present paper is aimed at introducing a new algorithm for image encryption using chaotic tent maps and the desired key image. This algorithm consists of two parts, the first of which works in the frequency domain and the second, in the time domain. In the frequency domain, a desired key image is used, and a random number is generated, using the chaotic tent map, in order to change the phase...

We study the optimal transport problem in sub-Riemannian manifolds where the cost function is given by the square of the sub-Riemannian distance. Under appropriate assumptions, we generalize Brenier-McCann’s Theorem proving existence and uniqueness of the optimal transport map. We show the absolute continuity property of Wassertein geodesics, and we address the regularity issue of the optimal m...

We consider the Bayesian inference of a random Gaussian vector in a linear model with a Gaussian model matrix. We derive the maximum a-posteriori (MAP) estimator for this model and show that it can be found using a simple line search over a unimodal function that can be efficiently evaluated. Next, we discuss the application of this estimator in the context of nearoptimal detection of near-Gaus...

We consider the inversion of a linear operator with centered Gaussian white noise by MAP estimation with a Gaussian prior distribution on the solution. The actual estimator is computed approximately by a numerical method. We propose a relation between the stationarity measure of this approximate solution to the mean square error of the exact solution. This relation enables the formulation of a ...

The original Self-Organizing Feature Map (SOFM) has been extended in many ways to suit different goals and application domains. However, the topologies of the map lattice that we can found in literature are nearly always square or, more rarely, hexagonal. In this paper we study alternative grid topologies, which are derived from the geometrical theory of tessellations. Experimental results are ...

A notion of the heat kernel measure is introduced for the L2 completion of a hyperfinite II1-factor with respect to the trace. Some properties of this measure are derived from the corresponding stochastic differential equation. Then the Taylor map is studied for a space of holomorphic functions square integrable with respect to the heat kernel measure. We also define a skeleton map from this sp...

Crime mapping has long been an integral part of the process known today as crime analysis. The New York City Police Department, for example, has traced the use of maps back to at least 1900. The traditional crime map was a jumbo representation of a jurisdiction with pins stuck in it (figure 1.1). The old pin maps were useful for showing where crimes occurred, but they had serious limitations. A...

This paper proposes an iterative maximum a posteriori probability (MAP) receiver for multiple-input-multiple-output (MIMO) and orthogonal frequency-division multiplexing (OFDM) mobile communications. For exploiting the space, time, and frequency diversity, the lowdensity parity-check code (LDPC) is used as a channel coding with a builtin interleaver. The receiver employs the expectation maximiz...