Results 1 
7 of
7
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 34 (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 ...
On the Area of Overlap of Translated Polygons
, 1994
"... Given two simple polygons P and Q in the plane and a translation vector t 2 R 2 , the areaofoverlap function of P and Q is the function Ar(t) = Area(P " (t +Q)), where t +Q denotes Q translated by t. This function has a number of applications in areas such as motion planning and object rec ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
(Show Context)
Given two simple polygons P and Q in the plane and a translation vector t 2 R 2 , the areaofoverlap function of P and Q is the function Ar(t) = Area(P " (t +Q)), where t +Q denotes Q translated by t. This function has a number of applications in areas such as motion planning and object recognition. We present a number of mathematical results regarding this function. We also provide efficient algorithms for computing a representation of this function, and for tracing contour curves of constant area of overlap. The support of the National Science Foundation under grant CCR 9310705 is gratefully acknowledged, as is the help of Sandy German in preparing this paper. A preliminary version of this paper appeared in Vision Geometry II , R.A. Melter and A.Y. Wu, Editors, Proc. SPIE 2060, 1993, 254264. 1 Introduction An important geometric problem involving planar shapes is whether two simple polygons intersect one another. If the polygons do intersect it is often useful to acquire mo...
Recognizing Polygonal Parts from Width Measurements
, 1995
"... Automatic recognition of parts is an important problem in many industrial applications. One model of the problem is: Given a finite set of polygonal parts, use a set of "width" measurements taken by a paralleljaw gripper to determine which part is present. We study the problem of compu ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Automatic recognition of parts is an important problem in many industrial applications. One model of the problem is: Given a finite set of polygonal parts, use a set of "width" measurements taken by a paralleljaw gripper to determine which part is present. We study the problem of computing efficient strategies ("grasp plans"), with the goal to minimize the number of measurements necessary in the worst case. We show that finding a minimum length grasp plan is Af7hard, and give a polynomial time approximation algorithm that is simple and produces a solution that is within a log factor from optimal.
Distributed sensing and probing with multiple search agents: toward systemlevel landmine detection solutions
 In Detection Technologies for Mines and Minelike Targets, Proceedings of SPIE, Vol.2496
, 1995
"... agents: toward systemlevel landmine detection solutions ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
(Show Context)
agents: toward systemlevel landmine detection solutions
Probe Trees for Touching Character Recognition
 In Proc. International Conference on Imaging Science, Systems and Technology, (CISST
, 1998
"... The problem of touching characters is very important for the recognition of low quality text. A solution is presented here for the problem of touching character recognition for fixed font, using a decision tree classifier paradigm. The method is based on the concept of probe trees, a fast recognitio ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
The problem of touching characters is very important for the recognition of low quality text. A solution is presented here for the problem of touching character recognition for fixed font, using a decision tree classifier paradigm. The method is based on the concept of probe trees, a fast recognition method that uses character probes to acquire knowledge about the input samples. Touching characters are recognized without segmentation, so errors common in segmentationbased methods are avoided. Speed is achieved by constructing a decision tree for a specific font offline, before any samples are seen. A deformation model is used to generate probes that withstand certain image distortions. Experimental results are presented in support of the method. Keywords: Touching Characters, Probe Trees, Optical Character Recognition, Document Image Understanding. sazaklis@cs.sunysb.edu. Supported in part by a grant from Syngen Corp. and by the Strategic Partnership for Industrial Resurgence, Coll...
Decision Tree Construction in Fixed Dimensions: Being Global is Hard but Local Greed is Good
, 1995
"... We study the problem of finding optimal linear decision trees for classifying a set of points in R^d partitioned into concept classes, where d is a fixed, but arbitrary, constant. We show that optimal decision tree construction is NPcomplete, even for 3dimensional point sets. Nevertheless, we can ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We study the problem of finding optimal linear decision trees for classifying a set of points in R^d partitioned into concept classes, where d is a fixed, but arbitrary, constant. We show that optimal decision tree construction is NPcomplete, even for 3dimensional point sets. Nevertheless, we can prove a number of interesting approximation bounds on the use of random sampling for finding optimal splitting hyperplanes in greedy decision tree constructions. We give experimental evidence that, while providing asymptotic guarantees on split quality, this random sampling approach behaves as good in practice as uniform randomization strategies that do not provide such guarantees. Finally, we provide experimental justification for coupling this random sampling strategy with locallygreedy "hill climbing" methods.
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...