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

Christoffer Valgren

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

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

Artificial intelligence and machine learning · 3 · 3 first-authorSystems, architecture and hardware · 3 · 3 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.

Artificial intelligence
2 papers
Robot navigation and mapping · 82% Graph learning · 18%
Databases, data mining, and information retrieval
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot navigation and mapping › robot mapping
topological mapping
0.222008
Incremental spectral clustering and seasons: Appearance-based localization in outdoor environments · ICRA 2008
Incremental Spectral Clustering and Its Application To Topological Mapping · ICRA 2007
Robotics › Robot navigation and mapping › localization
appearance-based localization
0.112008
Incremental spectral clustering and seasons: Appearance-based localization in outdoor environments · ICRA 2008
Robotics › Robot navigation and mapping
localization
0.112008
Incremental spectral clustering and seasons: Appearance-based localization in outdoor environments · ICRA 2008
Machine learning › Graph learning › graph clustering
spectral clustering
0.112007
Incremental Spectral Clustering and Its Application To Topological Mapping · ICRA 2007
Data mining
clustering
0.112007
Incremental Spectral Clustering and Its Application To Topological Mapping · ICRA 2007

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

spectral clustering · 0.1affinity matrix · 0.1panoramic images · 0.1incremental spectral clustering · 0.1epipolar constraint · 0.1
YearPublicationVenuePosition
2008 Incremental spectral clustering and seasons: Appearance-based localization in outdoor environments
abstract
The problem of appearance-based mapping and navigation in outdoor environments is far from trivial. In this paper, an appearance-based topological map, covering a large, mixed indoor and outdoor environment, is built incrementally by using panoramic images. The map is based on image similarity, so that the resulting segmentation of the world corresponds closely to the human concept of a place. Using high-resolution images and the epipolar constraint, the resulting map is shown to be very suitable for localization, even when the environment has undergone seasonal changes.
Christoffer Valgren, Achim J. Lilienthal
ICRA1
2007 Incremental Spectral Clustering and Its Application To Topological Mapping
abstract
This paper presents a novel use of spectral clustering algorithms to support cases where the entries in the affinity matrix are costly to compute. The method is incremental - the spectral clustering algorithm is applied to the affinity matrix after each row/column is added - which makes it possible to inspect the clusters as new data points are added. The method is well suited to the problem of appearance-based, on-line topological mapping for mobile robots. In this problem domain, we show that we can reduce environment-dependent parameters of the clustering algorithm to just a single, intuitive parameter. Experimental results in large outdoor and indoor environments show that we can close loops correctly by computing only a fraction of the entries in the affinity matrix. The accompanying video clip shows how an example map is produced by the algorithm.
Christoffer Valgren, Tom Duckett, Achim J. Lilienthal
ICRA1
2006 Incremental Topological Mapping Using Omnidirectional Vision
abstract
This paper presents an algorithm that builds topological maps, using omnidirectional vision as the only sensor modality. Local features are extracted from images obtained in sequence, and are used both to cluster the images into nodes and to detect links between the nodes. The algorithm is incremental, reducing the computational requirements of the corresponding batch algorithm. Experimental results in a complex, indoor environment show that the algorithm produces topologically correct maps, closing loops without suffering from perceptual aliasing or false links. Robustness to lighting variations was further demonstrated by building correct maps from combined multiple datasets collected over a period of 2 months
Christoffer Valgren, Achim J. Lilienthal, Tom Duckett
IROS1