Subhransu Maji Curriculum Vitae
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Professor Jitendra Malik Arthur J. Chick Professor, Department of EECS University of California at Berkeley, CA 94720 Email: [email protected], Phone: (510) 642-7597
Professor Jitendra Malik Arthur J. Chick Professor, Department of EECS University of California at Berkeley, CA 94720 Email: [email protected], Phone: (510) 642-7597 Field of Specialization Computer Vision, Computational Modeling of Human Vision, Machine Learning Education B.S. in Electrical Engineering, Indian Institute of Technology, Kanpur, 1980. Ph.D. in Computer Science, Stanford University, December 1985. Experience Research Scientist Director & Site Lead, Facebook Artificial Intelligence Research, Menlo Park, 2018 & 2019 Chair, Department of EECS, UC Berkeley, 2016-2017 Visiting Research Scientist, Google, 2015-2016 Member, Committee on Budget and Interdepartmental Relations, 2013-2014 Associate Dean for New Academic Initiatives, College of Engineering, 2010-2012 Professor, Bioengineering, UC Berkeley, since January 2009. Chair, Department of EECS, UC Berkeley, 2004{2006. Chair, Computer Science Division, EECS, UC Berkeley, 2002{2004. Scientific Director, Yahoo! Research Berkeley, Jan-June 2007 (visiting) Professor, EECS, UC Berkeley, since July 1996. Associate Professor, EECS, UC Berkeley, July 1991-June 1996. Assistant Professor, EECS, UC Berkeley, Jan 1986-June 1991. Member, Groups in Vision Science and Cognitive Science, UC Berkeley. Honors and Awards Computer Pioneer Award, IEEE Computer Society, 2019 IJCAI Award for Research Excellence, 2018 Best paper prize, IEEE CVPR 2018 Helmholtz Prize for a Contribution That Has Stood the Test of Time, ICCV, 2003 ACM-AAAI Allen Newell Award, 2016. National Academy of Sciences, 2015. Helmholtz Prize (1) for a Contribution That Has Stood the Test of Time, ICCV, 2001 Helmholtz Prize (2) for a Contribution That Has Stood the Test of Time, ICCV, 2001 Best student paper award, IEEE CVPR 2016 (adviser) King-Sun Fu Prize of the International Association of Pattern Recognition, 2014. -
Learning to Detect Natural Image Boundaries Using Local Brightness, Color, and Texture Cues David Martin, Charless Fowlkes, Jitendra Malik
SUBMITTED TO IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 1 Learning to Detect Natural Image Boundaries Using Local Brightness, Color, and Texture Cues David Martin, Charless Fowlkes, Jitendra Malik Abstract— The goal of this work is to accurately detect and localize boundaries in natural scenes using local image measurements. We formu- late features that respond to characteristic changes in brightness, color, and texture associated with natural boundaries. In order to combine the infor- mation from these features in an optimal way, we train a classifier using hu- man labeled images as ground truth. The output of this classifier provides the posterior probability of a boundary at each image location and orienta- tion. We present precision-recall curves showing that the resulting detector significantly outperforms existing approaches. Our two main results are (1) that cue combination can be performed adequately with a simple linear model, and (2) that a proper, explicit treatment of texture is required to detect boundaries in natural images. Keywords— texture, supervised learning, cue combination, natural im- ages, ground truth segmentation dataset, boundary detection, boundary lo- calization I. INTRODUCTION ONSIDER the images and human-marked boundaries shown in Figure 1. How might we find these boundaries automatically? We distinguish the problem of boundary detection from what is classically referred to as edge detection. A boundary is a con- tour in the image plane that represents a change in pixel owner- ship from one object or surface to another. In contrast, an edge is most often defined as an abrupt change in some low-level image feature such as brightness or color. -
Submission Data for 2017 CORE Conference Re-Ranking Process Computer Vision and Pattern Recognition
Submission Data for 2017 CORE conference Re-ranking process Computer Vision and Pattern Recognition Submitted by: Victor Lempitsky [email protected] Supported by: Victor Lempitsky, Andrew Zisserman, Ivan Laptev, Alexei Efros Conference Details Conference Title: Computer Vision and Pattern Recognition Acronym: CVPR Requested Rank Requested Rank: A* Requested For Codes For1: 0801 For2: For3: Recent Years Most Recent Year Year: 2017 URL: http://cvpr2017.thecvf.com/ Papers submitted: 2680 Papers published: 783 Acceptance rate: 29 Source for acceptance rate: http://cvpr2017.thecvf.com/program/main_conference Program Chairs Name: Jim Rehg Affiliation: Georgia Institute of Technology H index: 62 Google Scholar URL: https://scholar.google.ru/citations?user=8kA3eDwAAAAJ&hl=en&oi=ao DBLP URL: http://dblp2.uni-trier.de/pers/hd/r/Rehg:James_M= Name: Yanxi Liu Affiliation: Pennsylvania State University H index: 42 Google Scholar URL: DBLP URL: Name: Ying Wu Affiliation: Northwestern University H index: 58 Google Scholar URL: DBLP URL: Name: Camillo Taylor Affiliation: University of Pennsylvania H index: 49 Google Scholar URL: DBLP URL: 1 General Chairs Name: Rama Chellappa Affiliation: University of Maryland H index: 100 Google Scholar URL: https://scholar.google.com/citations?user=mZxsTCcAAAAJ DBLP URL: http://dblp.uni-trier.de/pers/hd/c/Chellappa:Rama Name: Zhengyou Zhang Affiliation: Microsoft Research H index: 70 Google Scholar URL: DBLP URL: Name: Anthony Hoogs Affiliation: Kitware Inc H index: 21 Google Scholar URL: DBLP URL: Second Most Recent Year -
Efficient Classification for Additive Kernel Svms
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 1 Efficient Classification for Additive Kernel SVMs Subhransu Maji1, Alexander C. Berg2, and Jitendra Malik1 [email protected], [email protected], [email protected] 1Computer Science Division, EECS 2Computer Science Department, University of California, Berkeley Stony Brook University Abstract—We show that a class of non-linear kernel SVMs admit approximate classifiers with run-time and memory complexity that is independent of the number of support vectors. This class of kernels which we refer to as additive kernels, include the widely used kernels for histogram based image comparison like intersection and chi-squared kernels. Additive kernel SVMs can offer significant improvements in accuracy over linear SVMs on a wide variety of tasks while having the same run-time, making them practical for large scale recognition or real-time detection tasks. We present experiments on a variety of datasets including the INRIA person, Daimler-Chrysler pedestrians, UIUC Cars, Caltech-101, MNIST and USPS digits, to demonstrate the effectiveness of our method for efficient evaluation of SVMs with additive kernels. Since its introduction, our method has become integral to various state of the art systems for PASCAL VOC object detection/image classification, ImageNet Challenge, TRECVID, etc. The techniques we propose can also be applied to settings where evaluation of weighted additive kernels is required, which include kernelized versions of PCA, LDA, regression, k-means, as well as speeding up the inner loop of SVM classifier training algorithms.