A Technique Getting Fast Masks Using Rough Division in Dynamic ROI Coding of JPEG2000

Jae-Heung Park, Jum-Sook Lee, Y. Seo, Do-Soon Hong, Hyun-Joo Kim
{"title":"A Technique Getting Fast Masks Using Rough Division in Dynamic ROI Coding of JPEG2000","authors":"Jae-Heung Park, Jum-Sook Lee, Y. Seo, Do-Soon Hong, Hyun-Joo Kim","doi":"10.3745/KIPSTB.2010.17B.6.421","DOIUrl":null,"url":null,"abstract":"It takes a long time for the users to view a whole image from the image server under the low-bandwidth internet environments or in case of a big sized image. In this case, as there needs a technique that preferentially transfers a part of image, JPEG2000 offers a ROI(Region-of-Interest) coding. In ROI coding, the users see the thumbnail of image from the server and specifies some regions that they want to see first. And then if an information about the regions are informed to the server, the server preferentially transfers the regions of the image. The existing methods requested a huge time to compute the mask information, but this thesis approximately computes the regions and reduces the creating time of the ROI masks. If each code block is a mixed block which ROI and background are mixed, the proper boundary points should be acquired. Searching the edges of the block, getting the two points on the edge, to get the boundary point inside the code block, the method searches a mid point between the two edge points. The proposed method doesn`t have a big difference compared to the existing methods in quality, but the processing time is more speedy than the ones.","PeriodicalId":122700,"journal":{"name":"The Kips Transactions:partb","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Kips Transactions:partb","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3745/KIPSTB.2010.17B.6.421","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

It takes a long time for the users to view a whole image from the image server under the low-bandwidth internet environments or in case of a big sized image. In this case, as there needs a technique that preferentially transfers a part of image, JPEG2000 offers a ROI(Region-of-Interest) coding. In ROI coding, the users see the thumbnail of image from the server and specifies some regions that they want to see first. And then if an information about the regions are informed to the server, the server preferentially transfers the regions of the image. The existing methods requested a huge time to compute the mask information, but this thesis approximately computes the regions and reduces the creating time of the ROI masks. If each code block is a mixed block which ROI and background are mixed, the proper boundary points should be acquired. Searching the edges of the block, getting the two points on the edge, to get the boundary point inside the code block, the method searches a mid point between the two edge points. The proposed method doesn`t have a big difference compared to the existing methods in quality, but the processing time is more speedy than the ones.
JPEG2000动态ROI编码中基于粗糙分割的快速掩码提取技术
在低带宽的互联网环境下,或者在大尺寸图像的情况下,用户从图像服务器查看整个图像需要很长时间。在这种情况下,由于需要一种优先传输部分图像的技术,JPEG2000提供了ROI(感兴趣区域)编码。在ROI编码中,用户看到来自服务器的图像缩略图,并指定他们希望首先看到的一些区域。然后,如果将关于所述区域的信息告知所述服务器,则所述服务器优先传输所述图像的区域。现有的方法需要大量的时间来计算掩码信息,而本文对区域进行了近似计算,减少了ROI掩码的创建时间。如果每个代码块是ROI和背景混合的混合块,则需要获取合适的边界点。搜索块的边缘,得到边缘上的两个点,得到代码块内部的边界点,该方法搜索两个边缘点之间的一个中点。该方法与现有方法在质量上没有太大差异,但处理时间比现有方法快。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信