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

Dmitry Kit

dblp:66/3780 · DBLP profile ↗
← Back
8ranked-venue papers
3as 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 · 4 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2Systems, architecture and hardware · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 1Human-computer interaction and ubiquitous computing · 1Applied, interdisciplinary, general and emerging computing · 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.

Artificial intelligence
2 papers
Video understanding and tracking · 25% Transfer learning and domain adaptation · 25% Optimization for machine learning · 25%
Databases, data mining, and information retrieval
1 paper
Database system architecture and tuning · 50% Data stream processing · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › Video understanding and tracking
action anticipation
0.212014
A Discriminative Model with Multiple Temporal Scales for Action Prediction · ECCV (5) 2014
Machine learning › Optimization for machine learning
low-rank constraint
0.212014
Generalized Transfer Subspace Learning Through Low-Rank Constraint · Int. J. Comput. Vis. 2014
Machine learning › Representation and self-supervised learning › representation learning › dimensionality reduction
subspace learning
0.212014
Generalized Transfer Subspace Learning Through Low-Rank Constraint · Int. J. Comput. Vis. 2014
Machine learning › Transfer learning and domain adaptation › feature-based transfer learning
transfer subspace learning
0.212014
Generalized Transfer Subspace Learning Through Low-Rank Constraint · Int. J. Comput. Vis. 2014

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

multiple temporal scales · 0.2low-rank constraint · 0.2discriminative model · 0.2
YearPublicationVenuePosition
2016 Reading Between the Dots: Combining 3D Markers and FACS Classification for High-Quality Blendshape Facial Animation
Shridhar Ravikumar, Colin Davidson, Dmitry Kit, Neill D. F. Campbell, Luca Benedetti, Darren Cosker
Graphics Interface3
2016 Efficient Image Geotagging Using Large Databases
abstract
There are now billions of images stored on photo sharing websites. These images contain visual cues that reflect the geographical location of where the photograph was taken (e.g., New York City). Linking visual features in images to physical locations has many potential applications, such as tourism recommendation systems. However, the size and nature of these databases pose great challenges. For example, the distribution of images around the world is highly biased towards popular regions. This results in high redundancy in certain locations, while under-representing the features in other regions. Many density estimation methods are unable to handle such datasets. In this paper we employ an on-line unsupervised clustering method, Location Aware Self-Organizing Map (LASOM), to compress a large image database and learn similarity relationships between different geographical locations. Our method achieves promising results when used on a dataset containing approximately 900,000 images. We further show that the learned representation results in minimal information loss as compared to using k-Nearest Neighbor method. The noise reduction property of LASOM allows for superior performance when combining multiple features. The final part of the paper explores clothing as a new information source that may assist in geolocation of images.
Dmitry Kit, Yu Kong 0001, Yun Fu 0001
IEEE Trans. Big Data1
2014 A Discriminative Model with Multiple Temporal Scales for Action Prediction
Yu Kong 0001, Dmitry Kit, Yun Fu 0001
ECCV (5)2
2014 LASOM: Location Aware Self-Organizing Map for discovering similar and unique visual features of geographical locations
abstract
Can a machine tell us if an image was taken in Beijing or New York? Automated identification of the geographical coordinates based on image content is of particular importance to data mining systems, because geolocation provides a large source of context for other useful features of an image. However, successful localization of unannotated images requires a large collection of images that cover all possible locations. Brute-force searches over the entire databases are costly in terms of computation and storage requirements, and achieve limited results. Knowing what visual features make a particular location unique or similar to other locations can be used for choosing a better match between spatially distance locations. However, doing this at global scales is a challenging problem. In this paper we propose an on-line, unsupervised, clustering algorithm called Location Aware Self-Organizing Map (LASOM), for learning the similarity graph between different regions. The goal of LASOM is to select key features in specific locations so as to increase the accuracy in geotagging untagged images, while also reducing computational and storage requirements. Different from other Self-Organizing Map algorithms, LASOM provides the means to learn a conditional distribution of visual features, conditioned on geospatial coordinates. We demonstrate that the generated map not only preserves important visual information, but provides additional context in the form of visual similarity relationships between different geographical areas. We show how this information can be used to improve geotagging results when using large databases.
Dmitry Kit, Yu Kong 0001, Yun Fu 0001
IJCNN1
2014 Generalized Transfer Subspace Learning Through Low-Rank Constraint
Ming Shao, Dmitry Kit, Yun Fu 0001
Int. J. Comput. Vis.2
2011 Novelty detection using Growing Neural Gas for visuo-spatial memory
abstract
Detecting visual changes in environments is an important computation with many applications in robotics and computer vision. Security cameras, remotely operated vehicles, and sentry robots could all benefit from robust change detection capability. We conjecture that if one has a mobile camera system the number of visual scenes that are experienced is limited (compared to the space of all possible scenes) and that the scenes do not frequently undergo major changes between observations. These assumptions can be exploited to ease the task of change detection and reduce the computational complexity of processing visual information by utilizing memory to store previous computations. We demonstrate a method to learn the distribution of visual features in an environment via a self-organizing map. Additionally, the spatial distribution of these features can be learned if a positional signal is available. Our method uses a low dimensional representation of visual features to rapidly detect changes in current visual inputs. The model encodes spatially-distributed color histograms of real world visual scenes captured by a camera moved through an environment. The distribution of the color histograms is learned using a self-organizing map with location (when available) and color data. We present tests of the model on detecting changes in an indoor environment.
Dmitry Kit, Brian T. Sullivan, Dana H. Ballard
IROS1
2008 Network Imprecision: A New Consistency Metric for Scalable Monitoring
Navendu Jain, Prince Mahajan, Dmitry Kit, Praveen Yalagandula, Michael Dahlin
OSDI3
2007 STAR: Self-Tuning Aggregation for Scalable Monitoring
Navendu Jain, Michael Dahlin, Dmitry Kit, Prince Mahajan, Praveen Yalagandula
VLDB4