A representation method using the non-symmetry and anti-packing model (NAM) for data compression of binary images is presented. The NAM representation algorithm is compared with the popular linear quadtree and run l...A representation method using the non-symmetry and anti-packing model (NAM) for data compression of binary images is presented. The NAM representation algorithm is compared with the popular linear quadtree and run length encoding algorithms. Theoretical and experimental results show that the algorithm has a higher compression ratio for both Iossy and Iossless cases of binary images and better reconstructed quality for the Iossy case.展开更多
We propose a novel binary image representation algorithm using the non-symmetry and anti-packing model and the coordinate encoding procedure (NAMCEP). By tak- ing some idiomatic standard binary images in the field o...We propose a novel binary image representation algorithm using the non-symmetry and anti-packing model and the coordinate encoding procedure (NAMCEP). By tak- ing some idiomatic standard binary images in the field of image processing as typical test objects, and by comparing our proposed NAMCEP representation with linear quadtree (LQT), binary tree (Bintree), non-symmetry and anti-packing model (NAM) with K-lines (NAMK), and NAM representa- tions, we show that NAMCEP can not only reduce the aver- age node, but also simultaneously improve the average com- pression. We also present a novel NAMCEP-based algorithm for area calculation and show experimentally that our algo- rithm offers significant improvements.展开更多
Based on detailed analysis of advantages and disadvantages of the existing connected-component labeling (CCL) algorithm,a new algorithm for binary connected components labeling based on run-length encoding (RLE) a...Based on detailed analysis of advantages and disadvantages of the existing connected-component labeling (CCL) algorithm,a new algorithm for binary connected components labeling based on run-length encoding (RLE) and union-find sets has been put forward.The new algorithm uses RLE as the basic processing unit,converts the label merging of connected RLE into sets grouping in accordance with equivalence relation,and uses the union-find sets which is the realization method of sets grouping to solve the label merging of connected RLE.And the label merging procedure has been optimized:the union operation has been modified by adding the "weighted rule" to avoid getting a degenerated-tree,and the "path compression" has been adopted when implementing the find operation,then the time complexity of label merging is O(nα(n)).The experiments show that the new algorithm can label the connected components of any shapes very quickly and exactly,save more memory,and facilitate the subsequent image analysis.展开更多
基金Supported by the National High-Tech Research and Development (863) Program of China (No. 2006AA04Z211)
文摘A representation method using the non-symmetry and anti-packing model (NAM) for data compression of binary images is presented. The NAM representation algorithm is compared with the popular linear quadtree and run length encoding algorithms. Theoretical and experimental results show that the algorithm has a higher compression ratio for both Iossy and Iossless cases of binary images and better reconstructed quality for the Iossy case.
基金We thank the anonymous reviewers and editors for their valuable comments on improving this paper. This work was supported by the National Natural Science Foundation of China (Grant No. 61300134), the Research Fund for the Doctoral Program of Higher Education of China (20120172120036), the Natural Science Foundation of Guangdong Province of China (S2011040005815 and S2013010012515), the Foundation for Dis- tinguished Young Talents in Higher Education of Guangdong of China (LYM11015), and the Fundamental Research Funds for the Central Universities of China (2011ZM0074 and 2013ZZ0050).
文摘We propose a novel binary image representation algorithm using the non-symmetry and anti-packing model and the coordinate encoding procedure (NAMCEP). By tak- ing some idiomatic standard binary images in the field of image processing as typical test objects, and by comparing our proposed NAMCEP representation with linear quadtree (LQT), binary tree (Bintree), non-symmetry and anti-packing model (NAM) with K-lines (NAMK), and NAM representa- tions, we show that NAMCEP can not only reduce the aver- age node, but also simultaneously improve the average com- pression. We also present a novel NAMCEP-based algorithm for area calculation and show experimentally that our algo- rithm offers significant improvements.
文摘Based on detailed analysis of advantages and disadvantages of the existing connected-component labeling (CCL) algorithm,a new algorithm for binary connected components labeling based on run-length encoding (RLE) and union-find sets has been put forward.The new algorithm uses RLE as the basic processing unit,converts the label merging of connected RLE into sets grouping in accordance with equivalence relation,and uses the union-find sets which is the realization method of sets grouping to solve the label merging of connected RLE.And the label merging procedure has been optimized:the union operation has been modified by adding the "weighted rule" to avoid getting a degenerated-tree,and the "path compression" has been adopted when implementing the find operation,then the time complexity of label merging is O(nα(n)).The experiments show that the new algorithm can label the connected components of any shapes very quickly and exactly,save more memory,and facilitate the subsequent image analysis.