Jianqiao Luo

Jianqiao Luo

Auto-generated profile, based on publicly available information

Jianqiao Luo

College of Electrical and Information Engineering, Hunan University, Changsha, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
18 February 2021 in Remote Sensing
Verified
Journal Article
Open access
PDF file
JLJianqiao Luo
Jianqiao Luo
YWYihan Wang
Yihan Wang
YOYang Ou
Yang Ou
BHBiao He
Biao He
BLBailin Li
Bailin Li
Many aerial images with similar appearances have different but correlated scene labels, which causes the label ambiguity. Label distribution learning (LDL) can express label ambiguity by giving each sample a label distribution. Thus, a sample contributes to the learning of its ground-truth label as well as correlated labels, which improve data utilization. LDL has gained success in many fields, such as age estimation, in which label ambiguity can be easily modeled on the basis of the prior knowledge about local sample similarity and global label correlations. However, LDL has never been applied to scene classification, because there is no knowledge about the local similarity and label correlations and thus it is hard to model label ambiguity. In this paper, we uncover the sample neighbors that cause label ambiguity by jointly capturing the local similarity and label correlations and propose neighbor-based LDL (N-LDL) for aerial scene classification. We define a subspace learning problem, which formulates the neighboring relations as a coefficient matrix that is regularized by a sparse constraint and label correlations. The sparse constraint provides a few nearest neighbors, which captures local similarity. The label correlations are predefined according to the confusion matrices on validation sets. During subspace learning, the neighboring relations are encouraged to agree with the label correlations, which ensures that the uncovered neighbors have correlated labels. Finally, the label propagation among the neighbors forms the label distributions, which leads to label smoothing in terms of label ambiguity. The label distributions are used to train convolutional neural networks (CNNs). Experiments on the aerial image dataset (AID) and NWPU_RESISC45 (NR) datasets demonstrate that using the label distributions clearly improves the classification performance by assisting feature learning and mitigating over-fitting problems, and our method achieves state-of-the-art performance.

29 April 2025 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
JBJinghao Bian
Jinghao Bian
Mingtao FengMingtao Feng
Mingtao Feng
WDWeisheng Dong
Weisheng Dong
ZWZijie Wu
Zijie Wu
JLJianqiao Luo
Jianqiao Luo
GSGuangming Shi
Guangming Shi
Segmenting small defects within large imaging fields remains challenging in industrial scenarios due to the difficulty in distinguishing defects from complex component backgrounds and identifying defects comprising only a few pixels in high-resolution images. To address these issues, we propose a novel dual-branch feature extraction architecture, the locally aware visual state space block, which captures global contextual information while maintaining locally aware perception. In addition, we introduce the parallel quad-directional scanning fusion module to extract multiscale information, aggregating high-level features at different scales for enhanced global information fusion. To avoid losing small target details when upsampling the global segmentation mask to high-resolution input size, we develop progressive location refinement modules to incrementally refine small defect localization from the bottom up. Extensive experiments on our proposed small defect segmentation dataset and a public PCB dataset demonstrate that our method outperforms existing state-of-the-art methods in both performance and efficiency.

26 June 2021 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
JLJianqiao Luo
Jianqiao Luo
BHBiao He
Biao He
YOYang Ou
Yang Ou
BLBailin Li
Bailin Li
KWKai Wang
Kai Wang

20 March 2026 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
Mingtao FengMingtao Feng
Mingtao Feng
XLXin Li
Xin Li
JLJianqiao Luo
Jianqiao Luo
WDWeisheng Dong
Weisheng Dong
YWYaonan Wang
Yaonan Wang
AMAjmal Mian
Ajmal Mian
Fine-grained cross-view localization seeks to estimate precise camera poses by matching ground images with GPS-tagged aerial imagery. Existing methods typically employ first-order iterative optimization to progressively update the camera pose based on cross-view feature correspondences. However, they rely on local features and neglect global and complementary contextual information, making them prone to local optima and slow convergence under large initial errors or strong disturbances. To overcome these limitations, we propose a second-order robust iterative pose estimation framework for fine-grained cross-view localization. Firstly, we devise a second-order deep iterative optimization module to capture complementary forward and backward motion cues, leading to a bidirectional correlation volume. A motion aggregator uses the volume to approximate the dynamics of second-order iterators, substantially facilitating convergence and robustness. In addition, a bidirectional motion-aware robust regularization module mitigates geometric distortions and outlier interference by leveraging bidirectional motion cues to generate fine-grained confidence maps, adaptively suppressing unreliable regions and enhancing the stability of iterative optimization and pose estimation accuracy. Extensive experiments demonstrate that the proposed framework achieves faster convergence and higher pose estimation accuracy than state-of-the-art methods, particularly under large initial errors and challenging conditions.

25 December 2024 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
ZZZhen Zhou
Zhen Zhou
JLJianqiao Luo
Jianqiao Luo
QZQing Zhu
Qing Zhu
YWYaonan Wang
Yaonan Wang
HZHang Zhong
Hang Zhong
LCLin Chen
Lin Chen
Homography estimation for multimodal images poses a considerable challenge in computer vision because of content disparities and the diverse feature points captured by different sensors. Existing methods typically extract feature maps using neural networks and apply the Lucas–Kanade (LK) algorithm, which is based on the brightness constancy assumption, to solve the homography matrix. However, applying this assumption across all pixel features in multimodal images can lead to inaccuracies, as these images often contain noise, such as homogeneous regions or considerable appearance variations, which can corrupt the network’s training. To address this problem, we propose an uncertainty-guided deep Lucas–Kanade (UG-DLK) framework that integrates uncertainty predictions to enhance the network’s iterative learning process. Specifically, we employ a probabilistic approach where the network predicts the distribution of the feature map rather than fixed values. By designing an uncertainty neighborhood estimator, we unfold the cost volume along the channels into 2D slices, allowing the model to focus on neighborhood information at specific locations, effectively reducing the interference from spatial neighborhoods in the estimation of feature uncertainty. Through uncertainty modeling, the network can accurately identify scenes and objects that comply with the brightness constancy constraint, leading to more robust learning outcomes. Additionally, we introduce a novel loss function that incorporates feature uncertainty, leading to a smoother optimization landscape near the true homography parameters and reducing convergence oscillations. Our method, which is evaluated on benchmark datasets such as Google Maps, Google Earth, MSCOCO, and DPDN, demonstrates state-of-theart performance, confirming the robustness and adaptability of our model across various scenarios.

21 February 2021 in Remote Sensing Letters
Verified
Journal Article
Closed access
YOYang Ou
Yang Ou
BHBiao He
Biao He
JLJianqiao Luo
Jianqiao Luo
BLBailin Li
Bailin Li
Weighted nuclear norm minimization (WNNM) has produced remarkable denoising results; however, it still has some limitations, including only being able to measure the similarity of noisy patches by Euclidean distance, fixing the feedback proportion of method noise for all noise levels, and establishing an inflexible number of iterations for each image. In this paper, three strategies are used to improve the abovementioned shortcomings. The first strategy is to calculate the correlation coefficient using Grey theory, and it is combined with Euclidean distance as the final similarity measure value. The second strategy is to adaptively add the feedback coefficient of the method noise according to various noise levels. The last strategy is to apply a stopping criterion based on residual noise to the iteration process. Experimental results show our method provides better results compared to various state-of-the-art algorithms.