Mostrar el registro sencillo

dc.contributor.authorLuengo García, David
dc.contributor.authorVía Rodríguez, Javier 
dc.contributor.authorTrigano, Thomas
dc.contributor.otherUniversidad de Cantabriaes_ES
dc.date.accessioned2021-06-21T10:00:04Z
dc.date.available2021-06-21T10:00:04Z
dc.date.issued2020
dc.identifier.isbn978-9-0827-9705-3
dc.identifier.otherTEC2016-81900-REDTes_ES
dc.identifier.urihttp://hdl.handle.net/10902/21904
dc.description.abstractIn this paper, we describe an efficient iterative algorithm for finding sparse solutions to a linear system. Apart from the well-known L1 norm regularization, we introduce an additional cost term promoting solutions without too-close activations. This additional term, which is expressed as a sum of cross-products of absolute values, makes the problem nonconvex and difficult to solve. However, the application of the successive convex approximations approach allows us to obtain an efficient algorithm consisting in the solution of a sequence of iteratively reweighted LASSO problems. Numerical simulations on randomly generated waveforms and ECG signals show the good performance of the proposed method.es_ES
dc.description.sponsorshipThis work has been partly funded by the Spanish government through the KERMES excellence network (ref. TEC2016-81900-REDT).es_ES
dc.format.extent5 p.es_ES
dc.language.isoenges_ES
dc.publisherInstitute of Electrical and Electronics Engineers, Inc.es_ES
dc.rights© EURASIP. First published in the Proceedings of the 28th European Signal Processing Conference (EUSIPCO-2020) in 2020, published by EURASIP. IEEE is granted the nonexclusive, irrevocable, royalty-free worldwide rights to publish, sell and distribute the copyrighted work in any format or media without restriction.es_ES
dc.source28th European Signal Processing Conference (EUSIPCO), Amsterdam, Netherlands, 2020, 2045-2049es_ES
dc.subject.otherSparsity-aware learninges_ES
dc.subject.otherLASSOes_ES
dc.subject.otherSparse codinges_ES
dc.subject.otherNon-convex optimizationes_ES
dc.titleEfficient Iteratively reweighted LASSO algorithm for cross-products penalized sparse solutionses_ES
dc.typeinfo:eu-repo/semantics/conferenceObjectes_ES
dc.relation.publisherVersionhttps://doi.org/10.23919/Eusipco47968.2020.9287804es_ES
dc.rights.accessRightsopenAccesses_ES
dc.identifier.DOI10.23919/Eusipco47968.2020.9287804
dc.type.versionpublishedVersiones_ES


Ficheros en el ítem

Thumbnail

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo