Chen Lv
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
Research Subjects
Chen Lv has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Deqiang Cheng
School of Information and Control Engineering, China University of Mining and Technology, Xuzhou, China
5 shared publications - He Jiang
School of Mines, China University of Mining and Technology, Xuzhou 221116, China
5 shared publications - Qiqi Kou
School of Computer Science and Technology, China University of Mining and Technology, Xuzhou, China
5 shared publications - Chenggong Han
School of Information and Control Engineering, China University of Mining and Technology, Xuzhou, China
3 shared publications - Hao Gu
China University of Mining and Technology
2 shared publications Agalya Govindasamy
Department of Applied Chemistry, Graduate School of Engineering, Tohoku University, 6-6-07 Aoba, Aramaki, Aoba-ku, Sendai 980-8579, Japan
1 shared publication
Latest Publications
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (21) , 49724-49738
Lightweight Single-Image Super-Resolution Based on Deep Information Discrepancy Representation Learning
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (21) , 49724-49738
Lightweight Single-Image Super-Resolution Based on Deep Information Discrepancy Representation Learning
- 2 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 28 (15209210) , 4851-4863
FGDepth: Fine-Grained Boundary Perception Enhancement in Self-Supervised Indoor Depth Estimation
Self-supervised depth estimation has been widely ap plied in indoor environments. However, the presence of numerous objects and complex structural boundaries often leads existing methods to generate blurred or imprecise depth edges. To address this challenge, we propose FGDepth, a framework designed to enhance depth estimation through fine-grained boundary perception. Firstly, we introduce an SR (Super Resolution) auxiliary training branch that shares feature layers with the encoder of the depth estimation network. By utilizing the powerful detail recovery capabilities of the SR task, we improve the depth network's sensitivity to indoor object boundaries. Notably, the SR branch is used only during training, ensuring no added computational cost during inference. As far as we know, we are the first to employ the SR task as an auxiliary method for indoor self-supervised depth estimation. Second, we observe that outdoor scenes display significant depth variations due to their broader depth range, whereas indoor scenes typically lack clear boundary distinctions in background areas. This is because distant objects in indoor settings often appear as continuous surfaces with similar depths. This characteristic necessitates careful mitigation of background depth uniformity interference when enhancing depth boundaries in indoor scenes. Therefore, we design a depth-adaptive object mask to provide target object boundary information and use a triplet loss to align these differences with the depth map. Experimental results on three benchmark datasets show that our method outperforms existing approaches. We also conduct ablation studies to validate the contributions of each component.
- 2 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 28 (15209210) , 4851-4863
FGDepth: Fine-Grained Boundary Perception Enhancement in Self-Supervised Indoor Depth Estimation
Self-supervised depth estimation has been widely ap plied in indoor environments. However, the presence of numerous objects and complex structural boundaries often leads existing methods to generate blurred or imprecise depth edges. To address this challenge, we propose FGDepth, a framework designed to enhance depth estimation through fine-grained boundary perception. Firstly, we introduce an SR (Super Resolution) auxiliary training branch that shares feature layers with the encoder of the depth estimation network. By utilizing the powerful detail recovery capabilities of the SR task, we improve the depth network's sensitivity to indoor object boundaries. Notably, the SR branch is used only during training, ensuring no added computational cost during inference. As far as we know, we are the first to employ the SR task as an auxiliary method for indoor self-supervised depth estimation. Second, we observe that outdoor scenes display significant depth variations due to their broader depth range, whereas indoor scenes typically lack clear boundary distinctions in background areas. This is because distant objects in indoor settings often appear as continuous surfaces with similar depths. This characteristic necessitates careful mitigation of background depth uniformity interference when enhancing depth boundaries in indoor scenes. Therefore, we design a depth-adaptive object mask to provide target object boundary information and use a triplet loss to align these differences with the depth map. Experimental results on three benchmark datasets show that our method outperforms existing approaches. We also conduct ablation studies to validate the contributions of each component.
- Open Access
Tracking-Based Denoising: A Trilateral Filter-Based Denoiser for Real-World Surveillance Video in Extreme Low-Light Conditions
Video denoising in extremely low-light surveillance scenarios is a challenging task in computer vision, as it suffers from harsh noise and insufficient signal to reconstruct fine details. The denoising algorithm for these scenarios encounters challenges such as the lack of ground truth, and the noise distribution in the real world is far more complex than in a normal scene. Consequently, recent state-of-the-art (SOTA) methods like VRT and Turtle for video denoising perform poorly in this low-light environment. Additionally, some methods rely on raw video data, which is difficult to obtain from surveillance systems. In this paper, a denoising method is proposed based on the trilateral filter, which aims to denoise real-world low-light surveillance videos. Our trilateral filter is a weighted filter, allocating reasonable weights to different inputs to produce an appropriate output. Our idea is inspired by an experimental finding: noise on stationary objects can be easily suppressed by averaging adjacent frames. This led us to believe that if we can track moving objects accurately and filter along their trajectories, the noise may be effectively removed. Our proposed method involves four main steps. First, coarse motion vectors are obtained by bilateral search. Second, an amplitude-phase filter is used to judge and correct erroneous vectors. Third, these vectors are refined by a full search in a small area for greater accuracy. Finally, the trilateral filter is applied along the trajectory to denoise the noisy frame. Extensive experiments have demonstrated that our method achieves superior performance in terms of visual effects and quantitative tests.
Open AccessTracking-Based Denoising: A Trilateral Filter-Based Denoiser for Real-World Surveillance Video in Extreme Low-Light Conditions
Video denoising in extremely low-light surveillance scenarios is a challenging task in computer vision, as it suffers from harsh noise and insufficient signal to reconstruct fine details. The denoising algorithm for these scenarios encounters challenges such as the lack of ground truth, and the noise distribution in the real world is far more complex than in a normal scene. Consequently, recent state-of-the-art (SOTA) methods like VRT and Turtle for video denoising perform poorly in this low-light environment. Additionally, some methods rely on raw video data, which is difficult to obtain from surveillance systems. In this paper, a denoising method is proposed based on the trilateral filter, which aims to denoise real-world low-light surveillance videos. Our trilateral filter is a weighted filter, allocating reasonable weights to different inputs to produce an appropriate output. Our idea is inspired by an experimental finding: noise on stationary objects can be easily suppressed by averaging adjacent frames. This led us to believe that if we can track moving objects accurately and filter along their trajectories, the noise may be effectively removed. Our proposed method involves four main steps. First, coarse motion vectors are obtained by bilateral search. Second, an amplitude-phase filter is used to judge and correct erroneous vectors. Third, these vectors are refined by a full search in a small area for greater accuracy. Finally, the trilateral filter is applied along the trajectory to denoise the noisy frame. Extensive experiments have demonstrated that our method achieves superior performance in terms of visual effects and quantitative tests.
- 23 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 74 (00189456) , 1-16
PRDepth: Pose Refinement Enhancement-Based Monocular Depth Estimation for Indoor Scenes
Indoor depth measurement is widely used in technologies such as virtual reality and augmented reality. However, indoor scenes are typically captured with handheld cameras, resulting in more complex and unpredictable variations between frames. Self-supervised depth estimation relies on frame-to-frame projection for self-constraint, and inaccurate pose predictions between frames significantly hinder depth estimation in indoor environments. To address this issue, PRDepth is proposed, a self-supervised pose refinement method tailored for indoor environments. PRDepth introduces a Pose Reconstruction Iterative Module that refines multi-frame pose decomposition and reconstruction. By leveraging contextual information from intermediate frames, it mitigates estimation errors caused by large rotations and reduces training errors due to inaccurate rotations, leading to more precise pose predictions between frames. Additionally, to enhance the information exchange and context integration capabilities of the depth network, PRDepth features a depth-weighted incentive module, which includes a Global Depth Enhancement Module in the encoder-decoder and a Weight-Adaptive Incentive Module in the decoder. The Global Depth Enhancement Module improves the network’s ability to extract depth information in complex scenes by interacting with global cross-dimensional data. An attention-guided mechanism is adopted by the Weight-Adaptive Incentive Module to aggregate multi-scale feature information and assign adaptive weights to different features, ensuring efficient global context fusion and suppression of redundant information. Experimental results demonstrate that our method significantly outperforms existing state-of-the-art self-supervised monocular depth estimation techniques for indoor scenes. Extensive ablation studies are conducted on each module of PRDepth. PRDepth demonstrates precise depth estimation and robust generalization across indoor datasets, including NYUv2, 7-Scenes, ScanNet, and InteriorNet.
- 23 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Instrumentation and Measurement
- Vol. 74 (00189456) , 1-16
PRDepth: Pose Refinement Enhancement-Based Monocular Depth Estimation for Indoor Scenes
Indoor depth measurement is widely used in technologies such as virtual reality and augmented reality. However, indoor scenes are typically captured with handheld cameras, resulting in more complex and unpredictable variations between frames. Self-supervised depth estimation relies on frame-to-frame projection for self-constraint, and inaccurate pose predictions between frames significantly hinder depth estimation in indoor environments. To address this issue, PRDepth is proposed, a self-supervised pose refinement method tailored for indoor environments. PRDepth introduces a Pose Reconstruction Iterative Module that refines multi-frame pose decomposition and reconstruction. By leveraging contextual information from intermediate frames, it mitigates estimation errors caused by large rotations and reduces training errors due to inaccurate rotations, leading to more precise pose predictions between frames. Additionally, to enhance the information exchange and context integration capabilities of the depth network, PRDepth features a depth-weighted incentive module, which includes a Global Depth Enhancement Module in the encoder-decoder and a Weight-Adaptive Incentive Module in the decoder. The Global Depth Enhancement Module improves the network’s ability to extract depth information in complex scenes by interacting with global cross-dimensional data. An attention-guided mechanism is adopted by the Weight-Adaptive Incentive Module to aggregate multi-scale feature information and assign adaptive weights to different features, ensuring efficient global context fusion and suppression of redundant information. Experimental results demonstrate that our method significantly outperforms existing state-of-the-art self-supervised monocular depth estimation techniques for indoor scenes. Extensive ablation studies are conducted on each module of PRDepth. PRDepth demonstrates precise depth estimation and robust generalization across indoor datasets, including NYUv2, 7-Scenes, ScanNet, and InteriorNet.
- Open Access
Dual-Path Large Kernel Learning and Its Applications in Single-Image Super-Resolution
To enhance the performance of super-resolution models, neural networks frequently employ module stacking. However, this approach inevitably results in an excessive proliferation of parameter counts and information redundancy, ultimately constraining the deployment of these models on mobile devices. To surmount this limitation, this study introduces the application of Dual-path Large Kernel Learning (DLKL) to the task of image super-resolution. Within the DLKL framework, we harness a multiscale large kernel decomposition technique to efficiently establish long-range dependencies among pixels. This network not only maintains excellent performance but also significantly mitigates the parameter burden, achieving an optimal balance between network performance and efficiency. When compared with other prevalent algorithms, DLKL exhibits remarkable proficiency in generating images with sharper textures and structures that are more akin to natural ones. It is particularly noteworthy that on the challenging texture dataset Urban100, the network proposed in this study achieved a significant improvement in Peak Signal-to-Noise Ratio (PSNR) for the ×4 upscaling task, with an increase of 0.32 dB and 0.19 dB compared with the state-of-the-art HAFRN and MICU networks, respectively. This remarkable result not only validates the effectiveness of the present model in complex image super-resolution tasks but also highlights its superior performance and unique advantages in the field.
Open AccessDual-Path Large Kernel Learning and Its Applications in Single-Image Super-Resolution
To enhance the performance of super-resolution models, neural networks frequently employ module stacking. However, this approach inevitably results in an excessive proliferation of parameter counts and information redundancy, ultimately constraining the deployment of these models on mobile devices. To surmount this limitation, this study introduces the application of Dual-path Large Kernel Learning (DLKL) to the task of image super-resolution. Within the DLKL framework, we harness a multiscale large kernel decomposition technique to efficiently establish long-range dependencies among pixels. This network not only maintains excellent performance but also significantly mitigates the parameter burden, achieving an optimal balance between network performance and efficiency. When compared with other prevalent algorithms, DLKL exhibits remarkable proficiency in generating images with sharper textures and structures that are more akin to natural ones. It is particularly noteworthy that on the challenging texture dataset Urban100, the network proposed in this study achieved a significant improvement in Peak Signal-to-Noise Ratio (PSNR) for the ×4 upscaling task, with an increase of 0.32 dB and 0.19 dB compared with the state-of-the-art HAFRN and MICU networks, respectively. This remarkable result not only validates the effectiveness of the present model in complex image super-resolution tasks but also highlights its superior performance and unique advantages in the field.
- 26 April 2024
- Published by Springer Nature
- p. 575-581
TransIndoor: Transformer Based Self-supervised Indoor Depth Estimation
- 26 April 2024
- Published by Springer Nature
- p. 575-581
TransIndoor: Transformer Based Self-supervised Indoor Depth Estimation
- Open Access
- 13 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 8455-8466
Advertising Image Saliency Prediction Method Based on Score Level Fusion
At present, visual saliency prediction algorithms have been developed more and more mature, but most of the current saliency prediction algorithms are aimed at natural images. Due to the inconsistency of elements and features between natural images and advertising images, the existing saliency prediction algorithms show poor robustness and low inference speed to advertising images, which severely limits its commercial application in advertising design and evaluation. In view of this, a saliency prediction algorithm for advertisement images is proposed in this paper. In the feature extraction stage, two text candidate regions based on intensity feature and improved MESR algorithm are first obtained and further integrated to produce a two-dimensional text confidence score. Meanwhile, a saliency confidence score is also obtained by an improved natural image saliency prediction network. Then, the score level fusion strategy was adopted to fuse the two confidence scores to get the final saliency prediction map. The experimental results show that the proposed model has good accuracy and robustness in advertising images, as well as the most remarkable inference speed, which can meet the demand for real-time performance of advertising image saliency prediction, leading to great practical and commercial value.
- 13 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 8455-8466
Open AccessAdvertising Image Saliency Prediction Method Based on Score Level Fusion
At present, visual saliency prediction algorithms have been developed more and more mature, but most of the current saliency prediction algorithms are aimed at natural images. Due to the inconsistency of elements and features between natural images and advertising images, the existing saliency prediction algorithms show poor robustness and low inference speed to advertising images, which severely limits its commercial application in advertising design and evaluation. In view of this, a saliency prediction algorithm for advertisement images is proposed in this paper. In the feature extraction stage, two text candidate regions based on intensity feature and improved MESR algorithm are first obtained and further integrated to produce a two-dimensional text confidence score. Meanwhile, a saliency confidence score is also obtained by an improved natural image saliency prediction network. Then, the score level fusion strategy was adopted to fuse the two confidence scores to get the final saliency prediction map. The experimental results show that the proposed model has good accuracy and robustness in advertising images, as well as the most remarkable inference speed, which can meet the demand for real-time performance of advertising image saliency prediction, leading to great practical and commercial value.
- Open Access
- 1 October 2021
- Published by Hindawi Limited in Mathematical Problems in Engineering
- Vol. 2021, 1-10
IOU-Guided Siamese Tracking
Target tracking is currently a hot research topic in machine vision. The traditional target tracking algorithm based on the generative model selects target features manually, which has a simple structure and fast running speed, but it cannot meet the requirements of algorithm accuracy in complex scenes. Compared with traditional algorithms, due to the good performance, the tracking method based on full convolutional network has become one of the important methods of target tracking. However, the RPN-based Siamese network lacks positional reliability when predicting the target area. Aiming at the low tracking accuracy of the RPN-based Siamese network, this paper proposes an improved framework model named IoU-guided SiamRPN (IG-SiamRPN). In the proposed IG-SiamRPN, the IoU-guided branch is first constructed and sample pairs are generated through data augmentation. Then, the Jittered RoI is constructed to train the network to realize the direct prediction of the localization confidence of the candidate area. Subsequently, a target selection method based on predicted IoU scores is proposed, which uses predicted IoU scores instead of classification scores to optimize the target decision strategy of the Siamese network. Finally, an optimization-based fine-tuning method for the Siamese network frame is proposed, which solves the problem of location degradation and improves the performance of the algorithm. Compared with other state-of-the-art target tracking algorithms, experimental results on popular databases demonstrate that the proposed IG-SiamRPN can achieve better performance in both tracking accuracy and robustness.
- 1 October 2021
- Published by Hindawi Limited in Mathematical Problems in Engineering
- Vol. 2021, 1-10
Open AccessIOU-Guided Siamese Tracking
Target tracking is currently a hot research topic in machine vision. The traditional target tracking algorithm based on the generative model selects target features manually, which has a simple structure and fast running speed, but it cannot meet the requirements of algorithm accuracy in complex scenes. Compared with traditional algorithms, due to the good performance, the tracking method based on full convolutional network has become one of the important methods of target tracking. However, the RPN-based Siamese network lacks positional reliability when predicting the target area. Aiming at the low tracking accuracy of the RPN-based Siamese network, this paper proposes an improved framework model named IoU-guided SiamRPN (IG-SiamRPN). In the proposed IG-SiamRPN, the IoU-guided branch is first constructed and sample pairs are generated through data augmentation. Then, the Jittered RoI is constructed to train the network to realize the direct prediction of the localization confidence of the candidate area. Subsequently, a target selection method based on predicted IoU scores is proposed, which uses predicted IoU scores instead of classification scores to optimize the target decision strategy of the Siamese network. Finally, an optimization-based fine-tuning method for the Siamese network frame is proposed, which solves the problem of location degradation and improves the performance of the algorithm. Compared with other state-of-the-art target tracking algorithms, experimental results on popular databases demonstrate that the proposed IG-SiamRPN can achieve better performance in both tracking accuracy and robustness.
- Open Access
- 20 July 2021
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2021, 1-17
Stereo Matching Algorithm Based on HSV Color Space and Improved Census Transform
Aiming at the problem that stereo matching accuracy is easily affected by noise and amplitude distortion, a stereo matching algorithm based on HSV color space and improved census transform is proposed. In the cost calculation stage, the color image is first converted from RGB space to HSV space; moreover, the hue channel is used as the matching primitive to establish the hue absolute difference (HAD) cost calculation function, which reduces the amount of calculation and enhances the robustness of matching. Then, to solve the problem of the traditional census transform overrelying on the central pixel and to improve the noise resistance of the algorithm, an improved census method based on neighborhood weighting is also proposed. Finally, the HAD cost and the improved census cost are nonlinearly fused as the initial cost. In the aggregation stage, an outlier elimination method based on confidence interval is proposed. By calculating the confidence interval of the aggregation window, this paper eliminates the cost value that is not in the confidence interval and subsequently filters as well as aggregates the remaining costs to further reduce the noise interference and improve the matching accuracy. Experiments show that the proposed method can not only effectively suppress the influence of noise, but also achieve a more robust matching effect in scenes with changing exposure and lighting conditions.
- 20 July 2021
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2021, 1-17
Open AccessStereo Matching Algorithm Based on HSV Color Space and Improved Census Transform
Aiming at the problem that stereo matching accuracy is easily affected by noise and amplitude distortion, a stereo matching algorithm based on HSV color space and improved census transform is proposed. In the cost calculation stage, the color image is first converted from RGB space to HSV space; moreover, the hue channel is used as the matching primitive to establish the hue absolute difference (HAD) cost calculation function, which reduces the amount of calculation and enhances the robustness of matching. Then, to solve the problem of the traditional census transform overrelying on the central pixel and to improve the noise resistance of the algorithm, an improved census method based on neighborhood weighting is also proposed. Finally, the HAD cost and the improved census cost are nonlinearly fused as the initial cost. In the aggregation stage, an outlier elimination method based on confidence interval is proposed. By calculating the confidence interval of the aggregation window, this paper eliminates the cost value that is not in the confidence interval and subsequently filters as well as aggregates the remaining costs to further reduce the noise interference and improve the matching accuracy. Experiments show that the proposed method can not only effectively suppress the influence of noise, but also achieve a more robust matching effect in scenes with changing exposure and lighting conditions.
- 1 April 2005
- Published by IOP Publishing in Japanese Journal of Applied Physics
- Vol. 44 (4S) , 2806
Tight-Binding Quantum Chemical Calculations of Electronic Structures of Indium Tin Oxide
We report a theoretical study on the electronic structures of indium oxide (In2O3) and indium tin oxide (ITO) carried out using our original tight-binding quantum chemical calculation program “Colors”, which is over 5,000 times faster than the conventional first-principles quantum chemical calculation method. The calculated band gap of In2O3 is in good agreement with the experimental results, although the value obtained by conventional first-principles calculation is less than half the experimental one. The electronic structures of In2O3 calculated by our tight-binding method are consistent with those obtained by first-principles calculations. Furthermore, the doping of tin atoms into In2O3 increased the band gap, which is also in good agreement with the experimental tendency. Hence, we confirmed that our tight-binding quantum chemical calculation method was very effective for investigation and predicting the electronic structures of In2O3 and ITO crystals with high accuracy and reliability in spite of its high calculation speed.
- 1 April 2005
- Published by IOP Publishing in Japanese Journal of Applied Physics
- Vol. 44 (4S) , 2806
Tight-Binding Quantum Chemical Calculations of Electronic Structures of Indium Tin Oxide
We report a theoretical study on the electronic structures of indium oxide (In2O3) and indium tin oxide (ITO) carried out using our original tight-binding quantum chemical calculation program “Colors”, which is over 5,000 times faster than the conventional first-principles quantum chemical calculation method. The calculated band gap of In2O3 is in good agreement with the experimental results, although the value obtained by conventional first-principles calculation is less than half the experimental one. The electronic structures of In2O3 calculated by our tight-binding method are consistent with those obtained by first-principles calculations. Furthermore, the doping of tin atoms into In2O3 increased the band gap, which is also in good agreement with the experimental tendency. Hence, we confirmed that our tight-binding quantum chemical calculation method was very effective for investigation and predicting the electronic structures of In2O3 and ITO crystals with high accuracy and reliability in spite of its high calculation speed.