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

Hossein Shahbazi

dblp:98/9924 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none

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

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

Databases, data mining, and information retrieval
1 paper
Information retrieval · 100%
Theoretical computer science
1 paper
Graph algorithms and graph theory · 50% Computational geometry · 50%

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

TopicWeightPapersLastEvidence papers
Information retrieval › similarity search › nearest neighbor search
approximate nearest neighbor search
0.112011
Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph · IJCAI 2011
Information retrieval › similarity search
nearest neighbor search
0.112011
Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph · IJCAI 2011
Graph algorithms and graph theory › graph algorithms
graph search
0.112011
Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph · IJCAI 2011
Computational geometry › proximity problems
k-nearest neighbor graph
0.112011
Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph · IJCAI 2011
YearPublicationVenuePosition
2011 Fast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph
Kiana Hajebi, Yasin Abbasi-Yadkori, Hossein Shahbazi, Hong Zhang 0013
IJCAI3
2011 Application of locality sensitive hashing to realtime loop closure detection
abstract
In this work we present a new approach for detecting loop closures in a real-time online setting. The Loop Closure Detection problem is important in visual SLAM applications and different approaches exist to deal with this problem. Most of these approaches are based on the Bag-of-Words approach, and assume a fixed visual vocabulary can work in different types of environments. However BOW is known to introduce perceptual aliasing. By using Locality Sensitive Hashing (LSH) we are able to compute image similarity and detect loop closures by using visual features directly without vector quantization as in BOW and also LSH does not require a prior visual vocabulary. We show the effectiveness of our approach empirically by comparing it to the Bag of Words (BOW) approach which is the dominant method of selecting candidate loop closing images. Our method is fast enough for realtime applications and its accuracy is significantly better than the BOW approach.
Hossein Shahbazi, Hong Zhang 0013
IROS1