FuJian Feng

Prof. FuJian Feng


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
13 May 2022 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
HHHan Huang
Han Huang
FFFuJian Feng
FuJian Feng
SHShuqiang Huang
Shuqiang Huang
LCLiang Chen
Liang Chen
ZHZhifeng Hao
Zhifeng Hao
Automated tuning can significantly improve productivity and save the costs of manual operation in the microwave filter manufacturing industry. This article proposes a mathematical model of scattering data optimization to find the accurate coupling matrix for multiple-version microwave filters, a core step of automated microwave filter tuning. For the large-scale problem of coupling coefficient combination, we propose a decision set decomposition strategy that evenly divides the entire frequency interval into several subintervals according to the correlation between scattering data. With this strategy, we design a microscale (small-size subsets of the decomposed decision set) searching algorithm, which solves each suboptimization problem by searching the decision subset instead of the entire decision set. To verify the validity of the proposed algorithm for multiple-version microwave filters, experiments are conducted on three versions of microwave filters from a real-world production line, including the two-port eighth-order, ninth-order, and tenth-order microwave filters. Experimental results show that the proposed model is feasible within the industrial error for the multiversion microwave filter tuning problem. Besides, the proposed algorithm outperforms the state-of-the-art optimization algorithms in the coupling matrix optimization problem.

18 May 2020 in IEEE Access
Verified
Journal Article
Open access
LYLiang Yihui
Liang Yihui
FFFuJian Feng
FuJian Feng
CZCai Zhaoquan
Cai Zhaoquan
Image matting is an important problem in computer vision with significant theoretical interest and diverse practical applications, including image/video editing, target tracking, and object recognition. Pixel-pair-optimization-based image matting approaches have been shown very successful in estimating the opacity of the foreground by searching for the best pair of foreground and background pixels for each unknown pixel. However, extant approaches encounter difficulties in adapting to the changes of available computing resources, which limits the application of image matting. This drawback has motivated the present study, as a part of which a multi-scale evolutionary pixel pair optimization framework named pyramid matting framework (PMF) was developed. In this framework, the large-scale pixel pair optimization problem is transformed to multiple pixel pair optimization problems of different scales using image pyramid. The resulting problems are solved level by level, starting from the problem at the small scale. Pixel pair heuristic information obtained from solving low-scale problems are iteratively propagated to the spatially-related pixel pairs in the larger-scale problem. PMF can adapt to changes in available computing resources due to its capability of transforming a small-scale problem solution to the large-scale problem solution through the heuristic information propagation. Experimental results show that the PMF-based image matting approach not only provides high-quality alpha mattes with sufficient computing resources, but also works well when computing resources are scarce.

21 June 2024 in PeerJ Computer Science
Verified
Journal Article
Open access
PDF file
LFLe Feng
Le Feng
YYYuan Yang
Yuan Yang
MTMian Tan
Mian Tan
TZTaotao Zeng
Taotao Zeng
HTHuachun Tang
Huachun Tang
FFFuJian Feng
FuJian Feng
Fine-tuning is an important technique in transfer learning that has achieved significant success in tasks that lack training data. However, as it is difficult to extract effective features for single-source domain fine-tuning when the data distribution difference between the source and the target domain is large, we propose a transfer learning framework based on multi-source domain called adaptive multi-source domain collaborative fine-tuning (AMCF) to address this issue. AMCF utilizes multiple source domain models for collaborative fine-tuning, thereby improving the feature extraction capability of model in the target task. Specifically, AMCF employs an adaptive multi-source domain layer selection strategy to customize appropriate layer fine-tuning schemes for the target task among multiple source domain models, aiming to extract more efficient features. Furthermore, a novel multi-source domain collaborative loss function is designed to facilitate the precise extraction of target data features by each source domain model. Simultaneously, it works towards minimizing the output difference among various source domain models, thereby enhancing the adaptability of the source domain model to the target data. In order to validate the effectiveness of AMCF, it is applied to seven public visual classification datasets commonly used in transfer learning, and compared with the most widely used single-source domain fine-tuning methods. Experimental results demonstrate that, in comparison with the existing fine-tuning methods, our method not only enhances the accuracy of feature extraction in the model but also provides precise layer fine-tuning schemes for the target task, thereby significantly improving the fine-tuning performance.

23 May 2022 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
FFFuJian Feng
FuJian Feng
HHHan Huang
Han Huang
DLDi Liu
Di Liu
YLYihui Liang
Yihui Liang

10 July 2023 in Biomimetics
Verified
Journal Article
Open access
PDF file
YYYuan Yang
Yuan Yang
HGHongshan Gou
Hongshan Gou
MTMian Tan
Mian Tan
FFFuJian Feng
FuJian Feng
YLYihui Liang
Yihui Liang
HHHan Huang
Han Huang
Natural image matting is an essential technique for image processing that enables various applications, such as image synthesis, video editing, and target tracking. However, the existing image matting methods may fail to produce satisfactory results when computing resources are limited. Sampling-based methods can reduce the dimensionality of the decision space and, therefore, reduce computational resources by employing different sampling strategies. While these approaches reduce computational consumption, they may miss an optimal pixel pair when the number of available high-quality pixel pairs is limited. To address this shortcoming, we propose a novel multi-criterion sampling strategy that avoids missing high-quality pixel pairs by incorporating multi-range pixel pair sampling and a high-quality sample selection method. This strategy is employed to develop a multi-criterion matting algorithm via Gaussian process, which searches for the optimal pixel pair by using the Gaussian process fitting model instead of solving the original pixel pair objective function. The experimental results demonstrate that our proposed algorithm outperformed other methods, even with 1% computing resources, and achieved alpha matte results comparable to those yielded by the state-of-the-art optimization algorithms.

19 March 2026 in IEEE Transactions on Emerging Topics in Computational Intelligence
Verified
Journal Article
Closed access
HQHaoxiang Qin
Haoxiang Qin
YXYi Xiang
Yi Xiang
YHYuyan Han
Yuyan Han
YWYuting Wang
Yuting Wang
CWChunguo Wu
Chunguo Wu
FFFuJian Feng
FuJian Feng
Distributed Flexible Job Shop Scheduling with Transportation Constraints (DFJSP-T) is widely used in manufacturing workshops across various industries, as it more accurately represents real-world production scenarios. However, many existing studies do not fully leverage critical problem features or domain knowledge, limiting the ability of current algorithms to find high-quality solutions for complex large-scale problems. To address these challenges, this paper proposes a Self-Adaptive Differential Evolution Enhanced Quality-Diversity Optimization (SADE-QD). The SADE-QD incorporates domain knowledge in three main ways: (1) it models the problem using machine idle and job transportation features, allowing the algorithm to retain solutions with diverse behaviors; (2) it introduces a knowledge-guided heuristic search strategy based on critical path to discover more high-quality solutions; and (3) it applies an self-adaptive differential evolution search method that leverages machine idle and transportation features to explore a broader range of solutions. This helps valuable information from the feature space contribute directly to the search process. Experiments on small, medium, and large scale benchmarks show that SADE-QD achieves an average makespan reduction of 12% compared to several recent state-of-the-art algorithms.