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

Erik Granum

dblp:81/2609 · DBLP profile ↗
← Back
12ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · none

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

Artificial intelligence and machine learning · 11Graphics, computer vision, multimedia, augmented reality and games · 4Human-computer interaction and ubiquitous 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.

Artificial intelligence
2 papers
3D vision · 96% Probabilistic and Bayesian machine learning · 4%
Computer graphics and multimedia
1 paper
Virtual and augmented reality · 100%
Human-computer interaction and pervasive computing
1 paper
Immersive interaction · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
camera pose estimation
0.012003
Computer Vision Based Head Tracking from Re-configurable 2D Markers for AR · ISMAR 2003
Computer vision › 3D vision › camera pose estimation
homography-based pose estimation
0.012003
Computer Vision Based Head Tracking from Re-configurable 2D Markers for AR · ISMAR 2003
Virtual and augmented reality › tracking
head tracking
0.012003
Computer Vision Based Head Tracking from Re-configurable 2D Markers for AR · ISMAR 2003
Virtual and augmented reality › tracking
marker-based tracking
0.012003
Computer Vision Based Head Tracking from Re-configurable 2D Markers for AR · ISMAR 2003
Immersive interaction › augmented reality interaction
augmented reality interface
0.012003
Computer Vision Based Head Tracking from Re-configurable 2D Markers for AR · ISMAR 2003
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models › markov random field
markov network structure learning
0.011986
Dynamic Programming Inference of Markov Networks from Finite Sets of Sample Strings · IEEE Trans. Pattern Anal. Mach. Intell. 1986
Algorithms and data structures
dynamic programming
0.011986
Dynamic Programming Inference of Markov Networks from Finite Sets of Sample Strings · IEEE Trans. Pattern Anal. Mach. Intell. 1986

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

sensor fusion · 0.1computer vision · 0.1string-to-network alignment · 0.0dynamic programming · 0.0
YearPublicationVenuePosition
2003 Computer Vision Based Head Tracking from Re-configurable 2D Markers for AR
abstract
This paper presents a computer vision based head tracking system for augmented reality. A camera is attached to a head mounted display and used to track markers in the user's field of view. These markers are movable on a table and used as interface with virtual objects. Furthermore, they are used as landmarks to track the user's viewpoint and viewing direction by a homography based camera pose estimation algorithm. By integrating this computer vision tracker with a commercially available InterSense tracker, we take the advantages of the small jitter of the former one without losing the tracking speed of the later one. For static and slow head motion the system has less than 0.3mm RMS of position jitter and 0.165 degrees RMS of orientation jitter.
Moritz Störring, Thomas B. Moeslund, Claus B. Madsen, Erik Granum
ISMAR5
2003 Modelling and estimating the pose of a human arm
Thomas B. Moeslund, Erik Granum
Mach. Vis. Appl.2
2003 Tracking regions of human skin through illumination changes
Moritz Störring, Tomá Koka, Hans Jørgen Andersen, Erik Granum
Pattern Recognit. Lett.4
2001 A Survey of Computer Vision-Based Human Motion Capture
Thomas B. Moeslund, Erik Granum
Comput. Vis. Image Underst.2
2000 Multiple Cues used in Model-Based Human Motion Capture
abstract
Human motion capture has lately been the object of much attention due to commercial interests. A "touch-free" computer vision solution to the problem is desirable to avoid the intrusiveness of standard capture devices. The object to be monitored is known a priori which suggests the inclusion of a human model in the capture process. We use a model-based approach known as the analysis-by-synthesis approach. This approach is powerful but has a problem with its potential huge search space. Using multiple cues we reduce the search space by introducing constraints through the 3D locations of salient points and a silhouette of the subject. Both data types are relatively easy to derive and only require limited computational effort so the approach remains suitable for real-time applications. The approach is tested on 3D movements of a human arm and the results show that we successfully can estimate the pose of the arm using the reduced search space.
Thomas B. Moeslund, Erik Granum
FG2
2000 Estimation of the Illuminant Color from Human Skin Color
abstract
Colour is an important and useful feature for object tracking and recognition in computer vision. However, it has the difficulty that the colour of the object changes if the illuminant colour changes. But under known illuminant colour it becomes a robust feature. There are more and more computer vision applications tracking humans, for example in interfaces for human computer interaction or automatic camera men, where skin colour is an often-used feature. Hence, it would be of significant importance to know the illuminant colour in such applications. This paper proposes a novel method to estimate the current illuminant colour from skin colour observations. The method is based on a physical model of reflections, the assumption that illuminant colours are located close to the Planckian locus, and the knowledge about the camera parameters. The method is empirically tested using real images. The average estimation error of the correlated colour temperature is as small as 180 K. Applications are for example in colour-based tracking to adapt to changes in lighting and in visualisation to re-render image colours to their appearance under canonical viewing conditions.
Moritz Störring, Hans Jørgen Andersen, Erik Granum
FG3
1994 Active Vision: A Survey
Henrik I. Christensen, Erik Granum
ECAI2
1991 String Segmentation and Classification by forced Landmark Markov Networks
abstract
A method for segmentation of composite strings into their constituent substrings is presented as an extension to the Markov network inference technique. The basis for the segmentation is forced landmarks which are network representations of the positions where two substrings meet. The landmarks are forced into the Markov model in the inference thereof through supervised labeling. From subsequent string-to-network alignments, it is possible to estimate the positions in the strings that correspond to forced landmarks and thus segment the strings into their substrings. For discrimination between different classes of composite strings, classification probability measures are modified to include model-based information about estimated positions of the landmarks for individual classes. The potential of the method is illustrated with data representing banded human chromosomes.
Jens Gregor, Erik Granum
Int. J. Pattern Recognit. Artif. Intell.2
1987 Computing distance transformations in convex and non-convex domains
Jim Piper, Erik Granum
Pattern Recognit.2
1987 Sequential inference of Markov networks by dynamic programming for structural pattern recognition
Michael G. Thomason, Erik Granum
Pattern Recognit. Lett.2
1986 Dynamic Programming Inference of Markov Networks from Finite Sets of Sample Strings
abstract
Inference of Markov networks from finite sets of sample strings is formulated using dynamic programming. Strings are installed in a network sequentially via optimal string-to-network alignments computed with a dynamic programming matrix, the cost function of which uses relative frequency estimates of transition probabilities to emphasize landmark substrings common to the sample set. Properties of an inferred network are described and the method is illustrated with artificial data and with data representing banded human chromosomes.
Michael G. Thomason, Erik Granum
IEEE Trans. Pattern Anal. Mach. Intell.2
1986 Experiments in dynamic programming inference of Markov networks with strings representing speech data
Michael G. Thomason, Erik Granum, Richard E. Blake
Pattern Recognit.2