A model based on local graphs for colour images and its application for Gaussian noise smoothing

[EN] In this paper, a new model for processing colour images is presented. A graph is built for each image pixel taking into account some constraints on links. Each pixel is characterized depending on the features of its related graph, which allows to process it appropriately. As an example, we prov...

ver descrição completa

Detalhes bibliográficos
Autores: Pérez-Benito, Cristina, Morillas, Samuel|||0000-0001-9262-6139, Jordan-Lluch, Cristina|||0000-0001-9608-2984, Conejero, J. Alberto|||0000-0003-3681-7533
Tipo de documento: artigo
Data de publicação:2018
País:España
Recursos:Universitat Politècnica de València (UPV)
Repositório:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Idioma:inglês
OAI Identifier:oai:riunet.upv.es:10251/124280
Acesso em linha:https://riunet.upv.es/handle/10251/124280
Access Level:Acceso aberto
Palavra-chave:Colour Image Processing
Graph Model
Image Smoothing
Hybrid Filter
MATEMATICA APLICADA
Descrição
Resumo:[EN] In this paper, a new model for processing colour images is presented. A graph is built for each image pixel taking into account some constraints on links. Each pixel is characterized depending on the features of its related graph, which allows to process it appropriately. As an example, we provide a characterization of each pixel based on the link cardinality of its connected component. This feature enables us to properly distinguish flat image regions respect to edge and detail regions. According to this, we have designed a hybrid filter for colour image smoothing. It combines a filter able to properly process flat image regions with another one that is more appropriate for details and texture. Experimental results show that our model performs appropriately. We also see that our proposed filter is competitive with respect to state-of-the-art methods. It is close closer to the corresponding optimal switching filter respect to other analogous hybrid method.