• Title/Summary/Keyword: decomposed bit-plane method

Search Result 9, Processing Time 0.021 seconds

Wavelet Transform Image Compression Using Shuffling and Correlation (Shuffling 및 상관도를 이용한 웨이블릿 영상 압축)

  • 김승종;민병석;정제창
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.609-612
    • /
    • 1999
  • In this paper, we propose wavelet transform image compression method such that an image is decomposed into multiresolutions using biorthogonal wavelet transform with linear phase response property and decomposed subbands are classified by maximum classification gain. The classified data is quantized by allocating bits in accordance with classified class informations within subbands through arbitrary set bit allocation algorithm. And then, quantized data in each subband are entropy coded. The proposed coding method is that the quantized data perform shuffling before entropy coding in order to remove sign bit plane. And the context is assigned by maximum correlation direction for bit plane coding.

  • PDF

Image Coding Using Bit-Planes of Wavelet Coefficients (웨이블렛 변환 계수의 비트 플레인을 이용한 영상부호화)

  • 김영로;홍원기;고성제
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.4
    • /
    • pp.714-725
    • /
    • 1997
  • This paper proposes an image compression method using the wavelet transform and bit-plane coding of wavelet coefficients. The hierarchical application of wavelet transform to an image produces one low resoluation(the subband with lowest frequency) image and several high frequency subbands. In the proposed method, the low resolution image is compressed by a lossless method at 8 bits per each coefficient. However, the high frequency subbands are decomposed into 8 bit planes. With an adptive block coding method, the decomposed bit planes are effectively compressed using localized edge information in each bit plane. In addition, the propsoed method can control bit rates by selectively eliminating lessimportant subbands of low significant bit planes. Experimental results show that the proposed scheme has better performance in the peak signal to noise ratio (PSNR) and compression rate than conventional image coding methods using the wavelet transform and vector quantization.

  • PDF

Image Compression Based on Wavelet Transform Using Shffling and Bit Plane Correlation (부호변환 및 비트 평면 상관도를 이용한 웨이블릿 기반 영상 압축)

  • 김승종;정제창;최병욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.4B
    • /
    • pp.743-754
    • /
    • 2000
  • In this paper, we propose wavelet transform image compression method using shuffling and bit plane correlation. Proposed method is that original image decompose into multiresolutions using biorthogonal wavelet transform with linear phase response property and decomposed subbands are classified by maximum classification gain. And classified data sets in each subband are quantized using arbitrary set optimum bit allocation method. Quantized data sets in each subband are shuffled and context based bit plane arithmetic encoded .In context based bit plane arithmetic encoding, the context for each subband is not assigned uniformly, but assigned according to maximum correlation direction. Our results are comparable, or superior for some images at low rates, to published state-of-the-art coders.

  • PDF

Parallel Transmission and Recovery Methods of Images Using the Two Dimensional Fiber-Optic Code-Division Multiple-Access System (2차원 광부호분할 다중접속 시스템에 의한 영상의 병렬 전송과 복원법)

  • Lee, Tae-Hoon;Park, Young-Jae;Seo, Ik-Su;Park, Jin-Bae
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.49 no.12
    • /
    • pp.683-689
    • /
    • 2000
  • Two-dimensional(2-D) fiber-optic code-division multiple-access(FO-CDMA) system utilizes the optical orthogonal signature pattern code(OOSPC) to encode and decode 2-D data. Encoded 2-D data are spatially multiplexed and transmitted through an image fiber and receiver recovers the intended data by means of thresholding process. OOSPC's construction methods based on expansion of the optical orthogonal code, which is used in one-dimensional(1-D) FO-CDMA system, are introduced. Each OOSPC's performances are compared by using the bit error rate(BER) of interfering OOSPC's of other users. From the results we verify that a balanced incomplete block design(BIBD) construction has the best performance among other mehtods. We also propose a decomposed bit-plane method for parallel transmission and recovery of 256 gray-scale images using OOSPC's constructed by the BIBD method. The simulation result encourages the feasibility of parallel transmission and recovery of multiuser's images.

  • 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

An Approach to Conceal Hangul Secret Message using Modified Pixel Value Decomposition (수정된 화소 값 분해를 사용하여 한글 비밀 메시지를 숨기는 방법)

  • Ji, Seon-su
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.14 no.4
    • /
    • pp.269-274
    • /
    • 2021
  • In secret communication, steganography is the sending and receiving of secret messages without being recognized by a third party. In the spatial domain method bitwise information is inserted into the virtual bit plane of the decomposed pixel values of the image. That is, the bitwise secret message is sequentially inserted into the least significant bit(LSB) of the image, which is a cover medium. In terms of application, the LSB is simple, but has a drawback that can be easily detected by a third party. If the upper bit plane is used to increase security, the image quality may deteriorate. In this paper, I present a method for concealing Hangul secret messages in image steganography based on the lo-th bit plane and the decomposition of modified pixel intensity values. After decomposing the Hangeul message to be hidden into choseong, jungseong and jongseong, then a shuffling process is applied to increase confidentiality and robustness. PSNR was used to confirm the efficiency of the proposed method. It was confirmed that the proposed technique has a smaller effect in terms of image quality than the method applying BCD and Fibonacci when inserting a secret message in the upper bit plane. When compared with the reference value, it was confirmed that the PSNR value of the proposed method was appropriate.

Performance Improvement of Steganalysis based on image Categorization Using Correlation Coefficient (상관계수를 이용한 영상의 범주화에 근거한 스테그분석의 성능 개선)

  • Park, Tae Hee;Eom, Il Kyu
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.6
    • /
    • pp.221-227
    • /
    • 2013
  • This paper proposes an improved steganalysis method based on image categorization. In general, most steganalysis methods extract the statistical moments based features which contain the global natures of images regardless of their inherent characteristics. However, the steganalysis method based on the statistical moments leads to degraded performance by applying to images with different complexity. In this paper, we decompose an 8-bit image into an upper 4-bit plane and a lower 4-bit plane, and categorize the image with two classes according to the correlation coefficient between decomposed sub-images. Two independent steganalyses can be performed for the categorized images. Since our method uses independent steganalysis technique according to the image category, it can reduce the drawback of the steganalysis methods utilizing the statistical moments. The performance of the proposed scheme is compared with well-known four steganalysis methods. Experiment results show that the proposed scheme has higher detection rate than previous methods.

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.

Enhanced Block Matching Scheme for Denoising Images Based on Bit-Plane Decomposition of Images (영상의 이진화평면 분해에 기반한 확장된 블록매칭 잡음제거)

  • Pok, Gouchol
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.12 no.3
    • /
    • pp.321-326
    • /
    • 2019
  • Image denoising methods based on block matching are founded on the experimental observations that neighboring patches or blocks in images retain similar features with each other, and have been proved to show superior performance in denoising different kinds of noise. The methods, however, take into account only neighboring blocks in searching for similar blocks, and ignore the characteristic features of the reference block itself. Consequently, denoising performance is negatively affected when outliers of the Gaussian distribution are included in the reference block which is to be denoised. In this paper, we propose an expanded block matching method in which noisy images are first decomposed into a number of bit-planes, then the range of true signals are estimated based on the distribution of pixels on the bit-planes, and finally outliers are replaced by the neighboring pixels belonging to the estimated range. In this way, the advantages of the conventional Gaussian filter can be added to the blocking matching method. We tested the proposed method through extensive experiments with well known test-bed images, and observed that performance gain can be achieved by the proposed method.