Hongxing Yuan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Hongxing Yuan has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
Shaoqun Wu
Ningbo University of Technology, Ningbo, China
2 shared publications- Chi Linghong1 shared publication
Chunya Tong
Ningbo University of Technology, Ningbo, China
1 shared publication- Chunya Tong
School of Cyber Science and Engineering, Ningbo University of Technology, Ningbo 315211, China
1 shared publication - Jiadong Li
School of Cyber Science and Engineering, Ningbo University of Technology, Ningbo 315211, China
1 shared publication - Jianjun Zheng
Radiology Department, Ningbo No.2 Hospital, Ningbo, 315010, China.
1 shared publication
Latest Publications
- Open Access
- 3 September 2024
- Published by MDPI AG in Electronics
- Vol. 13 (17) , 3501
ECF-Net: Enhanced, Channel-Based, Multi-Scale Feature Fusion Network for COVID-19 Image Segmentation
Accurate segmentation of COVID-19 lesion regions in lung CT images aids physicians in analyzing and diagnosing patients’ conditions. However, the varying morphology and blurred contours of these regions make this task complex and challenging. Existing methods utilizing Transformer architecture lack attention to local features, leading to the loss of detailed information in tiny lesion regions. To address these issues, we propose a multi-scale feature fusion network, ECF-Net, based on channel enhancement. Specifically, we leverage the learning capabilities of both CNN and Transformer architectures to design parallel channel extraction blocks in three different ways, effectively capturing diverse lesion features. Additionally, to minimize irrelevant information in the high-dimensional feature space and focus the network on useful and critical information, we develop adaptive feature generation blocks. Lastly, a bidirectional pyramid-structured feature fusion approach is introduced to integrate features at different levels, enhancing the diversity of feature representations and improving segmentation accuracy for lesions of various scales. The proposed method is tested on four COVID-19 datasets, demonstrating mIoU values of 84.36%, 87.15%, 83.73%, and 75.58%, respectively, outperforming several current state-of-the-art methods and exhibiting excellent segmentation performance. These findings provide robust technical support for medical image segmentation in clinical practice.
- 3 September 2024
- Published by MDPI AG in Electronics
- Vol. 13 (17) , 3501
Open AccessECF-Net: Enhanced, Channel-Based, Multi-Scale Feature Fusion Network for COVID-19 Image Segmentation
Accurate segmentation of COVID-19 lesion regions in lung CT images aids physicians in analyzing and diagnosing patients’ conditions. However, the varying morphology and blurred contours of these regions make this task complex and challenging. Existing methods utilizing Transformer architecture lack attention to local features, leading to the loss of detailed information in tiny lesion regions. To address these issues, we propose a multi-scale feature fusion network, ECF-Net, based on channel enhancement. Specifically, we leverage the learning capabilities of both CNN and Transformer architectures to design parallel channel extraction blocks in three different ways, effectively capturing diverse lesion features. Additionally, to minimize irrelevant information in the high-dimensional feature space and focus the network on useful and critical information, we develop adaptive feature generation blocks. Lastly, a bidirectional pyramid-structured feature fusion approach is introduced to integrate features at different levels, enhancing the diversity of feature representations and improving segmentation accuracy for lesions of various scales. The proposed method is tested on four COVID-19 datasets, demonstrating mIoU values of 84.36%, 87.15%, 83.73%, and 75.58%, respectively, outperforming several current state-of-the-art methods and exhibiting excellent segmentation performance. These findings provide robust technical support for medical image segmentation in clinical practice.
- Open Access
A Complex Environmental Water-Level Detection Method Based on Improved YOLOv5m
The existing methods for water-level recognition often suffer from inaccurate readings in complex environments, which limits their practicality and reliability. In this paper, we propose a novel approach that combines an improved version of the YOLOv5m model with contextual knowledge for water-level identification. We employ the adaptive threshold Canny operator and Hough transform for skew detection and correction of water-level images. The improved YOLOv5m model is employed to extract the water-level gauge from the input image, followed by refinement of the segmentation results using contextual priors. Additionally, we utilize a linear regression model to predict the water-level value based on the pixel height of the water-level gauge. Extensive experiments conducted in real-world environments encompassing daytime, nighttime, occlusion, and lighting variations demonstrate that our proposed method achieves an average error of less than 2 cm.
Open AccessA Complex Environmental Water-Level Detection Method Based on Improved YOLOv5m
The existing methods for water-level recognition often suffer from inaccurate readings in complex environments, which limits their practicality and reliability. In this paper, we propose a novel approach that combines an improved version of the YOLOv5m model with contextual knowledge for water-level identification. We employ the adaptive threshold Canny operator and Hough transform for skew detection and correction of water-level images. The improved YOLOv5m model is employed to extract the water-level gauge from the input image, followed by refinement of the segmentation results using contextual priors. Additionally, we utilize a linear regression model to predict the water-level value based on the pixel height of the water-level gauge. Extensive experiments conducted in real-world environments encompassing daytime, nighttime, occlusion, and lighting variations demonstrate that our proposed method achieves an average error of less than 2 cm.
- Open Access
- 8 August 2018
- Published by Wiley in Journal of Electrical and Computer Engineering
- Vol. 2018, 1-13
Inaccuracy-Tolerant Sparse-to-Dense Depth Propagation for Semiautomatic 2D-to-3D Conversion
Current semiautomatic 2D-to-3D methods assume that user input is perfectly accurate. However, it is difficult to get 100% accurate user scribbles and even small errors in the input will degrade the conversion quality. This paper addresses the issue with scribble confidence that considers color differences between labeled pixels and their neighbors. First, it counts the number of neighbors which have similar and different color values for each labeled pixels, respectively. The ratio between these two numbers at each labeled pixel is regarded as its scribble confidence. Second, the sparse-to-dense depth conversion is formulated as a confident optimization problem by introducing a confident weighting data cost term and the local and k-nearest depth consistent regularization terms. Finally, the dense depth-map is obtained by solving sparse linear equations. The proposed approach is compared with existing methods on several representative images. The experimental results demonstrate that the proposed method can tolerate some errors from use input and can reduce depth-map artifacts caused by inaccurate user input.
- 8 August 2018
- Published by Wiley in Journal of Electrical and Computer Engineering
- Vol. 2018, 1-13
Open AccessInaccuracy-Tolerant Sparse-to-Dense Depth Propagation for Semiautomatic 2D-to-3D Conversion
Current semiautomatic 2D-to-3D methods assume that user input is perfectly accurate. However, it is difficult to get 100% accurate user scribbles and even small errors in the input will degrade the conversion quality. This paper addresses the issue with scribble confidence that considers color differences between labeled pixels and their neighbors. First, it counts the number of neighbors which have similar and different color values for each labeled pixels, respectively. The ratio between these two numbers at each labeled pixel is regarded as its scribble confidence. Second, the sparse-to-dense depth conversion is formulated as a confident optimization problem by introducing a confident weighting data cost term and the local and k-nearest depth consistent regularization terms. Finally, the dense depth-map is obtained by solving sparse linear equations. The proposed approach is compared with existing methods on several representative images. The experimental results demonstrate that the proposed method can tolerate some errors from use input and can reduce depth-map artifacts caused by inaccurate user input.
- Open Access
- 2 August 2018
- Published by Springer Nature in EURASIP Journal on Image and Video Processing
- Vol. 2018 (1) , 66
Robust semi-automatic 2D-to-3D image conversion via residual-driven optimization
- 2 August 2018
- Published by Springer Nature in EURASIP Journal on Image and Video Processing
- Vol. 2018 (1) , 66
Open AccessRobust semi-automatic 2D-to-3D image conversion via residual-driven optimization
- Open Access
- 4 April 2018
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2018, 1-15
Robust Semiautomatic 2D-to-3D Conversion with Welsch M-Estimator for Data Fidelity
Semiautomatic 2D-to-3D conversion plays an important role in generating 3D contents for display. However, most existing methods assume that user scribbles are perfectly correct, and only give acceptable results when user provides accurate labels. To address this problem, Welsch M-estimator data fidelity is used to resist erroneous scribbles. The Welsch M-estimator data fidelity which is able to alleviate the influence of inaccurate scribbles has theoretical guarantee by means of its redescending property. First, the Welsch M-estimator is introduced to measure the fidelity between estimated depth and user provided depth; then local smoothness is built by using color weighted Welsch M-estimator to make neighboring pixels with similar colors have similar depth values. Finally, we solve the problem using generalized iteratively reweighted least squares algorithm. Experiments demonstrate that our method obtains competitive performance in the absence of inaccurate scribbles and outperforms the state of the art both visually and quantitatively in the presence of inaccurate scribbles.
- 4 April 2018
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2018, 1-15
Open AccessRobust Semiautomatic 2D-to-3D Conversion with Welsch M-Estimator for Data Fidelity
Semiautomatic 2D-to-3D conversion plays an important role in generating 3D contents for display. However, most existing methods assume that user scribbles are perfectly correct, and only give acceptable results when user provides accurate labels. To address this problem, Welsch M-estimator data fidelity is used to resist erroneous scribbles. The Welsch M-estimator data fidelity which is able to alleviate the influence of inaccurate scribbles has theoretical guarantee by means of its redescending property. First, the Welsch M-estimator is introduced to measure the fidelity between estimated depth and user provided depth; then local smoothness is built by using color weighted Welsch M-estimator to make neighboring pixels with similar colors have similar depth values. Finally, we solve the problem using generalized iteratively reweighted least squares algorithm. Experiments demonstrate that our method obtains competitive performance in the absence of inaccurate scribbles and outperforms the state of the art both visually and quantitatively in the presence of inaccurate scribbles.
- Open Access
- 25 January 2018
- Published by International Association of Online Engineering (IAOE) in International Journal of Online and Biomedical Engineering (iJOE)
- Vol. 14 (01) , 104-118
Semi-Automatic 2D-to-3D Conversion Using Low-Rank Matrix Recovery
Semi-automatic 2D-to-3D conversion is a promising solution to 3D stereoscopic content creation. However, the depth continuous transition between user marked neighboring regions will be lost when user scribbles are sparse. To help solve this problem, a piecewise-continuity regularized low-rank matrix recovery method is developed. Our approach is based on the fact that a depth-map can be decomposed into a low-rank matrix and an outlier term matrix. First, an initial dense depth-map is interpolated from the user scribbles using matting Laplacian scheme under the assumption that depth-map is piecewise-continuous. Second, a piecewise-continuity constrained low-rank recovery model is developed to remove outliers which are introduced by the interpolation. Experimental comparisons with existing algorithms show that our method demonstrates significant advantage over depth continuous transition between neighboring regions.
- 25 January 2018
- Published by International Association of Online Engineering (IAOE) in International Journal of Online and Biomedical Engineering (iJOE)
- Vol. 14 (01) , 104-118
Open AccessSemi-Automatic 2D-to-3D Conversion Using Low-Rank Matrix Recovery
Semi-automatic 2D-to-3D conversion is a promising solution to 3D stereoscopic content creation. However, the depth continuous transition between user marked neighboring regions will be lost when user scribbles are sparse. To help solve this problem, a piecewise-continuity regularized low-rank matrix recovery method is developed. Our approach is based on the fact that a depth-map can be decomposed into a low-rank matrix and an outlier term matrix. First, an initial dense depth-map is interpolated from the user scribbles using matting Laplacian scheme under the assumption that depth-map is piecewise-continuous. Second, a piecewise-continuity constrained low-rank recovery model is developed to remove outliers which are introduced by the interpolation. Experimental comparisons with existing algorithms show that our method demonstrates significant advantage over depth continuous transition between neighboring regions.
- 31 March 2013
- Published by AICIT in International Journal of Advancements in Computing Technology
- Vol. 5 (6) , 1226-1232
An Effective Hierarchical Belief Propagation Algorithm Based on Convergence Detection
- 31 March 2013
- Published by AICIT in International Journal of Advancements in Computing Technology
- Vol. 5 (6) , 1226-1232
An Effective Hierarchical Belief Propagation Algorithm Based on Convergence Detection
- Open Access
- 15 November 2012
- Published by Atlantis Press SARL
A Variable Step Size RPE Algorithm for Echo Cancelation
- 15 November 2012
- Published by Atlantis Press SARL
Open AccessA Variable Step Size RPE Algorithm for Echo Cancelation
- 20 April 2010
- Published by China Science Publishing & Media Ltd. in Journal of Computer-Aided Design & Computer Graphics
- Vol. 22 (4) , 605-611
Multi-view Reconstruction Using Band Graph-Cuts
This paper proposes a new multi-view reconstruction algorithm by combining the visual hull and multi-view stereo matching based on the band graph-cuts technique.The reconstructed surface is made consistent with the dense point cloud obtained from the multi-view stereo matching through the minimization of the functional that is constrained by the topology of the built visual hull.The globally optimal solution can be achieved with the minimum cut of a band weighted graph meanwhile the overall performance is greatly improved.Experimental results show our method is able to recover surface concavities and watertight surface.Compared with conventional graph-cuts approaches,more than three folds acceleration is gained with our approach.
- 20 April 2010
- Published by China Science Publishing & Media Ltd. in Journal of Computer-Aided Design & Computer Graphics
- Vol. 22 (4) , 605-611
Multi-view Reconstruction Using Band Graph-Cuts
This paper proposes a new multi-view reconstruction algorithm by combining the visual hull and multi-view stereo matching based on the band graph-cuts technique.The reconstructed surface is made consistent with the dense point cloud obtained from the multi-view stereo matching through the minimization of the functional that is constrained by the topology of the built visual hull.The globally optimal solution can be achieved with the minimum cut of a band weighted graph meanwhile the overall performance is greatly improved.Experimental results show our method is able to recover surface concavities and watertight surface.Compared with conventional graph-cuts approaches,more than three folds acceleration is gained with our approach.