Fast algorithm for multiple-objects min-ε problem

IEEE International Conference on Image Processing

Volumn 1, Issue , 2003, Pages 221-224

  Kolesnikov, Alexander ^a   Fränti, Pasi ^a  

^a UNIVERSITY OF EASTERN FINLAND   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER GRAPHICS; DATA PROCESSING; DYNAMIC PROGRAMMING; ERROR ANALYSIS; HEURISTIC PROGRAMMING; ITERATIVE METHODS; LAGRANGE MULTIPLIERS; MAPPING; PATTERN RECOGNITION; TREES (MATHEMATICS);

NEAR-OPTIMAL APPROXIMATION; VECTOR DATA PROCESSING;

IMAGE PROCESSING;

EID: 0345529025     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. W.S. Chan and F. Chin. "On approximation of polygonal curves with minimum number of line segments or minimum error", Int. Journal Computational Geometry and Applications, 6, pp. 59-77, 1996.
2. G.M. Schuster and A.K. Katsaggelos, "An optimal polygonal boundary encoding scheme in the rate distortion sense", IEEE Trans. Image Processing, 7(1), pp. 13-26, 1998.
3. J.C. Perez and E. Vidal, "Optimum polygonal approximation of digitized curves", Pattern Recognition Letters, 15, pp. 743-750, 1994.
4. M. Salotti, "An efficient algorithm for the optimal polygonal approximation of digitized curves", Pattern Recognition Letters, 22, pp. 215-221, 2001.
5. A. Kolesnikov and P. Fränti, "A fast near-optimal algorithm for approximation of polygonal curves", Proc of Int.Conf. Pattern Recognition-ICPR'02,4, pp. 335-338, 2002.
6. A. Kolesnikov and P. Fränti, "Reduced-search dynamic programming for approximation of polygonal curves", accepted to Pattern Recognition Letters, 2003.
7. P.L. Rosin, "Techniques for assessing polygonal approximations of curves", IEEE Trans. Pattern Analysis and Machine Intelligence, 14(6), pp. 659-666, 1997.
8. A.K. Katsaggelos, L.P. Kondi, F.W. Meier, J. Osterman, and G.M. Schuster, "MPEG-4 and rate-distortion-based shape-coding techniques", Proc. of IEEE, 86(6), pp. 1126-1154, 1998.
9. R. Bellman, Dynamic Programming, Princeton University Press, New Jersey, 1957.
10. D.H. Douglas and T.K. Peucker, "Algorithm for the reduction of the number of points required to represent a line or its caricature", The Canadian Cartographer, 10(2), pp. 112-122, 1973.