Bo Yang
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
Bo Yang has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Aidong Men
School of Artificial Intelligence, Beijing University of Posts and Telecommunications, Beijing 100876, China
1 shared publication Dong Gang
State Grid Shandong Electric Power Company, Jinan, China
1 shared publicationLujuan Zhang
1 shared publicationQiang Huang
1 shared publication- Rui Guo
School of Automation, Northwestern Polytechnical University, Xian, China
1 shared publication Sun Xiaobin
State Grid Shandong Electric Power Company, Jinan, China
1 shared publication
Latest Publications
- 24 February 2026
- Published by Elsevier in Pattern Recognition
- Vol. 177
Twin orthogonal moments: A couple of effective feature descriptors for image representation and recognition
- 24 February 2026
- Published by Elsevier in Pattern Recognition
- Vol. 177
Twin orthogonal moments: A couple of effective feature descriptors for image representation and recognition
- 9 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 31 (10577149) , 2488-2502
Image Analysis by Fractional-Order Gaussian-Hermite Moments
Moments and moment invariants are effective feature descriptors. They have widespread applications in the field of image processing. The recent researches show that fractional-order moments have notable image representation ability. Hermite polynomials are defined over the interval from negative infinity to positive one. Such unboundedness prevents us from developing fractional-order Gaussian-Hermite moments via the existing ideas or approaches. In this paper, we propose fractional-order Gaussian-Hermite moments by forcing the definition domain of Hermite polynomials to be a bounded interval, meanwhile, resorting to a value-decreasing standard deviation to maintain the orthogonality. Moreover, we successfully develop contrast, translation and rotation invariants from the proposed moments based on the inherent properties of Hermite polynomials. The reconstructions of different types of images demonstrate that the proposed moments have more superior image representation ability to the most existing popular orthogonal moments. Besides, the salient performance in invariant image recognition, noise robustness and region-of-interest feature extraction reflect that these moments and their invariants possess the stronger discrimination power and the better noise robustness in comparison with the existing orthogonal moments. Furthermore, both complexity analysis and time consumption indicate that the proposed moments and their invariants are easy to implement, they are suitable for practical engineering applications.
- 9 March 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 31 (10577149) , 2488-2502
Image Analysis by Fractional-Order Gaussian-Hermite Moments
Moments and moment invariants are effective feature descriptors. They have widespread applications in the field of image processing. The recent researches show that fractional-order moments have notable image representation ability. Hermite polynomials are defined over the interval from negative infinity to positive one. Such unboundedness prevents us from developing fractional-order Gaussian-Hermite moments via the existing ideas or approaches. In this paper, we propose fractional-order Gaussian-Hermite moments by forcing the definition domain of Hermite polynomials to be a bounded interval, meanwhile, resorting to a value-decreasing standard deviation to maintain the orthogonality. Moreover, we successfully develop contrast, translation and rotation invariants from the proposed moments based on the inherent properties of Hermite polynomials. The reconstructions of different types of images demonstrate that the proposed moments have more superior image representation ability to the most existing popular orthogonal moments. Besides, the salient performance in invariant image recognition, noise robustness and region-of-interest feature extraction reflect that these moments and their invariants possess the stronger discrimination power and the better noise robustness in comparison with the existing orthogonal moments. Furthermore, both complexity analysis and time consumption indicate that the proposed moments and their invariants are easy to implement, they are suitable for practical engineering applications.
- 1 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 584-593
Few-Shot Learning of Video Action Recognition Only Based on Video Contents
The success of video action recognition based on Deep Neural Networks (DNNs) is highly dependent on a large number of manually labeled videos. In this paper, we introduce a supervised learning approach to recognize video actions with very few training videos. Specifically, we propose Temporal Attention Vectors (TAVs) which adapt various length videos to preserve the temporal information of the entire video. We evaluate the TAVs on UCF101 and HMDB51. Without training any deep 3D or 2D frame feature extractors on video datasets (only pre-trained on ImageNet), the TAVs only introduce 2.1M parameters but outperforms the state-of-the-art video action recognition benchmarks with very few labeled training videos (e.g. 92% on UCF101 and 59% on HMDB51, with 10 and 8 training videos per class, respectively). Furthermore, our approach can still achieve competitive results on full datasets (97.1% on UCF101 and 77% on HMDB51).
- 1 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 584-593
Few-Shot Learning of Video Action Recognition Only Based on Video Contents
The success of video action recognition based on Deep Neural Networks (DNNs) is highly dependent on a large number of manually labeled videos. In this paper, we introduce a supervised learning approach to recognize video actions with very few training videos. Specifically, we propose Temporal Attention Vectors (TAVs) which adapt various length videos to preserve the temporal information of the entire video. We evaluate the TAVs on UCF101 and HMDB51. Without training any deep 3D or 2D frame feature extractors on video datasets (only pre-trained on ImageNet), the TAVs only introduce 2.1M parameters but outperforms the state-of-the-art video action recognition benchmarks with very few labeled training videos (e.g. 92% on UCF101 and 59% on HMDB51, with 10 and 8 training videos per class, respectively). Furthermore, our approach can still achieve competitive results on full datasets (97.1% on UCF101 and 77% on HMDB51).
- Open Access
- 9 March 2018
- Published by Association for Computing Machinery (ACM)
- p. 116-120
Improved algorithm on haze removal based on dark channel prior and histogram specification
- 9 March 2018
- Published by Association for Computing Machinery (ACM)
- p. 116-120
Open AccessImproved algorithm on haze removal based on dark channel prior and histogram specification
- 1 January 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 20-23
A Robust Particle Filter for People Tracking
Among various tracking algorithms, particle filtering (PF) is a robust and accurate one for different applications. It also allows data fusion from different sources due to its inherent property without increasing the dimension of the state vector. In this paper, we propose three strategies to improve the performance of particle filters. First, our approach combines the foreground region with the particle initialization and similarity measure step to lower the background distraction. Second, we form the proposal distribution for particle filters from the dynamic model predicted from the previous time step. The combination of the two approach leads to fewer failure than traditional particle filters. Fusion of multiple cues including the spatial-color cues and edge cues is also used to improve the estimation performance. It is shown that with the improved proposal distribution above, the particle filter can provide greatly improved estimation accuracy and robustness for complicated tracking problems.
- 1 January 2010
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 20-23
A Robust Particle Filter for People Tracking
Among various tracking algorithms, particle filtering (PF) is a robust and accurate one for different applications. It also allows data fusion from different sources due to its inherent property without increasing the dimension of the state vector. In this paper, we propose three strategies to improve the performance of particle filters. First, our approach combines the foreground region with the particle initialization and similarity measure step to lower the background distraction. Second, we form the proposal distribution for particle filters from the dynamic model predicted from the previous time step. The combination of the two approach leads to fewer failure than traditional particle filters. Fusion of multiple cues including the spatial-color cues and edge cues is also used to improve the estimation performance. It is shown that with the improved proposal distribution above, the particle filter can provide greatly improved estimation accuracy and robustness for complicated tracking problems.