TY - GEN
T1 - A block-based still image coder for parallel computing
AU - Wang, Yu Lin
AU - Liao, Chia Te
AU - Su, Alvin W.Y.
PY - 2012
Y1 - 2012
N2 - The coding efficiency of a still image coder is dominated by the complexity of the encoding algorithm. For the past decade, it was seen that the encoding quality was gradually limited. Hence, the issue of coding speed becomes popular in recent researches. This paper proposes a block-based image coder which is applicable for parallel computing. The proposed coder improves the coding quality of combined significant map coding (CSMC), and shortens the encoding time dramatically. From the simulation results, the proposed method has comparable coding quality against the most well-known coders. The coding quality is not affected by the number of participants, so it is also suitable to be applied in cloud computing. Besides, the proposed block-based image coder preserves the property of high scalability and availability. We conclude that our proposed coder enabled by parallel computing has a great advantage of fitting with the increasing complexity of computation.
AB - The coding efficiency of a still image coder is dominated by the complexity of the encoding algorithm. For the past decade, it was seen that the encoding quality was gradually limited. Hence, the issue of coding speed becomes popular in recent researches. This paper proposes a block-based image coder which is applicable for parallel computing. The proposed coder improves the coding quality of combined significant map coding (CSMC), and shortens the encoding time dramatically. From the simulation results, the proposed method has comparable coding quality against the most well-known coders. The coding quality is not affected by the number of participants, so it is also suitable to be applied in cloud computing. Besides, the proposed block-based image coder preserves the property of high scalability and availability. We conclude that our proposed coder enabled by parallel computing has a great advantage of fitting with the increasing complexity of computation.
UR - http://www.scopus.com/inward/record.url?scp=84868088157&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84868088157&partnerID=8YFLogxK
U2 - 10.1109/TrustCom.2012.17
DO - 10.1109/TrustCom.2012.17
M3 - Conference contribution
AN - SCOPUS:84868088157
SN - 9780769547459
T3 - Proc. of the 11th IEEE Int. Conference on Trust, Security and Privacy in Computing and Communications, TrustCom-2012 - 11th IEEE Int. Conference on Ubiquitous Computing and Communications, IUCC-2012
SP - 1461
EP - 1468
BT - Proc. of the 11th IEEE Int. Conference on Trust, Security and Privacy in Computing and Communications, TrustCom-2012 - 11th IEEE Int. Conference on Ubiquitous Computing and Communications, IUCC-2012
T2 - 11th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom-2012
Y2 - 25 June 2012 through 27 June 2012
ER -