Demo Data from EDBT 2026 / reviewers in the wild / expert
Kuan-Chung Ting
dblp:313/1756
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 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 processing · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Image and video processing › image restoration › image deblurring
blind image deblurring |
0.9 | 1 | 2025 | Fast Blind Image Deblurring Based on Cross Partial Derivative · IEEE Trans. Image Process. 2025 |
Image and video processing › image restoration › image deblurring
blur kernel estimation |
0.9 | 1 | 2025 | Fast Blind Image Deblurring Based on Cross Partial Derivative · IEEE Trans. Image Process. 2025 |
Image and video processing › restoration
image and video restoration |
0.9 | 1 | 2025 | Fast Blind Image Deblurring Based on Cross Partial Derivative · IEEE Trans. Image Process. 2025 |
Methods — techniques the papers use, named apart from their topics
tikhonov regularization · 0.9non-blind deconvolution · 0.9cross-partial derivative · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Fast Blind Image Deblurring Based on Cross Partial DerivativeabstractIn this paper, based on second-order cross-partial derivative (CPD), we propose an efficient blind image deblurring algorithm for uniform blur. The proposed method consists of two stages. We first apply a novel blur kernel estimation method to quickly estimate the blur kernel. Then, we use the estimated kernel to perform non-blind deconvolution to restore the image. A key discovery of the proposed kernel estimation method is that the blur kernel information is usually embedded in the cross-partial-derivative (CPD) image of the blurred image. By exploiting this property, we propose a pipeline to extract a set of kernel candidates directly from the CPD image and then select the most suitable kernel as the estimated blur kernel. Since our kernel estimation method can obtain a fairly accurate blur kernel, we can achieve effective image restoration using a relatively simple Tikhonov regularization in the subsequent non-blind deconvolution process. To improve the quality of the restored image, we further adopt an efficient filtering technique to suppress periodic artifacts that may appear in the restored images. Experimental results demonstrate that our algorithm can efficiently restore high-quality sharp images on standard CPUs without relying on GPU acceleration or parallel computation. For blurred images of approximately $800\times 800$ resolution, the proposed method can complete image deblurring within 1 to 5 seconds, which is significantly faster than most state-of-the-art methods. Our MATLAB codes are available at https://github.com/e11tkcee06-a11y/CPD-Deblur.git. Kuan-Chung Ting, Sheng-Jyh Wang, Ruey-Bing Hwang |
IEEE Trans. Image Process. | 1 |