Patrick S. Huggins
Curriculum Vitae


Also available as [PDF] and [ASCII]

Yale University
Department of Computer Science
P.O. Box 208285
New Haven, CT 06520
(203) 432-1274 office
(203) 432-0593 fax
(203) 415-1437 cell
http://www.cs.yale.edu/~huggins
huggins@cs.yale.edu

Research Interests

Signal processing, neural computation, computational geometry, optimization, data compression, machine learning, computer vision and pattern recognition

Education

Ph.D. December 2005 Computer Science, Yale University
Dissertation: Sparse Coding via Geometry
Advisor: Steven W. Zucker
B.A. 1997 Mathematics and Computer Science, New York University
Graduated magna cum laude

Research Experience

2005 - Present
Postdoctoral Associate, DEPARTMENT OF COMPUTER SCIENCE, YALE UNIVERSITY
My research focuses on developing computational geometry algorithms to solve problems in signal processing and neural computation, including data compression, nonnegative matrix factorization, and linear programming.
1998 - 2005
Research Assistant, DEPARTMENT OF COMPUTER SCIENCE, YALE UNIVERSITY
Designed computer vision algorithms for edge classification, edge detection, and shape-from- shading, and general purpose pattern recognition algorithms for classification. Developed a geometric approach to the sparse coding problem, including a novel algorithm for linear programming.

Teaching Experience

1998 - 2003
Teaching Assistant, DEPARTMENT OF COMPUTER SCIENCE, YALE UNIVERSITY
Tutored students in office hours, led review sessions, developed and graded exams and assignments, prepared solutions, and lectured.
Courses included:
1996 - 1997
University Tutor, College of Arts and Sciences, New York University
Tutored students in mathematics, computer science, biology, and physics.

Publications

JOURNAL PAPERS
  1. P.S. Huggins and S.W. Zucker (2006). “On the geometry of sparse coding.” In preparation.
  2. P.S. Huggins and S.W. Zucker (2006). “Greedy basis pursuit.” Submitted.
  3. O. Ben-Shahar, P.S. Huggins, T. Izo, and S.W. Zucker (2003). “Cortical connections and early visual function: intra- and inter-columnar processing.” Journal of Physiology-Paris, 97(2-3).
REFEREED CONFERENCE AND WORKSHOP PAPERS
  1. P. Drineas, E. Drinea, and P.S. Huggins (2003). “An experimental evaluation of a Monte-Carlo algorithm for singular value decomposition.” In Y. Manolopoulos, S. Evripidou, and A. Kakas (Eds.), Advances in Informatics. Post-proceedings of the 8th Panhellenic Conference in Informatics. LNCS 2563. Berlin: Springer.
  2. O. Ben-Shahar, P.S. Huggins, and S.W. Zucker (2002). “On computing visual flows with boundaries: the case of shading and edges.” In H.H. Bülthoff, S.-W. Lee, T.A. Poggio, and C. Wallraven (Eds.), Biologically Motivated Computer Vision. Second International Workshop, BMCV 2002, Tübingen, Germany, November 22-24, 2002. Proceedings. LNCS 2525. Pages 189-198. Berlin: Springer.
  3. P.S. Huggins and S.W. Zucker (2002). “Representing edge models via local principal component analysis.” In A. Heyden, G. Sparr, M. Nielsen, and P. Johansen (Eds.), Computer Vision - ECCV 2002. 7th European Conference on Computer Vision, Copenhagen, Denmark, May 28-31, 2002. Proceedings, Part I. LNCS 2350. Pages 384-398. Berlin: Springer.
  4. P.S. Huggins, H.F. Chen, P.N. Belhumeur, and S.W. Zucker (2001). “Finding folds: on the appearance and identification of occlusion.” In CVPR 2001. Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 8-14 December 2001, Kauai, Hawaii, USA. Volume 2. Pages 718-125. Los Alamitos, CA: The IEEE Computer Society.
  5. E. Drinea, P. Drineas, and P.S. Huggins (2001). “A randomized singular value decomposition algorithm for image processing.” In Y. Manolopoulos and S. Evripidou (Eds.), Proceedings of the 8th Panhellenic Conference on Informatics. Nicosia, Cyprus, November 8-10, 2001. Athens: Livanis.
  6. P.S. Huggins and S.W. Zucker (2001). “Folds and cuts: how shading flows into edges.” In ICCV 2001. Proceedings, Eighth IEEE International Conference on Computer Vision, July 7-14, 2001, Vancouver, British Columbia, Canada. Volume II. Pages 153-158. Los Alamitos, CA: The IEEE Computer Society.
  7. P.S. Huggins and S.W. Zucker (2001). “How folds cut a scene.” In C. Arcelli, L.P. Cordella, and G. Sanniti de Baja (Eds.), Visual Form 2001. 4th International Workshop on Visual Form, IWVF4, Capri, Italy, May 2001. Proceedings. LNCS 2059. Pages 323-332. Berlin: Springer.

Presentations

  1. “Signal processing via linear programming,” Yale University, Department of Computer Science, Graduate Student Theory Clique, January 2006, New Haven.
  2. “A geometric interpretation of sparse coding,” Drexel University, Department of Computer Science, Computer Science Colloquium Series, February 2005, Philadelphia.
  3. “On the geometry of sparse coding,” Overcomplete Representations, NIPS 2004 Workshop, December 2004, Whistler.
  4. “Representing edges with nonlinear manifolds,” Yale University, Applied Mathematics Seminar, October 2002, New Haven.
  5. “Representing edge models via local principal component analysis,” 7th European Conference on Computer Vision, May 2002, Copenhagen.
  6. “Finding folds: on the appearance and identification of occlusion,” The 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, December 2001, Kauai.
  7. “Folds and cuts: How shading flows into edges,” Eighth IEEE International Conference on Computer Vision July 2001, Vancouver.
  8. “How folds cut a scene,” 4th International Workshop on Visual Form, May 2001, Capri.
  9. “Photometric statistics of occlusion edges,” The Learning Workshop, Snowbird, Utah, April 10-13, 2001.
  10. “Folds and cuts: Shading and the perception of occlusion,” Yale University, Department of Computer Science, Vision Lunch, November 2000, New Haven.

Professional Activities

  • Reviewer for the IEEE International Conference on Computer Vision (2001,2003,2005), the IEEE Conference on Computer Vision and Pattern Recognition (2001,2003,2005), the Asian Conference on Computer Vision (2004), the European Conference on Computer Vision (2004,2006), the International Journal of Computer Vision, and the IEEE Transactions on Pattern Analysis and Machine Intelligence
  • Member of the IEEE and the ACM

Honors and Awards

  • Yale University Fellowship, 1997-98
  • Senior Year Mathematics Prize, 1997
    Courant Institute of Mathematical Sciences, New York University
  • The Ophelia Harper Memorial Award, 1997
    “For service to the University”, New York University
  • Phi Beta Kappa, Elected 1996
  • Dean's List, 1993-97, New York University
  • University Scholar, 1993-97, Vice President, 1995-97, New York University

Employment

1996-1997 Intern, Marketing Technologies Group
Designed and developed custom multidimensional databases for Fortune 500 companies.
Provided internal system administration, hardware support, and programming.
1995-1997 Intern, Scholastic Inc.
Wrote and researched features and articles for educational mathematics magazines for children,
used in classrooms(K-12) across the US.

Computer Skills

Matlab, Mathematica, C/C++, Perl, Python, Visual Basic, PostgreSQL, MySql;
some Java, Fortran, and Lisp

Personal Information

Date of Birth: February 15, 1976
Nationality: UK citizen, US permanent resident
Languages: English, basic French

References

Available upon request.