Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ IEEE Accessarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
IEEE Access
Article . 2018 . Peer-reviewed
License: IEEE Open Access
Data sources: Crossref
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
IEEE Access
Article
License: CC BY NC ND
Data sources: UnpayWall
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
IEEE Access
Article . 2018
Data sources: DOAJ
versions View all 2 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

A Homotopy Iterative Hard Thresholding Algorithm With Extreme Learning Machine for Scene Recognition

Authors: Yuanlong Yu; Zhenzhen Sun; Wenxing Zhu; Jason Gu;

A Homotopy Iterative Hard Thresholding Algorithm With Extreme Learning Machine for Scene Recognition

Abstract

Vision-based scene recognition aims to find a semantic explanation of a scene image. First, how to learn a sparse feature representation by mapping each cluster of patches into few dimensions is one challenging issue. Sparse coding techniques with l1 norm regularization are widely used to learn sparse features. However, l1 norm regularization may not achieve enough sparsity. Furthermore, the initial value has a great influence on the sparsity of codes during the iterative optimization process. Second, how to learn a classifier in a supervised manner in order to improve the generalization is another issue. This paper therefore proposes a scene recognition method and it mainly includes two processes. One is the homotopy iterative hard thresholding (HIHT) algorithm that encodes the sparse representations of local patches by incorporating an l0 norm regularization. Furthermore, a homotopy continuity strategy is used to improve the sparsity of feature codes by adaptively tuning the regularization factor from large to small values and using the sparse solution of last iteration as the warm start of the next iteration. The other is the extreme learning machine (ELM)-based classifier. Experimental results in 15-class scene data set have shown that the HIHT algorithm outperforms other unsupervised sparse feature learning algorithms in terms of sparsity and entropy. Meanwhile, the ELM-based scene recognition method outperforms the other state-of-the art methods in terms of recognition accuracy.

Related Organizations
Keywords

extreme learning machine, homotopy iterative hard thresholding, Scene recognition, Electrical engineering. Electronics. Nuclear engineering, sparse features, TK1-9971

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    8
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
8
Average
Average
Top 10%
gold