We put forward a construction of visual cryptographic scheme (VCS) to address the scenario, where there are several levels of importance of shadows. Traditional (k, n)-threshold VCS does not distinguish among the shadows—all shadows are of equal importance. Any k of them can recover the secret image whereas less than or equal to k- 1 shadows do not reveal any information about the secret image. We consider the scenario where there are several levels of essential participants (labeled according to their importance) and there must be an agreement across the levels to recover the secret image. This captures the distribution of importance of parties across several levels or compartments. We give a novel construction of visual cryptographic scheme realizing such access structures, where the parties are compartmented into different levels according to their importance. We come up with closed mathematical formulae of pixel expansion and relative contrast. We also consider more efficient probabilistic construction and compare contrasts with several other probabilistic, non-expansible constructions. Numerical evidence shows that our scheme performs better than the available generic constructions.