Jiayao Hu

dblp:53/8692 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
4since 2021 · last 2026
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 2 first-author · 3 since 2021Systems, architecture and hardware · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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.

Computer networks
1 paper
Datacenter networks · 50% Software-defined and programmable networks · 50%
Computer graphics and multimedia
1 paper
Visual content generation and editing · 100%

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

TopicWeightPapersLastEvidence papers
Datacenter networks
load balancing
0.512021
Hashing Linearity Enables Relative Path Control in Data Centers · USENIX ATC 2021
Software-defined and programmable networks
path control
0.512021
Hashing Linearity Enables Relative Path Control in Data Centers · USENIX ATC 2021
Visual content generation and editing
image generation
0.112010
Fast image rearrangement via multi-scale patch copying · ACM Multimedia 2010
Visual content generation and editing › example-based synthesis
patch-based synthesis
0.112010
Fast image rearrangement via multi-scale patch copying · ACM Multimedia 2010

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

multi-scale patch copying · 0.1markov random field · 0.1belief propagation · 0.1
YearPublicationVenuePosition
2026 A novel rotating machinery fault diagnosis method based on multi-channel correlation strategy image information enhancement
Jiayao Hu, Wennian Yu, Zixu Chen, Quanyi Luo, Xiaoxi Ding
Eng. Appl. Artif. Intell.1
2026 MIEI-DPMIAN: fault diagnosis for urban rail transit gearboxes based on torsional vibration signal image enhancement and attention network
Jiayao Hu, Wennian Yu, Xiaoxi Ding, Wenbin Huang 0002
Expert Syst. Appl.1
2024 Dual-source gramian angular field method and its application on fault diagnosis of drilling pump fluid end
Gang Li 0045, Jiaxing Ao, Jiayao Hu, Dalong Hu
Expert Syst. Appl.3
2021 Hashing Linearity Enables Relative Path Control in Data Centers
Zhehui Zhang, Haiyang Zheng, Jiayao Hu, Chenchen Qi, Xuemei Shi
USENIX ATC3
2012 Nonparametric decentralized detection based on weighted count kernel
abstract
The nonparametric decentralized detection problem is investigated, in which the joint distribution of the environmental event and the sensors' observations are not known and only a set of training samples are available. The system features rate constraints, i.e., integer bit constraints on sensors' transmissions, different qualities of observations, additional observations to the fusion center, and multi-level tree-structured network. Our study adopts the kernel-based nonparametric approach proposed by Nguyen, Wainwright, and Jordan with the following generalization. A weighted count kernel is introduced so that the corresponding reproducing kernel Hilbert space (RKHS) (over which the fusion center's decision rule is optimized) allows the fusion center's decision rule to count information from sensors and its own observations differently. In order to find the optimal decision rules, our optimization is solved by alternatively and recursively conducting three optimization steps: finding the optimal weight parameters in the weighted count kernel for selecting the best associated RKHS, finding the best optimal decision rule for the fusion center over the identified RKHS, and finding the local decision rules for sensors. Generalization to multilevel tree-structured networks is also discussed. Finally numerical results are provided to demonstrate the performance based on the proposed weighted count kernel.
Jiayao Hu, Yingbin Liang, Eric P. Xing
ISIT1
2010 Fast image rearrangement via multi-scale patch copying
abstract
In this paper, we propose a simple interactive way for a novel type of image synthesis called image rearrangement whose goal is to construct a new image based on some objects cropped from source images. The synthesis results are obtained by copying patches from the source images in a globally consistent way. The patch copying problem is formulated with the Markov random field model, and belief propagation is used as the optimization tool. To speed up our algorithm, a two-step belief propagation and a multi-scale patch copying scheme are taken. Experimental results indicate that our algorithm obtains satisfactory results in both performance and efficiency.
Jiayao Hu, Shifeng Chen, Jianzhuang Liu, Xiaoou Tang
ACM Multimedia1