AI Innovation Institute

CSE 600 Talk: Haibin Ling - Computer Vision Research and Applications


Abstract: Having been intensively studied over half a decade, computer vision has evolved as a broad research area and become mature in many applications. In this talk, we will summarize our work in computer vision in both core vision topics and application-oriented ones. In particular, for core vision problems, we will report studies on visual tracking, visual matching and visual detection; for applications, we will describe our work on medical image analysis, intelligent transportation, smart projector systems and preliminary work on material property prediction.

Bio: Haibin Ling received the BS and MS degrees from Peking University in 1997 and 2000, respectively, and the PhD degree from the University of Maryland, College Park, in 2006. From 2000 to 2001, he was an assistant researcher at Microsoft Research Asia. From 2006 to 2007, he worked as a postdoctoral scientist at the University of California Los Angeles. In 2007, he joined Siemens Corporate Research as a research scientist. From 2008 to 2019, he worked as a faculty member of Temple University. In fall 2019, he joined the Department of Computer Science of Stony Brook University where he is currently a SUNY Empire Innovation Professor. His research interests include computer vision, augmented reality, medical image analysis, and human computer interaction. He received the Best Student Paper Award at the ACM UIST in 2003, and the NSF CAREER Award in 2014. He serves as Associate Editor for several journals including IEEE Trans. on Pattern Analysis and Machine Intelligence (PAMI), Pattern Recognition (PR), and Computer Vision and Image Understanding (CVIU). He has served or will serve as Area Chair for CVPR 2014, 2016, 2019 and 2020.

Date of Event
2021-02-17

Joel H. Saltz, MD, PhD
SUNY Distinguished Professor Cherith Professor and Founding Chair
Department of Biomedical Informatics
Stony Brook University

Apostolos K. Tassiopoulos, MD, FACS
Professor of surgery and vice chair for quality and outcomes Chief of the Division of Vascular and Endovascular Surgery
Director of the Stony Brook Vascular Center Stony Brook Medicine

Title: Clinical applications of artificial intelligence to improve diagnosis and risk stratification for patients with aortic aneurysms

Time: Wednesday, Feb 17, 2021 3 pm - 4 pm

Join Zoom Meeting
https://stonybrook.zoom.us/j/95617197636?pwd=KytzZ2pVRG9SZGpKZUtpNXJISj...
Meeting ID: 956 1719 7636 Passcode: 924293

Abstract:

Many real world complex problems are multi-step reasoning tasks. These range from analytic tasks such as answering questions to automation tasks where agents complete tasks on behalf of users.. Evaluation, datasets, and models for such tasks can be unreliable for multiple reasons. (i) Datasets often have annotation artifacts and biases, allowing models to take reasoning shortcuts. Such shortcuts can allow models to make effective guesses -- or, in a sense, cheat -- to achieve high performance without any multi-step reasoning. This issue is further exacerbated for complex tasks because as the number of the required reasoning steps increases, so do the avenues for bypassing those steps. (ii) Models trained on such dataset/s learn to solve the task by taking reasoning shortcuts instead of proper multi-step reasoning. As a result, these models are not robust (reliable) when evaluated in an out-of-distribution evaluation setting. (iii) Lastly, recent works have shown that language models can solve complex multi-step tasks by producing a step-by-step explanation without any training. However, these methods often hallucinate factually incorrect (i.e., unreliable) explanations when posed with knowledge-intensive tasks.

I address these challenges by carefully characterizing the requirements of robust multi-step reasoning and designing reliable evaluation datasets and training methods that necessitate thorough multi-step reasoning. In DiRe, I first formalize and introduce Disconnected Reasoning, i.e., reasoning that allows models to arrive at the correct answer by bypassing necessary reasoning steps, and use this formalization to measure how much multi-step reasoning a model does on a dataset. In MuSiQue, I built a multi-step reasoning dataset for QA from scratch that avoids cheatability via disconnected reasoning, providing a more reliable evaluation. In TeaBReaC, I developed a synthetically generated multi-step QA pretraining dataset designed to force models to avoid disconnected reasoning and learn reliable multi-step reasoning. In IRCoT, I address the reliability of model-generated multi-step reasoning chains by interleaving models' step-by-step reasoning with a step-by-step retrieval from an external corpus, resulting in more factually correct reasoning. Finally, in AppWorld, I built a multi-step reasoning dataset that requires highly interactive problem-solving in an environment carefully designed to ensure models need thorough reasoning to succeed.
Speaker: Harsh Trivedi

Location: NCS 220 or Zoom

https://stonybrook.zoom.us/j/99096379762?pwd=zYCJZQVxRuZd9BboscO4nlodCwsKBr.1

Abstract: The development of embodied AI has largely focused on scaling data and computational power, often at the cost of energy efficiency. In contrast, biological intelligence achieves remarkable adaptability with minimal resources, inspiring a shift toward neuromorphic AI, an approach that mimics the structure and dynamics of biological neural systems. In this talk, I will explore the promises and challenges of neuromorphic computer vision from three key perspectives: algorithms, robot actions, and data. First, I will discuss algorithmic advances, including continuous visual hull reconstruction, continuous-time human motion field estimation, and unsupervised independent motion segmentation. Next, I will illustrate how neuromorphic vision enables agile robotic actions by leveraging event-based perception for real-time decision-making. Finally, I will address challenges in training data-driven models with event data, highlighting strategies to enhance data availability and efficiency. By integrating these elements, neuromorphic AI paves the way for energy-efficient, high-performance embodied intelligence in dynamic real-world environments.

Speaker Bio: Ziyun (Claude) Wang is a fifth-year Ph.D. student in the General Robotics, Automation, Sensing & Perception (GRASP) Lab at the University of Pennsylvania, advised by Professor Kostas Daniilidis. His research focuses on developing algorithms for neuromorphic computer vision and integrating them with real hardware to enable agile perception in embodied AI systems. Prior to his Ph.D., he worked at the Samsung AI Center New York, where he developed 3D reconstruction techniques for robotic applications and earned three patents. He also contributed to the Apple Vision Pro team, enhancing user comfort for AR glasses. His research work has been recognized at major computer vision, robotics, and machine learning venues including the AAAI Conference on Artificial Intelligence (AAAI), European Conference on Computer Vision (ECCV), International Conference on Learning Representations (ICLR), Conference on Computer Vision and Pattern Recognition (CVPR) workshops, and IEEE Robotics and Automation Letters (R-AL), with an oral presentation at ECCV placing in the top 2.7%. His research aims to drive the development of next-generation bio-inspired AI systems, enabling more efficient, adaptive, and intelligent embodied perception.

Department of Writing and Rhetoric Lecture

Escaping Human Judgment? The Politics of AI under Authoritarianism

Much of the recent debate around AI-decision making assumes that human involvement is a safeguard: humans bring context, accountability, and fairness to otherwise impersonal algorithmic systems. But whether human or algorithmic judgment is preferred depends on the complex interaction between an individual's social position and the configuration of power in which that judgment takes place.

Speaker: Zheng Fu, PRODIG+ Fellow

Location: Humanities 1008

Research challenges in using computer vision in robotics systems Abstract The past decade has seen a remarkable increase in the level of performance of computer vision techniques, including with the introduction of effective deep learning techniques. Much of this progress is in the form of rapidly increasing performance on standard, curated datasets. However, translating these results into operational vision systems for robotics applications remains a formidable challenge. This talk with explore some of the fundamental questions at the boundary between computer vision and robotics that need to be addressed. This includes introspection/self-awareness of performance, anytime algorithms for computer vision, multi-hypothesis generation, rapid learning and adaptation. The discussion will be illustrated by examples from autonomous air and ground robots.

Do Natural Language Understanding Systems Learn to Understand or to
Find Shortcuts? (Naoya Inoue, http://naoya-i.github.io/)

ABSTRACT: Recent studies have suggested that natural language understanding (NLU) systems learn to exploit superficial, task-unrelated cues (a.k.a. annotation artifacts) in current datasets. This prevents the community from reliably measuring the progress of NLU systems. In this talk, I will discuss two latest studies from our research team: (i) analysis of annotation artifacts in commonsense causal reasoning and (ii) creation of benchmark for evaluating NLU systems' internal reasoning.
---------------------------------------------------------------------------------------------------------------------------------------------
---------------------------------------------------------------------------------------------------------------------------------------------
Learning graph-structured sparse models (Baojian Zhou, https://baojianzhou.github.io/) 

ABSTRACT: Learning graph-structured sparse models has recently received significant attention thanks to their broad applicability to many important real-world problems. However, such models, of more effective and stronger interpretability compared with their counterparts, are difficult to learn due to optimization challenges. In this talk, we will discuss how to learn graph-structured sparse models under stochastic and online learning settings. Some interesting related problems will also be discussed.