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

Sourish Ghosh

dblp:188/6307 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
1since 2021 · last 2023
0000-0001-8438-9487ORCID · corroborated

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

Artificial intelligence and machine learning · 3 · 3 first-author · 1 since 2021Systems, architecture and hardware · 3 · 3 first-author · 1 since 2021

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
Autonomous driving · 30% Video understanding and tracking · 30% Robot navigation and mapping · 30%

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

TopicWeightPapersLastEvidence papers
Computer vision › Video understanding and tracking
object tracking
0.712023
AirTrack: Onboard Deep Learning Framework for Long-Range Aircraft Detection and Tracking · ICRA 2023
Robotics › Autonomous driving
perception
0.712023
AirTrack: Onboard Deep Learning Framework for Long-Range Aircraft Detection and Tracking · ICRA 2023
Robotics › Robot navigation and mapping › target tracking
vision-based tracking
0.712023
AirTrack: Onboard Deep Learning Framework for Long-Range Aircraft Detection and Tracking · ICRA 2023
Robotics › Legged, aerial and field robots
unmanned aerial systems
0.212023
AirTrack: Onboard Deep Learning Framework for Long-Range Aircraft Detection and Tracking · ICRA 2023

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

image alignment · 0.7deep learning · 0.7cascaded classifiers · 0.7
YearPublicationVenuePosition
2023 AirTrack: Onboard Deep Learning Framework for Long-Range Aircraft Detection and Tracking
abstract
Detect-and-Avoid (DAA) capabilities are critical for safe operations of unmanned aircraft systems (UAS). This paper introduces, AirTrack, a real-time vision-only detect and tracking framework that respects the size, weight, and power (SWaP) constraints of sUAS systems. Given the low Signal-to-Noise ratios (SNR) of far away aircraft, we propose using full resolution images in a deep learning framework that aligns successive images to remove ego-motion. The aligned images are then used downstream in cascaded primary and secondary classifiers to improve detection and tracking performance on multiple metrics. We show that AirTrack outperforms state-of-the art baselines on the Amazon Airborne Object Tracking (AOT) Dataset. Multiple real world flight tests with a Cessna 182 interacting with general aviation traffic and additional near-collision flight tests with a Bell helicopter flying towards a UAS in a controlled setting showcase that the proposed approach satisfies the newly introduced ASTM F3442/F3442M standard for DAA. Empirical evaluations show that our system has a probability of track of more than 95% up to a range of 700m. [Video]11Video: https://youtu.be/bMw5nUGL5GQ
Sourish Ghosh, Jay Patrikar, Brady G. Moon, Milad Moghassem Hamidi, Sebastian A. Scherer
ICRA1
2018 Probabilistic Kinematic State Estimation for Motion Planning of Planetary Rovers
abstract
Kinematics-based collision detection is important for robot motion planning in unstructured terrain. Especially, planetary rovers require such capability as a single collision may lead to the termination of a mission. For onboard computation, typical numeric approaches are unsuitable as they are computationally expensive and unstable on rocky terrain; instead, a light-weight analytic solution (ACE: Approximate Clearance Evaluation) is planning to be used for the Mars 2020 rover mission. ACE computes the state bounds of articulated suspension systems from terrain height bounds, and assess the safety by checking the constraint violation of states with the worst-case values. ACE's conservative safety check approach can sometimes lead to over-pessimism: feasible states are often reported as infeasible, thus resulting in frequent false positive detection. In this paper, we introduce a computationally efficient probabilistic variant of ACE (called p-ACE) which estimates the probability distributions of states in real time. The advantage of having probability distributions over states, instead of deterministic bounds, is to provide more flexible and less pessimistic worst-case evaluation with probabilistic safety guarantees. Empirically derived distribution models are used to compute the total probability of constraint satisfaction, which is then used for path assessment. Through experiments with a high-fidelity simulator, we empirically show that p-ACE relaxes the deterministic state bounds without losing safety guarantees.
Sourish Ghosh, Kyohei Otsu, Masahiro Ono
IROS1
2017 Joint perception and planning for efficient obstacle avoidance using stereo vision
abstract
Stereo vision is commonly used for local obstacle avoidance of autonomous mobile robots: stereo images are first processed to yield a dense 3D reconstruction of the observed scene, which is then used for navigation planning. Such an approach, which we term Sequential Perception and Planning (SPP), results in significant unnecessary computations as the navigation planner only needs to explore a small part of the scene to compute the shortest obstacle-free path. In this paper, we introduce an approach to Joint Perception and Planning (JPP) using stereo vision, which performs disparity checks on demand, only as necessary while searching on a planning graph. Furthermore, obstacle checks for navigation planning do not require full 3D reconstruction: we present in this paper how obstacle queries can be decomposed into a sequence of confident positive stereo matches and confident negative stereo matches, which are significantly faster to compute than the exact depth of points. The resulting complete JPP formulation is significantly faster than SPP, while still maintaining correctness of planning. We also show how the JPP works with different planners, including search-based and sampling-based planners. We present extensive experimental results from real robot data and simulation experiments, demonstrating that the JPP requires less than 10% of the disparity computations required by SPP.
Sourish Ghosh, Joydeep Biswas
IROS1