An algorithm is presented for text skew angle detection in vision-based scanning of nutrition labels on grocery packages. The algorithm takes a nutrition label image and applies several iterations of the 2D Haar Wavelet Transform (2D HWT) to downsample the image and to compute the horizontal, vertical, and diagonal change matrices. The values of these matrices are binarized and combined into a ...

We propose to study the relationship between the hierachical Hough transform and classical algorithms for partitioning curves into segments. We show that the set of segments found by classical algorithms is a subset of the segments found by the hierarchical Hough transform. This new relationship allows to have a better understanding of the behaviour of some parameters of the hierarchical Hough ...

A new algorithm for the determination of the relative convex hull in the plane of a simple polygon A with respect to another simple polygon B which contains A, is proposed. The relative convex hull is also known as geodesic convex hull, and the problem of its determination in the plane is equivalent to find the shortest curve among all Jordan curves lying in the difference set of B and A and en...

One useful generalization of the convex hull of a set S of n points is the-strongly convex-hull. It is deened to be a convex polygon P with vertices taken from S such that no point in S lies farther than outside P and such that even if the vertices of P are perturbed by as much as , P remains convex. It was an open question 1 as to whether an-strongly convex O()-hull existed for all positive. W...

The problem of finding the digital convex fuzzy hull of a digital fuzzy set, whose support is made of some digital points (centroids) in Z, is considered here. A region is DL−convex if, for any two pixels belonging to it, there exists a digital straight line between them, all of whose pixels belong to the region. An algorithm how to compute the DL−convex hull of a digital region is described. A...

This paper presents a method that proposes the composition of the Map-Reduce algorithm and the Hough Transform method to research particular features of shape in the Big Data of images. We introduce the first formal translation of the Hough Transform method into the Map-Reduce pattern. The Hough transform is applied to one image or to several images in parallel. The context of the application o...

Figure 1: Size of hull vs. size of set 1 has a very small number of points on its convex hull in relation to the size of the whole set. In set P2, all points in the set are on the convex hull. Is there an algorithm which is output sensitive in relation to the number of points on the convex hull? It turns out there is such an algorithm KirkpatrickSeidel Marriage Before Conquest. Its complexity, ...

Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The resu...

Normal support vector machine (SVM) is not suitable for classification of large data sets because of high training complexity. Convex hull can simplify the SVM training. However, the classification accuracy becomes lower when there exist inseparable points. This paper introduces a novel method for SVM classification, called convex–concave hull SVM (CCH-SVM). After grid processing, the convex hu...

Given a set S of n points in the plane, an -strongly convex -hull of S is de0ned as a convex polygon P with the vertices taken from S such that no point of S lies farther than outside P and such that even if the vertices of P are perturbed by as much as , P remains convex. This paper presents the 0rst parallel robust method for this generalized convex hull problem (note that the convex hull of ...