Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings[Type 1 Only]
IEICE Technical Committee Submission System
Conference Paper's Information
Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2011-03-04 09:00
An improved PPM* Algorithm based on the Minimal Expected Codeword Length and Switching Escape Probability Estimation
Keita Tomokuni, Hirosuke Yamamoto (Univ. of Tokyo) IT2010-104 ISEC2010-108 WBS2010-83
Abstract (in Japanese) (See Japanese page) 
(in English) For the PPM data compression algorithm, several methods have been proposed to estimate the ESC probability, where ESC represents the occurrence of a new symbol at a node in the suffix tree used in the PPM. However, the estimated ESC probability is often deviated from the actual frequencies of ESC, and this deviation worsens the compression rate of the PPM. In this paper, we propose a new method to estimate the ESC probability. We show by Calgary, Canterbury, and Large Corpuses that the estimation method of PPMX is a good estimator when a node in the suffix tree has many child nodes, but the estimated ESC probability is much lower than the actual frequency when a node has a few child nodes. So, in our method, the ESC probability is estimated by switching the original and our modified estimation methods of PPMX based on the number of child nodes at each node. By combining this ESC probability estimation method and a variant of PPM, in which a coding context is determined based on the minimum expected codeword length, we show by the evaluation of compression rate for the corpuses that the proposed PPM can beat the PPMZ, which was the best variant in the family of PPM.
Keyword (in Japanese) (See Japanese page) 
(in English) PPM / escape probability / data compression / suffix tree / arithmetic coding / / /  
Reference Info. IEICE Tech. Rep., vol. 110, no. 442, IT2010-104, pp. 235-242, March 2011.
Paper # IT2010-104 
Date of Issue 2011-02-24 (IT, ISEC, WBS) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
Copyright
and
reproduction
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF IT2010-104 ISEC2010-108 WBS2010-83

Conference Information
Committee ISEC IT WBS  
Conference Date 2011-03-03 - 2011-03-04 
Place (in Japanese) (See Japanese page) 
Place (in English) Osaka University 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To IT 
Conference Code 2011-03-ISEC-IT-WBS 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) An improved PPM* Algorithm based on the Minimal Expected Codeword Length and Switching Escape Probability Estimation 
Sub Title (in English)  
Keyword(1) PPM  
Keyword(2) escape probability  
Keyword(3) data compression  
Keyword(4) suffix tree  
Keyword(5) arithmetic coding  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Keita Tomokuni  
1st Author's Affiliation The University of Tokyo (Univ. of Tokyo)
2nd Author's Name Hirosuke Yamamoto  
2nd Author's Affiliation The University of Tokyo (Univ. of Tokyo)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2011-03-04 09:00:00 
Presentation Time 25 minutes 
Registration for IT 
Paper # IT2010-104, ISEC2010-108, WBS2010-83 
Volume (vol) vol.110 
Number (no) no.442(IT), no.443(ISEC), no.444(WBS) 
Page pp.235-242 
#Pages 8 
Date of Issue 2011-02-24 (IT, ISEC, WBS) 


[Return to Top Page]

[Return to IEICE Web Page]

(Line Height for English Pages: 1)

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan