Open AccessTHE ALGORITHMS OF QUASI-OPTIMAL PICTURE AREAS MATCHING
Author(s) -
Alexander Doudkin,
Rauf Sadykhov,
M. E. Vatkin
Publication year - 2014
Publication title -
computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.184
H-Index - 11
eISSN - 2312-5381
pISSN - 1727-6209
DOI - 10.47839/ijc.2.2.206
Subject(s) - matching (statistics) , algorithm , scheme (mathematics) , function (biology) , matrix (chemical analysis) , computer science , square (algebra) , scale (ratio) , mathematical optimization , mathematics , mathematical analysis , statistics , materials science , geometry , physics , quantum mechanics , evolutionary biology , composite material , biology
Using common matching quality criteria the problem of optimum matching of partially overlapped picture areas is considered. Two schemes of algorithms are proposed for quasi-optimal solution of the problem with following restrictions: the areas are rectangular and have an identical scale. In the first scheme local criterion is used to estimate a quads of frames located in square matrix. In the second scheme is used the special distance function based on neighbor picture matching criterion. The algorithms are realized in program system of layout metallization restoring of integrated circuits.