A. Ashour, Sourav Samanta, N. Dey, N. Kausar, Wahiba Ben Abdessalemkaraa, A. Hassanien
{"title":"Computed Tomography Image Enhancement Using Cuckoo Search: A Log Transform Based Approach","authors":"A. Ashour, Sourav Samanta, N. Dey, N. Kausar, Wahiba Ben Abdessalemkaraa, A. Hassanien","doi":"10.4236/JSIP.2015.63023","DOIUrl":"https://doi.org/10.4236/JSIP.2015.63023","url":null,"abstract":"Medical image enhancement is an essential process for superior disease diagnosis as well as for detection of pathological lesion accurately. Computed Tomography (CT) is considered a vital medical imaging modality to evaluate numerous diseases such as tumors and vascular lesions. However, speckle noise corrupts the CT images and makes the clinical data analysis ambiguous. Therefore, for accurate diagnosis, medical image enhancement is a must for noise removal and sharp/clear images. In this work, a medical image enhancement algorithm has been proposed using log transform in an optimization framework. In order to achieve optimization, a well-known meta-heuristic algorithm, namely: Cuckoo search (CS) algorithm is used to determine the optimal parameter settings for log transform. The performance of the proposed technique is studied on a low contrast CT image dataset. Besides this, the results clearly show that the CS based approach has superior convergence and fitness values compared to PSO as the CS converge faster that proves the efficacy of the CS based technique. Finally, Image Quality Analysis (IQA) justifies the robustness of the proposed enhancement technique.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"404 1","pages":"244-257"},"PeriodicalIF":0.0,"publicationDate":"2015-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79749408","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":"Census and Segmentation-Based Disparity Estimation Algorithm Using Region Merging","authors":"Viral H. Borisagar, M. Zaveri","doi":"10.4236/JSIP.2015.63018","DOIUrl":"https://doi.org/10.4236/JSIP.2015.63018","url":null,"abstract":"Disparity estimation is an ill-posed problem in computer vision. It is explored comprehensively due to its usefulness in many areas like 3D scene reconstruction, robot navigation, parts inspection, virtual reality and image-based rendering. In this paper, we propose a hybrid disparity generation algorithm which uses census based and segmentation based approaches. Census transform does not give good results in textureless areas, but is suitable for highly textured regions. While segment based stereo matching techniques gives good result in textureless regions. Coarse disparities obtained from census transform are combined with the region information extracted by mean shift segmentation method, so that a region matching can be applied by using affine transformation. Affine transformation is used to remove noise from each segment. Mean shift segmentation technique creates more than one segment of same object resulting into non-smoothness disparity. Region merging is applied to obtain refined smooth disparity map. Finally, multilateral filtering is applied on the disparity map estimated to preserve the information and to smooth the disparity map. The proposed algorithm generates good results compared to the classic census transform. Our proposed algorithm solves standard problems like occlusions, repetitive patterns, textureless regions, perspective distortion, specular reflection and noise. Experiments are performed on middlebury stereo test bed and the results demonstrate that the proposed algorithm achieves high accuracy, efficiency and robustness.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"60 1 1","pages":"191-202"},"PeriodicalIF":0.0,"publicationDate":"2015-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85050313","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 Comparison of Integer Cosine and Tchebichef Transforms for Image Compression Using Variable Quantization","authors":"Soni Prattipati, M. Swamy, P. Meher","doi":"10.4236/JSIP.2015.63019","DOIUrl":"https://doi.org/10.4236/JSIP.2015.63019","url":null,"abstract":"In the field of image and data compression, there are always new approaches being tried and tested to improve the quality of the reconstructed image and to reduce the computational complexity of the algorithm employed. However, there is no one perfect technique that can offer both maximum compression possible and best reconstruction quality, for any type of image. Depending on the level of compression desired and characteristics of the input image, a suitable choice must be made from the options available. For example in the field of video compression, the integer adaptation of discrete cosine transform (DCT) with fixed quantization is widely used in view of its ease of computation and adequate performance. There exist transforms like, discrete Tchebichef transform (DTT), which are suitable too, but are potentially unexploited. This work aims to bridge this gap and examine cases where DTT could be an alternative compression transform to DCT based on various image quality parameters. A multiplier-free fast implementation of integer DTT (ITT) of size 8 × 8 is also studied, for its low computational complexity. Due to the uneven spread of data across images, some areas might have intricate detail, whereas others might be rather plain. This prompts the use of a compression method that can be adapted according to the amount of detail. So, instead of fixed quantization this paper employs quantization that varies depending on the characteristics of the image block. This implementation is free from additional computational or transmission overhead. The image compression performance of ITT and ICT, using both variable and fixed quantization, is compared with a variety of images and the cases suitable for ITT-based image compression employing variable quantization are identified.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"39 1","pages":"203-216"},"PeriodicalIF":0.0,"publicationDate":"2015-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84536354","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":"Implementation of High Performance Electronic Circuits for Zero Suppression and Encoding of Digital Signals","authors":"A. Yahia, A. Radi, Salwa M. Youssef","doi":"10.4236/JSIP.2015.63022","DOIUrl":"https://doi.org/10.4236/JSIP.2015.63022","url":null,"abstract":"This paper presents a design of a data processing circuit for receiving digital signals from front end-electronic board chips of a specific nuclear detector, encoding and triggering them via specific optical links operating at a specific frequency. Such processed signals are then fed to a data acquisition system (DAQ) for analysis. Very high-speed integrated circuit hardware description language (VHDL) algorithms and codes were created to implement this design using field programmable gate array (FPGA) devices. The obtained data were simulated using international standard simulators.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"17 1","pages":"238-243"},"PeriodicalIF":0.0,"publicationDate":"2015-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78442109","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":"P-Wave Detection Combining Entropic Criterion and Wavelet Transform","authors":"S. Rekik, N. Ellouze","doi":"10.4236/JSIP.2015.63020","DOIUrl":"https://doi.org/10.4236/JSIP.2015.63020","url":null,"abstract":"The objective of this paper is to develop \u0000an efficient P wave detection method in electrocardiogram (ECG) using the local \u0000entropy criterion (EC) and wavelet transform (WT) modulus maxima. The detection \u0000of P wave relates to the diagnosis of many heart diseases and it is also a \u0000difficult point during the ECG signal detection. Determining the position of a \u0000P-wave is complicated due to the low amplitude, the ambiguous and changing form \u0000of the complex. In a first step, QRS complexes are detected using the \u0000pan-Tompkins method. Then, we look for the best position of the analysis window \u0000and the value of the most appropriate width to the P wave. Finally, the \u0000determination of P wave peaks, as well as their onsets and offsets. The method \u0000has been validated using ECG-recordings with a wide variety of P-wave \u0000morphologies from MIT-BIH Arrhythmia and QT database. The P-wave method obtains \u0000a sensitivity of 99.87% and a positive predictivity of 98.04% over the MIT-BIH \u0000Arrhythmia, while for the QT, sensitivity and predictivity over 99.8% are \u0000attained.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"10 1","pages":"217-226"},"PeriodicalIF":0.0,"publicationDate":"2015-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85673349","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":"Effect of Diversity and Filtering on the Performance of Wavelet Packets Base Multicarrier Multicode CDMA System","authors":"M. Akho-Zahieh, Nasser Abdellatif","doi":"10.4236/JSIP.2015.62016","DOIUrl":"https://doi.org/10.4236/JSIP.2015.62016","url":null,"abstract":"In Wavelet Packets Based Multicarrier Multicode CDMA system, the multicode (MCD) part ensures the transmission for high speed and flexible data rate, the multicarrier (MC) part ensures the flexibility of handling multiple data rates, and wavelet packets modulation technique contributes to the mitigation of the interference problems. The CDMA system can suppress a given amount of interference. In this paper, the receiver employs suppression filter (SF) to mitigate the effect of narrow-band jammer interference and diversity techniques to reduce multiple access interference. The framework for the system and the performance evaluation are presented in terms of bit error rate (BER) over a Nakagami fading channel. Also, we investigate how the performance is influenced by various parameters, such as the number of taps of the SF, the ratio of narrow-band interference bandwidth to the spread-spectrum bandwidth, the diversity order, the fading parameter and so on. Finally, the performance of the system is compared with the performance Sinusoidal (Sin) based MC/MCD CDMA system.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"105 1","pages":"165-179"},"PeriodicalIF":0.0,"publicationDate":"2015-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76132146","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":"Discrete Inequalities on LCT","authors":"Guanlei Xu, Xiaotong Wang, Xiaogang Xu","doi":"10.4236/JSIP.2015.62014","DOIUrl":"https://doi.org/10.4236/JSIP.2015.62014","url":null,"abstract":"Linear canonical transform (LCT) is widely used in physical optics, mathematics and information processing. This paper investigates the generalized uncertainty principles, which plays an important role in physics, of LCT for concentrated data in limited supports. The discrete generalized uncertainty relation, whose bounds are related to LCT parameters and data lengths, is derived in theory. The uncertainty principle discloses that the data in LCT domains may have much higher concentration than that in traditional domains.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"24 1","pages":"146-152"},"PeriodicalIF":0.0,"publicationDate":"2015-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74455131","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":"Comparative Study and Analysis of Performances among RNS, DBNS, TBNS and MNS for DSP Applications","authors":"Rakhi Roy, D. Datta, S. Bhagat, S. Saha, A. Sinha","doi":"10.4236/JSIP.2015.62005","DOIUrl":"https://doi.org/10.4236/JSIP.2015.62005","url":null,"abstract":"This paper presents a comparative study of the performances of arithmetic units, based on different number systems like Residue Number System (RNS), Double Base Number System (DBNS), Triple Base Number System (TBNS) and Mixed Number System (MNS) for DSP applications. The performance analysis is carried out in terms of the hardware utilization, timing complexity and efficiency. The arithmetic units based on these number systems were employed in designing various modulation schemes like Binary Frequency Shift Keying (BFSK) modulator/demodulator. The analysis of the performance of the proposed modulator on above mentioned number systems indicates the superiority of other number systems over binary number system.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"116 1","pages":"49-65"},"PeriodicalIF":0.0,"publicationDate":"2015-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90563425","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 Template Matching Algorithm Based on Reducing Dimensions","authors":"Y. Fouda","doi":"10.4236/JSIP.2015.62011","DOIUrl":"https://doi.org/10.4236/JSIP.2015.62011","url":null,"abstract":"Template matching is a fundamental problem \u0000in pattern recognition, which has wide applications, especially in industrial \u0000inspection. In this paper, we propose a 1-D template matching algorithm which \u0000is an alternative for 2-D full search block matching algorithms. Our approach \u0000consists of three steps. In the first step the images are converted from 2-D \u0000into 1-D by summing up the intensity values of the image in two directions \u0000horizontal and vertical. In the second step, the template matching is performed \u0000among 1-D vectors using the similarity function sum of square difference. \u0000Finally, the decision will be taken based on the value of similarity function. \u0000Transformation template image and sub-images in the source image from 2-D grey \u0000level information into 1-D information vector reduce the dimensionality of the \u0000data and accelerate the computations. Experimental results show that the \u0000computational time of the proposed approach is faster and performance is better \u0000than three basic template matching methods. Moreover, our approach is robust to \u0000detect the target object with changes of illumination in the template also when \u0000the Gaussian noise added to the source image.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"8 1","pages":"109-122"},"PeriodicalIF":0.0,"publicationDate":"2015-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85205826","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}
Kizito Nkurikiyeyezu, Faustin Ahishakiye, C. Nsengimana, E. Ntagwirumugara
{"title":"Toolkits for Real Time Digital Audio Signal Processing Teaching Laboratory","authors":"Kizito Nkurikiyeyezu, Faustin Ahishakiye, C. Nsengimana, E. Ntagwirumugara","doi":"10.4236/JSIP.2015.62009","DOIUrl":"https://doi.org/10.4236/JSIP.2015.62009","url":null,"abstract":"This paper describes an audio digital \u0000signal-processing toolkit that the authors develop to supplement a lecture \u0000course on digital signal processing (DSP) taught at the department of \u0000Electrical and Electronics Engineering at the University of Rwanda. In \u0000engineering education, laboratory work is a very important component for a \u0000holistic learning experience. However, even though today there is an increasing \u0000availability of programmable DSP hardware that students can largely benefit \u0000from, many poorly endowed universities cannot afford a costly full-fledged DSP \u0000laboratory. To help remedy this problem, the authors have developed C#.NET \u0000toolkits, which can be used for real-time digital audio signal processing \u0000laboratory. These toolkits can be used with any managed languages, like Visual \u0000Basic, C#, F# and managed C++. They provide frequently used modules for digital \u0000audio processing such as filtering, equalization, spectrum analysis, audio \u0000playback, and sound effects. It is anticipated that by creating a flexible and \u0000reusable components, students will not only learn fundamentals of DSP but also \u0000get an insight into the practicability of what they have learned in the \u0000classroom.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"12 1","pages":"92-98"},"PeriodicalIF":0.0,"publicationDate":"2015-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86233254","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}