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

Nikolai A. Grabowski

dblp:57/5911 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1995
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 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 processing · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing
halftoning
0.011995
Inverse halftoning using binary permutation filters · IEEE Trans. Image Process. 1995
Image and video processing › image restoration › inverse problem
inverse halftoning
0.011995
Inverse halftoning using binary permutation filters · IEEE Trans. Image Process. 1995
Image and video processing › image filtering
nonlinear filtering
0.011995
Inverse halftoning using binary permutation filters · IEEE Trans. Image Process. 1995
Image and video processing › image filtering
rank-order filters
0.011995
Inverse halftoning using binary permutation filters · IEEE Trans. Image Process. 1995

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

permutation filtering · 0.0constrained LMS · 0.0
YearPublicationVenuePosition
1995 Inverse halftoning using binary permutation filters
abstract
The problem of reconstructing a continuous-tone image given its ordered dithered halftone or its error-diffused halftone image is considered. We develop a modular class of nonlinear filters that can reconstruct the continuous-tone information preserving image details and edges that provide important visual cues. The proposed nonlinear reconstruction algorithms, denoted as binary permutation filters, are based on the space and rank orderings of the halftone samples provided by the multiset permutation of the "on" pixels in a halftone observation window. For a given window size, we obtain a wide range of filters by varying the amount of space-rank ordering information utilized in the estimate. For image reconstructions from ordered dithered halftones, we develop periodically space-varying filters that can account for the periodical nature of the underlying screening process. A class of suboptimal but simpler space-invariant reconstruction filters are also proposed and tested. Constrained LMS type algorithms are employed for the design of reconstruction filters that minimize the reconstruction mean squared error. We present simulations showing that binary permutation filters are modular, robust to image source characteristics, and that they produce high visual quality image reconstruction.
Yeong-Taeg Kim, Gonzalo R. Arce, Nikolai A. Grabowski
IEEE Trans. Image Process.3