Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Guanghui Liang

dblp:184/0383 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2020
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorSecurity and privacy · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 100%
Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Medical and health informatics › medical imaging
electrical impedance tomography
0.412020
A Shape-Based Statistical Inversion Method for EIT/URT Dual-Modality Imaging · IEEE Trans. Image Process. 2020
Medical and health informatics
medical imaging
0.412020
A Shape-Based Statistical Inversion Method for EIT/URT Dual-Modality Imaging · IEEE Trans. Image Process. 2020

Methods — techniques the papers use, named apart from their topics

maximum a posteriori estimation · 0.9markov random field prior · 0.9conditional error model · 0.9
YearPublicationVenuePosition
2020 A Shape-Based Statistical Inversion Method for EIT/URT Dual-Modality Imaging
abstract
A shape-based statistical inversion method is proposed for Electrical Impedance Tomography (EIT) and Ultrasound Reflection Tomography (URT) dual-modality imaging. It is promising to improve the imaging accuracy in inclusion detection problems. The proposed image reconstruction method is based on the statistical shape inversion framework. The likelihood function is derived from EIT and URT forward models. The prior distribution is constructed using the Markov random field (MRF) prior. The measurement uncertainty is modeled by conditional error model method. The statistical shape inversion problem is solved by the Maximum a posterior (MAP) method with conventional error model. A set of numerical and experimental tests are carried out to evaluate the performance of the proposed method. The results show that the proposed EIT/URT dual-modality imaging method has obvious improvement in imaging accuracy compared to the traditional single-modality EIT and URT methods.
Guanghui Liang, Shangjie Ren, Feng Dong 0001
IEEE Trans. Image Process.1
2018 Automatic Benchmark Generation Framework for Malware Detection
abstract
To address emerging security threats, various malware detection methods have been proposed every year. Therefore, a small but representative set of malware samples are usually needed for detection model, especially for machine-learning-based malware detection models. However, current manual selection of representative samples from large unknown file collection is labor intensive and not scalable. In this paper, we firstly propose a framework that can automatically generate a small data set for malware detection. With this framework, we extract behavior features from a large initial data set and then use a hierarchical clustering technique to identify different types of malware. An improved genetic algorithm based on roulette wheel sampling is implemented to generate final test data set. The final data set is only one-eighteenth the volume of the initial data set, and evaluations show that the data set selected by the proposed framework is much smaller than the original one but does not lose nearly any semantics.
Guanghui Liang, Jianmin Pang, Zheng Shan, Runqing Yang
Secur. Commun. Networks1
2015 Poisson disk sampling through disk packing
abstract
Poisson disk sampling is an important problem in computer graphics and has a wide variety of applications in imaging, geometry, rendering, etc. In this paper, we propose a novel Poisson disk sampling algorithm based on disk packing. The key idea uses the observation that a relatively dense disk packing layout naturally satisfies the Poisson disk distribution property that each point is no closer to the others than a specified minimum distance, i.e., the Poisson disk radius. We use this property to propose a relaxation algorithm that achieves a good balance between the random and uniform properties needed for Poisson disk distributions. Our algorithm is easily adapted to image stippling by extending identical disk packing to unequal disks. Experimental results demonstrate the efficacy of our approaches.
Guanghui Liang, Lin Lu 0001, Zhonggui Chen, Chenglei Yang
Comput. Vis. Media1