Wyniki wyszukiwania - Biblioteka Nauki

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

2 Fundamenta Informaticae

2 1998

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: fractal operator

Sortuj według:

Ogranicz wyniki do:

Analysis of fractal operator convergence by graph methods

100%

Skarbek W.

Fundamenta Informaticae

1998

tom Vol. 34, nr 4

429-440

The convergence of fractal operator F used in image compression is investigated by analysis of block influence graph and pixel influence graph. The graph stability condition in block influence graph implies eventual contractivity condition which is sufficient for the operator iteration convergence. The graph stability condition in pixel influence graph appears to be sufficient and necessary for convergence of selecting fractal operators.

A study on Partitioned Iterative Function Systems for image compression

100%

Mitra S. K. , Murthy C. A. , Kundu M. K.

Fundamenta Informaticae

1998

tom Vol. 34, nr 4

413-428

The technique of image compression using Iterative Function System (IFS) is known as fractal image compression. An extension of IFS theory is called as Partitioned or local Iterative Function System (PIFS) for coding the gray level images. The theory of PIFS appears to be different from that of IFS in the sense of application domain. Assuming the theory of PIFS is the same as that of IFS, several techniques of image compression have been developed. In the present article we have studied the PIFS scheme as a separate one and proposed a mathematical formulation for the existence of its attractor. Moreover the results of a Genetic Algorithm (GA) based PIFS technique is presented. This technique appears to be efficient in the sense of computational cost.