Sharif Digital Repository

We propose a blind image steganalysis method based on the Singular Value Decomposition (SVD) of the Discrete Cosine Transform (DCT) coefficients that are revisited in this work. We compute geometric mean, mean of log values, and statistical moments (mean, variance and skewness) of the SVDs of the DCT sub-blocks that are averaged over the whole image to construct a 480-element feature vector for steganalysis. These features are fed to a Support Vector Machine (SVM) classifier to discriminate between stego and cover images. Experimental results show that the proposed method outperforms most powerful steganalyzers when applied to some well-known steganography algorithms  

This paper presents a new transform domain to evaluate the goodness of fit of natural image data to the common Benford's Law. The evaluation is made by three statistical fitness criteria including Pearson's chi-square test statistic, normalized cross correlation and a distance measure based on symmetrized Kullback-Leibler divergence. It is shown that the serial combination of variance filtering and block 2-D discrete cosine transform reveals the best goodness of fit for the first significant digit. We also show that the proposed transform domain brings reasonable fit for the second, third and fourth significant digits. As an application, the proposed transform domain is utilized to detect... 

This study investigates the use of structural similarity index (SSIM) on the minimised side effect to image watermarking. For the fast implementation and more compatibility with the standard discrete cosine transform (DCT)-based codecs, watermark insertion is carried out on the DCT coefficients and hence an SSIM model for DCT-based watermarking is developed. For faster implementation, the SSIM index is maximised over independent 4 × 4 non-overlapped blocks, but the disparity between the adjacent blocks reduces the overall image quality. This problem is resolved through optimisation of overlapped blocks, but, the higher image quality is achieved at a cost of high computational complexity. To... 

Watermarking is a way that is used to protect the copyright of images. As the existing watermarking methods are not robust enough a new novel scheme is needed. In this paper, we propose a zero-watermark discrete cosine transformation-based copyright protection scheme, in which a normalization procedure is applied in both watermark embedding and extraction to make our scheme more robust to geometric distortions. This method is resistant to malicious signal processing and geometric attacks such as blurring, JPEG compression, noise adding, sharpening, scaling, rotation and cropping. Experimental results on images with different complexity show that our proposed scheme outperforms related... 

Everyday, people share their digital media on the virtual networks; therefore, protecting them against piracy is worthy of consideration. Digital watermarking is a method to achieve this goal. In this paper, we propose a watermarking method in Discrete Cosine Transform (DCT) domain. For this purpose, DCT coefficients of the whole image are calculated. It helps to present a system without blockiness effects. Then, singular values of the watermark image are added to the low frequency DCT coefficients of cover image that are located on the main diagonal. We use scaling factors for watermark embedding to improve imperceptibility of the watermark. A vector of fixed elements, which is calculated... 

In this paper, a discrete cosine transform (DCT) based blind watermarking scheme based on spread spectrum communications is proposed. We perform block-based DCT (BDCT) on the host image; then using the DC coefficients of each block, we construct a low-resolution approximation image. We apply BDCT on this approximation image, then watermark is embedded by adding a pseudo random noise sequence into its high frequencies. In detection stage, 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, higher robustness is obtained... 

Realistic description of fractured reservoirs demands primarily for a comprehensive understanding of fracture networks and their geometry including various individual fracture parameters as well as network connectivities. Newly developed multiple-point geostatistical simulation methods like SIMPAT and FILTERSIM are able to model connectivity and complexity of fracture networks more effectively than traditional variogrambased methods. This approach is therefore adopted to be used in this paper. Among the multiple-point statistics algorithms, FILTERSIM has the priority of less computational effort than does SIMPAT by applying filters and modern dimensionality reduction techniques to the... 

The three dimensional discrete cosine transform (3D DCT) has been widely used in many applications such as video compression. On the other hand, the kary n-cube is one of the most popular interconnection networks used in many recent multicomputers. As direct calculation of 3D DCT is very time consuming, many researchers have been working on developing algorithms and special-purpose architectures for fast computation of 3D DCT. This paper proposes a parallel algorithm for efficient calculation of 3D DCT on the k-ary n-cube multicomputers. The time complexity of the proposed algorithm is of O(N) for an N × N × N input data cube while direct calculation of 3D DCT has a complexity of O(N6). ©... 

A hybrid video codec, where the intraframe pictures are wavelet-based coded and the interframe pictures are coded with a standard H.263 codec is proposed. We show that intraframe-wavelet coded pictures not only improve the quality of I-pictures but also result in lower distorted prediction pictures that outperforms a pure H.263 video codec. © 2005 IEEE  

Multiple description coding (MDC) is a technique where multiple streams from a source video are generated, each individually decodable and mutually refinable. MDC is a promising solution to overcome packet loss in video transmission over noisy channels, particularly for real-time applications in which retransmission of lost information is not practical. A problem with conventional MDC is that the achieved side distortion quality is considerably lower than single description coding (SDC) quality except at high redundancies which in turn leads to central quality degradation. In this paper, a new mixed layer MDC scheme is presented with no degradation in central quality, and providing better... 

In this paper, an algorithm for image coding based on a sparse 3-dimensional Discrete Cosine Transform (3D DCT) is studied. The algorithm is essentially a method for achieving a sufficiently sparse representation using 3D DCT. The experimental results obtained by the algorithm are compared to the 2D DCT (used in JPEG standard) and wavelet db9/7 (used in JPEG2000 standard). It is experimentally shown that the algorithm, that only uses DCT but in 3 dimensions, outperforms the DCT used in JPEG standard and achieves comparable results (but still less than) the wavelet transform. © Springer-Verlag Berlin Heidelberg 2009  

Similarity measure is an important key in image registration. Most traditional intensity-based similarity measures (e.g. sum-of-squared-differences, correlation coefficient, mutual information and correlation ratio) assume a stationary image and pixel-by-pixel independence. These similarity measures ignore the correlation among pixel intensities; hence, a perfect image registration cannot be achieved especially in the presence of spatially varying intensity distortions and outlier objects that appear in one image but not in the other. It is supposed here that non-stationary intensity distortion (such as bias field) has a sparse representation in the transformation domain. Based on this... 

The growth of data communication networks has made digital watermarking an important issue for copyright and content protection. Achieving high level of robustness and good transparency are the main objectives of developing every digital watermarking algorithm. From among transform domains as the basis of watermark hiding place, Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT) and Singular Value Decomposition (SVD) are the most commonly used transforms in literature. In this paper we propose a new hybrid DWT-SVD domain watermarking scheme taking into account the energy content of every chosen block of the selected DWT sub-band coefficients. Before embedding, we append a... 

Mostly the embedding capacity of steganography methods is assessed in non-zero DCT coefficients. Due to unequal distribution of non-zero DCT coefficients in images with different contents, images with the same number of non-zero DCT coefficients may have different actual embedding capacities. This paper introduces embedding capacity as a property of images in the presence of multiple steganalyzers, and discusses a method for computing embedding capacity of cover images. Using the capacity constraint, embedding can be done more secure than the state when the embedder does not know how much data can be hidden securely in an image. In our proposed approach, an ensemble system that uses... 

Temporal interpolation has been recently proposed as a solution for increasing temporal resolution or even for predicting missing or corrupted frames within a video sequence . In this paper new technique on temporal interpolation are presented, by mainly exploiting properties of the very popular and highly efficient transforms such as Discrete Cosine Transform and Discrete Wavelet Transform . Novelty of the approach is that resolution enhancement is done by adding the new coefficients in transform domain . In addition we further give a method for computing PSNR of the frames . Finally simulation on a number of video sequences is presented in order to compare the performance of this two...