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

Jiafeng Chen

dblp:256/4610 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
2since 2021 · last 2024
—ORCID · conflict

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

Computer networks · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1

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 graphics and multimedia
1 paper
Image and video coding · 100%
Computer networks
1 paper
Transport protocols and congestion control · 100%
Theoretical computer science
1 paper
Computational geometry · 100%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control
multipath transport
0.812024
AUGUR: Practical Mobile Multipath Transport Service for Low Tail Latency in Real-Time Streaming · NSDI 2024
Transport protocols and congestion control › real-time communication
real-time streaming
0.812024
AUGUR: Practical Mobile Multipath Transport Service for Low Tail Latency in Real-Time Streaming · NSDI 2024
Image and video coding › point cloud compression
attribute compression
0.612022
Hilbert Space Filling Curve Based Scan-Order for Point Cloud Attribute Compression · IEEE Trans. Image Process. 2022
Image and video coding
point cloud compression
0.612022
Hilbert Space Filling Curve Based Scan-Order for Point Cloud Attribute Compression · IEEE Trans. Image Process. 2022
Computational geometry › fractal geometry
space-filling curves
0.212022
Hilbert Space Filling Curve Based Scan-Order for Point Cloud Attribute Compression · IEEE Trans. Image Process. 2022

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

hilbert curve · 1.1multipath transport · 0.8space-filling curves · 0.6space filling curve · 0.6
YearPublicationVenuePosition
2024 AUGUR: Practical Mobile Multipath Transport Service for Low Tail Latency in Real-Time Streaming
Tingfeng Wang, Liying Wang 0011, Nian Wen, Jing Wang 0077, Chenglei Wu, Jiafeng Chen, Longwei Jiang, Shibo Wang 0002, Chenren Xu
NSDI8
2022 Hilbert Space Filling Curve Based Scan-Order for Point Cloud Attribute Compression
abstract
Point cloud is a set of three-dimensional points in arbitrary order, which is a popular representation of 3D scene in autonomous navigation and immersive applications in recent years. Compression becomes an inevitable issue due to the huge data volume of point cloud. In order to effectively compress attributes of those points, proper reordering is important. The existing voxel-based point cloud attributes compression scheme uses a naive scan for points reordering. In this paper, we theoretically analyzed 3C properties of point cloud, i.e., Compactness, Clustering and Correlation, of different scan-orders defined by different space filling curves and disclosed that the Hilbert curve can provide the best spatial correlation preservation compared with Z-order and Gray-coded curves. It is also statistically verified that the Hilbert curve always has the best ability of attributes correlation preservation for point clouds with different sparsity. We also proposed a fast and iterative Hilbert address code generation method to implement points reordering. The Hilbert scan-order could be combined with various point cloud attribute coding methods. Experiments show that the correlation preservation feature of the proposed scan-order can bring us 6.1% and 6.5% coding gain for prediction and transform coding, respectively.
Jiafeng Chen, Lu Yu 0003
IEEE Trans. Image Process.1
2020 Tripfly: Predicting Gene-gene Interaction of Drosophila Eye Development Using Triplet Loss
abstract
The reconstruction of gene regulatory network (GRN) is of significance in system biology. In recent years, benefiting from the advances of deep learning technologies, image-based gene expression data, which contains spatial expression patterns, has become a new resource in network inference. Most of the existing image-based GRN inference models are based on unsupervised models, due to the lack of labeled data. And a few methods employ supervised learning models, whose performance is limited by the scale of training data.In this study, in order to predict the gene regulatory network of the eye development of Drosophila embryos, we develop a weakly supervised learning method. We generate image triplets of genes according to their orientation and developing stage. Then we build a deep convolutional neural network, using triplet loss to train a siamese network and extract the relationship between genes. The new method achieves promising results in the prediction of gene regulatory relationship in the eye development of Drosophila with a total accuracy of over 72%.
Zhenhuan Liu, Jiafeng Chen, Yang Yang 0030
BIBM2