Extracting the interior of a region when its contour is given is one of the most common problems in many applications of image processing. Most of the algorithms which have been reported in the literature perform the extraction either by using the parity check technique or by using the seeding techn
Parallel computation of image curve velocity fields
โ Scribed by Johan P.F D'Haeyer; Ignace Bruyland
- Book ID
- 103913107
- Publisher
- Elsevier Science
- Year
- 1988
- Weight
- 953 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0734-189X
No coin nor oath required. For personal study only.
โฆ Synopsis
The computation of the velocity field along image curves belongs to the class of ill-posed problems (in the sense of Hadamard). Local measurements of image pattern changes are usuaUy insufficient to solve the velocity field uniquely. Therefore regularization techniques are applied, yielding solutions that are robust against noise and that are correct for a limited class of curve velocity fields. It is shown in the paper that regularization problems, such as the smoothest velocity field computation and the computation of the minimum dilatation velocity field, can be solved with a parallel algorithm or a fast sequential algorithm. This follows from the block-tridiagonal structure to which these variational techniques give rise. e 1988 Academic Press. Inc.
๐ SIMILAR VOLUMES