APPLICATION OF GENETIC ALGORITHM FOR IMAGE TRANSFER

For images transfer, different embedding system exist which works by creating a mosaic image from the source image and recovery from the target image using some sort of algorithm. In current study, a method is proposed using the genetic algorithm for recovery of image from the source image. The algorithm utilized is genetic algorithm which is a search method along with another additional technique for obtaining higher robustness and security. The proposed methodology works by dividing the source image into smaller parts which are fitted into target image using the lossless compression. The mosaic image is recovered at retrieving side by the permutation array which is recovered and mapped using the pre-select key.

Equidistant permutation arrays: a bound

An equidistant permutation array is a ν × r array A(r, λ;ν) defined on a r-set X such that every row of A is a permutation of X and any two distinct rows agree in precisely λ common columns. Define In this paper, we show that where n = r − λ. Certain results pertaining to irreducible equidistant permutation arrays are also established.

The Asymptotic Behaviour of Equidistant Permutation Arrays

An equidistant permutation array (EPA) A(r λ v) is a v × r array defined on a set V of r symbols such that every row is a permutation of V and any two distinct rows have precisely λ common column entries. Define R(r, λ) to be the largest value of v for which there exists an A (r, λ; v). Deza [2] has shown thatwhere n = r – λ. Bolton [1] has shown that(*)In this paper, we show that equality holds in (*) for λ > ┌n/3┐(n2 + n). In order to do this we require several more definitions.

Recursive constructions for equidistant permutation arrays

An equidistant permutation array (EPA) is a ν ×rarray defined on anr-set,R, such that (i) each row is a permutation of the elements ofRand (ii) any two distinct rows agree in λ positions (that is, the Hamming distance is (r−λ)).Such an array is said to have order ν. In this paper we give several recursive constructions for EPA's.The first construction uses a resolvable regular pairwise balanced design of ordervto construct an EPA of order ν. The second construction is a generalization of the direct product construction for Room squares.We also give a construction for intersection permutation arrays, which arrays are a generalization of EPA's.