Incoherent Minimal Scaled Frame
| Autor: | Challa S. Sastry, Pradip Sasmal, Phanindra Jampana, Prasad Theeda |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Computer science
Existential quantification Frame (networking) 020206 networking & telecommunications 02 engineering and technology Topology Cardinality TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY Scalability 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Uniqueness Scaling Column (data store) MathematicsofComputing_DISCRETEMATHEMATICS |
| Zdroj: | 2018 IEEE 3rd International Conference on Signal and Image Processing (ICSIP). |
| Popis: | A frame is called scalable, if there exists nonnegative scalars such that column weighted frame is tight. A scaling is called a minimal scaling if it does not contain a proper subscaling. We call a minimal scaling as a sparsest minimal if the cardinality of the support of the scaling is minimal. The objective of the present work is to find a sparsest minimal scaling. We also discuss the uniqueness of sparsest minimal scaled frames as a good candidate for incoherent tight frames in recovering sparse signals. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|