default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKarin Schnass
Person information
- affiliation: University of Innsbruck
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2009
[b1]Karin Schnass
:
Sparsity & [and] dictionaries - algorithms & [and] design. EPFL, Switzerland, 2009
Journal Articles
- 2022
- [j12]Marie-Christine Pali, Simon Ruetz, Karin Schnass:
Average Performance of OMP and Thresholding Under Dictionary Mismatch. IEEE Signal Process. Lett. 29: 1077-1081 (2022) - 2021
- [j11]Simon Ruetz, Karin Schnass:
Submatrices with NonUniformly Selected Random Supports and Insights into Sparse Approximation. SIAM J. Matrix Anal. Appl. 42(3): 1268-1289 (2021) - 2019
- [j10]Karin Schnass:
Corrections to "Average Performance of Orthogonal Matching Pursuit (OMP) for Sparse Approximation". IEEE Signal Process. Lett. 26(10): 1566-1567 (2019) - [j9]Michael Sandbichler, Karin Schnass:
Online and Stable Learning of Analysis Operators. IEEE Trans. Signal Process. 67(1): 41-53 (2019) - 2018
- [j8]Valeriya Naumova, Karin Schnass:
Fast dictionary learning from incomplete data. EURASIP J. Adv. Signal Process. 2018: 12 (2018) - [j7]Karin Schnass:
Average Performance of Orthogonal Matching Pursuit (OMP) for Sparse Approximation. IEEE Signal Process. Lett. 25(12): 1865-1869 (2018) - 2015
- [j6]Karin Schnass:
Local identification of overcomplete dictionaries. J. Mach. Learn. Res. 16: 1211-1242 (2015) - 2012
- [j5]Massimo Fornasier, Karin Schnass, Jan Vybíral:
Learning Functions of Few Arbitrary Linear Parameters in High Dimensions. Found. Comput. Math. 12(2): 229-262 (2012) - 2010
- [j4]Rémi Gribonval, Karin Schnass:
Dictionary identification: sparse matrix-factorization via l1-minimization. IEEE Trans. Inf. Theory 56(7): 3523-3539 (2010) - 2008
- [j3]Holger Rauhut, Karin Schnass, Pierre Vandergheynst:
Compressed Sensing and Redundant Dictionaries. IEEE Trans. Inf. Theory 54(5): 2210-2219 (2008) - [j2]Karin Schnass, Pierre Vandergheynst:
Dictionary Preconditioning for Greedy Algorithms. IEEE Trans. Signal Process. 56(5): 1994-2002 (2008) - 2007
- [j1]Karin Schnass, Pierre Vandergheynst:
Average Performance Analysis for Thresholding. IEEE Signal Process. Lett. 14(11): 828-831 (2007)
Conference and Workshop Papers
- 2017
- [c6]Valeriya Naumova, Karin Schnass:
Dictionary learning from incomplete data for efficient image restoration. EUSIPCO 2017: 1425-1429 - 2011
- [c5]Karin Schnass, Jan Vybíral:
Compressed learning of high-dimensional sparse functions. ICASSP 2011: 3924-3927 - 2010
- [c4]Karin Schnass, Pierre Vandergheynst:
A union of incoherent spaces model for classification. ICASSP 2010: 5490-5493 - 2008
- [c3]Rémi Gribonval, Karin Schnass:
Dictionary identifiability from few training samples. EUSIPCO 2008: 1-5 - 2007
- [c2]Rémi Gribonval, Boris Mailhé, Holger Rauhut, Karin Schnass, Pierre Vandergheynst:
Average Case Analysis of Multichannel Thresholding. ICASSP (2) 2007: 853-856 - 2006
- [c1]Karin Schnass, Pierre Vandergheynst, Pascal Frossard:
Distributed Sensing of Noisy Signals by Thresholding of Redundant Expansions. MMSP 2006: 1-4
Informal and Other Publications
- 2023
- [i13]Simon Ruetz, Karin Schnass:
Convergence of alternating minimisation algorithms for dictionary learning. CoRR abs/2304.01768 (2023) - 2018
- [i12]Karin Schnass:
Dictionary learning - from local towards global and adaptive. CoRR abs/1804.07101 (2018) - [i11]Flávio Teixeira, Karin Schnass:
Compressed Dictionary Learning. CoRR abs/1805.00692 (2018) - [i10]Karin Schnass:
Average performance of Orthogonal Matching Pursuit (OMP) for sparse approximation. CoRR abs/1809.06684 (2018) - 2017
- [i9]Valeriya Naumova, Karin Schnass:
Dictionary Learning from Incomplete Data. CoRR abs/1701.03655 (2017) - [i8]Michael Sandbichler, Karin Schnass:
Sequential Learning of Analysis Operators. CoRR abs/1704.00227 (2017) - 2015
- [i7]Karin Schnass:
Convergence radius and sample complexity of ITKM algorithms for dictionary learning. CoRR abs/1503.07027 (2015) - 2014
- [i6]Karin Schnass:
Local Identification of Overcomplete Dictionaries. CoRR abs/1401.6354 (2014) - 2013
- [i5]Karin Schnass:
On the Identifiability of Overcomplete Dictionaries via the Minimisation Principle Underlying K-SVD. CoRR abs/1301.3375 (2013) - 2010
- [i4]Karin Schnass, Pierre Vandergheynst:
Classification via Incoherent Subspaces. CoRR abs/1005.1471 (2010) - [i3]Massimo Fornasier, Karin Schnass, Jan Vybíral:
Learning Functions of Few Arbitrary Linear Parameters in High Dimensions. CoRR abs/1008.3043 (2010) - 2009
- [i2]Rémi Gribonval, Karin Schnass:
Dictionary Identification - Sparse Matrix-Factorisation via ℓ1-Minimisation. CoRR abs/0904.4774 (2009) - 2007
- [i1]Holger Rauhut, Karin Schnass, Pierre Vandergheynst:
Compressed Sensing and Redundant Dictionaries. CoRR abs/math/0701131 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
