We derive Khinchine type inequalities for even moments with optimal constants from the result of Walkup ([15]) which states that the class of log-concave sequences is closed under the binomial convolution. log-concavity and ultra log-concavity and Khinchine inequality and factorial moments

The generalized Hough transform (GHT) is a powerful method for recognizing arbitrary shapes as long as the correct match accounts for both much of the model and much of the sensory object. For moderate levels of occlusion, however, the GHT can hypothesize many false solutions. In this paper, we present an improved two-stage GHT procedure for the recognition of overlapping objects. Each boundary...

We show that an information-theoretic property of Shannon's entropy power, known as concavity of entropy power [7], can be fruitfully employed to prove inequalities in sharp form. In particular, the concavity of entropy power implies the logarithmic Sobolev inequality, and the Nash's inequality with the sharp constant.

the souare mid case. Two pmllcl algorithms for convex polygonal covering of shapes di~itized on the hexsgonal grid are presented. Both algorithms requise operations having a locat suppnn of a 6-pixel neighhot~rhood. The f i s t algorithm computes a polygon with at most s i x sides, oriented along the six principal directions in the hexagonal grid. Thc second algorithm computes a nearly convex p...