Most includeding techniques of digital watermark even now working through the direct inclusion in the pixel without taking into account the level of compression (attack) that can go wrong, which makes digital watermark can be discarded easily. In this research, a method was proposed to overcome this problem, which is based on DCT (after image partitioned into non overlapped blocks with size 8×8 pixel), accompanied by a quantization method. The watermark (digital image) is embedded in DCT frequency domain seeking the blocks have highest standard deviation (the checking is only on the AC coefficients) within a predetermined threshold value, then the covered image will compressed (attacked) varying degrees of compression. The suggested met

The gaps and cracks in an image result from different reasons and affect the images. There are various methods concerning gaps replenishment along with serious efforts and proposed methodologies to eliminate cracks in diverse tendencies. In the current research work a color image white crack in-painting system has been introduced. The proposed inpainting system involved on two algorithms. They are Linear Gaps Filling (LGF) and the Circular Gaps Filling (CGF). The quality of output image depends on several effects such as: pixels tone, the number of pixels in the cracked area and neighborhood of cracked area and the resolution the image. The quality of the output images of two methods (linear method: average Peak Signal to Noise Ratio (PS

      In this paper an algorithm for Steganography using DCT for cover image and DWT for hidden image with an embedding order key is proposed. For more security and complexity the cover image convert from RGB to YIQ, Y plane is used and divided into four equally parts and then converted to DCT domain. The four coefficient of the DWT of the hidden image are embedded into each part of cover DCT, the embedding order based on the order key of which is stored with cover in a database table in both the sender and receiver sender. Experimental results show that the proposed algorithm gets successful hiding information into the cover image. We use Microsoft Office Access 2003 database as DBMS, the hiding, extracting algo

In the current research work, a method to reduce the color levels of the pixels within digital images was proposed. The recent strategy was based on self organization map neural network method (SOM). The efficiency of recent method was compared with the well known logarithmic methods like Floyd-Steinberg (Halftone) dithering and Octtrees (Quadtrees) methods. Experimental results have shown that by adjusting the sampling factor can produce higher-quality images with no much longer run times, or some better quality with shorter running times than existing methods. This observation refutes the repeated neural networks is necessarily slow but have best results. The generated quantization map can be exploited for color image compression, clas

     We will provide a new method in this study that integrates two types of applications, namely Graph Theory and Conjugate Young Diagram, the idea of combining the graph and the Young diagram is presented by Ali And Mahmood, which is primarily based on the idea of the e-abacus diagram, the new method is called GCYD, it directly applies to the English letter section, which will be a two-layer coding. It makes it difficult to detect the word or sentence.

WA Shukur, journal of the college of basic education, 2011 The aim of this research is designing and implementing proposed steganographic method. The proposed steganographic method don’t use a specific type of digital media as a cover but it can use all types of digital media such as audio, all types of images, video and all types of files as a cover with the same of security, accuracy and quality of original data, considering that the size of embedded data must be smaller than the size of a cover. The proposed steganographic method hides embedded data at digital media without any changing and affecting the quality of the cover data. This means, the difference rate between cover before hiding operation and stego is zero. The proposed steg

TI1e Web service securi ty challenge is to understand  and  assess the risk  involved  in securing  a web-based  service  today, based on our existing security technology, and at the same time tmck emerging standards and  understand  how they will be used  to offset the risk in

new web services. Any  security model must  i llustrate  how data  can

now  through   an  application   and   network   topology  to  meet  the

requirements  defined  by the busi ness  wi thout exposing  the data  to undue  risk.  In this paper  we propose &n

The aim of this paper is to propose an efficient three steps iterative method for finding the zeros of the nonlinear equation f(x)=0 . Starting with a suitably chosen , the method generates a sequence of iterates converging to the root. The convergence analysis is proved to establish its five order of convergence. Several examples are given to illustrate the efficiency of the proposed new method and its comparison with other methods.

A numerical method (F.E.)was derived for incompressible viscoelastic materials, the aging and
environmental phenomena especially the temperature effect was considered in this method. A
treatment of incompressibility was made for all permissible values of poisons ratio. A
mechanical model represents the incompressible viscoelastic materials and so the properties can
be derived using the Laplace transformations technique .A comparison was made with the other
methods interested with viscoelastic materials by applying the method on a cylinder of viscoelastic material surrounding by a steel casing and subjected to a constant internal pressure, as well as a comparison with another viscoelastic method and for Asphalt Concrete pro

     Estimating multivariate location and scatter with both affine equivariance and positive break down has always been difficult. Awell-known estimator which satisfies both properties is the Minimum volume Ellipsoid Estimator (MVE) Computing the exact (MVE) is often not feasible, so one usually resorts to an approximate Algorithm. In the regression setup, algorithm for positive-break down estimators like Least Median of squares typically recomputed the intercept at each step, to improve the result. This approach is called intercept adjustment. In this paper we show that a similar technique, called location adjustment, Can be applied to the (MVE). For this purpose we use the Minimum Volume Ball (MVB). In order