Least Squares Method and Least Modules Method for Finding Defects in Regular Images
The article describes methods based on method of least squares (LSM) and the method of least modules (LMM) to search for defects in regular images (regular 3D structures images). They correspond to the optimization problems of approximating the coefficients of a given matrix using matrix coefficient...
Saved in:
| Published in | Kìbernetika ta komp'ûternì tehnologìï (Online) no. 1; pp. 32 - 42 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
V.M. Glushkov Institute of Cybernetics
28.03.2025
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 2707-4501 2707-451X 2707-451X |
| DOI | 10.34229/2707-451X.25.1.3 |
Cover
| Summary: | The article describes methods based on method of least squares (LSM) and the method of least modules (LMM) to search for defects in regular images (regular 3D structures images). They correspond to the optimization problems of approximating the coefficients of a given matrix using matrix coefficients for a regular 3D structure according to the least squares criterion and the smallest modulus criterion. The difference (exceeding statistical average) between the coefficients of the given matrix and the coefficients of the found matrix marks the defect regions for a regular 3D structure. Four optimization problems for finding the parameters of regular structures are formulated and their properties are formulated for the task. The first and second problems correspond to finding the best according to the criterion of least squares of regular and basic regular structures, and the third and fourth - the best according to the criterion of smallest modules of regular and basic regular structures. Methods of calculating gradients of smooth functions (LSM) and subgradients of non-smooth functions (LMM) for all four problems are described. Codes of octave functions are provided, where the calculation of function values and its (sub)gradients is implemented using matrix-vector operations. Also, the article provides sample test results of the application of r-algorithm to estimate the time of solving test problems on modern PCs for regular images of small sizes - 400 pixels vertically and 600 pixels horizontally, and medium sizes - 1000 and 1500 pixels. The first experiment is related to the restoration by means of MNC of the parameters of the basic regular structure without defects, the second experiment is related to the restoration by means of MNM of the parameters of the basic regular structure with defects in a small area (441 pixels). The developed programs can be used in dialog mode to analyze defects in regular images of small sizes (5 seconds) and medium sizes (40 seconds). Keywords: regular 3D-structure, least squares method, least modulus method, r-algorithm. |
|---|---|
| ISSN: | 2707-4501 2707-451X 2707-451X |
| DOI: | 10.34229/2707-451X.25.1.3 |