Demo Data from EDBT 2026 / reviewers in the wild / expert
M. Siva Karthik
dblp:151/9388
· DBLP profile ↗
3ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3Systems, architecture and hardware · 1Graphics, 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.
| Artificial intelligence
1 paper |
Robot navigation and mapping · 50% Segmentation and scene understanding · 38% Autonomous driving · 12% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Robotics › Robot navigation and mapping
obstacle detection |
0.2 | 1 | 2014 | Markov Random Field based small obstacle discovery over images · ICRA 2014 |
Computer vision › Segmentation and scene understanding
scene understanding |
0.2 | 1 | 2014 | Markov Random Field based small obstacle discovery over images · ICRA 2014 |
Robotics › Robot navigation and mapping › mobile robot perception › visual sensing
monocular camera |
0.1 | 1 | 2014 | Markov Random Field based small obstacle discovery over images · ICRA 2014 |
Robotics › Autonomous driving
perception |
0.1 | 1 | 2014 | Markov Random Field based small obstacle discovery over images · ICRA 2014 |
Methods — techniques the papers use, named apart from their topics
markov random field · 0.2graph cuts · 0.2SLIC · 0.2LSD · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | A Hierarchical Network for Diverse Trajectory ProposalsabstractAutonomous explorative robots frequently encounter scenarios where multiple future trajectories can be pursued. Often these are cases with multiple paths around an obstacle or trajectory options towards various frontiers. Humans in such situations can inherently perceive and reason about the surrounding environment to identify several possibilities of either manoeuvring around the obstacles or moving towards various frontiers. In this work, we propose a 2 stage Convolutional Neural Network architecture which mimics such an ability to map the perceived surroundings to multiple trajectories that a robot can choose to traverse. The first stage is a Trajectory Proposal Network which suggests diverse regions in the environment which can be occupied in the future. The second stage is a Trajectory Sampling network which provides a finegrained trajectory over the regions proposed by Trajectory Proposal Network. We evaluate our framework in diverse and complicated real life settings. For the outdoor case, we use the KITTI dataset and our own outdoor driving dataset. In the indoor setting, we use an autonomous drone to navigate various scenarios and also a ground robot which can explore the environment using the trajectories proposed by our framework. Our experiments suggest that the framework is able to develop a semantic understanding of the obstacles, open regions and identify diverse trajectories that a robot can traverse. Our comparisons portray the performance gain of the proposed architecture over a diverse set of methods against which it is compared. Sriram N. N., Gourav Kumar, Abhay Singh, M. Siva Karthik, Saket Saurav, Brojeshwar Bhowmick, K. Madhava Krishna |
IV | 4 |
| 2014 | Small Object Discovery and Recognition Using Actively Guided RobotabstractIn the field of active perception, object search is a widely studied problem. To search for an object in large rooms, it would be expensive to explore and check each object's similarity with the object of interest. The expense could uncontrollably bloat as the number of objects to be searched increases. If the objects are of the order of a 2-5cm, they appear very small, making it difficult for the present algorithms to recognize them. A general human strategy in such cases is to sparsely identify, from far away (4-6m), if the object of interest is present in the scene. Subsequently, each of the possible objects is analysed from closer proximity to recognize, for further manipulation. In this work, we present a similar framework. We reduce search-space, by identifying existential probability of a small object from a distance followed by a closer 3-D analysis of its point cloud to accurately recognize it. This is achieved by 2-D modelling of the objects using Gaussian Mixture Models followed by recognizing objects using efficient RGB-Depth based algorithm. Sudhanshu Mittal, M. Siva Karthik, Suryansh Kumar 0001, K. Madhava Krishna |
ICPR | 2 |
| 2014 | Markov Random Field based small obstacle discovery over imagesabstractSmall obstacles of the order of 0.5–3cms and homogeneous scenes often pose a problem for indoor mobile robots. These obstacles cannot be clearly distinguished even with the state of the art depth sensors or laser range finders using existing vision based algorithms. With the advent of sophisticated image processing algorithms like SLIC [1] and LSD [9], it is possible to extract rich information from an image which led us to develop a novel architecture to detect very small obstacles on the floor using a monocular camera. This information is further processed using a Markov Random Field based graph cut formalism that precisely segments the floor and detects obstacles which are extremely low. We show robust and accurate obstacle detection and floor segmentation in diverse environments over a large variety of objects found indoors. In our case, low lying obstacles, changing floor patterns and extremely homogeneous environments are properly classified which leads to a drastic decrease in the number of obstacles that may not be classified by existing robotic vision algorithms. Suryansh Kumar 0001, M. Siva Karthik, K. Madhava Krishna |
ICRA | 2 |