Matching with matrix norm minimization
Given (r1,r2,...r n ) ∈ R n , for any I=(I1,I2,...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.
Unable to display preview. Download preview PDF.
- 1.J. E. Bresenham, “Algorithm for computer control of digital plotting”, IBM Syst. J., vol. 4, pp. 25–30, 1965.Google Scholar
- 2.C. E. Kim, ‘On the cellular convexity of complexes', IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 3, pp.617–625, 1981Google Scholar
- 3.A. Rosenfeld ‘Arcs and curves in digital pictures', J. of ACM Vol. 20, No. 1, pp.81–87, 1973Google Scholar
- 4.X. Wu and J. Roken, ‘Dynamic error measure for curve scan-conversion', Proc. Graphics/Interface '89, London, Ontario, pp.183–190, 1989Google Scholar
- 5.X. Wu ‘An efficient antialiasing technique', Computer Graphics vol. 25, no. 4, pp. 143–152, 1991Google Scholar