Demo Data from EDBT 2026 / reviewers in the wild / expert
Yehong Liao
dblp:34/4188
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2005
—ORCID · none
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
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
blind image restoration |
0.1 | 1 | 2005 | Blind image restoration with eigen-face subspace · IEEE Trans. Image Process. 2005 |
Image and video processing
image restoration |
0.1 | 1 | 2005 | Blind image restoration with eigen-face subspace · IEEE Trans. Image Process. 2005 |
Image and video processing › regularization
regularization parameter estimation |
0.0 | 1 | 2005 | Blind image restoration with eigen-face subspace · IEEE Trans. Image Process. 2005 |
Methods — techniques the papers use, named apart from their topics
regularized total constrained least squares · 0.1generalized cross-validation · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2005 | Blind image restoration with eigen-face subspaceabstractPerformance of conventional image restoration methods is sensitive to signal-to-noise ratios. For heavily blurred and noisy human facial images, information contained in the eigen-face subspace can be used to compensate for the lost details. The blurred image is decomposed into the eigen-face subspace and then restored with a regularized total constrained least square method. With Generalized cross-validation, a cost function is deduced to include two unknown parameters: the regularization factor and one parameter relevant to point spread function. It is shown that, in minimizing the cost function, the cost function dependence of any one unknown parameter can be separated from the other one, which means the cost function can be considered roughly, depending on single variable in an iterative algorithm. With realistic constraints on the regularized factor, a global minimum for the cost function is achieved to determine the unknown parameters. Experiments are presented to demonstrate the effectiveness and robustness of the new method. Yehong Liao, Xueyin Lin |
IEEE Trans. Image Process. | 1 |