Beam acquisition is key in enabling millimeter wave and terahertz radios to achieve their capacity. Due to the use of large antenna 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 for faster beam acquisition. Unfortunately, most 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 and then used for beamforming. 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 a CS matrix optimized 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 and a higher achievable rate than comparable benchmarks.

Identification of lithium-ion (Li-ion) battery models is essential for enhancing the operation of electrical vehicles. This paper develops a novel approach for estimating the equivalent circuit model (ECM) of Li-ion batteries and reconstructing the open-circuit voltage (OCV) and state of charge (SOC) relationship. We formulate the OCV-SOC relation as a piecewise affine (PWA) function and estimate its coefficients and the Markov parameters (impulse response) of the ECM via l₁-regularized least squares. The state space model of the ECM is derived through the Ho-Kalman algorithm. Experiments with simulated and real-life battery data demonstrate the method's effectiveness and advantages with respect to the state of the art.

This paper addresses the key question that when faults occur either the aircraft system dynamics changes due to the fault or these dynamics are unknown (precisely). This question is addressed for the important case of Air Data Sensor failures, due to e.g. icing, for fixed wing aircraft operating in a nominal fight condition. The solution to this question uses basic ideas from subspace Identification to cast this problem in linear least squares problem with convex constraints (nuclear norm and 1-norm constraints). The latter are relaxations of a rank and cardinality constraint. The presented solution is validated using real-life fight test data.

We present a novel problem formulation for model-free data-driven fault diagnosis, in which possible faults are diagnosed simultaneously to identifying the linear time-invariant system. This problem is practically relevant for systems whose model cannot be identified reliably prior to diagnosing possible faults, for instance when operating conditions change over time, when a fault is already present before system identification is carried out, or when the system dynamics change due to the presence of the fault. A computationally attractive solution is proposed by solving the problem using unconstrained convex optimization, where the objective function consists of three terms of which two are non-differentiable. An additional recursive implementation based on a proximal algorithm is presented in order to solve the optimization problem online. The numerical results on a buck converter show the application of the proposed solution both offline and online.

We propose to use the State Estimation by Sum-of-Norms Regularisation (STATESON-)algorithm for recovering the tip-sample interaction in high-speed tapping mode atomic force microscopy (AFM). This approach enables accurate sample height estimation for each independent cantilever oscillation period, provided that the tip-sample interaction dominates the noise. The entire course of the cantilever deflection signal is compared to a modelled counterpart in subsequent convex minimisations, such that the sparse tip-sample interaction can be recovered. Afterwards, the sample height is determined using the minimum smoothed cantilever deflection per cantilever oscillation period. Results from simulation experiments are in favour of the proposed approach as it consistently reveals sharp edges in sample height, as opposed to both the conventional and a closely related existing approach. However, the non-processed cantilever deflection provided most accurate sample height estimation. It is recommended to implement the STATESON-algorithm in the form of a filter to use it in feedback control of the scanner and cantilever excitation.

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.

Model-based fault diagnosis for dynamical systems is a sophisticated task due to model inaccuracies, measurement noise and many possible fault scenarios. By presenting faults in terms of a dictionary, the latter obstacle is recently addressed using well-known techniques for recovering sparse information (e.g. lasso). However, current state-of-the-art methods still require accurate models and measurements for adequate diagnosis. In our contribution we address the problem of data-driven fault diagnosis in the sense that the model of the linear time-invariant (LTI) system is unknown in addition to the fault. Moreover, our aim is to diagnose (concurrent) faults while only having input/output data and the fault dictionary. This implies the user simply plugs in the data and specifies the set of possible faults in order to know the active faults together with an estimate of the dynamic model. The problem is formulated within a blind system identification context resulting in computationally efficient solutions based on convex optimization.

Some applications require high level of image-based classification certainty while keeping the total illumination energy as low as possible. Examples are minimally invasive visual inspection in Industry 4.0, and medical imaging systems such as computed tomography, in which the radiation dose should be kept “as low as is reasonably achievable”. We introduce a sequential object recognition scheme aimed at minimizing phototoxicity or bleaching while achieving a predefined level of decision accuracy. The novel online procedure relies on approximate weighted Bhattacharyya coefficients for determination of future inputs. Simulation results on the MNIST handwritten digit database show how the total illumination energy is decreased with respect to a detection scheme using constant illumination.

We investigate the general adjustment of projection-based phase retrieval algorithms for use with saturated data. In the phase retrieval problem, model fidelity of experimental data containing a non-zero background level, fixed pattern noise, or overexposure, often presents a serious obstacle for standard algorithms. Recently, it was shown that overexposure can help to increase the signal-to-noise ratio in AI applications. We present our first results in exploring this direction in the phase retrieval problem, using as an example the Gerchberg-Saxton algorithm with simulated data. The proposed method can find application in microscopy, characterisation of precise optical instruments, and machine vision applications of Industry4.0.

We demonstrate a novel closed-loop input design technique on the detection of particles in an imaging system such as a fluorescence microscope. The probability of misdiagnosis is minimized while constraining the input energy such that for instance phototoxicity is reduced. The key novelty of the closed-loop design is that each next input is designed based on the most recent information. Using updated hypothesis probabilities, the input energy distribution is optimized for detection such that unresolved pixels have increased illumination next image acquisition. As compared to conventional open-loop, the results show that (regions of) particles are diagnosed using less energy in the closed-loop approach. Besides the closed-loop approach being viable for particle detection in fluorescence microscopy measurements, it can be developed further to apply in different areas such as sequential object segmentation for reliable and efficient product inspection in Industry 4.0.

Modulation enhanced single-molecule localization microscopy (meSMLM) methods improve the localization precision by using patterned illumination to encode additional position information. Iterative meSMLM (imeSMLM) methods iteratively generate prior information on emitter positions, used to locally improve the localization precision during subsequent iterations. The Cramér-Rao lower bound cannot incorporate prior information to bound the best achievable localization precision because it requires estimators to be unbiased. By treating estimands as random variables with a known prior distribution, the Van Trees inequality (VTI) can be used to bound the best possible localization precision of imeSMLM methods. An imeSMLM method is considered, where the positions of in-plane standing-wave illumination patterns are controlled over the course of multiple iterations. Using the VTI, we analytically approximate a lower bound on the maximum localization precision of imeSMLM methods that make use of standing-wave illumination patterns. In addition, we evaluate the maximally achievable localization precision for different illumination pattern placement strategies using Monte Carlo simulations. We show that in the absence of background and under perfect modulation, the information content of signal photons increases exponentially as a function of the iteration count. However, the information increase is no longer exponential as a function of the iteration count under non-zero background, imperfect modulation, or limited mechanical resolution of the illumination positioning system. As a result, imeSMLM with two iterations reaches at most a fivefold improvement over SMLM at 8 expected background photons per pixel and 95% modulation contrast. Moreover, the information increase from imeSMLM is balanced by a reduced signal photon rate. Therefore, SMLM outperforms imeSMLM when considering an equal measurement time and illumination power per iteration. Finally, the VTI is an excellent tool for the assessment of the performance of illumination control and is therefore the method of choice for optimal design and control of imeSMLM methods.

This paper presents a computationally efficient framework in which a single focal-plane image is used to obtain a high-resolution reconstruction of dynamic aberrations. Assuming small-phase aberrations, a non-linear Kalman filter implementation is developed whose computational complexity scales close to linearly with the number of pixels of the focal-plane camera. The performance of themethod is tested in a simulation of an adaptive optics system, where the small-phase assumption is enforced by considering a closed-loop system that uses a low-resolution wavefront sensor to control a deformable mirror. The results confirmthe computational efficiency of the algorithm and showa large robustness against noise and model uncertainties.

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.

In this article, we study preconditioning techniques for the control of the Navier–Stokes equation, where the control only acts on a few parts of the domain. Optimization, discretization, and linearization of the control problem results in a generalized linear saddle-point system. The Schur complement for the generalized saddle-point system is very difficult or even impossible to approximate, which prohibits satisfactory performance of the standard block preconditioners. We apply the multilevel sequentially semiseparable (MSSS) preconditioner to the underlying system. Compared with standard block preconditioning techniques, the MSSS preconditioner computes an approximate factorization of the global generalized saddle-point matrix up to a prescribed accuracy in linear computational complexity. This in turn gives parameter independent convergence for MSSS preconditioned Krylov solvers. We use a simplified wind farm control example to illustrate the performance of the MSSS preconditioner. We also compare the performance of the MSSS preconditioner with the performance of the state-of-the-art preconditioning techniques. Our results show the superiority of the MSSS preconditioning techniques to standard block preconditioning techniques for the control of the Navier–Stokes equation.

This paper presents a computationally efficient wavefront aberration prediction framework for data-driven control in large-scale adaptive optics systems. Our novel prediction algorithm splits prediction into two stages: A highresolution and a low-resolution stage. For the former, we exploit sparsity structures in the system matrices in a data-driven Kalman filtering algorithm and constrain the identified gain to be likewise sparse; for the latter, we identify a denseKalman gain and performcorrections to the suboptimal predictions of the former on a smaller grid. This novel prediction framework is able to retain the robustness to measurement noise of the standardKalman filter in a much more computationally efficient manner, in both its offline and online aspects, while minimally sacrificing performance; its data-driven nature further compensates for modeling errors. As an intermediate result, we present a sparsity-exploiting data-drivenKalman filtering algorithm able to quickly estimate an approximateKalman gain without solving the Riccati equation.