Huanming Zhang, Kaiyi Xian, Lijun Feng, Chaokang Hu
This paper proposes a scheme to construct orthogonal channel matrix for full rate quasiorthogonal STBC based on givens rotation with lower bit error rate. The transmission diversity method rotates every single information symbol. The scheme can suppress channel noise and eliminate the interference term well. Simulation results show that the method can improve performance better than conventional algorithm without increasing decoding complexity.
{"title":"A New Scheme to Construct Orthogonal Channel Matrix for MIMO STBC by Givens Rotation","authors":"Huanming Zhang, Kaiyi Xian, Lijun Feng, Chaokang Hu","doi":"10.4236/JSIP.2016.71005","DOIUrl":"https://doi.org/10.4236/JSIP.2016.71005","url":null,"abstract":"This paper proposes a scheme to construct \u0000orthogonal channel matrix for full rate quasiorthogonal STBC based on givens \u0000rotation with lower bit error rate. The transmission diversity method rotates \u0000every single information symbol. The scheme can suppress channel noise and \u0000eliminate the interference term well. Simulation results show that the method \u0000can improve performance better than conventional algorithm without increasing \u0000decoding complexity.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"19 1","pages":"720-726"},"PeriodicalIF":0.0,"publicationDate":"2016-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76188571","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}
Mohamed A. El-Sayed, M. Hassaballah, Mohammed A. Abdel-Latif
Authentication reliability of individuals is a demanding service and growing in many areas, not only in the military barracks or police services but also in applications of community and civilian, such as financial transactions. In this paper, we propose a human verification method depends on extraction a set of retinal features points. Each set of feature points is representing landmarks in the tree of retinal vessel. Extraction and matching of the pattern based on Gabor filters and SVM are described. The validity of the proposed method is verified with experimental results obtained on three different commonly available databases, namely STARE, DRIVE and VARIA. We note that the proposed retinal verification method gives 92.6%, 100% and 98.2% recognition rates for the previous databases, respectively. Furthermore, for the authentication task, the proposed method gives a moderate accuracy of retinal vessel images from these databases.
{"title":"Identity Verification of Individuals Based on Retinal Features Using Gabor Filters and SVM","authors":"Mohamed A. El-Sayed, M. Hassaballah, Mohammed A. Abdel-Latif","doi":"10.4236/JSIP.2016.71007","DOIUrl":"https://doi.org/10.4236/JSIP.2016.71007","url":null,"abstract":"Authentication reliability of individuals is a demanding service and growing in many areas, not only in the military barracks or police services but also in applications of community and civilian, such as financial transactions. In this paper, we propose a human verification method depends on extraction a set of retinal features points. Each set of feature points is representing landmarks in the tree of retinal vessel. Extraction and matching of the pattern based on Gabor filters and SVM are described. The validity of the proposed method is verified with experimental results obtained on three different commonly available databases, namely STARE, DRIVE and VARIA. We note that the proposed retinal verification method gives 92.6%, 100% and 98.2% recognition rates for the previous databases, respectively. Furthermore, for the authentication task, the proposed method gives a moderate accuracy of retinal vessel images from these databases.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"4 1","pages":"49-59"},"PeriodicalIF":0.0,"publicationDate":"2016-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73568633","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}
The use of frames is analyzed in Compressed Sensing (CS) through proofs and experiments. First, a new generalized Dictionary-Restricted Isometry Property (D-RIP) sparsity bound constant for CS is established. Second, experiments with a tight frame to analyze sparsity and reconstruction quality using several signal and image types are shown. The constant is used in fulfilling the definition of D-RIP. It is proved that k-sparse signals can be reconstructed if by using a concise and transparent argument1. The approach could be extended to obtain other D-RIP bounds (i.e. ). Experiments contrast results of a Gabor tight frame with Total Variation minimization. In cases of practical interest, the use of a Gabor dictionary performs well when achieving a highly sparse representation and poorly when this sparsity is not achieved.
{"title":"Sparse Representation by Frames with Signal Analysis","authors":"C. Baker","doi":"10.4236/JSIP.2016.71006","DOIUrl":"https://doi.org/10.4236/JSIP.2016.71006","url":null,"abstract":"The use of frames is analyzed in Compressed Sensing (CS) through proofs and experiments. First, a new generalized Dictionary-Restricted Isometry Property (D-RIP) sparsity bound constant for CS is established. Second, experiments with a tight frame to analyze sparsity and reconstruction quality using several signal and image types are shown. The constant is used in fulfilling the definition of D-RIP. It is proved that k-sparse signals can be reconstructed if by using a concise and transparent argument1. The approach could be extended to obtain other D-RIP bounds (i.e. ). Experiments contrast results of a Gabor tight frame with Total Variation minimization. In cases of practical interest, the use of a Gabor dictionary performs well when achieving a highly sparse representation and poorly when this sparsity is not achieved.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"8 1","pages":"39-48"},"PeriodicalIF":0.0,"publicationDate":"2016-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82099106","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}
In this paper a closed-form approximated expression is proposed for the Intersymbol Interference (ISI) as a function of time valid during the entire stages of the non-blind adaptive deconvolution process and is suitable for the noisy, real and two independent quadrature carrier input case. The obtained expression is applicable for type of channels where the resulting ISI as a function of time can be described with an exponential model having a single time constant. Based on this new expression for the ISI as a function of time, the convergence time (or number of iteration number required for convergence) of the non-blind adaptive equalizer can be calculated. Up to now, the equalizer’s performance (convergence time and ISI as a function of time) could be obtained only via simulation when the channel coefficients were known. The new proposed expression for the ISI as a function of time is based on the knowledge of the initial ISI and channel power (which is measurable) and eliminates the need to carry out any more the above mentioned simulation. Simulation results indicate a high correlation between the simulated and calculated ISI (based on our proposed expression for the ISI as a function of time) during the whole deconvolution process for the high as well as for the low signal to noise ratio (SNR) condition.
{"title":"Convergence Curve for Non-Blind Adaptive Equalizers","authors":"M. Pinchas","doi":"10.4236/JSIP.2016.71002","DOIUrl":"https://doi.org/10.4236/JSIP.2016.71002","url":null,"abstract":"In this paper a closed-form approximated expression is proposed for the Intersymbol Interference (ISI) as a function of time valid during the entire stages of the non-blind adaptive deconvolution process and is suitable for the noisy, real and two independent quadrature carrier input case. The obtained expression is applicable for type of channels where the resulting ISI as a function of time can be described with an exponential model having a single time constant. Based on this new expression for the ISI as a function of time, the convergence time (or number of iteration number required for convergence) of the non-blind adaptive equalizer can be calculated. Up to now, the equalizer’s performance (convergence time and ISI as a function of time) could be obtained only via simulation when the channel coefficients were known. The new proposed expression for the ISI as a function of time is based on the knowledge of the initial ISI and channel power (which is measurable) and eliminates the need to carry out any more the above mentioned simulation. Simulation results indicate a high correlation between the simulated and calculated ISI (based on our proposed expression for the ISI as a function of time) during the whole deconvolution process for the high as well as for the low signal to noise ratio (SNR) condition.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"33 1","pages":"7-17"},"PeriodicalIF":0.0,"publicationDate":"2016-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84728239","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}
In this paper, we proposed a metric to measure the shift invariance of the three different contourlet transforms. And then, using the same structure texture image retrieval system which use subband coefficients energy, standard deviation and kurtosis features with Canberra distance, we gave a comparison of their texture description abilities. Experimental results show that contourlet-2.3 texture image retrieval system has almost retrieval rates with non-sub sampled contourlet system; the two systems have better retrieval results than the original contourlet retrieval system. On the other hand, for the relatively lower redundancy, we recommend using contourlet- 2.3 as texture description transform.
{"title":"Shift Invariance Level Comparison of Several Contourlet Transforms and Their Texture Image Retrieval Systems","authors":"Xinwu Chen, Jingjing Xue, Zhen Liu, Wenjuan Ma","doi":"10.4236/JSIP.2016.71001","DOIUrl":"https://doi.org/10.4236/JSIP.2016.71001","url":null,"abstract":"In this paper, we proposed a metric to \u0000measure the shift invariance of the three different contourlet transforms. \u0000And then, using the same structure texture image retrieval system which use \u0000subband coefficients energy, standard deviation and kurtosis features with \u0000Canberra distance, we gave a comparison of their texture description abilities. \u0000Experimental results show that contourlet-2.3 texture image retrieval system \u0000has almost retrieval rates with non-sub sampled contourlet system; the two \u0000systems have better retrieval results than the original contourlet retrieval \u0000system. On the other hand, for the relatively lower redundancy, we recommend \u0000using contourlet- 2.3 as texture description transform.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"1 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2016-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73002816","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}
A novel optimized wavelet packet algorithm is proposed to improve the perception of sensorineural hearing-impaired people. In this work, we have developed optimized wavelet packet along with, biorthogonal wavelet basis functions using MATLAB Code. Here, we have created eight bands based on auditory filters of quasi octave bandwidth. Evaluation was carried out by conducting listening tests on seven subjects with bilateral mild to severe sensorineural hearing loss. The speech material used for the listening test consisted of a set of fifteen nonsense syllables in VCV context. The test results show that the proposed algorithm improves the recognition score, speech quality and transmission of overall feature specifically over the unprocessed signal. The response time also reduces significantly.
{"title":"Design of Optimized Wavelet Packet Algorithm to Improve Perception of Sensorineural Hearing Impaired","authors":"J. Chopade, N. P. Futane","doi":"10.4236/JSIP.2016.71003","DOIUrl":"https://doi.org/10.4236/JSIP.2016.71003","url":null,"abstract":"A novel optimized wavelet packet algorithm is proposed to improve the perception of sensorineural hearing-impaired people. In this work, we have developed optimized wavelet packet along with, biorthogonal wavelet basis functions using MATLAB Code. Here, we have created eight bands based on auditory filters of quasi octave bandwidth. Evaluation was carried out by conducting listening tests on seven subjects with bilateral mild to severe sensorineural hearing loss. The speech material used for the listening test consisted of a set of fifteen nonsense syllables in VCV context. The test results show that the proposed algorithm improves the recognition score, speech quality and transmission of overall feature specifically over the unprocessed signal. The response time also reduces significantly.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"21 1","pages":"18-26"},"PeriodicalIF":0.0,"publicationDate":"2016-02-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75522492","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}
Due to non-ideal coefficients of the adaptive equalizer used in the system, a convolutional noise arises at the output of the deconvolutional process in addition to the source input. A higher convolutional noise may make the recovering process of the source signal more difficult or in other cases even impossible. In this paper we deal with the fluctuations of the arithmetic average (sample mean) of the real part of consecutive convolutional noises which deviate from the mean of order higher than the typical fluctuations. Typical fluctuations are those fluctuations that fluctuate near the mean, while the other fluctuations that deviate from the mean of order higher than the typical ones are considered as rare events. Via the large deviation theory, we obtain a closed-form approximated expression for the amount of deviation from the mean of those fluctuations considered as rare events as a function of the system’s parameters (step-size parameter, equalizer’s tap length, SNR, input signal statistics, characteristics of the chosen equalizer and channel power), for a pre-given probability that these events may occur.
{"title":"Convolutional Noise Analysis via Large Deviation Technique","authors":"M. Pinchas","doi":"10.4236/JSIP.2015.64024","DOIUrl":"https://doi.org/10.4236/JSIP.2015.64024","url":null,"abstract":"Due to non-ideal coefficients of the adaptive equalizer used in the system, a convolutional noise arises at the output of the deconvolutional process in addition to the source input. A higher convolutional noise may make the recovering process of the source signal more difficult or in other cases even impossible. In this paper we deal with the fluctuations of the arithmetic average (sample mean) of the real part of consecutive convolutional noises which deviate from the mean of order higher than the typical fluctuations. Typical fluctuations are those fluctuations that fluctuate near the mean, while the other fluctuations that deviate from the mean of order higher than the typical ones are considered as rare events. Via the large deviation theory, we obtain a closed-form approximated expression for the amount of deviation from the mean of those fluctuations considered as rare events as a function of the system’s parameters (step-size parameter, equalizer’s tap length, SNR, input signal statistics, characteristics of the chosen equalizer and channel power), for a pre-given probability that these events may occur.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"36 1","pages":"259-265"},"PeriodicalIF":0.0,"publicationDate":"2015-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75495069","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}
Shafa-At Ali Sheikh, Aftab Zafar Majoka, K. Rehman, N. Razzaq, T. Zaidi
Atrial fibrillation (Afib) is related with heart failure, stroke, and high mortality rates. In frequency domain analysis, pre-requisite for Afib detection has been the estimation of reliable dominant frequency (DF) of atrial signals via different spectral estimation techniques. DF further characterizes Afib, and helps in its treatment. This paper aims at finding the most appropriate nonparametric FFT-based spectral estimation technique to estimate reliable DF for Afib detection. In this work, real-time intra-atrial electrograms have been acquired and pre-processed for frequency analysis. DF is estimated via Bartlett using Hanning window, and Welch methods. Regularity index (RI), a parameter to ensure reliability of DF, is calculated using Simpson 3/8 and Trapezoidal rules. The best method is declared based upon high accuracy of Afib detection using reliable DF. On comparison, Welch method is found to be more appropriate to estimate reliable DF for Afib detection with 98% accuracy.
{"title":"Nonparametric Spectral Estimation Technique to Estimate Dominant Frequency for Atrial Fibrillation Detection","authors":"Shafa-At Ali Sheikh, Aftab Zafar Majoka, K. Rehman, N. Razzaq, T. Zaidi","doi":"10.4236/JSIP.2015.64025","DOIUrl":"https://doi.org/10.4236/JSIP.2015.64025","url":null,"abstract":"Atrial fibrillation (Afib) is related with heart failure, stroke, and high mortality rates. In frequency domain analysis, pre-requisite for Afib detection has been the estimation of reliable dominant frequency (DF) of atrial signals via different spectral estimation techniques. DF further characterizes Afib, and helps in its treatment. This paper aims at finding the most appropriate nonparametric FFT-based spectral estimation technique to estimate reliable DF for Afib detection. In this work, real-time intra-atrial electrograms have been acquired and pre-processed for frequency analysis. DF is estimated via Bartlett using Hanning window, and Welch methods. Regularity index (RI), a parameter to ensure reliability of DF, is calculated using Simpson 3/8 and Trapezoidal rules. The best method is declared based upon high accuracy of Afib detection using reliable DF. On comparison, Welch method is found to be more appropriate to estimate reliable DF for Afib detection with 98% accuracy.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"102 1","pages":"266-276"},"PeriodicalIF":0.0,"publicationDate":"2015-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83950178","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}
Pub Date : 2015-07-18DOI: 10.2991/ICISMME-15.2015.24
Baishan Zhao, Chen Qi
This paper presents an implementation of a chaotic signal generator based on digital processing for three dimension system. A detailed description of the structure and function of each module design are presented, by comparing the experimental results and simulation results verify the feasibility of this method. The proposed chaotic signal generator offers a new alternative in random testing system or in secured data communication applications.
{"title":"Chaotic Signal Generator Design Based on Discrete System","authors":"Baishan Zhao, Chen Qi","doi":"10.2991/ICISMME-15.2015.24","DOIUrl":"https://doi.org/10.2991/ICISMME-15.2015.24","url":null,"abstract":"This paper presents an implementation of a chaotic signal generator based on digital processing for three dimension system. A detailed description of the structure and function of each module design are presented, by comparing the experimental results and simulation results verify the feasibility of this method. The proposed chaotic signal generator offers a new alternative in random testing system or in secured data communication applications.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"30 1","pages":"50-58"},"PeriodicalIF":0.0,"publicationDate":"2015-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89479114","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}
This paper investigates the generalized uncertainty principles of fractional Fourier transform (FRFT) for concentrated data in limited supports. The continuous and discrete generalized uncertainty relations, whose bounds are related to FRFT parameters and signal lengths, were derived in theory. These uncertainty principles disclose that the data in FRFT domains may have much higher concentration than that in traditional time-frequency domains, which will enrich the ensemble of generalized uncertainty principles.
{"title":"Support-Limited Generalized Uncertainty Relations on Fractional Fourier Transform","authors":"Xiaotong Wang, Guanlei Xu","doi":"10.4236/JSIP.2015.63021","DOIUrl":"https://doi.org/10.4236/JSIP.2015.63021","url":null,"abstract":"This paper investigates the generalized \u0000uncertainty principles of fractional Fourier transform (FRFT) for concentrated \u0000data in limited supports. The continuous and discrete generalized uncertainty \u0000relations, whose bounds are related to FRFT parameters and signal lengths, were \u0000derived in theory. These uncertainty principles disclose that the data in FRFT \u0000domains may have much higher concentration than that in traditional \u0000time-frequency domains, which will enrich the ensemble of generalized \u0000uncertainty principles.","PeriodicalId":38474,"journal":{"name":"Journal of Information Hiding and Multimedia Signal Processing","volume":"31 1","pages":"227-237"},"PeriodicalIF":0.0,"publicationDate":"2015-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80132087","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：