Design Of Fast Algorithm And Application In Digital Watermarking About A Set Of Nosinusoidal Family Orthogonal Transforms

We have got research fruit full of value about Nonsinusoidl Family Orthogonal Transforms not only in theory but also in application in the past few years. but there is something worthy of our further research. It is always espected to take as little as time to finish science computation, and it is key to ameliorate algorithm in the condition of other cases defined. In order to increase efficiency we give vector algorithm which is easy to be comprehended and easy to be extended in the point of matrix according to the character of a set of nosinusoidal family orthogonal matrix in this paper. Comparing to traditional algorithm this algorithm is simpler in design, but more evident in effect. It is fit to Walsh transforms as well as Haar,Slant,Slant Haar transforms and so on, it is not only in-place algorithm but also is especially fit to parallel computation. If it is peformerded on parallel computer, load on every computer will decease greatly. Morver,load on every computer is so same and so balanced that controlling dictate is same completely, which will need only one piece of controlling dictate and save much computation time. Even to bunch computation this vector algorithm will decrease assistant operation such as exchanging order. On the other hand we extend predecessor's work and get usual cases about W ordered shift-copy generaled bridge transform matrix in the point of matrix by the way of recursive evoloving in this paper and get its fast algorithm, perfecting predecessor's work. Theory boils down to application,it is our fudamental aim to apply theory to reality. With the coming of informational and digital era, the problem of information safety is becoming more and more obvious, Nonsinusoidl Family Orthogonal Transforms have important application in this new field . So we think in the point of the image compress , imbedding and distill of digital watermarking , using Haar type orthogonal transforms in digital watermarking by the technique of dividing and rule according to the character of Haar type orthogonal matrix and the image in this paper, namely, size of subblocks is not all the same with the same rigion , fast transforms adopt are not all the same even to subblocks with the same size either. Both the theory analysis and experimental results show that the proposed watermark technique is not only invisual to the image but also robust to attack, At the same time, the method has high compression ratio which is favourable to image transfonmation and fast computation which is favourable to real time process. Moreover, it is the most meaningful and practical that the image only having two values is taken as blind watermarking which needn't original image when distilled.