Time filter

Source Type

Le Touquet – Paris-Plage, France

Bughin E.,Ecole Normale Superieure de Cachan | Almansa A.,ENST | Grompone Von Gioi R.,Ecole Normale Superieure de Cachan | Tendero Y.,Ecole Normale Superieure de Cachan
Proceedings - International Conference on Image Processing, ICIP | Year: 2010

We propose a new method for fast detection of planar patches in disparity maps. We first use a region growing algorithm on random seeds. This approach is similar to the one introduced in [1] for fast line segment detection in images. Then, the parameter-free criterion introduced in [2] is used to keep only the patches that are planar. The main advantage of our method is to be able to estimate the disparity map precision which is usually a critical parameter in other methods. This method is specially well suited to 3D reconstruction of urban environments from low-baseline aerial or satellite stereo pairs where a piecewise-planar model can be applied. © 2010 IEEE. Source

Ghannoum H.,Laboratory of Electronics and Computer Engineering | Roblin C.,Laboratory of Electronics and Computer Engineering | Begaud X.,ENST
Wireless Personal Communications | Year: 2010

Wireless Body Area Networks (WBANs) are becoming an increasingly important part of the wireless communication system. In such a communication system various electronic devices carried by a person on his body can be connected. In this paper, we investigate the UWB body area propagation channel. The channel characterization is based on UWB on-body channel measurements. This paper describes the measurement campaign and the basic characteristics of the body area propagation channel extracted from measurement data. © 2008 Springer Science+Business Media, LLC. Source

Mahmood A.,ENSTA | Belfiore J.,ENST
IEEE Transactions on Communications | Year: 2010

An efficient algorithm for bit-loading in multicarrier systems is proposed based upon an allocation rhythm/order underlying the classical optimal greedy bit-allocation procedure. An accurate complexity comparison in terms of the exact number of execution cycles over a processor is made with the classical Greedy [1] solution along with another recently proposed optimal bit-loading algorithm [2]. Simulation results verify the significant complexity advantage of our algorithm with no loss in performance. © 2010 IEEE. Source

Battail G.,ENST
International Symposium on Turbo Codes and Iterative Information Processing, ISTC | Year: 2014

Information can only be defined as an equivalence class of sequences with respect to alphabet changes and encodings, hence it is an abstract entity. However, a sequence is necessarily borne by a physical support. Information thus appears as a bridge between the abstract and the concrete. In the living world, the information borne by genomes acts on matter by instructing the assembly of objects. Physical perturbations degrade the supports, hence the sequences they bear, but the information they represent can be almost indefinitely conserved provided they are endowed with error-correcting codes as powerful as to enable their regeneration, and regenerated frequently enough. Codes made of nested components which successively originated over the ages account for the conservation of the oldest parts of the genomes. The component codes are 'soft', meaning that they result from any kind of non-mathematical constraint, e.g., physical-chemical or linguistic. The genomic information instructs the assembly of living structures by the agency of interwoven semantic feedback loops which lock themselves because the synthetized enzymes catalyse their own assembly. © 2014 IEEE. Source

Bouzid M.C.,ENST | Bouzid M.C.,University of Science and Technology Houari Boumediene | Ait Haddadene H.,University of Science and Technology Houari Boumediene | Salhi S.,University of Kent
Computers and Operations Research | Year: 2016

In this paper, we propose an efficient and novel Lagrangian relaxation method which incorporates a new integer linear programming (ILP) formulation to optimally partition a giant tour in the context of a capacitated vehicle routing problem (CVRP). This approach, which we call Lagrangian split (Ls), is more versatile than the ILP which, in most cases, can be intractable using a conventional solver. An effective repair mechanism followed by a local search are also embedded into the process. The mathematical validity of the repair mechanism and its time complexity are also provided. An integration of Ls into a powerful variable neighbourhood search (VNS) is also presented. Computational experiments are conducted to demonstrate that Ls provides encouraging results when applied on benchmark instances and that the integration of Ls into a metaheuristic scheme produces good results when compared to those found by state-of-the-art methods. © 2016 Elsevier Ltd. Source

Discover hidden collaborations