Full metadata record
DC FieldValueLanguage
dc.date2020-02
dc.date.accessioned2025-08-27T05:20:49Z-
dc.date.available2025-08-27T05:20:49Z-
dc.date.issued2020-02
dc.identifier.identifierDspace\SGAU\20200313\82863
dc.identifier.citationMakovetskii, A. An efficient algorithm for non-rigid object registration / A. Makovetskii, S. Voronin, V. Kober, A. Voronin // Компьютерная оптика. – 2020. – Т. 44, № 1. – С. 67-73. – DOI: 10.18287/2412-6179-CO-586.
dc.identifier.urihttps://dx.doi.org/10.18287/2412-6179-CO-586
dc.identifier.urihttp://repo.ssau.ru/jspui/handle/123456789/22750-
dc.description.abstractAn efficient algorithm for registration of two non-rigid objects based on geometrical transformation of the template object to target object is proposed. The transformation is considered as warping of the template onto the target. To choose the most suitable transformation from all possible warps, a registration algorithm should satisfy deformation constraints referred to as regularization of non-rigid objects. In this work, we use variational functionals for affine transformations. With the help of computer simulation, the proposed method for searching the optimal geometrical transformation is compared with that of common algorithms.
dc.languageen
dc.publisherСамарский национальный исследовательский университет им. академика С.П. Королева, Институт систем обработки изображений РАН - филиал ФНИЦ «Кристаллография и фотоника» РАН
dc.relation.ispartofseries44;1
dc.titleAn efficient algorithm for non-rigid object registration
dc.typeArticle
dc.identifier.scsti28.23.15
local.identifier.oldurihttp://repo.ssau.ru/handle/Zhurnal-Komputernaya-optika/An-efficient-algorithm-for-nonrigid-object-registration-82863
local.identifier.oldurihttp://repo.ssau.ru/handle/Zhurnal-Komputernaya-optika/An-efficient-algorithm-for-nonrigid-object-registration-82863
Appears in Collections:Журнал "Компьютерная оптика"

Files in This Item:
File Description SizeFormat 
440109.pdfОсновная статья497.4 kBAdobe PDFView/Open


Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.