Erik B. Sudderth

University of California, Berkeley

Papers

1

Total Citations

20

H-Index

1

About

Erik B. Sudderth is a leading researcher in machine learning, computer vision, and statistical signal processing, best known for his pioneering work on nonparametric Bayesian methods and probabilistic graphical models. His major contributions include the development of nonparametric belief propagation (NBP), a powerful technique for distributed inference in sensor networks and robotics. In his highly cited 2009 paper, Sudderth applied NBP to the problem of tracking multiple moving robots using noisy inter-distance measurements, demonstrating how local sensing and message-passing algorithms can enable robust, decentralized position estimation—a foundational advance for multi-robot coordination. With over 20 citations, this work exemplifies his impact on bridging theory and practice in autonomous systems. Beyond robotics, Sudderth has made seminal contributions to hierarchical Bayesian models for visual scene understanding, including object recognition and motion analysis. His research has been recognized with multiple best paper awards and funding from agencies like NSF and DARPA. For students and researchers, Sudderth’s work offers a masterclass in leveraging probabilistic reasoning to solve complex, real-world inference problems.

Research Focus

Key Achievements

1
H-Index
1
Papers
20
Total Citations
20
Avg Citations/Paper
🏆 Most Cited Paper
Nonparametric belief propagation for distributed tracking of robot networks with noisy inter-distance measurements
20 citations · 2009
📈 Most Prolific Year: 2009 (1 Papers)
🤝 Key Collaborators: 2
🏛 Institutions: University of California, Berkeley

Top Papers

  1. 1

Key Collaborators

Contact & Links

Available for collaboration
Content generated · 12 days ago