English
Related papers

Related papers: On the Computational Complexity of the Secure Stat…

200 papers

We consider the problem of robust state estimation in the presence of integrity attacks. There are $m$ sensors monitoring a dynamical process. Subject to the integrity attacks, $p$ out of $m$ measurements can be arbitrarily manipulated. The…

Information Theory · Computer Science 2016-01-19 Duo Han , Yilin Mo , Lihua Xie

In this article, we investigate the problem of state reconstruction of four-level quantum systems. A realistic scenario is considered with measurement results distorted by random unitary operators. Two frames which define injective…

Quantum Physics · Physics 2021-07-20 Artur Czerwinski

Resilient state recovery of cyber-physical systems has attracted much research attention due to the unique challenges posed by the tight coupling between communication, computation, and the underlying physics of such systems. By modeling…

Optimization and Control · Mathematics 2025-07-31 Yu Zheng , Olugbenga Moses Anubi , Warren E. Dixon

We propose a systematic method for constructing a sparse data reconstruction algorithm in compressed sensing at a relatively low computational cost for general observation matrix. It is known that the cost of l1-norm minimization using a…

Information Theory · Computer Science 2014-04-10 Koujin Takeda , Yoshiyuki Kabashima

This paper addresses the problem of resilient state estimation and attack reconstruction for bounded-error nonlinear discrete-time systems with nonlinear observations/ constraints, where both sensors and actuators can be compromised by…

Systems and Control · Electrical Eng. & Systems 2023-09-26 Mohammad Khajenejad , Zeyuan Jin , Thach Ngoc Dinh , Sze Zheng Yong

The computation of the sparse principal component of a matrix is equivalent to the identification of its principal submatrix with the largest maximum eigenvalue. Finding this optimal submatrix is what renders the problem…

Information Theory · Computer Science 2013-12-23 Megasthenis Asteris , Dimitris S. Papailiopoulos , George N. Karystinos

In compressed sensing, we wish to reconstruct a sparse signal $x$ from observed data $y$. In sparse coding, on the other hand, we wish to find a representation of an observed signal $y$ as a sparse linear combination, with coefficients $x$,…

Computer Vision and Pattern Recognition · Computer Science 2013-11-25 Will Landecker , Rick Chartrand , Simon DeDeo

This white paper demonstrates that reverse engineering Unidentified Aerial Phenomena (UAP) is NP-complete under classical computational paradigms. By modeling UAP reconstruction as an automaton identification problem with a state…

Computational Complexity · Computer Science 2025-05-02 Karim Daghbouche

Sparse coding and dictionary learning are popular techniques for linear inverse problems such as denoising or inpainting. However in many cases, the measurement process is nonlinear, for example for clipped, quantized or 1-bit measurements.…

Signal Processing · Electrical Eng. & Systems 2020-01-08 Lucas Rencker , Francis Bach , Wenwu Wang , Mark D. Plumbley

Recovery of support of a sparse vector from simple measurements is a widely-studied problem, considered under the frameworks of compressed sensing, 1-bit compressed sensing, and more general single index models. We consider generalizations…

Machine Learning · Statistics 2021-11-05 Venkata Gandikota , Arya Mazumdar , Soumyabrata Pal

We consider the problem of finding a sparse solution for an underdetermined linear system of equations when the known parameters on both sides of the system are subject to perturbation. This problem is particularly relevant to…

Systems and Control · Computer Science 2016-06-16 Reza Arablouei

Recent contributions in the field of quantum state tomography have shown that, despite the exponential growth of Hilbert space with the number of subsystems, tomography of one-dimensional quantum systems may still be performed efficiently…

Quantum Physics · Physics 2013-07-19 Tillmann Baumgratz , David Gross , Marcus Cramer , Martin B. Plenio

Optimal sensor placement is a central challenge in the design, prediction, estimation, and control of high-dimensional systems. High-dimensional states can often leverage a latent low-dimensional representation, and this inherent…

Optimization and Control · Mathematics 2020-05-18 Krithika Manohar , Bingni W. Brunton , J. Nathan Kutz , Steven L. Brunton

A linear inverse problem is proposed that requires the determination of multiple unknown signal vectors. Each unknown vector passes through a different system matrix and the results are added to yield a single observation vector. Given the…

Numerical Analysis · Computer Science 2010-09-03 Adam C. Zelinski , Vivek K Goyal , Elfar Adalsteinsson

Compressed sensing investigates the recovery of sparse signals from linear measurements. But often, in a wide range of applications, one is given only the absolute values (squared) of the linear measurements. Recovering such signals (not…

Functional Analysis · Mathematics 2015-09-29 Irena Bojarovska , Axel Flinth

The sparse linear reconstruction problem is a core problem in signal processing which aims to recover sparse solutions to linear systems. The original problem regularized by the total number of nonzero components (also known as $L_0$…

Optimization and Control · Mathematics 2025-11-19 Yuyuan Ouyang , Kyle Yates

The problem of state reconstruction is considered for uncertain linear time-invariant systems with overparameterization, arbitrary state-space matrices and unknown additive perturbation described by an exosystem. A novel adaptive observer…

Systems and Control · Electrical Eng. & Systems 2024-03-14 Anton Glushchenko , Konstantin Lastochkin

The problem of recovering a structured signal from its linear measurements in the presence of speckle noise is studied. This problem appears in many imaging systems such as synthetic aperture radar and optical coherence tomography. The…

Information Theory · Computer Science 2021-08-03 Wenda Zhou , Shirin Jalali , Arian Maleki

We prove that strong structural controllability of a pair of structural matrices $(\mathcal{A},\mathcal{B})$ can be verified in time linear in $n + r + \nu$, where $\mathcal{A}$ is square, $n$ and $r$ denote the number of columns of…

Optimization and Control · Mathematics 2016-11-18 Alexander Weber , Gunther Reissig , Ferdinand Svaricek

When working with quantum states, analysis of the final quantum state generated through probabilistic measurements is essential. This analysis is typically conducted by constructing the density matrix from either partial or full tomography…

Quantum Physics · Physics 2025-01-14 Rohit Prasad , Pratyay Ghosh , Ronny Thomale , Tobias Huber-Loyola