Skip to main content
Log in

A local method for contour matching and its parallel implementation

  • Published:
Machine Vision and Applications Aims and scope Submit manuscript

Abstract.

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 via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

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

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001380050082

Navigation