2019
DOI: 10.3390/app9030505
|View full text |Cite
|
Sign up to set email alerts
|

A Fast Sparse Coding Method for Image Classification

Abstract: Image classification is an important problem in computer vision. The sparse coding spatial pyramid matching (ScSPM) framework is widely used in this field. However, the sparse coding cannot effectively handle very large training sets because of its high computational complexity, and ignoring the mutual dependence among local features results in highly variable sparse codes even for similar features. To overcome the shortcomings of previous sparse coding algorithm, we present an image classification method, whi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 32 publications
0
3
0
Order By: Relevance
“…Partitioning clustering is useful for classifying observations within a data set into multiple groups based on the observations similarity. This method is commonly used in scientific research 45–50 . The main advantage of K‐medoids algorithm is that it is more robust to data anomalies such outliers or missing values than commonly used K‐means algorithm 51 .…”
Section: Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…Partitioning clustering is useful for classifying observations within a data set into multiple groups based on the observations similarity. This method is commonly used in scientific research 45–50 . The main advantage of K‐medoids algorithm is that it is more robust to data anomalies such outliers or missing values than commonly used K‐means algorithm 51 .…”
Section: Methodsmentioning
confidence: 99%
“…This method is commonly used in scientific research. [45][46][47][48][49][50] The main advantage of K-medoids algorithm is that it is more robust to data anomalies such outliers or missing values than commonly used K-means algorithm. 51 The term medoid refers to an object within a cluster for which the average dissimilarity measure between the object and other objects in the cluster is minimal.…”
Section: K-medoids Partitioning Around Medoidsmentioning
confidence: 99%
“…Deep neural networks [8] have been widely used to learn low-dimensional feature representations to reduce the dimensionality of VHR images. Sparse coding [43] is another famous unsupervised feature learning method, which is highly effective for scene classification when compared to the traditional Bag of Visual Words (BoVW)-based approaches [44] and generates a set of basic functions from the unlabeled data. Recently, a method combining scale-invariant-feature-transform (SIFT)-based feature descriptors and sparse coding (Sift + SC) has been put forward.…”
Section: Unsupervised Deep Feature Learning For Remote Sensing Image mentioning
confidence: 99%