Huttenlocher, Daniel P.
Overview
Works:  35 works in 49 publications in 1 language and 445 library holdings 

Roles:  Author 
Classifications:  TA1632, 621.367 
Publication Timeline
.
Most widely held works by
Daniel P Huttenlocher
Object recognition by computer : the role of geometric constraints by
William Eric Leifur Grimson(
Book
)
5 editions published in 1990 in English and held by 373 WorldCat member libraries worldwide
5 editions published in 1990 in English and held by 373 WorldCat member libraries worldwide
On planar point matching under affine transformation by
John E Hopcroft(
Book
)
3 editions published in 1989 in English and held by 5 WorldCat member libraries worldwide
Abstract: "An important geometric matching problem in machine vision and robotics is to determine whether there exists an affine transformation (a general linear transformation and a translation) that maps each point of a set A onto a corresponding point of a set B. In the case of matched cardinality point sets, we have developed an optimal [Theta](n log n) algorithm for determining the existence of such a transformation. The method makes use of the fact that an affine transformation preserves the center of gravity of a point set, as well as the ratios of triangle areas. If [formula] then there can be O(n[superscript 3]) affine transformations from A to B
3 editions published in 1989 in English and held by 5 WorldCat member libraries worldwide
Abstract: "An important geometric matching problem in machine vision and robotics is to determine whether there exists an affine transformation (a general linear transformation and a translation) that maps each point of a set A onto a corresponding point of a set B. In the case of matched cardinality point sets, we have developed an optimal [Theta](n log n) algorithm for determining the existence of such a transformation. The method makes use of the fact that an affine transformation preserves the center of gravity of a point set, as well as the ratios of triangle areas. If [formula] then there can be O(n[superscript 3]) affine transformations from A to B
Special issue on interpretation of 3D scenes(
Book
)
in English and held by 4 WorldCat member libraries worldwide
in English and held by 4 WorldCat member libraries worldwide
Finding convex edge groupings in an image by
Daniel P Huttenlocher(
Book
)
1 edition published in 1990 in English and held by 4 WorldCat member libraries worldwide
Examples are presented to illustrate that the technique finds intuitively salient groups, including for images of cluttered scenes."
1 edition published in 1990 in English and held by 4 WorldCat member libraries worldwide
Examples are presented to illustrate that the technique finds intuitively salient groups, including for images of cluttered scenes."
On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane by
Daniel P Huttenlocher(
Book
)
2 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We show that the dynamic Voronoi diagram of k sets of points in the plane, where each set consists of n points moving rigidly, has complexity O(n²k²[lambda subscript s](k)) for some fixed s, where [lambda subscript s](n) is the maximum length of a (n, s) DavenportSchinzel sequence. This improves the result of Aonuma et. al., who show an upper bound of O(n³k⁴log*k) for the complexity of such Voronoi diagrams. We then apply this result to the problem of finding the minimum Hausdorff distance between two point sets in the plane under Euclidean motion. We show that this distance can be computed in time 0((m + n)⁶log(mn)), where the two sets contain m and n points respectively."
2 editions published in 1992 in English and held by 4 WorldCat member libraries worldwide
Abstract: "We show that the dynamic Voronoi diagram of k sets of points in the plane, where each set consists of n points moving rigidly, has complexity O(n²k²[lambda subscript s](k)) for some fixed s, where [lambda subscript s](n) is the maximum length of a (n, s) DavenportSchinzel sequence. This improves the result of Aonuma et. al., who show an upper bound of O(n³k⁴log*k) for the complexity of such Voronoi diagrams. We then apply this result to the problem of finding the minimum Hausdorff distance between two point sets in the plane under Euclidean motion. We show that this distance can be computed in time 0((m + n)⁶log(mn)), where the two sets contain m and n points respectively."
The upper envelope of Voronoi surfaces and its applications by
Daniel P Huttenlocher(
Book
)
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
We derive bounds on the number of vertices on the upper envelope of a collection of Voronoi surfaces, and provide efficient algorithms to calculate these vertices. We then discuss applications of the methods to the aforementioned problems."
2 editions published in 1991 in English and held by 4 WorldCat member libraries worldwide
We derive bounds on the number of vertices on the upper envelope of a collection of Voronoi surfaces, and provide efficient algorithms to calculate these vertices. We then discuss applications of the methods to the aforementioned problems."
On invariants of sets of points or line segments under projection by
Daniel P Huttenlocher(
Book
)
2 editions published in 1992 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We consider the problem of computing invariant functions of the image of a set of points or line segments in R³ under projection. Such functions are in principle useful for machine vision systems, because they allow different images of a given geometric object to be described by an invariant 'key'. We show that if a geometric object consists of an arbitrary set of points or line segments in R³, and the object can undergo a general rotation, then there are no invariants of its image under projection. For certain constrained rotations, however, there are invariants (e.g., rotation about the viewing direction). Thus we precisely delimit the conditions for the existence or nonexistence of invariants of arbitrary sets of points or line segments under projection."
2 editions published in 1992 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We consider the problem of computing invariant functions of the image of a set of points or line segments in R³ under projection. Such functions are in principle useful for machine vision systems, because they allow different images of a given geometric object to be described by an invariant 'key'. We show that if a geometric object consists of an arbitrary set of points or line segments in R³, and the object can undergo a general rotation, then there are no invariants of its image under projection. For certain constrained rotations, however, there are invariants (e.g., rotation about the viewing direction). Thus we precisely delimit the conditions for the existence or nonexistence of invariants of arbitrary sets of points or line segments under projection."
Tracking nonrigid objects in complex scenes by
Daniel P Huttenlocher(
Book
)
2 editions published in 1992 in English and held by 3 WorldCat member libraries worldwide
There is no assumption, however, that the twodimensional image motion in successive frames will be small. Thus the method can track objects that move arbitrarily far in the image from one frame to the next."
2 editions published in 1992 in English and held by 3 WorldCat member libraries worldwide
There is no assumption, however, that the twodimensional image motion in successive frames will be small. Thus the method can track objects that move arbitrarily far in the image from one frame to the next."
Visuallyguided navigation by comparing twodimensional edge images by
Daniel P Huttenlocher(
Book
)
1 edition published in 1994 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We present a method for navigating a robot from an initial position to a specified landmark in its visual field, using a sequence of monocular images. The location of the landmark with respect to the robot is determined using the change in size and location of the landmark in the image, as a function of the motion of the robot. The landmark location is estimated after the first three images are taken, and this estimate is refined as the robot moves. The method can correct for errors in the robot motion, as well as navigate around obstacles. The obstacle avoidance is done using bump sensors, sonar and dead reckoning, rather than visual servoing. The method does not require prior calibration of the camera. We show some examples of the operation of the system."
1 edition published in 1994 in English and held by 3 WorldCat member libraries worldwide
Abstract: "We present a method for navigating a robot from an initial position to a specified landmark in its visual field, using a sequence of monocular images. The location of the landmark with respect to the robot is determined using the change in size and location of the landmark in the image, as a function of the motion of the robot. The landmark location is estimated after the first three images are taken, and this estimate is refined as the robot moves. The method can correct for errors in the robot motion, as well as navigate around obstacles. The obstacle avoidance is done using bump sensors, sonar and dead reckoning, rather than visual servoing. The method does not require prior calibration of the camera. We show some examples of the operation of the system."
Exploiting sequential phonetic constraints in recognizing spoken words by
Daniel P Huttenlocher(
Book
)
1 edition published in 1985 in English and held by 3 WorldCat member libraries worldwide
1 edition published in 1985 in English and held by 3 WorldCat member libraries worldwide
A multiresolution technique for comparing images using the Hausdorff distance by
Daniel P Huttenlocher(
Book
)
2 editions published in 1992 in English and held by 3 WorldCat member libraries worldwide
Abstract: "The Hausdorff distance measures the extent to which each point of a 'model' set lies near some point of an 'image' set and vice versa. In this paper we describe an efficient method of computing this distance, based on a multiresolution tessellation of the space of possible transformations of the model set. We focus on the case in which the model is allowed to translate and scale with respect to the image. This four dimensional transformation space (two translation and two scale dimensions) is searched rapidly, while guaranteeing that no match will be missed. We present some examples of identifying an object in a cluttered scene, including cases where the object is partially hidden from view."
2 editions published in 1992 in English and held by 3 WorldCat member libraries worldwide
Abstract: "The Hausdorff distance measures the extent to which each point of a 'model' set lies near some point of an 'image' set and vice versa. In this paper we describe an efficient method of computing this distance, based on a multiresolution tessellation of the space of possible transformations of the model set. We focus on the case in which the model is allowed to translate and scale with respect to the image. This four dimensional transformation space (two translation and two scale dimensions) is searched rapidly, while guaranteeing that no match will be missed. We present some examples of identifying an object in a cluttered scene, including cases where the object is partially hidden from view."
Comparing images using the Hausdorff distance under translation by
Daniel P Huttenlocher(
Book
)
1 edition published in 1991 in English and held by 3 WorldCat member libraries worldwide
In practice the methods are both highly efficient and simple to implement. The computation is in many ways similar to binary correlation, however it is more tolerant of perturbations in the locations of points because it measures proximity rather than exact superposition. We present a number of examples illustrating the operation of the approach, and compare it with correlation."
1 edition published in 1991 in English and held by 3 WorldCat member libraries worldwide
In practice the methods are both highly efficient and simple to implement. The computation is in many ways similar to binary correlation, however it is more tolerant of perturbations in the locations of points because it measures proximity rather than exact superposition. We present a number of examples illustrating the operation of the approach, and compare it with correlation."
Recognizing 3D objects from 2D images : an error analysis by
William Eric Leifur Grimson(
Book
)
1 edition published in 1992 in English and held by 3 WorldCat member libraries worldwide
Abstract: "Many recent object recognition systems use a small number of pairings of data and model features to compute the 3D transformation from a model coordinate frame into the sensor coordinate system. In the case of perfect image data, these systems seem to work well. With uncertain image data, however, the performance of such methods is less well understood. In this paper, we examine the effects of two dimensional sensor uncertainty on the computation of threedimensional model transformations. We use this analysis to bound the uncertainty in the transformation parameters, as well as the uncertainty associated with applying the transformation to map other model features into the image. We also examine the effects of the transformation uncertainty on the effectiveness of recognition methods."
1 edition published in 1992 in English and held by 3 WorldCat member libraries worldwide
Abstract: "Many recent object recognition systems use a small number of pairings of data and model features to compute the 3D transformation from a model coordinate frame into the sensor coordinate system. In the case of perfect image data, these systems seem to work well. With uncertain image data, however, the performance of such methods is less well understood. In this paper, we examine the effects of two dimensional sensor uncertainty on the computation of threedimensional model transformations. We use this analysis to bound the uncertainty in the transformation parameters, as well as the uncertainty associated with applying the transformation to map other model features into the image. We also examine the effects of the transformation uncertainty on the effectiveness of recognition methods."
Comparing point sets under projection by
Daniel P Huttenlocher(
Book
)
2 editions published in 1992 in English and held by 3 WorldCat member libraries worldwide
The basic issue is that for nearly all groups G, ̃ is not an equivalence relation (does not have an underlying invariant function). Despite this fact, however, ̃ does contain considerable geometric information. Thus we provide an algorithm for deciding whether P̃Q that runs in time O(n³), where n is the cardinality of the sets P and Q."
2 editions published in 1992 in English and held by 3 WorldCat member libraries worldwide
The basic issue is that for nearly all groups G, ̃ is not an equivalence relation (does not have an underlying invariant function). Despite this fact, however, ̃ does contain considerable geometric information. Thus we provide an algorithm for deciding whether P̃Q that runs in time O(n³), where n is the cardinality of the sets P and Q."
Governance in social media : a case study of the wikipedia promotion process by
Jurij Leskovec(
)
1 edition published in 2010 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2010 in English and held by 2 WorldCat member libraries worldwide
Predicting positive and negative links in online social networks by
Jurij Leskovec(
)
1 edition published in 2010 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2010 in English and held by 2 WorldCat member libraries worldwide
Effects of user similarity in social media predicting group growth and longevity(
)
1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide
Steering user behavior with badges(
)
1 edition published in 2013 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2013 in English and held by 2 WorldCat member libraries worldwide
Detecting moving objects with a moving camera by comparing edge contours by
Daniel P Huttenlocher(
Book
)
1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide
Abstract: "This paper introduces a method for detecting moving objects in a monocular image sequence that is obtained using a moving camera. The method first estimates the motion of the edge contours in a given image frame, by recovering a transformation that best matches each edge contour with the edges in the subsequent frame. Any contour that is not well accounted for by a single transformation is split into subparts. The transformation of each edge contour together with the relative spatial locations of the contours is used to partition the image into regions with similar motions. Hypotheses about the locations of possible moving objects are then made based on these motion regions. One of the key aspects of the approach is that it is based on estimating the motion of entire edge contours, as opposed to recovering a velocity field that measures the motion of individual points. We present some examples for image sequences taken of animate objects using a handheld video camera."
1 edition published in 1994 in English and held by 2 WorldCat member libraries worldwide
Abstract: "This paper introduces a method for detecting moving objects in a monocular image sequence that is obtained using a moving camera. The method first estimates the motion of the edge contours in a given image frame, by recovering a transformation that best matches each edge contour with the edges in the subsequent frame. Any contour that is not well accounted for by a single transformation is split into subparts. The transformation of each edge contour together with the relative spatial locations of the contours is used to partition the image into regions with similar motions. Hypotheses about the locations of possible moving objects are then made based on these motion regions. One of the key aspects of the approach is that it is based on estimating the motion of entire edge contours, as opposed to recovering a velocity field that measures the motion of individual points. We present some examples for image sequences taken of animate objects using a handheld video camera."
Discovering value from community activity on focused question answering sites a case study of stack overflow(
)
1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide
1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Grimson, William Eric Leifur Author
 LozanoPérez, Tomás
 Kleinberg, Jon M.
 LozanoPerez, Thomas
 Rucklidge, William J.
 Leskovec, Jurij 1980 Author
 Massachusetts Institute of Technology Artificial Intelligence Laboratory
 Kedem, Klara
 Anderson, Ashton
 MASSACHUSETTS INST OF TECH CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB
Useful Links
Languages