{"title":"Variable Bits Secure System for Color Images","authors":"Kirti Upreti, Kriti Verma, Anita Sahoo","doi":"10.1109/ACT.2010.58","DOIUrl":"https://doi.org/10.1109/ACT.2010.58","url":null,"abstract":"This paper proposes an RGB-based, secure technique to maintain and authenticate the integrity of a document. The novel Steganographic algorithm that we have proposed has its strength greatly enhanced by use of hybrid cryptography on data that is to be hidden in cover image. The secret message is converted into two kinds of plaintexts by subsequent ASCII and binary conversions and suitable bit stuffing. Two cipher texts are obtained using RSA and IDEA algorithms, which make up for a hybrid crypto-system. Both of these cipher texts are hidden in the cover image of the note using our novel, variable-length lSB-based Steganographic technique for data hiding in RGB images. One cipher text is used to determine the position for data hiding and the other cipher text is hidden in the lSBs of the color channel (that have minimum color contribution in the image) of the chosen pixels using variable length lSB based data embedding. Maximum intensity color channel is used to indicate which minimum intensity channel has how many bits of data embedded in it. We define the indicator and data channels from among the RGB color channels and use them for hiding of respective data in the cover image. Choosing such channels for hiding indicator and data bits, causes minimum distortion in the color of the pixels and such changes go undetected by Human Vision System (HVS).","PeriodicalId":147311,"journal":{"name":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126338663","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":"Adaptive Observer Based Tracking Control for a Class of Uncertain Nonlinear Systems with Delayed States and Input Using Self Recurrent Wavelet Neural Network","authors":"M. Sharma, A. Verma","doi":"10.1109/ACT.2010.39","DOIUrl":"https://doi.org/10.1109/ACT.2010.39","url":null,"abstract":"This paper proposes an observer based adaptive tracking control strategy for a class of uncertain nonlinear systems with delay in state as well as in input. Self recurrent wavelet neural network (SRWNN) is used to approximate the uncertainties present in the system as well as to identify and compensate the dynamic nonlinearities. The architecture of the SRWNN is a modified model of the wavelet neural network (WNN). However, unlike WNN, since a mother wavelet layer of the SRWNN is composed of self feedback neurons, the SRWNN can store the past information of wavelets. In addition robust control terms are also designed to attenuate the approximation error due to SRWNN. Adaptation laws are developed for the online tuning of the wavelet parameters and the stability of the overall system is assured by using the lyapunov-Krasovskii functional. Finally some simulations are performed to verify the effectiveness and performance of the proposed control scheme.","PeriodicalId":147311,"journal":{"name":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128143513","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":"Managing Distributed Temperature Measurements in an Embedded System of a 3-Phase 10 kVA Energy Efficient Switchable Distribution Transformer Employing a Modular Approach","authors":"H. Dharmawan, Sam A. M. Ali","doi":"10.1109/ACT.2010.21","DOIUrl":"https://doi.org/10.1109/ACT.2010.21","url":null,"abstract":"Temperature measurements are one of the most significant factors in condition monitoring and protecting transformers as well as estimating their life expectancy. With switchable transformers, it is also significant to carry out temperature monitoring to protect the switching devices. This paper presents techniques to manage temperature measurements of the windings and core of a 3-phase 10kVA switchable distribution transformer as well as switching devices that connect the tappings of the transformer. Serial digital temperature sensors DS18S20 were utilized to read the temperatures of all intended points which were distributed around the transformer and switching devices. Multi-drop connections through 1-Wire® buses were implemented to interface the sensors with some micro controllers which were located in some separated modules. Furthermore a Controller Area Network (CAN) bus was used to enable the exchange of measurement results between the modules. Software has also been developed to follow a previously developed protocol for communication through the CAN bus. From testing results, it could be shown that the techniques could be implemented by using the embedded system to achieve reliable distributed temperature measurements for the transformer and switching devices. In addition, results of the measurements reveal that the implementation of a parallel configuration of the windings at high loads reduces losses caused by the windings, which in turn improves the efficiency of the transformer.","PeriodicalId":147311,"journal":{"name":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132233713","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":"Chromosome Centromere and Chromatid's Banding Identification Using Pattern Vector","authors":"R. Trimananda","doi":"10.1109/ACT.2010.14","DOIUrl":"https://doi.org/10.1109/ACT.2010.14","url":null,"abstract":"Karyotyping and chromosome analysis are very useful in biological applications, e.g. disease identification. The very first step of karyotyping is the identification of chromosome, starting from identifying its basic parts: chromatids, centromere, and bands. By successfully recognizing those parts on the analyzed chromosome, we can use some of the available imaging techniques to analyze the patterns of every part to determine, which chromosome it is among the collection of chromosomes an individual living being has. For this purpose, we take the pattern vectors from the chromosome pictures and compare them with the ones of the chromosome prototypes. Thereafter, the relative error is calculated for each comparison. Thus, each chromosome in the picture will be identified and matched with its prototype. This method is considered simple and, yet, robust for this purpose.","PeriodicalId":147311,"journal":{"name":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125226344","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":"Real Time Model of Fuzzy Random Regression Based on a Convex Hull Approach","authors":"A. A. Ramli, J. Watada, W. Pedrycz","doi":"10.1109/ACT.2010.19","DOIUrl":"https://doi.org/10.1109/ACT.2010.19","url":null,"abstract":"In this study, we present a new idea dealing with the analysis of fuzzy random variables (FRVs) being treated as samples of data. The proposed concept can be used to model various real-life situations where uncertainty is not only present in the form of randomness but also comes in the form of imprecision described in terms of fuzzy sets. We propose a hybrid approach, which combines a convex hull approach (called Beneath-Beyond algorithm) with a fuzzy random regression analysis. Falling under the umbrella of intelligent data analysis (IDA) tool, this approach is suitable for real-time implementation of data analysis. For a fuzzy random data set, we include simulation results and highlight two main advantages, namely a decrease of required analysis time and a reduction of computational complexity. This emphasizes that the proposed IDA approach becomes an efficient way for real-time data analysis.","PeriodicalId":147311,"journal":{"name":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","volume":"506 Pt A 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126046297","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}
T. Zulcaffle, A. Othman, W. Abidin, Shahrol Mohammaddan, A. Marzuki
{"title":"A Thresholding Algorithm for Text/Background Segmentation in Degraded Handwritten Jawi Documents","authors":"T. Zulcaffle, A. Othman, W. Abidin, Shahrol Mohammaddan, A. Marzuki","doi":"10.1109/ACT.2010.43","DOIUrl":"https://doi.org/10.1109/ACT.2010.43","url":null,"abstract":"The old documents in Jawi script are being used widely for references. The hard copies of those scripts will deteriorate as time passes. Most of the previous works on Jawi documents focused on the character recognition and the accuracy of the algorithm was very much affected by noise. An effective preprocessing method is required to binarize degraded Jawi document. In this paper, a new technique to threshold degraded Jawi document is proposed. The results of the new algorithm were also evaluated and compared with several algorithms. The quality of the thresholding methods was assessed using visual inspection and mathematical evaluation. The results show that the new technique has outclassed other binarization algorithms.","PeriodicalId":147311,"journal":{"name":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122623051","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 Fast Algorithm in Exponential Change-Points Model with Comparison","authors":"Kuo-Ching Chang, Chui-liang Chiang, Chung-Bow Lee","doi":"10.1109/ACT.2010.17","DOIUrl":"https://doi.org/10.1109/ACT.2010.17","url":null,"abstract":"The dynamic programming (DP) algorithm can be used to find an exact solution of the maximum likelihood estimation of change points in a sequence of data from exponential family. Since the algorithm has a quadratic complexity in data size n, it is computationally burdensome if the data size n is large. In this work, a fast two-stage (TS) algorithm by window method is proposed. The window method is simple and interesting. The first stage is to apply the window method based on the log likelihood ratio measure to find a subset of candidate change points, and use DP algorithm on the chosen subset to obtain good initial change points which will be proximate to the locations of the true change points. The second stage is to apply the segmental K-means (SKM) algorithm on the initial change points obtained in the first stage. Some simulated data sets are investigated for DP, SKM and TS three algorithms. We find that, in comparison of CPU times, the SKM algorithm is fastest than DP and TS algorithm with the largest error in the estimation of change points. For TS and DP algorithms, both yield the small errors, but in the speed of CPU times, our TS algorithm can be up to 18.94 times faster than the DP algorithm. The results show that our algorithm works very well. It substantially reduces the computation load for large data size n.","PeriodicalId":147311,"journal":{"name":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127363291","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 Simulink Implementation of the Cerebellum Model Articulation Controller","authors":"S. Mathew, P. Giri, M. Agwan","doi":"10.1109/ACT.2010.47","DOIUrl":"https://doi.org/10.1109/ACT.2010.47","url":null,"abstract":"This paper presents a Simulink implementation of the CMAC controller which was proposed by J.S. Albus. The controller was implemented using the MatlAB S-function so that it can be used by a control engineer working on the Simulink platform to study the feasibility of using the CMAC controller for his control application. Simulations with various quantization levels and learning rates were done for three different processes.","PeriodicalId":147311,"journal":{"name":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134394929","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 Intelligent Searching Using Self-Organizing Map for Webmining Used in Document Containing Information in Relation to Cyber Terrorism","authors":"E. Endy, Charles Lim, Kho I Eng, A. Nugroho","doi":"10.1109/ACT.2010.35","DOIUrl":"https://doi.org/10.1109/ACT.2010.35","url":null,"abstract":"The terrorism activities are not only in real world as development of technology, but also in cyber world. Terrorism activities in cyber world are called cyber terrorism. One of methodology for cyber terrorism detection is by applying data mining algorithm to textual content of terrorism related web pages. Web mining is technology applied to extract information from the web. By using web mining, cyber terrorism information will be collected from internet. This research aims to use text cluster technique, by which the web documents are clustered using Self-Organizing Map algorithm based on number of occurrences of the certain words in documents that have relevance to cyber terrorism. The result shows mapping of the clustered documents that have performance 6.1 and 22.75 in term of vector quantization error (VQE). According this result, we concluded that Self-Organizing Map (SOM) is able to visualizethe topology of the data, by converting statistical relationship among the data into simple geometrical relationship of their image points in 2-dimensional grid.","PeriodicalId":147311,"journal":{"name":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134532071","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":"Image Enhancement and Image Restoration for Old Document Image Using Genetic Algorithm","authors":"H. Deborah, A. M. Arymurthy","doi":"10.1109/ACT.2010.24","DOIUrl":"https://doi.org/10.1109/ACT.2010.24","url":null,"abstract":"This paper presents the use of genetic algorithm in old document image enhancement and restoration. The term of ‘old document’ is document coming from hundreds years ago. The purpose of the study is to preserve the information contained in old documents into a digital form, because the process to rescue the old images using physical approach is too slow. The main contribution of this study is in the development of its fitness function to select new population and the best new enhanced image. The experimental results also show the influence of using the median filter in the image preprocessing. The results show relatively effective image enhancement (92.9% data get more than 90% success rate), and in general the effect of using the median filter preprocessing is not good that makes blurring effect to the images (only 59.5% data get success rate above 90%).","PeriodicalId":147311,"journal":{"name":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132077504","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}