In this paper we present fast algorithms for computing -skeletons (Kirkpatrick and Radke, in: Toussaint (Ed.), Computational Geometry, North-Holland, Amsterdam, 1985, pp. 217}248) and two of its relatives, namely, k -skeletons, and additively weighted -skeletons. A -skeleton is a generalization of t
Fast Algorithm for Best Anisotropic Walsh Bases and Relatives
β Scribed by Nicholas N. Bennett
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 203 KB
- Volume
- 8
- Category
- Article
- ISSN
- 1063-5203
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Best Neighborhood Matching (BNM) algorithm is a good approach of error concealment in terms of restored image quality. However, this kind of error concealment algorithm is commonly computationβintensive, which restricts their real applications on largeβscale image or video sequence rest
In this paper we provide a fast, numerically stable algorithm to determine when two given polynomials a and b are relatively prime and remain relatively prime even after small perturbations of their coefficients. Such a problem is important in many applications where input data are only available up
This paper proposes an algorithm for ultrasonic distance measurement applications. In order to estimate the time-of-flight (ToF), an analytic process is developed based on the mathematical model of the ultrasonic envelope signal improving some previous methods by extrapolation and characterization o