A Quadsection Algorithm for Grammar-Based Image Compression
スポンサーリンク
概要
- 論文の詳細を見る
For the purpose of text compression, grammar-based compression, which is to find a small grammar that generates a given data, has been well-studied. In this technical report, we apply this methodology to compression of rectangular image data. We first define a context-free rectangular image grammar (CFRIG) by extending the context-free grammar. Then we propose a quadsection type algorithm by extending a bisection type algorithm for grammar-based compression of text data. We show that our proposed algorithm approximates in polynomial time the smallest CFRIG within a factor of O(n4/3), where an input image data is of size O(n) × O(n). We also present results on computational experiments on the proposed algorithm.
- 一般社団法人情報処理学会の論文
- 2010-05-14
著者
-
Tatsuya Akutsu
Bioinformatics Center, Institute for Chemical Research, Kyoto University
-
Morihiro Hayashida
Bioinformatics Center Institute For Chemical Research Kyoto University
-
Peiying Ruan
Bioinformatics Center, Institute for Chemical Research, Kyoto University
-
Peiying Ruan
Bioinformatics Center Institute For Chemical Research Kyoto University
-
Tatsuya Akutsu
Bioinformatics Center Institute For Chemical Research Kyoto University
関連論文
- Prediction of Protein Folding Rates from Structural Topology and Complex Network Properties
- Prediction of Protein Folding Rates from Structural Topology and Complex Network Properties
- RNA-RNA Interaction Prediction Using Integer Programming with Threshold Cut
- A Quadsection Algorithm for Grammar-Based Image Compression
- Analyses and Algorithms for Predecessor and Control Problems for Boolean Networks of Bounded Indegree
- Conditional Random Field Approach to Prediction of Protein-protein Interactions Using Domain Information
- Integer Programming and Dynamic Programming-based Methods of Optimizing Control Policy in Probabilistic Boolean Networks with Hard Constraints
- An Improved Clique-Based Method for Computing Edit Distance between Rooted Unordered Trees
- Prediction of protein residue contacts using discriminative random field
- Prediction of protein residue contacts using discriminative random field
- Efficient Computation of Impact Degrees for Multiple Reactions in Metabolic Networks with Cycles
- Prediction of RNA Secondary Structures with Binding Sites Using Dynamic Programming Algorithm
- Message from the Editor-in-Chief
- Message from the Editor-in-Chief
- Message from the Editor-in-Chief
- Protein complex prediction via improved verification methods using constrained domain-domain matching
- Predicting Protein-RNA Residue-base Contacts Using Two-dimensional Conditional Random Field
- Finding Conserved Regions in Protein Structures Using Support Vector Machines and Structure Alignment
- Inferring Strengths of Protein-Protein Interactions Using Support Vector Regression
- Evaluating Effectiveness of Accessibility to Infer RNA-RNA Interactions
- Survival Analysis by Penalized Regression and Matrix Factorization
- A Dominating Set Approach to Structural Controllability of Unidirectional Bipartite Networks
- Prediction of Heterodimeric Protein Complexes from Weighted Protein-Protein Interaction Networks Using Novel Features and Kernel Functions
- Prediction of Heterodimeric Protein Complexes from Weighted Protein-Protein Interaction Networks Using Novel Features and Kernel Functions
- Breadth-first Search Approach to Enumeration of Tree-like Chemical Compounds
- Breadth-first Search Approach to Enumeration of Tree-like Chemical Compounds
- Algorithms for Finding a Largest Common Subtree of Bounded Degree
- Parallelization of Enumerating Tree-like Chemical Compounds by Breadth-first Search Order
- Prediction of Heterotrimeric Protein Complexes by Two-phase Learning Using Neighboring Kernels
- Prediction of Heterotrimeric Protein Complexes by Two-phase Learning Using Neighboring Kernels
- Grammar-based Compression for Multiple Trees Using Integer Programming
- Grammar-based Compression for Multiple Trees Using Integer Programming