有限维稀疏逼近的最小子空间逼近性质

2010 44th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2010-03-17 DOI:10.1109/CISS.2010.5464979

A. Aldroubi, R. Tessera

{"title":"有限维稀疏逼近的最小子空间逼近性质","authors":"A. Aldroubi, R. Tessera","doi":"10.1109/CISS.2010.5464979","DOIUrl":null,"url":null,"abstract":"We find necessary and sufficient conditions that a class of subspaces C must satisfy so that a solution exits to the problem of finding the subspace V ∈ C that best approximate a set of data F ∈ ℝ<sup>d</sup>.","PeriodicalId":118872,"journal":{"name":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimum subspace approximation property for sparse approximations in finite dimension\",\"authors\":\"A. Aldroubi, R. Tessera\",\"doi\":\"10.1109/CISS.2010.5464979\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We find necessary and sufficient conditions that a class of subspaces C must satisfy so that a solution exits to the problem of finding the subspace V ∈ C that best approximate a set of data F ∈ ℝ<sup>d</sup>.\",\"PeriodicalId\":118872,\"journal\":{\"name\":\"2010 44th Annual Conference on Information Sciences and Systems (CISS)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-03-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 44th Annual Conference on Information Sciences and Systems (CISS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS.2010.5464979\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 44th Annual Conference on Information Sciences and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2010.5464979","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

我们找到了一类子空间C必须满足的充要条件，使得寻找子空间V∈C最近似于一组数据F∈F的问题的解存在。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Minimum subspace approximation property for sparse approximations in finite dimension

We find necessary and sufficient conditions that a class of subspaces C must satisfy so that a solution exits to the problem of finding the subspace V ∈ C that best approximate a set of data F ∈ ℝ^d.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 44th Annual Conference on Information Sciences and Systems (CISS)

自引率

0.00%

发文量