SearcharxivSearch

arXiv subjects

Owen Deen

Publications and source records attributed to Owen Deen.

3 recordsLinked to original sources

gmsEDA: Decomposition of Electrodermal Activity Signals Using Matrix Separation

Electrodermal activity (EDA) signals, which reflect sympathetic nervous system arousal through changes in skin conductance, are widely used in psychological and behavioral research. Decomposing an observed EDA signal into its slowly varying tonic baseline and stimulus-driven phasic component is an important preprocessing step; however, existing methods process signals in isolation and remain highly sensitive to noise and motion artifacts. This work introduces gmsEDA, a new decomposition method based on generalized matrix separation whose model is designed to cope with noise and motion artifacts. Our method analyzes multiple recordings jointly rather than one at a time, taking advantage of patterns shared across signals to produce more accurate and robust results. Numerical experiments on both simulated and real data shows that this approach outperforms existing standard tools.

eess.SP

The Generalized Matrix Separation Problem: Algorithms

When given a generalized matrix separation problem, which aims to recover a low rank matrix $L_0$ and a sparse matrix $S_0$ from $M_0=L_0+HS_0$, the work \cite{CW25} proposes a novel convex optimization problem whose objective function is the sum of the $\ell_1$-norm and nuclear norm. In this paper we detail the iterative algorithms and its associated computations for solving this convex optimization problem. We present various efficient implementation strategies, with attention to practical cases where $H$ is circulant, separable, or block structured. Notably, we propose a preconditioning technique that drastically improved the performance of our algorithms in terms of efficiency, accuracy, and robustness. While this paper serves as an illustrative algorithm implementation manual, we also provide theoretical guarantee for our preconditioning strategy. Numerical results demonstrate the effectiveness of the proposed approach.

math.OC

Fast and accurate log-determinant approximations

We consider the problem of estimating log-determinants of large, sparse, positive definite matrices. A key focus of our algorithm is to reduce computational cost, and it is based on sparse approximate inverses. The algorithm can be implemented to be adaptive, and it uses graph spline approximation to improve accuracy. We illustrate our approach on classes of large sparse matrices.

math.NA