Search

Your search keyword '"Baghious, El Houssaïn"' showing total 14 results
Start Over Author "Baghious, El Houssaïn" Publication Year Range Last 50 years
14 results on '"Baghious, El Houssaïn"'

1. Synthetic Aperture Radar Image Segmentation with Quantum Annealing

Author

Presles, Timothe, Enderli, Cyrille, Burel, Gilles, and Baghious, El Houssain

Subjects
Computer Science - Emerging Technologies, Quantum Physics
Abstract

In image processing, image segmentation is the process of partitioning a digital image into multiple image segment. Among state-of-the-art methods, Markov Random Fields (MRF) can be used to model dependencies between pixels, and achieve a segmentation by minimizing an associated cost function. Currently, finding the optimal set of segments for a given image modeled as a MRF appears to be NP-hard. In this paper, we aim to take advantage of the exponential scalability of quantum computing to speed up the segmentation of Synthetic Aperture Radar images. For that purpose, we propose an hybrid quantum annealing classical optimization Expectation Maximization algorithm to obtain optimal sets of segments. After proposing suitable formulations, we discuss the performances and the scalability of our approach on the D-Wave quantum computer. We also propose a short study of optimal computation parameters to enlighten the limits and potential of the adiabatic quantum computation to solve large instances of combinatorial optimization problems., Comment: 15 pages, 7 figures

Published
2023

2. Phase-coded Radar Waveform Design with Quantum Annealing

Author

Presles, Timothe, Enderli, Cyrille, Burel, Gilles, and Baghious, El Houssain

Subjects
Computer Science - Emerging Technologies
Abstract

The Integrated Side Lobe Ratio (ISLR) problem we consider here consists in finding optimal sequences of phase shifts in order to minimize the mean squared cross-correlation side lobes of a transmitted radar signal and a mismatched replica. Currently, ISLR does not seem to be easier than the general polynomial unconstrained binary problem, which is NP-hard. In our work, we aim to take advantage of the exponential scalability of quantum computing to find new optima, by solving the ISLR problem on a quantum annealer. This quantum device is designed to solve quadratic optimization problems with binary variables (QUBO). After proposing suitable formulation for different instances of the ISLR, we discuss the performances and the scalability of our approach on the D-Wave quantum computer. More broadly, our work enlightens the limits and potential of the adiabatic quantum computation for the solving of large instances of combinatorial optimization problems., Comment: 11 pages, 4 figures, 1 table, to be published in IET Radar, Sonar and Navigation

Published
2023
Full Text
View/download PDF

3. Hypercube Quantum Search: Exact Computation of the Probability of Success in Polynomial Time

Author

Pillin, Hugo, Burel, Gilles, Baird, Paul, Baghious, El-Houssaïn, and Gautier, Roland

Subjects
Quantum Physics, Mathematics - Quantum Algebra
Abstract

In the emerging domain of quantum algorithms, the Grover's quantum search is certainly one of the most significant. It is relatively simple, performs a useful task and more importantly, does it in an optimal way. However, due to the success of quantum walks in the field, it is logical to study quantum search variants over several kind of walks. In this paper, we propose an in-depth study of the quantum search over a hypercube layout. First, through the analysis of elementary walk operators restricted to suitable eigenspaces, we show that the acting component of the search algorithm takes place in a small subspace of the Hilbert workspace that grows linearly with the problem size. Subsequently, we exploit this property to predict the exact evolution of the probability of success of the quantum search in polynomial time., Comment: 22 pages, 13 figures

Published
2022
Full Text
View/download PDF

5. Synthetic aperture radar image segmentation with quantum annealing.

Author

Presles, Timothé, Enderli, Cyrille, Burel, Gilles, and Baghious, El Houssaïn

Subjects
QUANTUM annealing, SYNTHETIC aperture radar, IMAGE segmentation, SYNTHETIC apertures, MARKOV random fields, COST functions, COMBINATORIAL optimization
Abstract

In image processing, image segmentation is the process of partitioning a digital image into multiple image segments. Among state‐of‐the‐art methods, Markov random fields can be used to model dependencies between pixels and achieve a segmentation by minimising an associated cost function. Currently, finding the optimal set of segments for a given image modelled as a Markov random fields appears to be NP‐hard. The authors aim to take advantage of the exponential scalability of quantum computing to speed up the segmentation of synthetic aperture radar images. For that purpose, the authors propose a hybrid quantum annealing classical optimisation expectation maximisation algorithm to obtain optimal sets of segments. After proposing suitable formulations, the authors discuss the performances and the scalability of authors' approach on the D‐Wave quantum computer. The authors also propose a short study of optimal computation parameters to enlighten the limits and potential of the adiabatic quantum computation to solve large instances of combinatorial optimisation problems. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

6. Phase‐coded radar waveform design with quantum annealing.

Author

Presles, Timothé, Enderli, Cyrille, Burel, Gilles, and Baghious, El Houssaïn

Subjects
QUANTUM annealing, COMBINATORIAL optimization, RADAR, QUANTUM computing, QUANTUM computers, MIMO radar
Abstract

The Integrated Side Lobe Ratio (ISLR) problem the authors consider here consists in finding optimal sequences of phase shifts in order to minimise the mean squared cross‐correlation side lobes of a transmitted radar signal and a mismatched replica. Currently, ISLR does not seem to be easier than the general polynomial unconstrained binary problem, which is NP‐hard. In their work, the authors aim to take advantage of the scalability of quantum computing to find new optima, by solving the ISLR problem on a quantum annealer. This quantum device is designed to solve quadratic optimisation problems with binary variables (QUBO). After proposing suitable formulation for different instances of the ISLR, the authors discuss the performances and the scalability of their approach on the D‐Wave quantum computer. More broadly, their work enlightens the limits and potential of the adiabatic quantum computation for the solving of large instances of combinatorial optimisation problems. [ABSTRACT FROM AUTHOR]

Published
2024
Full Text
View/download PDF

8. Block Robust Algorithm for Network Echo Cancellation

Author

Alaeddine, Hamzé, Baghious, El Houssaïn, Burel, Gilles, Burel, Gilles, Lab-STICC_UBO_CACS_COM, Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS), Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (UMR 3192) (Lab-STICC), Université européenne de Bretagne - European University of Brittany (UEB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Institut Brestois du Numérique et des Mathématiques (IBNM), and Université de Brest (UBO)-Télécom Bretagne-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)

Subjects
Fermat Number Transform, Echo canceller, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, Adaptive filters, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, Robust Proportionate Normalized Least Mean Squares (RPNLMS++), [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
Abstract

http://www.praiseworthyprize.com/IRECAP.htm; International audience; This paper is about an efficient implementation of adaptive filtering for echo cancelers. Recently a fast converging algorithm called Robust Proportionate Normalized Least Mean Squares (RPNLMS++) against double-talk has been proposed. This paper presents a realization of an improved version of the previous RPNLMS++ adaptive filter using block structure in which the filter coefficients are adjusted one per each output block. Then, an efficient implementation of the block filtering process is proposed using Number Theoretic Transforms (NTT) which can significantly reduce the computation complexity of filter implantation on Digital Signal Processor (DSP). Analyses of convergence properties, during single and double-talk, and complexity show that the new block adaptive filter permits fast implementations while maintaining performance equivalent to that of the widely used RPNLMS++ adaptive filter.

Published
2013

9. Fast Algorithm for Optimal Design of Bloc Digital Filters Based on Circulant Matrices

Author

Daher, Ali, Baghious, El Houssaïn, Burel, Gilles, Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (UMR 3192) (Lab-STICC), Université européenne de Bretagne - European University of Brittany (UEB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Télécom Bretagne-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS), Lab-STICC_UBO_CACS_COM, Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS), and Azou, Stéphane

Subjects
circulant matrix, Aliasing, [INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, Toeplitz matrix, block digital filters, overlap-save, time-varying systems, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience; Block digital filtering has been suggested to reduce the computational complexity and to increase the parallelism of computation in digital filtering systems. In this letter, a fast algorithm for optimal design of block digital filters (BDFs) is developed. This algorithm, based on circulant, Toeplitz and shift cyclic matrices, not only reduces the computational complexity of the design process but also decreases the memory requirements.

Published
2008

10. Realization of block adaptive filters using Fermat number transforms

Author

Baghious, El Houssaïn, Madre, Guillaume, Alaeddine, Hamzé, Burel, Gilles, Burel, Gilles, Laboratoire d'Electronique et Systèmes de Télécommunications (LEST), and Université de Brest (UBO)-Ecole Nationale Supérieure des Télécommunications de Bretagne-Centre National de la Recherche Scientifique (CNRS)

Subjects
[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience; This paper is about an efficient implementation of adaptive filtering for echo cancelers. First, a realization of an improved Proportionate Normalized Least Mean Squares (PNLMS+ +) adaptive filter using block structure is presented. Then, an efficient implementation of the block filtering process is proposed using Number Theoretic Transforms (NTT) which can significantly reduce the computation complexity of filter implantation on Digital Signal Processor (DSP).

Published
2004

11. Synchronisation d'un récepteur Chaos Shift Keying par filtrage Unscented Kalman

Author

Azou, Stéphane, Le Goff, Sébastien, Baghious, El Houssaïn, Burel, Gilles, Laboratoire d'Electronique et Systèmes de Télécommunications (LEST), Université de Brest (UBO)-Ecole Nationale Supérieure des Télécommunications de Bretagne-Centre National de la Recherche Scientifique (CNRS), and Burel, Gilles

Subjects
[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, ComputingMilieux_MISCELLANEOUS, [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience

Published
2001

14. Realization of Block Robust Adaptive Filters using Generalized Sliding Fermat Number Transform

Author

Alaeddine, Hamze, Baghious, El-Houssain, Burel, G., Madre, Guillaume, Baghious, El Houssaïn, Laboratoire d'Electronique et Systèmes de Télécommunications (LEST), Université de Brest (UBO)-Ecole Nationale Supérieure des Télécommunications de Bretagne-Centre National de la Recherche Scientifique (CNRS), Lab-STICC_UBO_CACS_COM, Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance (Lab-STICC), École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), Université de Brest (UBO)-Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)-École Nationale d'Ingénieurs de Brest (ENIB)-Université de Bretagne Sud (UBS)-Université de Brest (UBO)-Télécom Bretagne-Institut Brestois du Numérique et des Mathématiques (IBNM), and Université de Brest (UBO)-Université européenne de Bretagne - European University of Brittany (UEB)-École Nationale Supérieure de Techniques Avancées Bretagne (ENSTA Bretagne)-Institut Mines-Télécom [Paris] (IMT)-Centre National de la Recherche Scientifique (CNRS)

Subjects
[INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing, [INFO.INFO-TS] Computer Science [cs]/Signal and Image Processing, [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing, [SPI.SIGNAL] Engineering Sciences [physics]/Signal and Image processing
Abstract

International audience; This paper is about an efficient implementation of adaptive filtering for echo cancelers. First, a realization of an improved Block Proportionate Normalized Least Mean Squares (BPNLMS++) using Generalized Sliding Fermat Number Transform (GSFNT) is presented. Unfortunately, during the double-talk mode, the echo cancelers often diverge. We can cope with this problem by employing a double-talk detector formed by two Voice Activity Detectors (VAD's) . We propose a general system based on the Robust-Block-PNLMS ++ (RBPNLMS++) adaptive filter combined with a post-filter. The general system was implemented with GSFNT which can significantly reduce the computation complexity of the filter implantation on Digital Signal Processing (DSP) .

Published
2006

Catalog

Books, media, physical & digital resources
See catalog results