Yuchi Huo
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
Yuchi Huo has a total of 142 co-authors. Here are the top co-authors by number of shared publications:
- Rui Wang
State Key Laboratory of CAD&CG, Zhejiang University
26 shared publications - Hujun Bao
State Key Lab of CAD&CG Zhejiang University
16 shared publications - Qi Ye
College of Control Science and Engineering, Zhejiang University, Hangzhou, China
9 shared publications - Chuankun Zheng
State Key Laboratory of CAD&CG, Zhejiang University, Hangzhou, China
6 shared publications - Jiming Chen
Zhejiang University, Hangzhou, China
6 shared publications - Sung-Eui Yoon
KAIST
6 shared publications
Latest Publications
- Open Access
- 9 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 46  (2) , 1-17
A Neural Frame Streaming Framework with a Simultaneous Prior for End-cloud Collaborative Rendering
Cloud rendering has gained much attention recently since it alleviates the client’s computing cost by distributing most of the rendering tasks on the cloud, and the rendered frames are compressed and streamed to a client device for display. However, the accessibility of cloud rendering is still limited by the network communication cost to stream high-resolution frames. By introducing neural networks into the video compression algorithms, SOTA methods have achieved a better compression ratio than existing video codecs like H.265. However, none of them are designed specifically for rendered content, in which features like motion vectors, albedo, and normal are readily available in nowadays rendering pipelines. We propose a new end-cloud collaborative rendering and streaming framework that generates these auxiliary features on both the end and cloud sides as a simultaneous prior, and utilizes this prior to guide both the encoding and decoding of frame compression. Our framework can empower low-end devices with high-end visual effects and reduce the cost of establishing high-speed network connections. Results show that our streaming pipeline is highly efficient and achieves higher compression ratio compared with standard video codecs and other neural compression methods.
- 9 October 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 46  (2) , 1-17
Open AccessA Neural Frame Streaming Framework with a Simultaneous Prior for End-cloud Collaborative Rendering
Cloud rendering has gained much attention recently since it alleviates the client’s computing cost by distributing most of the rendering tasks on the cloud, and the rendered frames are compressed and streamed to a client device for display. However, the accessibility of cloud rendering is still limited by the network communication cost to stream high-resolution frames. By introducing neural networks into the video compression algorithms, SOTA methods have achieved a better compression ratio than existing video codecs like H.265. However, none of them are designed specifically for rendered content, in which features like motion vectors, albedo, and normal are readily available in nowadays rendering pipelines. We propose a new end-cloud collaborative rendering and streaming framework that generates these auxiliary features on both the end and cloud sides as a simultaneous prior, and utilizes this prior to guide both the encoding and decoding of frame compression. Our framework can empower low-end devices with high-end visual effects and reduce the cost of establishing high-speed network connections. Results show that our streaming pipeline is highly efficient and achieves higher compression ratio compared with standard video codecs and other neural compression methods.
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-10
DPF: Differentiable Polyphase Filtering for Large-Kernel Approximation
Large-kernel filtering is a fundamental operation in image post-processing and video effects. While decomposing large kernels into multiple sparse ones is a proven strategy for acceleration on parallel architectures, existing optimization-based approximation methods are constrained to fixed-resolution processing. In this paper, we propose a novel framework based on Polyphase Filtering, which enables the differentiable optimization of sparse kernels across varying resolutions. This approach achieves the fastest approximation to date for large kernels and remains highly effective even for spatially-variant dense kernels. To further enhance efficiency, we introduce Spatial-to-Depth Transformation and Asymmetric Intensity-Decoupled Transformation. Furthermore, to address scenarios with spatially varying kernel sizes, we employ a Layer-Adaptive Filtering strategy that integrates kernels from multiple levels for rapid filtering. Extensive experiments demonstrate that our method significantly outperforms existing state-of-the-art techniques in both computational performance and visual quality.
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Open AccessDPF: Differentiable Polyphase Filtering for Large-Kernel Approximation
Large-kernel filtering is a fundamental operation in image post-processing and video effects. While decomposing large kernels into multiple sparse ones is a proven strategy for acceleration on parallel architectures, existing optimization-based approximation methods are constrained to fixed-resolution processing. In this paper, we propose a novel framework based on Polyphase Filtering, which enables the differentiable optimization of sparse kernels across varying resolutions. This approach achieves the fastest approximation to date for large kernels and remains highly effective even for spatially-variant dense kernels. To further enhance efficiency, we introduce Spatial-to-Depth Transformation and Asymmetric Intensity-Decoupled Transformation. Furthermore, to address scenarios with spatially varying kernel sizes, we employ a Layer-Adaptive Filtering strategy that integrates kernels from multiple levels for rapid filtering. Extensive experiments demonstrate that our method significantly outperforms existing state-of-the-art techniques in both computational performance and visual quality.
- Open Access
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Fuse3D: Generating 3D Assets Controlled by Multi-Image Fusion
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Open AccessFuse3D: Generating 3D Assets Controlled by Multi-Image Fusion
- Open Access
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-11
NeLiF: Neural Lighting Function Generation for Real-Time Indoor Rendering
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessNeLiF: Neural Lighting Function Generation for Real-Time Indoor Rendering
- Open Access
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-12
AniTex: Light-Geometry Consistent PBR Material Generation for Animatable Objects
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Open AccessAniTex: Light-Geometry Consistent PBR Material Generation for Animatable Objects
- Open Access
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-11
StereoFG: Generating Stereo Frames from Centered Feature Stream
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessStereoFG: Generating Stereo Frames from Centered Feature Stream
- Open Access
- 4 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44  (6) , 1-15
Consecutive Frame Extrapolation with Predictive Sparse Shading
The demand for high-frame-rate rendering keeps increasing in modern displays. Existing frame generation and super-resolution techniques accelerate rendering by reducing rendering samples across space or time. However, they rely on a uniform sampling reduction strategy, which undersamples areas with complex details or dynamic shading. To address this, we propose to sparsely shade critical areas while reusing generated pixels in low-variation areas for neural extrapolation. Specifically, we introduce the Predictive Error-Flow-eXtrapolation Network (EFXNet)-an architecture that predicts extrapolation errors, estimates flows, and extrapolates frames at once. Firstly, EFXNet leverages temporal coherence to predict extrapolation error and guide the sparse shading of dynamic areas. In addition, EFXNet employs a target-grid correlation module to estimate robust optical flows from pixel correlations rather than pixel values. Finally, EFXNet uses dedicated motion representations for the historical geometric and lighting components, respectively, to extrapolate temporally stable frames. Extensive experimental results show that, compared with state-of-the-art methods, our frame extrapolation method exhibits superior visual quality and temporal stability under a low rendering budget.
- 4 December 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44  (6) , 1-15
Open AccessConsecutive Frame Extrapolation with Predictive Sparse Shading
The demand for high-frame-rate rendering keeps increasing in modern displays. Existing frame generation and super-resolution techniques accelerate rendering by reducing rendering samples across space or time. However, they rely on a uniform sampling reduction strategy, which undersamples areas with complex details or dynamic shading. To address this, we propose to sparsely shade critical areas while reusing generated pixels in low-variation areas for neural extrapolation. Specifically, we introduce the Predictive Error-Flow-eXtrapolation Network (EFXNet)-an architecture that predicts extrapolation errors, estimates flows, and extrapolates frames at once. Firstly, EFXNet leverages temporal coherence to predict extrapolation error and guide the sparse shading of dynamic areas. In addition, EFXNet employs a target-grid correlation module to estimate robust optical flows from pixel correlations rather than pixel values. Finally, EFXNet uses dedicated motion representations for the historical geometric and lighting components, respectively, to extrapolate temporally stable frames. Extensive experimental results show that, compared with state-of-the-art methods, our frame extrapolation method exhibits superior visual quality and temporal stability under a low rendering budget.
- Open Access
Efficient Spatially-Variant Convolution via Differentiable Sparse Kernel Complex
Image convolution with complex kernels is a fundamental operation in photography, scientific imaging, and animation effects, yet direct dense convolution is computationally prohibitive on resource-limited devices. Existing approximations, such as simulated annealing or low-rank decompositions, either lack efficiency or fail to capture non-convex kernels. We introduce a differentiable kernel decomposition framework that represents a target spatially-variant, dense, complex kernel using a set of sparse kernel samples. Our approach features (i) a decomposition that enables differentiable optimization of sparse kernels, (ii) a dedicated initialization strategy for non-convex shapes to avoid poor local minima, and (iii) a kernel-space interpolation scheme that extends single-kernel filtering to spatially varying filtering without retraining and additional runtime overhead. Experiments on Gaussian and non-convex kernels show that our method achieves higher fidelity than simulated annealing and significantly lower cost than low-rank decompositions. Our approach provides a practical solution for mobile imaging and real-time rendering, while remaining fully differentiable for integration into broader learning pipelines.
Open AccessEfficient Spatially-Variant Convolution via Differentiable Sparse Kernel Complex
Image convolution with complex kernels is a fundamental operation in photography, scientific imaging, and animation effects, yet direct dense convolution is computationally prohibitive on resource-limited devices. Existing approximations, such as simulated annealing or low-rank decompositions, either lack efficiency or fail to capture non-convex kernels. We introduce a differentiable kernel decomposition framework that represents a target spatially-variant, dense, complex kernel using a set of sparse kernel samples. Our approach features (i) a decomposition that enables differentiable optimization of sparse kernels, (ii) a dedicated initialization strategy for non-convex shapes to avoid poor local minima, and (iii) a kernel-space interpolation scheme that extends single-kernel filtering to spatially varying filtering without retraining and additional runtime overhead. Experiments on Gaussian and non-convex kernels show that our method achieves higher fidelity than simulated annealing and significantly lower cost than low-rank decompositions. Our approach provides a practical solution for mobile imaging and real-time rendering, while remaining fully differentiable for integration into broader learning pipelines.
- 29 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 27  (15209210) , 9202-9213
AdaptiveFusion: Adaptive Multi-Modal Multi-View Fusion for 3D Human Body Reconstruction
Recent advancements in sensor technology and deep learning have led to significant progress in 3D human body reconstruction. However, most existing approaches rely on data from a specific sensor, which can be unreliable due to the inherent limitations of individual sensing modalities. Additionally, existing multi-modal fusion methods generally require customized designs based on the specific sensor combinations or setups, which limits the flexibility and generality of these methods. Furthermore, conventional point-image projection-based and Transformer-based fusion networks are susceptible to the influence of noisy modalities and sensor poses. To address these limitations and achieve robust 3D human body reconstruction in various conditions, we propose AdaptiveFusion, a generic adaptive multi-modal multi-view fusion framework that can effectively incorporate arbitrary combinations of uncalibrated sensor inputs. By treating different modalities from various viewpoints as equal tokens, and our handcrafted modality sampling module by leveraging the inherent flexibility of Transformer models, AdaptiveFusion is able to cope with arbitrary numbers of inputs and accommodate noisy modalities with only a single training network. Extensive experiments on large-scale human datasets demonstrate the effectiveness of AdaptiveFusion in achieving high-quality 3D human body reconstruction in various environments. In addition, our method achieves superior accuracy compared to state-of-the-art fusion methods.
- 29 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 27  (15209210) , 9202-9213
AdaptiveFusion: Adaptive Multi-Modal Multi-View Fusion for 3D Human Body Reconstruction
Recent advancements in sensor technology and deep learning have led to significant progress in 3D human body reconstruction. However, most existing approaches rely on data from a specific sensor, which can be unreliable due to the inherent limitations of individual sensing modalities. Additionally, existing multi-modal fusion methods generally require customized designs based on the specific sensor combinations or setups, which limits the flexibility and generality of these methods. Furthermore, conventional point-image projection-based and Transformer-based fusion networks are susceptible to the influence of noisy modalities and sensor poses. To address these limitations and achieve robust 3D human body reconstruction in various conditions, we propose AdaptiveFusion, a generic adaptive multi-modal multi-view fusion framework that can effectively incorporate arbitrary combinations of uncalibrated sensor inputs. By treating different modalities from various viewpoints as equal tokens, and our handcrafted modality sampling module by leveraging the inherent flexibility of Transformer models, AdaptiveFusion is able to cope with arbitrary numbers of inputs and accommodate noisy modalities with only a single training network. Extensive experiments on large-scale human datasets demonstrate the effectiveness of AdaptiveFusion in achieving high-quality 3D human body reconstruction in various environments. In addition, our method achieves superior accuracy compared to state-of-the-art fusion methods.