scholarly journals Salt and pepper sign (paraganglioma)

2021 ◽  
Author(s):  
Daniel Bell
Keyword(s):  
2019 ◽  
Vol 118 (7) ◽  
pp. 73-76
Author(s):  
Sharanabasappa ◽  
P Ravibabu

Nowadays, during the process of Image acquisition and transmission, image information data can be corrupted by impulse noise. That noise is classified as salt and pepper noise and random impulse noise depending on the noise values. A median filter is widely used digital nonlinear filter  in edge preservation, removing of impulse noise and smoothing of signals. Median filter is the widely used to remove salt and pepper noise than rank order filter, morphological filter, and unsharp masking filter. The median filter replaces a sample with the middle value among all the samples present inside the sample window. A median filter will be of two types depending on the number of samples processed at the same cycle i.e, bit level architecture and word level architecture.. In this paper, Carry Look-ahead Adder median filter method will be introduced to improve the hardware resources used in median filter architecture for 5 window and 9 window for 8 bit and 16 bit median filter architecture.


2013 ◽  
Vol 32 (5) ◽  
pp. 1293-1295
Author(s):  
Yuan-hua GUO ◽  
Xiao-rong HOU

Sensors ◽  
2021 ◽  
Vol 21 (11) ◽  
pp. 3848
Author(s):  
Wei Cui ◽  
Meng Yao ◽  
Yuanjie Hao ◽  
Ziwei Wang ◽  
Xin He ◽  
...  

Pixel-based semantic segmentation models fail to effectively express geographic objects and their topological relationships. Therefore, in semantic segmentation of remote sensing images, these models fail to avoid salt-and-pepper effects and cannot achieve high accuracy either. To solve these problems, object-based models such as graph neural networks (GNNs) are considered. However, traditional GNNs directly use similarity or spatial correlations between nodes to aggregate nodes’ information, which rely too much on the contextual information of the sample. The contextual information of the sample is often distorted, which results in a reduction in the node classification accuracy. To solve this problem, a knowledge and geo-object-based graph convolutional network (KGGCN) is proposed. The KGGCN uses superpixel blocks as nodes of the graph network and combines prior knowledge with spatial correlations during information aggregation. By incorporating the prior knowledge obtained from all samples of the study area, the receptive field of the node is extended from its sample context to the study area. Thus, the distortion of the sample context is overcome effectively. Experiments demonstrate that our model is improved by 3.7% compared with the baseline model named Cluster GCN and 4.1% compared with U-Net.


2021 ◽  
Vol 442 ◽  
pp. 26-35
Author(s):  
Luming Liang ◽  
Seng Deng ◽  
Lionel Gueguen ◽  
Mingqiang Wei ◽  
Xinming Wu ◽  
...  

Author(s):  
Xuehu Yan ◽  
Lintao Liu ◽  
Longlong Li ◽  
Yuliang Lu

A secret image is split into   shares in the generation phase of secret image sharing (SIS) for a  threshold. In the recovery phase, the secret image is recovered when any   or more shares are collected, and each collected share is generally assumed to be lossless in conventional SIS during storage and transmission. However, noise will arise during real-world storage and transmission; thus, shares will experience data loss, which will also lead to data loss in the secret image being recovered. Secret image recovery in the case of lossy shares is an important issue that must be addressed in practice, which is the overall subject of this article. An SIS scheme that can recover the secret image from lossy shares is proposed in this article. First, robust SIS and its definition are introduced. Next, a robust SIS scheme for a  threshold without pixel expansion is proposed based on the Chinese remainder theorem (CRT) and error-correcting codes (ECC). By screening the random numbers, the share generation phase of the proposed robust SIS is designed to implement the error correction capability without increasing the share size. Particularly in the case of collecting noisy shares, our recovery method is to some degree robust to some noise types, such as least significant bit (LSB) noise, JPEG compression, and salt-and-pepper noise. A theoretical proof is presented, and experimental results are examined to evaluate the effectiveness of our proposed method.


Sign in / Sign up

Export Citation Format

Share Document