Issue No. 08 - August (1997 vol. 19)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.608276
<p><b>Abstract</b>—In several applications where binary contours are used to represent and classify patterns, smoothing must be performed to attenuate noise and quantization error. This is often implemented with local weighted averaging of contour point coordinates, because of the simplicity, low-cost and effectiveness of such methods. Invoking the "optimality" of the Gaussian filter, many authors will use Gaussian-derived weights. But generally these filters are not optimal, and there has been little theoretical investigation of local weighted averaging methods per se. This paper focuses on the direct derivation of optimal local weighted averaging methods <it>tailored towards specific computational goals</it> such as the accurate estimation of contour point positions, tangent slopes, or deviation angles. A new and simple digitization noise model is proposed to derive the best set of weights for different window sizes, <it>for each computational task</it>. Estimates of the fraction of the noise actually removed by these optimum weights are also obtained. Finally, the applicability of these findings for arbitrary curvature is verified, by numerically investigating equivalent problems for digital circles of various radii.</p>
Contour smoothing; optimal local weighted averaging; digitization noise modeling; Gaussian smoothing.
R. Legault and C. Y. Suen, "Optimal Local Weighted Averaging Methods in Contour Smoothing," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 19, no. , pp. 801-817, 1997.