Abstract
The dynamic programming is an important procedure for speech understanding and image recognition. In this paper, the application of dynamic programming to recognize the image basing on its contour is recalled, then the parallelism of this process is analyzed and exploited. Some parallel dynamic programming algorithms for evaluating the smallest value of the minimum intersegment distance path in a data table are designed in detail on several kinds or the specialized parallel computer, such as 2D Systolic Array, ID Systolic Array and an associative computer of the SIMD type. Their computation complexities are respectively estimated as O(k), O(k) and O(kw), while the cost O(mn) is obtained on serial computer, where k=max(2n,m), m is the number of segments of a contour to be recognized, n gives the number of segments of the sample contour and w is the bit-width of the used associative fields.
Preview
Unable to display preview. Download preview PDF.
References
John w. Gorman, O. Robert Mitchell and Frank P. Kuhl, Partial shape recognition using dynamic programming. EEE Transactions on PAMI, Vol. 10, N 2, March 1988.
Basile louka and Maurice Tchuente, Dynamic programming on 2D systolic array,Technical report
Richter, K.: Parallel Computer System SIMD In proc. AIICSR Conference I. Plander, ed. North-Holland, 1984, pp 309–313.
Miklosko J. Vajtersic, Klette R., Vrto I., Fast algorithm and their implementation on specialized parallel computers. Veda-North Holland, Bratislava-Ansterdam 1989.
Alberto Martelli, An application of heuristic sear ch methods to edge and contour detection. Computer methods in image analysis, Edited by J. K. Aggarwal, Richard O. Duda, Azriel Rosenfeld. pp 217–227
M. Vajtersic, Giang Vu Thang, Threshold and histogram algorithms for a parallel associative computer. Computer and Artificial Intelligence, 5(1986), No 2, pp 143–161.
Giang Vu Thang, Parallel Algorithms of Histogram Equalization on Parallel Computer of the SIMD Type. Computer and Artificial Intelligence, Vol. 10, No. 5, pp 465–476 (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vu Thang, G. (1992). Parallel dynamic programming algorithms for image recognition based on its contour. In: Nakamura, A., Nivat, M., Saoudi, A., Wang, P.S.P., Inoue, K. (eds) Parallel Image Analysis. ICPIA 1992. Lecture Notes in Computer Science, vol 654. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56346-6_46
Download citation
DOI: https://doi.org/10.1007/3-540-56346-6_46
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56346-4
Online ISBN: 978-3-540-47538-5
eBook Packages: Springer Book Archive