Random Forest Ensembles and Extended Multiextinction Profiles for Hyperspectral Image Classification
The DOI matches its Crossref record; 55 of the 55 references it cites were found in a registry or an index.
Abstract
Classification techniques for hyperspectral images based on random forest (RF) ensembles and extended multiextinction profiles (EMEPs) are proposed as a means of improving performance. To this end, five strategies - bagging, boosting, random subspace, rotation-based, and boosted rotation-based - are used to construct the RF ensembles. EPs, which are based on an extrema-oriented connected filtering technique, are applied to the images associated with the first informative components extracted by independent component analysis, leading to a set of EMEPs. The effectiveness of the proposed method is investigated on two benchmark hyperspectral images: the University of Pavia and Indian Pines. Comparative experimental evaluations reveal the superior performance of the proposed methods, especially those employing rotation-based and boosted rotation-based approaches. An additional advantage is that the CPU processing time is acceptable.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538 · cited 3×
“RF is constructed by several individual decision trees (DTs), in which each tree is trained on a bootstrapped sample, while randomly selected features are used to split a leaf on each tree [12].”
BackgroundMethodInfluentialThe Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325 · cited 2×
“1) Bagging Random Forest: In the bagging method, the input training samples are selected at random from an original training set by replacement; instructive iteration is exerted to create some different training sets; and each training set is classified by vote to predict its class [19].”
BackgroundMethodIndependent component analysis: algorithms and applications
Hyvärinen, A., & Oja, E. (2000) · Neural Networks · doi:10.1016/s0893-6080(00)00026-5 · Cited by 8,705 · cited 6×
“In the proposed methodology, the hyperspectral image is transformed by ICA.”
MethodInfluentialFast approximate energy minimization via graph cuts
Boykov, Y., Veksler, O., & Zabih, R. (2001) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.969114 · Cited by 6,988
The random subspace method for constructing decision forests
Ho, T. K. (1998) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.709601 · Cited by 6,842 · cited 2×
“However, this modification is performed in the feature space [21].”
BackgroundSpatial Interaction and the Statistical Analysis of Lattice Systems
Besag, J. (1974) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1974.tb00999.x · Cited by 6,067 · cited 1×
“number of approaches, such as Markov random fields (MRFs) modeling [26]–[28].”
BackgroundClassification of hyperspectral remote sensing images with support vector machines
Melgani, F., & Bruzzone, L. (2004) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2004.831865 · Cited by 4,411 · cited 2×
“based methods [5], [6] and feature extraction/selection [7], [8],”
BackgroundMethodMorphological Image Analysis: Principles and Applications
(2000) · Sensor Review · doi:10.1108/sr.2000.08720cae.001 · Cited by 3,537
Combining Pattern Classifiers: Methods and Algorithms
Bagui, S. C. (2005) · Technometrics · doi:10.1198/tech.2005.s320 · Cited by 3,202
Cited by
Ghamisi, P., Maggiori, E., Li, S., Souza, R., Tarablaka, Y., Moser, G., De Giorgi, A., Fang, L., Chen, Y., Chi, M., et al. (2018) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2018.2854840 · Cited by 325
Self-citationChen, Z., Han, F., Wu, L., Yu, J., Cheng, S., Lin, P., & Chen, H. (2018) · Energy Conversion and Management · doi:10.1016/j.enconman.2018.10.040 · Cited by 320
Hong, D., Wu, X., Ghamisi, P., Chanussot, J., Yokoya, N., & Zhu, X. X. (2020) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2019.2957251 · Cited by 310
Self-citationDeep Learning Ensemble for Hyperspectral Image Classification
Chen, Y., Wang, Y., Gu, Y., He, X., Ghamisi, P., & Jia, X. (2019) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2019.2915259 · Cited by 159
“Finally, the class that receives the highest number of votes is appointed as the final decision [45].”
BackgroundSelf-citation
Metadata
- Authors
- Xia, J., Ghamisi, P., Yokoya, N., & Iwasaki, A.
- Venue
- IEEE Transactions on Geoscience and Remote Sensing
- Published
- 2018-01
- Volume
- 56
- Issue
- 1
- Pages
- 202-216
- ISSN
- 0196-2892 (ISSN-L)
- 1558-0644
- OpenAlex
- W2757242159
- Cited by
- 202
- References
- 55
- FWCI
- 13.48
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.