• Title/Summary/Keyword: 시.공간의 압축

Search Result 193, Processing Time 0.029 seconds

Moving Image Compression with Splitting Sub-blocks for Frame Difference Based on 3D-DCT (3D-DCT 기반 프레임 차분의 부블록 분할 동영상 압축)

  • Choi, Jae-Yoon;Park, Dong-Chun;Kim, Tae-Hyo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.37 no.1
    • /
    • pp.55-63
    • /
    • 2000
  • This paper investigated the sub-region compression effect of the three dimensional DCT(3D-DCT) using the difference component(DC) of inter-frame in images. The proposed algorithm are the method that obtain compression effect to divide the information into subband after 3D-DCT, the data appear the type of cubic block(8${\times}$8${\times}$8) in eight difference components per unit. In the frequence domain that transform the eight differential component frames into eight DCT frames with components of both spatial and temporal frequencies of inter-frame, the image data are divided into frame component(8${\times}$8 block) of time-axis direction into 4${\times}$4 sub block in order to effectively obtain compression data because image components are concentrate in corner region with low-frequency of cubic block. Here, using the weight of sub block, we progressed compression ratio as consider to adaptive sub-region of low frequency part. In simulation, we estimated compression ratio, reconstructed image resolution(PSNR) with the simpler image and the complex image contained the higher frequency component. In the result, we could obtain the high compression effect of 30.36dB(average value in the complex-image) and 34.75dB(average value in the simple-image) in compression range of 0.04~0.05bpp.

  • PDF

Implementation of Encoding System Based on the TI DSP 64x and Decoding System (TI DSP 64x에서의 인코딩 시스템 및 디코딩 시스템 구현)

  • 전형국;마평수
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10c
    • /
    • pp.316-318
    • /
    • 2003
  • JPEG 2000표준을 이용하여 계산상 효율적이면서도 DSP에 적합한 영상 압축 알고리즘을 개발한다. 개발될 기법이 갖는 가장 큰 장점은 비교적 복잡한 연산량을 필요로 하여 실시간 동영상 부호화기에 사용되지 못하고 있는 JPEG 2000 알고리즘을 DSP에 맞게 구현함으로써 고화질의 동영상을 실시간으로 처리할 수 있게 한다. 또한 사용자의 요구 및 사양에 맞추어 보다 효과적으로 컨텐츠를 제공하기 위해, 시, 공간적 스케일러비티를 지원하는 코덱을 개발하여 사용자의 요구와 필요 서비스에 따라 적절한 품질의 비디오를 제공함으로써 더 많은 응용에 쉽게 적용시킬 수 있는 방법들을 제시한다.

  • PDF

Fast Block Mode Decision of Spatial Enhancement Layer using Interlayer Motion Vector Estimation in Scalable Video Coding (스케일러블 비디오 부호화에서 공간 계층간 움직임 벡터 예측를 이용한 고속 모드 결정)

  • Lee, Bum-Shik;Kim, Mun-Chul;Hahm, Sang-Jin;Lee, Keun-Sik;Park, Chang-Seob
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2007.02a
    • /
    • pp.13-17
    • /
    • 2007
  • 스케일러블 비디오 코딩(SVC, Scalable Video Coding)은 MPEG(Moving Picture Expert Group)과 VCEG (Video Coding Expert Group)의 JVT(Joint VIdeo Team)에 의해 현재 표준화 되고 있는 새로운 압축 표준 기술이며 시간, 공간 및 화질의 스케일러빌리티를 지원하기 위해 계층 구조를 가지고 있다. 공간적 스케일러빌리티를 위해 기본 계층으로부터 텍스처, 움직임 그리고 잔차신호 정보를 예측하여 사용한다. 그러나 고효율의 압축효과를 얻기 위해 기존의 방식에서는 기본계층에서 얻은 세가지 정보이외에 현재 향상 계층에서 자체적으로 얻은 부호화 정보를 비교하여 최소의 RD(Rate Distortion) 비용을 가지는 정보를 이용하여 부호화 하도록 되어 있다. 하지만 이러한 방식은 향상 계층에서 인터 모드 결정 시 $16\times16,\;16\times8,\;8\times16,\;8\times8,\;4\times4,\;4\times8,\;4\times4$ 블록 모드에 대한 움직임 벡터 예측 및 보상 과정을 거쳐야 하기 때문에 향상 계층에서의 부호화 복잡도는 기본 계층에 비해 상당히 증가하게 된다. 본 논문에서는 기본계층에서 예측한 움직임 벡터 정보를 이용하여 항상 계층에서 모드 결정을 고속화하는 방법에 대해 소개한다. 제안된 방법은 기본 계층에서 예측한 블록모드 중에서 큰 블록인 $16\times16$ 블록에서 움직임 벡터가 (0, 0) 일 경우에 대하여 향상 계층에서는 $16\times16$매크로 블록에 대해서만 움직임 예측 및 보상을 수행함으로써 향상 계층에서 움직임 모드 결정을 조기에 완료하게 된다. 이것은 하위 공간 계층에서 예측한 움직임 벡터 정보가 아주 작을 때는 큰 블록 크기로 모드로 결정되는 일반적인 원리를 이용한 것이고 이 제안 방법을 이용하였을 경우 향상계층에의 모드 결정과정을 고속화함으로써 전체 스케일러빌 비디오 부호하기의 연산량 및 복잡도를 최대 70%까지 감소 시켰다. 그러나 연산량 감소에 따른 비트율의 증가와 화질 열화는 각각 최대 1.32%와 최대 0.11dB로 무시할 수 있을 정도로 작음을 확인 하였다.

  • PDF

The YIQ Model of Computed Tomography Color Image Variable Block with Fractal Image Coding (전산화단층촬영 칼라영상의 YIQ모델을 가변블록 이용한 프랙탈 영상 부호화)

  • Park, Jae-Hong;Park, Cheol-Woo
    • Journal of the Korean Society of Radiology
    • /
    • v.10 no.4
    • /
    • pp.263-270
    • /
    • 2016
  • This paper suggests techniques to enhance coding time which is a problem in traditional fractal compression and to improve fidelity of reconstructed images by determining fractal coefficient through adaptive selection of block approximation formula. First, to reduce coding time, we construct a linear list of domain blocks of which characteristics is given by their luminance and variance and then we control block searching time according to the first permissible threshold value. Next, when employing three-level block partition, if a range block of minimum partition level cannot find a domain block which has a satisfying approximation error, There applied to 24-bpp color image compression and image techniques. The result did not occur a loss in the image quality of the image when using the encoding method, such as almost to the color in the YIQ image compression rate and image quality, such as RGB images and showed good.

A Study on the Compression and Major Pattern Extraction Method of Origin-Destination Data with Principal Component Analysis (주성분분석을 이용한 기종점 데이터의 압축 및 주요 패턴 도출에 관한 연구)

  • Kim, Jeongyun;Tak, Sehyun;Yoon, Jinwon;Yeo, Hwasoo
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.19 no.4
    • /
    • pp.81-99
    • /
    • 2020
  • Origin-destination data have been collected and utilized for demand analysis and service design in various fields such as public transportation and traffic operation. As the utilization of big data becomes important, there are increasing needs to store raw origin-destination data for big data analysis. However, it is not practical to store and analyze the raw data for a long period of time since the size of the data increases by the power of the number of the collection points. To overcome this storage limitation and long-period pattern analysis, this study proposes a methodology for compression and origin-destination data analysis with the compressed data. The proposed methodology is applied to public transit data of Sejong and Seoul. We first measure the reconstruction error and the data size for each truncated matrix. Then, to determine a range of principal components for removing random data, we measure the level of the regularity based on covariance coefficients of the demand data reconstructed with each range of principal components. Based on the distribution of the covariance coefficients, we found the range of principal components that covers the regular demand. The ranges are determined as 1~60 and 1~80 for Sejong and Seoul respectively.

Experimental study on the suppression of fire fighting by using Compressed Air Foam system (압축공기포(Compressed Air Foam) 소화시스템을 이용한 구난역 열차 화재 진압에 관한 실험적 연구)

  • Park, Byoung-Jik;Shin, Hyun-Jun;Yoo, Yong-Ho;Park, Jin-Ouk;Kim, Hwi-Seong;Kim, Yang-Kyun
    • Journal of Korean Tunnelling and Underground Space Association
    • /
    • v.20 no.2
    • /
    • pp.423-432
    • /
    • 2018
  • Since the Daegu subway fire accident, people's perception of safety has increased, and all materials inside the train have been changed to incombustible materials. However, there is still a lack of development of fire extinguishing systems. Train components are mostly made of steel plates, and therefore it is very difficult to extinguish the train fire by using general fire extinguishing equipment. In this regard, this paper investigated rapid and easy methods of extinguishing the train fire by using compressed air foam systems through full-scale fire tests. To extinguish the fire of train at rescue station, window breakers were used to quickly destroy the train windows, and the compressed air foam system was inserted inside the train. As a result, the train windows were destroyed in 5 seconds, and the 11.88-MW fire was put out in 30 seconds by the compressed air foam discharged from the compressed air foam system inserted inside the train. For the future work, there is a need for further experimental studies to prevent the spread of fire and protect tunnel structures with the use of compressed air foam systems.

A robust error resilient approach for video data transmission over Internet (인터넷에 비디오 데이터 전송시 강건한 오류 내성 기법)

  • 김진옥;황대준
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10e
    • /
    • pp.481-483
    • /
    • 2002
  • 압축한 비디오데이타를 네트워크으로 전송 시 채널이 불안정한 경우 패킷이 분실될 우려가 있다. 패킷 분실은 대부분 버스트오류로 나타난다. 본 연구에서는 디코더에서 버스트오류를 효과적으로 은닉, 처리하는 방법으로 오류 내성 비디오 인코딩 방법을 제안한다. 이를 위해 공간적 오류은닉법으로 오류 패킷 분실을 야기시키는 손실 블록을 분리하는데 효과적인 블록 인터리빙을 적용한다. 시간적 오류 은닉에 대해서는 연속적인 내부프레임 또는 프레임간에 움직임벡터의 프레임간 패리티 비트를 삽입하는 구조를 적용한다. 비디오 인코딩 단계를 거쳐 디코더에서 수신한 블록들에 대해서는 쌍선형 보간법을 적용하여 전송시 발생한 국지적 오류를 적절하게 은닉 처리한다. 본 논문에서 제안한 인코딩 방법을 전송 블록에 부가 데이터로 포함하는 것은 표준 엔코더의 복잡도에 거의 영향을 미치지 않는다.

  • PDF

Wavelet-Based Fast Fractal Image Compression with Multiscale Factors (레벨과 대역별 스케일 인자를 갖는 웨이브릿 기반 프랙탈 영상압축)

  • 설문규
    • Journal of the Korea Computer Industry Society
    • /
    • v.4 no.4
    • /
    • pp.589-598
    • /
    • 2003
  • In the conventional fractal image compression in the DWT(discrete wavelet transform), the domain and range blocks were classified as B${\times}$B block size first before all domain block for each range block was searched. The conventional method has a disadvantages that the encoding time takes too long, since the domain block for entire image was searched. As an enhancement to such inefficiencies and image quality, this paper proposes wavelet-based fractal image compression with multiscale factors. Thus, this proposed method uses multiscale factor along each level and band to enhance an overall image quality. In encoding process of this method, the range blocks are not searched for all the domain blocks; however, using the self affine system the range blocks are selected from the blocks in the upper level. The image qualify of the conventional method is 32.30[dB], and the proposed method is 35.97[dB]. The image quality is increased by 3.67[dB].

  • PDF

Analysis of Granite Behavior In Blasting Using Microplane Constitutive Model (마이크로플레인 모델을 이용한 발파시 화강암의 거동해석)

  • Zi, Goangseup;Moon, Sang-Mo;Lee, In-Mo
    • Journal of Korean Tunnelling and Underground Space Association
    • /
    • v.8 no.2
    • /
    • pp.87-100
    • /
    • 2006
  • A kinematically constrained microplane constitutive model is developed for intact granite. The model is verified by fitting the experimented data of Westerly granite and Bonnet granite. Using the model with the standard finite element method, the behavior of the intact granite subjected blasting impact is studied. What is studied includes the attenuation of the blasting waves, the size of the fractured zone and the effect of the charge condition to avoid overbreak of the rock mass. The model developed captures the energy loss due to the inelastic behavior and the microcracking of granite during blasting very well. The attenuation of the blasting waves calculated based on the model is much more than that based on the linear-elastic constitutive law. The size of damaged (or fractured) zone is calculated directly from the principal strain as blasting impact is spreading, not like in the case with the linear elasticity model.

  • PDF

Efficient Capturing of Spatial Data in Geographic Database System (지리 데이타베이스 시스템에서의 효율적인 공간 데이타 수집)

  • Kim, Jong-Hun;Kim, Jae-Hong;Bae, Hae-Yeong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.1 no.3
    • /
    • pp.279-289
    • /
    • 1994
  • A Geographic Database System is a database system which supports map-formed output and allows users to store, retrieve, manage and analyze spatial and aspatial data. Because of large data amount, takes too much time to input spatial data into a Geographic Database System and too much storage. Therefore, an efficient spatial data collecting system is highly required for a Geographic Database System to reduce the input processing time and to use the storage efficiently. In this paper, we analyze conventional vectorizing methods and suggest a different approach. Our approach vectorizes specific geographic data when the users input its aspatial data, instead of vectorizing all the map data. And also, we propose optimized vector data format using tag bit to use the storage that collected data efficiently.

  • PDF