{"title":"An adaptive modulation scheme for image transmission over wireless channels","authors":"Rimas A. Zrae, Mohamed S. Hassan, M. El-Tarhuni","doi":"10.1109/ISSPIT.2010.5711814","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711814","url":null,"abstract":"In this paper, we propose an adaptive modulation scheme for image transmission over fading channels. The proposed scheme partitions the received signal-to-noise (SNR) space as well as the transmitted information based on its importance. Then, it jointly considers the channel condition and the importance of the transmitted bitstream when deciding on the modulation level. More specifically, the scheme partitions the compressed image information into different bit streams with unequal importance based on the properties of the human visual system. Then, it decides on the modulation level that meets a predefined target bit error rate (BER) using an offline lookup table. This predefined BER is based on the SNR level as seen by the receiver and the sensitivity of the transmitted bit stream. Simulation results show that the proposed scheme provides significant improvement in the spectral efficiency when compared to fixed-modulation based systems while maintaining relatively high peak signal-to-noise ratio (PSNR) and acceptable perceptual quality.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123344143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optical watermarking technique robust to geometrical distortion in image","authors":"Y. Ishikawa, K. Uehira, K. Yanaka","doi":"10.1109/ISSPIT.2010.5711727","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711727","url":null,"abstract":"This paper presents an optical watermarking technique that is robust against geometrical distortion in images by using spatially modulated illumination. It can protect “analog” objects like pictures painted by artists from having photographs taken of them illegally in museums. Illegally captured images in practical situations may contain various distortions, and embedded watermarks may be incorrectly detected. Geometrical distortion caused by the shooting angle that the objects are captured at is a particularly major problem. We carried out experiments to evaluate the robustness of watermarking images that were geometrically distorted, in which distortions were intentionally created by moving the position of the projector and the digital camera from right in front of the object. The accuracy of the extracted watermarking data was almost 100%, even if the shooting angle was inclined by about 20 degrees between the projector and digital camera, in both cases when a Discrete Cosine Transform (DCT) and a Walsh-Hadamard Transform (WHT) were used as the methods of embedding watermarks. We introduced rectangular mesh fitting and a technique of “bi-linear interpolation” based on the four nearest points to correct the distortions.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127034020","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the security of image encryption schemes based on Multiple Parameters Transforms","authors":"E. Elsheh, A. Youssef","doi":"10.1109/ISSPIT.2010.5711735","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711735","url":null,"abstract":"Recent developments of generalized forms of signal processing transforms with a large number of independent parameters, such as the Multiple Parameter Fractional Fourier Transform and the Discrete Fractional Cosine Transform, have encouraged many researchers to propose image encryption algorithms based on a single or multiple applications of these transforms. In order to claim a high level of security of these parameterized transforms-based schemes, their authors usually use the argument that the encrypted image is visually indistinguishable from random noise. In this paper, we show that these algorithms represent typical textbook examples of insecure ciphers; all the building blocks of these schemes are linear, and hence, breaking these scheme, using a known plaintext attack, is equivalent to solving a set of linear equations. We also invalidate the argument of relying on the visual quality of the encrypted image ciphertext by presenting an example for a trivially insecure system that produces ciphertext images with the same property. An agreement against the claimed efficiency of these schemes is also provided.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127088011","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"FPGA based design and implementation of an Adaptive Binary Integrator","authors":"F. Ahmed, K. Moustafa, A. Fouad, A. Fahmy","doi":"10.1109/ISSPIT.2010.5711786","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711786","url":null,"abstract":"Binary detection integrator is characterized by its simplicity, resistance against asynchronous interference, and its good detection performance. It suffers from detection loss due to non-homogeneous background. To overcome the limitations of binary integration, the Adaptive Binary Integrator (ABI) is used. ABI achieves the advantages of automatic detection and adaptive thresholding over the binary integrator. The presented adaptive binary integrator is designed and implemented using field programmable gate arrays (FPGAs). The performance of the proposed ABI is evaluated through the Receiver Operating Characteristic (ROC). The implemented hardware is evaluated experimentally under different conditions of noise, asynchronous interference, sea clutters, and rain clutters. High probability of detection is achieved by designing the Constant False Alarm Rate (CFAR) processor which is the first stage in the proposed ABI for relatively high probability of false alarm. The final probability of false alarm is then reduced by the effect of integration.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132289259","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
F. Gharibi, F. Tab, Javad RavanJamJah, Bahram Zahir Azami
{"title":"Using the local information of image to identify the source camera","authors":"F. Gharibi, F. Tab, Javad RavanJamJah, Bahram Zahir Azami","doi":"10.1109/ISSPIT.2010.5711808","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711808","url":null,"abstract":"In this paper we introduce a new method for source identification in digital image forensics. The proposed method uses local information of the inherent pattern of the camera, as a signature of the camera for source identification. Here the sensor pattern noise is used as the unique identification property of the camera. However due to content dependency of the denoising algorithms that are used to extract the noise pattern, the different regions of the image do not have the same information about the camera signature. Hence in our algorithm, at first the best regions of the image according to their local information are selected to extract the noise pattern. This step is done by fuzzy-based classification on the overlapped blocks of the image. In the next step the noise pattern of these regions are extracted and then, we evaluate the correlation between the image pattern and camera pattern. Finally the source camera is determined according its correlation. The experimental results compared to similar works show an increase in the detection rate of source identification, while computational complexity is reduced; this affirms the efficiency and performance of the proposed theory.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131803611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Speech segmentation using a hypothesis test based on Random Matrix Theory","authors":"N. Faraji, S. Ahadi, H. Sheikhzadeh, A. Reza","doi":"10.1109/ISSPIT.2010.5711800","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711800","url":null,"abstract":"Speech segmentation to covariance-stationary regions is of interest, for example in subspace-based speech enhancement. However as the true covariance matrices of speech segments are unknown, it is usual to use their sample estimates. To check whether two sample covariance matrices have been drawn from the same distribution or not, we have used a test statistic previously proposed for image segmentation. We have derived a new expression for the decision threshold using Random Matrix Theory. Finally, a novel segmentation procedure is proposed and applied to both synthetic and speech data. The presented simulation results show the low computational cost and good performance.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127997223","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A fragile invertible watermarking technique for the authentication of medical images","authors":"A. Al-Gindy","doi":"10.1109/ISSPIT.2010.5711776","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711776","url":null,"abstract":"This paper deals with a fragile watermarking technique for the authentication of medical images. Medical images are stored in archiving and communication systems that are accessed by the radiologists for diagnosis. The proposed method insure the integrity of the medical image data that is being transferred over public network. Any modification to the watermarked image can be detected using the proposed watermarking method. A unique 14 decimal digits number (signature) representing patient's entry date and file ID embedded inside the patient's medical image in an imperceptible way without increasing the data size that need to be transferred. This signature can be extracted at the radiologist viewer work stations and used for the authentication while the modified data is restored back to original if the image found to be authentic. This kind of erasable embedding process would ensure medical image retrieval without any modification to the image data after the authentication process. The proposed frequency domain watermarking method go along with the unique need of medical images for diagnosis.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131161142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the use of compressive sampling for wide-band spectrum sensing","authors":"D. Sundman, S. Chatterjee, M. Skoglund","doi":"10.1109/ISSPIT.2010.5711810","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711810","url":null,"abstract":"In a scenario where a cognitive radio unit wishes to transmit, it needs to know over which frequency bands it can operate. It can obtain this knowledge by estimating the power spectral density from a Nyquist-rate sampled signal. For wide-band signals sampling at the Nyquist rate is a major challenge and may be unfeasible. In this paper we accurately detect spectrum holes in sub-Nyquist frequencies without assuming wide sense stationarity in the compressed sampled signal. A novel extension to further reduce the sub-Nyquist samples is then presented by introducing a memory based compressed sensing that relies on the spectrum to be slowly varying.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114915423","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Exact Tracking Analysis of the ∈-NLMS algorithm for circular complex correlated Gaussian input","authors":"M. Moinuddin, T. Al-Naffouri, M. S. Sohail","doi":"10.1109/ISSPIT.2010.5711782","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711782","url":null,"abstract":"This work presents exact tracking analysis of the ∈-normalized least mean square (∈-NLMS) algorithm for circular complex correlated Gaussian input. The analysis is based on the derivation of a closed form expression for the cumulative distribution function (CDF) of random variables of the form equations. The CDF is then used to derive the first and second moments of these variables. These moments in turn completely characterize the tracking performance of the ∈-NLMS algorithm in explicit closed form expressions. Consequently, new explicit closed-form expressions for the steady state tracking excess mean square error and optimum step size are derived. The simulation results of the tracking behavior of the filter match the expressions obtained theoretically for various degrees of input correlation and for various values of ∈.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127961763","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A robust audio watermarking technique based on the perceptual evaluation of audio quality algorithm in the multiresolution domain","authors":"Masmoudi Salma, Maha Charfeddine, C. Amar","doi":"10.1109/ISSPIT.2010.5711803","DOIUrl":"https://doi.org/10.1109/ISSPIT.2010.5711803","url":null,"abstract":"Audio watermarking is a method that embeds inaudible information into digital audio data. This paper describes an audio watermarking scheme using the Least Significant Bit (LSB) in the multiresolution domain exploiting the perceptual evaluation of audio quality algorithm (PEAQ) and MP3 compression characteristics. To guarantee perfect inaudibility propriety, we adapt the PEAQ algorithm to select the adequate audio band used to hide the watermark in the LSB of the multiresolution coefficients. Additionally, we use some MP3 compression characteristics to increase robustness of the scheme and we duplicate the watermark bits in the whole audio signal blocks assuring then an important ratio property without affecting the inaudibility property. The described method provides good robustness results against compression and StirMark attacks. Besides, it allows blind retrieval of embedded watermark which does not need the original audio.","PeriodicalId":308189,"journal":{"name":"The 10th IEEE International Symposium on Signal Processing and Information Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130155871","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}