Huan Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Huan Liu has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
Genfu Xiao
Jinggangshan University, College of Mechanical and Electronic, Ji’an
3 shared publicationsChunjuan Ouyang
Jinggangshan University, College of Electronic and Information Engineering, Key Laboratory of Waters
2 shared publications- Gen-Fu Xiao
College of Mechanical and Electronic, Jinggangshan University, Ji’an, China
2 shared publications Chun-Juan Ouyang
Jinggangshan University
1 shared publication- Chun-Juan Ouyang
Key Laboratory of Watershed Ecology and Geographical Environment Monitoring of NASG, Jinggangshan University, Ji’an 343009, China
1 shared publication - Guoping Liu
School of Advanced Manufacturing, Nanchang University, Nanchang 330031, China
1 shared publication
Latest Publications
- Open Access
- 4 September 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (17) , 7852
SemiPolypSeg: Leveraging Cross-Pseudo Supervision and Contrastive Learning for Semi-Supervised Polyp Segmentation
The colonoscopy is the foremost technique for detecting polyps, where accurate segmentation is crucial for effective diagnosis and surgical preparation. Nevertheless, contemporary deep learning-based methods for polyp segmentation face substantial hurdles due to the large amount of labeled data required. To address this, we introduce an innovative semi-supervised learning framework based on cross-pseudo supervision (CPS) and contrastive learning, termed Semi-supervised Polyp Segmentation (SemiPolypSeg), which requires only limited labeled data. First, a new segmentation architecture, the Hybrid Transformer–CNN Segmentation Network (HTCSNet), is proposed to enhance semantic representation and segmentation performance. HTCSNet features a parallel encoder combining transformers and convolutional neural networks, as well as an All-MLP decoder with skip connections to streamline feature fusion and enhance decoding efficiency. Next, the integration of CPS in SemiPolypSeg enforces output consistency across diverse perturbed datasets and models, guided by the consistency loss principle. Finally, patch-wise contrastive loss discerns feature disparities between positive and negative sample pairs as delineated by the projector. Comprehensive evaluation demonstrated our method’s superiority over existing state-of-the-art semi-supervised segmentation algorithms. Specifically, our method achieved Dice Similarity Coefficients (DSCs) of 89.68% and 90.62% on the Kvasir-SEG dataset with 15% and 30% labeled data, respectively, and 89.72% and 90.06% on the CVC-ClinicDB dataset with equivalent ratios.
- 4 September 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (17) , 7852
Open AccessSemiPolypSeg: Leveraging Cross-Pseudo Supervision and Contrastive Learning for Semi-Supervised Polyp Segmentation
The colonoscopy is the foremost technique for detecting polyps, where accurate segmentation is crucial for effective diagnosis and surgical preparation. Nevertheless, contemporary deep learning-based methods for polyp segmentation face substantial hurdles due to the large amount of labeled data required. To address this, we introduce an innovative semi-supervised learning framework based on cross-pseudo supervision (CPS) and contrastive learning, termed Semi-supervised Polyp Segmentation (SemiPolypSeg), which requires only limited labeled data. First, a new segmentation architecture, the Hybrid Transformer–CNN Segmentation Network (HTCSNet), is proposed to enhance semantic representation and segmentation performance. HTCSNet features a parallel encoder combining transformers and convolutional neural networks, as well as an All-MLP decoder with skip connections to streamline feature fusion and enhance decoding efficiency. Next, the integration of CPS in SemiPolypSeg enforces output consistency across diverse perturbed datasets and models, guided by the consistency loss principle. Finally, patch-wise contrastive loss discerns feature disparities between positive and negative sample pairs as delineated by the projector. Comprehensive evaluation demonstrated our method’s superiority over existing state-of-the-art semi-supervised segmentation algorithms. Specifically, our method achieved Dice Similarity Coefficients (DSCs) of 89.68% and 90.62% on the Kvasir-SEG dataset with 15% and 30% labeled data, respectively, and 89.72% and 90.06% on the CVC-ClinicDB dataset with equivalent ratios.
- 6 March 2020
- Published by Springer Nature in International Journal of Automation and Computing
- Vol. 17 (4) , 588-598
Remote Sensing Image Registration Based on Improved KAZE and BRIEF Descriptor
- 6 March 2020
- Published by Springer Nature in International Journal of Automation and Computing
- Vol. 17 (4) , 588-598
Remote Sensing Image Registration Based on Improved KAZE and BRIEF Descriptor
- 6 February 2020
- Published by SPIE-Intl Soc Optical Eng in Journal of Electronic Imaging
- Vol. 29 (01) , 013015-23
Improved image registration scheme based on multiscale nonlinear Harris and Gaussian–Krawtchouk moment
Image registration is an indispensable operation in image processing. To solve the problem of nonlinear distortion which easily causes low registration property, a registration scheme including a nonlinear scale space, a new discrete orthogonal Gaussian–Krawtchouk (GK) descriptor vector, and a dual similarity measurement of distance-cosine is proposed. Nonlinear scale space is constructed to preserve a lot of important structures for increasing the quantity of the salient keypoints. Meanwhile, considering both blur stability and simple computation, multiscale Harris algorithm on the basis of nonlinear scale space is applied to extract the keypoints. Moreover, according to different scales, a descriptor vector based on multiscale GK invariant moments is presented and applied to the following image matching. Finally, a dual similarity measurement of the initial Euclidean distance and the fine space cosine is proposed for the purpose of enhancing the matching accuracy. The effectiveness of the proposed algorithm has been tested on the standard images with different types of variations. The experimental results show that the performance of feature extraction and the correct matching rate of the proposed scheme are superior to those of other classical methods. The proposed scheme has a better robustness and a higher registration accuracy.
- 6 February 2020
- Published by SPIE-Intl Soc Optical Eng in Journal of Electronic Imaging
- Vol. 29 (01) , 013015-23
Improved image registration scheme based on multiscale nonlinear Harris and Gaussian–Krawtchouk moment
Image registration is an indispensable operation in image processing. To solve the problem of nonlinear distortion which easily causes low registration property, a registration scheme including a nonlinear scale space, a new discrete orthogonal Gaussian–Krawtchouk (GK) descriptor vector, and a dual similarity measurement of distance-cosine is proposed. Nonlinear scale space is constructed to preserve a lot of important structures for increasing the quantity of the salient keypoints. Meanwhile, considering both blur stability and simple computation, multiscale Harris algorithm on the basis of nonlinear scale space is applied to extract the keypoints. Moreover, according to different scales, a descriptor vector based on multiscale GK invariant moments is presented and applied to the following image matching. Finally, a dual similarity measurement of the initial Euclidean distance and the fine space cosine is proposed for the purpose of enhancing the matching accuracy. The effectiveness of the proposed algorithm has been tested on the standard images with different types of variations. The experimental results show that the performance of feature extraction and the correct matching rate of the proposed scheme are superior to those of other classical methods. The proposed scheme has a better robustness and a higher registration accuracy.
- 31 December 2018
- Published by SPIE-Intl Soc Optical Eng in Journal of Electronic Imaging
- Vol. 28 (02) , 021003-14
Multifeature fusion and mutual co-operative particle swarm optimization in three-dimensional reconstruction of belly
A belly reconstruction and measurement scheme is conducted on a shape-flexible mannequin with digital image correlation technique. We adopted an integer subpixel image matching process. First, a compound feature including Gaussian combined moment and parameters extracted from gray-level co-occurrence matrix is proposed to track an integer pixel between reference and target deformed images. Second, a mutual learning co-operative particle swarm optimization algorithm is employed to locate the subpixel precisely. Each subpopulation does its own optimization independently. The subpopulations keep information communication and knowledge sharing for co-operative evolution to enhance global searching capability. In addition, the previous optimal information from the former interest point is adopted fully in initializing the particles’ positions of the next interest point, which effectively improves the speed of the convergence. Experimental results indicate that under the high measurement accuracy without any loss, the time-consumption of this scheme is significantly superior to that of the conventional method, particularly at a large number of interest points.
- 31 December 2018
- Published by SPIE-Intl Soc Optical Eng in Journal of Electronic Imaging
- Vol. 28 (02) , 021003-14
Multifeature fusion and mutual co-operative particle swarm optimization in three-dimensional reconstruction of belly
A belly reconstruction and measurement scheme is conducted on a shape-flexible mannequin with digital image correlation technique. We adopted an integer subpixel image matching process. First, a compound feature including Gaussian combined moment and parameters extracted from gray-level co-occurrence matrix is proposed to track an integer pixel between reference and target deformed images. Second, a mutual learning co-operative particle swarm optimization algorithm is employed to locate the subpixel precisely. Each subpopulation does its own optimization independently. The subpopulations keep information communication and knowledge sharing for co-operative evolution to enhance global searching capability. In addition, the previous optimal information from the former interest point is adopted fully in initializing the particles’ positions of the next interest point, which effectively improves the speed of the convergence. Experimental results indicate that under the high measurement accuracy without any loss, the time-consumption of this scheme is significantly superior to that of the conventional method, particularly at a large number of interest points.
- 27 December 2018
- Published by Springer Nature in International Journal of Automation and Computing
- Vol. 16 (5) , 575-588
Multi-source Remote Sensing Image Registration Based on Contourlet Transform and Multiple Feature Fusion
- 27 December 2018
- Published by Springer Nature in International Journal of Automation and Computing
- Vol. 16 (5) , 575-588
Multi-source Remote Sensing Image Registration Based on Contourlet Transform and Multiple Feature Fusion
- Open Access
- 6 August 2017
- Published by Wiley in Security and Communication Networks
- Vol. 2017, 1-13
Vague Sets Security Measure for Steganographic System Based on High-Order Markov Model
Security measure is of great importance in both steganography and steganalysis. Considering that statistical feature perturbations caused by steganography in an image are always nondeterministic and that an image is considered nonstationary, in this paper, the steganography is regarded as a fuzzy process. Here a steganographic security measure is proposed. This security measure evaluates the similarity between two vague sets of cover images and stego images in terms of n-order Markov chain to capture the interpixel correlation. The new security measure has proven to have the properties of boundedness, commutativity, and unity. Furthermore, the security measures of zero order, first order, second order, third order, and so forth are obtained by adjusting the order value of n-order Markov chain. Experimental results indicate that the larger n is, the better the measuring ability of the proposed security measure will be. The proposed security measure is more sensitive than other security measures defined under a deterministic distribution model, when the embedding is low. It is expected to provide a helpful guidance for designing secure steganographic algorithms or reliable steganalytic methods.
- 6 August 2017
- Published by Wiley in Security and Communication Networks
- Vol. 2017, 1-13
Open AccessVague Sets Security Measure for Steganographic System Based on High-Order Markov Model
Security measure is of great importance in both steganography and steganalysis. Considering that statistical feature perturbations caused by steganography in an image are always nondeterministic and that an image is considered nonstationary, in this paper, the steganography is regarded as a fuzzy process. Here a steganographic security measure is proposed. This security measure evaluates the similarity between two vague sets of cover images and stego images in terms of n-order Markov chain to capture the interpixel correlation. The new security measure has proven to have the properties of boundedness, commutativity, and unity. Furthermore, the security measures of zero order, first order, second order, third order, and so forth are obtained by adjusting the order value of n-order Markov chain. Experimental results indicate that the larger n is, the better the measuring ability of the proposed security measure will be. The proposed security measure is more sensitive than other security measures defined under a deterministic distribution model, when the embedding is low. It is expected to provide a helpful guidance for designing secure steganographic algorithms or reliable steganalytic methods.
- Open Access
- 1 March 2017
- Published by Universitas Ahmad Dahlan in TELKOMNIKA (Telecommunication Computing Electronics and Control)
- Vol. 15 (1) , 93-100
Research on Chaotic Firefly Algorithm and the Application in Optimal Reactive Power Dispatch
Research on Chaotic Firefly Algorithm and the Application in Optimal Reactive Power Dispatch
- 1 March 2017
- Published by Universitas Ahmad Dahlan in TELKOMNIKA (Telecommunication Computing Electronics and Control)
- Vol. 15 (1) , 93-100
Open AccessResearch on Chaotic Firefly Algorithm and the Application in Optimal Reactive Power Dispatch
Research on Chaotic Firefly Algorithm and the Application in Optimal Reactive Power Dispatch
- Open Access
- 4 October 2015
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2015, 1-15
Stereo Matching Based on Immune Neural Network in Abdomen Reconstruction
Stereo feature matching is a technique that finds an optimal match in two images from the same entity in the three-dimensional world. The stereo correspondence problem is formulated as an optimization task where an energy function, which represents the constraints on the solution, is to be minimized. A novel intelligent biological network (Bio-Net), which involves the human B-T cells immune system into neural network, is proposed in this study in order to learn the robust relationship between the input feature points and the output matched points. A model from input-output data (left reference point-right target point) is established. In the experiments, the abdomen reconstructions for different-shape mannequins are then performed by means of the proposed method. The final results are compared and analyzed, which demonstrate that the proposed approach greatly outperforms the single neural network and the conventional matching algorithm in precise. Particularly, as far as time cost and efficiency, the proposed method exhibits its significant promising and potential for improvement. Hence, it is entirely considered as an effective and feasible alternative option for stereo matching.
- 4 October 2015
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2015, 1-15
Open AccessStereo Matching Based on Immune Neural Network in Abdomen Reconstruction
Stereo feature matching is a technique that finds an optimal match in two images from the same entity in the three-dimensional world. The stereo correspondence problem is formulated as an optimization task where an energy function, which represents the constraints on the solution, is to be minimized. A novel intelligent biological network (Bio-Net), which involves the human B-T cells immune system into neural network, is proposed in this study in order to learn the robust relationship between the input feature points and the output matched points. A model from input-output data (left reference point-right target point) is established. In the experiments, the abdomen reconstructions for different-shape mannequins are then performed by means of the proposed method. The final results are compared and analyzed, which demonstrate that the proposed approach greatly outperforms the single neural network and the conventional matching algorithm in precise. Particularly, as far as time cost and efficiency, the proposed method exhibits its significant promising and potential for improvement. Hence, it is entirely considered as an effective and feasible alternative option for stereo matching.
- 1 October 2014
- Published by Springer Nature in International Journal of Automation and Computing
- Vol. 11 (5) , 469-479
Illumination-robust and Anti-blur Feature Descriptors for Image Matching in Abdomen Reconstruction
- 1 October 2014
- Published by Springer Nature in International Journal of Automation and Computing
- Vol. 11 (5) , 469-479
Illumination-robust and Anti-blur Feature Descriptors for Image Matching in Abdomen Reconstruction
- 20 November 2013
- Published by China Science Publishing & Media Ltd. in Journal of Computer Applications
- Vol. 33 (11) , 3183-3186
Belly shape modeling with new combined invariant moment based on stereo vision
- 20 November 2013
- Published by China Science Publishing & Media Ltd. in Journal of Computer Applications
- Vol. 33 (11) , 3183-3186
Belly shape modeling with new combined invariant moment based on stereo vision