Iterative algorithm for offsets, scale and rotate estimation for television image superposition with additive and multiplicative noise

We describe the iterative algorithm for television image superposition. The superposition is defined by offsets, scale, and rotates. Also additive and multiplicative noise influences the image. The main aim of developing this algorithm is to reduce the time of processing images for estimation superp...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Физика волновых процессов и радиотехнические системы Ročník 25; číslo 1; s. 36 - 44
Hlavný autor: Diyazitdinov, Rinat R.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Povolzhskiy State University of Telecommunications & Informatics 29.03.2022
Predmet:
ISSN:1810-3189, 2782-294X
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract We describe the iterative algorithm for television image superposition. The superposition is defined by offsets, scale, and rotates. Also additive and multiplicative noise influences the image. The main aim of developing this algorithm is to reduce the time of processing images for estimation superposition parameters. Reducing processing time is provided by reducing the set of reference points, which defines the superposition. The initial coordinate of the reference points is refined at the process of the algorithm work for acceptable superposition of the television images. The superposition parameters are divided into two groups. Offsets belong to the first group, scale and rotate belong to the second group. The parameters in each group are estimated independently. The iterative procedure uses the offsets for estimation scale and rotate, and after it uses scale and rotates for estimation of the offsets. This process is repeated. The next iteration approximates the rate to the real value of the superposition parameters. The developed algorithm allows reducing processing time at 25 times faster than the brute force algorithm for the test data. The test data include two images; the first image has the resolution 288 384 pixels, the second image has the resolution 128 128 pixels. The second image is the fragment of the first image. Also at the end of the article, the numerical simulation had been presented. The simulation shows the dependences of error estimation of parameters from the noise power.
AbstractList We describe the iterative algorithm for television image superposition. The superposition is defined by offsets, scale, and rotates. Also additive and multiplicative noise influences the image. The main aim of developing this algorithm is to reduce the time of processing images for estimation superposition parameters. Reducing processing time is provided by reducing the set of reference points, which defines the superposition. The initial coordinate of the reference points is refined at the process of the algorithm work for acceptable superposition of the television images. The superposition parameters are divided into two groups. Offsets belong to the first group, scale and rotate belong to the second group. The parameters in each group are estimated independently. The iterative procedure uses the offsets for estimation scale and rotate, and after it uses scale and rotates for estimation of the offsets. This process is repeated. The next iteration approximates the rate to the real value of the superposition parameters. The developed algorithm allows reducing processing time at 25 times faster than the brute force algorithm for the test data. The test data include two images; the first image has the resolution 288 384 pixels, the second image has the resolution 128 128 pixels. The second image is the fragment of the first image. Also at the end of the article, the numerical simulation had been presented. The simulation shows the dependences of error estimation of parameters from the noise power.
Author Diyazitdinov, Rinat R.
Author_xml – sequence: 1
  givenname: Rinat R.
  surname: Diyazitdinov
  fullname: Diyazitdinov, Rinat R.
BookMark eNqNkcFu3CAQhlGUStmkeQer59oFDBj31Cpq2pUi9ZJIuaExHjZEXrMCkqhP0Nfos-TJgnfbHHoKF8Tw_9-M_jklx3OYkZAPjDZMC9V_YprRumW6bzjlvOGyYU2raiGOyIp3mte8F7fHZPWqOyHnKd1TSnnfM630ivxeZ4yQ_SNWMG1C9PluW7kQq-Bcwpw-VsnCVD7nsYohQ8YKU_bbYgnzInz-k3HCR5-Wd6lvsEoPO4y7kPxe81SQFYyjPzQpnO3DlP1u8vbQdw4-4XvyzsGU8PzvfUZuLr9dX_yor35-X198vaot77WoheODHZgcBNMSKS21USvqtLZdR1tUUgCV2HMhgFkB0GHXyXJaaSkMbXtG1gfuGODe7GKZOP4yAbzZF0LcGIjZ2wkN57J3xaqHAQRVYhjRjhYkKtcqqWlhfTmwbAwpRXTG-rwPJkfwk2HU7PdklvzNkr9Z9mS4NMy0yghREJ__Q_wb6Q3mFzAQnfQ
CitedBy_id crossref_primary_10_18469_1810_3189_2024_27_2_77_84
Cites_doi 10.18287/0134-2452-2014-38-2-343-350
10.18287/2412-6179-2016-40-2-258-265
10.1109/TPAMI.2008.113
10.1109/83.506761
10.1007/978-3-642-37807-2_15
10.1023/B:VISI.0000029664.99615.94
10.1080/01431160902927622
10.1016/j.cviu.2007.09.014
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.18469/1810-3189.2022.25.1.36-44
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList CrossRef

Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
EISSN 2782-294X
EndPage 44
ExternalDocumentID oai_doaj_org_article_2259f5558bba4064bdecdca5e6f36580
10_18469_1810_3189_2022_25_1_36_44
GroupedDBID 642
AAYXX
ALMA_UNASSIGNED_HOLDINGS
CITATION
GROUPED_DOAJ
ID FETCH-LOGICAL-c2984-4f2bcb15b4185e00984d860f88c7703e654a05e9244a1c4aa7e77555535c0ab33
IEDL.DBID DOA
ISSN 1810-3189
IngestDate Fri Oct 03 12:52:25 EDT 2025
Tue Nov 18 22:36:49 EST 2025
Sat Nov 29 06:07:43 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License https://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2984-4f2bcb15b4185e00984d860f88c7703e654a05e9244a1c4aa7e77555535c0ab33
ORCID 0000-0001-6360-0351
OpenAccessLink https://doaj.org/article/2259f5558bba4064bdecdca5e6f36580
PageCount 9
ParticipantIDs doaj_primary_oai_doaj_org_article_2259f5558bba4064bdecdca5e6f36580
crossref_citationtrail_10_18469_1810_3189_2022_25_1_36_44
crossref_primary_10_18469_1810_3189_2022_25_1_36_44
PublicationCentury 2000
PublicationDate 2022-03-29
PublicationDateYYYYMMDD 2022-03-29
PublicationDate_xml – month: 03
  year: 2022
  text: 2022-03-29
  day: 29
PublicationDecade 2020
PublicationTitle Физика волновых процессов и радиотехнические системы
PublicationYear 2022
Publisher Povolzhskiy State University of Telecommunications & Informatics
Publisher_xml – name: Povolzhskiy State University of Telecommunications & Informatics
References ref13
ref12
ref15
ref14
ref11
ref10
ref2
ref1
ref16
ref8
ref7
ref9
ref4
ref3
ref6
ref5
References_xml – ident: ref11
  doi: 10.18287/0134-2452-2014-38-2-343-350
– ident: ref13
– ident: ref1
– ident: ref4
– ident: ref2
– ident: ref3
  doi: 10.18287/2412-6179-2016-40-2-258-265
– ident: ref7
  doi: 10.1109/TPAMI.2008.113
– ident: ref5
  doi: 10.1109/83.506761
– ident: ref6
  doi: 10.1007/978-3-642-37807-2_15
– ident: ref14
  doi: 10.1023/B:VISI.0000029664.99615.94
– ident: ref9
– ident: ref8
– ident: ref15
  doi: 10.1080/01431160902927622
– ident: ref10
– ident: ref16
  doi: 10.1016/j.cviu.2007.09.014
– ident: ref12
SSID ssj0002991868
Score 2.184046
Snippet We describe the iterative algorithm for television image superposition. The superposition is defined by offsets, scale, and rotates. Also additive and...
SourceID doaj
crossref
SourceType Open Website
Enrichment Source
Index Database
StartPage 36
SubjectTerms additive
iterative
multiplicative
offsets
rotate
scale
superposition
Title Iterative algorithm for offsets, scale and rotate estimation for television image superposition with additive and multiplicative noise
URI https://doaj.org/article/2259f5558bba4064bdecdca5e6f36580
Volume 25
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2782-294X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0002991868
  issn: 1810-3189
  databaseCode: DOA
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV25TsQwELUQoqBBIEDcckFJlo2P2C4BgaBBFCDRWT4BCRK02eUT-G5mkrBaKihoJ7FjPU_msMZvCDlmTOuopSmciK4QXLvCRwbGsAqi4kp5rvtmE-r2Vj8-mruFVl9YE9bTA_fAnYK-mYykVN47cD7CxxRicDJVmYP37LL1sTILyRTaYDCyyAOP2ZbuDI02A-Mo-FtzOhdCgsjYiMlROeJVIcQP77RA4t95m6t1sjaEifSsX94GWUr1Jvm86SiQwT5R9_rUQFr__EYh6KRNzm2atie0BcThYR3ppMEokiKHRn85sXtxOr9NTkH8lGg7e8c2W33hFsVDWYoVRv03YJqh3rA72ANR3by0aYs8XF3eX1wXQx-FIjCjRSEy88GX0iNRTUIGURF1Nc5aBwU_fKqkcGOZIBMTrgzCOZWUAsgll2HsPOfbZLlu6rRDqNPRR4hZsjRBcJU8nhzl7EDiy5DKXWK-8bNhIBnHXhevFpMNxN4i9haxt4i9ZdKWlldWiF3C52Pfe6qNP406x22aj0C67E4ASmQHJbK_KdHef0yyT1ZxbVigxswBWZ5OZumQrISP6Us7Oer08wuge-aW
linkProvider Directory of Open Access Journals
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Iterative+algorithm+for+offsets%2C+scale+and+rotate+estimation+for%C2%A0television+image+superposition+with+additive+and+multiplicative+noise&rft.jtitle=%D0%A4%D0%B8%D0%B7%D0%B8%D0%BA%D0%B0+%D0%B2%D0%BE%D0%BB%D0%BD%D0%BE%D0%B2%D1%8B%D1%85+%D0%BF%D1%80%D0%BE%D1%86%D0%B5%D1%81%D1%81%D0%BE%D0%B2+%D0%B8+%D1%80%D0%B0%D0%B4%D0%B8%D0%BE%D1%82%D0%B5%D1%85%D0%BD%D0%B8%D1%87%D0%B5%D1%81%D0%BA%D0%B8%D0%B5+%D1%81%D0%B8%D1%81%D1%82%D0%B5%D0%BC%D1%8B&rft.au=Diyazitdinov%2C+Rinat+R.&rft.date=2022-03-29&rft.issn=1810-3189&rft.eissn=2782-294X&rft.volume=25&rft.issue=1&rft.spage=36&rft.epage=44&rft_id=info:doi/10.18469%2F1810-3189.2022.25.1.36-44&rft.externalDBID=n%2Fa&rft.externalDocID=10_18469_1810_3189_2022_25_1_36_44
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1810-3189&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1810-3189&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1810-3189&client=summon