On visual cryptography schemes

We consider visual cryptography schemes in which two pixels combine in an arbitrary way. We analyze the pixel expansion and the contrast of (2,n)-threshold visual cryptography schemes, that is schemes in which any pair of n shares can visually reconstruct the secret image, but any single share has no information on the secret image.