Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Xinyun Hou

dblp:374/6215 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Efficient and distributed learning · 100%
Computer graphics and multimedia
1 paper
Audio and music processing · 56% Geometric modeling and processing · 44%
Network and information security
1 paper
Privacy and data protection · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Audio and music processing › room acoustics
acoustic transfer
0.912025
NAT: Neural Acoustic Transfer for Interactive Scenes in Real Time · IEEE Trans. Vis. Comput. Graph. 2025
Geometric modeling and processing
implicit neural representation
0.912025
NAT: Neural Acoustic Transfer for Interactive Scenes in Real Time · IEEE Trans. Vis. Comput. Graph. 2025
Machine learning › Efficient and distributed learning › federated learning
communication-efficient federated learning
0.812024
Secure and Efficient Federated Learning With Provable Performance Guarantees via Stochastic Quantization · IEEE Trans. Inf. Forensics Secur. 2024
Machine learning › Efficient and distributed learning
federated learning
0.812024
Secure and Efficient Federated Learning With Provable Performance Guarantees via Stochastic Quantization · IEEE Trans. Inf. Forensics Secur. 2024
Machine learning › Efficient and distributed learning › federated learning
federated learning security
0.812024
Secure and Efficient Federated Learning With Provable Performance Guarantees via Stochastic Quantization · IEEE Trans. Inf. Forensics Secur. 2024
Audio and music processing
interactive audio
0.312025
NAT: Neural Acoustic Transfer for Interactive Scenes in Real Time · IEEE Trans. Vis. Comput. Graph. 2025

Methods — techniques the papers use, named apart from their topics

stochastic quantization · 1.5homomorphic encryption comparison · 1.5differential privacy comparison · 1.5monte-carlo boundary element method · 0.9implicit neural representation · 0.9
YearPublicationVenuePosition
2025 NAT: Neural Acoustic Transfer for Interactive Scenes in Real Time
abstract
Previous acoustic transfer methods rely on extensive precomputation and storage of data to enable real-time interaction and auditory feedback. However, these methods struggle with complex scenes, especially when dynamic changes in object position, material, and size significantly alter sound effects. These continuous variations lead to fluctuating acoustic transfer distributions, making it challenging to represent with basic data structures and render efficiently in real time. To address this challenge, we present Neural Acoustic Transfer, a novel approach that leverages implicit neural representations to encode acoustic transfer functions and their variations. This enables real-time prediction of dynamically evolving sound fields and their interactions with the environment under varying conditions. To efficiently generate high-quality training data for the neural acoustic field while avoiding reliance on mesh quality of a model, we develop a fast and efficient Monte-Carlo-based boundary element method (BEM) approximation, suitable for general scenarios with smooth Neumann boundary conditions. In addition, we devise strategies to mitigate potential singularities during the synthesis of training data, thereby enhancing its reliability. Together, these methods provide robust and accurate data that empower the neural network to effectively model complex sound radiation space. We demonstrate our method's numerical accuracy and runtime efficiency (within several milliseconds for 30 s audio) through comprehensive validation and comparisons in diverse acoustic transfer scenarios. Our approach allows for efficient and accurate modeling of sound behavior in dynamically changing environments, which can benefit a wide range of interactive applications such as virtual reality, augmented reality, and advanced audio production.
Xutong Jin, Xinyun Hou, Sheng Li 0008
IEEE Trans. Vis. Comput. Graph.4
2024 Secure and Efficient Federated Learning With Provable Performance Guarantees via Stochastic Quantization
abstract
Federated learning is a popular distributed machine learning paradigm that enables collaborative model training at multiple entities via exchanging intermediate learning results. Security and communication efficiency are crucial for successful applications of federated learning in various privacy-sensitive services. However, existing work focused on gradient defense and communication efficiency separately, and also incurred additional computation, signaling, and accuracy overhead. A lightweight (in terms of time-complexity and signaling) technique that simultaneously achieves security and communication efficiency is critical for massive resource-constrained devices (e.g., Internet-of-Things generating the data), but has yet to be established. This paper proposes a secure and efficient federated learning framework with provable communication-accuracy-security performance guarantees. A low-complexity and signaling-free stochastic quantization module is added at the client side that quantizes the original local gradients to discrete values for communication-efficient global aggregation. The stochastic quantization module is shown to be interpreted as triangular or Gaussian-multiply-triangular noises under uniform or Gaussian distributions of local gradients, hence protecting data privacy. We prove that the proposed framework exhibits an {O(log21/δ),O(δ2),O(1/δ)}-tradeoff between the communication overhead, model accuracy, and data protection, where δ is an adjustable quantization interval. Experimental results validate the tradeoff and the superiority of the proposed stochastic quantization technique in terms of communication efficiency (only 14.1% of differential privacy and 0.2% of homomorphic encryption) and computation complexity (similar to differential privacy and only 0.03% of homomorphic encryption). Under the same data protection performance, the proposed approach also outperforms (in terms of accuracy) differential privacy in all the 9 comparison settings on CIFAR10 dataset.
Xinchen Lyu, Xinyun Hou, Chenshan Ren, Penglin Yang, Qimei Cui, Xiaofeng Tao 0001
IEEE Trans. Inf. Forensics Secur.2