doi: 10.17586/2226-1494-2021-21-2-206-224


Detection of a small target object in blurry images affected by affine distortions

A. V. Timofeev


Read the full article  ';
Article in Russian

For citation:

Timofeev A.V. Detection of a small target object in blurry images affected by affine distortions. Scientific and Technical Journal of Information Technologies, Mechanics and Optics, 2021, vol. 21, no. 2, pp. 206–224 (in Russian). doi: 10.17586/2226-1494-2021-21-2-206-224



Abstract

The paper proposes a novel and practically effective method for detecting, classifying, and estimating the coordinates of the image center of a small-size target object on a noisy scene, which is invariant to linear conformal transformations (rotation, shift, and scale). We consider a binary classifier that decides whether a particular part of the scene contains the desired image or only the background. The proposed approach implies an interactive procedure for finding an extremum of a function that approximates the likelihood function of the binary classifier. A two-step procedure based on the Nelder-Meade method is used to implement the extremum search. In order to ensure the robustness to noise and linear conformal transformations, both special training methods and the approach based on using an ensemble of classifiers, each of which corresponds to a certain scale, are applied in training the classifier. The author created a method for detecting a blurred image of a small-sized object in a scene that is distorted by correlated noise and proposes simultaneous estimation of the coordinates of the center of the target image. The method is robust to linear conformal distortions and has been successfully tested both on the artificial model and real images. The results of numerical study confirmed the robustness of the method to correlated noise of additive type and to linear conformal transformations. Within the framework of the proposed approach, the problem of constructing a confidence set for the coordinates of the target image center has been formally solved, and the efficiency of the obtained solution has been numerically investigated. The properties of the confidence set are formalized in the form of a theorem. The work also makes a comparison with the classical correlation-extreme method. If necessary, the proposed method can be easily generalized to the multiclass case. The method can be applied to machine vision systems, including online analysis of aerial survey data and to systems for video monitoring of the mechanical condition of complex technical equipment under conditions of strong meteorological disturbance.


Keywords: image matching, machine learning, SVM-classifier, Nelder-Meade method

References
  1. Lowe D.G. Method and apparatus for identifying scale invariant features in an image and use of same for locating an object in an image. Patent US 6711293B1, 2004.
  2. Bay H., Ess A., Tuytelaars T., Van Gool L. Speeded-Up Robust Features (SURF). Computer Vision and Image Understanding, 2008, vol. 110, no. 3, pp. 346–359. doi: 10.1016/j.cviu.2007.09.014
  3. Rublee E., Rabaud V., Konolige K., Bradski G. ORB: An efficient alternative to SIFT or SURF. Proc. 2011 International Conference on Computer Vision (ICCV), 2011, pp. 2564–2571. doi: 10.1109/ICCV.2011.6126544
  4. Rosten E., Drummond T. Fusing points and lines for high performance tracking. Proc. 10th IEEE International Conference on Computer Vision (ICCV), 2005, vol. 2, pp. 1508–1515. doi: 10.1109/ICCV.2005.104
  5. Vijaya Kumar B.V.K., Mahalanobis A., Juday R.D. Correlation Pattern Recognition. Cambridge University Press, 2005, 390 p. doi: 10.1017/CBO9780511541087
  6. Tarasenko V.P., Timofeev A.V. Confidence estimation of registration precision in correlation-extreme systems. Avtometriya, 1990, no. 4, pp. 106–111. (in Russian)
  7. Kober V., Campos J. Accuracy of location measurement of a noisy target in a nonoverlapping background. Journal of the Optical Society of America A, 1996, vol. 13, no. 8, pp. 1653–1666. doi: 10.1364/JOSAA.13.001653
  8. Kim H.Y., De Araújo S.A. Grayscale template-matching invariant to rotation, scale, translation, brightness and contrast. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2007, vol. 4872, pp. 100–113. doi: 10.1007/978-3-540-77129-6_13
  9. Korman S., Reichman D., Tsur G., Avidan S. FAsT-Match: Fast Affine Template Matching. Proc. 26th IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2013, pp. 2331–2338. doi: 10.1109/CVPR.2013.302
  10. Rüping S. Robust Probabilistic Calibration. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2006, vol. 4212, pp. 743–750. doi: 10.1007/11871842_75
  11. Timofeev A.V. Non-asymptotic sequential confidence regions with fixed sizes for the multivariate nonlinear parameters of regression. Statistical Methodology, 2009, vol. 6, no. 5, pp. 513–526. doi: 10.1016/j.stamet.2009.05.002
  12. Timofeev A.V. The guaranteed estimation of the Lipschitz classifier accuracy: confidence set approach. Journal of the Korean Statistical Society, 2012, vol. 41, no. 1, pp. 105–114. doi: 10.1016/j.jkss.2011.07.005
  13. Timofeev A.V. Nonasymptotic confidence sets of prescribed dimensions for parameters of nonlinear regressions. Automation and Remote Control, 2009, vol. 70, no. 2, pp. 233–243. doi: 10.1134/S0005117909020052
  14. Cristianini N., Shawe-Taylor J. An Introduction to Support Vector Machines and Other Kernel-based Learning Methods. Cambridge University Press, 2000, XIII, 197 p. doi: 10.1017/CBO9780511801389
  15. Mason L., Baxter J., Bartlett P., Frean M. Boosting algorithms as gradient descent. Advances in Neural Information Processing Systems, 2000, pp. 512–518.
  16. Friedman J.H. Greedy function approximation: a gradient boosting machine. Annals of Statistic, 2001, vol. 29, no. 5, pp. 1189–1232. doi: 10.1214/aos/1013203451
  17. Chen T., Guestrin C. XGBoost: A Scalable Tree Boosting System. Proc. 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, USA, 2016, pp. 785–794. doi: 10.1145/2939672.2939785
  18. Nelder J.A. Mead R. A simplex method for function minimization. The Computer Journal, 1965, vol. 7, no. 4, pp. 308–313. doi: 10.1093/comjnl/7.4.308


Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License
Copyright 2001-2024 ©
Scientific and Technical Journal
of Information Technologies, Mechanics and Optics.
All rights reserved.

Яндекс.Метрика