We present an efficient Hough transform for automatic detection of cylinders in point clouds. As cylinders are one of the most frequently used primitives for industrial design, automatic and robust methods for their detection and fitting are essential for reverse engineering from point clouds. The current methods employ automatic segmentation followed by geometric fitting, which requires a lot ...

Hough-like methods (Implicite Shape Model, Hough forest, 9 ...) have been successfully applied in multiple computer vision fields like 10 object detection, tracking, skeleton extraction or human action detection. 11 However, these methods are known to generate false positives. To handle 12 this issue, several works like Max-Margin Hough Transform (MMHT) or 13 Implicit Shape Kernel (ISK) have re...

In this paper, convex hull based features are used for recognition of isolated Roman numerals using a Multi Layer Perceptron (MLP) based classifier. Experiments of convex hull based features for handwritten character recognition are few in numbers. Convex hull of a pattern and the centroid of the convex hull both are affine invariant attributes. In this work, 25 features are extracted based on ...

ci = 1, and all Pi in Σ. For example, the line segment between two points P and Q is the convex hull of those two points. This is clearly convex. An extremal point of a convex region is a point that does not lie on the interior of a line segment in the region. Any convex region is the convex hull of its extremal points. As was proved in [Weyl:1935], the convex hull of any finite set of points a...

• Sd: A d-Simplex The simplest convex polytope in R. A d-simplex is always the convex hull of some d + 1 affinely independent points. For example, a line segment is a 1− simplex i.e., the smallest convex subspace which contains two points. A triangle is a 2 − simplex and a tetrahedron is a 3− simplex. • P: A Simplicial Polytope. A polytope where each facet is a d− 1 simplex. By our assumption, ...

An asymptotic expression for the expected area of the union of n random rectangles is derived by Mellin transforms, where their two diagonal corners are independently and uniformly distributed over (0, 1). The general result for d-dimensional hyper-rectangles is also stated. COMPUTATIONAL GEOMETRY, CONVEX HULL, GEOMETRIC PROBABILITY, GEOMETRY OF RECTANGLES, MELLIN TRANSFORM, CALCULUS OF FINITE ...

For the computational model where only additions are allowed, the Ω(n log n) lower bound on operations count with respect to image size n × n is obtained for two types of the discrete Radon transform implementations: the fast Hough transform and a generic strip pattern class which includes the classical Hough transform, implying the fast Hough transform algorithm asymptotic optimality. The proo...

For a self{similar or self{aane tile in R n we study the following questions: 1) What is the boundary? 2) What is the convex hull? We show that the boundary is a graph directed self{aane fractal, and in the self{similar case we give an algorithm to compute its dimension. We give necessary and suucient conditions for the convex hull to be a polytope, and we give a description of the Gauss map of...

We develop efficient algorithms for problems in computational geometry—convex hull, smallest enclosing box, ECDF, two-set dominance, maximal points, all-nearest neighbor, and closest-pair—on the OTIS-Mesh optoelectronic computer. We also demonstrate the algorithms for computing convex hull and prefix sum with condition on a multi-dimensional mesh, which are used to compute convex hull and ECDF ...