Canny, John
Overview
Works:  45 works in 108 publications in 3 languages and 1,456 library holdings 

Genres:  Handbooks and manuals Academic theses Conference papers and proceedings Outlines and syllabi 
Roles:  Author, Editor, Creator, Other 
Classifications:  Q335, 006.3 
Publication Timeline
.
Most widely held works about
John Canny
Most widely held works by
John Canny
Artificial intelligence : a modern approach by
Stuart J Russell(
Book
)
12 editions published between 1995 and 2003 in English and held by 630 WorldCat member libraries worldwide
Presents a guide to artificial intelligence, covering such topics as intelligent agents, problemsolving, logical agents, planning, uncertainty, learning, and robotics
12 editions published between 1995 and 2003 in English and held by 630 WorldCat member libraries worldwide
Presents a guide to artificial intelligence, covering such topics as intelligent agents, problemsolving, logical agents, planning, uncertainty, learning, and robotics
The complexity of robot motion planning by
John Canny(
Book
)
15 editions published between 1987 and 1988 in English and held by 314 WorldCat member libraries worldwide
15 editions published between 1987 and 1988 in English and held by 314 WorldCat member libraries worldwide
Nonholonomic motion planning by
Zexiang Li(
Book
)
13 editions published in 1993 in English and held by 170 WorldCat member libraries worldwide
Nonholonomic Motion Planning grew out of the workshop that took place at the 1991 IEEE International Conference on Robotics and Automation. It consists of contributed chapters representing new developments in this area. Contributors to the book include robotics engineers, nonlinear control experts, differential geometers and applied mathematicians. Nonholonomic Motion Planning is arranged into three chapter groups: Controllability: one of the key mathematical tools needed to study nonholonomic motion. Motion Planning for Mobile Robots: in this section the papers are focused on problems with nonholonomic velocity constraints as well as constraints on the generalized coordinates. Falling Cats, Space Robots and Gauge Theory: there are numerous connections to be made between symplectic geometry techniques for the study of holonomies in mechanics, gauge theory and control. In this section these connections are discussed using the backdrop of examples drawn from space robots and falling cats reorienting themselves. Nonholonomic Motion Planning can be used either as a reference for researchers working in the areas of robotics, nonlinear control and differential geometry, or as a textbook for a graduate level robotics or nonlinear control course
13 editions published in 1993 in English and held by 170 WorldCat member libraries worldwide
Nonholonomic Motion Planning grew out of the workshop that took place at the 1991 IEEE International Conference on Robotics and Automation. It consists of contributed chapters representing new developments in this area. Contributors to the book include robotics engineers, nonlinear control experts, differential geometers and applied mathematicians. Nonholonomic Motion Planning is arranged into three chapter groups: Controllability: one of the key mathematical tools needed to study nonholonomic motion. Motion Planning for Mobile Robots: in this section the papers are focused on problems with nonholonomic velocity constraints as well as constraints on the generalized coordinates. Falling Cats, Space Robots and Gauge Theory: there are numerous connections to be made between symplectic geometry techniques for the study of holonomies in mechanics, gauge theory and control. In this section these connections are discussed using the backdrop of examples drawn from space robots and falling cats reorienting themselves. Nonholonomic Motion Planning can be used either as a reference for researchers working in the areas of robotics, nonlinear control and differential geometry, or as a textbook for a graduate level robotics or nonlinear control course
Künstliche Intelligenz : ein moderner Ansatz by
Stuart J Russell(
Book
)
2 editions published between 2004 and 2007 in German and held by 162 WorldCat member libraries worldwide
Die dritte Auflage dieses InformatikKlassikers wurde von Grund auf komplett überarbeitet und an die neuesten Entwicklungen der KI angepasst. Die Autoren verstehen es dabei, die KI in ihrem ganzen Themenspektrum für die Studierenden verständlich und nachvollziehbar dazustellen. Sie behandeln alle relevanten Aspekte der KI von der Logik und der Wahrscheinlichkeitstheorie über den Bereich des Wahrnehmens, Denkens, Lernens und Handelns bis zu mikroelektronischen Geräten und Robotern. Erweitert um moderne Such und Sprachalgorithmen sowie Lernen mit neuronalen Netzen setzt diese Werk einen neuen S
2 editions published between 2004 and 2007 in German and held by 162 WorldCat member libraries worldwide
Die dritte Auflage dieses InformatikKlassikers wurde von Grund auf komplett überarbeitet und an die neuesten Entwicklungen der KI angepasst. Die Autoren verstehen es dabei, die KI in ihrem ganzen Themenspektrum für die Studierenden verständlich und nachvollziehbar dazustellen. Sie behandeln alle relevanten Aspekte der KI von der Logik und der Wahrscheinlichkeitstheorie über den Bereich des Wahrnehmens, Denkens, Lernens und Handelns bis zu mikroelektronischen Geräten und Robotern. Erweitert um moderne Such und Sprachalgorithmen sowie Lernen mit neuronalen Netzen setzt diese Werk einen neuen S
Intelligenza artificiale : un approccio moderno by
Stuart J Russell(
Book
)
1 edition published in 1998 in Italian and held by 21 WorldCat member libraries worldwide
1 edition published in 1998 in Italian and held by 21 WorldCat member libraries worldwide
UbiComp '13 : proceedings of the 2013 ACM International Joint Conference on Pervasive and Ubiquitous Computing : September
812, 2013, Zurich, Switzerland by UbiComp (Conference)(
)
1 edition published in 2013 in English and held by 17 WorldCat member libraries worldwide
1 edition published in 2013 in English and held by 17 WorldCat member libraries worldwide
Finding edges and lines in images by
John Canny(
Book
)
5 editions published in 1983 in English and held by 16 WorldCat member libraries worldwide
5 editions published in 1983 in English and held by 16 WorldCat member libraries worldwide
UbiComp '13 : Adjunct Adjunct Publication of the 2013 ACM Conference on Ubiquitous Computing : September 812, 2013, Zurich,
Switzerland by
UbiComp (Conference)(
)
1 edition published in 2013 in English and held by 14 WorldCat member libraries worldwide
1 edition published in 2013 in English and held by 14 WorldCat member libraries worldwide
Some algebraic and geometric computations in PSPACE by
John Canny(
Book
)
2 editions published in 1988 in English and held by 8 WorldCat member libraries worldwide
We give a PSPACE algorithm for determining the signs of multivariate polynomials at the common zeros of a system of polynomial equations. One of the consequences of this result is that the "Generalized Movers' Problem" in robotics drops from EX PTIME into PSPACE, and is therefore PSPACEcomplete by a previous hardness result [Rei]. We also show that the existential theory of the real numbers can be decided in PSPACE. Other geometric problems that also drop into PSPACE inlcude the 3d Euclidean Shortest Path Problem, and the "2d Asteroid Avoidance Problem" described in [RS]. Our method combines the theorem of the primitive element from classical algebra with a symbolic polynomial evaluation lemma from [BKR]. A decision problem involving several algebraic numbers is reduced to a problem involving a single algebraic number or primitive element, which rationally generates all the given algebraic numbers
2 editions published in 1988 in English and held by 8 WorldCat member libraries worldwide
We give a PSPACE algorithm for determining the signs of multivariate polynomials at the common zeros of a system of polynomial equations. One of the consequences of this result is that the "Generalized Movers' Problem" in robotics drops from EX PTIME into PSPACE, and is therefore PSPACEcomplete by a previous hardness result [Rei]. We also show that the existential theory of the real numbers can be decided in PSPACE. Other geometric problems that also drop into PSPACE inlcude the 3d Euclidean Shortest Path Problem, and the "2d Asteroid Avoidance Problem" described in [RS]. Our method combines the theorem of the primitive element from classical algebra with a symbolic polynomial evaluation lemma from [BKR]. A decision problem involving several algebraic numbers is reduced to a problem involving a single algebraic number or primitive element, which rationally generates all the given algebraic numbers
Implicitizing rational parametric surfaces by
Dinesh N Manocha(
Book
)
2 editions published in 1990 in English and held by 8 WorldCat member libraries worldwide
The separation of these extraneous factors can be a time consuming task involving multivariate factorization. Furthermore, these algorithms fail altogether if the given parametrization has base points. The parametrizations of many commonly used rational surfaces, like the quadrics and some cubics, have base points. In this paper we present an algorithm to implicitize parametric surfaces. If a parametrization has no base points, we formulate the parametric equations in such a manner that their resultant corresponds exactly to the implicit equation without generating any extraneous factor. We also analyze the problem of implicitization in the presence of base points
2 editions published in 1990 in English and held by 8 WorldCat member libraries worldwide
The separation of these extraneous factors can be a time consuming task involving multivariate factorization. Furthermore, these algorithms fail altogether if the given parametrization has base points. The parametrizations of many commonly used rational surfaces, like the quadrics and some cubics, have base points. In this paper we present an algorithm to implicitize parametric surfaces. If a parametrization has no base points, we formulate the parametric equations in such a manner that their resultant corresponds exactly to the implicit equation without generating any extraneous factor. We also analyze the problem of implicitization in the presence of base points
Detecting cusps and inflection points in curves by
Dinesh N Manocha(
Book
)
1 edition published in 1990 in English and held by 8 WorldCat member libraries worldwide
Abstract: "In many applications it is desirable to analyze parametric curves for undesirable features like cusps and inflection points. Previously known methods to analyze such features are limited to cubics and in many cases are for planar curves only. We present a general purpose method to detect cusps in polynomial or rational space curves of arbitrary degree. If a curve has no cusp in its defining interval, it has a regular parametrization and our algorithm computes that. In particular, we show that if a curve has a proper parametrization then the necessary and sufficient condition for the existence of cusps is given by the vanishing of the first derivative vector
1 edition published in 1990 in English and held by 8 WorldCat member libraries worldwide
Abstract: "In many applications it is desirable to analyze parametric curves for undesirable features like cusps and inflection points. Previously known methods to analyze such features are limited to cubics and in many cases are for planar curves only. We present a general purpose method to detect cusps in polynomial or rational space curves of arbitrary degree. If a curve has no cusp in its defining interval, it has a regular parametrization and our algorithm computes that. In particular, we show that if a curve has a proper parametrization then the necessary and sufficient condition for the existence of cusps is given by the vanishing of the first derivative vector
Finding edges and lines in images by
John Canny(
Book
)
8 editions published in 1983 in English and held by 8 WorldCat member libraries worldwide
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 some (usually small) support. Other criteria such as output signal to noise ratio or bandwidth have also been been argued for. This thesis is an attempt to formulate a set of edge detection criteria that capture as directly as possible the desirable properties of an edge operator. Variational techniques are used to find a solution over the space of all linear shift invariant operators. The first criterion is that the detector have low probability of error i.e. failing to mark edges or falsely marking nonedges. The second is that the marked points should b The third criterion is that there should be low probability of more than one response to a single edge. The technique is used to find optimal operators for step edges and for extended impulse profiles (ridges or valleys in two dimensions). The extension of the one dimensional operators to two dimensions is then discussed. The result is a set of operators of varying width, length and orientation. The problem of combining these outputs into a single description is discussed, and a set of heuristics for the integration are given. (Author)
8 editions published in 1983 in English and held by 8 WorldCat member libraries worldwide
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 some (usually small) support. Other criteria such as output signal to noise ratio or bandwidth have also been been argued for. This thesis is an attempt to formulate a set of edge detection criteria that capture as directly as possible the desirable properties of an edge operator. Variational techniques are used to find a solution over the space of all linear shift invariant operators. The first criterion is that the detector have low probability of error i.e. failing to mark edges or falsely marking nonedges. The second is that the marked points should b The third criterion is that there should be low probability of more than one response to a single edge. The technique is used to find optimal operators for step edges and for extended impulse profiles (ridges or valleys in two dimensions). The extension of the one dimensional operators to two dimensions is then discussed. The result is a set of operators of varying width, length and orientation. The problem of combining these outputs into a single description is discussed, and a set of heuristics for the integration are given. (Author)
Generalized characteristic polynomials by
John Canny(
Book
)
1 edition published in 1988 in English and held by 7 WorldCat member libraries worldwide
We generalize the notion of characteristic polynomial for a system of linear equations to systems of multivariate polynomial equations. The generalizaiton is natural in the sense that it reduces to the usual definition when all the polynomials are linear. Whereas the constant coefficient ofthe general characteristic polynomial is the resultant of the system. This construction is applied to solve a traditional problem with efficient methods for solving systems of polynomials, even in the presence of infinitely many solutions "at infinity". We give a singleexponential time method for finding all the isolated solution points of a system of polynomials, even in the presence of infinitely many solutions at infinity or elsewhere
1 edition published in 1988 in English and held by 7 WorldCat member libraries worldwide
We generalize the notion of characteristic polynomial for a system of linear equations to systems of multivariate polynomial equations. The generalizaiton is natural in the sense that it reduces to the usual definition when all the polynomials are linear. Whereas the constant coefficient ofthe general characteristic polynomial is the resultant of the system. This construction is applied to solve a traditional problem with efficient methods for solving systems of polynomials, even in the presence of infinitely many solutions "at infinity". We give a singleexponential time method for finding all the isolated solution points of a system of polynomials, even in the presence of infinitely many solutions at infinity or elsewhere
An efficient approach to removing geometric degeneracies by
Ioannis Z Emiris(
Book
)
2 editions published in 1991 in English and held by 7 WorldCat member libraries worldwide
Abstract: "We wish to increase the power of an arbitrary geometric algorithm designed for nondegenerate input, by allowing it to execute over arbitrary inputs. This paper describes a deterministic direct perturbation of the input which applies to algorithms whose branching decisions depend on determinants in the input parameters. We concentrate on four predicates that cover most important algorithms in computational geometry. The method alters the input parameters by infinitesimal amounts to guarantee that the perturbed input lies in general position. It is an attractive candidate for practical use, and is considerably simpler as well as more efficient than existing approaches
2 editions published in 1991 in English and held by 7 WorldCat member libraries worldwide
Abstract: "We wish to increase the power of an arbitrary geometric algorithm designed for nondegenerate input, by allowing it to execute over arbitrary inputs. This paper describes a deterministic direct perturbation of the input which applies to algorithms whose branching decisions depend on determinants in the input parameters. We concentrate on four predicates that cover most important algorithms in computational geometry. The method alters the input parameters by infinitesimal amounts to guarantee that the perturbed input lies in general position. It is an attractive candidate for practical use, and is considerably simpler as well as more efficient than existing approaches
Multipolynomial resultant algorithms by
Dinesh N Manocha(
Book
)
1 edition published in 1991 in English and held by 7 WorldCat member libraries worldwide
In this paper we present efficient techniques for applying multipolynomial resultant algorithms and show their effectiveness for manipulating system [sic] of polynomial equations. In particular, we present efficient algorithms for computing the resultant of a system of polynomial equations (whose coefficients may be symbolic variables). The algorithm can also be used for interpolating polynomials from their values and expanding symbolic determinants. Moreover, we use multipolynomial resultants for computing the real or complex solutions of nonlinear polynomial equations. It reduces the problem to computing eigenvalues of matirces [sic]. We also discuss implementation of these algorithms in the context of certain applications."
1 edition published in 1991 in English and held by 7 WorldCat member libraries worldwide
In this paper we present efficient techniques for applying multipolynomial resultant algorithms and show their effectiveness for manipulating system [sic] of polynomial equations. In particular, we present efficient algorithms for computing the resultant of a system of polynomial equations (whose coefficients may be symbolic variables). The algorithm can also be used for interpolating polynomials from their values and expanding symbolic determinants. Moreover, we use multipolynomial resultants for computing the real or complex solutions of nonlinear polynomial equations. It reduces the problem to computing eigenvalues of matirces [sic]. We also discuss implementation of these algorithms in the context of certain applications."
Rational curves with polynomial parametrization by
Dinesh N Manocha(
Book
)
2 editions published in 1990 in English and held by 6 WorldCat member libraries worldwide
Abstract: "Rational curves and splines are one of the building blocks of computer graphics and geometric modeling. Although a rational curve is more flexible than its polynomial counterpart, many properties of polynomial curves are not applicable to it. For this reason it is very useful to know if a curve presented as a rational space curve has a polynomial parametrization. In this paper, we present an algorithm to decide if a polynomial parametrization exists, and to compute the parametrization. In algebraic geometry it is known that a rational algebraic curve is polynomially parametrizable iff [sic] it has one place at infinity
2 editions published in 1990 in English and held by 6 WorldCat member libraries worldwide
Abstract: "Rational curves and splines are one of the building blocks of computer graphics and geometric modeling. Although a rational curve is more flexible than its polynomial counterpart, many properties of polynomial curves are not applicable to it. For this reason it is very useful to know if a curve presented as a rational space curve has a polynomial parametrization. In this paper, we present an algorithm to decide if a polynomial parametrization exists, and to compute the parametrization. In algebraic geometry it is known that a rational algebraic curve is polynomially parametrizable iff [sic] it has one place at infinity
Nonholonomic motion planning(
Book
)
1 edition published in 1993 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1993 in English and held by 5 WorldCat member libraries worldwide
Impulsebased dynamic simulation by Brian Mirtich(
Book
)
1 edition published in 1994 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1994 in English and held by 5 WorldCat member libraries worldwide
Efficient incremental algorithms for the sparse resultant and the mixed volume by Ioannis Zacharias Emiris(
Book
)
1 edition published in 1994 in English and held by 5 WorldCat member libraries worldwide
1 edition published in 1994 in English and held by 5 WorldCat member libraries worldwide
On the complexity of Kinodymamic planning by
John Canny(
Book
)
3 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
In robotics, kinodynamic planning attempts to solve a motion problem subject to simultaneous kinematic and dynamic constraints. We consider the following problem: given a robot system, find a minimaltime trajectory from a start position and velocity to a goal position and velocity, while avoiding obstacles and respecting dynamic constraints on velocity and acceleration. We consider the simplified case of a point mass under Newtonian mechanics, together with velocity and acceleration bounds. The point must be flown from a start to a goal, amidst polyhedral obstacles in 2D or 3D. While exact solutions to this problem are not known, we provide the first provably good approximation algorithm, and show that it runs in polynomial time
3 editions published in 1988 in English and held by 4 WorldCat member libraries worldwide
In robotics, kinodynamic planning attempts to solve a motion problem subject to simultaneous kinematic and dynamic constraints. We consider the following problem: given a robot system, find a minimaltime trajectory from a start position and velocity to a goal position and velocity, while avoiding obstacles and respecting dynamic constraints on velocity and acceleration. We consider the simplified case of a point mass under Newtonian mechanics, together with velocity and acceleration bounds. The point must be flown from a start to a goal, amidst polyhedral obstacles in 2D or 3D. While exact solutions to this problem are not known, we provide the first provably good approximation algorithm, and show that it runs in polynomial time
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links
Associated Subjects
Algebraic number theory Algorithms Artificial intelligence Artificial intelligenceData processing Artificial intelligenceStudy and teaching Automatic control Automation Canny, John Communication Computer engineering Computer graphics Computers, Pipeline Computer science Computer simulation Computer vision Contextaware computing Curves, Plane Electrical engineering Engineering GeometryData processing Image processing Image processingMathematical models Learning Mechatronics Planning Pocket computers Polynomials Polytopes Reasoning Robotics Robots RobotsDynamics RobotsMotion Sparse matrices Thought and thinking Ubiquitous computing Wearable computers