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

Fatemeh Shokrollahi Yancheshmeh

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

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

Artificial intelligence and machine learning · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 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.

Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%
Artificial intelligence
1 paper
Vision and language · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › Vision and language › cross-modal alignment
visual alignment
0.212015
Unsupervised visual alignment with similarity graphs · CVPR 2015
Graph algorithms and graph theory
graph algorithms
0.212015
Unsupervised visual alignment with similarity graphs · CVPR 2015
Graph algorithms and graph theory
similarity graph
0.212015
Unsupervised visual alignment with similarity graphs · CVPR 2015

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

nonlinear optimization · 0.4generalized assignment problem · 0.4centrality measures · 0.2centrality measure · 0.2
YearPublicationVenuePosition
2016 Car type recognition with Deep Neural Networks
abstract
In this paper we study automatic recognition of cars of four types: Bus, Truck, Van and Small car. For this problem we consider two data driven frameworks: a deep neural network and a support vector machine using SIFT features. The accuracy of the methods is validated with a database of over 6500 images, and the resulting prediction accuracy is over 97 %. This clearly exceeds the accuracies of earlier studies that use manually engineered feature extraction pipelines.
Heikki Huttunen, Fatemeh Shokrollahi Yancheshmeh, Ke Chen 0004
Intelligent Vehicles Symposium2
2015 Unsupervised visual alignment with similarity graphs
abstract
Alignment of semantically meaningful visual patterns, such as object classes, is an important pre-processing step for a number of applications such as object detection and image categorization. Considering the expensive manpower spent on the annotation for supervised alignment methods, unsupervised alignment techniques are more favorable especially for large-scale problems. Fine adjustment can be effectively and efficiently achieved with image congealing methods, but they require moderately good initialization which is largely invalid in practice. Alignment of visual class examples with large view point changes remains as an open problem. Feature-based methods can solve the problem to some degree, but require manual selection of a good seed image and omit the fact that examples of a semantic class can be visually very different (e.g., Harley-Davidsons and Scooters in “motorbikes”). In this work, we overcome the aforementioned drawbacks by defining visual similarity under the generalized assignment problem which is solved by fast approximation and non-linear optimization. From pair-wise image similarities we construct an image graph which is used to step-wise align, “morph”, an image to another by graph traveling. We automatically find a suitable seed by novel centrality measure which identifies “similarity hubs” in the graph. The proposed approach in the unsupervised manner outperforms the state-of-the-art methods with classes from the popular benchmark datasets.
Fatemeh Shokrollahi Yancheshmeh, Ke Chen 0004, Joni-Kristian Kämäräinen
CVPR1