• Journal of Digital Contents Society
• /
• v.16 no.4
• /
• pp.583-593
• /
• 2015

Today, caused by the growth of computer and communication technology, multimedia, especially image data are being used in different application divisions. JPEG2000 that is widely used these days provides a Region-of-Interest(ROI) technique. The extraction of ROI has to be rapidly executed and automatically extracted in a huge amount of image because of being seen preferentially to the users. For this purpose, this paper proposes a method about preferential processing and automatic extraction of ROI using the distribution of edge in the code block of JPEG2000. The steps are the extracting edges, automatical extracting of a practical ROI, grouping the ROI using the ROI blocks, generating the mask blocks and then quantization, ROI coding which is the preferential processing, and EBCOT. In this paper, to show usefulness of the method, we experiment its performance using other methods, and executes the quality evaluation with PSNR between the images not coding an ROI and coding it.

• Journal of the HCI Society of Korea
• /
• v.2 no.1
• /
• pp.1-12
• /
• 2007

In this paper, we propose a video service system that reflects user interaction in the multimedia contents to increase user satisfaction in the restricted content consumption environment. The proposed system is based on the multiple ROI(Region of Interest) coding in H.264/AVC Scalable Video Coding (SVC). The proposed system provides scalable video quality by adopting SVC. And by bidirectional communication between user and video server, it enables user to select meaningful ROI among multiple ROIs by user interaction. To verify the usefulness of the proposed system, we demonstrate it with a test-bed on which user interactive ROIs are implemented.

• The KIPS Transactions:PartB
• /
• v.14B no.5
• /
• pp.321-328
• /
• 2007

In this paper, we propose a fast and dynamic Region-of-Interest coding method using the adaptive code-block discrimination algorithm in JPEG2000 images which complements the implicit ROI coding method and the modified implicit ROI coding method. For reducing the time of discriminating the code block, the proposed method estimates the characteristics of the shape of ROI and makes the shape of boundaries, and classifies the patterns of each code block. The method improves the preferred processing and loss of wavelet coefficients of background within the ROI code blocks by adaptively classifying the code blocks with the percentage of content of the wavelet coefficients using the thresholds of ROI and background. Also, the priority control of wavelet coefficients of background within ROI code block supports the rapid ROI coding by processing in batch based on patterns unlike the existing methods that process with unit of wavelet coefficients. To show the usefulness of this method, we compared this to the existing methods. There is no difference in performance, but we confirmed very speedy in processing time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2C
• /
• pp.324-332
• /
• 2004

In image communications related to web browsing, image database, and telemedicine, image data processing on the region of interest (ROI) for providing the primary information is needed in the view of saying search time and bandwidth. In this paper, an enhanced algorithm for processing image data that involves multiple ROIs is presented in order to increase PSNR vs. compression ratio performance above the previous JPEG2000 Part1 Maxshift method. Since the wavelet transform enables us to a progressive transmission mechanism, Multiple-ROI coding is possible to compress, transmit, and reconstruct the image data with a better quality than those of non-ROI method while the required transmission bandwidth is kept relatively low.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.39-47
• /
• 2007

In this thesis, a method of generating an adaptable Region-Of-Interest(ROI) Mask for the Region-Of-Interest coding is suggested. In the method, an ROI Mask is generated using the information of the ROI designated by a user. In the existed method of ROI coding, after scanning all the pixels in order and discriminating an ROI, an ROI Mask is generated. But, in our method, after scanning a part of pixels based on the shape pattern of an ROI and discriminating a ROI by one code block unit, an ROI Mask is generated. Moreover, from the method, a pattern number, threshold of a ROI and background threshold parameter are provided. According to the result of its comparing test with the existed methods to show the usability, it is proved that our method is superior in speed to the existed ones.

• Journal of Korea Multimedia Society
• /
• v.11 no.1
• /
• pp.13-22
• /
• 2008

This paper proposes an efficient ROI code block discrimination algorithm for dynamic ROI coding. The proposed algorithm calculates the girth of the ROI only with some mask information in consideration of the characteristics of the shape of the ROI for reducing a ROI code block discrimination time, and this proposed algorithm discriminates whether there is a ROI code block by the girth and the critical value of the ROI. Also, this discrimination algorithm is capable of treating the coefficients of the background within a ROI code block preferentially and controlling a loss by controlling the threshold value of the ROI. In order to demonstrate the utility of the proposed method, this paper conducted a comparative experiment of the proposed method with the existing methods. As a result of this experiment, it was confirmed that the proposed method was superior to the conventional methods in terms of quality and speed.

• Journal of Electrical Engineering and information Science
• /
• v.3 no.2
• /
• pp.222-229
• /
• 1998

In the circumstances we want to deal with, a transmission channel is limited and a global motion can happen by camera movement, and also there exists a region-of-interest(ROI) which is more important than background. So very low bit rate coding algorithm is required and processing of global motion must be considered. Also ROI must be reconstructed with required quality after decoding because of its importance. But the existing methods such as H.261, H.263 can not reconstruct ROIs with high quality because they do not consider the fact that ROIs are more important than background. So a new coding scheme is proposed that describes a method for encoding image sequences distinguishing bits between ROI and background. Experimental results show that the suggested algorithm performs well especially in the circumstances where background changes and the area of ROI is small enough compared with that of background.

• The KIPS Transactions:PartB
• /
• v.18B no.6
• /
• pp.349-354
• /
• 2011

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.

• The KIPS Transactions:PartB
• /
• v.17B no.6
• /
• pp.421-428
• /
• 2010

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.

• Journal of Broadcast Engineering
• /
• v.11 no.1 s.30
• /
• pp.54-65
• /
• 2006

In this paper, we propose a new functionality to Scalable Video Coding (SVC), which is the support of multiple ROIs for heterogeneous display resolution. Scalable video coding is targeted at giving temporal, spatial, and quality scalability for the encoded bit stream. Region of interest (ROI) is an area that is semantically important to a particular user, especially users with heterogeneous display resolutions. The bitstream containing the ROIs could to be extracted without any transcoding operations, which may be one of way to satisfy QoS. To define multiple ROI in SVC, we adapted FMO, a tool defined in H.264, and based on it, we propose a way to encode and decode ROIs. The proposed method is implemented on the JSVM1.0 and the functionality is verified using it.