• Title/Summary/Keyword: 3D data coding

Search Result 105, Processing Time 0.02 seconds

Coding Technique using Depth Map in 3D Scalable Video Codec (확장된 스케일러블 비디오 코덱에서 깊이 영상 정보를 활용한 부호화 기법)

  • Lee, Jae-Yung;Lee, Min-Ho;Chae, Jin-Kee;Kim, Jae-Gon;Han, Jong-Ki
    • Journal of Broadcast Engineering
    • /
    • v.21 no.2
    • /
    • pp.237-251
    • /
    • 2016
  • The conventional 3D-HEVC uses the depth data of the other view instead of that of the current view because the texture data has to be encoded before the corresponding depth data of the current view has been encoded, where the depth data of the other view is used as the predicted depth for the current view. Whereas the conventional 3D-HEVC has no other candidate for the predicted depth information except for that of the other view, the scalable 3D-HEVC utilizes the depth data of the lower spatial layer whose view ID is equal to that of the current picture. The depth data of the lower spatial layer is up-scaled to the resolution of the current picture, and then the enlarged depth data is used as the predicted depth information. Because the quality of the enlarged depth is much higher than that of the depth of the other view, the proposed scheme increases the coding efficiency of the scalable 3D-HEVC codec. Computer simulation results show that the scalable 3D-HEVC is useful and the proposed scheme to use the enlarged depth data for the current picture provides the significant coding gain.

Multiple Description Coding of 3-D Data (3차원 데이터의 다중 부호화 기법)

  • Park, Sung-Bum;Kim, Chang-Su;Lee, Sang-Uk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.9C
    • /
    • pp.840-848
    • /
    • 2007
  • A multiple description coding (MDC) scheme for 3-D Data is presented. First, a plane-based 3-D data is split into two descriptions, each of which has identical contribution in 3-D surface reconstruction. In order to maximize the visual quality of reconstructed 3-D data, then, plane parameters are modified according to channel error condition. Finally, these descriptions are compressed and transmitted over distinct channels. In decoder, if two descriptions are available, we reconstruct a high quality 3-D data. If only one description is transmitted, however, 3-D surface recovery scheme reduces artifacts on erroneous 3-D surface, yielding a smooth 3-D surface. Therefore, the proposed algorithm guarantees acceptable quality reconstruction of 3-D data even though one channel is totally lost.

On the Adaptive 3-dimensional Transform Coding Technique Employing the Variable Length Coding Scheme (가변 길이 부호화를 이용한 적응 3차원 변환 부호화 기법)

  • 김종원;이신호;이상욱
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.30B no.7
    • /
    • pp.70-82
    • /
    • 1993
  • In this paper, employing the 3-dimensional discrete cosine transform (DCT) for the utilization of the temporal correlation, an adaptive motion sequence coding technique is proposed. The energy distribution in a 3-D DCT block, due to the nonstationary nature of the image data, varies along the veritical, horizontal and temporal directions. Thus, aiming an adaptive system to local variations, adaptive procedures, such as the 3-D classification, the classified linear scanning technique and the VLC table selection scheme, have been implemented in our approach. Also, a hybrid structure which adaptively combines inter-frame coding is presented, and it is found that the adaptive hybrid frame coding technique shows a significant performance gain for a moving sequence which contains a relatively small moving area. Through an intensive computer simulation, it is demonstrated that, the performance of the proposed 3-D transform coding technique shows a close relation with the temporal variation of the sequence to be code. And the proposed technique has the advantages of skipping the computationally complex motion compensation procedure and improving the performance over the 2-D motion compensated transform coding technique for rates in the range of 0.5 ~ 1.0 bpp.

  • PDF

Adaptive Block-based Depth-map Coding Method (적응적 블록기반 깊이정보 맵 부호화 방법)

  • Kim, Kyung-Yong;Park, Gwang-Hoon;Suh, Doug-Young
    • Journal of Broadcast Engineering
    • /
    • v.14 no.5
    • /
    • pp.601-615
    • /
    • 2009
  • This paper proposes an efficient depth-map coding method for generating virtual-view images in 3D-Video. Virtual-view images can be generated by the view-interpolation based on the depth-map of the image. A conventional video coding method such as H.264 has been used. However, a conventional video coding method does not consider the image characteristics of the depth-map. Therefore, this paper proposes an adaptive depth-map coding method that can select between the H.264/AVC coding scheme and the proposed gray-coded bit plane-based coding scheme in a unit of block. This improves the coding efficiency of the depth-map data. Simulation results show that the proposed method, in comparison with the H.264/AVC coding scheme, improves the average BD-rate savings by 7.43% and the average BD-PSNR gains by 0.5dB. It also improves the subjective picture quality of synthesized virtual-view images using decoded depth-maps.

A Connectivity Encoding of 3D Meshes for Mobile Systems (모바일 시스템을 위한 연결 데이터 압축 알고리즘)

  • Kim, Dae-Young;Lee, Sung-Yeol;Lee, Hae-Young
    • Journal of the Korea Computer Graphics Society
    • /
    • v.14 no.1
    • /
    • pp.27-33
    • /
    • 2008
  • Mobile systems have relatively limited resources such as low memory, slow CPU, or low power comparing to desktop systems. In this paper, we present a new 3D mesh connectivity coding algorithm especially optimized for mobile systems(i.e., mobile phones). By using adaptive octree data structure for vertex positions, a new distance-based connectivity coding is proposed. Our algorithm uses fixed point arithmetic and minimizes dynamic memory allocation, appropriate for mobile systems. We also demonstrate test data to show the utility of our mobile 3D mesh codec.

  • PDF

A H.264 based Selective Fine Granular Scalable Coding Scheme (H.264 기반 선택적인 미세입자 스케일러블 코딩 방법)

  • 박광훈;유원혁;김규헌
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.4
    • /
    • pp.309-318
    • /
    • 2004
  • This paper proposes the H.264-based selective fine granular scalable (FGS) coding scheme that selectively uses the temporal prediction data in the enhancement layer. The base layer of the proposed scheme is basically coded by the H.264 (MPEG-4 Part 10 AVC) visual coding scheme that is the state-of-art in codig efficiency. The enhancement layer is basically coded by the same bitplane-based algorithm of the MPEG-4 (Part 2) fine granular scalable coding scheme. In this paper, we introduce a new algorithm that uses the temproal prediction mechanism inside the enhancement layer and the effective selection mechanism to decide whether the temporally-predicted data would be sent to the decoder or not. Whenever applying the temporal prediction inside the enhancement layer, the temporal redundancies may be effectively reduced, however the drift problem would be severly occurred especially at the low bitrate transmission, due to the mismatch bewteen the encoder's and decoder's reference frame images. Proposed algorithm selectively uses the temporal-prediction data inside the enhancement layer only in case those data could siginificantly reduce the temporal redundancies, to minimize the drift error and thus to improve the overall coding efficiency. Simulation results, based on several test image sequences, show that the proposed scheme has 1∼3 dB higher coding efficiency than the H.264-based FGS coding scheme, even 3∼5 dB higher coding efficiency than the MPEG-4 FGS international standard.

Transformations and Their Analysis from a RGBD Image to Elemental Image Array for 3D Integral Imaging and Coding

  • Yoo, Hoon
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.5
    • /
    • pp.2273-2286
    • /
    • 2018
  • This paper describes transformations between elemental image arrays and a RGBD image for three-dimensional integral imaging and transmitting systems. Two transformations are introduced and analyzed in the proposed method. Normally, a RGBD image is utilized in efficient 3D data transmission although 3D imaging and display is restricted. Thus, a pixel-to-pixel mapping is required to obtain an elemental image array from a RGBD image. However, transformations and their analysis have little attention in computational integral imaging and transmission. Thus, in this paper, we introduce two different mapping methods that are called as the forward and backward mapping methods. Also, two mappings are analyzed and compared in terms of complexity and visual quality. In addition, a special condition, named as the hole-free condition in this paper, is proposed to understand the methods analytically. To verify our analysis, we carry out experiments for test images and the results indicate that the proposed methods and their analysis work in terms of the computational cost and visual quality.

JPEG Pleno: Providing representation interoperability for holographic applications and devices

  • Schelkens, Peter;Ebrahimi, Touradj;Gilles, Antonin;Gioia, Patrick;Oh, Kwan-Jung;Pereira, Fernando;Perra, Cristian;Pinheiro, Antonio M.G.
    • ETRI Journal
    • /
    • v.41 no.1
    • /
    • pp.93-108
    • /
    • 2019
  • Guaranteeing interoperability between devices and applications is the core role of standards organizations. Since its first JPEG standard in 1992, the Joint Photographic Experts Group (JPEG) has published several image coding standards that have been successful in a plethora of imaging markets. Recently, these markets have become subject to potentially disruptive innovations owing to the rise of new imaging modalities such as light fields, point clouds, and holography. These so-called plenoptic modalities hold the promise of facilitating a more efficient and complete representation of 3D scenes when compared to classic 2D modalities. However, due to the heterogeneity of plenoptic products that will hit the market, serious interoperability concerns have arisen. In this paper, we particularly focus on the holographic modality and outline how the JPEG committee has addressed these tremendous challenges. We discuss the main use cases and provide a preliminary list of requirements. In addition, based on the discussion of real-valued and complex data representations, we elaborate on potential coding technologies that range from approaches utilizing classical 2D coding technologies to holographic content-aware coding solutions. Finally, we address the problem of visual quality assessment of holographic data covering both visual quality metrics and subjective assessment methodologies.

Analysis of Articles published in the Korean Journal of Thoracic and Cardiovascular Surgery - Use of personal computer in storage and inquiry of article data - (대한 흉부외과학회지에 발표된 논문의 분석 고찰 - 개인용 콤퓨터를 이용한 논문자료의 저장과 조회의 실례 -)

  • Kim, Eung-Jung;Lee, Jeong-Ryeol;Na, Myeong-Hun
    • Journal of Chest Surgery
    • /
    • v.23 no.3
    • /
    • pp.423-429
    • /
    • 1990
  • Authors designed a computer-based article data management system using a 16 bit IBM personal computer and dBASE IV program and applied it to the management of article data of the Korean Journal of Thoracic and Cardiovascular Surgery. In this system, authors developed a coding system for systemic classification of form and subject of articles and this coding system made the storage and inquiry of data easy and convenient. Using the coding system in this article management system, total 1476 sheets of articles in the Korean Journal of Thoracic and Cardiovascular Surgery were analyzed and briefly described according to their forms and subjects. If this article data management system including the coding system is applied to other Journals related to the department of thoracic and cardiovascular surgery, we can utilize them easily and conveniently for the save of time and effort in the data inquiry or article preparation.

  • PDF

New Line Coding of Visible Light Communication System for WPAN (WPAN용 가시광 통신 시스템의 새로운 라인코딩)

  • Kim, Jin-Young;Choi, Jae-Hyuck;Sang, Cha-Jae
    • Journal of Broadcast Engineering
    • /
    • v.14 no.1
    • /
    • pp.70-80
    • /
    • 2009
  • We propose an ideal line coding for high speed data communication in visible light communication system. B4-HBT line coding is defined as follow. The 1 bit is +V at first though 1 encodes +Voltage and -Voltage doing change of shift each other, then -V newly. V that is been mutually contradictory for 1 bit that exist before that if continuous 0 bits exist 4 here same and reduces mistake because has reverse mark V in 4 continuous last 0 bits and gives half bit variation in 1 bit and made effect of noise low. 2${\sim}$3 dB profit is seen comparing with line coding that exist in simulation result.