2018Unpublished venueRequires access

Real-Time Computation of Legendre-Sobolev Approximations

Parisa Alvandi, Stephen M. Watt

Open publisher page 2 citations

Abstract

The present work is motivated by the problem of mathematical handwriting recognition where symbols are represented as plane curves, (X(λ), Y(λ)) parameterized by arc length λ ϵ [0, L]. Earlier work has shown that approximating the coordinate functions as certain truncated orthogonal polynomial series yields fast and effective recognition. It has been previously shown how to compute Legendre series representation in real time, as the curve is being traced out. In this article we show how to compute Legendre-Sobolev series representation in real time. The idea is to numerically integrate the moments of the coordinate functions as the curve is being traced. We show how the Legendre-Sobolev coefficients may be constructed either from the Legendre series coefficients or directly from the moments. Computing via Legendre series coefficients requires two matrix vector products, while the direct method requires only one.

About this research paper

What this paper is about

The present work is motivated by the problem of mathematical handwriting recognition where symbols are represented as plane curves, (X(λ), Y(λ)) parameterized by arc length λ ϵ [0, L]. Earlier work has shown that approximating the coordinate functions as certain truncated orthogonal polynomial series yields fast and effective recognition. It has been previously shown how to compute Legendre series representation in real time, as the curve is being traced out. In this article we show how to compute Legendre-Sobolev series representation in real time. The idea is to numerically integrate the moments of the coordinate functions as the curve is being traced. We show how the Legendre-Sobolev coefficients may be constructed either from the Legendre series coefficients or directly from the moments. Computing via Legendre series coefficients requires two matrix vector products, while the direct method requires only one.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The present work is motivated by the problem of mathematical handwriting recognition where symbols are represented as plane curves, (X(λ), Y(λ)) parameterized by arc length λ ϵ [0, L]. Earlier work has shown that approximating the coordinate functions as certain truncated orthogonal polynomial series yields fast and effective recognition. It has been previously shown how to compute Legendre series representation in real time, as the curve is being traced out. In this article we show how to compute Legendre-Sobolev series representation in real time. The idea is to numerically integrate the moments of the coordinate functions as the curve is being traced. We show how the Legendre-Sobolev coefficients may be constructed either from the Legendre series coefficients or directly from the moments. Computing via Legendre series coefficients requires two matrix vector products, while the direct method requires only one.

Key concepts: Legendre polynomials, Legendre function, Associated Legendre polynomials, Mathematics, Legendre wavelet, Series (stratigraphy), Sobolev space, Legendre's equation

Related papers

Back to paper searchBrowse research topicsOriginal source
Real-Time Computation of Legendre-Sobolev Approximations — Research Paper | ScholarLens