• Title/Summary/Keyword: 3D 볼륨 데이터 압축

Search Result 8, Processing Time 0.04 seconds

Compression and Visualization Techniques for Time-Varying Volume Data (시변 볼륨 데이터의 압축과 가시화 기법)

  • Sohn, Bong-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.3
    • /
    • pp.85-93
    • /
    • 2007
  • This paper describes a compression scheme for volumetric video data(3D space X 1D time) there each frame of the volume is decompressed and rendered in real-time. Since even one frame size of volume is very large, runtime decompression can be a bottleneck for real-time playback of time-varying volume data. To increase the run-time decompression speed and compression ratio, we decompose the volume into small blocks and only update significantly changing blocks. The results show that our compression scheme compromises decompression speed and image quality well enough for interactive time-varying visualization.

  • PDF

Volumetric Data Encoding Using Daubechies Wavelet Filter (Daubechies 웨이블릿 필터를 사용한 볼륨 데이터 인코딩)

  • Hur, Young-Ju;Park, Sang-Hun
    • The KIPS Transactions:PartA
    • /
    • v.13A no.7 s.104
    • /
    • pp.639-646
    • /
    • 2006
  • Data compression technologies enable us to store and transfer large amount of data efficiently, and become more and more important due to increasing data size and the network traffic. Moreover, as a result of the increase of computing power, volumetric data produced from various applied science and engineering fields has been getting much larger. In this Paper, we present a volume compression scheme which exploits Daubeches wavelet transform. The proposed scheme basically supports lossy compression for 3D volume data, and provides unit-wise random accessibility. Since our scheme shows far lower error rates than the previous compression methods based on Haar filter, it could be used well for interactive visualization applications as well as large volume data compression requiring image fidelity.

Development of Wavelet-Based 3D Compression Scheme and Navigation System for Interactive Visualization of Very Large Volume Data (방대한 볼륨 데이터의 인터렉티브 가시화를 위한 웨이블릿 기반 3차원 압축 기법과 네비게이션 시스템의 개발)

  • 박상훈
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1998.10a
    • /
    • pp.114-119
    • /
    • 1998
  • 방대한 볼륨 데이터의 가시화는 상당히 많은 계산 비용과 메모리 공간을 필요로 하는 작업이다. 본 논문에서는 방대한 볼륨 데이터를 효과적으로 압축할 수 있는 웨이블릿에 기반을 둔 3차원적인 압축 기법을 제안하고, 이 기법으로 압축된 데이터를 인터렉티브하게 가시화할 수 있는 네비게이션 시스템의 구현에 대해 설명한다. 본 압축 기법은 방대한 볼륨 데이터를 효과적으로 압축함으로써, 64∼128MByte 정도의 제한된 메인 메모리를 갖는 목표로 한다. 따라서, 개발된 압축 스킴은 데이터 전체에 대한 복원없이 가시화가 필요한 부분의 데이터만을 빠르게 복원할 수 있는 랜덤 액세스가 가능하도록 설계되었으며, 적은 계산 비용으로 복원이 가능하다는 장점을 갖는다. 개발된 네비게이션 시스템은 가시화 속도 향상을 위한 여러 가지 효과적인 렌더링 모듈과 사용자 인터페이스 모듈로 구성되며, 현재 성능 향상을 위한 연구가 계속 진행되고 있다.

  • PDF

Efficient Visualization Method for Large Volume Dataset using 3D Texture Mapping and Texture Coordinate Tweaking (3차원 텍스쳐 맵핑 및 텍스쳐 좌표 조작을 통한 대용량 볼륨 데이터의 효과적인 가시화 기법)

  • 이중연
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.10b
    • /
    • pp.652-654
    • /
    • 2004
  • PC 그래픽스 하드웨어의 급격한 발전에 따라 과거 슈퍼컴퓨터 급에서나 가능하였던 대용량 데이터의 볼륨 렌더링을 일반 PC에서 수행하려는 시도가 계속되고 있다. 특히, PC 그래픽스 하드웨어의 꼭지점 및 픽셀 쉐이더는 기존의 고정된 그래픽스 파이프라인에서 벗어나 사용자가 렌더링 과정에 개입하여 프로그래밍을 할 수 있도록 하여 많은 각광을 받고 있다. 그러나 그래픽스 하드웨어의 텍스쳐 메모리의 크기보다 큰 볼륨 데이터의 가시화는 아직까지 충분히 빠르지 못하며 텍스쳐의 압축으로 인하여 영상 품질도 좋지 못하다. 본 논문에서는 이러한 그래픽스 하드웨어의 프로그래밍 기능 중 꼭지점 좌표 및 텍스쳐 좌프의 조작, 그리고 픽셀 쉐이더를 통한 퐁 쉐이딩 연산을 이용하여 그래픽스 하드웨어의 메모리 크기보다 큰 대용량 볼륨 데이터를 고품질로 가시화하였다.

  • PDF

Volume Data Modeling by Using Wavelets Transformation and Tetrahedrization (웨이브렛 변환과 사면체 분할을 이용한 볼륨 데이터 모델링)

  • Gwun, Ou-Bong;Lee, Kun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.4
    • /
    • pp.1081-1089
    • /
    • 1999
  • Volume data modeling is concerned with finding a mathematical function which represents the relationship implied by the 3D data. Modeling a volume data geometrically can visualize a volume data using surface graphics without voxelization. It has many merits in that it is fast and requires little memory. We proposes, a method based on wavelet transformation and tetrahedrization. we implement a prototype system based on the proposed method. Last, we evaluated the proposed method comparing it with marching cube algorithm. the evaluation results show that though the proposed method uses only 13% of the volume data, the images generated is as good as the images generated by the marching cubes algorithm.

  • PDF

3-D Subband Filter Banks for Lossless Compression of Volumetric Images (무 손실 볼륨 영상 데이터 압축을 위한 3차원 대역분할 필터 군)

  • 홍승표;정호열;최태영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.4B
    • /
    • pp.715-724
    • /
    • 2000
  • This Paper presents 3-D subband filter banks which are effective for progressive and lossless compression of volumetric images. For such a purpose, ORT(Overlapping Rounding Transform), applied so far to 1-D losslesssubband filter banks, is now used to implement two types of 3-D lossless subband filter banks: separable andnon-separable types. Separable fiter banks are implemented form applying 1-D lossless filter banks consecutively.Non-separable later banks are developed by expanding the 1-D ORT into 3-D one. In particular, the proposed ORT based 3-D non-separable filter banks generalizes the 3-D HINT(Hierarchical INTerpolation) algorithm.Through the experiment comparisons on various volumetric medical images, we prove that the proposedseparablefnon-separable filter banks perform better, in terms of compression ratio (first order entropy), than theother lossless compression techniques such as block based transform and conventional 3-D HINT.

  • PDF

Iso-density Surface Reconstruction using Hierarchical Shrink-Wrapping Algorithm (계층적 Shrink-Wrapping 알고리즘을 이용한 등밀도면의 재구성)

  • Choi, Young-Kyu;Park, Eun-Jin
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.6
    • /
    • pp.511-520
    • /
    • 2009
  • In this paper, we present a new iso-density surface reconstruction scheme based on a hierarchy on the input volume data and the output mesh data. From the input volume data, we construct a hierarchy of volumes, called a volume pyramid, based on a 3D dilation filter. After constructing the volume pyramid, we extract a coarse base mesh from the coarsest resolution of the pyramid with the Cell-boundary representation scheme. We iteratively fit this mesh to the iso-points extracted from the volume data under O(3)-adjacency constraint. For the surface fitting, the shrinking process and the smoothing process are adopted as in the SWIS (Shrink-wrapped isosurface) algorithm[6], and we subdivide the mesh to be able to reconstruct fine detail of the isosurface. The advantage of our method is that it generates a mesh which can be utilized by several multiresolution algorithms such as compression and progressive transmission.

Compression of time-varying volume data using Daubechies D4 filter (Daubechies D4 필터를 사용한 시간가변(time-varying) 볼륨 데이터의 압축)

  • Hur, Young-Ju;Lee, Joong-Youn;Koo, Gee-Bum
    • 한국HCI학회:학술대회논문집
    • /
    • 2007.02a
    • /
    • pp.982-987
    • /
    • 2007
  • The necessity of data compression scheme for volume data has been increased because of the increase of data capacity and the amount of network uses. Now we have various kinds of compression schemes, and we can choose one of them depending on the data types, application fields, the preferences, etc. However, the capacity of data which is produced by application scientists has been excessively increased, and the format of most scientific data is 3D volume. For 2D image or 3D moving pictures, many kinds of standards are established and widely used, but for 3D volume data, specially time-varying volume data, it is very difficult to find any applicable compression schemes. In this paper, we present a compression scheme for encoding time-varying volume data. This scheme is aimed to encoding time-varying volume data for visualization. This scheme uses MPEG's I- and P-frame concept for raising compression ratio. Also, it transforms volume data using Daubechies D4 filter before encoding, so that the image quality is better than other wavelet-based compression schemes. This encoding scheme encodes time-varying volume data composed of single precision floating-point data. In addition, this scheme provides the random reconstruction accessibility for an unit, and can be used for compressing large time-varying volume data using correlation between frames while preserving image qualities.

  • PDF