John F. Canny
He received his B.Sc. in Computer Science and Theoretical Physics from Adelaide University in South Australia, 1979, a B.E. (Hons) in Electrical Engineering, Adelaide University, 1980, an M.S. and a Ph.D. from M.I.T, 1983 and 1987, respectively. He joined the faculty of EECS in 1987.
- D. T. Nguyen and J. F. Canny, "MultiView: Improving trust in group video conferencing through spatial faithfulness (Best Paper Prize)," in Proc. 2007 SIGCHI Conf. on Human Factors in Computing Systems (CHI '07), New York, NY: The Association for Computing Machinery, Inc., 2007, pp. 1465-1474.
- J. Wang, S. Zhai, and J. F. Canny, "Camera phone based motion sensing: Interaction techniques, applications and performance study," in Proc. 19th Annual ACM Symp. on User Interface Software and Technology, New York, NY: ACM Press, 2006, pp. 101-110.
- M. Davis, M. Smith, J. F. Canny, N. Good, S. King, and R. Janakiraman, "Towards context-aware face recognition," in Proc. 13th Annual ACM Intl. Conf. on Multimedia, New York, NY: ACM Press, 2005, pp. 483-486.
- J. F. Canny, "Collaborative filtering with privacy," in Proc. 2002 IEEE Symp. on Security and Privacy, Los Alamitos, CA: IEEE Computer Society Press, 2002, pp. 45-57.
- E. Paulos and J. F. Canny, "Social tele-embodiment: Understanding presence," Autonomous Robots, vol. 11, no. 1, pp. 87-95, July 2001.
- D. S. Reznik and J. F. Canny, "C'mon part, do the local motion!," in Proc. 2001 IEEE Intl. Conf. on Robotics and Automation, Vol. 3, Piscataway, NJ: IEEE Society Press, 2001, pp. 2235-2242.
- K. Goldberg, B. V. Mirtich, Y. Zhuang, J. Craig, B. R. Carlisle, and J. F. Canny, "Part pose statistics: Estimators and experiments," IEEE Trans. Robotics and Automation, vol. 15, no. 5, pp. 849-857, Oct. 1999.
- I. Z. Emiris and J. F. Canny, "Efficient incremental algorithms for the sparse resultant and the mixed volume," J. Symbolic Computation, vol. 20, no. 2, pp. 117-149, Aug. 1995.
- J. F. Canny and M. C. Lin, "An opportunistic global path planner," Algorithmica, vol. 10, no. 2-4, pp. 102-120, Aug. 1993.
- D. Manocha and J. F. Canny, "Multipolynomial resultant algorithms," J. Symbolic Computation, vol. 15, no. 2, pp. 99-122, Feb. 1993.
- Z. Li and J. F. Canny, Eds., Nonholonomic Motion Planning, The Springer International Series in Engineering and Computer Science. Robotics: Vision, Manipulation and Sensors, Vol. 192, Boston, MA: Kluwer Academic Publishers/Springer, 1993.
- M. C. Lin and J. F. Canny, "A fast algorithm for incremental distance calculation," in Proc. 1991 IEEE Intl. Conf. on Robotics and Automation, Vol. 2, Los Alamitos, CA: IEEE Computer Society Press, 1991, pp. 1008-1014.
- J. F. Canny, "Generalized characteristic polynomials," J. Symbolic Computation, vol. 9, no. 3, pp. 241-250, March 1990.
- J. F. Canny, E. Kaltofen, and L. Yagati, "Solving systems of nonlinear polynomial equations faster," in Proc. ACM-SIGSAM 1989 Intl. Symp. on Symbolic and Algebraic Computation, G. H. Gonnet, Ed., New York, NY: ACM Press, 1989, pp. 121-128.
- J. F. Canny, The Complexity of Robot Motion Planning, The ACM Distinguished Dissertation Series, Cambridge, MA: The MIT Press, 1988.
- J. F. Canny, "2002 AAAI Classic Paper Award winner: A variational approach to edge detection," in Proc. 3rd Natl. Conf. on Artificial Intelligence (AAAI-83), M. R. Genesereth, Ed., Cambridge, MA: AAAI Press/MIT Press, 1983, pp. 54-58.