66 IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.12, December 2016

Vector Filters: A Survey

Roji Chanu1, and Kh. Manglem Singh2 1Department of Electronics & Communication Engineering, National Institute of Technology Nagaland 2Department of Computer Science & Engineering Engineering, National Institute of Technology Manipur

Abstract nature, nonlinear characteristics and corruption In this paper, a comprehensive survey on vector median filters to statistics. remove the adverse effect due to impulse noise from color Impulse noise is a high energy spikes having large images is presented. Color images are nonstationary vectored amplitude with probability greater than that predicted by value signals. Hence, nonlinear filters such as vector median Gaussian density model occurring for a short duration. It filters are more effective than linear filters. A number of is required to remove noise in the preprocessing stage to nonlinear filters are proposed in the literature. They have been categorized into 12 groups and discussed in details. prevent degradation of image quality.Many nonlinear Keywords filters have been proposed in the literature for removing Impulse noise, Vector median filter, Quaternion, Nonlinear, impulse noise. In this study, a large number of nonlinear Sigma vector filter, Entropy vector filter. filters are categorized into 12 families. This paper aims at summarizing the recent developments in the vector median filters for removal impulse noise 1. Introduction from color images. Section 2 describes the categories of vector median filters. In Section 3, a commonly used Color images are widely used on daily basis in printing, impulse noise model is described. Popular filtering photographs, computer displays, television and movies performance criteria for evaluation filters are given in and thus color image processing plays a crucial role in the Section 4 followed by conclusion in Section 5. field of advertising and dissemination of information [1]. The use of color images is increasing in medical images and remote sensing. Color information are being used in 2. Category of Filters many color image processing applications like object recognition, image matching, content-based image In this section, the commonly used filters used for retrieval, computer vision, color image compression, etc. removing impulse noise are grouped into 12 categories. [2]. Color images are corrupted by noise due to They are malfunctioning of sensors, electronic interference, 1. Basic Vector Filters imperfect optics, or fault in the data transmission process. 2. Weighted Vector Filters Noise introduces color fluctuation making pixel values 3. Adaptive Vector Filters different from the ideal values and thus produces errors which complicate the subsequent stages of the image 4. Peer Group Vector Filters processing process [3]. A filter transforms a signal into a 5. Fuzzy Vector Filters more suitable form for a specific purpose [4]. Filtering 6. Hybrid Vector Filters gives an estimate of signal degraded by noise. Since color 7. Sigma Vector Filters images are nonstationary in nature due to the presence of 8. EntropyVector Filters edges and fine details, and also the human visual system is 9. Quaternion based Vector Filters nonlinear, nonlinear filters are preferred more than linear filters. A color image can be treated as a mapping for 2D 10. Morphological based vector median filters to 3D [5]. The three color channels exhibit strong spectral 11. based median filters correlation. Marginal or component-wise filtering methods 12. Miscellaneous Filters which process each channel independently produce images containing color shifts and other serious artifacts. 2.1 BasicVector Filters In vector filtering techniques the input pixels are treated as a set of vectors and no new colors are introduced. Hence The reduced vector or aggregated ordering technique is theyare able to preserve the correlation among the channel the most common filtering approach. In this method the components [5-8]. Thus an efficient filter aims at aggregated distance of a sample pixel inside a sliding processing of color images with respect to its trichromatic filtering window of length N, usually a finite odd ๐‘–๐‘– number, is computed as follows: ๐’™๐’™ ๐‘Š๐‘Š Manuscript received December 5, 2016 Manuscript revised December 20, 2016 IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.12, December 2016 67

= , , = 1, โ€ฆ , (1) 2.1.3 Extended Vector Median Filter (EXVMF) in which๐‘๐‘ ฯ(.) represents the distance or dissimilarity ๐‘–๐‘– ๐‘—๐‘—=1 ๐‘–๐‘– ๐‘—๐‘— function๐ท๐ท โˆ‘ , ๐œŒ๐œŒ๏ฟฝ=๐’™๐’™( ๐’™๐’™,๏ฟฝ ๐‘–๐‘–, ) and๐‘๐‘ =( , , ) for three EXVMF combines the vector median operation with an averaging filter. EXVMF of , โ€ฆ is denoted as channels. The sorting of aggregated ๐‘–๐‘– ๐‘–๐‘–1 ๐‘–๐‘–2 ๐‘–๐‘–3 ๐‘—๐‘— ๐‘—๐‘—1 ๐‘—๐‘—2 ๐‘—๐‘—3 such that [9, 10] distance ๐’™๐’™ , ๐‘ฅ๐‘ฅ โ€ฆ๐‘ฅ๐‘ฅ, ๐‘ฅ๐‘ฅ in ascending๐’™๐’™ ๐‘ฅ๐‘ฅ ๐‘ฅ๐‘ฅorder๐‘ฅ๐‘ฅ represents ๐‘–๐‘– ๐‘๐‘ ๐ธ๐ธ๐ธ๐ธ๐ธ๐ธ๐ธ๐ธ๐ธ๐ธ = ๐’™๐’™ ๐’™๐’™ ๐’™๐’™ same ordering of the associated vectors 1 2 ๐‘๐‘ , < ( ) ๐‘ ๐‘ ( ๐ท๐ท) ๐ท๐ท ๐ท๐ท( ) ( ) ( ) ( ) ๐ธ๐ธ๐ธ๐ธ๐ธ๐ธ๐ธ๐ธ๐ธ๐ธ (5) ๐’™๐’™ , otherwise๐‘๐‘ ๐‘๐‘ (2) ๐ด๐ด๐ด๐ด๐ด๐ด ๐‘–๐‘–=1 ๐ด๐ด๐ด๐ด๐ด๐ด ๐‘–๐‘– 2 ๐‘–๐‘–=1 ๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰ ๐‘–๐‘– 2 1 2 ๐‘๐‘ 1 2 ๐‘๐‘ ๐’™๐’™ ๐‘–๐‘–๐‘–๐‘– โˆ‘ โˆฅ ๐’™๐’™ โˆ’ ๐’™๐’™ โˆฅ โˆ‘ โˆฅ ๐’™๐’™ โˆ’ ๐’™๐’™ โˆฅ ๐ท๐ท โ‰ค ๐ท๐ท โ‰ค โ‹ฏ โ‰ค ๐ท๐ท โ‡’ ๐’™๐’™ โ‰ค ๐’™๐’™ โ‰ค โ‹ฏ โ‰ค ๐’™๐’™ ๏ฟฝ ๐’™๐’™๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰ 2.1.1 Vector Median Filter (VMF) where = and is the vector median 1 ๐‘๐‘ output. ๐ด๐ดIt๐ด๐ด๐ด๐ด behaves๐‘–๐‘– =1like๐‘–๐‘– VMF ๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰near the edges while in In [9] Vector Median filter (VMF), Generalized Vector smooth๐’™๐’™ areas it๐‘๐‘ behavesโˆ‘ ๐’™๐’™ like ๐’™๐’™the Arithmetic Mean Filter Median Filter (GVMF) and Extended Vector Median (AMF). Filter (EVMF) are introduced for processing vector-valued signals having properties similar with median filters 2.1.4 Generalized Vector Median Filter (GVMF) operation such as zero impulse response and good ability while preserving sharp edges in the The GVMF [11] of vectors , โ€ฆ is vector such signal. They are based on the concept of nonlinear order that { = 1, โ€ฆ , } and for all = 1, โ€ฆ , ๐‘–๐‘– ๐‘๐‘ ๐บ๐บ๐บ๐บ๐บ๐บ๐บ๐บ statistics and derived as maximum likelihood estimates satisfying the condition ๐’™๐’™ ๐’™๐’™ ๐’™๐’™ ๐บ๐บ๐บ๐บ๐บ๐บ๐บ๐บ ๐‘–๐‘– from exponential distributions. Since vectors which vary ๐’™๐’™ โˆˆ ๐‘ฅ๐‘ฅ โˆฃ ๐‘–๐‘– ๐‘๐‘ ๐‘—๐‘— ๐‘๐‘ greatly from the data population correspond to the ( ) ( ) (6) maximum aggregated magnitude difference, the VMF ๐‘๐‘ ๐‘๐‘ ๐‘–๐‘–=1 ๐บ๐บ๐บ๐บ๐บ๐บ๐บ๐บ ๐‘–๐‘– ๐‘–๐‘–=1 ๐‘—๐‘— ๐‘–๐‘– output is the lowest ranked vector with minimum โˆ‘where๐‘‘๐‘‘ ๐’™๐’™( , ) isโˆ’ the๐’™๐’™ distanceโ‰ค โˆ‘ ๐‘‘๐‘‘ between๐’™๐’™ โˆ’ ๐’™๐’™ the vectors and . aggregated distance to the input vectors present inside the window. If , โ€ฆ , represent the vectors inside the 2.1.5 Fast๐‘‘๐‘‘ ๐’™๐’™ Modified๐’š๐’š Vector Median Filter (FMVMF)๐’™๐’™ ๐’š๐’š filtering window W, the vector median is computed as 1 ๐‘๐‘ follows: ๐’™๐’™ ๐’™๐’™ In [12] a new filter similar with VMF is developed whose a) For each vector element calculate the sum of computational complexity is lower than that of VMF. The distances to all other vectors inside the filtering window, distance associated with central pixel is denoted by ๐‘–๐‘– using the Minkowski metric (either๐’™๐’™ the or norm) and ๐‘๐‘+1 add them together to get sum of distances = + ( ( , )๐’™๐’™+2 1 2 ( )/ ๐‘๐‘+1 ๐ฟ๐ฟ ๐ฟ๐ฟ ๏ฟฝ 2 ๏ฟฝโˆ’1 = (3) ๐‘๐‘+1 ๐‘–๐‘– ๐‘๐‘+1 2 ( , ) ๐‘—๐‘— ๐‘†๐‘† ๐‘‘๐‘‘ โˆ’๐›ฝ๐›ฝ โˆ‘๐‘—๐‘—=1 where๐‘‘๐‘‘ ๐’™๐’™ is2 a๐’™๐’™ threshold parameter ๐‘๐‘ = 1 = 2 where๐‘–๐‘– ๐‘—๐‘—=1 ๐‘–๐‘– for๐‘—๐‘— city block distance and for ๐‘๐‘ ๐‘๐‘+1 ๐‘†๐‘† โˆ‘ ๏ฟฝ๐’™๐’™ โˆ’ ๐’™๐’™ ๏ฟฝ๐›พ๐›พ ๐‘๐‘+1 ๐‘—๐‘— Euclidean distance. โˆ‘and๐‘—๐‘—= ๏ฟฝthe2 ๏ฟฝdistance+1 ๐‘‘๐‘‘ ๐’™๐’™ 2 associated๐’™๐’™ with๐›ฝ๐›ฝ the neighbors of is ๐›พ๐›พ ๐›พ๐›พ ๐‘๐‘+1 b) Find a parameter such that denotes the given as = ( , ) , = minimum . ๐’™๐’™ 2 ๐‘š๐‘š๐‘š๐‘š๐‘š๐‘š 1,2, 3, โ€ฆ , , excluding ( + 1)/2. ๐‘๐‘ Then๐‘–๐‘– for๐‘—๐‘—=1 some๐‘–๐‘– ๐‘—๐‘—, if c) Corresponding to ๐‘š๐‘š๐‘š๐‘š๐‘š๐‘š, = (๐‘†๐‘†) represents the ๐‘‘๐‘‘ โˆ‘ ๐‘‘๐‘‘ ๐’™๐’™ ๐’™๐’™ ๐‘–๐‘– ๐‘–๐‘– is smaller than ( )/ i.e. = ( , ) < vector median๐‘†๐‘† . ๐‘˜๐‘˜ ๐‘š๐‘š๐‘š๐‘š๐‘š๐‘š ๐‘š๐‘š๐‘š๐‘š๐‘š๐‘š 1 , ๐‘๐‘ ๐‘๐‘ . ๐‘๐‘ ๐‘˜๐‘˜ ๐‘‘๐‘‘ ๐‘†๐‘† ๐’™๐’™ ๐’™๐’™ ( )/ then is ๐‘๐‘replaced+1 2 by ๐‘˜๐‘˜ ๐‘˜๐‘˜ ๐‘—๐‘— ๐‘‘๐‘‘ ๐‘‘๐‘‘ โˆ‘๐‘—๐‘—=1 ๐‘‘๐‘‘ ๐’™๐’™ ๐’™๐’™ ๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰ ๐‘๐‘+1 2.1.2 ฮฑ-trimmed๐’™๐’™ Vector Median Filter (ฮฑ-VMF) ๐‘๐‘+1 2 ๐‘˜๐‘˜ ๐‘‘๐‘‘ ๐’™๐’™ 2 ๐’™๐’™ 2.1.6 Directional Vector Median Filter (DVMF) In ฮฑ-VMF a trimming operation is incorporated in which (1+ฮฑ) nearest samples to the vector median are given as In this filter, four vector median are applied across the input to an average filter. The output is defined as follows four main directions of the filtering window at [9, 10]: 0ยฐ, 45ยฐ, 90ยฐand135ยฐ to obtain four vector median output = , [0, 1] (4) , , and . In the second stage, the final output is ( ) 1+๐›ผ๐›ผ 1 generated by applying another vector median on the four The trimming operation enhances in removing the long 1 2 3 4 ๐’™๐’™ฮฑVMF โˆ‘๐‘–๐‘–=1 1+๐›ผ๐›ผ ๐’™๐’™๐‘–๐‘– ๐›ผ๐›ผ โˆˆ ๐‘๐‘ โˆ’ ๐’š๐’šfiltered๐’š๐’š ๐’š๐’š results.๐’š๐’š Hence the Directional Vector Median tailed or impulsive noise while the averaging filter Filter (DVMF) output is denoted as [13] performs well with . = ( ) (7) , , and . w๐ท๐ทhere๐ท๐ท๐ท๐ท๐ท๐ท ( ) 1is the vector median of ๐’™๐’™DVMF is๐’š๐’š effective in removing impulsive noise while 1 ๐Ÿ๐Ÿ 2 3 4 preserving๐’š๐’š thin lines. ๐’š๐’š ๐’š๐’š ๐’š๐’š ๐’š๐’š 68 IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.12, December 2016

2.1.7 Rank Conditioned Vector Median Filter (RCVMF) the current pixel based on the past and future pixel values in the neighborhood of the current pixel by using a block- It incorporates a decision making process in which every by-block autocorrelation function. The difference between pixels in the filtering window is assigned a rank the predicted pixel and the original current pixel is used as depending on the ordered distance. In RCVMF [14] the a measure for impulse detection. output is the vector median when the rank of central pixel The predicted pixel value at central location ( , ) is is larger than a predefined rank of uncorrupted vector computed as pixels in the filtering window. Mathematically it is ( , ) = ( , ) ( , ). ( , ) = ๐‘Ÿ๐‘Ÿ ๐‘๐‘(12) denoted as , > ๐‘–๐‘– ๐‘—๐‘— โˆˆ๐‘Š๐‘Š2 ๐œ‚๐œ‚ ๐œ‚๐œ‚ ( )/ ๐’™๐’™w๏ฟฝ here๐‘Ÿ๐‘Ÿ ๐‘๐‘ โˆ‘ represents๐‘Ž๐‘Ž ๐‘–๐‘– ๐‘—๐‘—the๐’™๐’™ ๐‘Ÿ๐‘Ÿvectorโˆ’ ๐‘–๐‘– ๐‘๐‘ โˆ’obtained๐‘—๐‘— ๐œฒ๐œฒ ๐’‚๐’‚from the = , otherwise (8) ๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰ ๐‘๐‘+1 2 ๐‘˜๐‘˜ prediction coefficients, is the noncausal region for ๐’™๐’™ ๐‘–๐‘–๐‘–๐‘– ๐‘Ÿ๐‘Ÿ ๐‘Ÿ๐‘Ÿ ๐œ‚๐œ‚ ๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘… ๐‘๐‘+1 ๐’‚๐’‚ ๐’™๐’™where ( ๏ฟฝ)/ denotes rank of center pixel and is the linear prediction, denotes the matrix of vector pixels ๐’™๐’™ 2 ๐‘Š๐‘Š2 rank of predefined healthy pixel. used for prediction and๐œ‚๐œ‚ is the order of prediction. ๐‘Ÿ๐‘Ÿ ๐‘๐‘+1 2 ๐‘Ÿ๐‘Ÿ๐‘˜๐‘˜ Then the predictor๐œฒ๐œฒ decides if the current sample is 2.1.8 Rank Conditioning and Threshold Vector Median corrupted or not and is๐œ‚๐œ‚ replaced by the vector median if Filter (RCTVMF) the predicted error ( , ) exceeds a pre-defined threshold . Hence the output of the noncausal linear prediction In [14], a new improvement in the RCVMF is proposed in based vector filter ๐‘’๐‘’ ๐‘Ÿ๐‘Ÿ ๐‘๐‘ is denoted by which the distance between the central pixel and ๐‘‡๐‘‡ , if ( , ) > = ๐‘๐‘๐‘๐‘๐‘๐‘๐‘๐‘ predefined healthy pixel is used as additional criteria for ( , ), ๐’™๐’™otherwise (13) impulse detection. ๐‘‘๐‘‘ ๐’™๐’™๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰ โˆฅ ๐‘’๐‘’ ๐‘Ÿ๐‘Ÿ ๐‘๐‘ โˆฅ ๐‘‡๐‘‡ ๐’™๐’™๐‘๐‘๐‘๐‘๐‘๐‘๐‘๐‘ ๏ฟฝ , > and > 2.1.11 Basic๐’™๐’™ ๐‘Ÿ๐‘ŸVector๐‘๐‘ Directional Filter (BVDF) = ๐‘๐‘+1 (9) ๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…, otherwise ๐‘˜๐‘˜ ๐’™๐’™ ๐‘–๐‘–๐‘–๐‘– ๐‘Ÿ๐‘Ÿ 2 ๐‘Ÿ๐‘Ÿ ๐ท๐ท ๐‘‡๐‘‡ It is a rank ordered filter in which the angle between two ๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘… w๐’™๐’™ here =๏ฟฝ (๐‘๐‘+1 , ) denotes the distance between vectors is used as the distance measure. The vectors with ๐’™๐’™ 2 ( ) ๐‘๐‘+1 atypical directions are regarded as an outlier and filtering central pixel and neighboring๐‘˜๐‘˜ healthy pixels in which ๐ท๐ท ๐›ฅ๐›ฅ ๐’™๐’™ 2 ๐’™๐’™ is done similar with the VMF. The aggregated sum of ( )(1 < < ) is a rank-ordered and healthy vector angles between the vectors is given by pixel. is a pre-determined threshold. If the central pixel = ( , ) , = 1, โ€ฆ , (14) ๐’™๐’™ ๐‘˜๐‘˜ ๐‘˜๐‘˜ ๐‘๐‘ is detected as impulse, it is replaced by the vector median where ๐‘๐‘ ๐‘–๐‘– ๐‘—๐‘—=1 ๐‘–๐‘– ๐‘—๐‘— output๐‘‡๐‘‡. ๐œƒ๐œƒ โˆ‘ ๐ด๐ด ๐’™๐’™ ๐’™๐’™ ๐‘–๐‘– . ๐‘๐‘ , = cos (15) 2.1.9 Crossing Level Median Mean Filter (CLMMF) โˆ’1 ๐’™๐’™๐‘–๐‘– ๐’™๐’™๐‘—๐‘— w๐ด๐ดhere๏ฟฝ๐’™๐’™๐‘–๐‘– ๐’™๐’™๐’‹๐’‹๏ฟฝ , represents๏ฟฝโˆฅ๐’™๐’™๐‘–๐‘–โˆฅโˆฅ๐’™๐’™๐‘—๐‘—โˆฅ ๏ฟฝthe angle between the vectors Crossing Level Median Mean Filter [15] combines the and . The angles are ordered which correspond to ๐ด๐ด๏ฟฝ๐’™๐’™๐‘–๐‘– ๐’™๐’™๐‘—๐‘—๏ฟฝ idea of the VMF and Arithmetic Mean Filter (AMF) ordering of the input vectors as follows: ๐’™๐’™๐’Š๐’Š ๐’™๐’™๐‘—๐‘— which is based on the vector ordering technique. If ( ) ( ) ( ) โ€ฆ ( ) ( ) ( ) ( ) โ€ฆ denotes the weight of elements of the ordered vectors ( ) ๐‘–๐‘– ๐œƒ๐œƒ 1 โ‰ค ๐œƒ๐œƒ 2 โ‰ค โ‹ฏ ๐œƒ๐œƒ ๐‘Ÿ๐‘Ÿ โ‰ค ๐œƒ๐œƒ ๐‘๐‘ โ†’ ๐’™๐’™ 1 โ‰ค ๐’™๐’™ 2 โ‰ค โ‹ฏ ๐’™๐’™ ๐‘Ÿ๐‘Ÿ ( ), ( ), โ€ฆ ( ), the filt๐‘ก๐‘กeredโ„Ž output is given as follows: ๐‘ค๐‘ค The output of BVDF [17]๐‘๐‘ is the vector whose angular ๐‘–๐‘– distance to all otherโ‰ค ๐’™๐’™ vector in the window is minimum. ๐’™๐’™ 1 ๐’™๐’™ 2 ๐’™๐’™ ๐‘๐‘ ๐‘–๐‘– = ( ). ( ) (10) BVDF preserves chromaticity better than๐’™๐’™ the VMF since ๐‘๐‘ vectorโ€™s direction corresponds to its chromaticity. BVDF ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ ๐‘–๐‘–=1 ๐‘–๐‘– ๐‘–๐‘– where๐’™๐’™ โˆ‘ ๐‘ค๐‘ค ๐’™๐’™ considers only directional processing and is effective 1 , for = 1 when vector magnitudes are less important than the ( )( ) ๐‘๐‘ vectors direction which is not suitable for multichannel ( ) = (11) ๏ฟฝ ๐‘๐‘+1 ๐‘๐‘+1+ฮณ , for = 2, โ€ฆ , . โˆ’ ( )( ) ๐‘–๐‘– ๐‘–๐‘– 1 where๐‘ค๐‘ค ฮณ๏ฟฝ represents the parameter of the filter which ๏ฟฝ ๐‘๐‘+1 ๐‘๐‘+1+ฮณ ๐‘–๐‘– ๐‘๐‘ 2.1.12 Generalized Vector Directional Filter (GVDF) resembles the standard VMF for ฮณ and AMF for ฮณ= 0. The above mentioned filters do not consider both the โ†’ โˆž unique features of a vector namely direction and 2.1.10 Vector Filters based on Non-Causal (NC) linear magnitude together which may produce erroneous results. prediction technique GVDF [18] is a generalization of BVDF. In the first step, a set of low- rank vectors that is the first terms are A group of switching filters based on noncausal linear selected from the ordered set of vectors based on the prediction is introduced in [16]. NC gives an estimate of aggregated sum of angular distance as oppose๐‘Ÿ๐‘Ÿ d to the IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.12, December 2016 69

BVDF in which a single vector with the minimum valued weights, then WVMF is the vector such that aggregated angular sum is selected. Next these vectors are [10, 21] { ; = 1, โ€ฆ , } and for all = 1, โ€ฆ , ๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š given as an input to an additional filter, e.g. alpha-trimmed ๐’™๐’™ (17) ๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š ๐‘–๐‘– average filter, multistage median filter or morphological ๐‘๐‘ ๐’™๐’™ โˆˆ ๐’™๐’™ ๐‘–๐‘– ๐‘๐‘ ๐‘๐‘ ๐‘—๐‘— ๐‘๐‘ ๐‘–๐‘–=1 ๐‘–๐‘– ๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š ๐‘–๐‘– ๐›พ๐›พ ๐‘–๐‘–=1 ๐‘–๐‘– ๐‘—๐‘— ๐’Š๐’Š ๐›พ๐›พ filters which consider magnitude processing. Hence Itโˆ‘ can๐‘ค๐‘ค beโˆฅ summarized๐’™๐’™ โˆ’ ๐’™๐’™ โˆฅas โ‰คfollows:โˆ‘ ๐‘ค๐‘ค sortโˆฅ ๐’™๐’™ theโˆ’ pixels๐’™๐’™ โˆฅ inside the GVDF considers both the directional and magnitude filtering window depending on the value of vector median, processing. duplicate each pixel to the number of their corresponding weight and the median value from the ๐‘–๐‘– 2.1.13 Directional Distance Filter (DDF) new sequence represents the๐’™๐’™ weighted vector median. ๐‘ค๐‘ค๐‘–๐‘– An improved filter is achieved by combining VMF and 2.2.2 ฮฑ-Trimmed Weighted Vector Median Filter (ฮฑ- VDF which is known as Directional Distance Filter (DDF) TWVMF) [18,19]. DDF considers the vectorโ€™s direction and magnitude in which both the vectorโ€™s chromaticity and ฮฑ-TWVMF [21] of vectors , , โ€ฆ , having weights intensity are considered. The combined aggregated , , โ€ฆ , is defined as 1 2 ๐‘ต๐‘ต measure is defined as follows: ๐’™๐’™ ๐’™๐’™ ๐’™๐’™ 1 2 ๐‘๐‘ = . ( , ) (16) ๐‘ค๐‘ค ๐‘ค๐‘ค =๐‘ค๐‘ค where ๐‘๐‘ (0, 1) is a parameter1โˆ’๐‘๐‘ which๐‘๐‘ tunes the๐‘๐‘ influence , if < ๐‘–๐‘– ๐‘—๐‘—=1 ๐‘–๐‘– ๐‘—๐‘— ๐›พ๐›พ ๐‘—๐‘—=1 ๐‘–๐‘– ๐‘—๐‘— ๐›ผ๐›ผโˆ’๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡ (18) โ„ฆof magnitude๏ฟฝโˆ‘ โˆฅ and๐’™๐’™ โˆ’ angle๐’™๐’™ โˆฅ quantities.๏ฟฝ ๏ฟฝโˆ‘ ๐ด๐ด ๐’™๐’™ ๐’™๐’™ ๏ฟฝ ๐’™๐’™ ๐‘๐‘, ๐‘๐‘ otherwise ๐‘๐‘ โˆˆ ๐’™๐’™๐›ผ๐›ผ โˆ‘๐‘–๐‘–=1 ๐‘ค๐‘ค๐‘–๐‘– โˆฅ ๐’™๐’™๐›ผ๐›ผ โˆ’ ๐’™๐’™๐‘–๐‘– โˆฅ โˆ‘๐‘–๐‘–=1 ๐‘ค๐‘ค๐‘–๐‘– โˆฅ ๐’™๐’™๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š โˆ’ ๐’™๐’™๐‘–๐‘– โˆฅ where๏ฟฝ ๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š = and = ; having < 2.1.14 Filters based on Hopfield Neural Network and ๐’™๐’™ 1 ๐›ผ๐›ผ is the sum๐’™๐’™๐‘–๐‘–โˆˆ๐‘†๐‘† ๐›ผ๐›ผof ๐‘–๐‘–weighted๐›ผ๐›ผ from๐‘–๐‘– vector ๐‘–๐‘– to all Improved Vector Median Filter ( ) ๐’™๐’™ โˆฃ๐‘†๐‘†๐›ผ๐›ผโˆฃ โˆ‘ ๐’™๐’™ ๐‘†๐‘† ๏ฟฝ๐’™๐’™ ๐‘†๐‘† , = 1, โ€ฆ , . other๐‘๐‘โˆ’๐›ผ๐›ผ vectors๐‘–๐‘– represents the ๐‘–๐‘–number In this filter, the noise detection in done using a Hopfield ๐‘†๐‘† ๏ฟฝ ๐‘†๐‘† ๐’™๐’™ , โ€ฆ of elements in ๐‘—๐‘— and ( ) is the๐›ผ๐›ผ smallest of . neural network (HNN) and in the second stage, the noisy can have any๐’™๐’™ value๐‘—๐‘— 0, 1, ๐‘๐‘โ€ฆโ€ฆโ€ฆ.,โˆฃ ๐‘†๐‘† โˆฃ๐‘ก๐‘ก โ„ŽN-1. pixels are replaced by an improved Vector Median Filter ๐‘†๐‘†๐›ผ๐›ผ ๐‘†๐‘† ๐‘–๐‘– ๐‘–๐‘– ๐‘†๐‘†1 ๐‘†๐‘†๐‘๐‘ first in RGB space and then in HSI space [20]. For the ๐›ผ๐›ผ2.2.3 Extended Weighted Vector Median Filter improved VMF, the steps are given by (EXWVMF) 1. The vector median is computed in RGB space inside the filtering window. The EXWVMF [21,22] is an extension of WVMF which 2. All the pixels fit for being median inside the is defined as filtering window are collected. = , if < 3. If more than one pixel is fit for being median, ๐ธ๐ธ๐ธ๐ธ๐ธ๐ธ๐ธ๐ธ๐ธ๐ธ๐ธ๐ธ ๐’™๐’™ , otherwise๐‘๐‘ ๐‘๐‘ then select that particular pixel which is nearest ๐’™๐’™๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š โˆ‘๐‘–๐‘–=1 ๐‘ค๐‘ค๐‘–๐‘– โˆฅ ๐’™๐’™๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š โˆ’ ๐’™๐’™๐‘–๐‘– โˆฅ โˆ‘๐‘–๐‘–=1 ๐‘ค๐‘ค๐‘–๐‘– โˆฅ ๐’™๐’™๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š โˆ’ ๐’™๐’™๐‘–๐‘– โˆฅ (19)๏ฟฝ to the mean of the Hue in HSI space ๐’™๐’™๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š 4. In Step 3 if more than one pixel is qualified, then where = (20) 1 ๐‘๐‘ the pixel which is nearest to the mean of EWVMF๐‘Š๐‘Š ๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š๐‘Šchooses๐‘๐‘ the average๐‘–๐‘–=1 ๐‘–๐‘– ๐‘–๐‘–as output in the smooth ๐’™๐’™ โˆ‘๐‘–๐‘–=1 ๐‘ค๐‘ค๐‘–๐‘– โˆ‘ ๐‘ค๐‘ค ๐’™๐’™ saturation in HSI space is selected. areas while it chooses weighted vector median (WVM) near edges. 2. 2 Weighted Vector Filters 2.2.4 Rank Order Weighted Vector Median Filter Weighted Vector Filters are extension of Weighted (ROWVMF) Standard Median Filters in which a non-negative weight is assigned to every pixel inside the filtering window In [23] an adaptive noise attenuating and edge enhancing offering more flexibility. filter based on the minimization of aggregated weighted distances among pixels in window is proposed. The 2.2.1 Weighted Vector Median Filter (WVMF) distance between a pixel and all other pixels inside the filtering window is ordered to obtain ( )by assigning a WVMF is a generalization of VMF in which each pixel ๐‘–๐‘– rank ๐’™๐’™ in the filter window is assigned a positive integer ๐‘‘๐‘‘๐‘–๐‘– ๐‘Ÿ๐‘Ÿ , , โ€ฆ , ( ), ( ), โ€ฆ , ( ) weight. The weight controls the filtering behavior while ๐‘Ÿ๐‘Ÿ ๐‘ฅ๐‘ฅ๐‘–๐‘– A weighted sum of distances is computed by utilizing the offering greater flexibility than the median-based filter. If ๐‘‘๐‘‘๐‘–๐‘–1 ๐‘‘๐‘‘๐‘–๐‘–2 ๐‘‘๐‘‘๐‘–๐‘–๐‘–๐‘– โ†’ ๐‘‘๐‘‘๐‘–๐‘– 1 ๐‘‘๐‘‘๐‘–๐‘– 2 ๐‘‘๐‘‘๐‘–๐‘– ๐‘๐‘ , , โ€ฆ , are vectors inside the filtering window and distance ranks denoted as follows: ( ) , , โ€ฆ , are the corresponding nonnegative integer- = . ( ) (21) 1 2 ๐‘๐‘ ๐‘๐‘ ๐’™๐’™ ๐’™๐’™ ๐’™๐’™ ๐‘–๐‘– ๐‘Ÿ๐‘Ÿ=1 ๐‘–๐‘– ๐‘Ÿ๐‘Ÿ ๐‘ค๐‘ค1 ๐‘ค๐‘ค2 ๐‘ค๐‘ค๐‘๐‘ ๐›ฌ๐›ฌ โˆ‘ ๐‘“๐‘“ ๐‘Ÿ๐‘Ÿ ๐‘‘๐‘‘ 70 IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.12, December 2016 where ( ) denotes a constantfunction associated with the noisy. Also noise characteristics varies in the image and distance rank . All the weighted aggregated distances hence nonadaptive filters have low performance. Adaptive are sorted๐‘“๐‘“ ๐‘Ÿ๐‘Ÿ forming a new order of vectors filters are introduced to handle the difficulty of varying ๐‘–๐‘– ( ), ( ), โ€ฆ , ๐‘Ÿ๐‘Ÿ( ) ( ), ( ), โ€ฆ , ( ) ๐›ฌ๐›ฌ noise characteristics by implementing estimation โˆ— โˆ— โˆ— procedures based on the nature of data on local image The1 output2 of the๐‘๐‘ ROWVMF1 2 is the๐‘๐‘ vector ( ). Another ๐›ฌ๐›ฌ ๐›ฌ๐›ฌ ๐›ฌ๐›ฌ โ†’ ๐’™๐’™ ๐’™๐’™ ๐’™๐’™ โˆ— statistics [3]. The coefficients of filter kernel change filter called Rank-based Vector Median Filter1 having similar concept is also designed in [24]. ๐’™๐’™ values depending on the image structure which is to be smoothed. 2.2.5 Weighted Vector Directional Filters (WVDF) 2.3.1 Adaptive Vector Median filter (AVMF) It employs a nonnegative real weighing coefficient { , , โ€ฆ } corresponding to vector elements In this filter desired features are made invariant to filtering { , , โ€ฆ } with filter output = which operation while the noisy pixels are effected by altering 1 2 ๐‘๐‘ minimizes๐‘ค๐‘ค ๐‘ค๐‘ค ๐‘ค๐‘คthe aggregated weighted angular distance with between VMF and the identity operation. This is based on 1 2 ๐‘๐‘ ๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š ๐‘–๐‘– other๐’™๐’™ ๐’™๐’™ vector๐’™๐’™ pixels given by [25, 26๐’™๐’™] ๐’™๐’™ โˆˆ ๐‘Š๐‘Š the decision rule expressed as follows [31] if , then is impulse = ( , ) (22) ๐‘๐‘ else is noise free๐‘๐‘ +1 w๐‘Š๐‘Šhere๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š๐‘Š ( , ) representsโˆ‘๐‘—๐‘—=1 ๐‘—๐‘— the ๐‘–๐‘–angle๐‘—๐‘— between two vectors. ๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰ โ‰ฅ ๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡ ๐’™๐’™ 2 ๐’™๐’™ ๐‘Ž๐‘Ž๐‘Ž๐‘Ž๐’™๐’™๐‘Ž๐‘Ž๐‘–๐‘–โˆˆ๐‘Ž๐‘Ž๐‘Ž๐‘Ž๐‘Ž๐‘Ž๐‘Š๐‘Š ๐‘ค๐‘ค ๐ด๐ด ๐’™๐’™ ๐’™๐’™ ๐‘๐‘+1 Similarly Weighted Directional Distance Filter (WDDF) is where is the vector distance between the central pixel ๐‘–๐‘– ๐‘—๐‘— ๐’™๐’™ 2 also obtained๐ด๐ด ๐’™๐’™ ๐’™๐’™ using both the magnitude and angular and the mean of the first vector order statistics ๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰ distance criteria. ๐‘๐‘+1, , โ€ฆ , associated with the ordered distances ๐’™๐’™( 2) ( ) ( ) ๐‘Ÿ๐‘Ÿ ( ), ( ), โ€ฆ , ( ) , for . is a prespecified 2.2.6 Genetic Algorithm based Weighted Vector ๐’™๐’™ 1 ๐’™๐’™ 2 ๐’™๐’™ ๐‘Ÿ๐‘Ÿ Directional Filter (GA WVDF) threshold1 2 value.๐‘Ÿ๐‘Ÿ Mathematically, is denoted by ๐ฟ๐ฟ ๐ฟ๐ฟ ๐ฟ๐ฟ ๐‘Ÿ๐‘Ÿ โ‰ค ๐‘๐‘ ๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡ = ( ) (24) An optimized WVDF based on Genetic Algorithm is 1 ๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰ ๐‘๐‘+1 ๐‘Ÿ๐‘Ÿ ๐‘–๐‘–=1 ๐‘–๐‘– designed in [27] which adapts the filter weights in order to where ฮณ characterizes2 ๐‘Ÿ๐‘Ÿ the norm used in Minkowski metric. ๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰ ๏ฟฝ๐’™๐’™ โˆ’ โˆ‘ ๐’™๐’™ ๏ฟฝ๐›พ๐›พ match the varying image and noise characteristics. Since If noise is detected the central pixel is replaced by the GA-based methods search the entire solution space, they vector median output. are able to provide a globally optimal (or very close) Another adaptive filter is the Adaptive Basic Vector solution as compared with other optimization techniques. Directional Filter (ABVDF) which is the angular Another filter based on Genetic Programming (GP) is counterpart of AVMF. developed in [28] aiming at the removal of mixed noise. The estimator is based on the global learning capability of 2.3.2 Adaptive based Impulsive Noise Removal Filter GP and measurement of local statistical properties of the healthy pixels present in the surrounding of the corrupted In [32], a new adaptive filtering scheme is proposed. The pixel. impulse is detected based on the difference between the aggregated distance assigned to central pixel and the 2.2.7 Center-Weighted Vector Median Filter (CWVMF) vector median output. The output of the filter is given as follows: In WVMF when the center weight is varied and the others = + (1 ) ( ) (25) remain fixed, a new class of filter is formed called the ๐‘๐‘+1 w๐‘œ๐‘œ๐‘œ๐‘œhere๐‘œ๐‘œ๐‘œ๐‘œ๐‘œ๐‘œ ๐‘œ๐‘œ is a filter parameter and1 is the VMF output. Center weighted Vector Median Filter (CWVMF) [29,30] ๐’™๐’™ ๐›ผ๐›ผ๐’™๐’™ 2 โˆ’ ๐›ผ๐›ผ ๐’™๐’™ ( ) is formed. It is defined as The value of is 0 when an impulse1 is present otherwise ๐›ผ๐›ผ ๐’™๐’™ = argmin ( ). (23) it is 1. ๐›ผ๐›ผ ๐‘๐‘ ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ 2 ๐‘—๐‘—+=12, ๐‘—๐‘—for = (๐‘–๐‘– +๐‘—๐‘—1)/2 2.3.3 Multiclass Support Vector Machine based Adaptive ๐’™๐’™with (๐‘˜๐‘˜ ) = ๐‘ฅ๐‘ฅ๐‘–๐‘–โˆˆ๐‘Š๐‘Š ๏ฟฝโˆ‘ ๐‘ค๐‘ค ๐‘˜๐‘˜ โˆฅ ๐’™๐’™ โˆ’ ๐’™๐’™ โˆฅ๏ฟฝ 1, otherwise Filter (MSVMAF) ๐‘—๐‘— ๐‘๐‘ โˆ’ ๐œ…๐œ… ๐‘—๐‘— ๐‘๐‘ where๐‘ค๐‘ค only๐‘˜๐‘˜ the๏ฟฝ central weight ( )/ is varied with smoothing parameter . A new filter called Multiclass Support Vector Machine ๐‘ค๐‘ค ๐‘๐‘+1 2 based Adaptive Filter (MSVMAF) is developed in [33] for 2.3 Adaptive Vector๐œ…๐œ… Filters reducing high density impulse noise. It takes the advantages of both multiclass Support Vector Machine VMF and its variants result in fixed amount of smoothing (SVM) as well as adaptive vector median filtering. leading to blurring of edges and fine details since they perform filtering operation on all pixels which may not be IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.12, December 2016 71

2.3.4 Adaptive Threshold and Color Correction (ATCC) filters are designed in [29,38,39]. They are based on user- Filter defined threshold for detection of impulses. If the central pixel is detected as corrupted, it is replaced by one of the For removing random-valued impulse noise, a new filter output of VMF, BVDF and DDF forming ACWVMF, named Adaptive Threshold and Color Correction (ATCC) ACWBVDF and ACWDDF. The mathematical filter is proposed in [34]. It has an adaptive threshold expressions of the corresponding filters are given below which is computed on the basis of local pixel statistics within the sliding window. , if >

= ๐œ†๐œ†+2 ๐‘๐‘+1 ๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰, otherwise๐‘˜๐‘˜=๐œ†๐œ† ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ 2.3.5 Robust Switching Vector Filter (RSVF) ๐’™๐’™ โˆ‘ โˆฅ ๐’™๐’™ ๐‘˜๐‘˜ โˆ’ ๐’™๐’™ 2 โˆฅ ๐‘‡๐‘‡ ๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด ๐’™๐’™ ๏ฟฝ ๐‘๐‘+1 In this filter, the pixels in the window are ordered (28) ๐’™๐’™ 2 according to the distance measure used in VFM, VDF and , if ( ) > DDF. A pixel is detected as corrupted if the cumulative = ๐œ†๐œ†+2 ๐‘๐‘+1 ๐ต๐ต๐ต๐ต๐ต๐ต๐ต๐ต, otherwise๐‘˜๐‘˜=๐œ†๐œ† ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ ๐’™๐’™ โˆ‘ ๐ด๐ด ๐’™๐’™ ๐‘˜๐‘˜ โˆ’ ๐’™๐’™ 2 ๐‘‡๐‘‡ distance ( )/ of the central pixel is larger than the ๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด median cumulative distance of the neighborhood. The (29)๐’™๐’™ ๏ฟฝ ๐‘๐‘+1 ๐‘๐‘+1 2 ๐’™๐’™ 2 output of๐‘‘๐‘‘ the filter is one of the outputs of VMF, VDF and = , if ( ) > DDF as follows: ๐’™๐’™๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด ๐œ†๐œ†+2 ๐›พ๐›พ ๐‘๐‘+1 ๐‘๐‘+1 1โˆ’๐›พ๐›พ (30) ๐ท๐ท๐ท๐ท๐ท๐ท, otherwise๐‘˜๐‘˜=๐œ†๐œ† ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ๐ถ = ๐’™๐’™ โˆ‘ ๐ด๐ด ๐’™๐’™ ๐‘˜๐‘˜ โˆ’ ๐’™๐’™ 2 โˆฅ ๐’™๐’™ ๐‘˜๐‘˜ โˆ’ ๐’™๐’™ 2 โˆฅ ๐‘‡๐‘‡ ( )/ , if ( )/ med . ( , โ€ฆ , ) < 0 ๏ฟฝ ๐‘๐‘+1 2 ๐’™๐’™๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘… (26) w๐’™๐’™here ฮป [1, 1] ๐‘๐‘+1, 2 otherwise๐‘๐‘+1 2 1 ๐‘๐‘ ๐‘๐‘+1 w๐’™๐’™here (.๐‘‘๐‘‘) is a robustโ‰ค univariate๐›ผ๐›ผ ๐‘‘๐‘‘ median๐‘‘๐‘‘ operator and ๏ฟฝ ๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘… 2.3.8. Modifiedโˆˆ 2 switchingโˆ’ median filter (MSMF) ๐’™๐’™ is a filter parameter used for preserving image details ๐‘š๐‘š๐‘š๐‘š๐‘š๐‘š and smoothing. If = ( , ) the output is It is an extension of the VMF and AVMF consisting of ๐›ผ๐›ผ ๐‘๐‘= denoted by the VMF ( ๐‘–๐‘– ๐‘—๐‘—=1 ๐›พ๐›พ ๐‘–๐‘– ) ๐‘—๐‘—to obtain Robust two-stage noise detector [40]. In the first stage, the Switching Vector ๐‘‘๐‘‘Medianโˆ‘ ๐ฟ๐ฟFilter๐’™๐’™ ๐’™๐’™ (RSVMF). If ๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘… ๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘… probably noisy candidates are detected using the AVMF = ( , ), ๐’™๐’™ = ๐’™๐’™ to represent Robust detection procedure as follows Switching๐‘๐‘ Basic Vector Directional Filter (RSBVDF) ๐‘‘๐‘‘๐‘–๐‘– โˆ‘๐‘—๐‘—=1 ๐ด๐ด ๐’™๐’™๐‘–๐‘– ๐’™๐’™๐‘—๐‘— ๐’™๐’™๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘… ๐’™๐’™๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘… , ( ) while for = ( ( , )) ( ( , )) , 1 = ๐‘€๐‘€๐‘€๐‘€๐‘€๐‘€๐‘€๐‘€ ๐‘๐‘+1 ๐‘Ÿ๐‘Ÿ (31) 1โˆ’๐›พ๐›พ ๐‘ ๐‘ ๐‘ ๐‘ ๐‘ ๐‘ ๐‘ ๐‘  2 ๐‘–๐‘–=1 ๐‘–๐‘– = which๐‘๐‘ is obtained๐›พ๐›พ ๐‘๐‘by the Directional ๐‘€๐‘€๐‘€๐‘€๐‘€๐‘€๐‘€๐‘€ ๐’š๐’š , ๏ฟฝotherwise๐’™๐’™ 2 โˆ’ ๐‘Ÿ๐‘Ÿ โˆ‘ ๐’™๐’™ ๏ฟฝ โ‰ฅ ๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡ ๐‘‘๐‘‘๐‘–๐‘– โˆ‘๐‘—๐‘—=1 ๐ด๐ด ๐’™๐’™๐‘–๐‘– ๐’™๐’™๐‘—๐‘— โˆ‘๐‘—๐‘—=1 ๐ฟ๐ฟ๐‘๐‘ ๐’™๐’™๐‘–๐‘– ๐’™๐’™๐‘—๐‘— ๐›พ๐›พ Distance filter output to represent Robust Switching ๐’š๐’š ๏ฟฝ ๐‘๐‘+1 ๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘… ๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘… In the second phase for preserving the edge pixels, these Directional๐’™๐’™ ๐’™๐’™ Distance filter (RSDDF) [35,36]. ๐’™๐’™ 2 noise candidates are again judged by four Laplacian 2.3.6 Adaptive Marginal Median filter (AMMF) operators in which the central pixel is convolved with four convolution kernals. For edge detection, the minimum A new modification to Vector Marginal Median Filter difference of the four convolutions denoted by is used (VMMF) is designed in [4] which aims at integrating the and the noisy samples are replaced by the VMF. The capability of VMMF as well as preserving output is defined as follows: ๐‘๐‘ the vector correlation resulting from VMF. From the = min | = 1, โ€ฆ ,4 (32) ordered aggregated distance used in VMF ๐‘๐‘+1 , ๐‘๐‘ ( ), ( ), โ€ฆ ( ) ( ), ( ), โ€ฆ ( ) , select a set of ๐’๐’ ๏ฟฝ๐’™๐’™ 2 โˆ— ๐‘Š๐‘Š ๐‘๐‘ ๏ฟฝ = ๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰, otherwise (33) vectors1 2 constituted๐‘๐‘ by1 2vectors๐‘๐‘ which are most similar ๐‘€๐‘€๐‘€๐‘€๐‘€๐‘€๐‘€๐‘€ ๐‘‘๐‘‘ ๐‘‘๐‘‘ ๐‘‘๐‘‘ โ†’ ๐’™๐’™ ๐’™๐’™ ๐’™๐’™ ๐’š๐’š ๐‘๐‘+1 ๐‘๐‘ โ‰ฅ ๐‘‡๐‘‡ to the Vector Median ( ) such that = ๐‘ ๐‘ ๐‘ ๐‘ ๐‘ ๐‘ ๐‘ ๐‘ 2 ๐’š๐’š ๏ฟฝ ๐’™๐’™ 2 { , ๐‘†๐‘† , โ€ฆ } ๐‘š๐‘š . 2.3.9 Sharpening Vector Median Filter ( ) ( ) ( ) for Then1 the Vector Marginal Median filter is applied to this set๐’™๐’™ to achieve high noise๐‘†๐‘† 1 2 ๐‘š๐‘š reduction.๐’™๐’™ ๐’™๐’™ The๐’™๐’™ output ๐‘š๐‘šofโ‰ค the๐‘๐‘ marginal median filter is In [23] if the function ( ) is a step-like function defined given as follows [37] by 1, for ๐‘“๐‘“ ๐‘Ÿ๐‘Ÿ = ( ) = (34) ( ({ , โ€ฆ }) , ({ , โ€ฆ }) , ( ({ , โ€ฆ }))) 0, otherwise ๐ด๐ด๐ด๐ด๐ด๐ด ( ) ( ) ( ) ( ) ( ) ( ) ๐’™๐’™ ๐‘…๐‘… ๐‘…๐‘… ๐บ๐บ ๐บ๐บ ๐ต๐ต ๐ต๐ต then a new vector๐‘Ÿ๐‘Ÿ โ‰ค ๐›ผ๐›ผ ๐‘Ž๐‘Žfilter๐‘Ž๐‘Ž๐‘Ž๐‘Ž ๐›ผ๐›ผ isโ‰ค ๐‘๐‘obtained known as the (27) 1 ๐‘๐‘ 1 ๐‘๐‘ 1 ๐‘๐‘ ๐‘“๐‘“ ๐‘Ÿ๐‘Ÿ ๏ฟฝ ๏ฟฝ๐‘š๐‘š๐‘š๐‘š๐‘š๐‘š ๐‘ฅ๐‘ฅ ๐‘ฅ๐‘ฅ ๏ฟฝ ๏ฟฝ๐‘š๐‘š๐‘š๐‘š๐‘š๐‘š ๐‘ฅ๐‘ฅ ๐‘ฅ๐‘ฅ ๏ฟฝ ๐‘š๐‘š๐‘š๐‘š๐‘š๐‘š ๐‘ฅ๐‘ฅ ๐‘ฅ๐‘ฅ Sharpening Vector Median Filter [41]. 2.3.7 Adaptive Center-Weighted Vector Filter

To provide more flexibility for modification in the size and shape of the window, adaptive center weighted vector 72 IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.12, December 2016

2.3.10 Adaptive rank weighted switching filter (ARWSF) Linear Discriminant computed on the aggregated distance and the outliers are replaced by the VMF. A modification ARWSF [42] is a modification of the Rank Order to peer group filter is the Fast Peer Group Filters (FPGF) Weighted Vector Median Filter which incorporates an [47] in which the central pixel is regarded as noise free if adaptive scheme. If the rank weighted distance assigned to pixels are found to be similar. If the noise density is the central pixel is denoted by , then the low, is kept low which reduces the number of distance ๐‘๐‘+1 ๐‘๐‘+1 calculation.๐‘š๐‘š In [48] a new Fast Averaging Peer Group difference = ( ) is used for measuring impulse ๐’™๐’™ 2 ๐›ฌ๐›ฌ 2 Filter๐‘š๐‘š (FAPGF) is designed in which a pixel is considered ๐‘๐‘+1 noise corruption. The output1 of ARWSF is given as ๐›ฟ๐›ฟ ๐›ฌ๐›ฌ 2 โˆ’ ๐›ฌ๐›ฌ as noisy if the peer group consists of at least two close follows: pixels. If this condition is not satisfied, the central pixel is , if > replaced by the weighted average of the uncorrupted = , otherwise (35) pixels from the neighborhood. In order to improve the ๐’™๐’™๐ด๐ด๐ด๐ด๐ด๐ด ๐›ฟ๐›ฟ ๐‘‡๐‘‡ where๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด is๐‘๐‘ +the1 output of the Arithmetic Mean Filter efficiency and detection, fuzzy metric can be used for ๐’š๐’š ๏ฟฝ ๐’™๐’™ 2 which is calculated using the non-corrupted pixels defining the peer group concept. ๐ด๐ด๐ด๐ด๐ด๐ด declared๐’™๐’™ by the detector. A two stage filter based on the fuzzy peer group concept is developed in [49] for removing Gaussian and impulse 2.4. Peer Group Vector Filters noise as well as mixed Gaussian impulse noise. It consists of a fuzzy rule โ€“based switching impulse noise filter Peer Group Filters use the neighborhood of each pixel followed by a fuzzy averaging filter. A fuzzy peer group is while building its peer group which is defined as a set defined as a fuzzy set which considers a peer group as constituted by the central pixel with neighboring pixels support set and membership degree of each peer group which are similar to it [43-45]. member is given by its fuzzy similarity with respect to the central pixel. A Novel Peer Group Filter (NPGF) is 2.4.1 Peer Group Averaging (PGA) Filter proposed in [50] in which the noise detection is done in the CIELab instead RGB color space in order to enhance For an image , the peer group associated with a pixel the noise detection ability. The peer group is formed by comprises of pixels in a predefined ร— window centered two different sized windows aiming at reducing the false at , whose intensity๐ผ๐ผ is nearest with . This pixel is then๐‘–๐‘– detection of non-corrupted pixels. replaced by the intensity of average๐‘™๐‘™ of๐‘™๐‘™ the peer group. This๐‘–๐‘– concept is referred to as Peer Group๐‘–๐‘– Averaging (PGA) 2.5. Fuzzy Vector Filters [44]. Fuzzy set concepts are suitable for dealing with ambiguity 2.4.2 Peer Group Vector Filter resulting from inexactness and imprecision in an image such as shape of objects, continuity of line segment and For color images, Peer Group filters [43] use the vector similarity of regions [2]. Also based on the fact that the filter such as VMF. To develop the peer group, first the human vision system is a fuzzy system, many fuzzy based pixels in window are sorted in ascending order according filters have been designed for image enhancement. The to the distance between the central pixel and the weights of Fuzzy filtersare determined from the features neighboring pixels as follows: of datainside the window by applying fuzzy = for = 1,2, โ€ฆ (36) transformation thus utilizing the local correlation [51]. ๐‘๐‘+1 This transformation can be modeled as a membership Then๐‘–๐‘– the peer group๐‘–๐‘– ๐›พ๐›พ of the central pixel is computed as ๐‘๐‘ โˆฅ ๐’™๐’™ 2 โˆ’ ๐’™๐’™ โˆฅ ๐‘–๐‘– ๐‘๐‘ function in accordance to a specific window component.A pixels that rank lowest in the ordered sequence with fuzzy set is defined by the membership function : given by ๐‘š๐‘š [0,1] that transforms the pixels in image to fuzzy set + 1 ๐‘š๐‘š ๐น๐น = with degree of membership ranging between 0 and 1.ยต ๐ผ๐ผ โ†’ 2 ๐ผ๐ผ To check๏ฟฝโˆš๐‘๐‘ the๏ฟฝ presence of impulse, the first order ๐‘š๐‘š 2.5.1 Fuzzy Weighted Average Filter [FWAF] difference of the peer group is calculated = for = 1,2, โ€ฆ The general form of fuzzy based filters is a fuzzy The central pixel is declared as noisy if any one of these ๐‘–๐‘– ๐‘–๐‘–+1 ๐‘–๐‘– weighted average [52,53] of the pixel values inside the ๐›ฟ๐›ฟdifferences๐‘๐‘ โˆ’ is๐‘๐‘ larger๐‘–๐‘– than a ๐‘š๐‘špre-specified threshold and filtering window. The output is estimated as the centroid replaced by VMF. given below In [46], a similar peer group switching filter is proposed ( ) = = (37) which utilizes the statistical properties of the sorted ๐‘๐‘ ( ) ๐‘๐‘ โˆ‘๐‘–๐‘–=1 ๐‘“๐‘“ ยต๐‘–๐‘– ๐’™๐’™๐‘–๐‘– sequence of the aggregated distance of pixels inside ๐น๐น๐น๐น๐น๐น๐น๐น ( ๐‘–๐‘–=)1 =๐‘–๐‘– ๐‘–๐‘– ๐‘๐‘ ๐’™๐’™where โˆ‘ ๐‘ค๐‘ค ๐’™๐’™ denotesโˆ‘๐‘–๐‘–=1 ๐‘“๐‘“ ยต ๐‘–๐‘– an adaptive function filtering window. Noise detection is based on the Fisherโ€™s determined from ๐œ†๐œ†the local context with membership ๐‘“๐‘“ ยต๐‘–๐‘– ยต๐‘–๐‘– IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.12, December 2016 73 function of the pixel and ฮป is a parameter such that One kind of these filters proposed in [15,55] can be ฮป [0, ). This filter should satisfy the following two described as follows: ๐‘–๐‘– ๐‘–๐‘– constraintsยต ๐‘ฅ๐‘ฅ Perform a pre-processing activity for removing impulse โˆˆ (i) โˆ Each weight is a positive number i.e. 0 noise from the set of pixels in the filtering window by and forming a new set = { ; = 1, โ€ฆ , } . This is ๐‘–๐‘– (ii) The sum of all the weights is equal๐‘ค๐‘ค โ‰ฅ to obtained by replacing โ€ฒthe minimumโ€ฒ and maximum๐‘Š๐‘Š ๐‘–๐‘– unity = 1. luminance values by the๐‘Š๐‘Š median๐’™๐’™ ๐‘–๐‘–pixel value๐‘๐‘ . The ๐‘๐‘ output of the filter is given by ๐‘–๐‘–=1 ๐‘–๐‘– ๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰ 2.5.2 Fuzzy Stack Fโˆ‘ilter๐‘ค๐‘ค ( ) ๐’™๐’™ = (41) ๐‘๐‘ ( โ€ฒ )โ€ฒ โˆ‘๐‘–๐‘–=1 ยต๐›ฑ๐›ฑ ๐›ฅ๐›ฅ๐’™๐’™๐‘–๐‘– ๐’™๐’™๐‘–๐‘– In [54] Fuzzy Stack Filters are proposed to extend the w๐น๐นhere๐น๐น๐น๐น ๐‘๐‘ = โ€ฒ and is the membership ๐’™๐’™ โˆ‘๐‘–๐‘–=1 ยต๐›ฑ๐›ฑ ๐›ฅ๐›ฅ๐’™๐’™๐‘–๐‘– smoothing characteristics of stack filters which is based on function whichโ€ฒ โ€ฒ describes a ฮ -type (i.e. a bell-shaped) ๐‘–๐‘– ๐‘–๐‘– ๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰ ๐›ฑ๐›ฑ the application of fuzzy positive Boolean function. fuzzy set๐›ฅ๐›ฅ๐’™๐’™ aiming๐’™๐’™ โˆ’ ๐’™๐’™at removingยต the pixels with large luminance values. 2.5.3 Fuzzy Vector Median Filter (FVMF) 2.5.7 Adaptive Nearest-Neighbor Filter (ANNF) In Fuzzy Vector Median Filter the dissimilarity distance measure used is the Minkowski metric which is fed as Adaptive nearest-neighbor filter (ANNF) is based on the an input to the membership function for determining the ๐›พ๐›พ nearest neighbor rule in which the fuzzy weights are fuzzy weights. The membership ๐ฟ๐ฟfunction is the calculated as follows [56]: exponential (Gaussian-like) form [52, 53]: = ( ) ( ) for = 1, 2, โ€ฆ . (42) ( ) ( ) ( ) = exp [ ] (38) ๐‘Ž๐‘Ž ๐‘๐‘ โˆ’๐‘Ž๐‘Ž ๐‘–๐‘– ๐‘Ÿ๐‘Ÿ ๐‘–๐‘– ๐ฟ๐ฟ๐›พ๐›พ ๐‘–๐‘– ๐‘ค๐‘คwhere๐‘Ž๐‘Ž ๐‘๐‘( โˆ’)๐‘Ž๐‘Ž is1 the๐‘–๐‘– maximum๐‘๐‘ angular distance and ( ) w๐‘–๐‘–here denotes a positive constant and is a distance represents the minimum angular distance associated with ยต โˆ’ ๐œ‰๐œ‰ ๐‘›๐‘› 1 threshold which control the amount of fuzziness in the the center๐‘Ž๐‘Ž -most pixel inside the filtering window. ๐‘Ž๐‘Ž weights.๐‘Ÿ๐‘Ÿ ๐œ‰๐œ‰ 2.5.8 Adaptive Nearest-Neighbor Multichannel Filter 2.5.4 Fuzzy Vector Directional Filter (FVDF) (ANNMF)

In Fuzzy directional filter the vector angle criterion An improvement in the ANNF is the Adaptive nearest- (angular distance) is used as the distance function and has neighbor multichannel filter (ANNMF) which combines asigmoidal membership function. The fuzzy weight vector directional with vector magnitude filtering. The associated with the vector is given by [52, 53] distance measure for noisy vector is given by the = (39) following formula [57] ( ( )) ๐‘–๐‘– ๐‘–๐‘– ๐œ‰๐œ‰ ๐’™๐’™ = (1 ( , )) (43) ๐’™๐’™ wh๐‘–๐‘– ere is the ๐‘Ÿ๐‘Ÿangular distance measure. ยต 1+exp โบ๐‘–๐‘– ๐‘๐‘ ๐‘–๐‘– , ๐‘—๐‘—=1= ๐‘–๐‘– 1๐‘—๐‘— (44) ๐‘–๐‘– ๐‘‘๐‘‘ โˆ‘ โˆ’ ๐‘†๐‘†๐‘ก๐‘ก ๐’™๐’™ ๐’™๐’™ ( , ) 2.5.5 Fuzzyโบ Ordered Vector Filter (FOVF) ๐’™๐’™๐‘–๐‘–๐’™๐’™๐‘—๐‘— โˆฃโˆฅ๐’™๐’™๐‘–๐‘–โˆฅโˆ’โˆฅ๐’™๐’™๐‘—๐‘—โˆฅโˆฃ ๐‘†๐‘†The๏ฟฝ๐’™๐’™ ๐‘–๐‘–first๐’™๐’™๐‘—๐‘—๏ฟฝ part๏ฟฝ โˆฃof๐’™๐’™๐‘–๐‘–โˆฃ โˆฃ๐’™๐’™the๐‘—๐‘—โˆฃ๏ฟฝ equation๏ฟฝ โˆ’ max representsโˆฃ๐’™๐’™๐‘–๐‘–โˆฃ โˆฃ๐’™๐’™๐‘—๐‘—โˆฃ ๏ฟฝ the vector angular Fuzzy Ordered Vector Filters use only a part of the criteria and second part is the normalized magnitude vector-valued pixels which are ordered according to their difference. According to this equation the directional corresponding fuzzy membership strengths. It is given as information is used when the vectors have same length follows: while the magnitude difference part is used when the

= ( ) ( ) (40) vectors have direction. 1 ๐œ๐œ where = ( ) ๐น๐น๐น๐น๐น๐น๐น๐น๐น๐น ๐‘๐‘ โˆ‘๐‘–๐‘–=1 ๐‘–๐‘– ๐‘–๐‘– 2.5.9Adaptive Hybrid Multichannel Filter (AHMF) ๐’™๐’™ ๐œ๐œ ๐‘ค๐‘คth ๐’™๐’™ ( ) denotes ๐‘–๐‘–the=1 i ๐‘–๐‘– ordered fuzzy membership function ๐‘๐‘ โˆ‘ ๐‘ค๐‘ค To achieve three objectives such as noise attenuation, such๐‘–๐‘– that ( ) ( ) ( ) with ( ) being the fuzzy๐‘ค๐‘ค coefficient having the largest membership value chromaticity retention and edges or detail preservation a ๐œ๐œ ๐œ๐œโˆ’1 1 1 [52].These๐‘ค๐‘ค filtersโ‰ค ๐‘ค๐‘ค resembleโ‰ค โ‹ฏ fuzzyโ‰ค ๐‘ค๐‘ค generalization๐‘ค๐‘ค of ฮฑ- new filter named Adaptive Hybrid Multichannel Filter trimmed filters. (AHMF) is introduced in [58]. The structure of AHMF consists of three parts: a Hybrid Multichannel (HM) filter, 2.5.6 Fuzzy Hybrid Filter (FHF) a fuzzy ruled-based system and a learning algorithm.HM comprises of four components: VMF, BVDF, Identity Hybrid filters combine a used for Filter (IF) and a summation combinatory. suppression of noise with a fuzzy weighted linear filter. 74 IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.12, December 2016

2.5.10 Fuzzy Impulse Detection and Reduction Method 2.6.2 Structure-Adaptive Hybrid Vector Filter (SAHVF) (FIDRM) In [61], another hybrid filter is designed. At each pixel For images corrupted with mixture of impulse noise and location, noise adaptive preprocessing and modified quad other types of noise, Fuzzy Impulse Detection and tree decomposition techniques are used for classifying the Reduction Method [59]is developed based on the concept corrupted image into several signal of fuzzy gradient values which constructs a fuzzy set activity categories. Then according to the structure impulse noise. This fuzzy set is denoted by a fuzzy classification, window adaptive hybrid filter is designed. membership function which is used by filtering method The hybrid filter consists of three sub filters as follows usually a fuzzy averaging of neighboring pixels. It results a) Modified Peer Group (MPG) which reduces an output image quasi without or with very little impulse image degradation in high-activity regions noise such that other filters can be applied afterwards. b) Adaptive Nearest Neighbor Filter (ANNF) which removes noise by preserving edge structures in 2.6. Hybrid Vector Filters medium-activity regions c) Structure Weighted Average Filter (SWAV) Hybrid Filters are combination of sub filters which belong which smoothes small in low-activity to different types giving an output being a linear or non- regions linear combination of the vector samples.

2.6.1 Vector Median Rational Hybrid filter (VMRHF)

Vector Median Rational Hybrid filters [60] are multispectral image processing filters based on rational functions. VMRHF comprises of three sub filters (two vector median filters and one centre weighted vector median filter) with a vector rational operation. The output of VMRHF results from the vector rational function considering three input sub functions ๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰ { , , ๐’™๐’™ } where is fixed as center weighted Fig. 2 Schematic diagram of Structure-Adaptive Hybrid Vector Filter vector1 sub2 filter3 and is given2 as ษธ ษธ ษธ ษธ ( ) 2.7 SigmaVector Filters = ( ) + (45) 3 ( ) ( ) โˆ‘๐‘—๐‘—=1 ๐‘Ž๐‘Ž๐‘—๐‘—ษธ๐‘—๐‘— ๐‘›๐‘› ๐’™๐’™with๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰ ๐‘‰๐‘‰ = [ษธ2, ๐‘›๐‘› , โ„Ž]+๐‘˜๐‘˜โˆฅ ษธrepresents1 ๐‘›๐‘› โˆ’ษธ3 ๐‘›๐‘› โˆฅ2the constant vector coefficient used to weight๐‘‡๐‘‡ the output of the three sub 1 2 3 filters.โบ andโบ โบare โบpositive constants, the former ensures numerical stability whereas the nonlinearity is regulated by the latter.โ„Ž ๐‘˜๐‘˜

Fig. 3 Concept of sigma filtering in which radius indicates the variance or variance multiplied by a tuning parameter.

Sigma filters combine the order statistics theory and standard deviation or approximation of multivariate variance. In the figure, the radius of the circles represents the approximation of the variance and if the central pixel Fig. 1 Structure of VMRHF lies inside the circle, it is healthy otherwise it is regarded as an outlier. IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.12, December 2016 75

2.7.1 Standard Sigma Filters ( ), for ( )/ = , otherwise (51) Sigma filters are adaptive switching filters which are ๐’™๐’™ 1 ๐›บ๐›บ ๐‘๐‘+1 2 โ‰ฅ ๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡ ๐‘†๐‘†๐‘†๐‘†๐‘†๐‘†๐‘†๐‘† ๐‘๐‘+1 ( ) based on the concept of standard deviation used for gray- w๐’š๐’šhere ๏ฟฝ๐’™๐’™= 2 ( ) + with = in which ( ) is ๐›บ๐›บ 1 scale images described in [62, 63]. Mathematically, the the smallest hybrid measureconsidering both magnitude 1 ๐›พ๐›พ๐›พ๐›พ ๐›พ๐›พ๐›พ๐›พ ๐‘๐‘โˆ’1 1 standard deviation is given by and angular๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡ distance๐›บ๐›บ ๐œ†๐œ† ๐œ“๐œ“and repre๐œ“๐œ“ sents the approximated๐›บ๐›บ = ( ( ) ) (46) variance. ๐œ“๐œ“๐ด๐ด 1 ๐‘๐‘ 2 ๐‘–๐‘– ๐œŽ๐œŽwhere๏ฟฝ ๐‘๐‘ โˆ‘represents๐‘–๐‘–=1 ๐’™๐’™ โˆ’ ๐’™๐’™๏ฟฝthe mean of the pixels inside the 2.7.3 Adaptive Vector Sigma Filters sliding window. The output of the sigma filter is described as ๐’™๐’™๏ฟฝ In Adaptive Vector Sigma Filters [67] the threshold is ( , , โ€ฆ , ), determined adaptively which employ the approximations

= ๐‘๐‘+1 of the multivariate variance based on the sample mean or 1 , 2 ๐‘๐‘ otherwise ๐‘“๐‘“ ๐’™๐’™ ๐’™๐’™ ๐’™๐’™ ๐‘–๐‘–๐‘–๐‘– โˆฃ ๐’™๐’™ 2 โˆ’ ๐’™๐’™๏ฟฝ โˆฃ ๐‘˜๐‘˜ โ‰ฅ ๐‘˜๐‘˜๐‘˜๐‘˜ the lowest-ranked vector. ๐‘ ๐‘ ๐‘ ๐‘ ๐‘ ๐‘ ๐‘ ๐‘ ๐‘ ๐‘  ๐’™๐’™(47) ๏ฟฝ ๐‘๐‘+1 (i) Design based on the sample mean ๐’™๐’™ 2 where (. ) is the smoothing function usually a median filter (a) Adaptive Sigma Vector Median Filter (ASVMF-mean) and is the smoothing factor. The output of ASVMF-mean is given by , if

2.7.2๐‘˜๐‘˜ Vector Sigma Filters = ๐‘๐‘+1 (52) ๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰, ๐›พ๐›พ ๐›พ๐›พ ๐’™๐’™ โˆฅ ๐’™๐’™ 2 โˆ’ ๐’™๐’™๏ฟฝ โˆฅ โ‰ฅ ๐œŽ๐œŽ ๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ดโˆ’๐‘š๐‘š๐‘š๐‘š๐‘š๐‘š๐‘š๐‘š The concept of standard sigma filter can be extended to w๐’š๐’šhere is the mean๏ฟฝ ๐‘๐‘+ 1of the samples inside the filtering ๐’™๐’™ 2 ๐‘œ๐‘œ๐‘œ๐‘œโ„Ž๐‘’๐‘’๐‘’๐‘’๐‘’๐‘’๐‘’๐‘’๐‘’๐‘’๐‘’๐‘’ multichannel images. For calculating the standard window and the variance for chosen norm is given by deviation, the Minkowski metric, the angular distance or = ๏ฟฝ๐’™๐’™ (( ) )2 (53) the combination of both can be used. If the central pixel is ๐œŽ๐œŽ ๐›พ๐›พ (b)2 Adaptive1 ๐‘๐‘ Sigma Basic2 Vector Directional Filter detected as noisy, it is replaced by one of the output of ๐œŽ๐œŽ๐›พ๐›พ ๐‘๐‘ โˆ‘๐‘–๐‘–=1 โˆฅ ๐’™๐’™๐‘–๐‘– โˆ’ ๐’™๐’™๏ฟฝ โˆฅ ๐›พ๐›พ VMF, BVDF or DDF otherwise it is left unchanged. (ASBVDF-mean) These filters require a tuning parameter for determining The output of ASBVDF-mean is given by , if ( , ) the switching threshold. These filters are described below = ๐‘๐‘+1 (54) [64-66] ๐œ†๐œ† ๐ต๐ต๐ต๐ต๐ต๐ต๐ต๐ต, otherwise ๐ด๐ด ๐’™๐’™ ๐ด๐ด ๐’™๐’™ 2 ๐’™๐’™๏ฟฝ โ‰ฅ ๐œŽ๐œŽ (a)Sigma Vector Median Filter (SVMF) ๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ดโˆ’๐‘š๐‘š๐‘š๐‘š๐‘š๐‘š๐‘š๐‘š w๐’š๐’šith angular definition๏ฟฝ ๐‘๐‘+1 of multichannel variance The output of sigma filter is described by ๐’™๐’™ 2 defined by 2 ( ), for ( )/ ๐ด๐ด = (48) = ( , ) (55) ๐œŽ๐œŽ 1 , otherwise๐‘๐‘+1 2 ๐’™๐’™ ๐ฟ๐ฟ โ‰ฅ ๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡ (c)2 Adaptive1 ๐‘๐‘ Sigma2 Directional Distance Filter (ASDDF- ๐’š๐’šwhere๐‘†๐‘†๐‘†๐‘†๐‘†๐‘†๐‘†๐‘† ๏ฟฝ ๐‘๐‘ +is1 a threshold determined from the ๐ด๐ด ๐‘๐‘ โˆ‘๐‘–๐‘–=1 ๐‘–๐‘– ๏ฟฝ ๐’™๐’™ 2 mean)๐œŽ๐œŽ ๐ด๐ด ๐’™๐’™ ๐’™๐’™ approximation of the multivariate variance of the The output of the ASDDF-mean is given by ๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡ vectors present in the window. = = ( ๐›พ๐›พ) + = ( ) (49) ๐œ“๐œ“ ๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด,โˆ’๐’™๐’™๏ฟฝ ( ( , )) . ( ) ๐‘๐‘โˆ’1+๐œ†๐œ† ๐’š๐’š with ๐‘๐‘+1 ๐‘๐‘ 1โˆ’๐‘๐‘ 1 ๐›พ๐›พ ๐‘๐‘โˆ’1 1 ๐ท๐ท๐ท๐ท๐ท๐ท, otherwise ๐‘–๐‘– ๐›พ๐›พ ๐‘๐‘๐‘๐‘ ๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡ ๐ฟ๐ฟ( ) ๐œ†๐œ†๐œ“๐œ“ ๐ฟ๐ฟ ๐’™๐’™ ๐‘–๐‘–๐‘–๐‘– ๐ด๐ด ๐’™๐’™ 2 ๐’™๐’™๏ฟฝ โˆฅ ๐’™๐’™ โˆ’ ๐’™๐’™๏ฟฝ โˆฅ โ‰ฅ ๐œŽ๐œŽ = , ( ) is the aggregated distance associated with ๐ฟ๐ฟ 1 ๏ฟฝ(56)๐‘๐‘ +1 the vector median ( ) and represents the tuning ๐’™๐’™ 2 ๐œ“๐œ“๐›พ๐›พ ๐‘๐‘โˆ’1 ๐ฟ๐ฟ 1 with variance is the combination of and given parameter. ๐’™๐’™ 1 ๐œ†๐œ† by 2 2 2 (b) Sigma Basic Vector Directional Filter (SBVDF) ๐œŽ๐œŽ๐‘๐‘๐‘๐‘ ๐œŽ๐œŽ๐›พ๐›พ ๐œŽ๐œŽ๐ด๐ด The output of SBVDF is given by = ( ) ( ) , for (ii)2 Design2 based1โˆ’๐‘๐‘ on2 ๐‘๐‘ the lowest-ranked vector ( ) ( )/ ๐œŽ๐œŽ๐‘๐‘๐‘๐‘ ๐œŽ๐œŽ๐›พ๐›พ ๐œŽ๐œŽ๐ด๐ด = , otherwise (50) In this family, the lowest-ranked vector is used in ๐’™๐’™ 1 ๐›ผ๐›ผ ๐‘๐‘+1 2 โ‰ฅ ๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡ calculation of the variance. ๐‘†๐‘†๐‘†๐‘†๐‘†๐‘†๐‘†๐‘†๐‘†๐‘† ๐‘๐‘+1 ( ) w๐’š๐’šhere ๏ฟฝ=๐’™๐’™ 2( ) + with = in which ( ) is (a) Adaptive Sigma Vector Median Filter (ASVMF-rank) ๐›ผ๐›ผ 1 the smallest aggregated angular distance and The output of ASVMF-rank is given by 1 ๐ด๐ด ๐ด๐ด ๐‘๐‘โˆ’1 1 , if represents๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡๐‘‡ the๐›ผ๐›ผ approximated๐œ†๐œ†๐œ“๐œ“ variance๐œ“๐œ“ calculated using๐›ผ๐›ผ the ( ) ๐ด๐ด = ๐‘๐‘+1 (57) angular distance. ๐œ“๐œ“ ๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰, 1 ๐›พ๐›พ ๐›พ๐›พ ๐’™๐’™ โˆฅ ๐’™๐’™ 2 โˆ’ ๐’™๐’™ โˆฅ โ‰ฅ ๐œŽ๐œŽ (c)Sigma Directional Distance Filter (SDDF) ๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ดโˆ’๐‘Ÿ๐‘Ÿ๐‘Ÿ๐‘Ÿ๐‘Ÿ๐‘Ÿ๐‘Ÿ๐‘Ÿ w๐’š๐’šhere is the๏ฟฝ lowest๐‘๐‘+1 -ranked vector inside the filtering The output of SDDF is given by ( ) ๐’™๐’™ 2 ๐‘œ๐‘œ๐‘œ๐‘œโ„Ž๐‘’๐‘’๐‘’๐‘’๐‘’๐‘’๐‘’๐‘’๐‘’๐‘’๐‘’๐‘’ window 1and the variance for chosen norm is given by ๐’™๐’™ 2 ๐œŽ๐œŽ ๐›พ๐›พ 76 IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.12, December 2016

, = (( ( ) ) ) (58) ( ) ( )/ ( )/ 1 = , (69) (b)2 Adaptive๐‘๐‘ Sigma Basic Vector2 Directional Filter ๐Ÿ๐Ÿ ๐‘๐‘+1 2 ๐‘๐‘+1 2 ๐œŽ๐œŽ๐›พ๐›พ ๐‘๐‘โˆ’1 โˆ‘๐‘–๐‘–=1 โˆฅ ๐’™๐’™๐‘–๐‘– โˆ’ ๐’™๐’™ 1 โˆฅ ๐›พ๐›พ ๐’™๐’™ ๐‘–๐‘–๐‘–๐‘– ๐‘ƒ๐‘ƒ โ‰ฅ ๐›ฝ๐›ฝ (ASBVDF-rank) w๐ธ๐ธhere๐ธ๐ธ๐ธ๐ธ๐ธ๐ธ ๐‘๐‘+1 is the adaptive threshold of the central ๐’š๐’š ( ๏ฟฝ๐’™๐’™ )/2 ๐‘œ๐‘œ๐‘œ๐‘œโ„Ž๐‘’๐‘’๐‘’๐‘’๐‘’๐‘’๐‘’๐‘’๐‘’๐‘’๐‘’๐‘’ The output of ASBVDF-rank is given by pixel and is the vector median output. Similarly other , ( , ) ๐‘๐‘+(1 ) 2 ( ) entropy๐›ฝ๐›ฝ vector filters such as Entropy Basic Vector = ๐‘๐‘+1 (59) 1 ๐ต๐ต๐ต๐ต๐ต๐ต๐ต๐ต, otherwise1 ๐ด๐ด Directional๐‘ฅ๐‘ฅ Filter (EBVDF) and Entropy Directional ๐’™๐’™ ๐‘–๐‘–๐‘–๐‘– ๐ด๐ด ๐’™๐’™ 2 ๐’™๐’™ โ‰ฅ ๐œŽ๐œŽ ๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ดโˆ’๐‘Ÿ๐‘Ÿ๐‘Ÿ๐‘Ÿ๐‘Ÿ๐‘Ÿ๐‘Ÿ๐‘Ÿ Distance Filter (EDDF) are also developed according to w๐’š๐’šith angular definition๏ฟฝ ๐‘๐‘+1 of multichannel variance ๐’™๐’™ 2 their corresponding distance and angular measure [70]. defined by 2 ๐œŽ๐œŽ๐ด๐ด = ( , ( )) (60) 2.9 Quaternion based Vector Filters 2 1 ๐‘๐‘ 2 (c)๐ด๐ด Adaptive๐‘–๐‘–= Sigma1 ๐‘–๐‘–Directional1 Distance Filter (ASDDF- rank)๐œŽ๐œŽ ๐‘๐‘โˆ’1 โˆ‘ ๐ด๐ด ๐’™๐’™ ๐’™๐’™ Another approach for impulsive noise removal is based on The output of the ASDDF-rank is given by the quaternion theory for improving the evaluation of = color dissimilarity. A quaternion number is a four dimensional number that consists of a real part and three , ( ( , ( ))) . ( ( ) ) ๐’š๐’š๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ด๐ดโˆ’๐‘Ÿ๐‘Ÿ๐‘Ÿ๐‘Ÿ๐‘Ÿ๐‘Ÿ๐‘Ÿ๐‘Ÿ imaginary parts , and [71-73]. In the hyper๐‘ž๐‘ž complex ๐‘๐‘+1 ๐‘๐‘ 1โˆ’๐‘๐‘ ๐ท๐ท๐ท๐ท๐ท๐ท, otherwise 01 ๐‘–๐‘– 1 ๐›พ๐›พ ๐‘๐‘๐‘๐‘ ๐‘Ž๐‘Ž ๐’™๐’™ ๐‘–๐‘–๐‘–๐‘– ๐ด๐ด ๐’™๐’™ 2 ๐’™๐’™ โˆฅ ๐’™๐’™ โˆ’ ๐’™๐’™ โˆฅ โ‰ฅ ๐œŽ๐œŽ form, it is represented as ๏ฟฝ ๐‘๐‘+1 = + + ๐‘๐‘+๐‘๐‘ ๐‘‘๐‘‘ (70) ๐’™๐’™ 2 โ‰ฅ (61) with variance is the combination of and given where , and are the complex operators, which obey the following๐‘ž๐‘ž ๐‘Ž๐‘Ž ๐‘๐‘ rules๐šค๐šคฬ‚ ๐‘๐‘ ๐šฅ๐šฅฬ‚ ๐‘‘๐‘‘๐‘˜๐‘˜๏ฟฝ by 2 2 2 ๐‘๐‘๐‘๐‘ ๐›พ๐›พ ๐ด๐ด = ๐šค๐šคฬ‚ =ศทฬ‚ =๐‘˜๐‘˜๏ฟฝ 1 = ( ) ๐œŽ๐œŽ( ) (62) ๐œŽ๐œŽ ๐œŽ๐œŽ 2 2 2 2 2 1โˆ’๐‘๐‘ 2 ๐‘๐‘ = , = , = ๐‘๐‘๐‘๐‘ ๐›พ๐›พ ๐ด๐ด ๐šค๐šคฬ‚ ๐šฅ๐šฅฬ‚ ๐‘˜๐‘˜๏ฟฝ โˆ’ ๐œŽ๐œŽ2.8 Entropy๐œŽ๐œŽ Vector๐œŽ๐œŽ Filters = , = , = Multiplication๐šค๐šคฬ‚๐šฅ๐šฅฬ‚ ๐‘˜๐‘˜๏ฟฝ ๐šฅ๐šฅฬ‚๐‘˜๐‘˜๏ฟฝ ๐šค๐šคฬ‚ ๐‘˜๐‘˜๏ฟฝof๐šค๐šคฬ‚ the๐šฅ๐šฅฬ‚ quaternion is not commutative. A ๏ฟฝ ๏ฟฝ Entropy Vector Filters are adaptive multichannel filters pure๐šฅ๐šฅฬ‚๐šค๐šคฬ‚ โˆ’quaternion๐‘˜๐‘˜ ๐‘˜๐‘˜๐šฅ๐šฅฬ‚ โˆ’ has๐šค๐šคฬ‚ ๐šค๐šค๐‘˜๐‘˜ฬ‚ =โˆ’0๐šฅ๐šฅ.ฬ‚ The modulus and conjugate of based on the local contrast entropy introduced by a quaternion are Beghdadi and Khellaf in [68] for gray scale image. Each | | = + + ๐‘Ž๐‘Ž+ (71) pixel inside the filtering window is associated with its = 2 2 2 2 (72) contrast defined by ๐‘ž๐‘ž โˆš๐‘Ž๐‘Ž ๐‘๐‘ ๐‘๐‘ ๐‘‘๐‘‘ ๐‘–๐‘– A unit quaternion has unit modulus. A quaternion in the |๐‘ฅ๐‘ฅ | ๐‘ž๐‘ž๏ฟฝ ๐‘Ž๐‘Ž โˆ’ ๐‘๐‘๐šค๐šคฬ‚ โˆ’ ๐‘๐‘๐šฅ๐šฅฬ‚ โˆ’ ๐‘‘๐‘‘๐‘˜๐‘˜๏ฟฝ = ๐‘–๐‘– = (63) polar form is represented as ๐‘ฅ๐‘ฅ๐‘–๐‘–โˆ’๐ถ๐ถ๐‘ฅ๐‘ฅฬ… ๐›ฅ๐›ฅ๐‘–๐‘– | | with is the gradient and represents the mean of the = ๐‘–๐‘– ๐‘ฅ๐‘ฅฬ… ๐‘ฅ๐‘ฅฬ… ( ) input๐ถ๐ถ { , , โ€ฆ }. The local contrast probability is = ๐œ‡๐œ‡๐œ‡๐œ‡+ (73) ๐‘–๐‘– ๐‘ž๐‘ž ๐‘ž๐‘ž ๐‘’๐‘’ given๐›ฅ๐›ฅ by ๐‘ฅ๐‘ฅฬ… where is a unit pure quaternion and = + + / 3; ๐‘ฅ๐‘ฅ1 ๐‘ฅ๐‘ฅ2 ๐‘ฅ๐‘ฅ๐‘๐‘ and๐‘๐‘๐‘๐‘๐‘๐‘๐‘๐‘ are๐œ‡๐œ‡ ๐œ‡๐œ‡๐œ‡๐œ‡๐œ‡๐œ‡๐œ‡๐œ‡referred to as the eigenaxis and eigenangle = (64) ๏ฟฝ ๐›ฅ๐›ฅ๐‘–๐‘– respectively.ยต ยต ๏ฟฝ ๐šค๐šคฬ‚ ๐šฅ๐šฅฬ‚ ๐‘˜๐‘˜๏ฟฝ โˆš ๐‘–๐‘– ๐‘๐‘ ๐‘ƒ๐‘ƒAny โˆ‘pixel๐‘—๐‘—=1 ๐›ฅ๐›ฅ ๐‘–๐‘– is considered as noisy if the local contrast An๐œ‡๐œ‡ RGB๐œƒ๐œƒ color pixel can be represented in quaternion form probability is too high. In case of multichannel image, the as local contrast probability is given by = + + (74) (| |) where , and denote the pixel values of red, green = 1 , (65) 1 1 1 1 ๏ฟฝ ๐‘š๐‘š ๐›พ๐›พ ๐›พ๐›พ ๐‘ž๐‘žand blue๐‘Ÿ๐‘Ÿ ๐šค๐šคฬ‚ channels๐‘”๐‘” ๐šฅ๐šฅฬ‚ ๐‘๐‘ respectively.Any๐‘˜๐‘˜ unit quaternion U can ๏ฟฝโˆ‘๐‘˜๐‘˜=1 ๐‘ฅ๐‘ฅ๐‘–๐‘–๐‘–๐‘–| โˆ’๐‘ฅ๐‘ฅฬ…๐‘˜๐‘˜ |๏ฟฝ 1 1 1 ๐‘–๐‘– 1 be represented๐‘Ÿ๐‘Ÿ ๐‘”๐‘” ๐‘๐‘as = | | . The quaternion unit ๐‘๐‘ ๐‘š๐‘š ๐›พ๐›พ ๐›พ๐›พ where๐‘ƒ๐‘ƒ represents๐‘–๐‘–๐‘–๐‘– ๐‘˜๐‘˜ the component of the mean. โˆ‘๐‘—๐‘—=1๏ฟฝโˆ‘๐‘˜๐‘˜=1 ๐‘ฅ๐‘ฅ โˆ’๐‘ฅ๐‘ฅฬ… ๏ฟฝ transform of a color pixel can๐œ‡๐œ‡๐œ‡๐œ‡ be expressed as follows Noisy pixels contribute heavily๐‘ก๐‘กโ„Ž to the entropy defined by ๐‘˜๐‘˜ [74] ๐‘ˆ๐‘ˆ ๐‘ˆ๐‘ˆ ๐‘’๐‘’ = ๐œ‡๐œ‡ ๐‘˜๐‘˜ 1 (66) = = [ + ๐‘ž๐‘ž ] + + [ It is assumed that each sample is associated with an ๐‘–๐‘– ๐‘–๐‘– ๐‘–๐‘– ๐ป๐ป โˆ’๐‘ƒ๐‘ƒ ๐‘™๐‘™๐‘™๐‘™๐‘™๐‘™๐‘ƒ๐‘ƒ ] =1 + + 12 + 1 1 + + adaptive threshold defined as the rate of change of local ๐‘Œ๐‘Œ ๐‘ˆ๐‘ˆ๐‘ž๐‘ž ๐‘ˆ๐‘ˆ๏ฟฝ ๐‘๐‘๐‘๐‘๐‘๐‘๐‘๐‘ ๐œ‡๐œ‡๐œ‡๐œ‡๐œ‡๐œ‡๐œ‡๐œ‡๐œ‡๐œ‡ ๏ฟฝ๐‘Ÿ๐‘Ÿ ๐šค๐šคฬ‚ ๐‘”๐‘” ๐šฅ๐šฅฬ‚ ๐‘๐‘ ๐‘˜๐‘˜๏ฟฝ๏ฟฝ ๐‘๐‘๐‘๐‘๐‘๐‘๐‘๐‘ โˆ’ contrast entropy and the overall entropy expressed as 2 ๐‘–๐‘– +1 [( 1 1 ๏ฟฝ) + ( 3) 1 + 1 ( ๐›ฝ๐›ฝ ๐œ‡๐œ‡๐œ‡๐œ‡๐œ‡๐œ‡๐œ‡๐œ‡๐œ‡๐œ‡ ๏ฟฝ๐‘Ÿ๐‘Ÿ ๐šค๐šคฬ‚ ๐‘”๐‘” ๐šฅ๐šฅฬ‚ ๐‘๐‘ ๐‘˜๐‘˜๏ฟฝ๐‘๐‘๐‘๐‘๐‘๐‘ ๐œƒ๐œƒ โˆš ๐œ‡๐œ‡๏ฟฝ๐‘Ÿ๐‘Ÿ ๐šค๐šคฬ‚ ๐‘”๐‘” ๐šฅ๐šฅฬ‚ = (67) 2 1 ๐‘–๐‘– 1) 2 1 1 1 1 1 โˆ’๐‘ƒ๐‘ƒ๐‘–๐‘–๐‘™๐‘™๐‘™๐‘™๐‘™๐‘™๐‘ƒ๐‘ƒ๐‘–๐‘– ๐ป๐ป ๐ป๐ป ๐‘๐‘ ๐‘˜๐‘˜๏ฟฝ๏ฟฝ๐‘ ๐‘ ๐‘ ๐‘ ๐‘ ๐‘  ๐œƒ๐œƒ โˆš3 ๐‘๐‘ โˆ’ ๐‘”๐‘” ๐šค๐šคฬ‚ ๐‘Ÿ๐‘Ÿ โˆ’ ๐‘๐‘ ๐šฅ๐šฅฬ‚ ๐‘”๐‘” โˆ’ The๐‘–๐‘– output๐‘๐‘ of the entropy vector median filter (EVMF) = + + (75) ๐›ฝ๐›ฝ โˆ’ โˆ‘๐‘—๐‘—=1 ๐‘ƒ๐‘ƒ๐‘—๐‘—๐‘™๐‘™๐‘™๐‘™๐‘™๐‘™๐‘ƒ๐‘ƒ๐‘—๐‘— 1 ๏ฟฝ [69] is given by ๐‘Ÿ๐‘Ÿwhere๐‘˜๐‘˜๏ฟฝ๐‘ ๐‘  ๐‘ ๐‘ ๐‘ ๐‘  ๐œƒ๐œƒ = + + 2 , = , if ๐‘Œ๐‘Œ๐‘…๐‘…๐‘…๐‘…๐‘…๐‘… ๐‘Œ๐‘Œ๐ผ๐ผ ๐‘Œ๐‘Œโˆ† ( ) ( )/ ( )/ ( + + ) , = (68) ๐‘Œ๐‘Œ๐‘…๐‘…๐‘…๐‘…๐‘…๐‘… ๏ฟฝ๐‘Ÿ๐‘Ÿ1๐šค๐šคฬ‚๐‘–๐‘– ๐‘”๐‘”1๐šฅ๐šฅฬ‚๐‘—๐‘— ๐‘๐‘1๐‘˜๐‘˜๏ฟฝ๐‘˜๐‘˜๏ฟฝ๐‘๐‘๐‘๐‘๐‘๐‘ ๐œƒ๐œƒ ๐‘Œ๐‘Œ๐ผ๐ผ 1 , otherwise๐‘๐‘+1 2 ๐‘๐‘+1 2 2 2 ๐’™๐’™ ๐‘ƒ๐‘ƒ โ‰ฅ ๐›ฝ๐›ฝ 1 1 1 ๐ธ๐ธ๐ธ๐ธ๐ธ๐ธ๐ธ๐ธ ๐‘๐‘+1 โˆš3 ๐œ‡๐œ‡ ๐‘Ÿ๐‘Ÿ ๐šค๐šคฬ‚ ๐‘”๐‘” ๐šฅ๐šฅฬ‚ ๐‘๐‘ ๐‘˜๐‘˜๏ฟฝ ๐‘ ๐‘ ๐‘ ๐‘ ๐‘ ๐‘  ๐œƒ๐œƒ ๐’š๐’š ๏ฟฝ๐’™๐’™ 2 IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.12, December 2016 77

= [( ) + ( ) + (g r )k 2 ; for removing mixture noise. In [80] a new two-stage filter 1 is proposed which incorporates the peer group concept represents the intensity of the color image; is the ๐‘Œ๐‘Œโˆ† โˆš3 ๐‘๐‘1 โˆ’ ๐‘”๐‘”1 ๐šค๐šคฬ‚ ๐‘Ÿ๐‘Ÿ1 โˆ’ ๐‘๐‘1 ๐šฅ๐šฅฬ‚ 1 โˆ’ 1 ๏ฟฝ๏ฟฝ๐‘ ๐‘ ๐‘ ๐‘ ๐‘ ๐‘  ๐œƒ๐œƒ along with the quaternion based distance measure for projection of the tristimuli in Maxwell triangle rotated 90 , ๐‘Œ๐‘Œ ๐ผ๐ผ ๐‘Œ๐‘Œโˆ† impulse detection. The probably noisy pixels are replaced and it represents the chromaticity [3]. When = , =0 by Weighted Vector Median Filter in the second stage. ๐œ‹๐œ‹ | = 1 2 + 1 6 + + and = 0, = The concept of quaternion is extended in video sequences ๐œƒ๐œƒ 4 ๐‘‡๐‘‡ ๐œ‹๐œ‹ for removal of random-valued impulse noise in [81]. The (1 3)( + + ) + + = 1๐‘…๐‘…๐‘…๐‘…๐‘…๐‘… 3 ( ๐ผ๐ผ ๐‘ˆ๐‘ˆ ๐œƒ๐œƒ=4 ๏ฟฝ โ„โˆš ๏ฟฝ ๏ฟฝ โ„โˆš ๏ฟฝ๏ฟฝ๐šค๐šคฬ‚ ๐šฅ๐šฅaฬ‚ nd๐‘˜๐‘˜๏ฟฝ๏ฟฝ ๐‘Œ๐‘Œ [ ๐‘Œ๐‘Œ luminance and chromaticity difference are represented in ) + ( ) + ( ) ] .Similarly, can be quaternion form which are combined together for โ„ ๐‘Ÿ๐‘Ÿ1 ๐‘”๐‘”1 ๐‘๐‘1 ๏ฟฝ๐šค๐šคฬ‚ ๐šฅ๐šฅฬ‚ ๐‘˜๐‘˜๏ฟฝ๏ฟฝ ๐‘Œ๐‘Œโˆ† ๏ฟฝ โ„โˆš ๏ฟฝ ๐‘๐‘1 โˆ’ defined as follows measuring color difference between color samples. Based 1 1 1 1 1 ๏ฟฝ ๏ฟฝ ๐‘”๐‘” =๐šค๐šคฬ‚ ๐‘Ÿ๐‘Ÿ โˆ’= ๐‘๐‘( ๐šฅ๐šฅฬ‚ + ๐‘”๐‘” +โˆ’ ๐‘Ÿ๐‘Ÿ )๐‘˜๐‘˜ + + [๐‘Œ๐‘Œ( on this color difference, the color vectors along the 1 1 ) + ( ) + ( ) ] = (76) horizontal, vertical and diagonal directions in current ๐‘Œ๐‘Œ๏ฟฝ ๐‘‡๐‘‡๏ฟฝ๐‘ž๐‘ž1๐‘‡๐‘‡ 3 ๐‘Ÿ๐‘Ÿ1 ๐‘”๐‘”1 ๐‘๐‘1 ๏ฟฝ๐šค๐šคฬ‚ ๐šฅ๐šฅฬ‚ ๐‘˜๐‘˜๏ฟฝ๏ฟฝ โˆ’ โˆš3 ๐‘๐‘1 โˆ’ frame and adjacent frames on motion trajectory are utilize = ( + 1 and 1 1can be1 expressed1 ๐ผ๐ผ asโˆ† for the detection of presence of impulse. For noisy pixels, ๐‘”๐‘” ๐šค๐šคฬ‚ ๐‘Ÿ๐‘Ÿ โˆ’ ๐‘๐‘ ๐šฅ๐šฅฬ‚ ๐‘”๐‘” โˆ’ ๐‘Ÿ๐‘Ÿ ๐‘˜๐‘˜๏ฟฝ ๐‘Œ๐‘Œ โˆ’ ๐‘Œ๐‘Œ 1 ๐ผ๐ผ )and โˆ†= ( ). ๐ผ๐ผ 1 a 3-D weighted vector median operation is carried out ๐‘Œ๐‘Œ ๐‘Œ๐‘Œ ๐‘Œ๐‘Œ 2 ๐‘‡๐‘‡๐‘ž๐‘ž ๐‘‡๐‘‡๏ฟฝ The color pixel1 difference between two pixels and while the other pixels are left intact. Another filter for ๐‘‡๐‘‡๏ฟฝ๐‘ž๐‘ž1๐‘‡๐‘‡ ๐‘Œ๐‘Œโˆ† 2 ๐‘‡๐‘‡๐‘ž๐‘ž1๐‘‡๐‘‡๏ฟฝ โˆ’ ๐‘‡๐‘‡๏ฟฝ๐‘ž๐‘ž1๐‘‡๐‘‡ removal of random-valued impulse noise from video can be written as the sum of the intensity and chromaticity ๐‘–๐‘– ๐‘—๐‘— sequences is also designed in [82]. differences as follows: ๐‘ž๐‘ž ๐‘ž๐‘ž , = , + , (76) 2.10 Morphology based filters where , = (1 2)|( + ) ( + ๐‘‘๐‘‘๏ฟฝ๐‘ž๐‘ž๐‘–๐‘– ๐‘ž๐‘ž๐‘—๐‘—๏ฟฝ ๐‘‘๐‘‘๐ผ๐ผ๏ฟฝ๐‘ž๐‘ž๐‘–๐‘– ๐‘ž๐‘ž๐‘—๐‘—๏ฟฝ ๐‘‘๐‘‘โˆ†๏ฟฝ๐‘ž๐‘ž๐‘–๐‘– ๐‘ž๐‘ž๐‘—๐‘—๏ฟฝ )| is the color intensity difference Morphological filters (MF) are designed by parallel or ๐‘‘๐‘‘๐ผ๐ผ๏ฟฝ๐‘ž๐‘ž๐‘–๐‘– ๐‘ž๐‘ž๐‘—๐‘—๏ฟฝ โ„ ๐‘‡๐‘‡๐‘ž๐‘ž๐‘–๐‘–๐‘‡๐‘‡๏ฟฝ ๐‘‡๐‘‡๏ฟฝ๐‘ž๐‘ž๐‘–๐‘–๐‘‡๐‘‡ โˆ’ ๐‘‡๐‘‡๐‘ž๐‘ž๐‘—๐‘—๐‘‡๐‘‡๏ฟฝ and , = (1 2)|( ) ( sequential combination of the basic fundamental ๐‘‡๐‘‡๏ฟฝ๐‘ž๐‘ž๐‘—๐‘—๐‘‡๐‘‡ )|is the color chromaticity difference.The intensity morphological operations such as erosion, dilation, โˆ† ๐‘–๐‘– ๐‘—๐‘— ๐‘–๐‘– ๏ฟฝ ๏ฟฝ ๐‘–๐‘– ๐‘—๐‘— ๏ฟฝ opening and closing [83-85]. The common structures of difference๐‘‘๐‘‘ ๏ฟฝ ๐‘ž๐‘žand๐‘ž๐‘ž ๏ฟฝ chromaticityโ„ difference๐‘‡๐‘‡๐‘ž๐‘ž ๐‘‡๐‘‡ โˆ’ ๐‘‡๐‘‡ ๐‘ž๐‘žapproach๐‘‡๐‘‡ โˆ’ ๐‘‡๐‘‡๐‘ž๐‘ž zero๐‘‡๐‘‡ โˆ’ ๐‘—๐‘— MF are defined as ๐‘‡๐‘‡when๏ฟฝ๐‘ž๐‘ž ๐‘‡๐‘‡ is very similar to . OC Filter Opening followed by Closing In [75-76] a switching VMF based on quaternion impulse ๐‘–๐‘– ๐‘—๐‘— CO Filter Closing followed by Opening (79) ๐‘ž๐‘ž ๐‘ž๐‘ž ร— 5 detector is proposed using 5 window. The quaternion Erosion distributesโ†’ the local minima while dilation color difference between pixels along the four directional โ†’ ยฐ ยฐ ยฐ ยฐ distributes the local maxima within the sliding window operators at0 , 45 , 90 and135 are computed. An average defined by the structuring element which resembles a color difference between the central pixel and other min/max filtering action for suppression of impulse noise. pixel values in the direction = (1, 2, 3,4) for respective In [86], an extension of MF to multichannel images on ๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰โ„Ž degrees are computed as follows: learning-based morphological color operations is = , โ„Ž (77) developed. The color pixel ordering scheme is learned in = min1 (4 , , , ) accordance to pre-estimation of healthy and corrupted โ„Ž 4 ๐‘—๐‘—=1 ๐‘–๐‘– ๐‘—๐‘— The๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰ aboveโˆ‘ two โˆฃequations๐‘‘๐‘‘๏ฟฝ๐’™๐’™ ๐’™๐’™ ๏ฟฝ areโˆฃ used for impulse detection. If pixels where the corrupted samples are ordered either as 1 2 3 4 ๐‘‰๐‘‰the๐‘‰๐‘‰๐‘‰๐‘‰ central pixel๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰ is๐‘‰๐‘‰ ๐‘‰๐‘‰an๐‘‰๐‘‰ impulse,๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰ ๐‘‰๐‘‰๐‘‰๐‘‰ its๐‘‰๐‘‰ value will be large maximum in erosion or minimum in dilation. The SVM is otherwise it is small. Hence the output of the filter is given used as the classification technique of such learning-based by ๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰ multichannel MF in the RGB color domain. After each ( ), if morphological operation, the image reconstruction step is = (78) carried out for restoring the original features. ( ๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰)/ , otherwise ๐‘„๐‘„๐‘„๐‘„๐‘„๐‘„๐‘„๐‘„ ( ๐‘„๐‘„) ๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰ โ‰ฅ ๐‘‡๐‘‡ Extension of mathematical morphology to multivariable w๐’™๐’™ here ๏ฟฝ represents the VMF calculated in Quaternion ๐’™๐’™ ๐‘๐‘+1 2 data such as multichannel image is performed in [87-89]. form and ๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰T being a pre-specified threshold. In order to develop multivariate morphological operators, ๐‘„๐‘„ In [77] another Quaternion Switching Vector Median various complex mathematical tools such as machine Filter (QSVMF) is developed based on both the intensity learning [90], principal component analysis [91], hyper and chromaticity differences described above. complex [92], rand projection depth function [93], group- A modification of QSVMF is designed in [78]. It is invariant frames [94], and probabilistic extrema estimation different from other related works in the impulse detection [95] are used. which utilizes the pixels along only a direction with Based on the self-duality property of morphological maximum number of similar pixels while other utilize the operator, a multivariate self-dual morphological operator color differences between the central pixel and its is developed in [96] which is applicable for noise removal neighboring pixels in the four-edge direction. and segmentation purposes. A pair of symmetric vector A two-stage filter using both the Quaternion based Switching filter and a local mean filter is designed in [79] 78 IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.12, December 2016 ordering is introduced in order to develop multivariate remaining pixels which are not flagged as outliers are used dual morphological operators. for calculating the Vector median and the noisy pixel is Quantile filters and a group of morphological gradient replaced by the corresponding vector median. filters are proposed in [97]. Their properties and links with dilation and erosion operators are also investigated. 2.12.2 Similarity based Impulsive Noise Removal Filter Another quantile filter is also designed in [98]. In [99], a new hybrid filter based on mathematical In [106] a filter based on similarities between the pixels in morphology and trimmed standard median filter is a predefined window is developed. If { , โ€ฆ , } denote the pixels in a filtering window, then a convex similarity developed. For impulse detection, mathematical ๐‘–๐‘– ๐‘๐‘ morphology such as erosion and dilation are utilized. function is used to find the similarity between๐’™๐’™ ๐’™๐’™pixels. For Erosion refers to the computation of local minima while the central pixel and its neighboring pixels, the cumulated dilation estimates the local maxima of the neighboring sum of similarities are computed as follows: pixels. The existence of an inverse relationship between = ( , ), ๐‘๐‘ ๐‘€๐‘€ erosion and dilation is used for detection for salt & pepper = , ( , ) (82) 1 โˆ‘๐‘—๐‘—=2 1 ๐‘—๐‘— noise. ๐‘€๐‘€ ๐‘๐‘ ยต ๐’™๐’™ ๐’™๐’™ ( , ) ๐‘˜๐‘˜is the ๐‘—๐‘—=central2 ๐‘—๐‘—โ‰ ๐‘˜๐‘˜ pixel๐‘˜๐‘˜ ๐‘—๐‘—and is a convex similarity ๐‘€๐‘€ โˆ‘ ยต ๐’™๐’™ ๐’™๐’™ < function.1 The central pixel is ๐‘–๐‘–detected๐‘—๐‘— as noisy if 2.11 Wavelet-Transform based Filters ๐’™๐’™ , = 2, โ€ฆ , and is replacedยต ๐’™๐’™ ๐’™๐’™by that for which = 1 , = 2, โ€ฆ , .This filter is faster than VMF.๐‘€๐‘€ A Many nonlinear filtering techniques are designed based on ๐‘˜๐‘˜ ๐‘˜๐‘˜ similar๐‘€๐‘€ ๐‘˜๐‘˜ filter based๐‘๐‘ on this idea is also developed๐’™๐’™ in [107๐‘˜๐‘˜]. wavelet transform. Haci Tasmaz et al., [100] proposes a ๐‘Ž๐‘Ž๐‘Ž๐‘Ž๐‘Ž๐‘Ž๐‘Ž๐‘Ž๐‘Ž๐‘Ž๐‘Ž๐‘Ž๐‘€๐‘€๐‘–๐‘– ๐‘˜๐‘˜ ๐‘๐‘ satellite image enhancement system comprising of image 2.12.3 Filters based on Digital Path Approach denoising and illumination enhancement technique. It is based on dual tree complex wavelet transform (DT-CWT). In [108] noise filtering approach based on the connections Based on the combined effect of Haar wavelet transform between image samples using the digital geodesic path is and median filter, a denoising technique is also proposed developed instead of using a fixed window. In this filter [101]. In [102], another denoising algorithm based on the image pixels are grouped togetherthrough the fuzzy combined effect of the bi-orthogonal wavelet transform membership function defined over vectorial inputs by and median filter is designed which removes noise forming digital paths revealing the underlying structure effectively. In [103], a wavelet based denoising technique dynamics of the image. It shows better performance in for suppression of noise in Magnetic Resonance images suppressing impulsive, Gaussian as well as mixed-type (MRI) is proposed. Shalini and Godwin in [104] present a noise. comparative analysis of denoising algorithms based on different wavelet transform such as Bior, Surelet, Haar 2.12.4 Filters based on Long Range Correlation and Curvelet. Traditional method of noise filtering utilizes information 2.12 Miscellaneous Filters based on local window centered around the corrupted pixel. In [109] a new class of filter based on information Miscellaneous Filters consist of those filters which cannot on both the local window and also some remote regions in be included into any of the filter families described above the image is developed. This is due to the fact that there although some filters may have common properties. exists a long range correlation within natural images and also the human visual system can use such correlations to 2.12.1 Selective Vector Median Filter interpret and restore image information [110]. This filter comprises of two steps: impulse detection and noise In [105] Selective Vector Median Filter is introduced cancellation. In the impulse detection stage any impulse which has two steps: noise detection and noise removal. detector as described in [111] and [112] can be used for For every pixel in the window aggregated sum of distance identifying the corrupted pixel in the local window. If the between other pixels is computed central pixel is corrupted, then a remote window centered = , = 1, โ€ฆ (80) around the impulse pixel is defined in the search range Then the๐‘๐‘ mean value for that neighborhood is calculated which is larger than the local window. All the pixels in the ๐‘†๐‘†๐‘–๐‘– โˆ‘๐‘—๐‘—=1 โˆฅ ๐’™๐’™๐‘–๐‘– โˆ’ ๐’™๐’™๐‘—๐‘— โˆฅ ๐‘–๐‘– ๐‘๐‘ as follows remote window will compete for the perfect match with = ๐‘†๐‘† (81) the local window based on the mean square error of The 1pixels๐‘๐‘ which have value higher than in the uncorrupted pixels in local and remote window. Finally, ฬ… ๐‘๐‘ โˆ‘๐‘—๐‘—=1 ๐‘—๐‘— ๐‘†๐‘†neighborhood๐‘†๐‘† are flagged as outliers. represents a the corrupted pixel is replaced by the central pixel of the constant used to increase or๐‘†๐‘† decrease the sensitivity๐‘˜๐‘˜๐‘†๐‘†ฬ… of the remote window with minimum mean squared error. threshold. If the central pixel is an outlier,๐‘˜๐‘˜ then the IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.12, December 2016 79

Fig. 5 Calculation of similarity measure between pixel in the processing block (Green Square) and small window (red square) by ROAD. Fig. 4 Demonstration of the general approach 2.12.7 Vector Marginal Median Filters (VMMF) 2.12.5 Vector Rational Filters (VRF) In [3] a vector filter named Vector Marginal Median Filter Vector rational filters are extension of rational filters. In (VMMF) based on the median operation is presented. It [113], two algorithms are proposed and based calculates the median value of each channel separately and on -norm and directional processing using two the central pixel is replaced by the median value of the ๐ฟ๐ฟ ๐‘‘๐‘‘ decimation schemes such as rectangular๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰ and๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰ quincunx respective channel. The output of VMMF is given below ๐‘๐‘ decimation๐ฟ๐ฟ for down-sampling. Merits of these filters are = (( ({ , โ€ฆ })), ({ , โ€ฆ }) , ( ({ , โ€ฆ }))) better edge-preserving properties and absence of artifacts. ๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰๐‘‰ ๐’™๐’™ ๐‘…๐‘… ๐‘…๐‘… ๐บ๐บ ๐บ๐บ ๐ต๐ต ๐ต๐ต (85) 1 ๐‘๐‘ 1 ๐‘๐‘ 1 ๐‘๐‘ 2.12.6 Robust Local Similarity Filters (RLSF) where๐‘š๐‘š๐‘š๐‘š๐‘š๐‘š ๐‘ฅ๐‘ฅ, and๐‘ฅ๐‘ฅ are๏ฟฝ๐‘š๐‘š ๐‘š๐‘š๐‘š๐‘šthe red,๐‘ฅ๐‘ฅ green๐‘ฅ๐‘ฅ ๏ฟฝ and๐‘š๐‘š๐‘š๐‘š๐‘š๐‘š blue๐‘ฅ๐‘ฅ channel๐‘ฅ๐‘ฅ of the pixels in the window. Its noise reduction capability is A new algorithm for suppression of mixed Gaussian and highest๐‘…๐‘… but๐บ๐บ since๐ต๐ต it does not consider the correlation impulsive noise based on concept of Rank ordered among the vector channel, it leads to color artifacts. Absolute Difference (ROAD) [114] is proposed in [115]. Noise is detected by computing ROAD between samples 2.12.8 Vector Signal-Dependent Rank Order Mean Filters of the processing block and a small window which is centered at blockโ€™s central pixel. Main contribution is that Multichannel extension of the grayscale Signal Dependent the similarity measure is not affected by outliers due to Rank Order Mean (SDROM) filter [116] is the Vector impulses and the averaging operation reduces the signal-dependent rank order mean (VSDROM) filter [117]. Gaussian noise. The output of this filter is given as For noise detection, first the vector pixels in the window . are sorted according to their aggregated distance to all = ๐‘๐‘ (83) other samples. The distance between the four lowest- โˆ‘๐‘—๐‘—=1 ๐‘ค๐‘ค๐‘—๐‘— ๐’™๐’™๐‘—๐‘— ๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘…๐‘… ๐‘๐‘ ranked vectors and the central pixel are compared against ๐’™๐’™with =โˆ‘๐‘—๐‘—=1 ๐‘ค๐‘ค๐‘—๐‘— ( ) (84) respective increasing thresholds. The central pixel is 1 ๐›ผ๐›ผ ๐‘—๐‘— ๐‘˜๐‘˜=1 ๐‘—๐‘— regarded as noisy if any of these distances is greater than ๐‘ค๐‘ค า  ๏ฟฝ๐›ผ๐›ผ โˆ‘ ๐‘‘๐‘‘ ๐‘˜๐‘˜ ๏ฟฝ where represents the kernel function (Gaussian) and their threshold and replaced by the VMF. ( ) denotes the smallest Euclidean distance า  ๐‘ก๐‘กโ„Ž 2.12.9 Decision based Couple Window Median Filters between๐‘—๐‘— pixel of the processing block and pixels of ๐‘‘๐‘‘ ๐‘˜๐‘˜ ๐‘˜๐‘˜ (DBCWMF) of the small window.๐‘—๐‘— is the number of close neighbors used in calculation๐‘ฅ๐‘ฅ of ROAD. ๐‘Š๐‘Š ๐›ผ๐›ผ They use an increasing window size in order to maximize the probability of finding noise-free pixels [118]. The steps of DBCWMF is given below 1. Define a 2-D local window of dimension (2 + 1) ร— (2 + 1) (initialize algorithm by choosing = 1). ๐‘›๐‘› 2. Identify salt & pepper noise by๐‘Š๐‘Š checking if the central๐‘›๐‘› pixel ๐‘›๐‘› is either 0 or 255. If 0< < 255๐‘›๐‘› it is left intact. ๐‘๐‘+1 ๐‘๐‘+1 ๐’™๐’™ 2 ๐’™๐’™ 2 80 IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.12, December 2016

3. If is noisy, then trim all 0โ€™s and 255โ€™s present in uncontaminated, ( = 1,2,3) equals 0 or 255 with equal probability for fixed-valued impulse noise, or takes any the ๐‘๐‘and+1 follow the two cases ๐‘˜๐‘˜ ๐’™๐’™ 2 value in the range๐‘›๐‘› ๐‘˜๐‘˜[0,255] for random-valued impulse Case 1. If the number of non-noisy pixels is non-zero, then ๐‘›๐‘› noise; is the sample corruption probability; , and replace๐‘Š๐‘Š the central pixel by the median value calculated are the channel corruption probabilities and = 1 from the remaining uncorrupted pixels. 1 2 3 ๐‘๐‘ . ๐‘๐‘ ๐‘๐‘ ๐‘๐‘ Case 2. If the number of non-noisy pixels is zero, then ๐‘๐‘๐‘Ž๐‘Ž โˆ’ = + 1, ( < 5) The uncorrelated impulse noise has the following form [46] update the window size by increasing ๐‘๐‘1 โˆ’ ๐‘๐‘2 โˆ’ ๐‘๐‘ 3 with probability and goto Step 1. = with probability 1 (87) 4. If the number of non-noisy pixels ๐‘›๐‘›in ๐‘›๐‘› is zero,๐‘›๐‘› then โ€ฒ ๐‘˜๐‘˜ ๐‘˜๐‘˜ ๐‘›๐‘› = 1,2,3 ๐‘๐‘ w๐‘ž๐‘ž here๏ฟฝ denotes the three channels in RGB color replace the value of central pixel by mean of . ๐‘ž๐‘ž๐‘˜๐‘˜ โˆ’ ๐‘๐‘ ๐‘Š๐‘Š4 space; is the channel corruption probability; and 5. Repeat Steps 1 to 4 until all the pixels are processed. ๐‘˜๐‘˜ ๐‘Š๐‘Š1 denote the original component and contaminated ๐‘๐‘ ๐‘ž๐‘ž๐‘˜๐‘˜ ๐‘›๐‘›๐‘˜๐‘˜ 2.12.10 Improved for reducing mixed component respectively. can take either 0 or 255 for fixed-valued impulse noise and can take any discrete ๐‘˜๐‘˜ in [0,255] for random-valued๐‘›๐‘› impulse noise. A Bilateral Filter (BF) [119] is a combination of two low- pass Gaussian filters operating in spatial and color (range) domain for reducing both impulse and additive noise 4. Performance Measurement of Filters while preserving edge structures. The spatial low-pass The performance of filter is evaluated by the following filter gives larger weights to those samples closer to the parameters central pixel while the range low pass filter assigns larger (a) Mean Absolute Error (MAE) weights to those pixels having similar color distributions with the central pixel. Here the filterโ€™s output is mainly = | ( , ) ( , )| (88) dependent on the central pixel and neighboring pixels ร— 1 ๐‘€๐‘€1 ๐‘๐‘1 close in both spatial and range domain with the central where ร— is the size of the image; ( , ) and ( , ) ๐‘€๐‘€๐‘€๐‘€๐‘€๐‘€ ๐‘€๐‘€1 ๐‘๐‘1 โˆ‘๐‘–๐‘–=1 โˆ‘๐‘—๐‘—=1 ๐‘ž๐‘ž ๐‘–๐‘– ๐‘—๐‘— โˆ’ ๐‘“๐‘“ ๐‘–๐‘– ๐‘—๐‘— pixel.An improvement in the traditional Bilateral Filter are the original and filtered pixel values at ( , ) location. 1 1 (BF) is designed in [120] in which a new weighting (b) Mean๐‘€๐‘€ Squared๐‘๐‘ Error (MSE) ๐‘ž๐‘ž ๐‘–๐‘– ๐‘—๐‘— ๐‘“๐‘“ ๐‘–๐‘– ๐‘—๐‘— function to the bilateral filtering mechanism is introduced. = ( ( , ) ( , )) ๐‘–๐‘– ๐‘—๐‘— (89) ร— For an impulse, the vector median (as opposed to the 1 ๐‘€๐‘€1 ๐‘๐‘1 (C) Peak Signal to Noise ratio (PSNR) 2 traditional BF which always uses the central pixel) is ๐‘€๐‘€๐‘€๐‘€๐‘€๐‘€ ๐‘€๐‘€1 ๐‘๐‘1 โˆ‘๐‘–๐‘–=1 โˆ‘๐‘—๐‘—=1 ๐‘ž๐‘ž ๐‘–๐‘– ๐‘—๐‘— โˆ’ ๐‘“๐‘“ ๐‘–๐‘– ๐‘—๐‘— considered as base for bilateral filtering operation for = 10log (90) 2 ๐‘š๐‘š๐‘š๐‘š๐‘š๐‘š replacement of the central pixel otherwise the normal where is the ๐ผ๐ผmaximum pixel value of the original 10 ๐‘€๐‘€๐‘€๐‘€๐‘€๐‘€ bilateral filtering action is continued. image.๐‘ƒ๐‘ƒ๐‘ƒ๐‘ƒ๐‘ƒ๐‘ƒ๐‘ƒ๐‘ƒ ๏ฟฝ ๏ฟฝ ๐‘š๐‘š๐‘š๐‘š๐‘š๐‘š (d) Normalized๐ผ๐ผ Color Distance (NCD) The NCD is defined in the Lu*v* color space by 3. Impulse Noise Model =

( , ) ( , ) ( , ) ( , ) ( , ) ( , ) In the real life, the form of impulse noise varies. For ๐‘๐‘๐‘๐‘๐‘๐‘ ๐‘€๐‘€1 ๐‘๐‘1 ๐‘œ๐‘œ ๐‘ฅ๐‘ฅ 2 ๐‘œ๐‘œ ๐‘ฅ๐‘ฅ 2 ๐‘œ๐‘œ ๐‘ฅ๐‘ฅ 2 example, the value of impulse noise caused by โˆ‘๐‘–๐‘–=1 โˆ‘๐‘—๐‘—=1 ๏ฟฝ๏ฟฝ๐ฟ๐ฟ ๐‘–๐‘– ๐‘—๐‘— โˆ’๐ฟ๐ฟ ๐‘–๐‘– ๐‘—๐‘— ๏ฟฝ( ,+)๏ฟฝ๐‘ข๐‘ข ๐‘–๐‘– ๐‘—๐‘— โˆ’( ๐‘ข๐‘ข, ) ๐‘–๐‘– ๐‘—๐‘— ๏ฟฝ +(๏ฟฝ๐‘ฃ๐‘ฃ, ) ๐‘–๐‘– ๐‘—๐‘— โˆ’๐‘ฃ๐‘ฃ ๐‘–๐‘– ๐‘—๐‘— ๏ฟฝ malfunction of sensor is expected to be fixed-valued ๐‘€๐‘€ ๐‘๐‘ 2 2 2 (91) 1 1 ๏ฟฝ ๐‘œ๐‘œ ๐‘œ๐‘œ ๐‘œ๐‘œ impulse noise, while the value of impulse caused by โˆ‘๐‘–๐‘–=1 โˆ‘๐‘—๐‘—=1 ๏ฟฝ๐ฟ๐ฟ ๐‘–๐‘– ๐‘—๐‘— ๏ฟฝ +๏ฟฝ๐‘ข๐‘ข ๐‘–๐‘– ๐‘—๐‘— ๏ฟฝ +๏ฟฝ๐‘ฃ๐‘ฃ ๐‘–๐‘– ๐‘—๐‘— ๏ฟฝ ( , ), ( , ) ( , ) ( , ), ( , ) electronic interference is random-valued impulse noise where , and , ( ) ๐‘œ๐‘œ ๐‘œ๐‘œ ๐‘œ๐‘œ ๐‘ฅ๐‘ฅ ๐‘ฅ๐‘ฅ [77]. Impulse noise can be divided into two types: , are values of the lightness and two chrominance ๐ฟ๐ฟ ๐‘–๐‘– ๐‘—๐‘— ๐‘ข๐‘ข ๐‘–๐‘– ๐‘—๐‘— ๐‘ฃ๐‘ฃ ๐‘–๐‘– ๐‘—๐‘— ๐ฟ๐ฟ ๐‘–๐‘– ๐‘—๐‘— ๐‘ข๐‘ข ๐‘–๐‘– ๐‘—๐‘— Correlated impulse noise and Uncorrelated impulse noise. components๐‘ฅ๐‘ฅ of the original image sample ( , ) and ๐‘ฃ๐‘ฃ ๐‘–๐‘– ๐‘—๐‘— The impulse noise model proposed by Viero et al [10] is filtered image sample ( , ) respectively. ๐‘ž๐‘ž ๐‘–๐‘– ๐‘—๐‘— correlated type impulse noise and it has the following (E) Structural Similarity Index (SSIM) ๐‘“๐‘“ ๐‘–๐‘– ๐‘—๐‘— form Structural similarity index measures the similarity { }with probability 1 between two images and is given below , , { 1 2 3 }with probability = (92) ๐‘ž๐‘ž ๐‘ž๐‘ž ๐‘ž๐‘ž ๐‘ฅ๐‘ฅ ๐‘ฆ๐‘ฆ 1 ๐‘ฅ๐‘ฅ๐‘ฅ๐‘ฅ 2 = { , , }with probability โˆ’ ๐‘๐‘ ๏ฟฝ2๐œ‡๐œ‡ ๐œ‡๐œ‡ +๐ถ๐ถ ๏ฟฝ๏ฟฝ2๐œ‡๐œ‡ +๐ถ๐ถ ๏ฟฝ โŽง 1 2 3 1 (86) 2 2 2 2 ๐‘›๐‘› ๐‘ž๐‘ž ๐‘ž๐‘ž where ยตx๏ฟฝ ๐œ‡๐œ‡and๐‘ฅ๐‘ฅ+๐œ‡๐œ‡๐‘ฆ๐‘ฆ +ยต๐ถ๐ถy1 ๏ฟฝare๏ฟฝ๐œŽ๐œŽ๐‘ฅ๐‘ฅ+ ๐œŽ๐œŽmean๐‘ฆ๐‘ฆ+๐ถ๐ถ2๏ฟฝ of the original and filtered โ€ฒ โŽช { , , }with probability ๐‘๐‘ ๐‘๐‘ ๐‘†๐‘†๐‘†๐‘†๐‘†๐‘†๐‘†๐‘† 1 2 3 2 2 2 image, ฯƒxy, ฯƒ and ฯƒ represent the corresponding ๐’’๐’’ {๐‘ž๐‘ž , ๐‘›๐‘› , ๐‘ž๐‘ž }with probability ๐‘๐‘ ๐‘๐‘ x y โŽจ 1 2 3 3 where ๐‘ž๐‘ž= ( ๐‘ž๐‘ž , ,๐‘›๐‘› ) is the original๐‘๐‘ uncontaminated๐‘๐‘ covariance and variance of the original and filtered images. โŽช 1 2 3 ๐‘Ž๐‘Ž vectorโŽฉ ๐‘›๐‘›pixel,๐‘›๐‘› ๐‘›๐‘› may be either ๐‘๐‘contaminated๐‘๐‘ or and are the constants. 1 2 3 ๐’’๐’’ ๐‘ž๐‘ž ๐‘ž๐‘žโ€ฒ ๐‘ž๐‘ž 1 2 ๐’’๐’’ ๐ถ๐ถ ๐ถ๐ถ IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.12, December 2016 81

MAE is used to evaluate detail preservation; MSE and [14] K. M. Singh, and P.K. Bora, โ€œAdaptive vector median filter PSNR are used to evaluate noise suppression capability; for removal of impulse noise from color imagesโ€, Journal of NCD is used to measure perceptual error in the CIELab Scientific Computing, vol. 4, no.1, pp.1063-1072, 2004. color space [3]. [15] B. Smolka, K.N. Plataniotis, and A.N. Venetsanopoulos, โ€œNonlinear techniques for color image processingโ€, For an efficient filter, it is expected to have high PSNR Nonlinear Signal and Image Processing: Theory, Methods, and SSIM, while the other parameters like MAE, MSE and Applications, pp.445-505, 2004. and NCD are minimum. [16] K. M. Singh, and P.K. Bora, โ€œSwitching vector median filters based on non-causal linear prediction for detection of impulse noiseโ€, The Imaging Science Journal, vol.62, no.6, 5. Conclusions pp.313-326, 2014. [17] P. E. Trahanias, and A. N. Venetsanopoulos, โ€œVector A comprehensive survey of various vector median filters directional filters-a new class of multichannel image for the removal of impulse noise from color images is processing filtersโ€, IEEE Transactions on Image Processing, presented. These filters have been categorized into 12 vol.2, no.4, pp.528-534, 1993. different families. Their properties have been summarized [18] P. E. Trahanias, D. Karakos, and A. N. Venetsanopoulos, โ€œDirectional processing of color images: theory and and presented. Some recently proposed algorithms have experimental resultsโ€, IEEE Transactions on Image been added and studied. Processing, vol.5, no.6, pp. 868-880, 1996. [19] D. G. Karakos, and P. E. Trahanias, โ€œCombining vector References median and vector directional filters: The directional- [1] H. J. Trussell, E. Saber, and M. Vrhel, โ€œColor image distance filtersโ€, Image Processing, Proceedings. processing: Basics and special issue overviewโ€, IEEE International Conference on. Vol. 1. IEEE, 1995. Signal Processing Mag., vo. 22, no.1, pp. 14-22, 2005. [20] G. P. Deepti, M. V. Borker, and J. Sivaswamy, โ€œImpulse [2] T. Acharya, and K. R. Ajay, Image processing: principles noise removal from color images with Hopfield neural and applications. John Wiley & Sons, 2005. network and improved vector median filterโ€, Sixth Indian [3] K. Plataniotis, and A. N. Venetsanopoulos, Color image Conference on Computer Vision, Graphics & Image processing and applications. Springer, 2000. Processing, 2008. [4] I. Pitas, and A. N. Venetsanopoulos, Nonlinear Digital [21] D. G. Karakos, and P. E. Trahanias, โ€œGeneralized Filters Principles and Applications. Kluwer Academic multichannel image-filtering structuresโ€, IEEE Transactions Publishers, Boston, M.A, 1990. on Image Processing, vol. 6, no.7, pp. 1038-1045, 1997. [5] R. Lukac, and K. N. Plataniotis, Color image processing: [22] R. Wichman, K. Oistamo, Q. Liu, M. Grundstrom, and Y. A. methods and applications. CRC press, 2006. Neuvo, โ€œWeighted vector median operation for filtering [6] M. E. Celebi, H. A. Kingravi, and Y. A. Aslandogan, multispectral dataโ€ , Applications in Optical Science and โ€œNonlinear vector filtering for impulsive noise removal Engineering. International Society for Optics and Photonics, from color imagesโ€, Journal of Electronic Imaging, vol.16, 1992. no.3, 2007. [23] B. Smolka, โ€œRank Order Weighted Vector Median Filterโ€, [7] R. Rastislav, and K. N. Plataniotis, โ€œA taxonomy of color 17th International Conference on Systems, Signals and image filtering and enhancement solutionsโ€, Advances in Image Processing, IWSSIP 2010. imaging and electron physics, vol.140, 2006. [24] B. Smolka, โ€œRank-Based Vector Median Filterโ€, [8] R. Lukac, and S. Marchevsky, โ€œImpulse detection in noised Proceedings: ASIPA ASC 2009: Asia Pacific Signal and colour imagesโ€, Journal of Electrical Engineering, vol. 52, Information Processing Association, 2009 Annual Summit pp. 352-361, 2001. and Conference: 254-257. [9] J. Astola, P. Haavisto, and Y. Neuvo, โ€œVector median [25] R. Lukac, K. N. Plataniotis, B. Smolka, and A. N. filtersโ€, Proceedings of the IEEE, vol. 78, no.4, pp. 678-689, Venetsanopoulos, โ€œSelection weighted vector directional 1990. filtersโ€, Computer Vision and Image Understanding, vol.94, [10] T. Viero, K. Oistamo, and Y. Neuvo, โ€œThree-dimensional no.1, pp.140-167, 2004. median-related filters for color image sequence filteringโ€, [26] R. Lukac, K. N. Plataniotis, B. Smolka, and A. N. IEEE Transactions on Circuits and Systems for Video Venetsanopoulos, โ€œGeneralized selection weighted vector Technology, vol.4, no. 2, pp.129-142, 1994. filtersโ€, EURASIP Journal on Advances in Signal [11] B. Smolka, and M. Perczak, โ€œGeneralized vector median Processing , vol.12, pp.1-16, 2004. filterโ€, Image and Signal Processing and Analysis, 2007. [27] R. Lukac, K. N. Plataniotis, and A.N. Venetsanopoulos, ISPA 2007. โ€œColor image denoising using evolutionary computationโ€, [12] B. Smolka, M. Szczepanski, K. N. Plataniotis, and A. N. International Journal of Imaging Systems and Technology, Venetsanopoulos, โ€œFast modified vector median filterโ€, in vol.15, no.5, pp. 236-251 , 2005. W.Skarbek (Ed.) Computer Analysis of Images and Patterns, [28] S. G. Javed, A. Majid, A. M. Mirza, and A. Khan, โ€œMulti- LNCS 2124, Springer-Verleg-Berlin, pp. 570-580, 2001. denoising based impulse noise removal from images using [13] S. Vinayagamoorthy, K. N. Plataniotis, D. Androutsos, and robust statistical features and genetic programmingโ€, vol.75, A. N. Venetsanopoulos , โ€œA multichannel filter for TV no.10, pp.1-30, 2015. signal processingโ€, IEEE transactions on consumer [29] R. Lukac, โ€œAdaptive color image filtering based on center- electronics, vol.42, no.2, pp. 199-202, 1996. weighted vector directional filtersโ€, Multidimensional 82 IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.12, December 2016

Systems and Signal Processing, vol.15, no.2, pp.169-196, [47] B. Smolka, and A. Chydzinski, โ€œFast detection and 2004. impulsive noise removal in color imagesโ€, Real-Time [30] Z. Ma, H. R. Wu, and D. Feng, โ€œPartition-based vector Imaging, vol.11, no.5, pp.389-402, 2005. filtering technique for suppression of noise in digital color [48] L. Malinski, and B. Smolka, โ€œFast averaging peer group imagesโ€, IEEE transactions on image processing, vol.15, filter for the impulsive noise removal in color imagesโ€, no.8, pp.2324-2342, 2006. Journal of Real-Time Image Processing, vol.11, no.3, [31] R. Lukac, โ€œAdaptive vector median filteringโ€, Pattern pp.427-444, 2016. Recognition Letters, vol. 24, no.12, pp.1889-1899, 2003. [49] S. Morillas, V. Gregori, and A. Hervรกs, โ€œFuzzy peer groups [32] B. Smolka, and K. Wojciechowski, โ€œOn the adaptive for reducing mixed Gaussian-impulse noise from color impulsive noise removal in color imagesโ€, Archives of imagesโ€, IEEE Transactions on Image Processing, vol.18, Control Sciences, vol.15, no.1, pp.117-131, 2005. no.7, pp.1452-1466, 2009. [33] A. Roy, and R. H. Laskar, โ€œMulticlass SVM based adaptive [50] J. G. Camarena, V. Gregori, S. Morrilas, and A. Sapena, filter for removal of high density impulse noise from color โ€œFast detection and removal of impulsive noise using peer imagesโ€, Applied Soft Computing, vol.46, pp. 816-826, groups and fuzzy metricsโ€, Journal of Visual 2015. Communication and Image Representation, vol.9, no.1, [34] U. Ghanekar, A. K. Singh, and R. Pandey, โ€œRandom Valued pp.20-29, 2008. Impulse Noise Removal in Colour Images using Adaptive [51] R. Lukac and K. N. Plataniotis, โ€œFuzzy Vector Filters for Threshold and Colour Correctionโ€, ACEEE Int. J. on Signal cDNA Microarray Image Processingโ€, Studies in Fuzziness & Image Processing, vol.1, no.3, 2010. and soft computing, vol. 242, pp.67-82, 2008. [35] M. E. Celebi, G. Schaefer, and H. Zhou, โ€œA new family of [52] K. N. Plataniotis, D. Androutsos, and A. N. order-statistics based switching vector filtersโ€, 17th IEEE Venetsanopoulos, โ€œAdaptive fuzzy systems for International Conference on Image Processing on Image multichannel signal processingโ€, Proc. IEEE, vol. 87, no.9, Processing, 2010. pp. 1601-1622, 1999. [36] M. E. Celebi, and Y. A. Aslandogan, โ€œRobust switching [53] K. N. Plataniotis, D. Androutsos, and A. N. vector median filter for impulsive noise removalโ€, Journal Venetsanopoulos, โ€œFuzzy adaptive filters for multichannel of Electronic Imaging, vol.17, no.4, 2008. image processingโ€, Signal Processing Journal, vol.55, [37] S. Morillas, V. Gregori, and A. Sapena., โ€œAdaptive no.1,pp. 93-106, 1996. marginal median filter for colour imagesโ€, vol. 11, no. 3, [54] P. T. Yu, and R. C. Chen, โ€œFuzzy Stack Filters - Their pp.3205-3213, Sensors, 2011. definitions, fundamental properties and application in image [38] R. Lukac, โ€œOptimised directional distance filterโ€, Machine processingโ€, IEEE Transactions on Image Processing, vol.5, Graphics & Vision International Journal, vol.11, no.2/3, pp. no.6, pp.838-54, 1996. 311-326, 2002. [55] S. Peng, and L. Lucke, โ€œFuzzy filtering for mixed noise [39] R. Lukac, and B. Smolka, โ€œApplication of the adaptive removal during image procesisngโ€, Fuzzy Systems, 1994. center-weighted vector median framework for the IEEE World Congress on Computational Intelligence. enhancement of cDNA microarray imagesโ€, International Proceedings of the Third IEEE Conference on. IEEE, 1994. Journal of Applied Mathematics and Computer Science, [56] K. N. Plataniotis, D. Androutsos, S. Vinayagamoorthy, and vol.13, no.3, pp. 369-384, 2003. A. N. Venetsanopoulos, โ€œA nearest neighbor multichannel [40] S. Wang, and C. H. Wu, โ€œA new impulse detection and filterโ€, Electron. Lett. vol.31, no.22, pp.1910-1911, 1995. filtering method for removal of wide range impulse noiseโ€, [57] K. N. Plataniotis, D. Androutsos, S. Vinayagamoorthy, and Pattern Recognition, vol.42, no.9, pp. 2194-2202, 2009. A. N. Venetsanopoulos, โ€œAn adaptive nearest neighbor [41] R. Lukac, B. Smolka, and K. N. Plataniotis, โ€œSharpening multichannel filterโ€, IEEE Trans. Circuits Syst. Video vector median filtersโ€, Signal Processing, vol. 87, no.9, Technology., vol. 6, no.6, pp. 699-703 1996. pp.2085-2099, 2007.. [58] H. T. Tsai and P. T. Yu, โ€œAdaptive fuzzy hybrid [42] B. Smolka, K. Malik, and D. Malik, โ€œAdaptive rank multichannel filters for removal of impulse noise from color weighted switching filter for impulsive noise removal in imagesโ€, Signal Processing, vol.74, pp.127-151, 1999. color imagesโ€, Journal of Real-Time Image Processing, [59] S. Schulte, M. Nachtegael, V. De Witte, D. Van der Weken, vol.10, no.2, pp.289-311, 2015. and E. E. Kerre , โ€œA fuzzy impulse noise detection and [43] Y. Deng, C. Kenney, M. S. Moore, and B. S. Manjunath, reduction methodโ€, IEEE Transactions on Image Processing, โ€œPeer group filtering and perceptual color image vol. 15, no.5, pp.1153-1162, 2006. quantizationโ€, Circuits and Systems, ISCAS'99. [60] L. Khriji, and M. Gabbouj, โ€œVector median-rational hybrid Proceedings of the 1999 IEEE International Symposium on. filters for multichannel image processingโ€, IEEE Signal Vol. 4. IEEE, 1999. Processing Letters, vol. 6, no.7, pp.186-190, 1999. [44] C. Kenney, Y. Deng, B. S. Manjunath, and G. Hewer, โ€œPeer [61] Z. Ma, H. R. Wu, and B. Qiu, โ€œA robust structure-adaptive group image enhancementโ€, IEEE Transactions on Image hybrid vector filters for color image restorationโ€, IEEE Processing, vol. 10, no.2, pp. 326-334 , 2001. Transactions on Image Processing, vol.14, no.12, pp.1990- [45] J. Y. Ho, โ€œPeer region determination based impulsive noise 2001, 2005. detectionโ€, , Speech, and Signal Processing, 2003. [62] L. Khriji, and M. Gabbouj, โ€œClass of multichannel image [46] B. Smolka, โ€œPeer group switching filter for impulse noise processing filtersโ€, Electronics Letters, vol.35, no.4, pp. reduction incolor imagesโ€, Pattern Recognition Letters, 285-287, 1999. vol.31, no.6, pp. 484-495, 2010. [63] R. Lukac, B. Smolka, K. N. Plataniotis, A. N. Venetsanopoulos, and P. Zavarsky, โ€œAngular multichannel IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.12, December 2016 83

sigma filterโ€, Acoustics, Speech, and Signal Processing, sequencesโ€, IEEE Transactions on Circuits and Systems for vol.3, 2003. Video Technology, vol. 23, no.5, pp.741-755, 2013. [64] R. Lukac, B. Smolka, K. N. Plataniotis, and A. N. [82] G. Elaiyaraja, N. Kumaratharan, and C. R. Prapau, Venetsanopoulos, โ€œVector sigma filters for noise detection โ€œModified Quaternion Based Impulse Noise Removal with and removal in color imagesโ€, Journal of Visual Adaptive Threshold from Color Video Sequences and Communication & Image Representation, vol. 17, pp. 1-26, Medical Imagesโ€, Middle-East Journal of Scientific 2006. Research, vol. 23, no.7, pp. 1382-1389, 2015. [65] R. Lukac, B. Smolka, K. N. Plataniotis, and A. N. [83] K. Michielsen, and H. D. Raedt, โ€œMorphological image Venetsanopoulos, โ€œA variety of multichannel sigma analysisโ€, Computer Physics Communications, vol. 132, filtersโ€, Optical Metrology, International Society for Optics no.1, pp. 94-103 , 2000. and Photonics, 2003. [84] J. Serra, Image analysis and mathematical morphology, [66] J.S Lee, โ€œDigital image smoothing and the sigma Academic press, 1982. filterโ€, Computer Vision, Graphics, and Image Processing, [85] R. Stevenson, and G. Arce, โ€œMorphological filters: vol. 24, no.2, pp.255-269, 1983. Statistics and further syntactic propertiesโ€, IEEE [67] R. Lukac, B. Smolka, K. N. Plataniotis, and A. N. Transactions on Circuits and Systems, vol.34, no.11, pp. Venetsanopoulos, โ€œGeneralized adaptive vector sigma 1292-1305, 1987. filtersโ€, Multimedia and Expo, 2003. [86] H. Zhou, and K. Z. Mao, โ€œAn impulsive noise color image [68] A. Beghdadi, and A. Khellaf, โ€œA noise-filtering method filter using learning-based color morphological using a local information measureโ€, IEEE Transactions on operationsโ€, Digital Signal Processing, vol.18, no.3, pp. Image Processing, vol.6, no.6, pp.879-882, 1997. 406-421, 2008. [69] R. Lukac, B. Smolka, K. N. Plataniotis, and A. N. [87] S. V. Forero and J. Angulo, โ€œClassification of hyperspectral Venetsanopoulos, โ€œEntropy vector median filterโ€, Iberian images by tensor modeling and additive morphological Conference on Pattern Recognition and Image Analysis, decompositionโ€, Pattern Recognition, vol. 46, no. 2, pp. Springer Berlin Heidelberg, 2003. 566โ€“577, 2013. [70] R. Lukac, K. N. Plataniotis, B. Smolka, and A. N. [88] M. E. Valle and D. M. G. Vicente, โ€œSparsely connected Venetsanopoulos, โ€œGeneralized entropy vector filtersโ€, autoassociative lattice memories with an application for the Video/Image Processing and Multimedia Communications, reconstruction of color images,โ€ Journal of Mathematical 2003. Imaging and Vision, vol. 44, no. 3, pp. 195โ€“222, 2012. [71] Y.B Jia, โ€œQuaternions and rotationsโ€, Com S 477.577, 2008. [89] S. Morales, V. Naranjo, U. Angulo, and M. Alcaniz, [72] J. Angulo, โ€œQuaternion colour representations and derived โ€œAutomatic detection of optic disc based on PCA and total orderings for morphological operatorsโ€, Conference on mathematical morphology,โ€ IEEE Transactions on Medical Colour in Graphics, Imaging, and Vision, vol. 2008, no.1, Imaging, vol. 32, no. 4, pp. 786โ€“796, 2013. pp.417-422, 2008. [90] S. Velasco-Forero and J. Angulo, โ€œSupervised ordering [73] T.A Ell, and S.J. Sangwine, โ€œTheory of vector filters based in IRP: application to morphological processing of on linear quaternion functionsโ€, Signal Processing hyperspectral images,โ€ IEEE Transactions on Image Conference, IEEE, 2008. Processing, vol. 20, no. 11, pp. 3301โ€“3308, 2011. [74] C. Cai, and S.K. Mitra, โ€œA normalized color difference edge [91] J. Li and Y. Li, โ€œMultivariate mathematical morphology detector based on quaternion representationโ€, Image based on principal component analysis: initial results in Processing, 2000. building extraction,โ€ in Proceedings of the 20th [75] L.Jin, and D. Li, โ€œAn efficient color-impulse detector and International Society for Photogrammetry and Remote its application to color imagesโ€, IEEE Signal Processing Sensing (ISPRS '04), vol. 35, pp. 1168โ€“1173, 2004. Letters, vol.14, no.6, pp.397-400, 2007. [92] J. Angulo, โ€œHypercomplex mathematical [76] X. Zhang, โ€œA Novel Switching Vector Median Filter for morphology,โ€ Journal of Mathematical Imaging and Vision, Color Image Filteringโ€, Informatics and Management vol. 41, no. 1-2, pp. 86โ€“108, 2011. Science V, pp. 663-670, Springer London, 2013. [93] S. Velasco-Forero and J. Angulo, โ€œRandom projection [77] X. Geng, X. Hu, and J. Xiao, โ€œQuaternion switching filter depth for multivariate mathematical morphology,โ€ IEEE for impulse noise reduction in color imageโ€, Signal Journal on Selected Topics in Signal Processing, vol. 6, no. Processing, vol. 92, no.1, pp. 150-162, 2012. 7, pp. 753โ€“763, 2012. [78] Jin, Lianghai, H. Liu, X. Xu, and E. Song, โ€œColor impulsive [94] J. J. van de Gronde and J. B. Roerdink, โ€œGroup-invariant noise removal based on quaternion representation and frames for colour morphology,โ€ in Proceedings of the directional vector order-statisticsโ€, Signal Processing, International Symposium on Memory Management (ISMM vol.91, no.5, pp. 1249-1261, 2011. '13), pp. 267โ€“278, May 2013. [79] G. Wang, Y. Liu, and T. Zhao, โ€œA quaternion-based [95] A. Cฤƒliman, M. Ivanovici, and N. Richard, โ€œProbabilistic switching filter for colour image denoisingโ€, Signal pseudo-morphology for grayscale and color Processing , vol.102, pp. 216-225, 2014. images,โ€ Pattern Recognition, vol. 47, no. 2, pp. 721โ€“735, [80] Jin, Lianghai, Z. Zhu, X. Xu, and X. Li, โ€œTwo-stage 2014. quaternion switching vector filter for color impulse noise [96] T. Lei, Y. Wang, and W. Luo, โ€œMultivariate Self-Dual removalโ€, Signal Processing, vol. 128, pp. 171-185, 2016. Morphological Operators Based on Extremum [81] Jin, Lianghai, H. Liu, X. Xu, and E. Song, โ€œQuaternion- Constraintโ€, Mathematical Problems in Engineering, 2015. based impulse noise removal from color video [97] M. Welk, A. Kleefeld, and M. BreuรŸ, โ€œQuantile filtering of colour images via symmetric matricesโ€, Mathematical 84 IJCSNS International Journal of Computer Science and Network Security, VOL.16 No.12, December 2016

Morphology-Theory and Applications, vol.1, no.1, pp.136- [114] R. Garnett, T. Huegerich, C. Chui, and W. He , โ€œA 174, 2016. universal noise removal algorithm with an impulse [98] M. Welk, A. Kleefeld, and M BreuรŸ, โ€œNon-adaptive and detectorโ€, IEEE Transactions on image processing, vol.14, amoeba quantile filters for colour imagesโ€, International no.11, pp. 1747-1754, 2005. Symposium on Mathematical Morphology and Its [115] B. Smolka, and D. Kusnik, โ€œRobust local similarity Applications to Signal and Image Processing, Springer filter for the reduction of mixed Gaussian and impulsive International Publishing, 2015. noise in color digital imagesโ€, Signal, Image and Video [99] Irum, Isma, M. Sharif, M. Raza, and S. Mohsin, โ€œA Processing, vol.9, no.1, pp. 49-56, 2015. Nonlinear Hybrid Filter for Salt & Pepper Noise Removal [116] E. Abreu, M. Lightstone, S. K. Mitra, and K. Arakawa, from Color Imagesโ€, Journal of applied research and โ€œA new efficient approach for the removal of impulse noise technology, vol.13, no.1, pp.79-85, 2015. from highly corrupted imagesโ€, IEEE transactions on [100] TaลŸmaz, Haci, H. Demirel, and G. Anbarjafari, image processing, vol.5, no.6 , pp. 1012-1025, 1996. โ€œSatellite image enhancement by using dual tree complex [117] M. S. Moore, M. Gabbouj, and S. K. Mitra, โ€œVector wavelet transformโ€, Denoising And Illumination SD-ROM filter for removal of impulse noise from color Enhancement, vol.978, no.1, pp. 4673-0056, IEEE, 2012. imagesโ€, Eurasip Conference, ECMCS, 1999. [101] A. Boyat, and B. K. Joshi โ€œImage denoising using [118] V. S. Bhadouria, D. Ghoshal, and A. H. Siddiqi โ€œA wavelet transform and median filteringโ€, Nirma University new approach for high density saturated impulse noise International Conference on Engineering (NUiCONE), removal using decision-based coupled window median IEEE, 2013. filterโ€, Signal, Image and Video Processing, vol.8, no.1, [102] H. Dong, and F. Wang, โ€œImage-Denoising Based on pp.71-84, 2014. Bior Wavelet Transform and Median Filterโ€, Photonics and [119] C. Tomasi, and R. Manduchi, โ€œBilateral filtering for Optoelectronics (SOPO), Symposium on IEEE, 2012. gray and color imagesโ€, Proceedings of IEEE 6th [103] M. Gabhel, and A. Hiradhar, โ€œComparative Analysis of International Conference on Computer Vision (ICCV), pp. Various Denoising Techniques for MRI Image Using 839โ€“846, 1998. Waveletโ€, International Journal of Science and Research, [120] L. Jin, C. Xiong, and H. Liu, โ€œImproved bilateral filter vol.3, no. 9, pp.1212-1216, 2014. for suppressing mixed noise in color imagesโ€, Digital Signal [104] R. S. Shalini Hema, and M. S. Godwin Premi, Processing, vol. 22, no.6, pp. 903-912, 2012. โ€œComparative analysis of various for denoising color imagesโ€, ARPN Journal of Engineering and Applied About the Authors Sciences, vol.10, no. 9, 2015, pp.3862-3867. Roji Chanu did BE and M.Tech from MIT [105] A. J. Bardos, and S. J. Sangwine, โ€œSelective vector Manipur and NIT Silchar both in median filtering of colour imagesโ€, Image Processing and Electronics and Communication Its Applications, 1997. Engineering. Currently, she is an assistant [106] B. Smolka, K. N. Plataniotis, R. Lukac and A. N. professor at NIT Nagaland. She is pursuing Venetsanopoulos, โ€œSimilarity based impulsive noise PhD in the field of Digital Image removal in color imagesโ€, International conference on Processing. She takes interest in Signal Multimedia and Expo, IEEE, 2003. Processing, Image Processing etc. [107] B. Smolka, R. Lukac, A. Chydzinski, K. N. Plataniotis, and W. Wojciechowski, โ€œFast adaptive similarity based impulsive noise reduction filterโ€, Real-Time Imaging, vol. 9,

no.4, pp.261-276, 2003. Kh. Manglem Singh did BE, MTech, MS [108] M. Szczepanski, B. Smolka. K. N. Plataniotis, and A. and PhD in Electrical Engineering, Control N. Venetsanopoulos, โ€œOn the geodesic paths approach to & Instrumentation, Software Systems and color image filteringโ€, Signal Processing, vol. 83, no.6, from DEI, pp.1309-1342, 2003. Agra, Delhi University, BITS Pilani and [109] Z. Wang, and D. Zhang โ€œRestoration of impulse noise IIT Guwahati respectively. Currently, he is corrupted images using long-range correlationโ€, IEEE an Associate Professor at NIT Manipur. Signal Processing Letters, vol. 5, no.1, pp. 4-7, 1998. His areas of interest are Image processing, [110] D. Zhang, and Z. Wang, โ€œImage information Digital Watermarking, Steganography, and restoration based on long-range correlationโ€, IEEE Information Security etc. Transactions on Circuits and Systems for Video Technology, vol.12, no.5, pp.331-341, 2002. [111] T. Sun, and Y. Neuvo, โ€œDetail-preserving median based filters in image processingโ€, Pattern Recognition Letters, vol.15, no.4, pp. 341-347, 1994. [112] D. Zhang, and Z. Wang, โ€œImpulse noise removal using polynomial approximationโ€, Optical Engineering, vol.37, no.4, pp. 1275-1282, 1998. [113] L. Khriji, F. A. Cheikh, and M. Gabbouj, โ€œHigh- resolution digital resampling using vector rational filtersโ€, Optical Engineering, vol.38, no.5, pp.893-901, 1999.