Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

A local method for contour matching and its parallel implementation

  • 86 Accesses

  • 10 Citations


This paper presents a local approach for matching contour segments in an image sequence. This study has been primarily motivated by work concerned with the recovery of 3D structure using active vision. The method to recover the 3D structure of the scene requires to track in real-time contour segments in an image sequence. Here, we propose an original and robust approach that is ideally suited for this problem. It is also of more general interest and can be used in any context requiring matching of line boundaries over time. This method only involves local modeling and computation of moving edges dealing “virtually” with a contour segment primitive representation. Such an approach brings robustness to contour segmentation instability and to occlusion, and easiness for implementation. Parallelism has also been investigated using an SIMD-based real-time image-processing system. This method has been validated with experiments on several real-image sequences. Our results show quite satisfactory performance and the algorithm runs in a few milliseconds.

This is a preview of subscription content, log in to check access.

Author information

Additional information

Received: 11 December 1996 / Accepted: 8 August 1997

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Boukir, S., Bouthemy, P., Chaumette, F. et al. A local method for contour matching and its parallel implementation. Machine Vision and Applications 10, 321–330 (1998). https://doi.org/10.1007/s001380050082

Download citation

  • Key words:Contour matching – Directional convolution masks – Parallel processing – Real-time computer systems – Tracking of moving edges