We investigate approximate decision algorithms for determining whether the mini mumHausdor distance between two points sets or between two sets of nonintersecting line segments is at most An approximate decision algorithm is a standard decision algorithm that answers yes or no except when is in an indecision interval where the algorithm is allowed to answer don t know We present algorithms with...

The detection of motion from image sequences is usually performed using a time differential method or calculating the difference from a background reference image. These algorithms often perform poorly in the presence of temporal clutter. This paper describes a technique that measures the irregularity of an intensity sequence to detect motion. We demonstrate that static background, interesting ...

We introduce and characterize angular right symmetric approximate points of the algebra all bounded linear operators defined on either real or complex Hilbert spaces.

Subspaces offer convenient means of representing information in many Pattern Recognition, Machine Vision, and Statistical Learning applications. Contrary to the growing popularity of subspace representations, the problem of efficiently searching through large subspace databases has received little attention in the past. In this paper we present a general solution to the Approximate Nearest Subs...

Lowpass envelope approximation of smooth continuousvariable signals are introduced in this work. Envelope approximations are necessary when a given signal has to be approximated always to a larger value (such as in TV white space protection regions). In this work, a near-optimal approximate algorithm for finding a signal’s envelope, while minimizing a mean-squared cost function, is detailed. Th...

Abstract—We present a trigonometric scheme to approximate a circular arc with its two end points and two end tangents/unit tangents. A rational cubic trigonometric Bézier curve is constructed whose end control points are defined by the end points of the circular arc. Weight functions and the remaining control points of the cubic trigonometric Bézier curve are estimated by variational approach t...

We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points for multivariate compact sets by basic tools of numerical linear algebra. The first gives the so-called “Approximate Fekete Points” by QR factorization with column pivoting of Vandermonde-like matrices. The second computes Discrete Leja Points by LU factorization with row pivoting. Moreover, we st...

Line simplification is an important component of map generalization. In recent years, algorithms for line simplification have been widely researched, and most of them are based on vector data. However, with the increasing development of computer vision, analysing and processing information from unstructured image data is both meaningful and challenging. Therefore, in this paper, we present a ne...

This note points out that some results in the paper (International Journal of Approximate Reasoning 46 (2007) 109–119) are incorrect. 2008 Elsevier Inc. All rights reserved.