• Title/Summary/Keyword: Bit plane

Search Result 143, Processing Time 0.143 seconds

The study for changes of plane at the Jeongjagak(丁字閣) accepting functions of the Yeongakjeon(靈幄殿) (조선후기 영악전(靈幄殿) 기능수용에 따른 정자각 평면변화 고찰)

  • Shin, Ji-Hye
    • Journal of architectural history
    • /
    • v.18 no.4
    • /
    • pp.7-23
    • /
    • 2009
  • The "Jeongjagak(丁字閣, T shaped building)" was important building from Goryeo Dynasty to Joseon Dynasty. For long period, the scale and form of the building had been changing bit by bit. The change of building results from the function. As the Jeongjagak accepted the functions of the Yeongakjeon(靈幄殿), there appeared changes of plane. The main function of Yeongakjeon was suppling space for the dead king's coffin. The Yeongakjeon was not built in the first year of King Sukjong(1674). At that time, the Jeongjagak was responsible for the function of the Yeongakjeon as an alternative. Starting from this, the Jeongjagak was used as space for the dead king's coffin. Because the coffin should place on from south to north, it demanded long inner space in south-north direction. Therefore the effort to make enough length in south-north direction was begun from the first year of King Sukjong(1674). In order to solve the problem, the Toigu(退構) was made from the reign of King Sukjong to the 28th year King Youngjo(1852). The Toigu was temporary inner space which was made in one compartment at the Baewichung(拜位廳, the part of the Jeongjagak). But the length of the Jeongjagak's south-north direction was reduced to 61.8m(20尺6寸) at the 33th year of King Youngjo(1857) when the "Gukjosangryebopyon(國朝喪禮補編)" was completed. Also it extended to 84m(28尺) during the reign of King Jeongjo(1774~1800). Following these process of extension and reduction, the length was standardized as 72m(24尺) at the reign of King Sunjo(1800~1834). These facts explains that the main cause of plane change at the Jeongjagak was acceptance of functions that was used as space for the dead king's coffin. Also, the important points of change at the Jeongjagak were the first year of King Sukjong, the 33th year of King Youngjo and the first year of King Sunjo. When it was the first year of King Sukjong and the 33th year of King Youngjo, there were two national funerals. Because of concern about the increasing labor and tax of the nation, the scale of the Jeongjagak was changed to decreasing size. Due to the improvement of drawings and annotation on a Eugwe(儀軌) at the first year of King Sunjo, the size of Jeongjagak was standardized.

  • PDF

Performance Comparison of Fast Distributed Video Decoding Methods Using Correlation between LDPCA Frames (LDPCA 프레임간 상관성을 이용한 고속 분산 비디오 복호화 기법의 성능 비교)

  • Kim, Man-Jae;Kim, Jin-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.4
    • /
    • pp.31-39
    • /
    • 2012
  • DVC(Distributed Video Coding) techniques have been attracting a lot of research works since these enable us to implement the light-weight video encoder and to provide good coding efficiency by introducing the feedback channel. However, the feedback channel causes the decoder to increase the decoding complexity and requires very high decoding latency because of numerous iterative decoding processes. So, in order to reduce the decoding delay and then to implement in a real-time environment, this paper proposes several parity bit estimation methods which are based on the temporal correlation, spatial correlation and spatio-temporal correlations between LDPCA frames on each bit plane in the consecutive video frames in pixel-domain Wyner-Ziv video coding scheme and then the performances of these methods are compared in fast DVC scheme. Through computer simulations, it is shown that the adaptive spatio-temporal correlation-based estimation method and the temporal correlation-based estimation method outperform others for the video frames with the highly active contents and the low active contents, respectively. By using these results, the proposed estimation schemes will be able to be effectively used in a variety of different applications.

Fast block matching algorithm for constrained one-bit transform-based motion estimation using binomial distribution (이항 분포를 이용한 제한된 1비트 변환 움직임 예측의 고속 블록 정합 알고리즘)

  • Park, Han-Jin;Choi, Chang-Ryoul;Jeong, Je-Chang
    • Journal of Broadcast Engineering
    • /
    • v.16 no.5
    • /
    • pp.861-872
    • /
    • 2011
  • Many fast block-matching algorithms (BMAs) in motion estimation field reduce computational complexity by screening the number of checking points. Although many fast BMAs reduce computations, sometimes they should endure matching errors in comparison with full-search algorithm (FSA). In this paper, a novel fast BMA for constrained one-bit transform (C1BT)-based motion estimation is proposed in order to decrease the calculations of the block distortion measure. Unlike the classical fast BMAs, the proposed algorithm shows a new approach to reduce computations. It utilizes the binomial distribution based on the characteristic of binary plane which is composed of only two elements: 0 and 1. Experimental results show that the proposed algorithm keeps its peak signal-to-noise ratio (PSNR) performance very close to the FSA-C1BT while the computation complexity is reduced considerably.

BTC employing a Quad Tree Technique for Image Data Compression (QUAD TREE를 이용한 BTC에서의 영상데이타 압축)

  • 백인기;김해수;조성환;이근영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.13 no.5
    • /
    • pp.390-399
    • /
    • 1988
  • A conventional BTC has the merit of real time processing and simple computation, but has the problem that its compression rate is low. In this paper, a modified BTC using the Quad Tree which is frequently used in binary image is proposed. The method results in the low compression rate by decreasing the total number of subblocks by mean of making the size of a subblock large in the small variation area of graty level and the size af a subblock small in the large variation area of gary level. For the effective transmission of bit plane, the Huffman run-lengh code for the large size of a subblock and the lookup table for tha small size of a subblock are used. The proposed BTC method show the result of coding 256 level image at the average data rate of about 0.8 bit/pixel.

  • PDF

A Depth-map Coding Method using the Adaptive XOR Operation (적응적 배타적 논리합을 이용한 깊이정보 맵 코딩 방법)

  • Kim, Kyung-Yong;Park, Gwang-Hoon
    • Journal of Broadcast Engineering
    • /
    • v.16 no.2
    • /
    • pp.274-292
    • /
    • 2011
  • This paper proposes an efficient coding method of the depth-map which is different from the natural images. The depth-map are so smooth in both inner parts of the objects and background, but it has sharp edges on the object-boundaries like a cliff. In addition, when a depth-map block is decomposed into bit planes, the characteristic of perfect matching or inverted matching between bit planes often occurs on the object-boundaries. Therefore, the proposed depth-map coding scheme is designed to have the bit-plane unit coding method using the adaptive XOR method for efficiently coding the depth-map images on the object-boundary areas, as well as the conventional DCT-based coding scheme (for example, H.264/AVC) for efficiently coding the inside area images of the objects or the background depth-map images. The experimental results show that the proposed algorithm improves the average bit-rate savings as 11.8 % ~ 20.8% and the average PSNR (Peak Signal-to-Noise Ratio) gains as 0.9 dB ~ 1.5 dB in comparison with the H.264/AVC coding scheme. And the proposed algorithm improves the average bit-rate savings as 7.7 % ~ 12.2 % and the average PSNR gains as 0.5 dB ~ 0.8 dB in comparison with the adaptive block-based depth-map coding scheme. It can be confirmed that the proposed method improves the subjective quality of synthesized image using the decoded depth-map in comparison with the H.264/AVC coding scheme. And the subjective quality of the proposed method was similar to the subjective quality of the adaptive block-based depth-map coding scheme.

Optical representation of binary data based on both intensity and phase modulation with a twisted-nematic liquid crystal display for holographic digital data storage (디지털 데이터의 홀로그래피 저장에서 뒤틀린 니매틱 액정 디스플레이로 세기 및 위상 변조에 기초한 2진 데이터의 광학적 표현)

  • 신동학;오용석;장주석
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.05a
    • /
    • pp.497-502
    • /
    • 2001
  • We propose a method to represent binary data by modulating both the intensity and the phase of uniform plane waves with a twisted-nematic liquid crystal display for holographic digital data storage especially in a disk-shaped recording medium. As far as intensity modulation is concerned, our method is not different from the conventional method, because binary bit values 0 and 1 are represented by the dark (off) and lit (on) states of the liquid crystal display pixels, respectively (or vice versa). With our method, however, the on pixels are also controlled so that the beams passing through them can have one of two different phase delays. If the difference of the two phase delays is close to 180 degrees, we can reduce the dc component of the data image and thus improve the beam intensity uniformity at the holographic recording plane when Fourier plane holograms are recorded. The feasibility of our method is experimentally demonstrated.

  • PDF

FPGA Implementation of LSB-Based Steganography

  • Vinh, Quang Do;Koo, Insoo
    • Journal of information and communication convergence engineering
    • /
    • v.15 no.3
    • /
    • pp.151-159
    • /
    • 2017
  • Steganography, which is popular as an image processing technology, is the art of using digital images to hide a secret message in such a way that its existence can only be discovered by the sender and the intended receiver. This technique has the advantage of concealing secret information in a cover medium without drawing attention to it, unlike cryptography, which tries to convert data into something messy or meaningless. In this paper, we propose two efficient least significant bit (LSB)-based steganography techniques for designing an image-based steganography system on chip using hardware description language (HDL). The proposed techniques manipulate the LSB plane of the cover image to embed text inside it. The output of these algorithms is a stego-image which has the same quality as that of the original image. We also implement the proposed techniques using the Altera field programmable gate array (FPGA) and Quartus II design software.

Block-based rate control method in the bit-plane coding of the depth-map coding (깊이정보 맵의 비트평면 부호화에서 블록 단위 비트율 조절 방법)

  • Kim, Kyung-Yong;Park, Gwang-Hoon
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.11a
    • /
    • pp.213-215
    • /
    • 2009
  • 본 논문에서는 비트평면 부호화를 이용한 적응적 깊이정보 맵 부호화에서 블록 단위 비트율 조절 방법을 제안한다. 기존 방법에서는 깊이정보 맵에 대한 비트율 조절을 위해 양자화 변수를 이용하여 분리된 비트평면의 이진 영상들 중 특정 비트평면의 이진 영상만 부호화하는 방법을 통해 비트율을 조절할 수 있었다. 본 논문에서는 비트율-왜곡 최적화 방법을 이용하여 블록 단위로 부호화할 비트평면의 이진영상을 결정하는 방법을 제안한다. 실험 결과 제안하는 방법이 기존 방법보다 BD-PSNR이 0.2 dB 향상되었고 BD-rate가 2.97% 감소되어 제안하는 방법의 우수함을 확인할 수 있었다.

  • PDF

The Evaluation of Degradation Characteristics of Silicone Rubber for Outdoor by Leakage Current Monitoring (누설전류 모니터링에 의한 옥외용 실리콘 고무의 열화 특성 평가)

  • Kim, Jeong-Ho;Song, Woo-Chang;Cho, Han-Goo;Park, Yong-Kwan
    • The Transactions of the Korean Institute of Electrical Engineers C
    • /
    • v.50 no.2
    • /
    • pp.60-64
    • /
    • 2001
  • The degradation process of silicone rubber was investigated by leakage current monitoring in Inclined-Plane method. DAS (Data Acquisition System) with 12-bit, 8-channel A/D converter was prepared. Average current, cumulative charge, current waveform and the number of peak pulses were measured on-line. And, FFT (Fast Fourier Transform) analysis was performed with stored current waveform. Besides, maximum erosion depth was measured in order to use as the indicator of the degradation process. So, the results of leakage current components and maximum erosion depth measurements were compared to find one or more components which have trends of changing similarly to that of erosion process. The result suggests that the ratio of peak current to r.m.s. current, harmonic contents and the number of peak pulses are well corresponding with the degradation process.

  • PDF

Development of Morphological Pattern Recognition System - Morphological Shape Decomposition using Shape Function (형태론적 패턴인식 시스템의 개발 - 형상함수를 이용한 형태론적 형상분해)

  • Jong Ho Choi
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.8
    • /
    • pp.1127-1136
    • /
    • 1995
  • In this paper, a morphological shape decomposition method is proposed for the purpose of pattern recognition and image compression. In the method, a structuring element that geometrical characteristics is more similar to the shape function is preselected. The shape is decomposed into the primitive elements corresponding to the structuring element. A gray scale image also is transformed into 8 bit plane images for the hierarchical reconstruction required in image communication systems. The shape in each bitplane is decomposed to the proposed method. Through the experiment. it is proved that the description error is reduced and the coding efficiency is improved.

  • PDF