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

Torbjörn Kronander

dblp:78/6071 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
0since 2021 · last 2002
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 3 · 2 first-authorArtificial intelligence and machine learning · 1Computer networks · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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 coding · 44% Rendering · 44% Multimedia analysis and retrieval · 13%

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

TopicWeightPapersLastEvidence papers
Image and video coding
image compression
0.011987
Sampling of Bandpass Pyramids · IEEE Trans. Commun. 1987
Rendering
sampling
0.011987
Sampling of Bandpass Pyramids · IEEE Trans. Commun. 1987
Multimedia analysis and retrieval › image analysis
multiresolution image analysis
0.011987
Sampling of Bandpass Pyramids · IEEE Trans. Commun. 1987

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

laplacian pyramid · 0.0hexagonal sampling · 0.0
YearPublicationVenuePosition
2002 Phase-Based Multidimensional Volume Registration
abstract
We present a method for accurate image registration and motion compensation in multidimensional signals, such as two-dimensional (2-D) X-ray images and three-dimensional (3-D) computed tomography/magnetic resonance imaging volumes. The method is based on phase from quadrature filters, which makes it robust to noise and temporal intensity variations. The method is equally applicable to signals of two, three or higher number of dimensions. We use parametric models, e.g., affine models, finite elements or local affine models with global regularization. Experimental results show high accuracy for 2-D and 3-D motion compensation.
Magnus Hemmendorff, Mats T. Andersson, Torbjörn Kronander, Hans Knutsson
IEEE Trans. Medical Imaging3
2000 Phase-based multidimensional volume registration
abstract
We present a method for accurate image registration and motion estimation in multidimensional volumes, such as 3D CT and MR images. The method is based on phase from quadrature filters, which makes it insensitive to variations in luminance and other disturbance in the images. The theory is not restricted to any particular kind of motion model or number of dimensions. Experimental results for affine motions in 3D show high accuracy.
Magnus Hemmendorff, Mats T. Andersson, Torbjörn Kronander, Hans Knutsson
ICASSP3
1990 Pulse stream neural networks and reinforcement learning
abstract
A neural network model based on pulse signals is presented. Pulsed signals are shown to give the model such properties as a simplified hardware implementation, the ability to use stochastic search techniques, and biological plausibility. In this model, there is also the possibility of building modular neural systems. Since information representation in pulsed signals has to be studied carefully, the stochastic representation is outlined and it is shown how generation of a signal and estimation of information are obtained. Several design issues have to be solved before it is possible to use a model of this kind, and solutions are proposed for synaptic multiplication, summation, and nonlinearity. It is also shown that reinforcement learning is the type of learning which is best suited for this type of model and that this does not interfere with the properties mentioned above. Initial simulations of the model show promising results
K. Valtonen, Torbjörn Kronander, Ingemar Ingemarsson
IJCNN2
1989 Motion compensated 3-dimensional wave-form image coding
abstract
The author proposes a technique for incorporate motion compensation in a general 3-D waveform coding environment. Examples are given for 3-D subband and DCT (discrete cosine transform) coding where motion compensation yields significant improvements as compared to the same technique without motion compensation. It is concluded that, for low rates, 3-D motion-compensated subband coding is a very efficient technique for the coding of image sequences.>
Torbjörn Kronander
ICASSP1
1988 Post- and pre-processing in coding of image sequences using filters with motion compensated history
abstract
To increase the performance of image coding of sequences it is beneficial to apply temporal prefiltering before coding to increase redundancy. To reduce the subjective impact of coding artifacts also temporal postfiltering can be applied after decoding. A problem with both of these techniques however (and of the more general techniques of image sequence enhancement using temporal filters) is that severe distortion may appear in moving objects. The author presents a method to avoid these artifacts of temporal filtering by introducing movement compensated temporal filtering. This technique yields an anisotropic, non-stationary 3-dimensional transfer function, which locally 'tracks' moving objects. The effect is that the problem of unsharp moving objects is significantly reduced, which allows for much lower cut-off frequencies than stationary filters do. The approach works both with FIR- and IIR-type filters. If a linear phase FIR filter is used for postfiltering, combined with a sampling rate increase, it can be seen as a motion compensated interpolator.>
Torbjörn Kronander
ICASSP1
1987 Sampling of Bandpass Pyramids
abstract
In image analysis and image coding there have been an increased use of multiresolution images, called pyramids or quad trees. In a recent paper Burt and Adelson [2] achieved good results with a Laplacian (bandpass) pyramid to compress image data. One problem with the conventional approach is that too many dimensions (samples) are used to describe the original image. This paper describes a method to represent an image bandpass pyramid with exactly the dimensionality of the original image. Both rectangular and hexagonal sampling are considered.
Torbjörn Kronander
IEEE Trans. Commun.1