• Title/Summary/Keyword: ROI 코딩

Search Result 24, Processing Time 0.027 seconds

Performance Evaluation of Parameters for applying an Adequate ROI coding method in JPEG2000 Applications (JPEG2000 음용에서 적절한 ROI 코딩 방법을 적용하기 위한 매개변수의 성능 평가)

  • Kang Ki-Jun;Lee Bu-Kwon;Seo Yeong-Geon
    • The KIPS Transactions:PartB
    • /
    • v.13B no.3 s.106
    • /
    • pp.301-308
    • /
    • 2006
  • Currently, the preferred processing of a user-centered ROI(Region-of-Interest) or a specific region of image than the transmission and decompression of a full image is needed in different applications. This preferred processing has been actively studied about from the ROI coding methods in JPEG2000 standards to the new methods complementing them. But, there does not exist an ROI coding method suitable for all applications. Therefore, this study shows a criterion of selection according to the application requirements for applying an adequate ROI coding method in JPEG2000 applications, and shows the experimental results deciding efficient parameters in the selected methods.

An Adaptive Region-of-Interest Coding Based on EBCOT (EBCOT 기반의 적응적 관심영역 코딩)

  • Kang, Ki-Jun;Lee, Bu-Kwon;Seo, Yeong-Geon
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.11
    • /
    • pp.1445-1454
    • /
    • 2006
  • To compress a specific part of an image with high quality or to transfer it, JPEG2000 standard offers an ROI(Region-of-Interest) image coding method. What is important in ROI coding is to process relative importance between ROI and background and to process ROI mask. We propose an adaptive ROI coding method supplemented the existing Implicit ROI coding and Modified implicit ROI coding to improve image quality and reduce ROI mask information. The proposed method is an EBCOT-based ROI coding that extracts ROI from the compressed bitstream, and gets the ROI mask information by classifying the codeblocks into 6 patterns. The information includes the pattern type(3bit) and the width(5bit) expressing the boundary between two regions for each codeblock. As a result, the method shows an excellent compression performance in ROI region as well as in the whole region of an image.

  • PDF

Correlation of ROI Coding Parameters and ROI Coding Methods in JPEG2000 (JPEG2000에서 ROI 코딩 파라미터와 ROI 코딩 방법의 상관관계)

  • Kim, Ho-Yong;Kim, Hyung-Jun;Seo, Yeong-Geon
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.10
    • /
    • pp.143-152
    • /
    • 2006
  • JPEG2000, the standard of still image compression based on wavelet, will be widely used. One of the greatest characteristics of JPEG2000 is to offer ROI(Region-Of-Interest) coding. This is to compress with high quality the region that the user wants better than the other region. JPEG2000 and ROI have different parameters, which are tile size and ROI size, wavelet filter type and ROI shape and its location, codeblock size and number of ROI, number of DWT decomposition level and ROI importance, and number of quality layer and low resolution sub-band importance. In this paper, we shows the correlation of the parameters and ROI coding methods through experiments. This helps an application select the parameters and the methods to meet the application.

  • PDF

A Performance Evaluation of Factors Influencing the ROI Coding Quality in JPEG2000 (JPEG2000에서 ROI 코딩 품질에 영향을 미치는 요소의 성능 평가)

  • Ki Jun-Kang;Kim Hyun-Joo;Lee Jum-Sook
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.4 s.42
    • /
    • pp.197-206
    • /
    • 2006
  • One of the most significant characteristics of JPEG2000. the emerging still image standards. is the ROI (Region of Interest) coding. JPEG2000 provides a number of ROI coding mechanisms and ROI parameters. To apply them to an application, it must select the applicable values. In this paper, we evaluate how the ROI coding mechanisms and the ROI parameters influencing JPEG2000 qualify affect the ROI quality and the whole image quality. The ROI coding mechanisms are Maxshift and Implicit. and the parameters are tile size and ROI size, codeblock size, number of DWT decomposition levels and ROI importance. The bigger the tile size, the better the quality. The bigger the ROI size, the ROI importance and the number of DWT decomposition levels, the worse the qualify. In code block $32{\times}32$ of Maxshift and Implicit, it has the best qualify.

  • PDF

A Generation of ROI Mask and An Automatic Extraction of ROI Using Edge Distribution of JPEG2000 Image (JPEG2000 이미지의 에지 분포를 이용한 ROI 마스크 생성과 자동 관심영역 추출)

  • Seo, Yeong Geon;Kim, Hee Min;Kim, Sang Bok
    • 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.

A Fast and Dynamic Region-of-Interest Coding Method using the Adaptive Code-Block Discrimination Algorithm in JPEG2000 Images (JPEG2000 이미지에서 적응적 코드블록 판별 알고리즘을 이용한 동적 고속 관심영역 코딩 방법)

  • Kang, Ki-Jun;Seo, Yeong-Geon;Park, Jae-Heung;Yoo, Chang-Yeul;Park, Soon-Hwa;Lee, Jum-Suk;Lee, Bu-Kwon
    • 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.

A Technique Getting Fast Masks Using Rough Division in Dynamic ROI Coding of JPEG2000 (JPEG2000의 동적 ROI 코딩에서 개략적인 분할을 이용한 빠른 마스크 생성 기법)

  • Park, Jae-Heung;Lee, Jum-Sook;Seo, Yeong-Geon;Hong, Do-Soon;Kim, Hyun-Joo
    • 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.

Fast Dynamic ROI Coding using the Mask Patterns in JPEG2000 (JPEG2000에서 마스크 패턴을 이용한 빠른 동적 ROI 코딩)

  • Kang, Juong-Hyon;Seo, Yeong-Geon
    • 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.

A Slope Information Based Fast Mask Generation Technique for ROI Coding (관심영역 코딩을 위한 기울기 정보 기반의 빠른 마스크 생성 기법)

  • Park, Sun-Hwa;Seo, Yeong-Geon;Lee, Bu-Kweon;Kang, Ki-Jun;Kim, Ho-Yong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.1
    • /
    • pp.81-89
    • /
    • 2009
  • To support dynamic Region-of-Interest(ROI) in JPEG2000, a fast ROI mask generation is needed. In the existing methods of ROI coding, after scanning all the pixels in order and discriminating ROI, an ROI mask has been generated. Our method scans 4 pixels of the corners in one code block, and then based on those informations, scans the edges from the corners to get the boundaries of ROI and background. These informations are consisted of a distributed information of ROI and two coordinates of the pixels, which are the points the edges and the boundaries meet. These informations are transmitted to encoder and supported for fast ROI mask generation. There were no great differences between the proposed method and the existing methods in quality, but the proposed method showed superiority in speed.

An Eefficient ROI Code Block Discrimination Algorithm for Dynamic ROI Coding (동적 관심영역 코딩을 위한 효율적인 관심영역 코드블록 판별 알고리듬)

  • Kang, Ki-Jun;Ahn, Byeong-Tae
    • 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.

  • PDF