• Journal of Broadcast Engineering
• /
• v.14 no.5
• /
• pp.551-560
• /
• 2009

This paper proposes a method for efficient lossless depth map coding for MPEG 3D-Video coding. In general, the conventional video coding method such as H.264 has been used for depth map coding. However, the conventional video coding methods do not consider the image characteristics of the depth map. Therefore, as a lossless depth map coding method, this paper proposes a bit-plane based lossless depth mar coding method by using the MPEG-4 Part 2 shape coding scheme. Simulation results show that the proposed method achieves the compression ratios of 28.91:1. In intra-only coding, proposed method reduces the bitrate by 24.84% in comparison with the JPEG-LS scheme, by 39.35% in comparison with the JPEG-2000 scheme, by 30.30% in comparison with the H.264(CAVLC mode) scheme, and by 16.65% in comparison with the H.264(CABAC mode) scheme. In addition, in intra and inter coding the proposed method reduces the bitrate by 36.22% in comparison with the H.264(CAVLC mode) scheme, and by 23.71% in comparison with the 0.264(CABAC mode) scheme.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.24 no.5
• /
• pp.379-387
• /
• 2006

The real world is spatially modelled conceptually either as discrete objects or earth surface. The generated data models are then usually represented as vector and raster respectively. Although there are limited cases where only one data model is sufficient to solve the spatial problem at hand, it is now generally accepted that GIS should be able to handle various types of data model. Recent advances in spatial technology introduced even more variety of heterogeneous data models and the need is ever growing to handle and manage efficiently these large variety of spatial data. The OGC (Open GIS Consortium), an international organization pursuing standardization in the geospatial industry. recently introduced the GMLJP2 (Geographic Mark-Up Language JP2) format which enables store and handle heterogeneous spatial data. The GMLJP2 format, which is based on the JP2 format which is an abbreviation for JPEG2000 wavelet image compression format, takes advantage of the versatility of the GML capabilities to add extra data on top of the compressed image. This study takes a close look into the GMLJP2 format to analyse and exploit its potential to handle and mange hetergeneous spatial data. Aerial image, digital map and LIDAR data were successfully transformed end archived into a single GMLJP2 file. A simple viewing program was made to view the heterogeneous spatial data from this single file.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9C
• /
• pp.697-703
• /
• 2008

The H.264/AVC video coding standard provides higher coding efnciency compared to the conventional MPEG-2 standard. Since a lot of videos have been encoded using MPEG-2, the format conversion from MPEG-2 to H.264 is essential. In this paper, we propose an efficient method for the conversion of DCT coefficients to H.264/AVC transform coefficients. This conversion is essential, since $8{\times}8$ DCT and $4{\times}4$ integer transform are used in MPEG-2 and H.264/AVC, respectively. The mathematical analysis and computer simulation show that the computational complexity of the proposed algorithm is reduced compared to the conventional algorithm, while the loss caused by the conversion is negligible.

• The Journal of the Korea Contents Association
• /
• v.17 no.5
• /
• pp.1-7
• /
• 2017

Joint Collaborative Team on Video Coding (JCT-VC) of ISO/IEC MPEG and ITU-T developed the HEVC Screen Content Coding (HEVC SCC) standard as the HEVC extension for the screen content video coding. The Intra Block Copy (IBC) is the most effective tool adopted in HEVC SCC and predicts current block from already reconstructed neighboring blocks in the same picture. To reduce the amount of data in BV (Block Vector) to be transmitted, a BV predictor (BVP) is used to generate the BV differences in the IBC BV coding. In this paper, we analyze the current BV prediction process using HEVC reference software SCM-2.0 and SCM-4.0. Based on the analysis results, we propose an improved BVP candidate selection algorithm by adding a search process for adjacent BVs in addition to the existing spatial BVP candidates. Experimental results show that the BD-rate reduction of our proposed improvements ranges from 0.2% to 1%.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2005.11a
• /
• pp.29-32
• /
• 2005

3차원 비디오는 차세대 정보 통신 서비스 분야의 하나로, 사용자에게 시각적으로 고차원적인 서비스를 제공하는 것을 목적으로 한다. 이 가운데 다시점 비디오는 같은 시간, 여러 시점에서 영상 정보를 획득하여 사용자에게 원하는 시점의 영상 정보를 제공하는 3차원 비디오이며, 현재 방송 관련 연구 기관에서 차세대 실감방송 멀티미디어 서비스 개발을 목적으로 하는 연구가 활발히 진행되고 있다. 최근 MPEG 표준화 그룹에서는 다시점 비디오 부호화 (multi-view video coding, MVC) 방법에 관한 표준화 작업이 진행 중이며, 최신 비디오 압축 표준인 H.264를 이용한 여러 가지 방법들이 제안되었다. 현재 MVC 표준화 작업의 평가 기준이 되는 방법은 각 시점을 H.264로 부호화하는 방법인데, 이는 다시점 비디오 영상의 중요한 특성인 인접시점들 사이의 공간적 상관도를 전혀 고려하지 않았다. 본 논문에서는 시점 보간법을 이용하여 얻어진 중간 영상과 원영상과의 차분 영상을 부호화하는 알고리즘을 제안하고자 한다. 여기서 시점 보간법이란 좌우 두 시점 영상으로부터 변이값을 얻은 다음, 이를 이용하여 중간 시점 영상을 합성하는 방법을 말한다. 예를 들면,다시점 비디오의 홀수 번째 시점의 영상은 기존의 방법을 따르고, 짝수 번째 시점의 영상은 이미 부호화된 홀수 번째 시점의 영상을 이용하여 보간적으로 예측하여 원래 영상과 차분 영상을 구하여 부호화한다. 차분 영상은 영상의 복잡도가 많이 감소되어 원영상에 비해 보다 나은 부호화 효율을 보인다. 그러나 합성 영상이 각 장면마다 독립적으로 생성되므로 원영상에 비해 차분 영상의 시간적인 상관도가 줄어들어 I장면의 경우 부호화 효율이 크게 향상되었으나, 시간적인 상관도를 이용하는 P장면과 B장면에서는 오히려 좋지 않은 결과를 보였다. 통계는 전 국민에 대한 패널자료이기 때문에 통계적 활용의 범위가 방대하다. 특히 개인, 가구, 사업체 등 사회 활동의 주체들이 어떻게 변화하는지를 추적할 수 있는 자료를 생산함으로써 다양한 인과적 통계분석을 할 수 있다. 행정자료를 활용한 인구센서스의 이러한 특징은 국가의 교육정책, 노동정책, 복지정책 등 다양한 정책을 정확한 자료를 근거로 수립할 수 있는 기반을 제공한다(Gaasemyr, 1999). 이와 더불어 행정자료 기반의 인구센서스는 비용이 적게 드는 장점이 있다. 예를 들어 덴마크나 핀란드에서는 조사로 자료를 생산하던 때의 1/20 정도 비용으로 행정자료로 인구센서스의 모든 자료를 생산하고 있다. 특히, 최근 모든 행정자료들이 정보통신기술에 의해 데이터베이스 형태로 바뀌고, 인터넷을 근간으로 한 컴퓨터네트워크가 발달함에 따라 각 부처별로 행정을 위해 축적한 자료를 정보통신기술로 연계${cdot}$통합하면 막대한 조사비용을 들이지 않더라도 인구센서스자료를 적은 비용으로 생산할 수 있는 근간이 마련되었다. 이렇듯 행정자료 기반의 인구센서스가 많은 장점을 가졌지만, 그렇다고 모든 국가가 당장 행정자료로 인구센서스를 대체할 수 있는 것은 아니다. 행정자료로 인구센서스통계를 생산하기 위해서는 각 행정부서별로 사용하는 행정자료들을 연계${cdot}$통합할 수 있도록 국가사회전반에 걸쳐 행정 체제가 갖추어져야 하기 때문이다. 특히 모든 국민 개개인에 관한 기본정보, 개인들이 거주하며 생활하는 단위인 개별 주거단위에 관한 정보가 행정부에 등록되어 있고, 잘 정비되어 있어야 하며, 정보의 형태 또한 서로 연계가 가능하도록 표준화되어있어야 한다. 이와 더불어, 현재 인구센서스에서 표본조사를 통해 부가적으로 생산하는 경제활동통계를 생산하기 위해서는 개인이

• Journal of Broadcast Engineering
• /
• v.12 no.6
• /
• pp.611-623
• /
• 2007

The H.264|AVC standard incorporates an intra prediction tool into inter frame coding. However, this leads to excessive amount of increase in encoding time, thus resulting in the difficulty in real-time implementation of software encoders. In this paper, we first propose an early decision on intra prediction coding and a fast intra prediction method using the characteristics of block contents and the context of neighboring block modes for the intra prediction in the inter frame coding of H.264/AVC. Basically, the proposed methods determine a skip condition on whether the $4{\times}4$ intra prediction is to be used in the inter frame coding by considering the content characteristics of each block to be encoded and the context of its neighboring blocks. The performance of our proposed methods is compared with the Joint Model reference software version 11.0 of H.264|AVC. The experimental results show that our proposed methods allow for 41.63% reduction in the total encoding time with negligible amounts of PSNR drops and bitrate increases, compared to the original Joint Model reference software version 11.0.

• Journal of Broadcast Engineering
• /
• v.22 no.1
• /
• pp.28-41
• /
• 2017

In this paper, the fast encoding algorithm in High Efficiency Video Coding (HEVC) encoder was studied. For the encoding efficiency, the current HEVC reference software is divided the input image into Coding Tree Unit (CTU). then, it should be re-divided into CU up to maximum depth in form of quad-tree for RDO (Rate-Distortion Optimization) in encoding precess. But, it is one of the reason why complexity is high in the encoding precess. In this paper, to reduce the high complexity in the encoding process, it proposed the method by determining the maximum depth of the CU using a hierarchical clustering at the pre-processing. The hierarchical clustering results represented an average combination of motion vectors (MV) on neighboring blocks. Experimental results showed that the proposed method could achieve an average of 16% time saving with minimal BD-rate loss at 1080p video resolution. When combined the previous fast algorithm, the proposed method could achieve an average 45.13% time saving with 1.84% BD-rate loss.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.12
• /
• pp.3275-3284
• /
• 1998

In this paper, we deseribe a Medical Image Information System. Our system stores and manages 5 dimensional medical image data and provides the 3 dimensional medical data via the Internet. The Internet standard VR format. VRML(Virtual Reality Modeling Language) is used to represent the 3I) medical image data. The 3D images are reconstructed from medical image data which are enerated by medical imaging systems such ans CT(Computerized Tomography). MRI(Magnetic Resonance Imaging). PET(Positron Emission Tomograph), SPECT(Single Photon Emission Compated Tomography). We implemented the medical image information system shich rses a surface-based rendering method for the econstruction of 3D images from 2D medical image data. In order to reduce the size of image files to be transfered via the Internet. The system can reduce more than 50% for the triangles which represent the surfaces of the generated 3D medical images. When we compress the 3D image file, the size of the file can be redued more than 80%. The users can promptly retrieve 3D medical image data through the Internet and view the 3D medical images without a graphical acceleration card, because the images are represented in VRML. The image data are generated by various types of medical imaging systems such as CT, MRI, PET, and SPECT. Our system can display those different types of medical images in the 2D and the 3D formats. The patient information and the diagnostic information are also provided by the system. The system can be used to implement the "Tele medicaine" systems.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.5
• /
• pp.147-154
• /
• 2015

In this paper, we employed a model which defines the sensitivity according to the background luminance, so called JND (Just Noticeable Difference), and applied to the video coding. The proposed method finds out the maximum possible quantization parameter for the current unit based on the threshold of JND model and reduce the bitrate with similar perceptual quality. It selects the higher quantization parameter and reduce the bitrate when the reconstructed signal which is coded with higher quantization parameter is in a range of allowance based on the JND threshold, i.e. the signal has the similar perceptual quality compared to that is coded with the initial quantization parameter. The proposed algorithm was implemented on HM16.0, which is a reference software of the latest video coding standard HEVC (High Efficiency Video Coding) and the coding performance was evaluated. Compared to HM16.0, the proposed algorithm achieved maximum 20.21% and 6.18% of average bitrate reduction with the similar perceptual quality.

• 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.