Venkat Ramnan Kalyanakumar

Logo

Portfolio Website

View My GitHub Profile

Hi, I am Venkat !!

I am a graduate student (M.S. in computer science) at Oregon State University. Striving to contribute clean code and robust software engineering capabilities, with a keen interest in opportunities within machine learning, computer vision, or data science.

🌟 Looking for Full-Time Opportunities 🌟


Education

Degree University Duration
M.S., Computer Science Oregon State University Sep 2022 - present
B.Tech., Electronics and Communication PES University June 2022


Skills

python logo git logo torch logo opencv logo TF logo


Other Skills (things I have **not** used extensively as above)
  • C++
  • Docker
  • MLFlow
  • ROS
  • Unity
  • OpenAI Gym
  • Postgres


Machine Learning (research) interests


Experience

OSU Graduate Research Assistant @ Oregon State University (Sep 2022 - Present)

nookia Robotics intern @ Nokia Bell Labs (NJ) (Jun 2023 - Aug 2023)

Research intern @ Indian Institute of Science (Jul 2021 - Dec 2021)

nookia Student intern @ Nokia (Feb 2021 - Feb 2022)


Publications


Academic Projects

Image

Learning-Based Motion Planning for Arbitrary Locomotive Systems

A novel motion planning framework for general locomoting systems, beyond car-like robots, integrating dynamically feasible motion primitives using Deep Deterministic Policy Gradients (DDPG) reinforcement learning and an artificial potential field for accurate learning guidance.

Major contributions are:
  1. Considering the motion planning problem beyond the path planning by considering the dynamically feasible motion primitives.
  2. Implementing The motion planning framework for general locomoting systems beyond car-like robots.
  3. Achieving the globally optimal path and giving accurate learning guidance by combining RL with conventional motion planning (the artificial potential field).


Image

Explainable AI for NASA Hirise Mars Project

This project aims to build an explainable CNN model to classify Mars HiRISE images, providing insights into why the model makes certain classifications. By achieving interpretability, it will enhance trust in the model’s predictions and help identify biases and prejudices in its decisions.

Major contributions are:
  1. Weighted sampler and Focal loss for extremely imbalanced data.
  2. Implemented LIME, SHAP and GradCAM for explainability using heatmaps and class activation maps.
  3. Covariate shift handles using illumination (openCV LUT) and batch normalization on modified ResNet.


Image

Key Value Pair Extraction from Scanned Documents

The task of text extraction from documents is commonly targeted as a computer vision problem with text postprocessing done to ensure correctness. A sub-problem in that domain is more focused on identifying key-value pairs in a scanned document in order to populate in an exist- ing database. In this project we propose a method for extracting these key-value pairs from document images usingboth layout information and textual associations. Thus, this is a multi-modal approach in which we use image embeddings from FastRCNN integrated with BERT model to combine text, layout, and image features. We create a different variant of positional embeddings and pretrain BERT using masking. This model is then fine-tuned for the downstream task of key-value pair extraction. This method has applications in information extraction and quick document analysis tasks.

Image

Curriculum Learning For Brain Tumor Segmentation

Curriculum learning utilizes a novel scheduling algorithm based on standard deviation of class label distribution. Input data is represented as an array with dimensions (m samples, C channels, H height, W width), each with corresponding output labels. The standard deviation of class distribution reflects the difficulty of segmentation, with higher values indicating more challenging samples. Training begins with the most difficult examples, gradually incorporating easier ones in subsequent epochs. Results demonstrate that curriculum learning achieves convergence to full data training within 40 epochs, while also reducing training time by 30% compared to standard approaches. Presented as 2022 MICCAI poster.