arXiv subjects

Michel Verhaegen

Publications and source records attributed to Michel Verhaegen.

At least 19 recordsLinked to original sources

arXiv2025

Continuous-Time System Identification and OCV Reconstruction of Li-ion Batteries via Regularized Least Squares

Accurate identification of lithium-ion (Li-ion) battery parameters is essential for managing and predicting battery behavior. However, existing discrete-time methods hinder the estimation of physical parameters and face the fast-slow dynamics problem presented in the battery. In this paper, we developed a continuous-time approach that enables the estimation of battery parameters directly from sampled data. This method avoids discretization errors in converting continuous-time models into discrete-time ones, achieving more accurate identification. In addition, we jointly identify the open-circuit voltage (OCV) and the state of charge (SOC) relation of the battery without utilizing offline OCV tests. By modeling the OCV-SOC curve as a cubic B-spline, we achieve a high-fidelity representation of the OCV curve, facilitating its estimation. Through solving a rank and L1 regularized least squares problem, we jointly identify battery parameters and the OCV-SOC relation from the battery's dynamic data. Simulated and real-life data demonstrate the effectiveness of the developed method.

eess.SY↗

arXiv2024

Online input design for discrimination of linear models using concave minimization

Stochastic Closed-Loop Active Fault Diagnosis (CLAFD) aims to select the input sequentially in order to improve the discrimination of different models by minimizing the predicted error probability. As computation of these error probabilities encompasses the evaluation of multidimensional probability integrals, relaxation methods are of interest. This manuscript presents a new method that allows to make an improved trade-off between three factors -- namely maximized accuracy of diagnosis, minimized number of consecutive measurements to achieve that accuracy, and minimized computational effort per time step -- with respect to the state-of-the-art. It relies on minimizing an upper bound on the error probability, which is in the case of linear models with Gaussian noise proven to be concave in the most challenging discrimination conditions. A simulation study is conducted both for open-loop and feedback controlled candidate models. The results demonstrate the favorable trade-off using the new contributions in this manuscript.

eess.SY↗

arXiv2023

In-sector Compressive Beam Alignment for MmWave and THz Radios

Beam alignment is key in enabling millimeter wave and terahertz radios to achieve their capacity. Due to the use of large arrays in these systems, the common exhaustive beam scanning results in a substantial training overhead. Prior work has addressed this issue, by developing compressive sensing (CS)-based methods which exploit channel sparsity to achieve faster beam alignment. Unfortunately, standard CS techniques employ wide beams and suffer from a low signal-to-noise ratio (SNR) in the channel measurements. To solve this challenge, we develop an IEEE 802.11ad/ay compatible technique that takes an in-sector approach for CS. In our method, the angle domain channel is partitioned into several sectors, and the channel within the best sector is estimated for beam alignment. The essence of our framework lies in the construction of a low-resolution beam codebook to identify the best sector and in the design of the CS matrix for in-sector channel estimation. Our beam codebook illuminates distinct non-overlapping sectors and can be realized with low-resolution phased arrays. We show that the proposed codebook results in a higher received SNR than the state-of-the-art sector sweep codebooks. Furthermore, our optimized CS matrix achieves a better in-sector channel reconstruction than comparable benchmarks.

eess.SP↗

arXiv2023

Analysis of Orthogonal Matching Pursuit for Compressed Sensing in Practical Settings

Orthogonal matching pursuit (OMP) is a widely used greedy algorithm for sparse signal recovery in compressed sensing (CS). Prior work on OMP, however, has only provided reconstruction guarantees under the assumption that the columns of the CS matrix have equal norms, which is unrealistic in many practical CS applications due to hardware constraints. In this paper, we derive sparse recovery guarantees with OMP, when the CS matrix has unequal column norms. Finally, we show that CS matrices whose column norms are comparable achieve tight guarantees for the successful recovery of the support of a sparse signal and a low mean squared error in the estimate.

eess.SP↗

arXiv2022

Data-enabled predictive control with instrumental variables: the direct equivalence with subspace predictive control

Direct data-driven control has attracted substantial interest since it enables optimization-based control without the need for a parametric model. This paper presents a new Instrumental Variable~(IV) approach to Data-enabled Predictive Control (DeePC) that results in favorable noise mitigation properties, and demonstrates the direct equivalence between DeePC and Subspace Predictive Control (SPC). The methodology relies on the derivation of the characteristic equation in DeePC along the lines of subspace identification algorithms. A particular choice of IVs is presented that is uncorrelated with future noise, but at the same time highly correlated with the data matrix. A simulation study demonstrates the improved performance of the proposed algorithm in the presence of process and measurement noise.

eess.SY↗

arXiv2022

Structured Sensing Matrix Design for In-sector Compressed mmWave Channel Estimation

Fast millimeter wave (mmWave) channel estimation techniques based on compressed sensing (CS) suffer from low signal-to-noise ratio (SNR) in the channel measurements, due to the use of wide beams. To address this problem, we develop an in-sector CS-based mmWave channel estimation technique that focuses energy on a sector in the angle domain. Specifically, we construct a new class of structured CS matrices to estimate the channel within the sector of interest. To this end, we first determine an optimal sampling pattern when the number of measurements is equal to the sector dimension and then use its subsampled version in the sub-Nyquist regime. Our approach results in low aliasing artifacts in the sector of interest and better channel estimates than benchmark algorithms.

eess.SP↗

arXiv2021

Subpixel image reconstruction using nonuniform defocused images

This paper considers the problem of reconstructing an object with high-resolution using several low-resolution images, which are degraded due to nonuniform defocus effects caused by angular misalignment of the subpixel motions. The new algorithm, indicated by the Superresolution And Nonuniform Defocus Removal (SANDR) algorithm, simultaneously performs the nonuniform defocus removal as well as the superresolution reconstruction. The SANDR algorithm combines non-sequentially the nonuniform defocus removal method recently developed by Thao et al. and the least squares approach for subpixel image reconstruction. Hence, it inherits global convergence from its two component techniques and avoids the typical error amplification of multi-step optimization contributing to its robustness. Further, existing acceleration techniques for optimization have been proposed that assure fast convergence of the SANDR algorithm going from rate O(1/k) to O(1/k^2) compared to most existing superresolution (SR) techniques using the gradient descent method. An extensive simulation study evaluating the new SANDR algorithm has been conducted. As no algorithms are available to address the combined problem, in this simulation study we restrict the comparison of SANDR with other SR algorithms neglecting the defocus aberrations. Even for this case the advantages of the SANDR algorithm have been demonstrated.

math.OC↗

arXiv2021

Projection methods for high numerical aperture phase retrieval

We develop for the first time a mathematical framework in which the class of projection algorithms can be applied to high numerical aperture (NA) phase retrieval. Within this framework, we first analyze the basic steps of solving the high-NA phase retrieval problem by projection algorithms and establish the closed forms of all the relevant prox-operators. We then study the geometry of the high-NA phase retrieval problem and the obtained results are subsequently used to establish convergence criteria of projection algorithms in the presence of noise. Making use of the vectorial point-spread-function (PSF) is, on the one hand, the key difference between this paper and the literature of phase retrieval mathematics which deals with the scalar PSF. The results of this paper, on the other hand, can be viewed as extensions of those concerning projection methods for low-NA phase retrieval. Importantly, the improved performance of projection methods over the other classes of phase retrieval algorithms in the low-NA setting now also becomes applicable to the high-NA case. This is demonstrated by the accompanying numerical results which show that available solution approaches for high-NA phase retrieval are outperformed by projection methods.

math.OC↗

arXiv2021

Nonuniform Defocus Removal for Image Classification

We propose and study the single-frame anisoplanatic deconvolution problem associated with image classification using machine learning algorithms, named the nonuniform defocus removal (NDR) problem. Mathematical analysis of the NDR problem is done and the so-called defocus removal (DR) algorithm for solving it is proposed. Global convergence of the DR algorithm is established without imposing any unverifiable assumption. Numerical results on simulation data show significant features of DR including solvability, noise robustness, convergence, model insensitivity and computational efficiency. Physical relevance of the NDR problem and practicability of the DR algorithm are tested on experimental data. Back to the application that originally motivated the investigation of the NDR problem, we show that the DR algorithm can improve the accuracy of classifying distorted images using convolutional neural networks. The key difference of this paper compared to most existing works on single-frame anisoplanatic deconvolution is that the new method does not require the data image to be decomposable into isoplanatic subregions. Therefore, solution approaches partitioning the image into isoplanatic zones are not applicable to the NDR problem and those handling the entire image such as the DR algorithm need to be developed and analyzed.

cs.CV↗

arXiv2020

Shack-Hartmann sensor as an imaging system with a phase diversity

Conventional methods of wavefront reconstruction from the raw data of the Shack-Hartmann sensor use the focal spot shifts and discard the high-frequency information about the wavefront. Phase-retrieval-based methods treat the Hartmann pattern as the diffraction image and use the Rayleigh-Sommerfeld propagation to estimate the wavefront with greater accuracy and resolution. In this Letter, we propose a novel approach to the phase-retrieval-based reconstruction by considering the Hartmann pattern as a point-spread function of a general imaging system with an introduced phase diversity of a special type. This model allows one not only to use any phase retrieval algorithm to reconstruct the wavefront but also to analyse the limitations of the phase-retrieval-based methods. We demonstrate the validity of this approach both on the simulated and experimental data.

physics.optics↗

arXiv2020

Blind multi-frame deconvolution for the correction of space-variant blur in images

This paper demonstrates a practical method that can correct spatial varying blur from a set of images of the same object. The algorithm jointly estimates the object and local point spread functions~(PSF). The method prioritizes sections with small spatial variation in the PSF for deconvolution. This novel approach can handle large translations in the local PSFs, hence the algorithm is able to correct for morph in the images. Robustness to noise is demonstrated in numerical simulations. Numerical experiments are conducted where the performance of the algorithm is compared to a state-of-the-art method found in literature. The algorithm can be used in situation with space-temporal variation of the PSF and can be applied in situations where the signal-to-noise ratio is low.

eess.IV↗

arXiv2020

Convex combination of alternating projection and Douglas-Rachford operators for phase retrieval

We present the convergence analysis of convex combination of the alternating projection and Douglas-Rachford operators for solving the phase retrieval problem. New convergence criteria for iterations generated by the algorithm are established by applying various schemes of numerical analysis and exploring both physical and mathematical characteristics of the phase retrieval problem. Numerical results demonstrate the advantages of the algorithm over the other widely known projection methods in practically relevant simulations.

math.NA↗

arXiv2019

Phase retrieval with sparse phase constraint

For the first time, this paper investigates the phase retrieval problem with the assumption that the phase (of the complex signal) is sparse in contrast to the sparsity assumption on the signal itself as considered in the literature of sparse signal processing. The intended application of this new problem model, which will be conducted in a follow-up paper, is to practical phase retrieval problems where the aberration phase is sparse with respect to the orthogonal basis of Zernike polynomials. Such a problem is called sparse phase retrieval (SPR) problem in this paper. When the amplitude modulation at the exit pupil is uniform, a new scheme of sparsity regularization on phase is proposed to capture the sparsity property of the SPR problem. Based on this regularization scheme, we design and analyze an efficient solution method, named SROP algorithm, for solving SPR given only a single intensity point-spread-function image. The algorithm is a combination of the Gerchberg-Saxton algorithm with the newly proposed sparsity regularization on the phase. The latter regularization step is mathematically a rotation but with direction varying in iterations. Surprisingly, this rotation is shown to be a metric projection on an auxiliary set which is independent of iterations. As a consequence, SROP algorithm is proved to be the cyclic projections algorithm for solving a feasibility problem involving three auxiliary sets. Analyzing regularity properties of the latter auxiliary sets, we obtain convergence results for SROP algorithm based on recent convergence theory for the cyclic projections algorithm. Numerical results show clear effectiveness of the new regularization scheme for solving the SPR problem.

math.OC↗

arXiv2018

Some new characterizations of intrinsic transversality in Hilbert spaces

Motivated by a number of research questions concerning transversality-type properties of pairs of sets recently raised by Ioffe and Kruger, this paper reports several new characterizations of the intrinsic transversality property in Hilbert spaces. Our dual space results clarify the picture of intrinsic transversality, its variants and the only existing sufficient dual condition for subtransversality, and actually unify them. New primal space characterizations of the intrinsic transversality which is originally a dual space condition lead to new understanding of the property in terms of primal space elements for the first time. As a consequence, the obtained analysis allows us to address a number of research questions asked by the two aforementioned researchers about the intrinsic transversality property in the Hilbert space setting.

math.OC↗

arXiv2018

Blind single-frame deconvolution by tangential iterative projections (TIP)

Deconvolution serves as a computational means of removing the effect of optical aberrations from recorded images and is employed in many technical and scientific fields of study. In most imaging scenarios the nature of the blurring kernel or point-spread function (PSF) of the imaging system is unknown and both the object and PSF can be estimated using different forms of mathematical optimisation. The Tangential Iterative Projections (TIP) algorithm is a multi-frame deconvolution framework where multiple images can be combined to obtain a single estimate of the object. It is shown here that this framework may be also used for single-frame deconvolution with a few modifications to the algorithm. This step from multiple to one frame is non-trivial and greatly improves the applicability of the TIP framework to most imaging scenarios.

eess.IV↗

arXiv2018

QUARKS: Identification of large-scale Kronecker Vector-AutoRegressive models

In this paper we propose a Kronecker-based modeling for identifying the spatial-temporal dynamics of large sensor arrays. The class of Kronecker networks is defined for which we formulate a Vector Autoregressive model. Its coefficient-matrices are decomposed into a sum of Kronecker products. For a two-dimensional array of size $N \times N$, and when the number of terms in the sum is small compared to $N$, exploiting the Kronecker structure leads to high data compression. We propose an Alternating Least Squares algorithm to identify the coefficient matrices with $\mathcal{O}(N^3N_t)$, where $N_t$ is the number of temporal samples, instead of $\mathcal{O}(N^6)$ in the unstructured case. This framework moreover allows for a convenient integration of more structure (e.g sparse, banded, Toeplitz) on the factor matrices. Numerical examples on atmospheric turbulence data has shown comparable performances with the unstructured least-squares estimation while the number of parameters is growing only linearly w.r.t. the number of nodes instead of quadratically in the full unstructured matrix case.

eess.SY↗

arXiv2018

Anisoplanatic adaptive optics in parallelized laser scanningmicroscopy

Inhomogeneities in the refractive index of a biological sample can introduce phase aberrationsin microscopy systems, severely impairing the quality of images. Adaptive optics can be employed to correct for phase aberrations and improve image quality. However, conventional adaptive optics can only correct a single phase aberration for the whole field of view (isoplanatic correction) while, due to the three dimensional nature of biological tissues, sample induced aberrations in microscopy often vary throughout the field of view (anisoplanatic aberration), limiting significantly the effectiveness of adaptive optics. This paper reports on a new approach for aberration correction in laser scanning confocal microscopy, in which a spatial light modulator is used to generate multiple excitation points in the sample to simultaneously scan different portions of the field of view with completely independent correction, achieving anisoplanatic compensation of sample induced aberrations. The method was tested in 150 μm thick whole Drosophila brains, showing a dramatic improvement in resolution and sharpness when compared to conventional isoplanatic adaptive optics.

physics.optics↗

arXiv2018

Solving large-scale general phase retrieval problems via a sequence of convex relaxations

We present a convex relaxation-based algorithm for large-scale general phase retrieval problems. General phase retrieval problems include i.a. the estimation of the phase of the optical field in the pupil plane based on intensity measurements of a point source recorded in the image (focal) plane. The non-convex problem of finding the complex field that generates the correct intensity is reformulated into a rank constraint problem. The nuclear norm is used to obtain the convex relaxation of the phase retrieval problem. A new iterative method, indicated as Convex Optimization-based Phase Retrieval (COPR), is presented, with each iteration consisting of solving a convex problem. In the noise-free case and for a class of phase retrieval problems the solutions of the minimization problems converge linearly or faster towards a correct solution. Since the solutions to nuclear norm minimization problems can be computed using semidefinite programming, and this tends to be an expensive optimization in terms of scalability, we provide a fast ADMM algorithm that exploits the problem structure. The performance of the COPR algorithm is demonstrated in a realistic numerical simulation study, demonstrating its improvements in reliability and speed with respect to state-of-the-art methods.

math.OC↗