Selective merging-based reference frame memory compression

Soongi Hong, Dahjung Chung, Yoonsik Choe

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Although IBDI, a coding tool that increases internal bit depth to improve compression performance for high quality video, is able to significantly improve the coding efficiency, the internal memory increment problem occurs because of the necessity of storing reference frames. Therefore, memory compression algorithm is proposed to solve the internal memory increment problem while maintaining the coding performance of IBDI. The memory compression methods have successively reduced the reference frame memory while preserving the coding efficiency by dividing a reference frame into the fixed size processing units and using additional information of each unit. However, additional information of each processing unit also has to be stored in internal frame memory; the amount of additional information could be a limitation of the effectiveness of memory compression scheme. Therefore, to relax this limitation of previous method, we propose a selective merging-based reference frame memory compression algorithm, dramatically reducing the amount of additional information. Simulation results show that the proposed algorithm provides much smaller overhead than that of the previous algorithm while keeping the coding efficiency of IBDI.

Original languageEnglish
Title of host publication2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM 2011
Pages896-900
Number of pages5
DOIs
Publication statusPublished - 2011 Oct 24
Event13th IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM 2011 - Victoria, BC, Canada
Duration: 2011 Aug 232011 Aug 26

Publication series

NameIEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings

Other

Other13th IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM 2011
CountryCanada
CityVictoria, BC
Period11/8/2311/8/26

Fingerprint

Merging
Data storage equipment
Processing

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Networks and Communications

Cite this

Hong, S., Chung, D., & Choe, Y. (2011). Selective merging-based reference frame memory compression. In 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM 2011 (pp. 896-900). [6033014] (IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings). https://doi.org/10.1109/PACRIM.2011.6033014
Hong, Soongi ; Chung, Dahjung ; Choe, Yoonsik. / Selective merging-based reference frame memory compression. 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM 2011. 2011. pp. 896-900 (IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings).
@inproceedings{b418e8dfa98b4d9c88f047b89885bcf7,
title = "Selective merging-based reference frame memory compression",
abstract = "Although IBDI, a coding tool that increases internal bit depth to improve compression performance for high quality video, is able to significantly improve the coding efficiency, the internal memory increment problem occurs because of the necessity of storing reference frames. Therefore, memory compression algorithm is proposed to solve the internal memory increment problem while maintaining the coding performance of IBDI. The memory compression methods have successively reduced the reference frame memory while preserving the coding efficiency by dividing a reference frame into the fixed size processing units and using additional information of each unit. However, additional information of each processing unit also has to be stored in internal frame memory; the amount of additional information could be a limitation of the effectiveness of memory compression scheme. Therefore, to relax this limitation of previous method, we propose a selective merging-based reference frame memory compression algorithm, dramatically reducing the amount of additional information. Simulation results show that the proposed algorithm provides much smaller overhead than that of the previous algorithm while keeping the coding efficiency of IBDI.",
author = "Soongi Hong and Dahjung Chung and Yoonsik Choe",
year = "2011",
month = "10",
day = "24",
doi = "10.1109/PACRIM.2011.6033014",
language = "English",
isbn = "9781457702518",
series = "IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings",
pages = "896--900",
booktitle = "2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM 2011",

}

Hong, S, Chung, D & Choe, Y 2011, Selective merging-based reference frame memory compression. in 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM 2011., 6033014, IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings, pp. 896-900, 13th IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM 2011, Victoria, BC, Canada, 11/8/23. https://doi.org/10.1109/PACRIM.2011.6033014

Selective merging-based reference frame memory compression. / Hong, Soongi; Chung, Dahjung; Choe, Yoonsik.

2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM 2011. 2011. p. 896-900 6033014 (IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Selective merging-based reference frame memory compression

AU - Hong, Soongi

AU - Chung, Dahjung

AU - Choe, Yoonsik

PY - 2011/10/24

Y1 - 2011/10/24

N2 - Although IBDI, a coding tool that increases internal bit depth to improve compression performance for high quality video, is able to significantly improve the coding efficiency, the internal memory increment problem occurs because of the necessity of storing reference frames. Therefore, memory compression algorithm is proposed to solve the internal memory increment problem while maintaining the coding performance of IBDI. The memory compression methods have successively reduced the reference frame memory while preserving the coding efficiency by dividing a reference frame into the fixed size processing units and using additional information of each unit. However, additional information of each processing unit also has to be stored in internal frame memory; the amount of additional information could be a limitation of the effectiveness of memory compression scheme. Therefore, to relax this limitation of previous method, we propose a selective merging-based reference frame memory compression algorithm, dramatically reducing the amount of additional information. Simulation results show that the proposed algorithm provides much smaller overhead than that of the previous algorithm while keeping the coding efficiency of IBDI.

AB - Although IBDI, a coding tool that increases internal bit depth to improve compression performance for high quality video, is able to significantly improve the coding efficiency, the internal memory increment problem occurs because of the necessity of storing reference frames. Therefore, memory compression algorithm is proposed to solve the internal memory increment problem while maintaining the coding performance of IBDI. The memory compression methods have successively reduced the reference frame memory while preserving the coding efficiency by dividing a reference frame into the fixed size processing units and using additional information of each unit. However, additional information of each processing unit also has to be stored in internal frame memory; the amount of additional information could be a limitation of the effectiveness of memory compression scheme. Therefore, to relax this limitation of previous method, we propose a selective merging-based reference frame memory compression algorithm, dramatically reducing the amount of additional information. Simulation results show that the proposed algorithm provides much smaller overhead than that of the previous algorithm while keeping the coding efficiency of IBDI.

UR - http://www.scopus.com/inward/record.url?scp=80054730139&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80054730139&partnerID=8YFLogxK

U2 - 10.1109/PACRIM.2011.6033014

DO - 10.1109/PACRIM.2011.6033014

M3 - Conference contribution

SN - 9781457702518

T3 - IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings

SP - 896

EP - 900

BT - 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM 2011

ER -

Hong S, Chung D, Choe Y. Selective merging-based reference frame memory compression. In 2011 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM 2011. 2011. p. 896-900. 6033014. (IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings). https://doi.org/10.1109/PACRIM.2011.6033014