{"title":"Amalgamation of Singular Value Decomposition to JPEG for Enhanced Performance","authors":"N. A. Surobhi, Md. Ruhul Amin, George Green","doi":"10.1109/ICICT.2007.375396","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375396","url":null,"abstract":"The demand of digital information compression is increasing dramatically because of the dominance of multimedia technology and the limitations of the physical media for handling huge amount of information. Compression reduces the storage and transmission burdens of raw information by reducing the ubiquitous redundancy without losing its entropy significantly. The image manipulation that occupies a significant position in multimedia technology necessitated the development of joint photographic experts group (JPEG) compression technique, which has proved its usefulness so far. Until recently, to minimize the blocking artifact, inherently present in JPEG at higher compression ratios, JPEG2000 is devised that makes use of wavelet function. In this work, a new approach to JPEG compression technique is proposed that enhanced the compression performances in comparison with aforesaid JPEG techniques. The new technique considers both discrete cosine transform (DCT) and singular value decomposition (SVD) method in the transform and reconstruction sides instead of using DCT only. The incorporation of SVD with nearest neighborhood approach has improved the compression performances significantly. A rigorous comparison of the various compression indices are made to validate the proposed algorithm. This approach is named as 'Hybrid JPEG' (HJPEG) in this paper. The benchmark still image 'LENA' is used for performance comparison.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127295554","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":"Visualization of Complete Graphs, Trees and Series-Parallel Graphs for Practical Applications","authors":"Md. Abul Hassan Samee, Md. Saidur Rahman","doi":"10.1109/ICICT.2007.375334","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375334","url":null,"abstract":"Obtaining a comprehensive visualization of complete graphs, complete multipartite graphs and their homeomorphics has become a critical issue in many practical applications nowadays. Existing algorithms for drawing such graphs either impose restrictions on the number of vertices or use intricate mathematical concepts that make the drawing less comprehensive. Moreover, they are incapable of depicting the attributes of vertices and edges, which is often a requirement. In this paper, we present two 3D graph drawing conventions which can overcome these problems. We also show that it is possible in our convention to draw trees and series-parallel graphs with volume bounds of O(kn) and O(n2 log n) respectively, where k is the maximum degree of any vertex in the tree.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125066702","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":"Improved Survivable Routing Algorithm in WDM Mesh Networks","authors":"Lei Guo","doi":"10.1109/ICICT.2007.375409","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375409","url":null,"abstract":"We address the protection of single-link failure in WDM mesh networks and propose an improved algorithm named near optimal routing (NOR). With respect to previous algorithm, the advantage of NOR is to obtain near optimal solutions by re-routing the primary or backup paths. Simulation results are shown to be promising.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116001775","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}
Sangeeta Biswas, Shamim Ahmadt, Md Khademul, Islam Molladt
{"title":"Speaker Identification Using Cepstral Based Features and Discrete Hidden Markov Model","authors":"Sangeeta Biswas, Shamim Ahmadt, Md Khademul, Islam Molladt","doi":"10.1109/ICICT.2007.375398","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375398","url":null,"abstract":"This paper presents a speaker identification system using cepstral based speech features with discrete hidden Markov model (DHMM). The speaker features represented by the speech signal are potentially characterized by the cepstral coefficients. The commonly used cepstral based features; mel-frequency cepstral coefficient (MFCC), linear predictive cepstral coefficient (LPCC) and real cepstral coefficient (RCC) are employed with DHMM in the speaker identification system. The performances of the proposed method are compared with respect to each of the three feature spaces. The experimental results show that the identification accuracy with MFCC is superior to both of LPCC and RCC.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129675892","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 Improved Interleaver Design for Turbo Codes","authors":"K.N. Khan, J. Rehana, R. Debnath","doi":"10.1109/ICICT.2007.375358","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375358","url":null,"abstract":"This paper is aimed at designing of an effective interleaver for parallel concatenated coding schemes which utilizes the weight distribution as design criterion. We present a method here for designing an interleaver for achieving a minimum effective free distance of the code word so that error floor can be decreased. The method is expected to achieve a separation of radicN in the output code word. The proposed design has the advantage that the complexity grows linearly with the interleaver length.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"36 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132537554","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":"Microarray Classification and Rule Based Cancer Identification","authors":"J. Nahar, Y.-P.P. Chen, A. S. Shawkat Ali","doi":"10.1109/ICICT.2007.375339","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375339","url":null,"abstract":"Microarray analysis creates a clear scenario for the complete transcription profile of cells that facilitate drug and therapeutics development, disease diagnosis and enable us to take an in depth look at cell biology. One of the key challenges in microarray analysis, especially in cancerous gene expression profiles, is to identify genes or groups of genes that are highly responsible for the existence of a tumor in a cell. Our proposed modified algorithm support vector machine (SVM) is used to classify cancer related 5 microarray data and observed improved performance than previously used Interesting rule group (IRG), classification based on associations (CBA), and even a different version of SVM algorithm. Finally we use entropy measure through rule based learning algorithm to extract the responsible genes causes for cancer for each microarray problem. The rules are generated with higher acceptability.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128951472","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":"Noise Measurement in Low-Voltage Powerline for Modem Design and Serial Dataacquisition","authors":"R. C. Prajapati, C. L. Shrestha, B.B. Chhetri","doi":"10.1109/ICICT.2007.375354","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375354","url":null,"abstract":"Narrowband power line communication modem (PLCM), robust to the harsh and unpredictable characteristics of the power line channel, was designed for the purpose of serial data acquisition. This paper reviews the type of noise present in power line channel at narrowband, and noise measurement was carried out on the indoor low-voltage network at the frequency range from 20 kHz to 500 kHz. The results were used for the consideration of a robust and simple narrowband PLCM design. The modem was built upon the ATMEL microcontroller 89C51 chip to achieve reliable performance and reduced hardware complexity, and economic system. Master-slave architecture with RS-232 asynchronous serial communication has been followed. Proper carrier frequency-band and modulation schemes immune to synchronous impulse noise in low-voltage power line communication were suggested.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131263215","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":"Application of Event B to Modelling Multiagent Interactions","authors":"Hongjiang Gao, Ying He, Zheng Qin, Li-Ping Shao, Xingchen Heng","doi":"10.1109/ICICT.2007.375374","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375374","url":null,"abstract":"With increasingly complexity in MAS, rigorous design practices are needed in case of critical applications. Event B, which provides an accessible and rigorous formal approach to development of such complex system, is ideal for the formal modelling of reactive systems. In this paper we present a part of ongoing work in this area. A practical approach for developing flexible and reliable formal specifications of MAS using Event B is described, exemplified on contract net protocol (CNP) in the interaction of MAS, associating an intelligent shape and style design systems in automobile.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115673630","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":"Vertical Coupling Between Network Simulator and IEEE802.11 Based Simulator","authors":"M. Siddique, A. Konsgen, C. Gorg","doi":"10.1109/ICICT.2007.375357","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375357","url":null,"abstract":"In this paper, an interconnection between two different simulators is proposed to establish and realize a vertical coupling between network layer and link layer simulators. This investigation is done for two reasons. One is to find the effects of upper layers on the spectrum management, which is specified and implemented in the link layer, and the other one is to see the performance improvement of the network layer protocol by providing link layer info. Coupling is done and tested for a simple scenario and some data exchange results are shown in this paper.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114893907","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 Learning Algorithm for the Maxq Hierarchical Reinforcement Learning Method","authors":"F. Mirzazadeh, B. Behsaz, H. Beigy","doi":"10.1109/ICICT.2007.375352","DOIUrl":"https://doi.org/10.1109/ICICT.2007.375352","url":null,"abstract":"The MAXQ hierarchical reinforcement learning method is computationally expensive in applications with deep hierarchy. In this paper, we propose a new learning algorithm for MAXQ method to address the open problem of reducing its computational complexity. While the computational cost of the algorithm is considerably decreased, the required storage of new algorithm is less than two times as the original learning algorithm requires storage. Our experimental results in the simple taxi domain problem show satisfactory behavior of the new algorithm.","PeriodicalId":206443,"journal":{"name":"2007 International Conference on Information and Communication Technology","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116456026","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}