Abstract
Given (r 1,r 2,...r n ) ∈ R n, for any I=(I 1,I 2,...I n ) ∈ Z n, let E I =(e ij ), where e ij =(r i −r j )−(I i −I i ), find I ∈ Z n such that ∥E I ∥ is minimized, where ∥·∥ is a matrix norm. This is a matching problem where, given a real-valued pattern, the goal is to find the best discrete pattern that matches the real-valued pattern. The criterion of the matching is based on the matrix norm minimization instead of simple pairwise distance minimization. This matching problem arises in optimal curve rasterization in computer graphics and in vector quantization of data compression. Until now, there has been no polynomial-time solution to this problem. We present a very simple O(nlgn) time algorithm to solve this problem under various matrix norms.
Research supported by the Natural Sciences and Engineering Research Council of Canada grant OGP0046373.
Preview
Unable to display preview. Download preview PDF.
References
J. E. Bresenham, “Algorithm for computer control of digital plotting”, IBM Syst. J., vol. 4, pp. 25–30, 1965.
C. E. Kim, ‘On the cellular convexity of complexes', IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 3, pp.617–625, 1981
A. Rosenfeld ‘Arcs and curves in digital pictures', J. of ACM Vol. 20, No. 1, pp.81–87, 1973
X. Wu and J. Roken, ‘Dynamic error measure for curve scan-conversion', Proc. Graphics/Interface '89, London, Ontario, pp.183–190, 1989
X. Wu ‘An efficient antialiasing technique', Computer Graphics vol. 25, no. 4, pp. 143–152, 1991
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tang, S., Zhang, K., Wu, X. (1994). Matching with matrix norm minimization. In: Crochemore, M., Gusfield, D. (eds) Combinatorial Pattern Matching. CPM 1994. Lecture Notes in Computer Science, vol 807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58094-8_22
Download citation
DOI: https://doi.org/10.1007/3-540-58094-8_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58094-2
Online ISBN: 978-3-540-48450-9
eBook Packages: Springer Book Archive