Wei Hao
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
Wei Hao has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Song Gu
Aeronautic Engineering Department Chengdu Aeronautic Polytechnic Chengdu People's Republic of China
2 shared publications - Weirui Zhang
Department of Biomedical Engineering, Huazhong University of Science and Technology, Wuhan, China
2 shared publications - Yingjie Du
Huazhong University of Science and Technology
2 shared publications - Dongmei Zhou
Chengdu University of Technology,School of Mechanical and Electrical Engineering,Chengdu,China
1 shared publication - Dunxi Yu
State Key Laboratory of Coal Combustion, School of Energy and Power Engineering Huazhong University of Science and Technology Wuhan China
1 shared publication - Jian Wang
Department of Mathematics Taiyuan University of Technology 030024 Taiyuan P. R. China
1 shared publication
Latest Publications
- Open Access
- 12 July 2023
- Published by Institution of Engineering and Technology (IET) in IET Image Processing
- Vol. 17 (12) , 3392-3400
LiteDEKR: End‐to‐end lite 2D human pose estimation network
The 2D human pose estimation plays an important role in human‐computer interaction and action recognition. Although the method based on high‐resolution network has superior performance, there is still room for improvement in terms of speed and lightweight. Here, a LiteDEKR, a 2D pose estimation method that combines lightweight and accuracy, is proposed by designing a lightweight network based on DEKR and constructing two scientifically valid loss functions. The method, constructs a multi‐instance bias regression loss that matches the true distribution of keypoint bias, improves the accuracy of bias regression, and constructs a keypoint similarity loss with the object keypoint similarity index of keypoints as the optimization objective to achieve end‐to‐end training of the network. In addition, this paper has designed a lightweight DEKR, using LitePose as the backbone network. With the optimization of the above two loss functions, LiteDEKR not only achieves lightweight but also has high accuracy. Comparative experiments on the COCO and CrowdPose datasets show that compared to the current state‐of‐the‐art Contextual Instance Decoupling, LiteDEKR achieves a similar accuracy with only 10% of its network complexity. It also shows better robustness to low‐resolution input images.
- 12 July 2023
- Published by Institution of Engineering and Technology (IET) in IET Image Processing
- Vol. 17 (12) , 3392-3400
Open AccessLiteDEKR: End‐to‐end lite 2D human pose estimation network
The 2D human pose estimation plays an important role in human‐computer interaction and action recognition. Although the method based on high‐resolution network has superior performance, there is still room for improvement in terms of speed and lightweight. Here, a LiteDEKR, a 2D pose estimation method that combines lightweight and accuracy, is proposed by designing a lightweight network based on DEKR and constructing two scientifically valid loss functions. The method, constructs a multi‐instance bias regression loss that matches the true distribution of keypoint bias, improves the accuracy of bias regression, and constructs a keypoint similarity loss with the object keypoint similarity index of keypoints as the optimization objective to achieve end‐to‐end training of the network. In addition, this paper has designed a lightweight DEKR, using LitePose as the backbone network. With the optimization of the above two loss functions, LiteDEKR not only achieves lightweight but also has high accuracy. Comparative experiments on the COCO and CrowdPose datasets show that compared to the current state‐of‐the‐art Contextual Instance Decoupling, LiteDEKR achieves a similar accuracy with only 10% of its network complexity. It also shows better robustness to low‐resolution input images.
- Open Access
- 10 July 2019
- Published by Institution of Engineering and Technology (IET) in IET Computer Vision
- Vol. 13 (5) , 469-479
Online video object segmentation via LRS representation
Video object segmentation has been extensively investigated in computer vision recently because of its wide range of applications. The key factor of the segmentation is the construction of the spatiotemporal coherence. Inaccurate motion approximation as a measurement of the coherence usually leads to an inaccurate segmentation result. To obtain an accurate segmentation result, a low‐rank sparse (LRS)‐based approach is proposed. Regarding each superpixel as an element, this algorithm has a good segmentation accuracy compared with other pixel‐level algorithms. Each element can be represented by the sparse linear combinations of dictionary templates, and this algorithm capitalises on the inherent low‐rank structure of representations that are learnt jointly. The represented coefficients construct an affinity matrix which measures the elements’ similarity between the current frame and the templates in the dictionary. For video object segmentation, a principled spatiotemporal objective function that uses LRS saliency term to propagate information between frames. Furthermore, an online parameter updating scheme is proposed to enhance the system's robustness. The online model propagates information forward without the need to access future frames. Evaluations on many challenging sequences demonstrate that the authors' approach outperforms the state‐of‐the‐art methods in terms of object segmentation accuracy.
- 10 July 2019
- Published by Institution of Engineering and Technology (IET) in IET Computer Vision
- Vol. 13 (5) , 469-479
Open AccessOnline video object segmentation via LRS representation
Video object segmentation has been extensively investigated in computer vision recently because of its wide range of applications. The key factor of the segmentation is the construction of the spatiotemporal coherence. Inaccurate motion approximation as a measurement of the coherence usually leads to an inaccurate segmentation result. To obtain an accurate segmentation result, a low‐rank sparse (LRS)‐based approach is proposed. Regarding each superpixel as an element, this algorithm has a good segmentation accuracy compared with other pixel‐level algorithms. Each element can be represented by the sparse linear combinations of dictionary templates, and this algorithm capitalises on the inherent low‐rank structure of representations that are learnt jointly. The represented coefficients construct an affinity matrix which measures the elements’ similarity between the current frame and the templates in the dictionary. For video object segmentation, a principled spatiotemporal objective function that uses LRS saliency term to propagate information between frames. Furthermore, an online parameter updating scheme is proposed to enhance the system's robustness. The online model propagates information forward without the need to access future frames. Evaluations on many challenging sequences demonstrate that the authors' approach outperforms the state‐of‐the‐art methods in terms of object segmentation accuracy.
- Open Access
- 24 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 53520-53533
Online Video Object Segmentation via Boundary-Constrained Low-Rank Sparse Representation
Graphcut based algorithm is adopted in many video object segmentation systems because different terms can be probabilistically fused together in a framework. Constructing spatio-temporal coherences is an important stage in segmentation systems. However, many steps are involved when computing a key term with good discriminative power. If the cascade steps are adopted, the inaccurate output of the previous step will definitely affect the next step, leading to inaccurate segmentation. In this paper, a key term which is computed by a single framework referred as Boundary-Constrained Low-Rank Sparse Representation (BCLRSR) is proposed to achieve the accurate segmentation. By treating the elements as linear combinations of dictionary templates, low-rank sparse optimization is adopted to achieve the spatiotemporal saliency. For adding the spatial information to the low-rank sparse model, a boundary constraint is adopted in the framework as a Laplacian regularization. A BCLRSR saliency is then obtained by the represented coefficients which measure the similarity between the elements in the current frame and the ones in the dictionary. At last, the object is segmented by minimizing the energy function which is formalized by the spatio-temporal coherences. Experiments on some public datasets show that our proposed algorithm outperforms the state-of-the-art methods.
- 24 April 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 53520-53533
Open AccessOnline Video Object Segmentation via Boundary-Constrained Low-Rank Sparse Representation
Graphcut based algorithm is adopted in many video object segmentation systems because different terms can be probabilistically fused together in a framework. Constructing spatio-temporal coherences is an important stage in segmentation systems. However, many steps are involved when computing a key term with good discriminative power. If the cascade steps are adopted, the inaccurate output of the previous step will definitely affect the next step, leading to inaccurate segmentation. In this paper, a key term which is computed by a single framework referred as Boundary-Constrained Low-Rank Sparse Representation (BCLRSR) is proposed to achieve the accurate segmentation. By treating the elements as linear combinations of dictionary templates, low-rank sparse optimization is adopted to achieve the spatiotemporal saliency. For adding the spatial information to the low-rank sparse model, a boundary constraint is adopted in the framework as a Laplacian regularization. A BCLRSR saliency is then obtained by the represented coefficients which measure the similarity between the elements in the current frame and the ones in the dictionary. At last, the object is segmented by minimizing the energy function which is formalized by the spatio-temporal coherences. Experiments on some public datasets show that our proposed algorithm outperforms the state-of-the-art methods.
- 1 May 2007
- Published by Springer Nature in Frontiers of Energy and Power Engineering in China
- Vol. 1 (2) , 213-217
Influence of mineral transformation on emission of particulate matters during coal combustion
- 1 May 2007
- Published by Springer Nature in Frontiers of Energy and Power Engineering in China
- Vol. 1 (2) , 213-217
Influence of mineral transformation on emission of particulate matters during coal combustion