DocumentCode
3326261
Title
Binary image scrambling evaluation method based on the mean square deviation and the bipartite graph
Author
Ai-Ying, Fu ; Qing-Wei, Zeng ; Zhi-Hai, Xu ; Geng-Sheng, Deng
Author_Institution
Network Center, Nanchang Univ., Nanchang, China
Volume
1
fYear
2010
fDate
5-7 May 2010
Firstpage
237
Lastpage
239
Abstract
Wide and even distribution of pixels is the main parameter to evaluate the scrambling degree of the binary image. An evaluation method for the scrambling degree of the binary image is put forward by quoting the concepts of the bipartite graph and its degree along with applying the characteristic which the variance and mean square deviation can measure the discrete degree of nodes according to the pixels characteristic of the binary image. This method consists of dividing the image into the same size blocks, constructing the bipartite graph of every block, calculating its degree, building up a real sequence, analyzing the discrete degree of the sequence by applying the variance and mean square deviation, and, finally, deciding the scrambling degree of the binary image.
Keywords
graph theory; image coding; mean square error methods; watermarking; binary image scrambling evaluation method; bipartite graph; discrete degree; mean square deviation; pixels characteristic; Automatic control; Automation; Bipartite graph; Communication system control; Computer networks; Copyright protection; Distributed computing; Image analysis; Image sequence analysis; Pixel; binary image; bipartite graph; degree; mean square deviation; scrambling degree;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Communication Control and Automation (3CA), 2010 International Symposium on
Conference_Location
Tainan
Print_ISBN
978-1-4244-5565-2
Type
conf
DOI
10.1109/3CA.2010.5533841
Filename
5533841
Link To Document