Chunyang Wang
Research Subjects
Research Interests
Chunyang Wang has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Heng Guo
UIUC ETH Zürich UIUC UIUC UIUC UIUC ETH Zürich University of Edinburgh ETH Zürich UIUC
1 shared publication - Jiaheng Wang
Faculty of Informatics and Data Science University of Regensburg Germany
1 shared publication Mengmeng Sun
School of Surveying and Land Information Engineering
1 shared publicationShuangting Wang
School of Surveying and Land Information Engineering
1 shared publication- Weiming Feng
Department of Engineering Mechanics, Shandong University, Jinan, China
1 shared publication Xiao Li
School of Surveying and Land Information Engineering
1 shared publication
Latest Publications
- Open Access
Towards derandomising Markov chain Monte Carlo
We present a new framework to derandomise certain Markov chain Monte Carlo (MCMC) algorithms. As in MCMC, we first reduce counting problems to sampling from a sequence of marginal distributions. For the latter task, we introduce a method called coupling towards the past that can, in logarithmic time, evaluate one or a constant number of variables from a stationary Markov chain state. Since there are at most logarithmic random choices, this leads to very simple derandomisation. We provide two applications of this framework, namely efficient deterministic approximate counting algorithms for hypergraph independent sets and hypergraph colourings, under local lemma type conditions matching, up to lower order factors, their state-of-the-art randomised counterparts.
Open AccessTowards derandomising Markov chain Monte Carlo
We present a new framework to derandomise certain Markov chain Monte Carlo (MCMC) algorithms. As in MCMC, we first reduce counting problems to sampling from a sequence of marginal distributions. For the latter task, we introduce a method called coupling towards the past that can, in logarithmic time, evaluate one or a constant number of variables from a stationary Markov chain state. Since there are at most logarithmic random choices, this leads to very simple derandomisation. We provide two applications of this framework, namely efficient deterministic approximate counting algorithms for hypergraph independent sets and hypergraph colourings, under local lemma type conditions matching, up to lower order factors, their state-of-the-art randomised counterparts.
- Open Access
- 4 September 2018
- Published by Wiley in Advances in Multimedia
- Vol. 2018, 1-27
A New Semisupervised-Entropy Framework of Hyperspectral Image Classification Based on Random Forest
The purposes of the algorithm presented in this paper are to select features with the highest average separability by using the random forest method to distinguish categories that are easy to distinguish and to select the most divisible features from the most difficult categories using the weighted entropy algorithm. The framework is composed of five parts:random samples selection withprobabilistic output initial random forest classification processing based on the number of votes;semisupervised classification, which is an improvement of the supervision classification of random forest based on the weighted entropy algorithm;precision evaluation; anda comparison with the traditional minimum distance classification and the support vector machine (SVM) classification. In order to verify the universality of the proposed algorithm, two different data sources are tested, which are AVIRIS and Hyperion data. The results show that the overall classification accuracy of AVIRIS data is up to 87.36%, the kappa coefficient is up to 0.8591, and the classification time is 22.72s. Hyperion data is up to 99.17%, the kappa coefficient is up to 0.9904, and the classification time is 8.16s. Classification accuracy is obviously improved and efficiency is greatly improved, compared with the minimum distance and the SVM classifier and the CART classifier.- 4 September 2018
- Published by Wiley in Advances in Multimedia
- Vol. 2018, 1-27
Open AccessA New Semisupervised-Entropy Framework of Hyperspectral Image Classification Based on Random Forest
The purposes of the algorithm presented in this paper are to select features with the highest average separability by using the random forest method to distinguish categories that are easy to distinguish and to select the most divisible features from the most difficult categories using the weighted entropy algorithm. The framework is composed of five parts:random samples selection withprobabilistic output initial random forest classification processing based on the number of votes;semisupervised classification, which is an improvement of the supervision classification of random forest based on the weighted entropy algorithm;precision evaluation; anda comparison with the traditional minimum distance classification and the support vector machine (SVM) classification. In order to verify the universality of the proposed algorithm, two different data sources are tested, which are AVIRIS and Hyperion data. The results show that the overall classification accuracy of AVIRIS data is up to 87.36%, the kappa coefficient is up to 0.8591, and the classification time is 22.72s. Hyperion data is up to 99.17%, the kappa coefficient is up to 0.9904, and the classification time is 8.16s. Classification accuracy is obviously improved and efficiency is greatly improved, compared with the minimum distance and the SVM classifier and the CART classifier.