2010 5th International Symposium on Telecommunications最新文献

筛选
英文 中文
Security enhancement for TPVD steganographic method TPVD隐写方法的安全性增强
2010 5th International Symposium on Telecommunications Pub Date : 2010-12-01 DOI: 10.1109/ISTEL.2010.5734025
Nazanin Zaker, A. Hamzeh
{"title":"Security enhancement for TPVD steganographic method","authors":"Nazanin Zaker, A. Hamzeh","doi":"10.1109/ISTEL.2010.5734025","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734025","url":null,"abstract":"The steganographic method named Tri-way Pixel Value Differencing (TPVD) which is a modified version of original Pixel Value Differencing (PVD) steganography, has significantly improved the embedding capacity of original method by embedding secret bits in all horizontal, vertical and diagonal edges of cover images. However, we have shown in this paper that TPVD is drastically vulnerable to statistical analysis of histogram of pixel differences. The occurrence of unusual steps in the derived histogram of pixel differences demonstrates the existence of hidden message. In order to enhance the security, we applied modifications on TPVD steganography and made it secure against current steganalysis. In the proposed modified algorithm, TPVD's embedding phase is mixed with our previously proposed method named EPVD, and the visual characteristics of cover image are genuinely maintained.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124533282","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
New approaches to speech enhancement using phase correction in Wiener filtering 基于维纳滤波相位校正的语音增强新方法
2010 5th International Symposium on Telecommunications Pub Date : 2010-12-01 DOI: 10.1109/ISTEL.2010.5734149
P. Fardkhaleghi, M. Savoji
{"title":"New approaches to speech enhancement using phase correction in Wiener filtering","authors":"P. Fardkhaleghi, M. Savoji","doi":"10.1109/ISTEL.2010.5734149","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734149","url":null,"abstract":"Typical speech enhancement algorithms that operate in the Fourier domain only modify the magnitude component of the noisy speech. It is commonly understood that the phase component is perceptually unimportant, and thus, it is passed directly to the output. Nevertheless, it has been reported in recent experiments that the Short-Time Fourier Transform (STFT) phase spectrum contributes significantly to speech intelligibility. Motivated by this, we investigated the role of phase spectrum in speech enhancement using Wiener filtering and Martin's minimum statistics. In this paper we report on results obtained using optimization algorithms, for phase correction of each processed frame, that intend to match the waveform of the zero-phase Wiener filtered speech to the conventional filter output obtained with noisy phase characteristic. No a priori information on the original phase is assumed. We show that better results are achieved using phase correction for different noise types. Different criteria are used for optimization with results similar to the case when the actual clean speech phase is at hand. Almost as good results are also obtained when minimizing the Wiener filter impulse response dispersion. The achieved improvement is assessed through different measurements such as signal to noise ratio (SNR), Segmental signal to noise ratio, and Perceptual Estimation of Speech Quality (PESQ).","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128220836","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}
引用次数: 4
A new hierarchical-clustering combination scheme based on scatter matrices and nearest neighbor criterion 一种基于散点矩阵和最近邻准则的分层聚类组合方案
2010 5th International Symposium on Telecommunications Pub Date : 2010-12-01 DOI: 10.1109/ISTEL.2010.5734151
Morteza Jalalat-evakilkandi, Abdolreza Mirzaei
{"title":"A new hierarchical-clustering combination scheme based on scatter matrices and nearest neighbor criterion","authors":"Morteza Jalalat-evakilkandi, Abdolreza Mirzaei","doi":"10.1109/ISTEL.2010.5734151","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734151","url":null,"abstract":"In the field of pattern recognition, combination of different classifiers is a common method to improve classification accuracy. Recently, tendency to improve the function of clustering methods, specifically partitional clustering methods, is being increased. Generally, hierarchical clustering is preferred to partitional clustering when the number of exact clusters is undetermined or when we are interested in finding the relation between clusters. Most of the proposed methods for clustering combination are based on partitional clustering. In this paper, a new method for combination of hierarchical clustering is proposed. In this method, in the first step the primary dendrograms of base hierarchical clustering methods (such as Single Linkage and Complete Linkage) are converted to matrices. Then these matrices are synthesized together in a weighted procedure and led to a final description matrix. The weights are determined based on two criteria: clustering scatter matrices and nearest neighbour of each pattern. The results show improvement in function of combination method rather than base clustering methods.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"625 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131623524","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}
引用次数: 8
A compact microstrip slot antenna with novel E-shaped coupling aperture 一种新型e型耦合孔径微带槽天线
2010 5th International Symposium on Telecommunications Pub Date : 2010-12-01 DOI: 10.1109/ISTEL.2010.5734008
Omid Hoseini Izadi, Mandana Mehrparvar
{"title":"A compact microstrip slot antenna with novel E-shaped coupling aperture","authors":"Omid Hoseini Izadi, Mandana Mehrparvar","doi":"10.1109/ISTEL.2010.5734008","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734008","url":null,"abstract":"A microstrip slot antenna with novel E-shaped coupling aperture is presented. Different parameters of the antenna are explored. It's shown that by varying the dimensions of E-shaped slot and length of Ls (matching stub), the antenna can be designed for high gain, dual band or quad band characteristic. As it's shown compacting the antenna is also possible. A simple patch antenna, a dual band antenna and a practical quad band antenna is designed. The last one is developed to meet IEEE 802.11a/b/g and IEEE 802.16d standards in order to cover all of the wireless LAN and WiMAX frequency bands. Last two antennas are 47% smaller than a regular patch antenna resonating at 2.47GHz while providing relative high gain and very good efficiency. HFSS and CST softwares are exploited to verify the antennas performance.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131677095","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}
引用次数: 23
Optimal power allocation to improve the performance of narrowband cooperative networks 优化功率分配以提高窄带合作网络的性能
2010 5th International Symposium on Telecommunications Pub Date : 2010-12-01 DOI: 10.1109/ISTEL.2010.5734068
B. Lashkari, M. Biguesh, Shapour Golbahar Haghighi
{"title":"Optimal power allocation to improve the performance of narrowband cooperative networks","authors":"B. Lashkari, M. Biguesh, Shapour Golbahar Haghighi","doi":"10.1109/ISTEL.2010.5734068","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734068","url":null,"abstract":"In this paper, we have focused on orthogonal non-regenerating cooperation for networks with a source-destination pair and a number of relay nodes. We proposed two power allocation problems based on the instantaneous and average information about the channel gains to maximize either the instantaneous or average signal-to-noise ratio at the destination. We also assumed that the network total energy consumption is fixed. Since the suggested optimization problems are complicated to solve, we developed an iterative algorithm that converts the problems into a generalized geometric programming problem which derives the optimal solution very fast. The simulation results confirmed that the proposed power allocation schemes improve the system performance.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133112225","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
A study to find influential parameters on a Farsi-English statistical machine translation system 法英统计机器翻译系统中影响参数的研究
2010 5th International Symposium on Telecommunications Pub Date : 2010-12-01 DOI: 10.1109/ISTEL.2010.5734165
S. Bakhshaei, Shahram Khadivi, N. Riahi, H. Sameti
{"title":"A study to find influential parameters on a Farsi-English statistical machine translation system","authors":"S. Bakhshaei, Shahram Khadivi, N. Riahi, H. Sameti","doi":"10.1109/ISTEL.2010.5734165","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734165","url":null,"abstract":"The aim of this paper is to analyze the Farsi-English statistical machine translation systems as a useful communication tool. Improvement of the nation's communication increases the need of easier way of translating between different languages in front of expensive human translators. In this work, a statistical phrase-based system is run on Farsi - English pair languages and the effect of its parameters on the translation quality has been deeply studied. Using BLEU as a metric of translation accuracy, the system achieves an improvement of 1.84%, relative to the baseline accuracy, which is increment from 16.97% to 18.81% in the best case.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133910796","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}
引用次数: 4
Performance analysis of nonuniform sampling based iterative equalizer for OFDM signals 基于非均匀采样的OFDM信号迭代均衡器性能分析
2010 5th International Symposium on Telecommunications Pub Date : 2010-12-01 DOI: 10.1109/ISTEL.2010.5734110
A. Rahmati, P. Azmi
{"title":"Performance analysis of nonuniform sampling based iterative equalizer for OFDM signals","authors":"A. Rahmati, P. Azmi","doi":"10.1109/ISTEL.2010.5734110","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734110","url":null,"abstract":"A precise method for calculating the bit error probability (BEP) of an iterative equalization-based oversampled OFDM system on fading channels in the presence of spectral nulls is derived. Several signaling formats, such as binary phase-shift keying, quaternary phase-shift keying, and M-ary quadrature amplitude modulation are considered.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128010879","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
Quorum-based pure directional neighbor discovery in self-organized ad hoc networks 自组织ad hoc网络中基于群体的纯定向邻居发现
2010 5th International Symposium on Telecommunications Pub Date : 2010-12-01 DOI: 10.1109/ISTEL.2010.5734073
Sina Khatibi, M. Dehghan, Mohammad Ali Poormina
{"title":"Quorum-based pure directional neighbor discovery in self-organized ad hoc networks","authors":"Sina Khatibi, M. Dehghan, Mohammad Ali Poormina","doi":"10.1109/ISTEL.2010.5734073","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734073","url":null,"abstract":"Neighbor discovery is vital for initialing and maintaining self-organized ad hoc networks. In order to exchange advertise messages and learn about each other presence, nodes have to aim their antennas toward each other when they are only utilized by directional antennas. Since ad hoc networks nodes have no former information about each other, neighbor discovery in directional ad hoc networks becomes more challenging. An asynchronous pure directional quorum-based neighbor discovery technique is proposed for the first time in this paper. Using quorum system for realizing the pure directional asynchronous and deterministic neighbor discovery is the novelty of this approach. All nodes are able to find all their potential neighbors in a relatively small time interval using proposed and transmission scenario and neighbor discovery. The independency of quorum based neighbor discovery to omnidirectional antennas during discovery process divides this approach from former related solutions. The suggested approach, by means of quorum system guarantees at least a common active interval for any two reciprocal beams during neighbor discovery procedure. The correctness of quorum based neighbor discovery in directional ad hoc network is discussed besides evaluating by series of simulations. This approach can be classified as fully directional handshake-based deterministic neighbor discovery algorithm.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128983930","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}
引用次数: 7
Frequency-domain equalization for MIMO-OFDM over doubly selective channels 双选择信道上MIMO-OFDM的频域均衡
2010 5th International Symposium on Telecommunications Pub Date : 2010-12-01 DOI: 10.1109/ISTEL.2010.5734065
M. Beheshti, M. Omidi, A. Doost-Hoseini
{"title":"Frequency-domain equalization for MIMO-OFDM over doubly selective channels","authors":"M. Beheshti, M. Omidi, A. Doost-Hoseini","doi":"10.1109/ISTEL.2010.5734065","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734065","url":null,"abstract":"Orthogonal frequency division multiplexing (OFDM) systems may confront significant intercarrier interference (ICI) when applied in doubly selective channels. Furthermore, the insufficient cyclic prefix (CP) leads to interblock interference (IBI) which again results in ICI. These interferences cause an early error floor in conventional receivers. In this paper, we characterize the doubly selective channel using a basis expansion model (BEM) and propose a frequency-domain equalization approach to jointly combat the ICI and IBI. We also derive a low-complexity scheme for the proposed approach. Simulation results show the superior performance of the proposed equalizer.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129078332","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
Using Phase Space based processing to extract proper features for ASR systems 采用基于相空间的处理方法提取ASR系统的特征
2010 5th International Symposium on Telecommunications Pub Date : 2010-12-01 DOI: 10.1109/ISTEL.2010.5734094
Y. Shekofteh, F. Almasganj
{"title":"Using Phase Space based processing to extract proper features for ASR systems","authors":"Y. Shekofteh, F. Almasganj","doi":"10.1109/ISTEL.2010.5734094","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734094","url":null,"abstract":"In this paper a feature extraction technique using Reconstructed Phase Spaces (RPS) is presented, which improves the overall performances of typical speech recognition systems. Unlike conventional feature extraction methods that use FFT based algorithm as power spectrum estimation (PSE) of speech signal, the proposed method is based on the trajectory and flow matrix of signal's RPS. In this manner, a new representation of power spectrum is obtained using two dimensional DFT algorithm by which, we can gain modify versions of common feature extraction methods such as MFCC. We conducted some speech recognition experiments using HTK, the known HMM-based toolkit, over FARSDAT, a known Persian speech corpus. Through this modified version of feature extraction method, we gained 1.35% word error rate improvement in comparison to the baseline system which exploits the typical MFCC feature extraction method.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"1949 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129208740","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}
引用次数: 10
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学术官方微信