Design and implementation of parallel algorithm for image matching based on Hausdorff Distance
Object matching two-dimensional images in computer vision has become a significant subject of article acknowledgment and picture investigation. Hausdorff Distance assumes a significant function in coordinating image. To proposed system parallel algorithm for image matching manage the instance of arb...
Saved in:
Published in | Microprocessors and microsystems Vol. 82; p. 1 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Kidlington
Elsevier BV
01.04.2021
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Object matching two-dimensional images in computer vision has become a significant subject of article acknowledgment and picture investigation. Hausdorff Distance assumes a significant function in coordinating image. To proposed system parallel algorithm for image matching manage the instance of arbitrary commotion, image coordinating, new Hausdorff Distance is proposed in this. In contrast to coordinating two twofold pictures, different techniques, the proposed strategy might be coordinated with a few dark scale image pixel esteems. One case of article acknowledgment is utilized to show the productivity of the proposed strategy. The outcomes demonstrated that, contrasted and, the new Hausdorff Distance (HD) might be more alluring approach to discard image clamor coordinating, because of the extensive reflection to decide the dark scale data Hausdorff Distance of adjoining pixels in the shooting of his realities into account. Besides, the strategy can be acknowledged in a straightforward manner. |
---|---|
Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
ISSN: | 0141-9331 |
DOI: | 10.1016/j.micpro.2021.103919 |