A Method for Graph Compression

Hai Tang Wang

doi:10.4028/www.scientific.net/AMR.662.871

Paper Titles

Design of the Approved Low Power Energy Recovery Logic Circuit
p.851

Dynamic Observer-Based H_∞ Control for Networked Control Systems in Multiple-Packet Transmission with Random Delays
p.856

Design of Information Acquisition and Transmission System Based on Arm for Disaster Rescue
p.860

Inter-Harmonics Analysis Based on the STFT Applied to the Power System
p.864

A Method for Graph Compression
p.871

A Vehicle License Plate Location Method Based on the Mixed Programming between VC++ and Matlab
p.875

Design and Realization of Auto-Programming System for SLS on CAD
p.879

Research on Encryption Algorithm Based on the Chebyshev Neural Network
p.884

Minimum Zone Evaluation of Symmetry Error for Flatness to Flatness Based on the New Generation GPS
p.887

HomeAdvanced Materials ResearchAdvanced Materials Research Vol. 662A Method for Graph Compression

A Method for Graph Compression

Abstract:

Image compression principle is to ensure a certain degree of image quality in the premise, a mathematical calculation method of the amount of data of the image to minimize. In order to more save memory space and more be used as a compressed representation of a image, a image is mapped into a graph, we give a new method for graph compression.

You might also be interested in these eBooks

Nanotechnology and Precision Engineering

View Preview

Info:

Periodical:

Advanced Materials Research (Volume 662)

Pages:

871-874

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.662.871

Citation:

Cite this paper

Online since:

February 2013

Authors:

Hai Tang Wang

Keywords:

Graph, Image Compression, Information Processing, Labeling

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Ingrid Daubechies, Wim Sweldens. Factoring wavelet transforms into lifting steps[J] , (1998).

DOI: 10.1007/bfb0011095

Google Scholar

[2] A Said , W. A Pearlman . A new fast and efficient image codec based on set partitioning in hierarchical trees[J]. IEEE Trans. on Circuits and Systems for Video Tech 1996, 6(3) pp.243-250.

DOI: 10.1109/76.499834

Google Scholar

[3] W. He, X. Yu, H. Mi, Y. Xu, Y. Sheng, L. Wang, The (integral) sum number of Discrete Math. 2002, pp.241-252.

DOI: 10.1016/s0012-365x(01)00218-7

Google Scholar

[4] S. Liaw, D. Kuo, G.J. Chang, Integral sum numbers of graphs, Ars Combinatoria. 2000, pp.259-268.

Google Scholar

[5] L.S. Melnikov, A.V. Pyatkin, Regular integral sum graphs, Discrete Math. 2002, pp.237-245.

DOI: 10.1016/s0012-365x(01)00426-5

Google Scholar

[6] M. Sutton, M. Miller, On the sum number of wheels, Discrete Math. 2001, pp.185-188.

Google Scholar