Results 1 
6 of
6
Decision Trees For Geometric Models
, 1993
"... A fundamental problem in modelbased computer vision is that of identifying which of a given set of geometric models is present in an image. Considering a "probe" to be an oracle that tells us whether or not a model is present at a given point, we study the problem of computing efficien ..."
Abstract

Cited by 36 (4 self)
 Add to MetaCart
A fundamental problem in modelbased computer vision is that of identifying which of a given set of geometric models is present in an image. Considering a "probe" to be an oracle that tells us whether or not a model is present at a given point, we study the problem of computing efficient strategies ("decision trees") for probing an image, with the goal to minimize the number of probes necessary (in the worst case) to determine which single model is present. We show that a dlg ke height binary decision tree always exists for k polygonal models (in fixed position), provided (1) they are nondegenerate (do not share boundaries) and (2) they share a common point of intersection. Further, we give an efficient algorithm for constructing such decision tress when the models are given as a set of polygons in the plane. We show that constructing a minimum height tree is NPcomplete if either of the two assumptions is omitted. We provide an efficient greedy heuristic strategy and show ...
Point Probe Decision Trees for Geometric Concept Classes
, 1993
"... A fundamental problem in modelbased computer vision is that of identifying to which of a given set of concept classes of geometric models an observed model belongs. Considering a "probe" to be an oracle that tells whether or not the observed model is present at a given point in an image, ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
A fundamental problem in modelbased computer vision is that of identifying to which of a given set of concept classes of geometric models an observed model belongs. Considering a "probe" to be an oracle that tells whether or not the observed model is present at a given point in an image, we study the problem of computing efficient strategies ("decision trees") for probing an image, with the goal to minimize the number of probes necessary (in the worst case) to determine in which class the observed model belongs. We prove a hardness result and give strategies that obtain decision trees whose height is within a log factor of optimal. These results grew out of discussions that began in a series of workshops on Geometric Probing in Computer Vision, sponsored by the Center for Night Vision and ElectroOptics, Fort Belvoir, Virginia, and monitored by the U.S. Army Research Office. The views, opinions, and/or findings contained in this report are those of the authors and should not be con...
Efficient Data Structures for Maintaining Set Partitions (Extended Abstract)
 Proceedings of Seventh Scandinavian Workshop on Algorithm Theory
, 1999
"... ) Michael Bender Saurabh Sethia Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 117944400 fbendersaurabhskienag@cs.sunysb.edu April 22, 1999 1 Introduction Each test or feature in a classification system defines a set partition on a class of object ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
) Michael Bender Saurabh Sethia Steven Skiena Department of Computer Science State University of New York Stony Brook, NY 117944400 fbendersaurabhskienag@cs.sunysb.edu April 22, 1999 1 Introduction Each test or feature in a classification system defines a set partition on a class of objects. Adding new features refines the classification, whereas deleting features may result in merging previously distinguished classes. As an illustration, consider the set of automobile types f VW Beetle, Toyota, Lexus, Cadillac g. The feature size partitions the cars into sets of small and large cars, ff VW Beetle, Toyotag, f Lexus, Cadillac gg. The feature domesticorigin partitions the cars into ff VW Beetle, Toyota, Lexus g, f Cadillac gg. The feature uglyshape distinguishes f VW Beetle, Cadillac g from f Toyota, Lexus g. Incorporating both size and origin induces the refined partition ff VW Beetle, Toyotag, f Lexus g, f Cadillac gg, whereas the union of all three features completely di...
Probing a Set of Hyperplanes by Lines and Related Problems
, 1993
"... Suppose that for a set H of n unknown hyperplanes in the Euclidean ddimensional space, a line probe is available which reports the set of intersection points of a query line with the hyperplanes. Under this model, this paper investigates the complexity to find a generic line for H and further to ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Suppose that for a set H of n unknown hyperplanes in the Euclidean ddimensional space, a line probe is available which reports the set of intersection points of a query line with the hyperplanes. Under this model, this paper investigates the complexity to find a generic line for H and further to determine the hyperplanes in H . This problem arises in factoring the uresultant to solve systems of polynomials (e.g., Renegar [12]). We prove that d+1 line probes are sufficient to determine H . Algorithmically, the time complexity to find a generic line and reconstruct H from O(dn) probed points of intersection is important. It is shown that a generic line can be computed in O(dn log n) time after d line probes, and by an additional d line probes, all the hyperplanes in H are reconstructed in O(dn log n) time. This result can be extended to the ddimensional complex space. Also, concerning the factorization of the uresultant using the partial derivatives on a generic line, we touch upon reducing the time complexity to compute the partial derivatives of the uresultant represented as the determinant of a matrix.
Polytope containment and determination by linear probes
 Proc. London Math. Soc
, 1995
"... As the terms are used here, a body in R el is a compact convex set with nonempty interior, and a polytope is a body that has only finitely many extreme points. The class of all bodies whose interior includes the origin 0 is denoted by %%. A set X is symmetric if X =X. The rayoracle of a body C e ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
As the terms are used here, a body in R el is a compact convex set with nonempty interior, and a polytope is a body that has only finitely many extreme points. The class of all bodies whose interior includes the origin 0 is denoted by %%. A set X is symmetric if X =X. The rayoracle of a body C e &quot;#( { is the function 0c which, accepting as input an arbitrary ray R issuing from 0, produces the point at which R intersects the boundary of C. This paper is concerned with a few central aspects of the following general question: given certain information about C, what additional information can be obtained by questioning the rayoracle, and how efficiently can it be obtained? It is assumed that infiniteprecision real arithmetic and the usual vector operations in U d are available at no cost, so the efficiency of an algorithm is measured solely in terms of its number of calls to the rayoracle. The paper discusses two main problems, the first of which—the containment problem—arose from a question in abstract numerical analysis. Here the goal is to construct a polytope P (not necessarily in any sense a small one) that contains C, where this requires precise specification of the vertices of P. There are some sharp positive results for the case in which d = 2 and C is known not to be too asymmetric, but the main result on the containment problem is negative. It asserts that when d 2 s 3 and the body is known only to be rotund and symmetric, there is no algorithm for the containment problem. This is the case even when there is available a certain master oracle whose questionanswering power far exceeds that of the rayoracle. However, it turns out that even when there is no additional information about C, the following relaxation of the containment problem admits an algorithmic solution based solely on the rayoracle: construct a polytope containing C or conclude that the centred condition number of C exceeds a prescribed bound. In the other main problem—the reconstruction problem — it is known only that C is itself a polytope and the problem is to construct C with the aid of a finite number of calls to the rayoracle. That is accomplished with a number of calls that depends on the number of faces (and hence on the 'combinatorial complexity') of C.
Geometric Methods for Optical Character Recognition
, 1997
"... of the Dissertation Geometric Methods for Optical Character Recognition by George N. Sazaklis Doctor of Philosophy in Computer Science State University of New York at Stony Brook Advisor: Joseph S. B. Mitchell 1997 Abstract Optical Character Recognition (OCR) is an important problem havin ..."
Abstract
 Add to MetaCart
(Show Context)
of the Dissertation Geometric Methods for Optical Character Recognition by George N. Sazaklis Doctor of Philosophy in Computer Science State University of New York at Stony Brook Advisor: Joseph S. B. Mitchell 1997 Abstract Optical Character Recognition (OCR) is an important problem having both theoretical and practical interest. In this dissertation, we present solutions to three problems within the area of OCR. A difficulty encountered by many OCR systems is confusions between similar shapes, when flexible matching is employed as a primary recognition mechanism. Our solution, constrained matching as a second stage classification technique, can discriminate between similar shapes, using shape geometric attributes; thus the system is enabled to reach a final decision on the character identity. Another important problem in OCR is the fast and reliable fixedfont recognition. We present a hierarchical classification technique that utilizes the concept of geometric probe tree...