Fast Dynamic ROI Coding using the Mask Patterns in JPEG2000


The KIPS Transactions:PartB , Vol. 18, No. 6, pp. 349-354, Dec. 2011
10.3745/KIPSTB.2011.18.6.349,   PDF Download:

Abstract

In ROI processing of JPEG2000, a region of large image indicated by the user must be processed preferentially, because it takes a considerable amount of time to display the full image. When the user indicates a region of the outlined image, then the browser masks the region and sends the mask information to the server that transmitted the outlined image. The server that receives the mask information preferentially sends the corresponding code blocks. Here, a quick generation of mask information is important. In this paper, we use 48 predefined mask patterns, which are defined according to the distribution shape of ROI and background to reduce the computing time. As a result, compared to other methods that precisely handles the ROI and background, the processing time of the method is remarkably reduced, but the quality is short of the existing methods just a little bit.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. H. Kang and Y. G. Seo, "Fast Dynamic ROI Coding using the Mask Patterns in JPEG2000," The KIPS Transactions:PartB , vol. 18, no. 6, pp. 349-354, 2011. DOI: 10.3745/KIPSTB.2011.18.6.349.

[ACM Style]
Juong Hyon Kang and Yeong Geon Seo. 2011. Fast Dynamic ROI Coding using the Mask Patterns in JPEG2000. The KIPS Transactions:PartB , 18, 6, (2011), 349-354. DOI: 10.3745/KIPSTB.2011.18.6.349.