Tiaojun Zeng

Dr. Tiaojun Zeng

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
2 January 2021 in Remote Sensing Letters
Verified
Journal Article
Closed access
QYQiyuan Yang
Qiyuan Yang
CWChuanjian Wang
Chuanjian Wang
TZTiaojun Zeng
Tiaojun Zeng
This paper proposes convolutional neural network jointed with long short-time memory (CNN_LSTM) and Seq2Seq based on convolutional operation (Convolutional Seq2Seq), which the fully connected operation of Seq2Seq is replaced by convolution, and the attention mechanism of Seq2Seq is improved to monitor changes in water bodies. Convolutional Seq2Seq and CNN_LSTM can extract the temporal and spatial characteristics of remote sensing image time series. We also propose downsampling and resolution recovery (DDR) modules to reduce the computational resource consumption of the two models. Compared with the popular full convolutional network (FCN) −8s, DeepLab v2 with a baseline of ResNet101, and long short time memory (LSTM) methods, the water change monitoring results based on Convolutional Seq2Seq and CNN_LSTM have lower noise and higher accuracy. The CNN_LSTM method also allows fewer hidden layer features of LSTM with high-precision change monitoring results.

1 January 2022 in Journal of Mathematics
Verified
Journal Article
Open access
PDF file
XHXionghua Huang
Xionghua Huang
TZTiaojun Zeng
Tiaojun Zeng
MLMinSong Li
MinSong Li
In this study, a particle swarm optimization (PSO) algorithm with a negative gradient perturbation and binary tree depth‐first strategy (GB‐PSO) is proposed. The negative gradient term accelerates particle optimization in the direction of decreasing the objective function value. To calculate the step size of this gradient term more easily, a method based on the ratio was proposed. In addition, a new PSO strategy is also proposed. Each iteration of PSO yields not only the current optimal solution of the group, but also the solution based on the 2‐norm maximum. Under the current iteration solution of PSO, these two solutions are the children nodes. In the sense of the binary tree concept, the three solutions constitute the father‐son relationship, and the solution generated throughout the entire search process constitutes the binary tree. PSO uses a traceable depth‐first strategy to determine the optimal solution. Compared with the linear search strategy adopted by several algorithms, it can fully utilize the useful information obtained during the iterative process, construct a variety of particle swarm search paths, and prevent premature and enhance global optimization. The experimental results show that the algorithm outperforms some state‐of‐the‐art PSO algorithms in terms of search performance.

28 February 2017 in Signal, Image and Video Processing
Verified
Journal Article
Closed access
PDF file
TZTiaojun Zeng
Tiaojun Zeng
CWChuanjian Wang
Chuanjian Wang


31 May 2024 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
XHXionghua Huang
Xionghua Huang
TZTiaojun Zeng
Tiaojun Zeng
MLMinSong Li
MinSong Li
YPYunfei Pan
Yunfei Pan
An automated flower thinning system, when combined with machine vision, has the potential to reduce the labor force, improve efficiency, and lower costs. This combination represents the future of agricultural machinery development. The primary objective of automatic flower thinning is to determine the flowering density of fruit trees under natural light conditions. In this study, we introduce a flower recognition algorithm that uses pixel values as an independent variable to recognize flower categories by constructing a nonlinear regression model. Initially, the RGB pixel values of elements in the training set are extracted. Similar pixel values are clustered together to reduce the amount of computation, and representative elements are selected to construct a nonlinear classification function, known as the regression function. The coefficients in the classifier are determined by transforming the problem into an unconstrained optimization problem using the least square method. The optimal solution is then found as the coefficient value in the classifier. The classification function calculates the function value of the RGB pixel value for each input entity to determine whether it belongs to the flower entity. Finally, the developed algorithm is used to classify the flower graphic elements of the measured pictures, and the efficiency of the algorithm is verified.