• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10b
• /
• pp.281-283
• /
• 2000

본 논문은 EBCOT 알고리즘의 소개와 개선 방법을 제안한다. EBCOT 알고리즘은 웨이블릿 변환과 블록기반 bit-plane 부호화 방법을 활용한 알고리즘이다. EBCOT에서 사용하는 bit-plane 부호화 방법을 블록기반 fractional bit-plane 방법이라고 한다. 이 방법은 bit-plane 전체를 한번에 부호화하는 것이 아니라 블록으로 나누어 부호화를 수행하고 또한 하나의 bit-plane에 대하여서도 4번의 pass를 거치면서 bit의 context에 따라서 부호화를 수행한다. EBCOT는 웨이블릿 변환에 의하여 resolution 스케일러빌리티를 지원하고 fractional bit-plane 부호화에 의하여 SNR 스케일러빌리티를 지원하며 블록기반 부호화에 의하여 ROI에 대한 random 접근 기능을 지원한다. 그리고 EBCOT는 부호화가 완료된 다음에 bit reduction 과정을 수행한다. 이러한 특징들은 이전의 EZW나 SPIHT 방법에 비하여 장점들이라고 할 수 있다. 그러나 bit-plane 부호화를 수행하는 과정에서 효율을 개선할 수 있으며 본 논문은 이에 대한 방법을 제안한다.

• Proceedings of the IEEK Conference
• /
• 2003.11b
• /
• pp.157-160
• /
• 2003

Recently, several steganographic algorithms for two-color binary images have been proposed. In this paper, we propose a steganographic algorithm which embeds a secret message into bitmap images and palette-based images. To embed a message, the suggested algorithm divides a bitmap image into bit-plane images from LSB-plane to MSB-plane for each pixel, and considers each bit-plane image as a binary one. The algorithm splits each bit-plane image into m$\times$n blocks. and embeds a r-bit(r=[log$_2$(mn+1]-1) message into the block. And our schemes embed a message to every bit-plane from LSB to MSB to maximize the amount of embedded message and to minimize the degradation. The schemes change at most two pixels in each block. Therefore, the maximal color changes of the new algorithm are much smaller than other bit-plane embedding schemes' such as the substantial substitution schemes.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.1
• /
• pp.146-150
• /
• 2009

Nowdays needs the new still image compression standard. JPEG2000 has been developed. JPEG2000 divide DWT and EBCOT. EBCOT is consisted of Bit Plane Coding and ARithmetic Coding algorithm. In this paper, we proposed BPC algorithm that is efficient context-based generation. Proposed BPC Algorithm forecasted coding pass using SigStage, column, mpass value. BPC designed using Verilog HDL. H/W implemenates using Xillinx FPGA technology.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.6
• /
• pp.1471-1481
• /
• 1998

In this paper, we propose a new digital image stabilization scheme based on the bit-plane matching. In the proposed algorithm, the conventional motion estimation algorithms are applied to the binary images extracted from the bit-plane images. It is shown that the computational complexity of the proposed algorithm can be significantly reduced by replacing the arithmetic calculations with the binary Boolean functions, while the accuracy of motion estimation is maintained. Furthermore, an adaptive algorithm for selecting a bit-plane in consideration of changes in external illumination can provide the robustness of the proposed algorithm. We compared the proposed algorithm with existing algorithms using root mean square error (RMSE) on the basis of the brute-force method, and proved experimentally that the proposed method detects the camera motion more accurately than existing algorithms. In addition, the proposed algorithm performs digital image stabilization with less computation.

• Journal of Korea Multimedia Society
• /
• v.8 no.7
• /
• pp.961-973
• /
• 2005

In this paper, we proposed an adaptive steganography of color image using bit-planes and multichannel characteristics. Applying fixing threshold, if we insert information into all bit-planes of RGB channel, each channels showed different image quality. Therefore, we first defined the channel weight and the bit-plane weight to solve the fixing threshold problem of BPCS (bit-plane complexity steganography) method. We then proposed a new adaptive threshold method using the bit-plane weight of channels and the bit-plane complexity of cover image to increase insertion capacity adaptively In the experiment, we inserted information into the color images with the same image quality and same insertion capacity, and we analyzed the Insertion capacity and image quality. As a result, the proposed method increased the insertion capacity and improved the image quality than BPCS method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.124-126
• /
• 2021

In this study, fundus images were analyzed using an image processing algorithm for diagnosis of diabetic retinopathy, and specific areas such as hard exudate and retinal hemorrhage, which are characteristic of diabetic retinopathy disease using the bit plane technique, were extracted. We propose a system capable of automatic diagnosis by quantifying the characteristics of diabetic retinopathy based on the analyzed fundus image.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.4
• /
• pp.684-690
• /
• 2009

In this paper, we proposed a new method of the steganography based on bit plane using similarity. Applying a fixed threshold, the insert information into all bit planes showed different image quality. Therefore, we first defined the bit plane of block similarity to solve the fixing threshold problem. We then proposed a new method using the Bit Plane complexity and similarity to insert information into bit planes of block. In the experiment, we inserted information into the standard images with the same image quality and same insertion capacity. Finally analyzed the insertion capacity and image quality. As a result, the proposed method increased the insertion capacity of about 6% and improved the image quality of about 3.3dB than fixing threshold method.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.403-406
• /
• 1999

Among the compression methods of moving picture information, a motion estimation method is used to remove time-repeating. The Block Matching Algorithm in motion estimation methods is the commonest one. In recent days, it is required the more advanced high quality in many image processing fields, for example HDTV, etc. Therefore, we have to accomplish not by means of Partial Search Algorithm, but by means of Full Search Algorithm in Block Matching Algorithm. In this paper, it is suggested a structure that reduce total calculation quantity and size, because the structure using Bit Plane select and use only 3bit of 8bit luminance signal.

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

• The Journal of the Acoustical Society of Korea
• /
• v.27 no.1
• /
• pp.18-25
• /
• 2008

In this paper, new lossless coding method of spectral coefficients for audio codec is proposed. Conventional lossless coder uses Huffman coding utilizing the statistical characteristics of spectral coefficients, but does not provide the high coding efficiency due to its simple structure. To solve this limitation, new lossless coding scheme with better performance is proposed that consists of bit-plane transform and run-length coding. In the proposed scheme, the spectral coefficients are first transformed by bit-plane into 1-D bit-stream with better correlative properties, which is then coded intorun-length and is finally Huffman coded. In addition, the coding performance is further increased by applying the proposed bit-plane coding selectively to each group, after the entire frequency is divided into 3 groups. The performance of proposed coding scheme is measured in terms of theoretical number of bits based on the entropy, and shows at most 6% enhancement compared to that of conventional lossless coder used in AAC audio codec.