Jon Barron
barron@eecs.berkeley.edu

I am a fifth year PhD candidate in EECS at UC Berkeley. My advisor is Jitendra Malik. I am funded by the NSF GRFP.

I've spent time at Google[x], MIT CSAIL, Captricity, NASA Ames Research Center, Google NYC, the NYU Media Research Lab, and the Novartis Institutes for BioMedical Research. I've worked on Astrometry.net. I did my bachelors at the University of Toronto.

I have a CV, and a biography.



Research

I'm interested in computer vision, machine-learning, and computational photography. Most of my research is about figuring out the physical world (shape, paint, light, etc) that created a single image. I also work in astronomy and biological image analysis.

CVPR2013_anim

Intrinsic Scene Properties from a Single RGB-D Image
Jonathan T. Barron, Jitendra Malik
Computer Vision and Pattern Recognition (CVPR), 2013   (Oral Presentation)
supplementary material / bibtex

By embedding mixtures of shapes & lights into a soft segmentation of an image, and by leveraging the output of the Kinect, we can extend SIRFS to scenes.

Boundary_png

Boundary Cues for 3D Object Shape Recovery
Kevin Karsch, Zicheng Liao, Jason Rock, Jonathan T. Barron, Derek Hoiem
Computer Vision and Pattern Recognition (CVPR), 2013
supplementary material / bibtex

Boundary cues (like occlusions and folds) can be used for shape reconstruction, which improves object recognition for humans and computers.

ECCV_anim

Color Constancy, Intrinsic Images, and Shape Estimation
Jonathan T. Barron, Jitendra Malik
European Conference on Computer Vision (ECCV), 2012
supplementary material / bibtex / poster / movie / code & data

We present SIRFS (shape, illumination, and reflectance from shading), the first unified model for recovering shape, chromatic illumination, and reflectance from a single image.

Big J

Shape, Albedo, and Illumination from a Single Image of an Unknown Object
Jonathan T. Barron, Jitendra Malik
Computer Vision and Pattern Recognition (CVPR), 2012
supplementary material / bibtex / poster

Given just a single grayscale image of some masked object, we estimate the shape, albedo, and illumination that created that image. We outperform all previous grayscale "intrinsic images" algorithms.

b3do

A Category-Level 3-D Object Dataset: Putting the Kinect to Work
Allison Janoch, Sergey Karayev, Yangqing Jia, Jonathan T. Barron, Mario Fritz, Kate Saenko, Trevor Darrell
International Conference on Computer Vision (ICCV) 3DRR Workshop, 2011
bibtex / "smoothing" code

We present a large RGB-D dataset of indoor scenes and investigate ways to improve object detection using depth information.

safs_small

High-Frequency Shape and Albedo from Shading using Natural Image Statistics
Jonathan T. Barron, Jitendra Malik
Computer Vision and Pattern Recognition (CVPR), 2011
bibtex

To address shape-from-shading and intrinsic images simultaneously, we impose "naturalness" priors over albedo and shape and recover the most likely explanation of a single image.

fast-texture

Discovering Efficiency in Coarse-To-Fine Texture Classification
Jonathan T. Barron, Jitendra Malik
Technical Report, 2010
bibtex

We introduce a model and feature representation for joint texture classification and segmentation that learns how to classify accurately and when to classify efficiently. This allows for sub-linear coarse-to-fine classification.

blind-date

Blind Date: Using Proper Motions to Determine the Ages of Historical Images
Jonathan T. Barron, David W. Hogg, Dustin Lang, Sam Roweis
The Astronomical Journal, 136, 2008

Using known catalog proper motions, we can accurately estimate the date of origin of historical imagery given only raw pixel data.

clean-usnob

Cleaning the USNO-B Catalog Through Automatic Detection of Optical Artifacts
Jonathan T. Barron, Christopher Stumm, David W. Hogg, Dustin Lang, Sam Roweis
The Astronomical Journal, 135, 2008

We use computer vision techniques to identify and remove diffraction spikes and reflection halos in the USNO-B Catalog.

In use at Astrometry.net


Course Projects
prl

Parallelizing Reinforcement Learning
Jonathan T. Barron, Dave Golland, Nicholas J. Hay, 2009


Markov Decision Problems which lie in a low-dimensional latent space can be decomposed, allowing modified RL algorithms to run orders of magnitude faster in parallel.


Teaching
pacman

CS188 - Fall 2010 (GSI)

CS188 - Spring 2011 (GSI)


(Erdös = 3)