Convex optimisation-based methods for K-complex detection

DOI10.1016/J.AMC.2015.07.005MaRDI QIDQ668213zbMATH OpenOpenAlexFDO

Authors Juan-Miguel Gracia

Publication date 18 March 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2015.07.005

zbMATH Keywords

data analysisfeature extractionconvex optimisationbiological signal classificationsignal approximation

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Convex programming (90C25) Applications of mathematical programming (90C90) Detection theory in information and communication theory (94A13) Biomedical imaging and signal processing (92C55)

Recommendations

• Convexity properties in binary detection problems
• Linear estimation and detection in Krylov subspaces
• Opticom and the iterative combination technique for convex minimisation
• NP-Optimal Kernels for Nonparametric Sequential Detection Rules
• The generalized complex kernel affine projection algorithms
• Optimal convex correcting procedures in problems of high dimension
• Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems
• scientific article; zbMATH DE number 848086

Cites work

• scientific article; zbMATH DE number 44907 (Why is no real title available?)
• scientific article; zbMATH DE number 1012640 (Why is no real title available?)
• scientific article; zbMATH DE number 852536 (Why is no real title available?)
• Detecting \(K\)-complexes for sleep stage identification using nonsmooth optimization
• Graph implementations for nonsmooth convex programs
• Linear least squares problems involving fixed knots polynomial splines and their singularity study
• On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0

Cited in

(7)

• Identification of active component functions in finite-max minimisation via a smooth reformulation
• Constant Q-transform-based deep learning architecture for detection of obstructive sleep apnea
• Chebyshev approximation by linear combinations of fixed knot polynomial splines with weighting functions
• Convexity properties in binary detection problems
• Generalised rational approximation and its application to improve deep learning classifiers
• Application of S-transform for automated detection of vigilance level using EEG signals
• Linear least squares problems involving fixed knots polynomial splines and their singularity study

Describes a project that uses

Uses Software

• WEKA
• CVX
• SDPT3

This page was built for publication: Convex optimisation-based methods for K-complex detection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q668213)