English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This article suggests an algorithm of impulse noise filtration, based on thecommunity detection in graphs. The image is representing as non-orientedweighted graph. Each pixel of an image is corresponding to a vertex of thegraph. Community detection algorithm is running on the given graph. Assumedthat communities that contain only one pixel are corresponding to noised pixelsof an image. Suggested method was tested with help of computer experiment. Thisexperiment was conducted on grayscale, and on colored images, on artificialimages and on photos. It is shown that the suggested method is better thanmedian filter by 20% regardless of noise percent. Higher efficiency isjustified by the fact that most of filters are changing all of image pixels,but suggested method is finding and restoring only noised pixels. Thedependence of the effectiveness of the proposed method on the percentage ofnoise in the image is shown.

The algorithm of the impulse noise filtration in images based on an algorithm of community detection in graphs