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

Aneesh Sood

dblp:23/8210 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

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

Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 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.

Theoretical computer science
1 paper
Computational geometry · 100%
Artificial intelligence
1 paper
Image recognition and object detection · 62% Vision and language · 19% Trustworthy machine learning · 19%

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

TopicWeightPapersLastEvidence papers
Computational geometry › topological data analysis
reeb graph
0.112010
Constructing Reeb graphs using cylinder maps · SCG 2010
Computational geometry › topological data analysis › reeb graph
reeb graph computation
0.112010
Constructing Reeb graphs using cylinder maps · SCG 2010
Computational geometry
topological data analysis
0.112010
Constructing Reeb graphs using cylinder maps · SCG 2010
Computer vision › Vision and language
image captioning
0.012012
Understanding and predicting importance in images · CVPR 2012
Machine learning › Trustworthy machine learning
interpretability
0.012012
Understanding and predicting importance in images · CVPR 2012

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

semantic factors · 0.1contextual factors · 0.1compositional factors · 0.1
YearPublicationVenuePosition
2012 Understanding and predicting importance in images
abstract
What do people care about in an image? To drive computational visual recognition toward more human-centric outputs, we need a better understanding of how people perceive and judge the importance of content in images. In this paper, we explore how a number of factors relate to human perception of importance. Proposed factors fall into 3 broad types: 1) factors related to composition, e.g. size, location, 2) factors related to semantics, e.g. category of object or scene, and 3) contextual factors related to the likelihood of attribute-object, or object-scene pairs. We explore these factors using what people describe as a proxy for importance. Finally, we build models to predict what will be described about an image given either known image content, or image content estimated automatically by recognition systems.
Alexander C. Berg, Tamara L. Berg, Hal Daumé III, Jesse Dodge, Amit Goyal 0001, Xufeng Han, Alyssa C. Mensch, Margaret Mitchell, Aneesh Sood, Karl Stratos, Kota Yamaguchi
CVPR9
2010 Constructing Reeb graphs using cylinder maps
abstract
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing the Reeb graph of scalar functions defined over manifolds. Key to the simplicity and efficiency of the algorithm is an alternate definition of the Reeb graph that considers equivalence classes of level sets instead of individual level sets. The algorithm works in two steps. The first step locates all critical points of the function in the domain. Arcs in the Reeb graph are computed in the second step using a simple search procedure that works on a small subset of the domain that corresponds to a pair of critical points. The algorithm is also able to handle non-manifold domains.
Harish Doraiswamy, Aneesh Sood, Vijay Natarajan
SCG2