Alter, Tao D.
Overview
Works:  4 works in 5 publications in 1 language and 9 library holdings 

Roles:  Author 
Classifications:  Q335.M41, 
Publication Timeline
.
Most widely held works by
Tao D Alter
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."
3D pose from 3 corresponding points under weakperspective projection by Tao D Alter(
Book
)
1 edition published in 1992 in English and held by 2 WorldCat member libraries worldwide
Abstract: "Modelbased object recognition commonly involves using a minimal set of matched model and image points to compute the pose of the model in image coordinates. Furthermore, recognition systems often rely on the 'weakperspective' imaging model in place of the perspective imaging model. This paper discusses computing the pose of a model from three corresponding points under weakperspective projection. A new solution to the problem is proposed which, like previous solutions, involves solving a biquadratic equation. Here the biquadratic is motivated geometrically and its solutions, comprised of an actual and a false solution, are interpreted graphically. The final equations take a new form, which lead to a simple expression for the image position of any unmatched model point."
1 edition published in 1992 in English and held by 2 WorldCat member libraries worldwide
Abstract: "Modelbased object recognition commonly involves using a minimal set of matched model and image points to compute the pose of the model in image coordinates. Furthermore, recognition systems often rely on the 'weakperspective' imaging model in place of the perspective imaging model. This paper discusses computing the pose of a model from three corresponding points under weakperspective projection. A new solution to the problem is proposed which, like previous solutions, involves solving a biquadratic equation. Here the biquadratic is motivated geometrically and its solutions, comprised of an actual and a false solution, are interpreted graphically. The final equations take a new form, which lead to a simple expression for the image position of any unmatched model point."
Extracting salient curves from images : an analysis of the saliency network by T. D Alter(
Book
)
1 edition published in 1996 in English and held by 2 WorldCat member libraries worldwide
Abstract: "The Saliency Network proposed by Shashua and Ullman is a wellknown approach to the problem of extracting salient curves from images while performing gap completion. This paper analyzes the Saliency Network. The Saliency Network is attractive for several reasons. First, the network generally prefers long and smooth curves over short or wiggly ones. While computing saliencies, the network also fills in gaps with smooth completions and tolerates noise. Finally, the network is locally connected, and its size is proportional to the size of the image. Nevertheless, our analysis reveals certain weaknesses with the method. In particular, we show cases in which the most salient element does not lie on the perceptually most salient curve. Furthermore, in some cases the saliency measure changes its preferences when curves are scaled uniformly. Also, we show that for certain fragmented curves the measure prefers large gaps over a few small gaps of the same total size. In addition, we analyze the time complexity required by the method. We show that the number of steps required for convergence in serial implementations is quadratic in the size of the network, and in parallel implementations is linear in the size of the network. We discuss problems due to coarse sampling of the range of possible orientations. We show that with proper sampling the complexity of the network becomes at least cubic in the size of the network. Finally, we consider the possibility of using the Saliency Network for grouping. We show that the Saliency Network recovers the most salient curve efficiently, but it has problems with identifying any salient curve other than the most salient one."
1 edition published in 1996 in English and held by 2 WorldCat member libraries worldwide
Abstract: "The Saliency Network proposed by Shashua and Ullman is a wellknown approach to the problem of extracting salient curves from images while performing gap completion. This paper analyzes the Saliency Network. The Saliency Network is attractive for several reasons. First, the network generally prefers long and smooth curves over short or wiggly ones. While computing saliencies, the network also fills in gaps with smooth completions and tolerates noise. Finally, the network is locally connected, and its size is proportional to the size of the image. Nevertheless, our analysis reveals certain weaknesses with the method. In particular, we show cases in which the most salient element does not lie on the perceptually most salient curve. Furthermore, in some cases the saliency measure changes its preferences when curves are scaled uniformly. Also, we show that for certain fragmented curves the measure prefers large gaps over a few small gaps of the same total size. In addition, we analyze the time complexity required by the method. We show that the number of steps required for convergence in serial implementations is quadratic in the size of the network, and in parallel implementations is linear in the size of the network. We discuss problems due to coarse sampling of the range of possible orientations. We show that with proper sampling the complexity of the network becomes at least cubic in the size of the network. Finally, we consider the possibility of using the Saliency Network for grouping. We show that the Saliency Network recovers the most salient curve efficiently, but it has problems with identifying any salient curve other than the most salient one."
Robust and efficient 3D recognition by alignment by
Massachusetts Institute of Technology(
Book
)
2 editions published in 1992 in English and held by 1 WorldCat member library worldwide
Alignment is a prevalent approach for recognizing 3D objects in 2D images. A major problem with current implementations is how to robustly handle errors that propagate from uncertainties in the locations of image features. This thesis gives a technique for bounding these errors. The technique makes use of a new solution to the problem of recovering 3D pose from three matching point pairs under weakperspective projection. Furthermore, the error bounds are used to demonstrate that using line segments for features instead of points significantly reduces the false positive rate, to the extent that alignment can remain reliable even in cluttered scenes
2 editions published in 1992 in English and held by 1 WorldCat member library worldwide
Alignment is a prevalent approach for recognizing 3D objects in 2D images. A major problem with current implementations is how to robustly handle errors that propagate from uncertainties in the locations of image features. This thesis gives a technique for bounding these errors. The technique makes use of a new solution to the problem of recovering 3D pose from three matching point pairs under weakperspective projection. Furthermore, the error bounds are used to demonstrate that using line segments for features instead of points significantly reduces the false positive rate, to the extent that alignment can remain reliable even in cluttered scenes
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Associated Subjects
Languages