A new approach for regularized image interpolation

Detalhes bibliográficos
Autor(a) principal: El-Khamy,S. E.
Data de Publicação: 2006
Outros Autores: Hadhoud,M. M., Dessouky,M. I., Salam,B. M., Abd El-Samie,F. E.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Journal of the Brazilian Computer Society
Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002006000100006
Resumo: This paper presents a non-iterative regularized inverse solution to the image interpolation problem. This solution is based on the segmentation of the image to be interpolated into overlapping blocks and the interpolation of each block, separately. The purpose of the overlapping blocks is to avoid edge effects. A global regularization parameter is used in interpolating each block. In this solution, a single matrix inversion process of moderate dimensions is required in the whole interpolation process. Thus, it avoids the large computational cost due to the matrices of large dimensions involved in the interpolation process. The performance of this approach is compared to the standard iterative regularized interpolation scheme and to polynomial based interpolation schemes such as the bicubic and cubic spline techniques. A comparison of the suggested approach with some algorithms implemented in the commercial ACDSee software has been performend in the paper. The obtained results reveal that the suggested solution has a better performance as compared to other algorithms from the MSE and the edges preservation points of view. Its computation time is relatively large as compared to traditional algorithms but this is acceptable when image quality is the main concern.
id UFRGS-28_5f917369c7b6efe3c0f0fdd61132d0ed
oai_identifier_str oai:scielo:S0104-65002006000100006
network_acronym_str UFRGS-28
network_name_str Journal of the Brazilian Computer Society
repository_id_str
spelling A new approach for regularized image interpolationImage InterpolationRegularized InterpolationCubic SplineBicubicLaplacianThis paper presents a non-iterative regularized inverse solution to the image interpolation problem. This solution is based on the segmentation of the image to be interpolated into overlapping blocks and the interpolation of each block, separately. The purpose of the overlapping blocks is to avoid edge effects. A global regularization parameter is used in interpolating each block. In this solution, a single matrix inversion process of moderate dimensions is required in the whole interpolation process. Thus, it avoids the large computational cost due to the matrices of large dimensions involved in the interpolation process. The performance of this approach is compared to the standard iterative regularized interpolation scheme and to polynomial based interpolation schemes such as the bicubic and cubic spline techniques. A comparison of the suggested approach with some algorithms implemented in the commercial ACDSee software has been performend in the paper. The obtained results reveal that the suggested solution has a better performance as compared to other algorithms from the MSE and the edges preservation points of view. Its computation time is relatively large as compared to traditional algorithms but this is acceptable when image quality is the main concern.Sociedade Brasileira de Computação2006-04-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002006000100006Journal of the Brazilian Computer Society v.11 n.3 2006reponame:Journal of the Brazilian Computer Societyinstname:Sociedade Brasileira de Computação (SBC)instacron:UFRGS10.1007/BF03192383info:eu-repo/semantics/openAccessEl-Khamy,S. E.Hadhoud,M. M.Dessouky,M. I.Salam,B. M.Abd El-Samie,F. E.eng2010-10-26T00:00:00Zoai:scielo:S0104-65002006000100006Revistahttps://journal-bcs.springeropen.com/PUBhttps://old.scielo.br/oai/scielo-oai.phpjbcs@icmc.sc.usp.br1678-48040104-6500opendoar:2010-10-26T00:00Journal of the Brazilian Computer Society - Sociedade Brasileira de Computação (SBC)false
dc.title.none.fl_str_mv A new approach for regularized image interpolation
title A new approach for regularized image interpolation
spellingShingle A new approach for regularized image interpolation
El-Khamy,S. E.
Image Interpolation
Regularized Interpolation
Cubic Spline
Bicubic
Laplacian
title_short A new approach for regularized image interpolation
title_full A new approach for regularized image interpolation
title_fullStr A new approach for regularized image interpolation
title_full_unstemmed A new approach for regularized image interpolation
title_sort A new approach for regularized image interpolation
author El-Khamy,S. E.
author_facet El-Khamy,S. E.
Hadhoud,M. M.
Dessouky,M. I.
Salam,B. M.
Abd El-Samie,F. E.
author_role author
author2 Hadhoud,M. M.
Dessouky,M. I.
Salam,B. M.
Abd El-Samie,F. E.
author2_role author
author
author
author
dc.contributor.author.fl_str_mv El-Khamy,S. E.
Hadhoud,M. M.
Dessouky,M. I.
Salam,B. M.
Abd El-Samie,F. E.
dc.subject.por.fl_str_mv Image Interpolation
Regularized Interpolation
Cubic Spline
Bicubic
Laplacian
topic Image Interpolation
Regularized Interpolation
Cubic Spline
Bicubic
Laplacian
description This paper presents a non-iterative regularized inverse solution to the image interpolation problem. This solution is based on the segmentation of the image to be interpolated into overlapping blocks and the interpolation of each block, separately. The purpose of the overlapping blocks is to avoid edge effects. A global regularization parameter is used in interpolating each block. In this solution, a single matrix inversion process of moderate dimensions is required in the whole interpolation process. Thus, it avoids the large computational cost due to the matrices of large dimensions involved in the interpolation process. The performance of this approach is compared to the standard iterative regularized interpolation scheme and to polynomial based interpolation schemes such as the bicubic and cubic spline techniques. A comparison of the suggested approach with some algorithms implemented in the commercial ACDSee software has been performend in the paper. The obtained results reveal that the suggested solution has a better performance as compared to other algorithms from the MSE and the edges preservation points of view. Its computation time is relatively large as compared to traditional algorithms but this is acceptable when image quality is the main concern.
publishDate 2006
dc.date.none.fl_str_mv 2006-04-01
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002006000100006
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002006000100006
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1007/BF03192383
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv text/html
dc.publisher.none.fl_str_mv Sociedade Brasileira de Computação
publisher.none.fl_str_mv Sociedade Brasileira de Computação
dc.source.none.fl_str_mv Journal of the Brazilian Computer Society v.11 n.3 2006
reponame:Journal of the Brazilian Computer Society
instname:Sociedade Brasileira de Computação (SBC)
instacron:UFRGS
instname_str Sociedade Brasileira de Computação (SBC)
instacron_str UFRGS
institution UFRGS
reponame_str Journal of the Brazilian Computer Society
collection Journal of the Brazilian Computer Society
repository.name.fl_str_mv Journal of the Brazilian Computer Society - Sociedade Brasileira de Computação (SBC)
repository.mail.fl_str_mv jbcs@icmc.sc.usp.br
_version_ 1754734669910245376