Hongbing Liu

Prof. Dr. Hongbing Liu


Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 November 2022 in Materials Characterization
Verified
Journal Article
Closed access
WCWenhao Cheng
Wenhao Cheng
YSYiming Sun
Yiming Sun
RMRui Ma
Rui Ma
YWYa-Jun Wang
Ya-Jun Wang
JBJie Bai
Jie Bai
QYQinfeng Yuan
Qinfeng Yuan

1 January 2011 in Computers & Mathematics with Applications
Verified
Journal Article
Closed access
HLHongbing Liu
Hongbing Liu
SXShengwu Xiong
Shengwu Xiong
Zhixiang FangZhixiang Fang
Zhixiang Fang

1 September 2009
Verified
Conference Paper
Closed access
HLHongbing Liu
Hongbing Liu
SXShengwu Xiong
Shengwu Xiong
QCQiong Chen
Qiong Chen
Localization of sensor nodes is essential for wireless sensor network when it is applied to the special applications. We consider the localization of sensor nodes by integrating with multi-class support vector machines. During the offline training process, the received signal strength of the reference nodes is selected as the input of learning machines and the discrete value of location information is regarded as the class information of multi-class support vector machines. During the online localization process, the decision functions of multi-class support vector machines are used to estimate the location of blindfolded nodes. We demonstrate the practicality and feasibility of our method through simulations in the 100 m times 100 m area.

6 March 2014 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
HLHongbing Liu
Hongbing Liu
CLChunhua Liu
Chunhua Liu
CWChang-An Wu
Chang-An Wu
Granular computing classification algorithms are proposed based on distance measures between two granules from the view of set. Firstly, granules are represented as the forms of hyperdiamond, hypersphere, hypercube, and hyperbox. Secondly, the distance measure between two granules is defined from the view of set, and the union operator between two granules is formed to obtain the granule set including the granules with different granularity. Thirdly the threshold of granularity determines the union between two granules and is used to form the granular computing classification algorithms based on distance measures (DGrC). The benchmark datasets in UCI Machine Learning Repository are used to verify the performance of DGrC, and experimental results show that DGrC improved the testing accuracies.

1 August 2010
Verified
Conference Paper
Closed access
JKJialiang Kou
Jialiang Kou
SXShengwu Xiong
Shengwu Xiong
SWShuzhen Wan
Shuzhen Wan
HLHongbing Liu
Hongbing Liu
With the development of the Internet, the Intrusion Detection has been gradually playing a more and more important role in Network Security. Radial Basis Function Neural Network are widely used in Intrusion Detection, especially Probabilistic Neural Network. However, the detection speed is a problem which impedes it to be applied to Real-time Intrusion Detection. In this paper, for increasing the Detection Speed, the Incremental Training Method replaces the Exact Training Method. The simulation experiment shows that the detection speed of Incremental Probabilistic Neural Network is much faster than that of Exact Probabilistic Neural Network. Therefore, the Incremental Probabilistic Neural Network is more suitable for real-time intrusion detection than Exact Probabilistic Neural Network.

1 August 2015 in International Journal of Distributed Sensor Networks
Verified
Journal Article
Open access
RLRan Li
Ran Li
HLHongbing Liu
Hongbing Liu
RXRui Xue
Rui Xue
YLYanling Li
Yanling Li
This paper presents a compressive-sensing- (CS-) based video codec which is suitable for wireless video system requiring simple encoders but tolerant, more complex decoders. At the encoder side, each video frame is independently measured by block-based random matrix, and the resulting measurements are encoded into compressed bitstream by entropy coding. Specifically, to reduce the quantization errors of measurements, a nonuniform quantization is integrated into the DPCM-based quantizer. At the decoder side, a novel joint reconstruction algorithm is proposed to improve the quality of reconstructed video frames. Firstly, the proposed algorithm uses the temporal autoregressive (AR) model to generate the Side Information (SI) of video frame, and next it recovers the residual between the original frame and the corresponding SI. To exploit the sparse property of residual with locally varying statistics, the Principle Component Analysis (PCA) is used to learn online the transform matrix adapting to residual structures. Extensive experiments validate that the joint reconstruction algorithm in the proposed codec achieves much better results than many existing methods with consideration of the reconstructed quality and the computational complexity. The rate-distortion performance of the proposed codec is superior to the state-of-the-art CS-based video codec, although there is still a considerable gap between it and traditional video codec.