Xin Lou
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xin Lou has a total of 124 co-authors. Here are the top co-authors by number of shared publications:
- Jingyi Yu
ShanghaiTech University, Shanghai, China
12 shared publications - Pingqiang Zhou
ShanghaiTech University, Shanghai, China
7 shared publications - Weihang Liu
School of Information Science and Technology, ShanghaiTech University, Shanghai, China
7 shared publications - Wenbin Ye
Shenzhen University
7 shared publications - Chaolin Rao
School of Information Science and Technology, ShanghaiTech University, Shanghai, China
5 shared publications - Wei Zhou
Electric Power Research Institute of Yunnan Power Grid Company Ltd., China Southern Power Grid, Yunnan, Kunming, China
5 shared publications
Latest Publications
- 10 August 2026
- Published by Elsevier in Neurocomputing
- Vol. 703
Data driven computer vision oriented image signal processing pipeline configuration
- 10 August 2026
- Published by Elsevier in Neurocomputing
- Vol. 703
Data driven computer vision oriented image signal processing pipeline configuration
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
SHARP-GS: Scalable High-fidelity Accelerated Rendering Pipeline for Ultra-high Resolution 3D Gaussian Splatting
We present SHARP-GS, a high-performance framework that unlocks real-time 8K rendering for immersive virtual experiences by overcoming the scaling bottlenecks of 3D Gaussian Splatting (3DGS). While 3DGS excels at real-time view synthesis, its performance degrades non-linearly at ultra-high resolutions due to excessive binning overhead, uncoalesced memory access, and redundant per-pixel arithmetic. SHARP-GS addresses these inefficiencies through three key contributions: (i) Resolution-Aware Adaptive Binning, which maintains a constant overlap factor via dynamic tile sizing and employs fine-grained sub-tile culling; (ii) a Morton-Ordered Memory Layout to ensure spatially coherent memory access; and (iii) Forward Differencing, which replaces expensive probability density function evaluations with efficient incremental updates. On high-end consumer GPUs, our framework achieves an average 2.55× speedup at 8K resolution, sustaining over 250 FPS with negligible visual quality loss. This performance delivers the necessary pixel throughput to enable high-fidelity, 120 Hz stereoscopic VR experiences. Code and data for this paper are at https://github.com/dingjr7/SHARP-GS.
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessSHARP-GS: Scalable High-fidelity Accelerated Rendering Pipeline for Ultra-high Resolution 3D Gaussian Splatting
We present SHARP-GS, a high-performance framework that unlocks real-time 8K rendering for immersive virtual experiences by overcoming the scaling bottlenecks of 3D Gaussian Splatting (3DGS). While 3DGS excels at real-time view synthesis, its performance degrades non-linearly at ultra-high resolutions due to excessive binning overhead, uncoalesced memory access, and redundant per-pixel arithmetic. SHARP-GS addresses these inefficiencies through three key contributions: (i) Resolution-Aware Adaptive Binning, which maintains a constant overlap factor via dynamic tile sizing and employs fine-grained sub-tile culling; (ii) a Morton-Ordered Memory Layout to ensure spatially coherent memory access; and (iii) Forward Differencing, which replaces expensive probability density function evaluations with efficient incremental updates. On high-end consumer GPUs, our framework achieves an average 2.55× speedup at 8K resolution, sustaining over 250 FPS with negligible visual quality loss. This performance delivers the necessary pixel throughput to enable high-fidelity, 120 Hz stereoscopic VR experiences. Code and data for this paper are at https://github.com/dingjr7/SHARP-GS.
- 9 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. PP (15498328) , 1-14
A Frequency-Domain Vision Accelerator for High-Resolution Object Detection on RAW Data
While high-resolution inputs improve recognition performance, they impose significant hardware overhead due to the computational intensity and memory bandwidth demands of conventional image signal processing (ISP). This inefficiency primarily stems from the structural mismatch between pixel-level ISP operations and the semantic information required by back-end neural networks. To address this, we propose an end-to-end RAW-based frequency-domain vision pipeline designed for efficient high-resolution detection. Under normal imaging conditions, the proposed pipeline bypasses the full human-perception-oriented ISP and directly processes RAW sensor data through lightweight channel mapping and a hardware-friendly approximate discrete cosine transform (DCT). To minimize front-end data movement, we reformulate the color-space transformation within the frequency domain and retain only a compact set of task-relevant low-frequency coefficients. Furthermore, we employ a multiplier-less, shift-and-add-based arithmetic architecture to simplify control logic and enhance energy efficiency. The pipeline is fully compatible with standard convolutional neural networks, requiring no architectural changes to the back-end detector. We validated the design using a Field-Programmable Gate Array (FPGA)-based prototype on the Xilinx ZCU102 platform integrated with a YOLOv3-Tiny detector. The system achieves real-time processing of $6144\times 4096$ RAW inputs at 33.18 frames per second (FPS). Experimental results demonstrate that the proposed frequency-domain approach maintains detection accuracy comparable to RGB-based pipelines while significantly reducing hardware resource utilization and power consumption.
- 9 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. PP (15498328) , 1-14
A Frequency-Domain Vision Accelerator for High-Resolution Object Detection on RAW Data
While high-resolution inputs improve recognition performance, they impose significant hardware overhead due to the computational intensity and memory bandwidth demands of conventional image signal processing (ISP). This inefficiency primarily stems from the structural mismatch between pixel-level ISP operations and the semantic information required by back-end neural networks. To address this, we propose an end-to-end RAW-based frequency-domain vision pipeline designed for efficient high-resolution detection. Under normal imaging conditions, the proposed pipeline bypasses the full human-perception-oriented ISP and directly processes RAW sensor data through lightweight channel mapping and a hardware-friendly approximate discrete cosine transform (DCT). To minimize front-end data movement, we reformulate the color-space transformation within the frequency domain and retain only a compact set of task-relevant low-frequency coefficients. Furthermore, we employ a multiplier-less, shift-and-add-based arithmetic architecture to simplify control logic and enhance energy efficiency. The pipeline is fully compatible with standard convolutional neural networks, requiring no architectural changes to the back-end detector. We validated the design using a Field-Programmable Gate Array (FPGA)-based prototype on the Xilinx ZCU102 platform integrated with a YOLOv3-Tiny detector. The system achieves real-time processing of $6144\times 4096$ RAW inputs at 33.18 frames per second (FPS). Experimental results demonstrate that the proposed frequency-domain approach maintains detection accuracy comparable to RGB-based pipelines while significantly reducing hardware resource utilization and power consumption.
- Open Access
- 9 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Signal Processing
- Vol. 7, 717-729
GAN-Based Bayer Pattern Image Synthesis for Raw Domain Computer Vision Tasks
In this paper, we introduce a novel approach for converting established color image datasets into their RAW counterparts using generative adversarial networks (GANs), aiming to tackle the challenge of obtaining RAW training data for RAW domain computer vision tasks, such as computer vision-oriented ISP pipeline design, RAW domain denoise, etc. We provide theoretical analysis to demonstrate how leveraging transformed data during GAN training can bolster the model's capacity to learn the underlying distribution of the original data. The RAW Bayer pattern images can therefore be generated by configuring the transformations in the ISP pipeline into the GAN's training process. Evaluation results show that RAW images generated by our method outperform the existing methods in the downstream computer vision tasks, and the training process of the proposed method is more stable. Our experiments show that the characteristics of the synthesized images are similar to those of the real images. By training denoising and object detection frameworks using the synthesized RAW Bayer images, we showcase that they can be used in end-to-end vision system (from RAW images to vision tasks with ISP in the loop) with negligible performance degradation.
- 9 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Signal Processing
- Vol. 7, 717-729
Open AccessGAN-Based Bayer Pattern Image Synthesis for Raw Domain Computer Vision Tasks
In this paper, we introduce a novel approach for converting established color image datasets into their RAW counterparts using generative adversarial networks (GANs), aiming to tackle the challenge of obtaining RAW training data for RAW domain computer vision tasks, such as computer vision-oriented ISP pipeline design, RAW domain denoise, etc. We provide theoretical analysis to demonstrate how leveraging transformed data during GAN training can bolster the model's capacity to learn the underlying distribution of the original data. The RAW Bayer pattern images can therefore be generated by configuring the transformations in the ISP pipeline into the GAN's training process. Evaluation results show that RAW images generated by our method outperform the existing methods in the downstream computer vision tasks, and the training process of the proposed method is more stable. Our experiments show that the characteristics of the synthesized images are similar to those of the real images. By training denoising and object detection frameworks using the synthesized RAW Bayer images, we showcase that they can be used in end-to-end vision system (from RAW images to vision tasks with ISP in the loop) with negligible performance degradation.
- 23 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 36 (7) , 9418-9431
Duplex-GS: Proxy-Guided Weighted Blending for Real-Time Order-Independent Gaussian Splatting
3D Gaussian Splatting (3DGS) achieves photorealistic rendering but requires global sorting for α-blending, causing noticeable “popping” artifacts and hindering deployment on edge devices. While sort-free Order-Independent Transparency (OIT) methods circumvent sorting, they introduce “transparency” artifacts and suffer from inefficiency due to the absence of physical constraints. To address these limitations, we present Duplex-GS, a dual-hierarchy framework leveraging proxy-guided spatial organization and a novel hybrid renderer that combines α-blending with reformulated Weighted-Sum Rendering (WSR). We introduce explicit ellipsoidal cell proxies to encapsulate local Gaussians, which enables efficient proxy-level rasterization. This strategy drastically reduces the overhead associated with global sorting. Furthermore, we propose a physically grounded WSR scheme with cell-level early termination, which restores the physical constraints absent in prior OIT-based 3DGS methods, effectively eliminating both popping and transparency artifacts. Extensive experiments on diverse real-world benchmarks demonstrate the effectiveness of the OIT-based paradigm for 3DGS, enabled by a practical dual-hierarchy implementation. Quantitatively, our method delivers high-fidelity real-time rendering, outperforming prior OIT-based 3DGS methods by 1.5×– 4× in speed, while reducing radix-sort cost by 29.8%– 86.9% compared with conventional α-blending without compromising visual quality. Project page: https://duplexgs.github.io/.
- 23 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 36 (7) , 9418-9431
Duplex-GS: Proxy-Guided Weighted Blending for Real-Time Order-Independent Gaussian Splatting
3D Gaussian Splatting (3DGS) achieves photorealistic rendering but requires global sorting for α-blending, causing noticeable “popping” artifacts and hindering deployment on edge devices. While sort-free Order-Independent Transparency (OIT) methods circumvent sorting, they introduce “transparency” artifacts and suffer from inefficiency due to the absence of physical constraints. To address these limitations, we present Duplex-GS, a dual-hierarchy framework leveraging proxy-guided spatial organization and a novel hybrid renderer that combines α-blending with reformulated Weighted-Sum Rendering (WSR). We introduce explicit ellipsoidal cell proxies to encapsulate local Gaussians, which enables efficient proxy-level rasterization. This strategy drastically reduces the overhead associated with global sorting. Furthermore, we propose a physically grounded WSR scheme with cell-level early termination, which restores the physical constraints absent in prior OIT-based 3DGS methods, effectively eliminating both popping and transparency artifacts. Extensive experiments on diverse real-world benchmarks demonstrate the effectiveness of the OIT-based paradigm for 3DGS, enabled by a practical dual-hierarchy implementation. Quantitatively, our method delivers high-fidelity real-time rendering, outperforming prior OIT-based 3DGS methods by 1.5×– 4× in speed, while reducing radix-sort cost by 29.8%– 86.9% compared with conventional α-blending without compromising visual quality. Project page: https://duplexgs.github.io/.
- Top Cited Papers
- 16 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74 (1053587X) , 1047-1063
Quantitative Error Feedback for Quantization Noise Reduction of Filtering Over Graphs
This paper introduces an innovative error feedback framework designed to mitigate quantization noise in distributed graph filtering, where communications are constrained to quantized messages. It comes from error spectrum shaping techniques from state-space digital filters, and therefore establishes connections between quantized filtering processes over different domains. In contrast to existing error compensation methods, our framework quantitatively feeds back the quantization noise for exact compensation. We examine the framework under three key scenarios: (i) deterministic graph filtering, (ii) graph filtering over random graphs, and (iii) graph filtering with random node-asynchronous updates. Rigorous theoretical analysis demonstrates that the proposed framework significantly reduces the effect of quantization noise, and we provide closed-form solutions for the optimal error feedback coefficients. Moreover, this quantitative error feedback mechanism can be seamlessly integrated into communication-efficient decentralized optimization frameworks, enabling lower error floors. Numerical experiments validate the theoretical results, consistently showing that our method outperforms conventional quantization strategies in terms of both accuracy and robustness.
- 16 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74 (1053587X) , 1047-1063
Top Cited PapersQuantitative Error Feedback for Quantization Noise Reduction of Filtering Over Graphs
This paper introduces an innovative error feedback framework designed to mitigate quantization noise in distributed graph filtering, where communications are constrained to quantized messages. It comes from error spectrum shaping techniques from state-space digital filters, and therefore establishes connections between quantized filtering processes over different domains. In contrast to existing error compensation methods, our framework quantitatively feeds back the quantization noise for exact compensation. We examine the framework under three key scenarios: (i) deterministic graph filtering, (ii) graph filtering over random graphs, and (iii) graph filtering with random node-asynchronous updates. Rigorous theoretical analysis demonstrates that the proposed framework significantly reduces the effect of quantization noise, and we provide closed-form solutions for the optimal error feedback coefficients. Moreover, this quantitative error feedback mechanism can be seamlessly integrated into communication-efficient decentralized optimization frameworks, enabling lower error floors. Numerical experiments validate the theoretical results, consistently showing that our method outperforms conventional quantization strategies in terms of both accuracy and robustness.
- Open Access
ICA: Information-Aware Credit Assignment for Visually Grounded Long-Horizon Information-Seeking Agents
Despite the strong performance achieved by reinforcement learning-trained information-seeking agents, learning in open-ended web environments remains severely constrained by low signal-to-noise feedback. Text-based parsers often discard layout semantics and introduce unstructured noise, while long-horizon training typically relies on sparse outcome rewards that obscure which retrieval actions actually matter. We propose a visual-native search framework that represents webpages as visual snapshots, allowing agents to leverage layout cues to quickly localize salient evidence and suppress distractors. To learn effectively from these high-dimensional observations, we introduce Information-Aware Credit Assignment (ICA), a post-hoc method that estimates each retrieved snapshot's contribution to the final outcome via posterior analysis and propagates dense learning signals back to key search turns. Integrated with a GRPO-based training pipeline, our approach consistently outperforms text-based baselines on diverse information-seeking benchmarks, providing evidence that visual snapshot grounding with information-level credit assignment alleviates the credit-assignment bottleneck in open-ended web environments. The code and datasets will be released in https://github.com/pc-inno/ICA_MM_deepsearch.git.
Open AccessICA: Information-Aware Credit Assignment for Visually Grounded Long-Horizon Information-Seeking Agents
Despite the strong performance achieved by reinforcement learning-trained information-seeking agents, learning in open-ended web environments remains severely constrained by low signal-to-noise feedback. Text-based parsers often discard layout semantics and introduce unstructured noise, while long-horizon training typically relies on sparse outcome rewards that obscure which retrieval actions actually matter. We propose a visual-native search framework that represents webpages as visual snapshots, allowing agents to leverage layout cues to quickly localize salient evidence and suppress distractors. To learn effectively from these high-dimensional observations, we introduce Information-Aware Credit Assignment (ICA), a post-hoc method that estimates each retrieved snapshot's contribution to the final outcome via posterior analysis and propagates dense learning signals back to key search turns. Integrated with a GRPO-based training pipeline, our approach consistently outperforms text-based baselines on diverse information-seeking benchmarks, providing evidence that visual snapshot grounding with information-level credit assignment alleviates the credit-assignment bottleneck in open-ended web environments. The code and datasets will be released in https://github.com/pc-inno/ICA_MM_deepsearch.git.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 23, 4013005
SAR-ERA: An Efficient Rendering Architecture for Real-Time Synthetic Aperture Radar Synthesis
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Geoscience and Remote Sensing Letters
- Vol. 23, 4013005
SAR-ERA: An Efficient Rendering Architecture for Real-Time Synthetic Aperture Radar Synthesis