2010
DOI: 10.1016/j.ins.2010.06.030
|View full text |Cite
|
Sign up to set email alerts
|

Fuzzy transforms for compression and decompression of color videos

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
19
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
5
5

Relationship

2
8

Authors

Journals

citations
Cited by 42 publications
(20 citation statements)
references
References 33 publications
1
19
0
Order By: Relevance
“…Strictly speaking, Theorems 1 and 2 assure that a discrete (even multi-dimensional) function can be approximated arbitrarily with a suitable inverse (multidimensional) F. transform provided that a convenient fuzzy partition of the universe of discourse is found via related basic functions. Like pointed out in our previous papers [35,36,[38][39][40], unfortunately Theorem 1 (resp. Theorem 2) is not constructive, in the sense that it does not give a tool to find an integer n(ε)(resp., k integers n(1, ε), .…”
Section: X K ) Be a Function Assigned On The Set Of Pointssupporting
confidence: 57%
“…Strictly speaking, Theorems 1 and 2 assure that a discrete (even multi-dimensional) function can be approximated arbitrarily with a suitable inverse (multidimensional) F. transform provided that a convenient fuzzy partition of the universe of discourse is found via related basic functions. Like pointed out in our previous papers [35,36,[38][39][40], unfortunately Theorem 1 (resp. Theorem 2) is not constructive, in the sense that it does not give a tool to find an integer n(ε)(resp., k integers n(1, ε), .…”
Section: X K ) Be a Function Assigned On The Set Of Pointssupporting
confidence: 57%
“…In the literature the concept of F-transform has been applied to many practical problems such as data compression [13], image processing [4][5][6][7], geology [14].…”
Section: Introductionmentioning
confidence: 99%
“…A large number of block matching algorithms have been proposed over the last decades, such as the traditional methods found in [2]- [5], [7], [11], [15]- [16] and [24]. Amongst the available block matching algorithms, full search leads to the best possible match of the block in the reference frame with a block in another frame by calculating the cost function at each possible location in the search window.…”
Section: Literature Reviewmentioning
confidence: 99%