• Title/Summary/Keyword: 데이터 압축

Search Result 1,714, Processing Time 0.033 seconds

Vector Data Compression Method using K-means Clustering (K평균 군집화를 이용한 벡터 데이터 압축 방법)

  • Lee, Dong-Heon;Chun, Woo-Je;Park, Soo-Hong
    • Journal of Korea Spatial Information System Society
    • /
    • v.7 no.3 s.15
    • /
    • pp.45-53
    • /
    • 2005
  • Nowadays, using the mobile communication devices, such as a mobile phone, PDA, telematics device, and so forth, are increasing. The large parts of the services with these mobile devices are the position tracking and the route planning. For offering these services, it is increasing the use of the spatial data on the mobile environment. Although the storage of mobile device expands more than before, it still lacks the necessary storage on the spatial data. In this paper, lossy compression technique on the spatial data is suggested, and then it is analyzed the compression ratio and the amount of loss data by the test. Suggested compression technique on the spatial data at this paper is applied to the real-data, and others methods, suggested at the previous studies, is applied to same data. According as the results from both are compared and analyzed, compression technique suggested at this study shows better performance when the compression result is demanded the high position accuracy.

  • PDF

A Bitmap Index for Multi-Dimensional Data Analysis (다차원 데이터 분석을 위한 비트맵 인덱스)

  • Im, Yoon-Sun;Park, Young-Sun;Kim, Myung
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10c
    • /
    • pp.298-300
    • /
    • 2002
  • 다차원 데이터를 배열에 저장하는 Multidimensional OLAP (MOLAP) 시스템은 배열내의 위치 정보를 통해 데이터를 신속하게 엑세스할 수 있는 장점을 갖는다. 그러나 실생활의 다차원 데이터는 대체로 희박하여 저장될 때 압축되고, 데이터가 검색될 때는 원래의 위치 정보를 찾기 위해 인덱스를 필요로 하게 된다. 다양한 종류의 다차원 인덱스가 테이블 형태의 데이터를 대상으로 개발되어 있으나, 이들은 데이터의 삽입과 삭제에 유연하게 대처할 수 있도록 하기 위해서 인덱스 공간과 데이터 검색 시간에 약간의 낭비를 초래한다. 본 연구에서는 OLAP 데이터가 주기적으로 갱신되며, 분석에 필요한 집계 데이터도 점진적으로 갱신되기보다 실제로는 새로 생성되고 있다는 점을 고려하여, 읽기 전용 MOLAP 데이터를 위한 인덱스 구조를 제안한다. 데이터는 청크들로 나뉜 후 압축 저장되며, 각 청크는 위치 정보를 유지하면서 비트로 표현되어 인덱스에 저장되도록 하였다. 제안한 비트맵 인덱스는 높은 압축률을 보이며, 범위 질의(range query)를 포함한 OLAP 주요 연산들 처리에 특히 효율적이다.

  • PDF

ISOBMFF encapsulation experiment based on the V3C bitstream (V3C 비트스트림 기반 ISOBMFF 캡슐화 실험)

  • Nam, Kwijung;Kim, Junsik;Kim, Kyuheon
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2021.06a
    • /
    • pp.154-156
    • /
    • 2021
  • 최근 3차원 영상이 다양한 분야에서 활용되고 있으며, 이에 따라 3차원 영상에 대한 압축과 전송 방안에 대한 연구가 활발히 진행되고 있다. 국제 표준화 기구인 ISO/IEC 산하 Moving Picture Expert Group(MPEG)에서는 기존의 2차원 비디오 코덱을 이용하여 고밀도 포인트 클라우드 압축하는 방안인 V-PCC와 3DoF+ 영상을 압축하기 위한 방안인 MPEG Immersive Video(MIV)를 표준화 중에 있다. V-PCC와 MIV는 압축 방법의 유사성으로 인해 동일한 Volumetric Visual Video-based Coding(V3C) 형식으로 저장된다. 압축된 V3C 데이터를 효과적으로 저장하여 이용하기 위해서는 ISO based Media File Format(ISOBMFF) 캡슐화 과정이 필수적이다. 본 논문에서는 MPEG의 Carriage of V3C data 표준에 따라 V3C 데이터를 ISOBMFF로 캡슐화 실험을 진행하였으며, 실험에 대한 검증을 위하여 생성된 ISOBMFF 데이터를 V3C 데이터로 복원한 뒤, 디코딩 하여 확인하였다.

  • PDF

Design and Implementation of Spatial Data Compression Methods for Improvement of Mobile Transmission Efficiency (모바일 전송 효율 향상을 위한 공간 데이터 압축 기법의 설계 및 구현)

  • Choi Jin-Oh
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.7
    • /
    • pp.1253-1258
    • /
    • 2006
  • In the mobile vector map service environments, there are problems like as terminal resource shortage and transmission delay for the characteristics of large spatial data. For the normal mobile vector map services, some techniques are required to overcome the problems. Spatial data compression approach is one of the techniques to reduce the bandwidth and the waiting time at clients. However it also must be considered that the effect on total efficiency caused by the overhead of compression and restoration time. This thesis proposes two spatial data compression techniques. First approach is to get relative coordinates to first coordinate of each object. The other approach is to compute client coordinates before transmission. Through the implementation and experiments, proposed techniques are evaluated the compression effects and efficiency.

Compressed Parity Logging for Overcoming the small Write Problem in Redundant Disk Arrays (디스크 배열에서 작은쓰기 문제 해결을 위한 압축 패리티 로깅 기법)

  • 김근혜;김성수
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10a
    • /
    • pp.12-14
    • /
    • 1998
  • 본 논문은 RAID5가 갖는 쓰기 문제를 극복하기 위하여 지금까지의 연구 중에서 가장 우수한 성능을 나타내는 패리티 로깅 기법의 단점을 개선한 새로운 패리티 로깅 기법을 제안한다. 제안된 기법은 패리티 로깅기법에서 가장 큰 오버헤드인 패리티 로그의 크기를 줄이기 위하여 로그 데이터를 압축하는 방법을 사용한다. 로그 데이터의 압축은 로그 데이터의 저장에 필요한 비휘발성 버퍼의 크기와 로그 데이터 접근시간을 감소시켜 전체적인 성능을 향상시킬수 있다. 시뮬레이션을 통한 성능분석 결과에서 제안된 기법은 기존의 패리티 로깅 기법에 비하여 디스크 접근시간에서 우수한 성능을 나타냄을 보인다.

  • PDF

A Selective Compression Strategy for Performance Improvement of Database Compression (데이터베이스 압축 성능 향상을 위한 선택적 압축 전략)

  • Lee, Ki-Hoon
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.4 no.9
    • /
    • pp.371-376
    • /
    • 2015
  • The Internet of Things (IoT) significantly increases the amount of data. Database compression is important for big data because it can reduce costs for storage systems and save I/O bandwidth. However, it could show low performance for write-intensive workloads such as OLTP due to the updates of compressed pages. In this paper, we present practical guidelines for the performance improvement of database compression. Especially, we propose the SELECTIVE strategy, which compresses only tables whose space savings are close to the expected space savings calculated by the compressed page size. Experimental results using the TPC-C benchmark and MySQL show that the strategy can achieve 1.1 times better performance than the uncompressed counterpart with 17.3% space savings.

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

Hybrid Polyline Simplification for GIS Vector Map Data Compression (GIS 벡터맵 데이터 압축을 위한 혼합형 폴리라인 단순화)

  • Im, Dae-Yeop;Jang, Bong-Joo;Lee, Suk-Hwan;Kwon, Seong-Geun;Kwon, Ki-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.4
    • /
    • pp.418-429
    • /
    • 2013
  • This paper presents a GIS vector map data compression scheme based on hybrid polyline simplification method and SEC(spatial energy compaction). The proposed method extracts all layers which contain polylines in the GIS vector map and compress all polylines in extracted layers by the hybrid polyline simplification and SEC based on MAE(minimum area error) for each segment in the line. The proposed simplification and SEC increase the compression ratio while preserving the shape quality. We analyze the visual aspects and compression efficiency between the original GIS vector map and the compressed map. From experimental results, we verify that our method has the higher compression efficiency and visual quality than conventional methods.

Data compresson for high speed data transmission (고속전송을 위한 V.42bis 데이터 압축 기법의 개선)

  • Cho, Sung-Ryul;Choi, Hyuk;Kim, Tae-Young;Kim, Tae-Jeong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.7
    • /
    • pp.1817-1823
    • /
    • 1998
  • V.42bis, a type of LZW(Lempel-Ziv-Welch) code, is well-known as theinter national standard is asynchronous data compression. In this paper, we analyze several undesirable phenomena arising from the application of v.42bis to high speed data transmission, and we propose a modified technique to overcome them. the proposed technique determines the proper size of the dictionary, one of important factors affecting the compression ratio, and improves the method of dictionary generation for a higher compression ratio. Furthermore, we analyze the problem of excessive mode changes and solve it to a certain degree by adjusting the threshold for mode change. By doing this, we can achieve smiller variation of the compression ratio in time. This improvement chtributes to easier and better design and control of the buffer in high speed data transmission.

  • PDF

Design of Spatial Data Compression Methods for Improvement of Mobile Transmission Efficiency (모바일 전송 효율 향상을 위한 공간 데이터 압축 기법의 설계)

  • 최진오;김진덕;문상호
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.8 no.4
    • /
    • pp.950-954
    • /
    • 2004
  • According to the rapid advance of computer and communication techniques, the request of mobile internet services is highly increasing. However, the main obstacles for mobile vector map service environments, are large data volume and narrow wireless bandwidth. Among the many possible solutions, spatial data compression technique may contribute to reduce the load of bandwidth and client response time. This thesis proposes two methods for spatial data compression. The one is relative coordinates transformation method, and the other is client coordinates transformation method. And, this thesis also proposes the system architecture for experiments. The two compression methods could be evaluated the compression effect and the response time.