• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10C
• /
• pp.961-967
• /
• 2009

In this paper, the lossless compression method is proposed for an 8-bit bitplane of the input image. The lower bitplanes are not well compressed because of irregularity of pixels. To overcome these drawbacks, this paper propose a mixed coding method that using the block-based lossless compression and the bit-based losselss compression, introducing the H. 264 and the JBIG. First, to take advantage of the characteristics of the bitplanes, 8-bitplane against the top 4 bits and lower 4 bits were separated. Next, the JBIG compression method was used in separated top 4-bitplane because of a lot of correlation between bits. And a separated lower 4-bitplane was applied the improved method that using the H. 264 lossless prediction. A pre-processing method applied to the lower 4-bitplane then irregular distribution of pixel values are converted to regular. Using the proposed method to test for various test images were performed. Experimental results from a printer using 8-bit image compared to JBIG average 19%, lower 4bit image compression performance with an average of 11% could be obtained.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.4
• /
• pp.1426-1436
• /
• 2014

In this article, we present a new grey scale image segmentation method based on Fuzzy logic and bitplane techniques which combines the bits of different bitplanes of a pixel inorder to increase the segmentation quality and to get a more reliable and accurate segmentation result. The proposed segmentation approach is conceptually different and explores a new strategy. Infact, our technique consists in combining many realizations of the image together inorder to increase the information quality and to get an optimal segmented image. For segmentation, we proceed in two steps. In the first step, we begin by identifying the bitplanes that represent the lungs clearly. For this purpose, the intensity value of a pixel is separated into bitplanes. In the second step, segmentation values are assigned for each bitplane based on membership table. The segmented values of foreground are combined and the segmentation values of background are combined. The algorithm is demonstrated through the medical computed tomography (CT) images. The segmentation accuracy of the proposed method is compared with two existing techniques. Satisfactory segmentation results have been obtained showing the effectiveness and superiority of the proposed method.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.6 s.312
• /
• pp.101-109
• /
• 2006

Recently, according to the number of internet in widely use and the development of the related application program, the distribution and use of multimedia content(text, images, video, audio etc.) is very easy. Digital signal may be easily duplicated and the duplicated data can have same quality of original data so that it is difficult to warrant original owner. For the solution of this problem, the protection method of copyright which is encipher and watermarking. Digital watermarking is used to protect IP(Intellectual Property) and authenticate the owner of multimedia content. In this paper, the proposed watermarking algerian embeds watermark into multiple lower bitplanes of digital image. In the proposed algorithm, original and watermark images are decomposed to bitplanes each other and the watermarking operation is executed in the corresponded bitplane. The position of watermark image embedded in each bitplane is used to the watermarking key and executed in multiple lower bitplane which has no an influence on human visual recognition. Thus this algorithm can present watermark image to the multiple inherent patterns and needs small watermarking quantity. In the experiment, the author confirmed that it has high robustness against attacks of JPEG, MEDIAN and PSNR but it is weakness against attacks of NOISE, RNDDIST, ROT, SCALE, SS on spatial domain when a criterion PSNR of watermarked image is 40dB.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2319-2322
• /
• 2003

We propose ROI(region of interest) image coding application to still image using PSBS(partial significant bitplane shift)method combined with human face region detecting system. PSBS is an encoding algorithm for ROI image coding in JPEG2000, and takes advantages of both generic scaling based method and maximum shift method defined in JPEG2000. The Powerful advantages of PSBS are able to adjusting image quality in ROI and background flexibly, and support arbitrarily shaped ROI coding without coding the shape. In this letter, we show how to compress an image for human face region using PSBS method combined with human face region detecting system, and propose its application.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.678-683
• /
• 2009

A lot of researches [1] have been conducted on digital watermark embedding in brightness. A prerequisite for the digital watermark is that the image quality does not change even if the volume of the embedded information increases. Generally, the noise on complex images is perceived than the noise on fiat images. Thus, we present a method for watermarking an image by embedding complex areas by priority. The proposed method has achieved higher image quality of digital watermarking compared to other method that do not take into consideration the complexity of blocks, although the PSNR of the proposed method is lower than for a method not based on block complexity.

• 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.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.583-586
• /
• 2001

본 연구는 영상에서 이진영상을 얻기위하여 최적의 임계값 결정을 영상에 나타난 물체의 형상정보를 근거로한 비트평면 패턴을 이용한 최적 임계화 방법을 제안한다. 제안된 방법은 원영상의 윤곽정보를 가장 많이 포함하는 최상위 비트평면을 사용하여 영상을 중복되지 않는 두 영역으로 구분한 뒤, 두영역의 화소 밝기값의 평균값을 각 각 구하고 두 평균값 사이에서 임계값을 설정하는 전역 임계화 알고리즘이다. 제안된 방법의 타당성을 검토하기 위하여 표준영상을 가지고 N 개의 비트평면으로 분할 한 후, 비트평면에서 전체영상을 중복되지 않는 물체의 영역과 배경영역으로 나누어 영상의 밝기를 비교한후, 두 영역의 영상 밝기의 중간 값을 추하여 임계값으로 결정한 결과 전체영상의 밝기값 분포만을 분석한 결과 보다 원영상의 윤곽을 더 충실히 얻을 수 있었다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.594-597
• /
• 2002

In this paper we study the effects of transmission noise on fixed-length coded wavelet coefficients. We use a posteriori detectors which include inter-bitplane information and determine which transmitted codeword was most likely corrupted into a received erroneous codeword We present a simple method of recovering from these errors once detected and demonstrate our restoration methodology on scalar-quantized wavelet coefficients that have been transmitted across a binary symmetric channel.

• Journal of Broadcast Engineering
• /
• v.15 no.2
• /
• pp.232-235
• /
• 2010

This paper proposes an efficient depth-map coding method. The adaptive block-based depth-map coding method decides the number of bit planes to be encoded according to the quantization parameters to obtain the desired bit rates. So, the depth-map coding using the block-based decision of the bit-plane to be encoded proposes to free from the constraint of the quantization parameters. Simulation results show that the proposed method, in comparison with the adaptive block-based depth-map coding method, improves the average BD-rate savings by 3.5% and the average BD-PSNR gains by 0.25dB.

• Journal of Broadcast Engineering
• /
• v.16 no.1
• /
• pp.144-154
• /
• 2011

In this paper, we propose a parallel LDPCA encoding method for fast transform-domain Wyner-Ziv video encoding which is suitable in an ultra fast and low power video encoding. The conventional transform-domain Wyner-Ziv video encoding performs LDPCA channel coding of quantized transform coefficients in bitplane-serial fashion, which takes about 60% of total encoding time, and this computational complexity becomes severer as the bitrate increases. The proposed method binds several bitplanes into one packed message and carries out the LDPCA encoding in parallel. The proposed LDPCA encoding method improves the encoding speed by 8 ~ 55 times. In the experiment, the proposed Wyner-Ziv encoder can encode 700 ~ 2,300 QCIF size frames per second with GOP=64. The method can be applied to the pixel-domain Wyner-Ziv encoder using LDPCA, and has a wide scope of application.