Loading...
Search for: transformation-domain
0.005 seconds
Total 22 records

    Image Enhancement via Sparse Decomposition

    , M.Sc. Thesis Sharif University of Technology Sadeghipour Kermani, Zahra (Author) ; Babaiezadeh, Massoud (Supervisor)
    Abstract
    Sparse decomposition has recently attracted the attention of many researchers in dierent areas of signal processing. In mathematical viewpoint, sparse decomposition is nding a sparse solution of an Underdetermined System of Linear Equations (USLE). This concept has many applications in dierent signal processing elds including blind sourse separation, optical character recognition and image processing. In this thesis, we investigate the application of sparse decomposition in image denoising. One of the image denoising methods which is related to sparse decomposition concepts is the \transfrom domain method". In this method, the noisy image is rst transformed to another domain, and then noise... 

    On the effect of spatial to compressed domains transformation in LSB-based image steganography

    , Article 7th IEEE/ACS International Conference on Computer Systems and Applications, AICCSA-2009, Rabat, 10 May 2009 through 13 May 2009 ; 2009 , Pages 260-264 ; 9781424438068 (ISBN) Sarreshtedari, S ; Ghotbi, M ; Ghaemmaghami, S ; Sharif University of Technology
    2009
    Abstract
    This paper introduces an efficient scheme to image steganography by introducing the hidden message (payload) insertion in spatial domain and transforming the stego-image to compressed domain. We apply a recently-proposed LSB method in order to obtain better statistical behavior of the stego-message and subsequently, the obtained stego-image is transformed and quantized in order to enhance the security of hiding. Performance analysis comparisons confirm a higher efficiency for our proposed method. Compared to recently-proposed approaches, our method offers the advantage that it combines an efficient LSB method with transform domain security. © 2009 IEEE  

    Speech enhancement by adaptive noise cancellation in the wavelet domain

    , Article 2005 Fifth International Conference on Information, Communications and Signal Processing, Bangkok, 6 December 2005 through 9 December 2005 ; Volume 2005 , 2005 , Pages 719-723 ; 0780392833 (ISBN); 9780780392830 (ISBN) Akhaee, M. A ; Ameri, A ; Marvasti, F. A ; Sharif University of Technology
    2005
    Abstract
    Adaptive filtering has been used for speech denoising in the time domain. During the last decade, wavelet transform has been developed for speech enhancement. In this paper we are proposing to use adaptive filtering in the Wavelet transform domain. We propose a hybrid method of using adaptive filters on the lower scales of a wavelet transformed speech together with the conventional methods (Thresholding, Spectral Subtraction, and Wiener filtering) on the higher scale coefficients. Experimental results demonstrate that the suggested approach is computationally efficient and has a good performance. © 2005 IEEE  

    Watermarking of still images in wavelet domain based on entropy masking model

    , Article TENCON 2005 - 2005 IEEE Region 10 Conference, Melbourne, 21 November 2005 through 24 November 2005 ; Volume 2007 , 2005 ; 21593442 (ISSN); 0780393112 (ISBN); 9780780393110 (ISBN) Akhbari, B ; Ghaemmaghami, S ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2005
    Abstract
    A new robust image adaptive digital watermarking algorithm in wavelet transform domain is proposed in this paper. The proposed method exploits Human Visual System (HVS) characteristics and entropy masking concept to determine image adaptive thresholds for selection of perceptually significant coefficients. The mark is embedded in the coefficients of all subbands including the LL subband. Experimental results show that the proposed method significantly improves watermarking performance over conventional methods, in the terms of invisibility and robustness  

    Applications of Sparse Representation in Image Processing

    , M.Sc. Thesis Sharif University of Technology Nayyer, Sara (Author) ; Babaie Zadeh, Massoud (Supervisor)
    Abstract
    The sparse decomposition problem or nding sparse solutions of underdetermined linear systems of equations is one of the fundamental issues in signal processing and statistics. In recent years, this issue has been of great interest to researches in various elds of signal processing and accordingly found to be greatly benecial in those elds. This thesis aims at the investigation of the applications of the sparse decomposition problem in image processing. Among dierent applications such as compression, reconstruction, separation and image denoising, this thesis mainly focuses on the last one. One of the methods of image denoising which is closely tied to the sparse decomposition, is the method... 

    Higher-order statistical steganalysis of random LSB steganography

    , Article 7th IEEE/ACS International Conference on Computer Systems and Applications, AICCSA-2009, Rabat, 10 May 2009 through 13 May 2009 ; 2009 , Pages 629-632 ; 9781424438068 (ISBN) Khosravirad, S. R ; Eghlidos, T ; Ghaemmaghami, S ; Sharif University of Technology
    2009
    Abstract
    This paper presents a new scheme for steganalysis of random LSB embedding, capable of applying to any kind of digital signal in both spatial and transform domains. The proposed scheme is based on defining a space whose elements relate to higher-order statistical properties of the signal and looking for special subsets, which we call Closure of Sets (CoS) in this space. We use this scheme for steganalysis of the LSB steganography in grayscale images, employing a vector of five accurate and monotone features. Experimental results show significantly higher accuracy of the proposed scheme, as compared to those reported in the literature, especially in low embedding rates applications. © 2009... 

    Quantization based audio watermarking in a new transform domain

    , Article 2008 International Symposium on Telecommunications, IST 2008, Tehran, 27 August 2008 through 28 August 2008 ; October , 2008 , Pages 682-687 ; 9781424427512 (ISBN) Akhaee, M. A ; Nikooienejad, A ; Marvasti, F ; Sharif University of Technology
    2008
    Abstract
    In this paper, a novel blind watermarking technique based on quantization is proposed. Quantization is performed in a special domain which converts one dimensional signal to a 2-D one named Point to Point Graph (PPG). Basis of the method is on the separation of this domain into two portions; while, only one portion is quantized. Furthermore, in the dewatermarking procedure, by using the unquantized portion and zero norm, the embedded data can be extracted. The performance of the proposed method is analytically investigated and verified by simulation with artificial Gaussian signals. Experimental results over several audio signals shows the great robustness of the technique in comparison with... 

    Object detection based on weighted adaptive prediction in lifting scheme transform

    , Article ISM 2006 - 8th IEEE International Symposium on Multimedia, San Diego, CA, 11 December 2006 through 13 December 2006 ; 2006 , Pages 652-656 ; 0769527469 (ISBN); 9780769527468 (ISBN) Amiri, M ; Rabiee, H. R ; Sharif University of Technology
    2006
    Abstract
    This paper presents a new algorithm for detecting user-selected objects in a sequence of images based on a new weighted adaptive lifting scheme transform. In our algorithm, we first select a set of coefficients as object features in the wavelet transform domain and then build an adaptive transform considering the selected features. The goal of the designed adaptive transform is to "vanish" the selected features as much as possible in the transform domain. After applying both non-adaptive and adaptive transforms to a given test image, the corresponding transform domain coefficients are compared for detecting the object of interest. We have verified our claim with experimental results on 1-D... 

    Sparse-induced similarity measure: Mono-modal image registration via sparse-induced similarity measure

    , Article IET Image Processing ; Volume 8, Issue 12 , 1 December , 2014 , Pages 728-741 ; ISSN: 17519659 Ghaffari, A ; Fatemizadeh, E ; Sharif University of Technology
    Abstract
    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... 

    Transient free-surface seepage in three-dimensional general anisotropic media by BEM

    , Article Engineering Analysis with Boundary Elements ; Vol. 46, issue , 2014 , p. 51-66 Rafiezadeh, K ; Ataie-Ashtiani, B ; Sharif University of Technology
    Abstract
    Kinematic boundary condition is usually used when dealing with transient free-surface flow problems in isotropic media. When dealing with anisotropic problems, a transformation can transform the anisotropic media to an equivalent isotropic media for seepage analysis, but the kinematic boundary condition cannot be used directly in the transformed media. A generalization of the kinematic boundary condition along any arbitrary direction is derived for use in the transformed domain for general three-dimensional anisotropic problems. A boundary element method for solving transient free-surface seepage problems is developed and the treatment of the proposed kinematic boundary condition in the... 

    LSB ++: An improvement to LSB + steganography

    , Article IEEE Region 10 Annual International Conference, Proceedings/TENCON, 21 November 2011 through 24 November 2011, Bali ; 2011 , Pages 364-368 ; 9781457702556 (ISBN) Ghazanfari, K ; Ghaemmaghami, S ; Khosravi, S. R ; Sharif University of Technology
    Abstract
    The Least Significant Bit (LSB) substitution is an old and simple data hiding method that could almost effortlessly be implemented in spatial or transform domain over any digital media. This method can be attacked by several steganalysis methods, because it detectably changes statistical and perceptual characteristics of the cover signal. A typical method for steganalysis of the LSB substitution is the histogram attack that attempts to diagnose anomalies in the cover image's histogram. A well-known method to stand the histogram attack is the LSB + steganography that intentionally embeds some extra bits to make the histogram look natural. However, the LSB + method still affects the perceptual... 

    Closure of sets: A statistically hypersensitive system for steganalysis of least significant bit embedding

    , Article IET Signal Processing ; Volume 5, Issue 4 , July , 2011 , Pages 379-389 ; 17519675 (ISSN) Khosravirad, S. R ; Eghlidos, T ; Ghaemmaghami, S ; Sharif University of Technology
    2011
    Abstract
    This study introduces a new scheme for steganalysis of the least significant bit (LSB) embedding, based on the idea of closure of sets (CoS), which is independent of the type of cover signal, applicable to both spatial and transform domains. The CoS is referred to as some special subsets that could be found in a common space whose elements relate to higher-order statistical properties of the signal. The proposed scheme is used for steganalysis of the LSB steganography of greyscale TIFF and JPEG images and audio signals, employing a set of accurate and monotone features that are extracted based on the CoS definition. It is shown that significant improvement to the detection accuracy in... 

    High capacity image steganography in wavelet domain

    , Article 2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010, 9 January 2010 through 12 January 2010, Las Vegas, NV ; 2010 ; 9781424451760 (ISBN) Sarreshtedari, S ; Ghaemmaghami, S ; Sharif University of Technology
    2010
    Abstract
    A new high capacity method for transform domain image steganography is introduced in this paper. The proposed steganography algorithm works on the wavelet transform coefficients of the original image to embed the secret data. As compared to current transform domain data hiding methods, this scheme can provide a larger capacity for data hiding without sacrificing the cover image quality. This is achieved through retaining integrity of the wavelet coefficients at high capacity embedding. This improvement to capacity-quality trading-off interrelation is analyzed in detailed and experimentally illustrated in the paper  

    Semi-reversible quantization based data hiding using missing samples recovery technique

    , Article 16th International Conference on Telecommunications, ICT 2009, 25 May 2009 through 27 May 2009 ; 2009 , Pages 298-302 ; 9781424429370 (ISBN) Ameri, A ; Saberian, M. J ; Akhaee, M. A ; Marvasti, F ; Sharif University of Technology
    Abstract
    A blind semi-invertible quantization based data hiding scheme, which reconstructs the original signal with high precision has been proposed. In order to produce correlated quantization yielding reversibility of the quantization based approach, a new transform domain has been introduced. In decoder, by compensating the quantization error and using the iterative technique, the original signal is recovered; then the watermarked signal is compared with the reconstructed original signal and hidden data is retrieved. Simulation results show that the proposed method in comparison with other reversible methods imposes less distortion and thus a higher Signal to Noise Ratio (SNR) is achieved. © 2009... 

    Random sampling with iterative recovery for Millimeter-Wave imaging systems

    , Article IEEE Transactions on Circuits and Systems II: Express Briefs ; Volume 67, Issue 12 , 2020 , Pages 3522-3526 Zamani, H ; Fakharzadeh, M ; Amini, A ; Marvasti, F ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2020
    Abstract
    In this brief, an imaging methodology for mono-static millimeter-wave systems is introduced. When the measured object hologram is piece-wise smooth with sharp boundaries, both low-pass and high-pass components are present in a transform domain. Nevertheless, the edges are sparse in transform domain with respect to the image dimensions. It is shown that the down-sampling of the hologram with an appropriate rate determined by the sparsity level, includes the adequate information of all components for image reconstruction. Using random samples, an algorithm is proposed to recover all the sparse components, iteratively. Simulation results illustrate that a high-resolution recovery can be... 

    Temporal resolution enhancement of video sequences using transform domain

    , Article Proceedings of the 2008 International Conference on Image Processing, Computer Vision, and Pattern Recognition, IPCV 2008, 14 July 2008 through 17 July 2008, Las Vegas, NV ; 2008 , Pages 185-190 ; 1601320787 (ISBN); 9781601320780 (ISBN) Atrianfar, H ; Atrianfar, M ; Atrianfar, H ; Sharif University of Technology
    2008
    Abstract
    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... 

    Two techniques for audio watermarking based on a novel transformation

    , Article 2007 IEEE International Conference on Signal Processing and Communications, ICSPC 2007, Dubai, 14 November 2007 through 27 November 2007 ; 2007 , Pages 1139-1142 ; 9781424412365 (ISBN) Feizi khankandi, S ; Akhaee, M. A ; Marvasti, F ; Sharif University of Technology
    2007
    Abstract
    The main purpose of this paper is to embed data in the transform domain of audio signals. Data embedding is similar to Quantization Index Modulation (QIM) approach. But the embedding process is performed in a novel transformation named PPG (Point to Point Graph) which converts the audio signal to a set of points in the Cartesian Coordinates. Two watermarking schemes are proposed in this paper. The first approach uses the QIM method on the radius of the PPG points while the second approach employs the logical operand for this aim. Simulation results show that these two methods have great robustness against the common attack (such as White Gaussian noise, echo and filtering). Subjective... 

    A novel technique for audio signals watermarking in the wavelet and Walsh transform domains

    , Article 2006 International Symposium on Intelligent Signal Processing and Communications, ISPACS'06, Yonago, 12 December 2006 through 15 December 2006 ; 2006 , Pages 171-174 ; 0780397339 (ISBN); 9780780397330 (ISBN) Akhaee, M. A ; Ghaemmaghami, S ; Khademi, N ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2006
    Abstract
    This paper presents a novel approach to audio signals watermarking in the wavelet or the Walsh transform domain. The idea is to embed watermark data in the coefficients of some scales of the transform domain. The overall bit rate of this method is about 90 bps. Due to low computational complexity of the suggested approach, particularly in the Walsh domain, this algorithm can be implemented in real time. Experimental results show robustness of the proposed method in low SNRs and also against some typical attacks, such as MP3 compression, echo, filtering, etc. Subjective evaluation confirms transparency of the watermarked audio signals. © 2006 IEEE  

    Optimal rate and delay performance in non-cooperative opportunistic spectrum access

    , Article Proceedings of the International Symposium on Wireless Communication Systems, 28 August 2012 through 31 August 2012 ; August , 2012 , Pages 56-60 ; 21540217 (ISSN) ; 9781467307604 (ISBN) Perez, J ; Khodaian, M ; Sharif University of Technology
    2012
    Abstract
    We study transmission rate control and performance delay in cognitive radio (CR) links from a cross-layer perspective. We assume a hierarchical CR network where the secondary users (SU) access the spectrum band in an opportunistic and noncooperative way. The SU goal is to transmit a fixed-size file (fixed amount of data packets) during the sojourn time of the primary users (PU's) idle state. We assume that the SU's support frames retransmission through an automatic repeat request (ARQ) mechanism. By formulating the problem as a Markov decision process, we demonstrate that there is always an optimal stationary rate adaptation policy, and we propose a simple algorithm to obtain it. We derive... 

    RASIM: A novel rotation and scale invariant matching of local image interest points

    , Article IEEE Transactions on Image Processing ; Volume 20, Issue 12 , 2011 , Pages 3580-3591 ; 10577149 (ISSN) Amiri, M ; Rabiee, H. R ; Sharif University of Technology
    Abstract
    This paper presents a novel algorithm for matching image interest points. Potential interest points are identified by searching for local peaks in Difference-of-Gaussian (DoG) images. We refine and assign rotation, scale and location for each keypoint by using the SIFT algorithm. Pseudo log-polar sampling grid is then applied to properly scaled image patches around each keypoint, and a weighted adaptive lifting scheme transform is designed for each ring of the log-polar grid. The designed adaptive transform for a ring in the reference keypoint and the general non-adaptive transform are applied to the corresponding ring in a test keypoint. Similarity measure is calculated by comparing the...