Demo Data from SIGIR 2026 / reviewers in the wild / expert
Alexander Sorokin
dblp:42/3031
· DBLP profile ↗
8ranked-venue papers
1as first author
0since 2021 · last 2010
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3Applied, interdisciplinary, general and emerging computing · 2Systems, architecture and hardware · 1 · 1 first-authorHuman-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
3 papers |
Representation and self-supervised learning · 32% Image recognition and object detection · 18% Information extraction and text analysis · 18% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% | |
| Human-computer interaction and pervasive computing
2 papers |
Human-robot interaction · 51% Ubiquitous computing and smart environments · 34% Interaction techniques and input · 15% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 100% | |
| Computer graphics and multimedia
1 paper |
Visualization and visual analytics · 100% |
Topics — the 14 heaviest of 17, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Information extraction and text analysis
dataset construction |
0.1 | 1 | 2010 | It's All About the Data · Proc. IEEE 2010 |
Machine learning › Representation and self-supervised learning › representation learning › visual representation learning
visual feature learning |
0.1 | 1 | 2010 | It's All About the Data · Proc. IEEE 2010 |
Bioinformatics and computational biology
comparative genomics |
0.1 | 1 | 2010 | A low-polynomial algorithm for assembling clusters of orthologous groups from intergenomic symmetric best matches · Bioinform. 2010 |
Bioinformatics and computational biology › comparative genomics › orthology analysis
ortholog identification |
0.1 | 1 | 2010 | A low-polynomial algorithm for assembling clusters of orthologous groups from intergenomic symmetric best matches · Bioinform. 2010 |
Graph algorithms and graph theory
graph algorithms |
0.1 | 1 | 2010 | A low-polynomial algorithm for assembling clusters of orthologous groups from intergenomic symmetric best matches · Bioinform. 2010 |
Computer vision › Video understanding and tracking › activity recognition
human activity recognition |
0.1 | 1 | 2008 | Human Activity Recognition with Metric Learning · ECCV (1) 2008 |
Machine learning › Representation and self-supervised learning › representation learning
metric learning |
0.1 | 1 | 2008 | Human Activity Recognition with Metric Learning · ECCV (1) 2008 |
Visualization and visual analytics
spatiotemporal visualization |
0.1 | 1 | 2007 | Visualizing the History of Living Spaces · IEEE Trans. Vis. Comput. Graph. 2007 |
Ubiquitous computing and smart environments › smart buildings
building monitoring |
0.1 | 1 | 2007 | Visualizing the History of Living Spaces · IEEE Trans. Vis. Comput. Graph. 2007 |
Machine learning › Generative modeling
generative model |
0.1 | 1 | 2005 | Efficient Unsupervised Learning for Localization and Detection in Object Categories · NIPS 2005 |
Computer vision › Image recognition and object detection
object detection |
0.1 | 1 | 2005 | Efficient Unsupervised Learning for Localization and Detection in Object Categories · NIPS 2005 |
Computer vision › Image recognition and object detection
object localization |
0.1 | 1 | 2005 | Efficient Unsupervised Learning for Localization and Detection in Object Categories · NIPS 2005 |
Robotics › Motion planning and robot control › robot dynamics
template model |
0.1 | 1 | 2005 | Efficient Unsupervised Learning for Localization and Detection in Object Categories · NIPS 2005 |
Web and social media mining
web mining |
0.0 | 1 | 2010 | It's All About the Data · Proc. IEEE 2010 |
Methods — techniques the papers use, named apart from their topics
symmetric best matches · 0.2edgesearch algorithm · 0.2crowdsourcing · 0.2contextual information extraction · 0.2video camera fusion · 0.1motion sensing · 0.1metric learning · 0.1variational approximation · 0.1unsupervised learning · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2010 | Help me help you: interfaces for personal robotsabstractNo abstract available. Ian J. Goodfellow, Nate Koenig, Marius Muja, Caroline Pantofaru, Alexander Sorokin, Leila Takayama |
HRI | 5 |
| 2010 | People helping robots helping people: Crowdsourcing for grasping novel objectsabstractFor successful deployment, personal robots must adapt to ever-changing indoor environments. While dealing with novel objects is a largely unsolved challenge in AI, it is easy for people. In this paper we present a framework for robot supervision through Amazon Mechanical Turk. Unlike traditional models of teleoperation, people provide semantic information about the world and subjective judgements. The robot then autonomously utilizes the additional information to enhance its capabilities. The information can be collected on demand in large volumes and at low cost. We demonstrate our approach on the task of grasping unknown objects. Alexander Sorokin, Dmitry Berenson, Siddhartha S. Srinivasa, Martial Hebert |
IROS | 1 |
| 2010 | A low-polynomial algorithm for assembling clusters of orthologous groups from intergenomic symmetric best matchesabstractMOTIVATION: Identifying orthologous genes in multiple genomes is a fundamental task in comparative genomics. Construction of intergenomic symmetrical best matches (SymBets) and joining them into clusters is a popular method of ortholog definition, embodied in several software programs. Despite their wide use, the computational complexity of these programs has not been thoroughly examined. RESULTS: In this work, we show that in the standard approach of iteration through all triangles of SymBets, the memory scales with at least the number of these triangles, O(g(3)) (where g = number of genomes), and construction time scales with the iteration through each pair, i.e. O(g(6)). We propose the EdgeSearch algorithm that iterates over edges in the SymBet graph rather than triangles of SymBets, and as a result has a worst-case complexity of only O(g(3)log g). Several optimizations reduce the run-time even further in realistically sparse graphs. In two real-world datasets of genomes from bacteriophages (POGs) and Mollicutes (MOGs), an implementation of the EdgeSearch algorithm runs about an order of magnitude faster than the original algorithm and scales much better with increasing number of genomes, with only minor differences in the final results, and up to 60 times faster than the popular OrthoMCL program with a 90% overlap between the identified groups of orthologs. AVAILABILITY AND IMPLEMENTATION: C++ source code freely available for download at ftp.ncbi.nih.gov/pub/wolf/COGs/COGsoft/. SUPPLEMENTARY INFORMATION: Supplementary materials are available at Bioinformatics online. David M. Kristensen, Lavanya Kannan, Michael K. Coleman, Yuri I. Wolf, Alexander Sorokin, Eugene V. Koonin, Arcady R. Mushegian |
Bioinform. | 5 |
| 2010 | It's All About the DataabstractModern computer vision research consumes labelled data in quantity, and building datasets has become an important activity. The Internet has become a tremendous resource for computer vision researchers. By seeing the Internet as a vast, slightly disorganized collection of visual data, we can build datasets. The key point is that visual data are surrounded by contextual information like text and HTML tags, which is a strong, if noisy, cue to what the visual data means. In a series of case studies, we illustrate how useful this contextual information is. It can be used to build a large and challenging labelled face dataset with no manual intervention. With very small amounts of manual labor, contextual data can be used together with image data to identify pictures of animals. In fact, these contextual data are sufficiently reliable that a very large pool of noisily tagged images can be used as a resource to build image features, which reliably improve on conventional visual features. By seeing the Internet as a marketplace that can connect sellers of annotation services to researchers, we can obtain accurately annotated datasets quickly and cheaply. We describe methods to prepare data, check quality, and set prices for work for this annotation process. The problems posed by attempting to collect very big research datasets are fertile for researchers because collecting datasets requires us to focus on two important questions: What makes a good picture? What is the meaning of a picture? Tamara L. Berg, Alexander Sorokin, Gang Wang 0012, David A. Forsyth, Derek Hoiem, Ian Endres, Ali Farhadi |
Proc. IEEE | 2 |
| 2008 | Human Activity Recognition with Metric Learning
Du Tran, Alexander Sorokin |
ECCV (1) | 2 |
| 2007 | Tracking people in mixed modality systemsabstractIn traditional surveillance systems tracking of objects is achieved by means of image and video processing. The disadvantages of such surveillance systems is that if an object needs to be tracked - it has to be observed by a video camera. However, geometries of indoor spaces typically require a large number of video cameras to provide the coverage necessary for robust operation of video-based tracking algorithms. Increased number of video streams increases the computational burden on the surveillance system in order to obtain robust tracking results. In this paper we present an approach to tracking in mixed modality systems, with a variety of sensors. The system described here includes over 200 motion sensors as well as 6 moving cameras. We track individuals in the entire space and across cameras using contextual information available from the motion sensors. Motion sensors allow us to almost instantaneously find plausible tracks in a very large volume of data, ranging in months, which for traditional video search approaches could be virtually impossible. We describe a method that allows us to evaluate when the tracking system is unreliable and present the data to a human operator for disambiguation. Yuri A. Ivanov, Alexander Sorokin, Christopher Richard Wren, Ishwinder Kaur |
VCIP | 2 |
| 2007 | Visualizing the History of Living SpacesabstractThe technology available to building designers now makes it possible to monitor buildings on a very large scale. Video cameras and motion sensors are commonplace in practically every office space, and are slowly making their way into living spaces. The application of such technologies, in particular video cameras, while improving security, also violates privacy. On the other hand, motion sensors, while being privacy-conscious, typically do not provide enough information for a human operator to maintain the same degree of awareness about the space that can be achieved by using video cameras. We propose a novel approach in which we use a large number of simple motion sensors and a small set of video cameras to monitor a large office space. In our system we deployed 215 motion sensors and six video cameras to monitor the 3,000-square-meter office space occupied by 80 people for a period of about one year. The main problem in operating such systems is finding a way to present this highly multidimensional data, which includes both spatial and temporal components, to a human operator to allow browsing and searching recorded data in an efficient and intuitive way. In this paper we present our experiences and the solutions that we have developed in the course of our work on the system. We consider this work to be the first step in helping designers and managers of building systems gain access to information about occupants' behavior in the context of an entire building in a way that is only minimally intrusive to the occupants' privacy. Yuri A. Ivanov, Christopher Richard Wren, Alexander Sorokin, Ishwinder Kaur |
IEEE Trans. Vis. Comput. Graph. | 3 |
| 2005 | Efficient Unsupervised Learning for Localization and Detection in Object CategoriesabstractWe describe a novel method for learning templates for recognition and localization of objects drawn from categories. A generative model repre- sents the configuration of multiple object parts with respect to an object coordinate system; these parts in turn generate image features. The com- plexity of the model in the number of features is low, meaning our model is much more efficient to train than comparative methods. Moreover, a variational approximation is introduced that allows learning to be or- ders of magnitude faster than previous approaches while incorporating many more features. This results in both accuracy and localization im- provements. Our model has been carefully tested on standard datasets; we compare with a number of recent template models. In particular, we demonstrate state-of-the-art results for detection and localization. Nicolas Loeff, Himanshu Arora, Alexander Sorokin, David A. Forsyth |
NIPS | 3 |