Arrow Research search

Author name cluster

Harini Veeraraghavan

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

6 papers
2 author rows

Possible papers

6

TMLR Journal 2026 Journal Article

Tumor-anchored deep feature random forests for out-of-distribution detection in lung cancer segmentation

  • Aneesh Rangnekar
  • Harini Veeraraghavan

Accurate segmentation of lung tumors from 3D computed tomography (CT) scans is essential for automated treatment planning and response assessment. Despite self-supervised pretraining on numerous datasets, state-of-the-art transformer backbones remain susceptible to out-of-distribution (OOD) inputs, often producing confidently incorrect segmentations with potential risk in clinical deployment. Hence, we introduce RF-Deep, a lightweight post-hoc random forests-based framework that uses deep features trained with limited outlier exposure, requiring as few as 40 labeled scans (20 in-distribution and 20 OOD), to improve scan-level OOD detection. RF-Deep repurposes the hierarchical features from the pretrained-then-finetuned segmentation backbones, aggregating features from multiple regions-of-interest anchored to predicted tumor regions to capture OOD likelihood. We evaluated RF-Deep on 2,232 CT volumes spanning near-OOD (pulmonary embolism, COVID-19 negative) and far-OOD (kidney cancer, healthy pancreas) datasets. RF-Deep achieved AUROC $>$~93 on the challenging near-OOD datasets, where it outperformed the next best method by 4--7 percentage points, and produced near-perfect detection (AUROC $>$~99) on far-OOD datasets. The approach also showed transferability to two blinded validation datasets under the ensemble configuration (COVID-19 positive and breast cancer; AUROC $>$~94). RF-Deep maintained consistent performance across backbones of different depths and pretraining strategies, demonstrating applicability of post-hoc detectors as a safety filter for clinical deployment of tumor segmentation pipelines.

IROS Conference 2008 Conference Paper

Learning task specific plans through sound and visually interpretable demonstrations

  • Harini Veeraraghavan
  • Manuela Veloso

Autonomous robots operating in human environments will need to automatically learn to perform new tasks without requiring the implementation of task-specific actions or time-consuming deliberative planning at run-time. In this work, we contribute a demonstration-based approach for teaching a robot task-specific planners involving complex sequential tasks with repetitions. Complexity of tasks results from step repetitions, execution failures and conditionally executing plans. Our demonstration approach uses sound and visually interpretable cues to guide and indicate the various actions and objects to a robot. The robot in turn performs the actions and generalizes its execution into a task-specific planner. We demonstrate the successful plan learning for two different tasks implemented in real-world settings.

ICRA Conference 2006 Conference Paper

Adaptive Geometric Templates for Feature Matching

  • Harini Veeraraghavan
  • Paul R. Schrater
  • Nikolaos P. Papanikolopoulos

Robust motion recovery in tracking multiple targets using image features is affected by difficulties in obtaining good correspondences over long sequences. Difficulties are introduced by occlusions, scale changes, as well as disappearance of features with the rotation of targets. In this work, we describe an adaptive geometric template-based method for robust motion recovery from features. A geometric template consists of nodes containing salient features (e. g. , corner features). The spatial configuration of the features is modeled using a spanning tree. This paper makes the following two contributions: (i) an adaptive geometric template to model the varying number of features on a target, and (U) an iterative data association method for the features based on the uncertainties in the estimated template structure in conjunction with its individual features. We present experimental results for tracking multiple targets over long outdoor image sequences with multiple persistent occlusions. A comparison of the results of the data association method with a standard Mahalanobis distance gating applied to individual features is also presented

ICRA Conference 2006 Conference Paper

No Fear: University of Minnesota Robotics Day Camp Introduces Local Youth to Hands-on Technologies

  • Kelly R. Cannon
  • Monica Anderson 0001
  • Nate Bird
  • Katherine A. Panciera
  • Harini Veeraraghavan
  • Nikolaos P. Papanikolopoulos
  • Maria L. Gini

Women and minorities are underrepresented in the IT field at the high school, university, and industry levels. Efforts to address this imbalance are often too late to solve underlying problems such as perceived ineptitude and actual inexperience. By designing and hosting a program for these underrepresented students in the middle grades, the Center for Distributed Robotics at the University of Minnesota hopes to establish a successful annual robotics day camp which would inspire both women and minorities to pursue careers in technology. Detailed accounts of the goals and methodology are provided. Initial survey results reveal a very positive response from the campers as well as strengths and weaknesses which would be useful in designing or refining similar camps

ICRA Conference 2004 Conference Paper

Combining Multiple Tracking Modalities for Vehicle Tracking at Traffic Intersections

  • Harini Veeraraghavan
  • Nikolaos P. Papanikolopoulos

This paper presents a camera-based system for tracking vehicles at outdoor scenes such as traffic intersections. Two different computer vision modalities, namely, the connected regions obtained through region segmentation and color analysis, obtained through a mean-shift tracking procedure are combined sequentially using an extended Kalman filter to provide the position of each target. Data association ambiguities arising in blob tracking are handled by using oriented bounding boxes and a joint probabilistic data association filter. We show that the above tracking formulation can provide reasonable tracking despite the stop-and-go motion of vehicles and clutter in traffic intersections.

v2026.09.13