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

Hongwei Sha

dblp:142/7289 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0002-4085-0339ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 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.

Computer graphics and multimedia
1 paper
Image and video coding · 100%
Computer networks
1 paper
Vehicular, aerial and satellite networks · 100%

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

TopicWeightPapersLastEvidence papers
Image and video coding › error resilience
error-resilient image coding
0.912025
Towards Loss-Resilient Image Coding for Unstable Satellite Networks · AAAI 2025
Vehicular, aerial and satellite networks
satellite communication
0.312025
Towards Loss-Resilient Image Coding for Unstable Satellite Networks · AAAI 2025

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

gilbert-elliot model · 1.7end-to-end optimization · 1.7channel-wise progressive coding · 1.7
YearPublicationVenuePosition
2025 Towards Loss-Resilient Image Coding for Unstable Satellite Networks
abstract
Geostationary Earth Orbit (GEO) satellite communication demonstrates significant advantages in emergency short burst data services. However, unstable satellite networks, particularly those with frequent packet loss, present a severe challenge to accurate image transmission. To address it, we propose a loss-resilient image coding approach that leverages end-to-end optimization in learned image compression (LIC). Our method builds on the channel-wise progressive coding framework, incorporating Spatial-Channel Rearrangement (SCR) on the encoder side and Mask Conditional Aggregation (MCA) on the decoder side to improve reconstruction quality with unpredictable errors. By integrating the Gilbert-Elliot model into the training process, we enhance the model's ability to generalize in real-world network conditions. Extensive evaluations show that our approach outperforms traditional and deep learning-based methods in terms of compression performance and stability under diverse packet loss, offering robust and efficient progressive transmission even in challenging environments.
Hongwei Sha, Muchen Dong, Quanyou Luo, Ming Lu 0003, Hao Chen 0036, Zhan Ma 0001
AAAI1
2024 Lossless JPEG Recompression for Similar Images via Frequency Domain Block Matching
abstract
JPEG, a landmark lossy image compression standard, has been widely used over the past years, yet its simple design disadvantages the compression performance compared to other advanced algorithms currently available. This has led to the development of lossless JPEG recompression techniques to further exploit the frequency domain redundancy by reconstructing the binary streams without loss. However, existing work has not considered the lossless recompression problem of similar images, as it can utilize the mutual correlation between transformed coefficients to squeeze additional bits saving. As a result, this paper proposes a lossless recompression method for similar images through the block matching in frequency domain. Specifically, we fulfill the purpose by firstly applying the Controllable Similar Block Search (CSBS) to find the corresponding similar blocks in the transform domain. Built upon the similarity assessment, we deploy both the well-designed Optimal Motion Vector Coding (OMVC) and Variable-Length Residual Coding (VLRC) to improve the recompression efficiency. Experimental results demonstrate the superior performance of our method when compared to other popular JPEG recompression algorithms. To the best of our knowledge, this is the first lossless recompression work for similar images in the frequency domain.
Hongwei Sha, Ming Lu 0003, Zhan Ma 0001
PCS1