Saturday, 7 March 2015

image processing - compression algorithm


Steganography can hide one image inside another.


If we have a compression algorithm that allows us to fit the bits for two images into the size of one, can we think of a way to modify a run-length encoding algorithm to take two images and produce one, in such a way that the first is retrieved in a lossy way, and the second is retrieved?


Please explain this with full description of your thinking.


If you know a good reference, please let me know.




No comments:

Post a Comment

readings - Appending 内 to a company name is read ない or うち?

For example, if I say マイクロソフト内のパートナーシップは強いです, is the 内 here read as うち or ない? Answer 「内」 in the form: 「Proper Noun + 内」 is always read 「ない...