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

Kim S. Jensen

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

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

Systems, architecture and hardware · 1Computer networks · 1Graphics, 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
2 papers
Image and video processing · 62% Image and video coding · 38%

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

TopicWeightPapersLastEvidence papers
Image and video processing
image filtering
0.011995
Filters involving derivatives with application to reconstruction from scanned halftone images · IEEE Trans. Image Process. 1995
Image and video processing
image reconstruction
0.011995
Filters involving derivatives with application to reconstruction from scanned halftone images · IEEE Trans. Image Process. 1995
Image and video coding › document image compression
halftone image coding
0.011994
Data compression of scanned halftone images · IEEE Trans. Commun. 1994
Image and video processing
halftone image processing
0.011994
Data compression of scanned halftone images · IEEE Trans. Commun. 1994
Image and video coding
image compression
0.011994
Data compression of scanned halftone images · IEEE Trans. Commun. 1994

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

separable autocorrelation modeling · 0.0minimum mean square error estimation · 0.0predictive coding · 0.0parallel implementation · 0.0binary arithmetic coding · 0.0
YearPublicationVenuePosition
1995 Filters involving derivatives with application to reconstruction from scanned halftone images
abstract
This paper presents a method for designing finite impulse response (FIR) filters for samples of a 2-D signal, e.g., an image, and its gradient. The filters, which are called blended filters, are decomposable in three filters, each separable in 1-D filters on subsets of the data set. Optimality in the minimum mean square error sense (MMSE) of blended filtering is shown for signals with separable autocorrelation function. Relations between correlation functions for signals and their gradients are derived. Blended filters may be composed from FIR Wiener filters using these relations. Simple blended filters are developed and applied to the problem of gray value image reconstruction from bilevel (scanned) clustered-dot halftone images, which is an application useful in the graphic arts. Reconstruction results are given, showing that reconstruction with higher resolution than the halftone grid is achievable with blended filters.
Søren Forchhammer, Kim S. Jensen
IEEE Trans. Image Process.2
1994 Data compression of scanned halftone images
abstract
A new method for coding scanned halftone images is proposed. It is information-lossy, but still preserving the image quality, compression rates of 16-35 have been achieved for a typical test image scanned on a high resolution scanner. The bi-level halftone images are filtered, in phase with the halftone grid, and converted to a gray level representation. A new digital description of (halftone) grids has been developed for this purpose. The gray level values are coded according to a scheme based on states derived from a segmentation of gray values. To enable real-time processing of high resolution scanner output, the coding has been parallelized and implemented on a transputer system. For comparison, the test image was coded using existing (lossless) methods giving compression rates of 2-7. The best of these, a combination of predictive and binary arithmetic coding was modified and optimized achieving a compression rate of 9.>
Søren Forchhammer, Kim S. Jensen
IEEE Trans. Commun.2
1989 Parallel computer simulation of nearest-neighbour interaction in a system of nephrons
H. Bohr, Kim S. Jensen, T. Petersen, B. Rathjen, Erik Mosekilde, Niels-Henrik Holstein-Rathlou
Parallel Comput.2