현재 위치
Home
A New Lossless Image Compression Technique Based on Bose, Chandhuri and Hocquengham (BCH) Codes
-
- 발행기관
- 보안공학연구지원센터(IJSEIA) 바로가기
-
- 간행물
- International Journal of Software Engineering and Its Applications SCOPUS 바로가기
-
- 통권
- Vol.5 No.3 (2011.07)바로가기
-
- 페이지
- pp.15-22
-
- 저자
-
- 언어
- 영어(ENG)
-
- URL
- https://www.earticle.net/Article/A153605
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
원문정보
초록
- 영어
- A new binary (bit-level) lossless image compression method based on a well-known error correcting BCH codes has been introduced in this paper. The BCH encoder converts the message of k bits to a codeword of length n by adding 3 parity bits. In contrast the decoder eliminates these parity bits after verifying the received message; therefore, the proposed method utilizes this idea by dividing the image into blocks of size 7 bits. These blocks entered to the BCH decoder who eliminates the parity bits. This reduces the block size to 4 bits. The output will be in two folds first the compressed image file and the second a file contains the keys. Each block is tested to find if it is a valid block or not (valid / non-valid codeword). In order to distinguish between them during the decompression process, the proposed method adds 1 for the valid codeword and 0 for the invalid codeword and saved in another file to be the key that used in the decoding stage. We then implement the Huffman codes on the compressed file to increase the compression ratio. On the other hand, two different algorithms are implemented into the added bit file (keys) to reduce the file size. The RLE encoding algorithm is the first one, and the results were entered into the second compression round using the Huffman algorithm. The file is then attached to the header of the compressed image file. This proposed method reduces the entropy of the generated binary sequence so that it grants higher compression ratio. The experimental results show that the compression algorithm is efficient and gives a good compression ratio without losing data. The using of BCH code improves the results of Huffman in terms of increasing compression ratio.
목차
Abstract
1. Introduction
2. Related Works
3. The Proposed Method
3.1. Compression Steps
3.2. Decompression Steps
4. Results
5. Conclusion
References
키워드
image compression BCH codes RLE algorithm parity check Huffman algorithm저자
간행물 정보
발행기관
-
- 발행기관명
- 보안공학연구지원센터(IJSEIA) [Science & Engineering Research Support Center, Republic of Korea(IJSEIA)]
- 설립연도
- 2006
- 분야
- 공학>컴퓨터학
- 소개
- 1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업
간행물
-
- 간행물명
- International Journal of Software Engineering and Its Applications
- 간기
- 월간
- pISSN
- 1738-9984
- 수록기간
- 2008~2016
- 등재여부
- SCOPUS
- 십진분류
- KDC 505 DDC 605
이 권호 내 다른 논문 / International Journal of Software Engineering and Its Applications Vol.5 No.3
피인용수 : 0건 (자료제공 : 네이버학술정보)
함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.
출처 : 네이버학술정보
0개의 논문이 장바구니에 담겼습니다.