Communications and Signal Processing Seminar (CSP): Learning to Detect an Oddball Target, Rajesh Sundaresan, PhD

By |

“Learning to Detect an Oddball Target”

Rajesh Sundaresan, PhD
Professor, Department of Electrical Communication Engineering
Associate Faculty, Robert Bosch Centre for Cyber-Physical Systems
Indian Institute of Science

Abstract: What policy should you employ if you were to locate an oddball target among many (two or more) distracters? You do not know the statistics of the observations that a ‘view’ of the oddball produces. Nor do you know the statistics of the observations arising from a view of a distracter. The objective is to minimise the search time, subject to keeping the probability of false detection low. Clearly, the common statistics of the distracter-generated observations should be compared, recognised as similar, and further recognised as different from those generated by the oddball target. But where should you look next, when should you stop, and when you stop, what should you decide as the oddball location? When the observations are points of a Poisson process (as in firings of neurons), and when the probability of false detection is driven down to zero, we will discuss the best growth rate of the expected search time. We will also identify an asymptotically optimal search policy that achieves the best growth rate. Finally, we will apply our results to a particular visual search experiment studied recently by neuroscientists and will highlight how prior information affects search performance.

Biography: Rajesh Sundaresan is a Professor in the Department of Electrical Communication Engineering and an Associate Faculty in the Robert Bosch Centre for Cyber-Physical Systems at the Indian Institute of Science. His interests are in communication, computation, and control over networks. He was an associate editor of the IEEE Transactions on Information Theory for the period 2012-2015. He received the B.Tech. degree in electronics and communication from the Indian Institute of Technology Madras, the M.A. and Ph.D. degrees in electrical engineering from Princeton University in 1996 and 1999, respectively. From 1999 to 2005, he worked at Qualcomm Inc. on the design of communication algorithms for wireless modems. Since 2005, he has been with the Indian Institute of Science with brief visiting positions at Qualcomm (2007), Coordinated Sciences Laboratory of the University of Illinois at Urbana-Champaign (2012-13), and the Toulouse Mathematics Institute (2015).

Communications & Signal Processing Tutorial (CSP)

By |

Speaker:  Rajesh Sundaresan, Professor, Indian Institute of Science, Department of Electrical Communication Engineering

Title:  “Application of Belief Propagation for Optimization in Structures Spaces

Tutorial Abstract:  The tutorial will provide an overview of the belief propagation (BP) algorithm and its usefulness in addressing random instances of combinatorial optimization problems (matching, edge-cover, the traveling salesman problem, load-balancing, etc.) on locally tree-like graphs. The tutorial will cover the following topics: description of iterative BP algorithms for finding marginals, max-marginals, etc. on a graphical model, issues related to convergence and correctness of the iterations, mapping of random instances of optimization problems as ground states of associated disordered statistical physics systems, cavity equations, their solutions, properties of the ground states, and approaches to establish correctness in locally tree-like settings.

Biography: Rajesh Sundaresan is a Professor in the Department of Electrical Communication Engineering and an Associate Faculty in the Robert Bosch Centre for Cyber-Physical Systems at the Indian Institute of Science. His interests are in communication, computation, and control over networks. He was an associate editor of the IEEE Transactions on Information Theory for the period 2012-2015. He received the B.Tech. degree in electronics and communication from the Indian Institute of Technology Madras, the M.A. and Ph.D. degrees in electrical engineering from Princeton University in 1996 and 1999, respectively. From 1999 to 2005, he worked at Qualcomm Inc. on the design of communication algorithms for wireless modems. Since 2005, he has been with the Indian Institute of Science with brief visiting positions at Qualcomm (2007), Coordinated Sciences Laboratory of the University of Illinois at Urbana-Champaign (2012-13), and the Toulouse Mathematics Institute (2015).

Register