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

Chengda Yang

dblp:17/4775 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1995
—ORCID · unresolved

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 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 · 88% Computational photography and imaging · 12%

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

TopicWeightPapersLastEvidence papers
Image and video processing
image restoration
0.011995
Nonlinear image recovery with half-quadratic regularization · IEEE Trans. Image Process. 1995
Image and video processing › image reconstruction
regularization-based reconstruction
0.011995
Nonlinear image recovery with half-quadratic regularization · IEEE Trans. Image Process. 1995
Computational photography and imaging › tomographic imaging
computed tomography
0.011995
Nonlinear image recovery with half-quadratic regularization · IEEE Trans. Image Process. 1995
Image and video processing
image reconstruction
0.011995
Nonlinear image recovery with half-quadratic regularization · IEEE Trans. Image Process. 1995

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

monte carlo methods · 0.0markov chain · 0.0half-quadratic regularization · 0.0FFT-based annealing · 0.0
YearPublicationVenuePosition
1995 Nonlinear image recovery with half-quadratic regularization
abstract
One popular method for the recovery of an ideal intensity image from corrupted or indirect measurements is regularization: minimize an objective function that enforces a roughness penalty in addition to coherence with the data. Linear estimates are relatively easy to compute but generally introduce systematic errors; for example, they are incapable of recovering discontinuities and other important image attributes. In contrast, nonlinear estimates are more accurate but are often far less accessible. This is particularly true when the objective function is nonconvex, and the distribution of each data component depends on many image components through a linear operator with broad support. Our approach is based on an auxiliary array and an extended objective function in which the original variables appear quadratically and the auxiliary variables are decoupled. Minimizing over the auxiliary array alone yields the original function so that the original image estimate can be obtained by joint minimization. This can be done efficiently by Monte Carlo methods, for example by FFT-based annealing using a Markov chain that alternates between (global) transitions from one array to the other. Experiments are reported in optical astronomy, with space telescope data, and computed tomography.
Donald Geman, Chengda Yang
IEEE Trans. Image Process.2
1993 Efficient Stochastic Algorithms on Locally Bounded Image Space
Chengda Yang
CVGIP Graph. Model. Image Process.1