2014
DOI: 10.1016/j.patrec.2014.07.015
|View full text |Cite
|
Sign up to set email alerts
|

Classification of clouds in satellite imagery using over-complete dictionary via sparse representation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
23
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 17 publications
(26 citation statements)
references
References 14 publications
0
23
0
Order By: Relevance
“…Constant C, as a penalty factor, which controls the trade-off between the volume and the errors in SVDD, is set to be C = 1.0. The classification accuracy of the proposed method is evaluated; several existing methods—including affinity based FSVM [14], SRC [16], and CCSI-ODSR [19]—are compared with the proposed method, the computation efficiency of the different methods is provided, and training time for training SVDD is listed in Section 5.4.…”
Section: Simulation Results and Analysismentioning
confidence: 99%
See 2 more Smart Citations
“…Constant C, as a penalty factor, which controls the trade-off between the volume and the errors in SVDD, is set to be C = 1.0. The classification accuracy of the proposed method is evaluated; several existing methods—including affinity based FSVM [14], SRC [16], and CCSI-ODSR [19]—are compared with the proposed method, the computation efficiency of the different methods is provided, and training time for training SVDD is listed in Section 5.4.…”
Section: Simulation Results and Analysismentioning
confidence: 99%
“…In this experiment, AFSRC is compared with FSVM [14], SRC [16], and CCSI-ODSR [19]. As in the prior experiment, 200 samples of each cloud type are used for testing, and there are 1200 testing samples in total.…”
Section: Simulation Results and Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…The concept of sparse representation was first introduced by Huber in 1982 which is not proved fruitful at that time due computational timing cost [1]. As the technology advances and computational time reduces, this proves to be useful.…”
Section: Introductionmentioning
confidence: 99%
“…To build a sparsified dictionary which is based on a mathematical model obtained from the data using fixed basis dictionary composed of over-complete basis vectors. The other approach is to build an adaptive over-complete dictionary by learning a dictionary to perform better on a training set [1]. Sparse and redundant representation of signal modeling assumes an ability to represent signals as linear combinations of little atoms from a prespecified dictionary.…”
Section: Introductionmentioning
confidence: 99%