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.