Loading...
Search for: image-watermarking
0.008 seconds
Total 41 records

    Image Steganalysis Based on Feature Optimization Using Evolutionary Algorithms

    , M.Sc. Thesis Sharif University of Technology Karandish, Mohammad Ali (Author) ; Ghaemmaghami, Shahrokh (Supervisor)
    Abstract
    Image steganalysis is the technique and art of detecting covert communication via images.Reduction of features dimentionality is an important issue according to accuracy and time complexity. In this thesis, GA (genetic algorithm) and PSO (Particle Swarm Optimization) are used to reduce the dimentionality of JRM, a recently proposed feature set containing 11255 features which looks high dimentional compared to other feature sets which has been reduced by evolutionary algorithms so far. So, inspite of other works done using evolutionary algorithms in this field, we use the class sepearability criterion as fitness function instead of the accuracy of the classifier. Investigating these features,... 

    Image Steganography Resistant Against Higher Order statistical Attacks

    , M.Sc. Thesis Sharif University of Technology Mohsenzadeh, Yalda (Author) ; Ghaemmaghami, Shahrokh (Supervisor) ; Mohajeri, Javad (Supervisor)
    Abstract
    A major goal in image steganography is to preserve the statistical properties of the host image to thwart statistical based steganalysis. However, most steganography methods introduce some distortions into the host signal’s statistical properties that have been used, as a certain indication of manipulation of the signal, by steganalysis algorithms. In order to overcome such a methodical vulnerability, a new generation of data hiding algorithms has been proposed in the literature to preserve histogram of the host signal. In this thesis we present a novel image steganographic technique to preserve one-dimensional and two-dimensional histograms of the host image. Experimental results show that... 

    Some Applications of Singular Values Decomposition in Image Processing

    , M.Sc. Thesis Sharif University of Technology Ghobadi Ghadikalaei, Vahideh (Author) ; Mahdavi Amiri, Nezamoddin (Supervisor)
    Abstract
    The field of digital image processing refers to processing digital images by means of a digital computer. One of the principal applications used in digital image processing is image compression. Image compression is the problem of reducing the amount of data required to represent a digital image. The basis of the reduction process is the removal of redundant data. One of the other principal applications of image processing is noise reduction (filtering) of images corrupted with additive noise. Filtering techniques are oriented toward modeling the degradation and applying the inverse process in order to recover the original image. Image watermarking is another application of image processing.... 

    Image Steganalysis of Low Rate Embedding in Spatial Domain

    , Ph.D. Dissertation Sharif University of Technology Farhat, Farshid (Author) ; Ghaemmaghami, Shahrokh (Supervisor) ; Aref, Mohammad Reza (Co-Advisor)
    Abstract
    LSB embedding in spatial domain with very low rate can be easily performed and its detection in spite of many researches is very hard, while BOSS competition has been held to break an adaptive embedding algorithm with low rate. Thus, proposing powerful steganalyzer of very low rate in spatial domain is highly requested. In this thesis it has been tried to present some algorithms to detect secret message with very low rate in spatial domain using eigenvalues analysis and relative auto-correlation of image.First approach is based on the analysis of the eigenvalues of the cover correlation matrix that we used for the first time. Image partitioning, correlation function computation,... 

    New Generation of On-purpose Attacks for Evaluating Digital Image Watermarking Methods by Preserving the Image Quality

    , Ph.D. Dissertation Sharif University of Technology Taherinia, Amir Hossein (Author) ; Jamzad, Mansour (Supervisor)
    Abstract
    Up to now, compared with the comprehensive research for developing robust watermarking algorithms, no equal attention has been devoted to the proposition of benchmarks tailored to assess the watermark robustness. In addition, almost all the state of the art benchmarks only integrate a number of common image processing operations like geometrical transformations to remove watermarks. However, the quality of the processed image is often too degraded to permit further commercial exploitation. Moreover, to the best of our knowledge, the design of these tools does not take into account the statistical properties of the images and watermarks in the design of attacks. In spite of the significant... 

    Improving the Robustness of Image Watermarking for Publicly Copyright-Proving

    , M.Sc. Thesis Sharif University of Technology Shakeri, Mahsa (Author) ; Jamzad, Mansour (Supervisor)
    Abstract
    The advent of Internet and advancement of computer technologies have enabled convenient and fast exchange of multimedia so the illegal reproduction and modification of digital media has become increasingly serious. Hence, how to protect the intellectual property rights of digital multimedia is an imperative issue. Digital watermarking is one of the solutions to prevent unauthorized use of images. Traditional digital watermarking techniques embed a watermark such as logo, trademark, or copyright information into a host image so that it is not perceptible. These techniques, depending on the amount of embedded data, will distort the content of host image which results in quality degradation of... 

    Improving Watermarking Robustness Against Print and Scan Attack

    , M.Sc. Thesis Sharif University of Technology Amiri, Hamid (Author) ; Jamzad, Mansour (Supervisor)
    Abstract
    The advent of digital age with the Internet revolution has made it extremely convenient for users to access, create, process, copy, or exchange multimedia data. This has created an urgent need for protecting intellectual property in both the digital and the print media. Digital watermarking is a suitable way to do this. In this technology, some hidden information called watermark are embedded into host signal and extracted to confirm copyright protection. However, the watermark should be embedded in the host in such a way that the attacks could not destroy it. Print and scan is a popular attack that is applied on digital images. This attack has complex nature and can be implemented easily.... 

    Steganalysis of Incomplete Image Using Random Fields

    , M.Sc. Thesis Sharif University of Technology Ahmadi, Aria (Author) ; Ghaemmaghami, Shahrokh (Supervisor) ; Gholampour, Iman (Co-Advisor)
    Abstract
    Widespread transfer of digital files over networks provides a hidden channel to transfer secret messages. Current steganalysis schemes need to work on a complete image for doing the detection job that starts when the image is entirely transferred, so are often restricted to an offline process. This restriction is serious when existence of the hidden message carriers on the network is shorter than the time required for the detection process. In this thesis, we propose a structurally fast detection method to detect the data hidden in an image passing through network. We use two of most powerful steganalysis algorithms for steganalysis of images that proposed by 1) Fridrich and Pevny and 2) Liu... 

    Extracting Appropriate Features for Zero Watermarking of Similar Images for Ownership Protection

    , M.Sc. Thesis Sharif University of Technology Ehsaee, Shahryar (Author) ; Jamzad, Mansour (Supervisor)
    Abstract
    Digital watermarking is an efficacious technique to protect the copyright and ownership of digital information. Traditional image watermarking algorithms embed a logo in the image that could reduce its visual quality. A new approach in watermarking called zero watermarking doesn’t need to embed a logo in the image. In this algorithm we find a feature from the main image and combine it with a logo to obtain a key. This key is securely kept by a trusted authority. In this thesis we show that we can increase the robustness of digital zero watermarking by a new counter detection method in comparison to Canny Edge detection and morphological dilatation that is mostly used by related works.... 

    Estimating watermarking capacity in gray scale images based on image complexity

    , Article Eurasip Journal on Advances in Signal Processing ; Volume 2010 , December , 2010 ; 16876172 (ISSN) Yaghmaee, F ; Jamzad, M ; Sharif University of Technology
    2010
    Abstract
    Capacity is one of the most important parameters in image watermarking. Different works have been done on this subject with different assumptions on image and communication channel. However, there is not a global agreement to estimate watermarking capacity. In this paper, we suggest a method to find the capacity of images based on their complexities. We propose a new method to estimate image complexity based on the concept of Region Of Interest (ROI). Our experiments on 2000 images showed that the proposed measure has the best adoption with watermarking capacity in comparison with other complexity measures. In addition, we propose a new method to calculate capacity using proposed image... 

    Introducing a new method for estimation image complexity according to calculate watermark capacity

    , Article 2008 4th International Conference on Intelligent Information Hiding and Multiedia Signal Processing, IIH-MSP 2008, Harbin, 15 August 2008 through 17 August 2008 ; 2008 , Pages 981-984 ; 9780769532783 (ISBN) Yaghmaee, F ; Jamzad, M ; Sharif University of Technology
    2008
    Abstract
    One of the most important parameters in evaluating a watermarking algorithm is its capacity. In fact, capacity has a paradoxical relation with other two important parameters: image quality and robustness. Some works have been done on watermarking capacity and a few on image complexities. Most works on watermarking capacity is based on information theory and the capacity values which are calculated based on these methods are very tolerate. In this paper we propose a new method for calculating image complexity based on Region Of Interest (ROI) concept. After that we analyze three complexity measures named: Image compositional complexity (ICC), Quad tree and ROI method, with three different... 

    Achieving higher perceptual quality and robustness in watermarking using Julian set patterns

    , Article IEE Proceedings: Information Security ; Volume 153, Issue 4 , 2006 , Pages 167-172 ; 17470722 (ISSN) Yaghmaee, F ; Jamzad, M ; Sharif University of Technology
    2006
    Abstract
    Some of the most important classes of watermark detection methods in image watermarking are correlation-based algorithms. In these methods usually a pseudorandom noise pattern is embedded in the host image. The receiver can regenerate this pattern by having a key that is the seed of a random number generator. After that if the correlation between this pattern and the image that is assumed to have the watermark is higher than a predefined threshold, it means that the watermark exists and vice versa. Here, we show the advantage of using the Julian set patterns as a watermark, instead of the commonly used pseudorandom noise pattern. Julian set patterns can be regenerated in receiver with few... 

    Using julian set patterns for higher robustness in correlation based watermarking methods

    , Article 5th IEEE International Symposium on Signal Processing and Information Technology, Athens, 18 December 2005 through 21 December 2005 ; Volume 2005 , 2005 , Pages 358-362 Yaghmaee, F ; Jamzad, M ; Sharif University of Technology
    2005
    Abstract
    Some of the most important classes of watermark detection methods in image watermarking are correlation based algorithms. In these methods usually a pseudorandom pattern is embedded in host image. Receiver can regenerate this pattern by having a key that is the seed of a random number generator. After that if the correlation between this pattern and the image that is assumed to have the watermark is higher than a predefined threshold, this means that the watermark exists and vise versa. In this paper we showed the advantage of using the Julian set patterns as a watermark, instead of commonly used pseudorandom noisy pattern. Julian set patterns can be regenerate in receiver with few... 

    A two-step watermarking attack using long-range correlation image restoration

    , Article Security and Communication Networks ; Volume 5, Issue 6 , AUG , 2012 , Pages 625-635 ; 19390122 (ISSN) Taherinia, A. H ; Jamzad, M ; Sharif University of Technology
    2012
    Abstract
    This paper presents an efficient scheme for blind watermark attacking using the concept of matching of the long-range data. The main idea of the proposed attack is to add plenty of noise to the watermarked image and then try to restore an unwatermarked copy of the noisy image. The aim is to destroy the watermark information without accessing the parameters used during the watermark embedding process. So, it allows our approach to be completely free from any pre-assumption on the watermarking algorithm or any other parameters that is used during the watermark embedding procedure. Experimental results show the proposed algorithm's superiority over several other traditional watermarking... 

    EWA: An exemplar-based watermarking attack

    , Article 2011 International Conference on Information Technology and Multimedia: "Ubiquitous ICT for Sustainable and Green Living", ICIM 2011, 14 November 2011 through 16 November 2011 ; Nov , 2011 , Page(s): 1 - 5 ; 9781457709890 (ISBN) Taherinia, A. H ; Jamzad, M ; Sharif University of Technology
    2011
    Abstract
    In this paper, we used image inpainting as a means for reconstruction of small damaged portions of a watermarked image so that the hidden watermark is not detectable afterwards. Our new watermarking attack algorithm extends the exemplar-based inpainting method, and then we apply it to intended noisy watermarked images to alter the watermark detection process. Our approach is completely free from any pre-assumption on the watermarking algorithm or any other parameters that is used during the watermark embedding procedure. The average PSNR/SSIM of the watermarked image after applying the proposed attack is more than 35/0.98 and the average NC for extracted watermark is lowers than 0.5, so... 

    Blind dewatermarking method based on wavelet transform

    , Article Optical Engineering ; Volume 50, Issue 5 , 2011 ; 00913286 (ISSN) Taherinia, A. H ; Jamzad, M ; Sharif University of Technology
    2011
    Abstract
    Along with the improvement of image watermarking techniques, the necessity for effectively and comprehensively evaluating various algorithms becomes imperative. In this paper, we first propose a new categorization that fits for most of the existing watermarking algorithms that work in the wavelet domain. Then an adaptive watermarking attack for evaluating the robustness of watermarking schemes that are based on the proposed categorization is presented. This attack determines the flat regions, edges, and textures of the watermarked image and based on known features of each region the proposed attack tries to destroy the watermark information. This is done by separately manipulating the... 

    A new adaptive watermarking attack in wavelet domain

    , Article 2009 International Multimedia, Signal Processing and Communication Technologies, IMPACT 2009, Aligarh, 14 March 2009 through 16 March 2009 ; 2009 , Pages 320-323 ; 9781424436040 (ISBN) Taherinia, A. H ; Jamzad, M ; Sharif University of Technology
    2009
    Abstract
    In this paper, we proposed a categorization for most of the existing watermarking algorithms that work in wavelet domain. Then an adaptive watermarking attack for digital images that is based on the proposed categorization is presented. This attack determines the flat regions, edges and textures of the watermarked image and based on known features of each region the proposed attack tries to destroy the watermark information by manipulating the wavelet coefficients of each region separately such that the least visual distortion will be imposed on the attacked image. We have tested the proposed method to attack two recent and robust watermarking methods and the results sound impressive. The... 

    A new watermarking attack based on content-aware image resizing

    , Article 2009 International Multimedia, Signal Processing and Communication Technologies, IMPACT 2009, Aligarh, 14 March 2009 through 16 March 2009 ; 2009 , Pages 177-180 ; 9781424436040 (ISBN) Taherinia, A. H ; Jamzad, M ; Sharif University of Technology
    2009
    Abstract
    In this paper, we propose a new method for damaging and destroying robust invisible watermarks using an image resizing technique which is named seam carving. By using this method we are able to resize watermarked images in a content-aware manner so that the synchronization of the embedder and extractor of watermarking system is broken and the watermark detection becomes impossible. In contrast to the available benchmarks like Stirmark, proposed attack does not severely reduce the quality of the watermarked image. Therefore it maintains the commercial value of the watermarked image. We have tested the proposed method to attack 3 recent and robust watermarking methods and the results sound... 

    A robust image watermarking using two level DCT and wavelet packets denoising

    , Article International Conference on Availability, Reliability and Security, ARES 2009, Fukuoka, Fukuoka Prefecture, 16 March 2009 through 19 March 2009 ; 2009 , Pages 150-157 ; 9780769535647 (ISBN) Taherinia, A. H ; Jamzad, M ; Sharif University of Technology
    2009
    Abstract
    In this paper we present a blind low frequency watermarking scheme on gray level images, which is based on DCT transform and spread spectrum communications technique. We compute the DCT of non overlapping 8x8 blocks of the host image, then using the DC coefficients of each block we construct a low-resolution approximation image. We apply block based DCT on this approximation image, then a pseudo random noise sequence is added into its high frequencies. For detection, we extract the approximation image from the watermarked image, then the same pseudo random noise sequence is generated, and its correlation is computed with high frequencies of the watermarked approximation image. In our method,... 

    A robust zero-watermarking scheme using Canny edge detector

    , Article International Journal of Electronic Security and Digital Forensics ; Volume 5, Issue 1 , 2013 , Pages 25-44 ; 1751911X (ISSN) Shakeri, M ; Jamzad, M ; Sharif University of Technology
    2013
    Abstract
    By expansion of digital multimedia and networking technology, the problem of ownership protection has become increasingly important. Digital watermarking is an efficient way for copyright protection of digital images. Traditional watermarking techniques degrade the quality of host image by embedding a watermark logo. Facing this problem, a new watermarking approach called zero-watermarking has been proposed. In zero-watermarking methods, the watermark does not require to be embedded into the protected image but it uses both the watermark and the protected image to generate a verification map which is registered to a trusted authority for further protection. In this paper we propose a robust...