2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)最新文献

筛选
英文 中文
A content-based digital image watermarking algorithm robust against JPEG compression 一种基于内容的抗JPEG压缩数字图像水印算法
Amir Najafi, Ali Siahkoohi, M. Shamsollahi
{"title":"A content-based digital image watermarking algorithm robust against JPEG compression","authors":"Amir Najafi, Ali Siahkoohi, M. Shamsollahi","doi":"10.1109/ISSPIT.2011.6151601","DOIUrl":"https://doi.org/10.1109/ISSPIT.2011.6151601","url":null,"abstract":"Watermarking (imperceptible insertion of data into the host image or soundtracks) has attracted many research interests in the recent decade. The aim of this correspondence is to introduce a none-blind, content-based method for image watermarking. It employs properties of Human Visual System (HVS) and is capable of embedding a high-energy watermark (consequently robust against lossy compressions and other kinds of attacks) while prevents perceptible degradation in the host image. To modulate the binary coded watermark on a spread-spectrum noise, the introduced algorithm is followed by spread-spectrum watermarking. The algorithm was simulated and experimental results represent magnificent improvement in watermarking capacity and accuracy of extraction.","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125210241","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}
引用次数: 1
Audio bandwidth extension based on RBF neural network 基于RBF神经网络的音频带宽扩展
Haojie Liu, C. Bao, Xin Liu, Xingtao Zhang, Liyan Zhang
{"title":"Audio bandwidth extension based on RBF neural network","authors":"Haojie Liu, C. Bao, Xin Liu, Xingtao Zhang, Liyan Zhang","doi":"10.1109/ISSPIT.2011.6151551","DOIUrl":"https://doi.org/10.1109/ISSPIT.2011.6151551","url":null,"abstract":"In this paper a new method of blind bandwidth extension from wideband (WB) to super-wideband (SWB) audio is proposed. The Radial Basic Function (RBF) neural network is utilized to predict the coefficients of high-frequency (HF) based on the nonlinear characteristics of audio spectrum series. In addition, the linear extrapolation is used for reconstructing the envelop of HF spectrum. The bandwidth of the reconstructed audio signals is extended to SWB by using the proposed method. The result of the objective performance evaluation indicates that the proposed method can reconstruct the truncated HF components effectively and outperforms the conventional algorithms of blind bandwidth extension.","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122138457","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}
引用次数: 5
A fixed-point iterative schema for error minimization in k-sparse decomposition k-稀疏分解中误差最小化的不动点迭代模式
A. Adamo, G. Grossi
{"title":"A fixed-point iterative schema for error minimization in k-sparse decomposition","authors":"A. Adamo, G. Grossi","doi":"10.1109/ISSPIT.2011.6151554","DOIUrl":"https://doi.org/10.1109/ISSPIT.2011.6151554","url":null,"abstract":"Analogously to the well known greedy strategy called Orthogonal Matching Pursuit (OMP), we present a new algorithm to solve the sparse approximation problem over redundant dictionaries where the input signal is restricted to be a linear combination of k atoms or fewer from a fixed dictionary. The basic strategy of our method rests on a family of nonlinear mappings which results to be contractive in a interval close to zero. By iterating contractions and projections the method is able to extract the most significant components also for noisy signal which subsumes an ideal underlying signal having sufficiently sparse representation. For reasonable error level, the fixed point solution of such a iterative schema provides a sparse approximation containing only the nonzero terms characterizing the unique sparsest representation of the ideal noiseless sparse signal. The heuristic method so derived has been applied both to synthetic and real data. The former was generated by combining exact signals drawn by usual Bernoulli-Gaussian model and Gaussian noise; the later is taken by electrocardiogram (ECG) signals with application to the dictionary learning problem. In both cases the proposed method outperforms OMP method both regarding sparse approximation error and computation time.","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116616103","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}
引用次数: 12
Single channel speech/music segregation based on a novel K-means clustering schema 基于新颖k均值聚类模式的单通道语音/音乐分离
Seyed-Hossein Alavinia, F. Razzazi, H. Sadjedi
{"title":"Single channel speech/music segregation based on a novel K-means clustering schema","authors":"Seyed-Hossein Alavinia, F. Razzazi, H. Sadjedi","doi":"10.1109/ISSPIT.2011.6151629","DOIUrl":"https://doi.org/10.1109/ISSPIT.2011.6151629","url":null,"abstract":"In this paper, we proposed a modified version of K-means clustering algorithm for single channel separation of speech and music from mixed signal. K-means method fails for high dimensional data processing due to computational complexity and curse of dimensionality issues. To improve the performance of clustering algorithm, we used PCA technique and suggested a novel schema to increase the quality of outcome signals of PCA-Kmeans approach in both FFT and STFT domains. The efficiency of the proposed method is evaluated for different codebook sizes. The comparison between modified PCA-Kmeans algorithm and PCA-Kmeans approach for codebook size 512, showed that the quality of separation signals was improved about 12% in FFT and 20% in STFT without increase in the computational complexity. In addition, the modified PCA-Kmeans algorithm reduced the separation time up to 80% in FFT domain and 85% in STFT domain and improved the quality of segregated speech by about 20% in FFT and STFT domains in comparison with standard K-means method.","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128397220","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}
引用次数: 2
A graphical user interface watermarking technique for the copyright protection of colour images using colour watermarks 一种利用彩色水印对彩色图像进行版权保护的图形用户界面水印技术
A. Al-Gindy, Hana Younes, Amira Shaheen, Hala Elsadi
{"title":"A graphical user interface watermarking technique for the copyright protection of colour images using colour watermarks","authors":"A. Al-Gindy, Hana Younes, Amira Shaheen, Hala Elsadi","doi":"10.1109/ISSPIT.2011.6151587","DOIUrl":"https://doi.org/10.1109/ISSPIT.2011.6151587","url":null,"abstract":"This paper presents a new copyright protection technique using colour watermarks. The watermark is a RGB colour image where each pixel is represented by 24 bits. The RGB colour watermark is first preprocessed by converting it into binary sequence. The preprocessed colour watermark (binary image) is embedded multi-times into the green channel of the RGB host image by modifying the very low frequency coefficients of the DCT transformation. The new technique can resist classical attacks such as JPEG compression, low pass filtering, median filtering, cropping, and scaling attacks. Moreover, the recovery method is blind since it does not need the original host image for extraction. The proposed method implemented using a graphical user interface (GUI) to open, select, attack, evaluate and display the results of both the host image and colour watermark image. The implemented GUI is much easier for the end users to learn more than the traditional algorithms that need commands to be know and memorized.","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129013730","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}
引用次数: 9
Vocal folds paralysis detection using an adapted block matching algorithm 基于自适应块匹配算法的声带麻痹检测
A. M. Zorrilla, Eneko Lopetegui Alba, B. G. Zapirain
{"title":"Vocal folds paralysis detection using an adapted block matching algorithm","authors":"A. M. Zorrilla, Eneko Lopetegui Alba, B. G. Zapirain","doi":"10.1109/ISSPIT.2011.6151619","DOIUrl":"https://doi.org/10.1109/ISSPIT.2011.6151619","url":null,"abstract":"This paper presents the study of vocal videostroboscopic recordings to detect vocal folds paralysis using a combination of segmentation and block matching techniques. This approach involves three process steps: 1) a pre-processing stage 2) the segmentation of the glottal area is made analyzing the image textures applying Gabor filtering and 3) an adapted version of exhausted block matching algorithm is used. The adaptation consists on for each frame a personalized block size and search window is applied due to segmented region features. Finally, the results show that our proposal works correctly to detect automatically movement abnormalities of the vocal folds.","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114495720","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}
引用次数: 0
Comparing different approaches for model parameters identification in short time 比较了短时间内模型参数辨识的不同方法
Linghan Li, B. Kanning, C. Schenck, B. Kuhfuss
{"title":"Comparing different approaches for model parameters identification in short time","authors":"Linghan Li, B. Kanning, C. Schenck, B. Kuhfuss","doi":"10.1109/ISSPIT.2011.6151600","DOIUrl":"https://doi.org/10.1109/ISSPIT.2011.6151600","url":null,"abstract":"Model Parameter values of machine tools change during machining. An optimal process control needs precise knowledge of the actual parameter values. Three different algorithms are introduced to estimate the modal parameter values of system in a short time window with high resolution: least squares estimation (LSE), estimation of signal parameters via rotational invariance (ESPRIT) and orthogonal matching pursuits (OMP) algorithm. These algorithms are augmented with a sliding-window operation to reveal the actual system dynamic behavior at every time instance. This paper focuses on comparing the performance and the identification accuracy of the proposed methods and the influence of the applied window size and noise content using numerical examinations. The results show that the sliding-window LSE can estimate transient parameters accurately and suits realtime control processes.","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122044678","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}
引用次数: 0
Improving N-Finder technique for extracting endmembers 改进N-Finder端元提取技术
Mahmoud Maghrbay, R. Ammar, S. Rajasekaran
{"title":"Improving N-Finder technique for extracting endmembers","authors":"Mahmoud Maghrbay, R. Ammar, S. Rajasekaran","doi":"10.1109/ISSPIT.2011.6151533","DOIUrl":"https://doi.org/10.1109/ISSPIT.2011.6151533","url":null,"abstract":"N-FINDER algorithm is widely used for endmember extraction. One of the disadvantages of N-FINDER is that its implementations take long run time due to the relatively large computational complexity of N-FINDER. Successfully reducing the size of the input data set -the hyperspectral image - that the algorithm works on can reduce the overall run time of the algorithm. A method for successfully selecting the proper sample of the data set to work on is provided in this paper. Using this reduction technique, a faster and statistically more accurate version of N-FINDER is presented.","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127094558","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}
引用次数: 2
The effect of timing errors on frequency offset estimation in OFDM systems OFDM系统中定时误差对频偏估计的影响
S. Younis, A. Al-Dweik, C. Tsimenidis, B. Sharif, A. Hazmi
{"title":"The effect of timing errors on frequency offset estimation in OFDM systems","authors":"S. Younis, A. Al-Dweik, C. Tsimenidis, B. Sharif, A. Hazmi","doi":"10.1109/ISSPIT.2011.6151560","DOIUrl":"https://doi.org/10.1109/ISSPIT.2011.6151560","url":null,"abstract":"This work considers the effect of timing errors on the carrier frequency offset (CFO) estimation for orthogonal frequency division multiplexing (OFDM) systems. In general, most of the research conducted on OFDM systems assume that a wide range of timing errors can be tolerated due to the use of cyclic prefix (CP). Although such assumption might be valid for bit error rate (BER) analysis, it might not be the case for other processes such as CFO estimation. In this work, Monte Carlo simulations have been used to evaluate the effect of timing errors on the performance of several state-of-the-art CFO estimators for OFDM systems. The considered estimators include time domain, frequency domain, data-aided (DA) and blind estimators. Simulation results confirmed that particular CFO estimators, which are known to be highly accurate in perfect timing conditions, are very sensitive to timing offsets even if the offsets are within the inter-symbol-interference (ISI) free region of the CP. Other estimators offered high robustness for timing offsets in the entire range of the CP region. However, most of the considered estimators suffered from a severe performance degradation for timing errors out of the CP region.","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130800201","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}
引用次数: 15
Improving performance of Reed-Solomon decoder by error/erasure correction 通过纠错/擦除改进里德-所罗门解码器的性能
Kyungsu Ko, Il-hyuk Oh, D. Ko, Byung Gi Jung
{"title":"Improving performance of Reed-Solomon decoder by error/erasure correction","authors":"Kyungsu Ko, Il-hyuk Oh, D. Ko, Byung Gi Jung","doi":"10.1109/ISSPIT.2011.6151556","DOIUrl":"https://doi.org/10.1109/ISSPIT.2011.6151556","url":null,"abstract":"In this paper, we introduce a new scheme to improve the performance of the Reed-Solomon codes, which exploits the properties of the Reed-Solomon (RS) decoder to correct more errors by predicting as many erasures as possible in each RS packet in advance before decoding in the RS decoder. The concept Depth of Prediction (DoP) used for predicting erasures is introduced and derived. Simulation results show that with optimal DoP values, the new scheme yields performance gain of around 1dB at BER of 10−8 resulting in the extended coverage area of the communication system.","PeriodicalId":288042,"journal":{"name":"2011 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121110124","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信