• Publications
  • Influence
A Computational Approach to Edge Detection
  • J. Canny
  • Mathematics, Computer Science
  • IEEE Transactions on Pattern Analysis and Machine…
  • 1 June 1986
TLDR
There is a natural uncertainty principle between detection and localization performance, which are the two main goals, and with this principle a single operator shape is derived which is optimal at any scale. Expand
Planning optimal grasps
  • C. Ferrari, J. Canny
  • Engineering, Computer Science
  • Proceedings IEEE International Conference on…
  • 12 May 1992
TLDR
Two general optimality criteria that consider the total finger force and the maximum finger force are introduced and discussed and the geometric interpretation of the two criteria leads to an efficient planning algorithm. Expand
Some algebraic and geometric computations in PSPACE
  • J. Canny
  • Mathematics, Computer Science
  • STOC '88
  • 1988
TLDR
A PSPACE algorithm for determining the signs of multivariate polynomials at the common zeros of a system of polynomial equations is given and it is shown that the existential theory of the real numbers can be decided in PSPACE. Expand
The complexity of robot motion planning
  • J. Canny
  • Computer Science
  • 13 September 1988
TLDR
John Canny resolves long-standing problems concerning the complexity of motion planning and, for the central problem of finding a collision free path for a jointed robot in the presence of obstacles, obtains exponential speedups over existing algorithms by applying high-powered new mathematical techniques. Expand
Finding Edges and Lines in Images
Abstract : The problem of detecting intensity changes in images is canonical in vision. Edge detection operators are typically designed to optimally estimate first or second derivative over someExpand
Collaborative filtering with privacy via factor analysis
  • J. Canny
  • Computer Science
  • SIGIR '02
  • 11 August 2002
TLDR
A new method for collaborative filtering which protects the privacy of individual data is described, based on a probabilistic factor analysis model, which has other advantages in speed and storage over previous algorithms. Expand
Collaborative filtering with privacy
  • J. Canny
  • Computer Science
  • Proceedings IEEE Symposium on Security and…
  • 12 May 2002
TLDR
This work describes an algorithm whereby a community of users can compute a public "aggregate" of their data that does not expose individual users' data, and uses homomorphic encryption to allow sums of encrypted vectors to be computed and decrypted without exposing individual data. Expand
New lower bound techniques for robot motion planning problems
  • J. Canny, J. Reif
  • Computer Science
  • 28th Annual Symposium on Foundations of Computer…
  • 12 October 1987
TLDR
The problem of finding a sequence of commanded velocities which is guaranteed to move the point to the goal is shown to be non-deterministic exponential time hard, making it the first provably intractable problem in robotics. Expand
GaP: a factor model for discrete data
  • J. Canny
  • Computer Science
  • SIGIR '04
  • 25 July 2004
TLDR
The GaP model projects documents and terms into a low-dimensional space of "themes," and models texts as "passages" of terms on the same theme, and gives very accurate results as a probabilistic model (measured via perplexity) and as a retrieval model. Expand
A fast algorithm for incremental distance calculation
  • Ming C. Lin, J. Canny
  • Computer Science, Mathematics
  • Proceedings. IEEE International Conference on…
  • 9 April 1991
TLDR
A simple and efficient algorithm for finding the closest points between two convex polynomials is described and can be used for collision detection, computation of the distance between two polyhedra in three-dimensional space, and other robotics problems. Expand
...
1
2
3
4
5
...