Hiding and Seeking
               Statistics Aware Embedding

Current embedding research:
Design an embedding algorithm that is aware of global image statistics.

Create several choices to embed a single bit:
Increment or decrement to change bits in two different ways.
Use power of parity to increase the number of possible embeddings for a bit.

Search over possible embeddings to find embedding that minimizes changes in global image statistics.
Successful in preventing increase in blockiness.

More analysis is still required.
Detection via class discrimination might still be feasible.