Share This Article:

First Order Fuzzy Transform for Images Compression

Abstract Full-Text HTML XML Download Download as PDF (Size:582KB) PP. 178-194
DOI: 10.4236/jsip.2017.83012    712 Downloads   1,347 Views   Citations

ABSTRACT

In this paper, we present a new image compression method based on the direct and inverse F1-transform, a generalization of the concept of fuzzy transform. Under weak compression rates, this method improves the quality of the images with respect to the classical method based on the fuzzy transform.

1. Introduction

We present a new image compression method based on the discrete direct and inverse F1-transform which is a generalization of the classical fuzzy transform [1] [2] identified as F0-transform (for brevity, F-transform).

The F-transform compression technique [3] is a lossy compression method used in image and video analysis [4] - [18] and in data analysis [19] - [25] as well. In [26] , the concept of the F-transform was extended to the cases with various types of fuzzy partitions. In [1] [27] , the Fs-transform (s ≥ 1), a generalization of the F-transform, was presented: in other terms, the constant components of the F-transform were replaced by polynomials in order to capture more information of the original function. In particular, the F1-transform was used for the edge detection problem [1] [2] . The aim of this paper is to improve the quality of the decoded images after their compression via the F1-transform-based method.

Strictly speaking, we divide images of sizes N × M into smaller images (called blocks) of sizes N(B) × M(B) and then we code each block into another one of sizes n(B) × m(B), where n(B) < N(B) and m(B) < M(B). The compression is performed by calculating the direct F1-transform components with first degree polynomials. Afterwards, we calculate the inverse F1-transform and obtain the corresponding decoded blocks, recomposed to obtain the final reconstructed image. In Figure 1, we describe this process in detail.

The compression rate is given by ρ = ( n ( B ) × m ( B ) ) / ( N ( B ) × M ( B ) ) . The quality of a decoded image is measured by the Peak Signal to Noise Ratio (PSNR) index.

In Section 2, we recall the definition of h-uniform generalized fuzzy partition and the concept of F1-transform. In Section 3, a F1-transform-based compression method is presented and it is applied to images considered as fuzzy relations: there every image is partitioned into smaller blocks and the direct and inverse F1-transforms are calculated for each block. Then the decoded blocks are recomposed and the PSNR index is calculated. In Section 4, tests are applied to grey image datasets and the results are compared with similar results obtained by using the classical F-transform compression method. Section 5 contains the conclusions.

2. Generalized Fuzzy Partition and F1-Transform

We recall the main concepts [2] that will be used in the sequel. We consider a set of points (called nodes) x 0 , x 1 , x 2 , , x n , x n + 1 , n 2 of [ a , b ] such that a = x 0 x 1 < x 2 < < x n x n + 1 = b . We say that the fuzzy sets A 1 , , A n : [ a , b ] [ 0 , 1 ] form a generalized fuzzy partition of [ a , b ] , if for each k = 1 , 2 , , n , there exist h k , h k 0 such that h k + h k > 0 , [ x k h k , x k + h k ] [ a , b ] and the following constraints hold:

Figure 1. The F1-transform image compression method.

1) (locality) A k ( x ) > 0 if x [ x k h k , x k + h k ] and A k ( x ) = 0 if x [ x k h k , x k + h k ] ,

2) (continuity) Ak is continuous in [ x k h k , x k + h k ] ,

3) (covering) for each x [ a , b ] , k = 1 n A k ( x ) > 0 .

The fuzzy sets { A 1 , , A n } are called basic functions. If the nodes x 0 , x 1 , , x n , x n + 1 are equidistant, i.e. x k + 1 x k = h for k = 0 , 1 , 2 , , n , where h = ( b a ) / ( n + 1 ) , if h > h / 2 and the following additional properties hold:

4) h 1 = h n = 0 , h 1 = h 2 = = h n 1 = h n = h and A k ( x k x ) = A k ( x k + x ) for each x [ 0 , h ] and k = 2 , , n ,

5) A k ( x ) = A k 1 ( x h ) and A k + 1 ( x ) = A k ( x h ) for every x [ x k , x k + 1 ] and k = 2 , , n , then { A 1 , , A n } is called an ( h , h ) -uniform generalized fuzzy partition. In this case we can find a function A 0 : [ 1 , 1 ] [ 0 , 1 ] , called generating function, which is assumed to be even, continuous and positive everywhere except on the boundaries, where it vanishes, in such a way we have that for k = 1 , 2 , , n :

A k ( x ) = { A 0 ( x x k h ) x [ x k h , x k + h ] 0otherwise . (1)

If h = h , then the ( h , h ) -uniform generalized fuzzy partition is said h-uniform generalized fuzzy partition. We can extend the notion of h-uniform generalized fuzzy partition from an interval to the rectangle [ a , b ] × [ c , d ] , so that we have the family of basic functions { A k × B l , k = 1 , , n , l = 1 , , m ; n , m 2 } , where A k × B l is the product of the corresponding functions from the h1-uniform generalized fuzzy partition { A 1 , , A n } of [ a , b ] and from the h2-uniform generalized fuzzy partition { B 1 , , B m } of [ c , d ] . Then we can say that { A k × B l , k = 1 , , n , l = 1 , , m ; n , m 2 } is an h-uniform generalized fuzzy partition of [ a , b ] × [ c , d ] , where h = h 1 h 2 . In the sequel we consider only such h-uniform generalized fuzzy partitions.

Let A k ( x ) be a basic function of [ a , b ] and L 2 ( A k ) be the Hilbert space of square integrable functions f : [ x k 1 , x k + 1 ] R (reals) with weighted inner product:

f , g k = x k 1 x k + 1 f ( x ) g ( x ) A k ( x ) d x

Likewise, we define the Hilbert space L 2 ( A k × B l ) of square integrable in two variables functions f : [ x k 1 , x k + 1 ] × [ y l 1 , y l + 1 ] R with weighted inner product:

f , g k l = x k 1 x k + 1 y l 1 y l + 1 f ( x ) g ( x ) A k ( x ) B l ( y ) d x d y (2)

Two function f , g L 2 ( A k × B l ) are orthogonal if f , g k l = 0 . Let L 2 p ( A k ) and L 2 r ( B l ) , p , r 0 be two linear subspaces of L 2 ( A k ) and L 2 ( B l ) with orthogonal basis given by polynomials { P k i ( x ) } i = 0 , , p and { Q k j ( y ) } j = 0 , , r , respectively.

We consider an integer s 0 and all pairs of integers (i, j) such that 0 i + j s . We introduce a linear subspace L 2 s ( A k × B l ) of L 2 ( A k × B l ) having as orthogonal basis the following:

{ S k l i j ( x , y ) = P k i ( x ) Q l j ( y ) } i = 0 , , p ; j = 0 , , r : i + j s (3)

where s is the maximum degree of polynomials P k i ( x ) Q l j ( y ) . For s = 1, the orthogonal basis of the linear space L 2 1 ( A k × B l ) is the following:

{ S k l 00 ( x , y ) = P k 0 ( x ) Q l 0 ( y ) , S k l 10 ( x , y ) = P k 1 ( x ) Q l 0 ( y ) , S k l 01 ( x , y ) = P k 0 ( x ) Q l 1 ( y ) } (4)

Let L 2 ( [ a , b ] × [ c , d ] ) be a set of functions f : [ a , b ] × [ c , d ] R such that for k = 1 , , n , l = 1 , , m , f | [ x k 1 , x k + 1 ] × [ y k 1 , y k + 1 ] L 2 ( A k ) × L 2 ( B l ) , where the function f | [ x k 1 , x k + 1 ] × [ y k 1 , y k + 1 ] is the restriction of f on [ x k 1 , x k + 1 ] × [ y k 1 , y k + 1 ] . Then the following theorem holds:

Theorem 1. ( [2] , lemma 5). Let f L 2 ( [ a , b ] × [ c , d ] ) . Then the orthogonal projection of f on L 2 s ( A k × B l ) , s 0 , is the polynomial of degree s given by

F k l s ( x , y ) = 0 i + j s c k l i j S k l i j ( x , y ) (5)

for every ( x , y ) [ a , b ] × [ c , d ] , where the coefficients c k l i j are given by

c k l i j = y l 1 y l + 1 x k 1 x k + 1 f ( x , y ) S k l i j ( x , y ) A k ( x ) B l ( y ) d x d y y l 1 y l + 1 x k 1 x k + 1 ( S k l i j ( x , y ) ) 2 A k ( x ) B l ( y ) d x d y (6)

Following [2] , let { A k × B l , k = 1 , , n , l = 1 , , m , n , m 2 } be an h-uniform generalized fuzzy partition of [ a , b ] × [ c , d ] and f L 2 ( A k × B l ) . For s = 1, the orthogonal basis of the linear subspace L 2 1 ( A k × B l ) is given by the polynomials:

S k l 00 ( x , y ) = P k 0 ( x ) Q l 0 ( y ) = 1 S k l 10 ( x , y ) = P k 1 ( x ) Q l 0 ( y ) = x x k S k l 01 ( x , y ) = P k 0 ( x ) Q l 1 ( y ) = y y l (7)

Let F k l 1 be the orthogonal projection of f | [ x k 1 , x k + 1 ] × [ y k 1 , y k + 1 ] on L 2 1 ( A k × B l ) given point wise as

F k l 1 ( x , y ) = 0 i + j 1 c k l i j S k l i j ( x , y ) = c k l 00 + c k l 10 ( x x k ) + c k l 01 ( y y l ) (8)

for every ( x , y ) [ a , b ] × [ c , d ] , where the three coefficients c k l 00 , c k l 10 , c k l 01 are defined by Theorem 1:

c k l 00 = y l 1 y l + 1 x k 1 x k + 1 f ( x , y ) A k ( x ) B l ( y ) d x d y x k 1 x k + 1 A k ( x ) d x y l 1 y l + 1 B l ( y ) d y (9)

c k l 10 = y l 1 y l + 1 x k 1 x k + 1 f ( x , y ) ( x x k ) A k ( x ) B l ( y ) d x d y x k 1 x k + 1 A k ( x ) ( x x k ) 2 d x y l 1 y l + 1 B l ( y ) d y (10)

c k l 01 = y l 1 y l + 1 x k 1 x k + 1 f ( x , y ) ( y y l ) A k ( x ) B l ( y ) d x d y x k 1 x k + 1 A k ( x ) d x y l 1 y l + 1 B l ( y ) ( y y l ) 2 d y (11)

Then the matrix F n m 1 [ f ] = ( F 11 1 , , F n m 1 ) , defined from (8), is called F1-transform of the function f L 2 ( A k × B l ) with respect to the h-uniform generalized fuzzy partition { A k × B l , k = 1 , , n , l = 1 , , m ; n , m 2 } . We define the inverse F1-transform of the function f L 2 ( A k × B l ) to be a function f ^ n m 1 : [ a , b ] × [ c , d ] R as

f ^ n m 1 ( x , y ) = k = 1 n l = 1 m F n m 1 ( x , y ) A k ( x ) B l ( y ) k = 1 n l = 1 m A k ( x ) B l ( y ) (12)

For sake of completeness, we point out the utility of the concept of inverse F1-transform which stands in the approximation of the function f L 2 ( A k × B l ) under certain suitable assumptions. For example, we have the following result:

Theorem 2. ( [2] , theorem 14). Let { ( A k ( x ) , B l ( y ) ) , k = 1 , , n , l = 1 , , m , n , m 2 } be an h-uniform generalized fuzzy partition of [ a , b ] × [ c , d ] and f ^ n m 1 be the inverse F1-transform of f with respect to this fuzzy partition. Moreover let f be four times continuously differentiable on [ a , b ] × [ c , d ] and Ak (resp., Bl) be four times continuously differentiable on [ a , b ] (resp., [ c , d ] ). Then the following holds for every ( x , y ) [ a , b ] × [ c , d ] :

f ( x , y ) f ^ n m 1 ( x , y ) = O ( h 2 ) (13)

In other words, the Equality (13) says that we can approximate a function in two variables, four times continuously differentiable on [ a , b ] × [ c , d ] , with the inverse F1-transform (12) unless to O (h2).

3. F1-Transform Image Compression Method

We are interested to the case discrete, i.e. we consider functions in two variables which assume a finite number of values in [ 0 , 1 ] like finite fuzzy relations. Indeed, let R be a grey image of sizes N × M , R : ( i , j ) { 1 , , N } × { 1 , , M } [ 0 , 1 ] , R ( i , j ) = R i j being the normalized value of the pixel P ( i , j ) , that is R ( i , j ) = P ( i , j ) / N l e v if Nlev is the length of the grey scale. Let { A 1 , , A n } and { B 1 , , B m } be two h-uniform generalized fuzzy partitions of [ a , b ] = [ 1 , N ] and [ c , d ] = [ 1 , M ] , respectively, where a = 1 , b = N , x k = k , k = 1 , 2 , , n , n N , c = 1 , d = M , y l = l , l = 1 , 2 , , m , m M . Slightly modifying (8), then we can define the (discrete) F1-transform R n m 1 = [ R k l 1 ] n × m of R the matrix whose entries are defined as

R k l 1 = c k l 00 + c k l 10 | i k | + c k l 01 | j l | (14)

where c k l 00 , c k l 10 , c k l 01 are given as (by rewriting the Equations (9), (10), (11) in the following form, slightly modified):

c k l 00 = j = 1 M i = 1 N R i j A k ( i ) B l ( j ) j = 1 M i = 1 N A k ( i ) B l ( j ) (15)

c k l 10 = j = 1 M i = 1 N R i j | i k | A k ( i ) B l ( j ) i = 1 N A k ( i ) ( i k ) 2 j = 1 M B l ( j ) (16)

c k l 01 = j = 1 M i = 1 N R i j | j l | A k ( i ) B l ( j ) i = 1 N A k ( i ) j = 1 N B l ( j ) ( j l ) 2 (17)

The Formula (14) is considered as a compressed image of the original image R. R n m 1 can be decoded by using the following inverse (discrete) F1-transform R N M 1 = [ R i j 1 ] N × M defined for every ( i , j ) { 1 , , N } × { 1 , , M } as

R i j 1 = k = 1 n l = 1 m R k l 1 A k ( i ) B l ( j ) k = 1 n l = 1 m A k ( i ) B l ( j ) (18)

We divide the image R of sizes N × M in sub-matrices RB of sizes N ( B ) × M ( B ) , called blocks ( [26] [28] ), each compressed to a block [ R k l 1 B ] n ( B ) × m ( B ) of sizes

n ( B ) × m ( B ) ( 3 n ( B ) < N ( B ) , 3 m ( B ) < M ( B ) ) , k = 1 , , n ( B ) , l = 1 , , m ( B ) , via the discrete F1-transform, as Formula (14), of components R k l 1 B given by

R k l 1 B = c k l 00 B + c k l 10 B | i k | + c k l 01 B | j l | (19)

We rewrite (15), (16), (17) as

c k l 00 B = j = 1 M ( B ) i = 1 N ( B ) R i j B A k ( i ) B l ( j ) j = 1 M ( B ) i = 1 N ( B ) A k ( i ) B l ( j ) (20)

c k l 10 B = j = 1 M ( B ) i = 1 N ( B ) R i j B | i k | A k ( i ) B l ( j ) i = 1 N ( B ) A k ( i ) ( i k ) 2 j = 1 M ( B ) B l ( j ) (21)

c k l 01 B = j = 1 M ( B ) i = 1 N ( B ) R i j B | j l | A k ( i ) B l ( j ) i = 1 N ( B ) A k ( i ) j = 1 M ( B ) B l ( j ) ( j l ) 2 (22)

The basic functions { A 1 , , A n ( B ) } and { B 1 , , B m ( B ) } form an h-uniform generalized uniform fuzzy partition of [ 1 , N ( B ) ] and [ 1 , M ( B ) ] , respectively. They are generated by the basic functions A 0 ( x ) = 0.5 [ 1 + cos ( π x ) ] and B 0 ( y ) = 0.5 [ 1 + cos ( π y ) ] , respectively. Then we have that

A 1 ( x ) = { 0.5 ( 1 + cos π h 1 ( x x 1 ) ) if x [ x 1 , x 2 ] 0 otherwise A k ( x ) = { 0.5 ( 1 + cos π h 1 ( x x k ) ) if x [ x k - 1 , x k + 1 ] 0otherwise A n ( x ) = { 0.5 ( 1 + cos π h 1 ( x x n ) ) if x [ x n 1 , x n ] 0otherwise (23)

where n = n ( B ) , h 1 = ( N ( B ) 1 ) / ( n 1 ) , x k = 1 + h 1 ( k 1 ) , k = 2 , , n 1 and

B 1 ( y ) = { 0.5 ( 1 + cos π h 2 ( y y 1 ) ) if y [ y 1 , y 2 ] 0 otherwise B l ( y ) = { 0.5 ( 1 + cos π h 2 ( y y t ) ) if y [ y t - 1 , y t + 1 ] 0otherwise B m ( y ) = { 0.5 ( 1 + cos π h 2 ( y y m ) ) if y [ y m 1 , y m ] 0otherwise (24)

where m = m ( B ) , h 2 = ( M ( B ) 1 ) / ( m 1 ) , y l = 1 + h 2 ( l 1 ) , l = 2 , , m 1 . In Figure 2, we show the basic functions (23) for N = 16 and n = 4.

The compressed block [ R k l 1 B ] n ( B ) × m ( B ) is decoded to a block [ R i j 1 B ] N ( B ) × M (B)

of sizes N ( B ) × M ( B ) by using the inverse F1-transform defined for every ( i , j ) { 1 , , N B } × { 1 , , M B } as

R i j 1 B = k = 1 n ( B ) l = 1 m ( B ) R k l 1 B A k ( i ) B l ( j ) k = 1 n ( B ) l = 1 m ( B ) A k ( i ) B l ( j ) (25)

which approximates the original block RB. Making the union of all the decoded blocks R1B, we obtain a fuzzy relation (denoted with) R1 of sizes N × M . Then we measure the RMSE (Root Mean Square Error) given by

Figure 2. Cosine basic functions (N = 16, n = 4)

RMSE = i = 1 N j = 1 M ( R i j R i j 1 ) 2 N × M (26)

which implies that PSNR is the following:

PSNR = 20 log 10 N l e v 1 RMSE (27)

4. Test Results

We compare our method with the classical F-transform compression method, but here no comparison is made with the one inspired to the Canny method used in [2] .

For our tests we have considered the CVG-UGR image database extracting grey images of sizes 256 × 256 (cfr., http://decsai.ugr.es/cvg/dbimagenes/). For brevity, we only give the results for three images as Lena, Einstein and Leopard whose sources are given in Figures 3(a)-(c), respectively.

In Table 1, we show the PSNR of the F-transform and F1-transform methods for some values of the compression rate in the image Lena.

We make the following remarks on Table 1:

− for weak compression rates the quality of the decoded image under the F1-transform method is better than the one obtained with the F-transform method;

− for strong compression rates the quality of the images decoded in the two methods is similar;

− the difference between the two PSNR’s in the two methods overcomes 0.1 for ρ > 0.25.

In Figure 4, we show the trend of the PSNR for the two methods.

In Figures 5(a)-(d) (resp., Figures 6(a)-(d)), we show the decoded images of Lena obtained by using the F-transform (resp., F1-transform) for ρ = 0.0.0625, 0.16, 0.284444 and 0.444444, respectively.

(a) (b) (c)

Figure 3. (a) Lena; (b) Einstein; (c) Leopard.

Figure 4. PSNR trend for the source image Lena.

Table 1. PSNR of the F-transform and F1-transform methods for some values of the compression rate in the image Lena.

(a) (b)(c) (d)

Figure 5. (a) F-tr under ρ = 0.0.0625; (b) F-tr under ρ = 0.16; (c) F-tr decoded (ρ = 0.284444); (d) F-tr decoded (ρ = 0.444444).

(a) (b)(c) (d)

Figure 6. (a) F1-tr decoded (ρ = 0.0.0625); (b) F1-tr decoded (ρ = 0.16); (c) F1-tr decoded (ρ = 0.284444); (d) F1-tr decoded (ρ = 0.444444).

In Table 2 and Figure 7, we show the PSNR obtained using the F-transform and F1-transform methods for some values of the compression rate in the image Einstein: this table confirms the same results obtained for the image Lena in Table 1.

In Figures 8(a)-(d) (resp., Figures 9(a)-(d)) we show the decoded images of Einstein obtained using the F-transform (resp., F1-transform) method for ρ = 0.0.0625, 0.16, 0.284444 and 0.444444, respectively.

In Table 3 we show the PSNR values obtained using the F-transform and F1-transform methods for some values of the compression rate in the image Leopard.

Figure 7. PSNR trend for the source image Einstein.

Table 2. PSNR results obtained for the source image Einstein.

(a) (b) (c) (d)

Figure 8. (a) F-tr decoded (ρ = 0.0.0625); (b) F-tr decoded (ρ = 0.16); (c) F-tr decoded (ρ = 0.284444); (d) F-tr decoded (ρ = 0.444444).

(a) (b) (c) (d)

Figure 9. (a) F1-tr decoded (ρ = 0.0.0625); (b) F1-tr decoded (ρ = 0.16); (c) F1-tr decoded (ρ = 0.284444); (d) F1-tr decoded (ρ = 0.444444).

Table 3 confirms the results obtained for the images Lena and Einstein: the quality of the decoded image obtained by using the F1-transform is better than the one obtained using the F-transform for weak compression rates. In Figure 10, we show the trend of the PSNR index obtained by using the two methods.

In Figures 11(a)-(d) (resp., Figures 12(a)-(d)), we show the decoded images of Leopard obtained by using the F-transform (resp., F1-transform) method for ρ = 0.0.0625, 0.16, 0.284444, 0.444444, respectively.

In Figure 13, we show the trend of the difference of PSNR by varying the compression rate for all the images in the dataset above considered.

Figure 10. PSNR trend for the source image Leopard.

Table 3. PSNR results obtained for the source image Leopard.

(a) (b) (a) (b)

Figure 11. (a) F-tr decoded (ρ = 0.0.0625); (b) F-tr decoded (ρ = 0.16); (c) F-tr decoded (ρ=0.284444); (d) F-tr decoded (ρ=0.444444).

(a) (b) (a) (b)

Figure 12. (a) F1-tr decoded (ρ = 0.0.0625); (b) F1-tr decoded (ρ = 0.16); (c) F1-tr decoded (ρ = 0.284444); (d) F1-tr decoded (ρ = 0.444444).

Figure 13. PSNR trend for all the images in the dataset considered.

Summarizing, we can say that the presence of the coefficients of the F1-transform is negated by noise introduced during the strong compressions, while this effect increases considerably using weak compressions rates.

5. Conclusion

We give an image compression method based on the direct and inverse F1-transform. The results show that the PSNR of the reconstructed images with the F1-transform-based compression method is better than the one obtained with the F-transform-based compression. In the tested dataset of images, we find that the difference between the two corresponding PSNR values is greater than 0.1 (resp., 0.25) for ρ = 0.25 (resp., ρ ≈ 0.5). In the next papers, we shall use the F1-transform in data analysis problems.

Acknowledgements

We also accomplish this research under the auspices of the INDAM-GCNS, Italy. The last author acknowledges a partial support from the European Regional Development Fund in the IT4Innovations Centre of Excellence project (CZ.1.05/ 1.1.00/02.0070).

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

Martino, F. , Sessa, S. and Perfilieva, I. (2017) First Order Fuzzy Transform for Images Compression. Journal of Signal and Information Processing, 8, 178-194. doi: 10.4236/jsip.2017.83012.

References

[1] Perfilieva, I. and Hodáková, P. (2013) F1-Transform of Functions of Two Variables. Proceedings of EUSFLAT 2013, Advances in Intelligent Systems Research, Milano, 32, 547-553.
[2] Perfilieva, I., Hodáková, P. and Hurtik, P. (2014) Differentiation by the F-Transform and Application for Edge Detection. Fuzzy Sets and Systems, 288, 96-114.
https://doi.org/10.1016/j.fss.2014.12.013
[3] Perfilieva, I. (2006) Fuzzy Transform: Theory and Application. Fuzzy Sets and Systems, 157, 993-1023.
https://doi.org/10.1016/j.fss.2005.11.012
[4] Di Martino, F., Loia, V. and Sessa, S. (2003) A Method in the Compression/Decompression of Images Using Fuzzy Equations and Fuzzy Similarities. Proceedings of the 10th IFSA World Congress, Istanbul, 30 June-2 July 2003, 524-527.
[5] Di Martino, F., Loia, V., Perfilieva, I. and Sessa, S. (2008) An Image Coding/Decoding Method Based on Direct and Inverse Fuzzy Transforms. International Journal of Approximate Systems, 48, 110-131.
https://doi.org/10.1016/j.ijar.2007.06.008
[6] Di Martino, F. and Sessa, S. (2007) Compression and Decompression of Images with Discrete Fuzzy Transforms. Information Sciences, 177, 2349-2362.
https://doi.org/10.1016/j.ins.2006.12.027
[7] Di Martino, F., Loia, V. and Sessa, S. (2010) A Segmentation Method for Images Compressed by Fuzzy Transforms. Fuzzy Sets and Systems, 161, 56-74.
https://doi.org/10.1016/j.fss.2009.08.002
[8] Di Martino, F., Loia, V. and Sessa, S. (2010) Fuzzy Transforms for Compression and Decompression of Colour Videos. Information Sciences, 180, 3914-3931.
https://doi.org/10.1016/j.ins.2010.06.030
[9] Di Martino, F., Hurlik, P., Perfilieva, I. and Sessa, S. (2014) A Color Image Reduction Based on Fuzzy Transforms. Information Sciences, 266, 101-111.
https://doi.org/10.1016/j.ins.2014.01.014
[10] Di Martino, F. and Sessa, S. (2013) Coding B-Frames on Color Videos with Fuzzy Transforms. Advances on Fuzzy Systems, 2013, Article ID: 652429.
https://doi.org/10.1155/2013/652429
[11] Di Martino, F., Loia, V. and Sessa, S. (2012) Fragile Watermarking Tamper Detection with Images Compressed by Fuzzy Transform. Information Sciences, 195, 62-90.
https://doi.org/10.1016/j.ins.2012.01.014
[12] Di Martino, F., Loia, V. and Sessa, S. (2013) Image Matching by Using Fuzzy Transform. Advances on Fuzzy Systems, 2013, Article ID: 760705, 10 p.
[13] Loia, V. and Sessa, S. (2005) Fuzzy Relation Equations for Coding/Decoding Processes of Images and Videos. Information Sciences, 171, 145-172.
https://doi.org/10.1016/j.ins.2004.04.003
[14] Nobuhara, H., Pedrycz, W. and Hirota, K. (2000) Fast Solving Method of Fuzzy Relational Equation and Its Application to Lossy Image Compression. IEEE Transactions on Fuzzy Systems, 8, 325-334.
https://doi.org/10.1109/91.855920
[15] Nobuhara, H., Pedrycz, W. and Hirota, K. (2005) Relational Image Compression: Optimizations through the Design of Fuzzy Coders and YUV Color Space. Soft Computing, 9, 471-479.
https://doi.org/10.1007/s00500-004-0366-7
[16] Nobuhara, H., Hirota, K., Di Martino, F., Pedrycz, W. and Sessa, S. (2005) Fuzzy Relation Equations for Compression/Decompression Processes of Colour Images in the RGB and YUV Colour Spaces. Fuzzy Optimization and Decision Making, 4, 235-246.
https://doi.org/10.1007/s10700-005-1892-1
[17] Perfilieva, I. and De Baets, B. (2010) Fuzzy Transforms of Monotone Functions with Application to Image Compression. Information Sciences, 180, 3304-3315.
https://doi.org/10.1016/j.ins.2010.04.029
[18] Vajgl, M., Perfilieva, I. and Hodáková, P. (2012) Advanced F-Transform Based Image Fusion. Advances in Fuzzy Systems, 2012, Article ID: 125086, 9 p.
https://doi.org/10.1155/2012/125086
[19] Di Martino, F., Loia, V. and Sessa, S. (2010) Fuzzy Transforms Method and Attribute Dependency in Data Analysis. Information Sciences, 180, 493-505.
https://doi.org/10.1016/j.ins.2009.10.012
[20] Di Martino, F., Loia, V. and Sessa, S. (2011) Fuzzy Transforms Method in Prediction Data Analysis. Fuzzy Sets and Systems, 180, 146-163.
https://doi.org/10.1016/j.fss.2010.11.009
[21] Holcapek, M. (2011) A Smoothing Filter Based on Fuzzy Transform. Fuzzy Sets and Systems, 180, 69-97.
https://doi.org/10.1016/j.fss.2011.05.028
[22] Perfilieva, I., Novak, V. and Dvorak, A. (2008) Fuzzy Transforms in the Analysis of Data. International Journal of Approximate Reasoning, 40, 26-46.
https://doi.org/10.1016/j.ijar.2007.06.003
[23] Stěpnicka, M. and Polakovic, O. (2009) A Neural Network Approach to the Fuzzy Transform. Fuzzy Sets and Systems, 160, 1037-1047.
https://doi.org/10.1016/j.fss.2008.11.029
[24] Stěpnieka, M., Dvorák, A., Pavliska, V. and Vavrícková, L. (2011) A Linguistic Approach to Time Series Modeling with the Help of F-Transform. Fuzzy Sets and Systems, 180, 164-184.
https://doi.org/10.1016/j.fss.2011.02.017
[25] Troiano, L. and Ktriptani, P. (2011) Supporting Trading Strategies by Inverse Fuzzy Transform. Fuzzy Sets and Systems, 180, 121-145.
https://doi.org/10.1016/j.fss.2011.05.004
[26] Bede, B. and Rudas, I.J. (2011) Approximation Properties of Fuzzy Transforms. Fuzzy Sets and Systems, 180, 20-40.
https://doi.org/10.1016/j.fss.2011.03.001
[27] Perfilieva, I., Dankova, M. and Bede, B. (2011) Towards a Higher Degree F-Transform. Fuzzy Sets Systems, 180, 3-19.
https://doi.org/10.1016/j.fss.2010.11.002
[28] Di Martino, F., Loia, V. and Sessa, S. (2003) A Method for Coding/Decoding Images by Using Fuzzy Relation Equations. In: Bilgic, T., De Baets, B. and Kaynak, O., Eds., Fuzzy Sets and Systems—IFSA 2003, Lecture Notes in Artificial Intelligence, Vol. 2715, Springer, Berlin, 436-441.
https://doi.org/10.1007/3-540-44967-1_52

  
comments powered by Disqus

Copyright © 2018 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.