191 research outputs found

    Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element

    Get PDF
    The running maximum-minimum (max-min) filter computes the maxima and minima over running windows of size w. This filter has numerous applications in signal processing and time series analysis. We present an easy-to-implement online algorithm requiring no more than 3 comparisons per element, in the worst case. Comparatively, no algorithm is known to compute the running maximum (or minimum) filter in 1.5 comparisons per element, in the worst case. Our algorithm has reduced latency and memory usage.Comment: to appear in Nordic Journal of Computin

    Handwritten Character Recognition Using Elastic Matching Based On Class-Dependent Deformation Model

    Get PDF
    For handwritten character recognition, a new elastic image matching (EM) technique based on a class-dependent deformation model is proposed. In the deformation model, any deformation of a class is described by a linear combination of eigen-deformations, which are intrinsic deformation directions of the class. The eigen-deformations can be estimated statistically from the actual deformations of handwritten characters. Experimental results show that the proposed technique can attain higher recognition rates than conventional EM techniques based on class-independent deformation models. The results also show the superiority of the proposed technique over those conventional EM techniques in computational efficiency

    Improved Two-Dimensional Warping

    Get PDF
    The well-known dynamic programming time warping algorithm (DTW) provides an optimal matching between 1-dimensional sequences in polynomial time. Finding an optimal 2-dimensional warping is an NP-complete problem. Hence, only approximate non-exponential time 2-dimensional warping algorithms currently exist. A polynomial time 2-dimensional approximation algorithm was proposed recently. This project provides a thorough analytical and experimental study of this algorithm. Its time complexity is improved from O(N^6) to O(N^4). An extension of the algorithm to 3D and potential higher-dimensional applications are described
    corecore