Consistent representations of the boundary and interior of three-dimensional solid objects are required by applications ranging from interactive visualization to nite element analysis. However, most commonly available models of solid objects contain errors and inconsistencies. We describe an algorithm that automatically constructs consistent representations of the solid objects modeled by an ar...

The recognition of objects is one of the main goals for computer vision research. This paper formulates and solves the problem of three-dimensional (3D) object recognition for Polyhedral objects. A multiple view of 2D intensity images are taken from multiple cameras and used to model the 3D objects. The proposed methodology is based on extracting set of features from the 2D images which include...

This paper focuses on second-order necessary optimality conditions for constrained optimization problems Banach spaces. For in the classical setting, where objective function is $$C^2$$ -smooth, we show that strengthened are valid if constraint set generalized polyhedral convex. a new just assumed to be $$C^1$$ -smooth and convex, establish sharp based Fréchet subdifferential of tangent set. Th...

A wide range of natural language problems can be viewed as disambiguating between a small set of alternatives based upon the string context surrounding the ambiguity site. In this paper we demonstrate that classification accuracy can be improved by invoking a more descriptive feature set than what is typically used. We present a technique that disambiguates by learning regular expressions descr...

We study the links between the topological complexity of an ω-context free language and its degree of ambiguity. In particular, using known facts from classical descriptive set theory, we prove that non Borel ω-context free languages which are recognized by Büchi pushdown automata have a maximum degree of ambiguity. This result implies that degrees of ambiguity are really not preserved by the o...