Tian Fang Zheng

Dr. Tian Fang Zheng

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
6 February 2022 in Sensors
Verified
Journal Article
Open access
PDF file
Rui MiaoRui Miao
Rui Miao
HJHongxu Jiang
Hongxu Jiang
TZTian Fang Zheng
Tian Fang Zheng
The sophistication of ship detection technology in remote sensing images is insufficient, the detection results differ substantially from the practical requirements, mainly reflected in the inadequate support for the differentiated application of multi-scene, multi-resolution and multi-type target ships. To overcome these challenges, a ship detection method based on multiscale feature extraction and lightweight CNN is proposed. Firstly, the candidate-region extraction method, based on a multiscale model, can cover the potential targets under different backgrounds accurately. Secondly, the multiple feature fusion method is employed to achieve ship classification, in which, Fourier global spectrum features are applied to discriminate between targets and simple interference, and the targets in complex interference scenarios are further distinguished by using lightweight CNN. Thirdly, the cascade classifier training algorithm and an improved non-maximum suppression method are used to minimise the classification error rate and maximise generalisation, which can achieve final-target confirmation. Experimental results validate our method, showing that it significantly outperforms the available alternatives, reducing the model size by up to 2.17 times while improving detection performance be improved by up to 5.5% in multi-interference scenarios. Furthermore, the robustness ability was verified by three indicators, among which the F-measure score and true–false-positive rate can increase by up to 5.8% and 4.7% respectively, while the mean error rate can decrease by up to 38.2%.

1 September 2021 in Neurocomputing
Verified
Journal Article
Closed access
XLXiaobin Li
Xiaobin Li
HJHongxu Jiang
Hongxu Jiang
RZRunhua Zhang
Runhua Zhang
TZTian Fang Zheng
Tian Fang Zheng
SHShuangxi Huang
Shuangxi Huang
DXDonghuan Xu
Donghuan Xu

25 March 2022 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
Rui MiaoRui Miao
Rui Miao
HJHongxu Jiang
Hongxu Jiang
TZTian Fang Zheng
Tian Fang Zheng
XLXiaobin Li
Xiaobin Li

20 October 2020 in arXiv
Verified
Preprint
Open access
PDF file
XLXiaobin Li
Xiaobin Li
HJHongxu Jiang
Hongxu Jiang
SHShuangxi Huang
Shuangxi Huang
TZTian Fang Zheng
Tian Fang Zheng
Quantized neural network (NN) with a reduced bit precision is an effective solution to reduces the computational and memory resource requirements and plays a vital role in machine learning. However, it is still challenging to avoid the significant accuracy degradation due to its numerical approximation and lower redundancy. In this paper, a novel robustness-aware 2-bit quantization scheme is proposed for NN base on binary NN and generative adversarial network(GAN), witch improves the performance by enriching the information of binary NN, efficiently extract the structural information and considering the robustness of the quantized NN. Specifically, using shift addition operation to replace the multiply-accumulate in the quantization process witch can effectively speed the NN. Meanwhile, a structural loss between the original NN and quantized NN is proposed to such that the structural information of data is preserved after quantization. The structural information learned from NN not only plays an important role in improving the performance but also allows for further fine tuning of the quantization network by applying the Lipschitz constraint to the structural loss. In addition, we also for the first time take the robustness of the quantized NN into consideration and propose a non-sensitive perturbation loss function by introducing an extraneous term of spectral norm. The experiments are conducted on CIFAR-10 and ImageNet datasets with popular NN( such as MoblieNetV2, SqueezeNet, ResNet20, etc). The experimental results show that the proposed algorithm is more competitive under 2-bit-precision than the state-of-the-art quantization methods. Meanwhile, the experimental results also demonstrate that the proposed method is robust under the FGSM adversarial samples attack.

19 October 2026 in Electronics
Verified
Journal Article
Open access
PDF file
CZChenhui Zhu
Chenhui Zhu
RZRunhua Zhang
Runhua Zhang
TZTian Fang Zheng
Tian Fang Zheng
Compression changes both the information retained by a large language model and the resources required to complete a request. This narrative review examines quantization, pruning and sparsity, knowledge distillation, low-rank factorization, and token, context, and key–value cache compression for autoregressive text generation, principally with decoder-only LLMs. Its central contribution is a synthesis of changes relative to each study’s baseline, connecting compression mechanisms to capability and deployment choices. Four numerical tables distinguish quality changes at stated compression budgets, distillation gains over same-size students, and paired or independent deployment measurements. Reporting is appraised by source identity, comparison conditions, measurement scope, artefacts, and uncertainty. The reviewed cases illustrate how capacity constraints change the feasible precision choices, how allocating a shared budget changes different task scores, and how compact-model construction and request compression address complementary resource demands. A deployment-validation sequence turns these findings into candidate checks for a target workload. Remaining questions concern transfer across capabilities, delayed use of compressed information, interactions between compression stages, and complete-task cost, including agent interactions.