| 摘要 |
PROBLEM TO BE SOLVED: To procedd an image composition of data compression-encoded by a JPEG 2000 at the highest speed possible with the smallest operation memory possible. SOLUTION: The JPEG 2000 is a block whose processing unit has a size equivalent to that of a tile unit and can discriminate coded data corresponding to an image applicable to a combining position. In addition, if the coded data does not use information on a different block so as not to affect wavelet transform/inverse transformation and has an independently processable block unit, the coded data can be decoded independently. A combination position is retrieved by a tile unit (S8 and S9), and combination processing such as encoding, combining, reencoding, etc., is performed with the coded data in the tile unit corresponding to the combination position specified as a retrieval result (S10 to S13). Thus, at least the entire image does not have to be restored, only combination processing that handles the less coded data possible is required, and the highest speed processing can be performed by using the smallest working memory possible. COPYRIGHT: (C)2004,JPO |
