{"title":"Reversible watermarking based on interpolation error histogram shifting","authors":"M. A. M. Abadi, H. Danyali, M. Helfroush","doi":"10.1109/ISTEL.2010.5734139","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734139","url":null,"abstract":"A reversible data hiding technique with high capacity of data embedding is presented in this paper. Using both difference expansion and histogram shifting methods at the same time we have improved Luo et al.'s method to increase the amount of data that can be embedded into the host image. First the image is examined for possible overflow/underflow problem that might occur during embedding; then if needed, histogram is shifted to prevent this overflow/underflow. At next stage, interpolation error is calculated and histogram of the interpolation error is shifted to embed watermark data. Because overflow/underflow is prevented, no boundary and/or overflow map is needed and instead a much smaller location map is used so that we can fully recover the image in extraction phase. Also, overhead data is embedded into the host image along with the actual watermark; therefore, no extra data is needed to be transmitted to receiving side as needed for some reversible watermarking schemes. Experimental results show that this method can achieve higher data embedding capacity compared to other reversible watermarking schemes at same PSNR.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"27 6 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":"130434070","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":"Compressed video sensing using adaptive sampling rate","authors":"M. Azghani, A. Aghagolzadeh, M. Aghagolzadeh","doi":"10.1109/ISTEL.2010.5734115","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734115","url":null,"abstract":"Compressive video sampling is an application of compressed sensing (CS) theory which samples a signal below the Shannon-Nyquist rate. In this paper, we present a compressed video sensing method that samples the blocks with adaptive sampling rate. The edge of the image is exploited to define a deficiency factor for blocks. Considering this factor, we determine sampling rates independently for each block. The simulation results show that the proposed method outperforms the conventional CS in image quality for the same compression ratio.","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":"130365491","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":"Mean-shift video tracking using color-LSN histogram","authors":"Hamed Rezazadegan Tavakoli, M. Moin","doi":"10.1109/ISTEL.2010.5734134","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734134","url":null,"abstract":"A texture based object tracking algorithm is presented. The algorithm is an extension to famous mean-shift tracking method. It does not rely on color histogram. It incorporates both color histogram and texture histogram information to model tracking target.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"57 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120992140","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":"An energy efficient algorithm for cluster-head selection in WSNs","authors":"M. Hajikhani, B. Abolhassani","doi":"10.1109/ISTEL.2010.5734059","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734059","url":null,"abstract":"In Wireless Sensor Networks (WSNs), recharging node batteries may be inconvenient or impossible. There are several different approaches to overcome this problem. LEACH (Low-Energy Adaptive Clustering Hierarchy) is a well known algorithm whose best advantage is that each node makes its decision about whether to be a cluster-head independently, but it cannot guarantee an even energy load distribution. To over come this problem, we should consider the remaining energy of each node and the average residual energy of its neighboring nodes. However, this makes the nodes to be dependent on each other. For this reason, in this paper, we propose an energy efficient cluster-head selection algorithm, which is an extension to the LEACH. Our new algorithm is based on the differentiation of each node's energy. In the proposed algorithm, each node cares about its neighboring nodes, without getting any information from them. Simulation results show that our proposed algorithm could better balance the load and prolong the lifetime of the network by about 10% compared with LEACH.","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":"130820446","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 new least-squares based method for selection of spectral peaks from the spectrum estimated by sparse representation","authors":"Adel Zahedi, M. Kahaei","doi":"10.1109/ISTEL.2010.5734108","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734108","url":null,"abstract":"In this paper, a new method for selection of spectral peaks is proposed, when the spectrum is estimated based on sparse representation. The proposed method fits the spectral peaks to the available data using least squares fitting, and then computes the remaining signal. If the remaining signal contains noise only, then all the spectral peaks are detected. Computer simulations verify that the proposed method is comparable to the case where the number of spectral peaks is known.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"42 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":"132669553","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":"Using identity-based secret public keys cryptography for heuristic security analyses in grid computing","authors":"Maysam Hedayati, S. H. Kamali, Reza Shakerian","doi":"10.1109/ISTEL.2010.5734028","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734028","url":null,"abstract":"The majority of current security architectures for grid systems use public key infrastructure (PKI) to authenticate identities of grid members and to secure resource allocation to these members. Identity-based secret public keys have some attractive properties which seem to align well with the demands of grid computing. In this Paper, we proposed identity-based secret public keys. Our new identity-based approach allows secret public keys to be constructed in a very natural way using arbitrary random strings, eliminating the structure found in, for example, RSA or Diffie-Hellman keys. We examine identity-based secret public key protocols and give informal security analyses which show that they may well be secure against online password guessing and other attacks. More importantly, we present an identity-based secret public key version of the standard TLS protocol. Our new protocol allows passwords to be tied directly to the establishment of secure TLS channels.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"19 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":"133192373","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}
N. Faraji, S. Ahadi, H. Sheikhzadeh, A. Moghaddamjoo
{"title":"A novel method for data segmentation to covariance stationary regions","authors":"N. Faraji, S. Ahadi, H. Sheikhzadeh, A. Moghaddamjoo","doi":"10.1109/ISTEL.2010.5734167","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734167","url":null,"abstract":"This paper presents a new method for segmenting non-stationary data to covariance-stationary regions that is of importance in some applications such as subspace-based speech enhancement. The proposed method utilizes a test statistic previously suggested for Synthetic Aperture Radar (SAR) image segmentation. In this paper, employing Random Matrix Theory, we derive two first moments of the test statistic which are used to define an explicit decision threshold rather than heuristic one. We show through Monte Carlo simulation some interesting properties of the test statistic. The reasonable performance of our approach is validated by means of ROC curve obtained as the result of applying the proposed method to the synthetic data. Moreover, we compare our algorithm with the two recently introduced algorithms of which one aimed at locating variance-stationary regions and the other is designed to find the data intervals with the same covariance structure. The superior performance of our algorithm as well as its low computational cost is shown in this paper.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"106 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":"134580785","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":"Investigation of coupling based on liquid crystal in two end-coupled microstrip resonators","authors":"M. Yazdanpanahi, D. Mirshekar-Syahkal","doi":"10.1109/ISTEL.2010.5734045","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734045","url":null,"abstract":"A new tunable planar coupled resonator structure based on nematic liquid crystals (LC) substrate for applications at mm-wave frequencies is presented. The proposed structure allows the use of electric field bias to align the LC molecules, offering direct control over the dielectric properties (anisotropy) of the LC substrate. The structure is designed for use of a LC mixture commonly referred to as E7. Symmetrical and asymmetrical couplings are investigated using this coupled resonator structure. In both cases, coupling tunability of about 20% is achieved in the 30 – 40 GHz range. The proposed structure can also be exploited to realize miniaturized tunable filters with wide tuning range at mm-wave frequencies.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"19 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":"134303922","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 compact dual-band Triangular slot antenna with three imported slits for WLAN applications","authors":"M. Vatankhah, M. Azarmanesh, Farzad Yazdani","doi":"10.1109/ISTEL.2010.5734007","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734007","url":null,"abstract":"A compact triangular slot antenna, suitable for wireless local area network (WLAN) is proposed. Dual frequency band operation that covers the 2.4GHz (2400–2484MHz) and 5GHz (5150–5825MHz) was obtained by embedding three slits in a triangular slot on the ground plane of antenna. The bandwidth of the upper band can be tuned by varying the width of the shorter slit. For the lower band the bandwidth depends on the width of the long slits, besides the length of the slits controls the resonance frequency of the lower band. In order to examine the performance of the antenna, a prototype was fabricated and the desirable parameters were measured. The antenna resonances at 2.45GHz with a bandwidth of 10% (for return loss <−10dB), and at 5.5 GHz with a bandwidth of 24%. Measured results were compared with those simulated by Ansoft High Frequency Structure Simulator (HFFS) software and a good agreement was obtained.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"106 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":"133295806","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}
Y. Shekofteh, F. Almasganj, Ahmadreza Rezaei, M. M. Goodarzi
{"title":"Two novel FDLP based feature extraction methods for improvement of speech recognition","authors":"Y. Shekofteh, F. Almasganj, Ahmadreza Rezaei, M. M. Goodarzi","doi":"10.1109/ISTEL.2010.5734095","DOIUrl":"https://doi.org/10.1109/ISTEL.2010.5734095","url":null,"abstract":"In conventional automatic speech recognition systems, linguistic information of the speech signal are usually acquired from short-time frames about 10–30 ms. In this paper we have proposed two novel methods extracting the long-term information of the speech signal. Both of the methods are based on “sub-band FDLP” which divides the long-time frame of signal into several sub-bands. Using the MFCC algorithm, we are able to represent the long-term temporal features of the each sub-band. Our results show that the proposed methods could improve the recognition ratio by %1.73. The proposed methods were evaluated using the FarsDat database and the method's robustness against different conditions of noise was experimented.","PeriodicalId":306663,"journal":{"name":"2010 5th International Symposium on Telecommunications","volume":"14 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":"133333184","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}