C. C. Silva, Francisco Assis da Silva, Leandro Luiz de Almeida, Danillo Roberto Pereira, A. O. Artero, M. A. Piteri
{"title":"CONSTRUÇÃO DE IMAGENS PANORÂMICAS EM MÚLTIPLAS FAIXAS DE ALTURA E LARGURA USANDO ALGORITMOS WATERSHED E GRAPH-CUT","authors":"C. C. Silva, Francisco Assis da Silva, Leandro Luiz de Almeida, Danillo Roberto Pereira, A. O. Artero, M. A. Piteri","doi":"10.5747/ce.2021.v13.n2.e357","DOIUrl":null,"url":null,"abstract":"In this work we developed an algorithm for building panoramas with multiple height and width ranges. For multilinear stitching, images were initially placed in a matrix and partial panoramas with images from the same column are generated. To complete the final panorama, the columns were divided with the help of support points and the neighboring columns were stitched, being reassembled at the end of the process. The stitching was performed with a graph cut algorithm in conjunction with the Watershed algorithm.","PeriodicalId":30414,"journal":{"name":"Colloquium Exactarum","volume":"56 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Colloquium Exactarum","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5747/ce.2021.v13.n2.e357","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this work we developed an algorithm for building panoramas with multiple height and width ranges. For multilinear stitching, images were initially placed in a matrix and partial panoramas with images from the same column are generated. To complete the final panorama, the columns were divided with the help of support points and the neighboring columns were stitched, being reassembled at the end of the process. The stitching was performed with a graph cut algorithm in conjunction with the Watershed algorithm.