发布求助
文献互助 智能选刊 最新文献

2006 International Conference on Advanced Computing and Communications最新文献

筛选
英文 中文
Lossy Color Image Compression Technique using Fractal Coding with Different Size of Range and Domain Blocks 基于不同范围和域块大小的分形编码的有损彩色图像压缩技术
2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289890
N. Koli, Dr. M. S. Ali, S. G. B. Amravati
{"title":"Lossy Color Image Compression Technique using Fractal Coding with Different Size of Range and Domain Blocks","authors":"N. Koli, Dr. M. S. Ali, S. G. B. Amravati","doi":"10.1109/ADCOM.2006.4289890","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289890","url":null,"abstract":"This paper proposed the approach based on fractal coding which falls in the lossy compression category. Fractal coding is generally used for grey level images. Proposed method firstly separate the three planes of RGB color space images and then the fractal coding algorithm is applied on individual planes independently. Extensive experiments are carried out with different size of domain blocks and range blocks on well-known color space images from literature. Results are analyzed with respect to the time, image compression ratio and image reconstruction quality. Implementation results shows that the greater compression ration can be achieved with large domain blocks but more trade off in image quality. Results are compared and represented with the performance graph. The proposed method can be useful for the huge database applications where the image reconstruction quality does not matter much. Time complexity of the proposed method is in the order of n2 .","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127960910","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
Notice of Violation of IEEE Publication PrinciplesInterference Detection in Optical CDMA Networks 违反IEEE出版原则的通知。光CDMA网络中的干扰检测
2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289923
A. Govardhan, S. Charles, S. Sultana
{"title":"Notice of Violation of IEEE Publication PrinciplesInterference Detection in Optical CDMA Networks","authors":"A. Govardhan, S. Charles, S. Sultana","doi":"10.1109/ADCOM.2006.4289923","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289923","url":null,"abstract":"Optical CDMA local area networks allow shared access to a broadcast medium. Every node is assigned an optical orthogonal codeword (OOC) to transmit or receive on. Optical CDMA systems have low throughput under moderate to heavy offered load due to interference between codewords. Interference Sensing is a media access architecture where nodes on the network sense the amount of interference on the line before transmission. Nodes defer transmissions if there is interference on the line. This paper discusses and analyzes three algorithms for interference sensing. Through simulation it is shown that these algorithms reduce or eliminate throughput degradation at high loads. The study shows that simple algorithms such as selfish or threshold based algorithms are sufficient to eliminate throughput degradation.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128510901","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
Segmentation of Horizontally Overlapping lines in Printed Gurmukhi Script 印刷古尔穆克文字中水平重叠线的分割
2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289888
M. Jindal, R.K. Sharma, G. Lehal
{"title":"Segmentation of Horizontally Overlapping lines in Printed Gurmukhi Script","authors":"M. Jindal, R.K. Sharma, G. Lehal","doi":"10.1109/ADCOM.2006.4289888","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289888","url":null,"abstract":"Multiple horizontally overlapping lines are normally found in printed newspapers of almost every language due to high compression methods used for printing of the newspapers. For any optical character recognition (OCR) system, presence of horizontally overlapping lines decreases the recognition accuracy drastically. In this paper, we have proposed a solution for segmenting horizontally overlapping lines. Whole document has been divided into strips and proposed algorithm has been applied for segmenting horizontally overlapping lines and associating small strips to their respective lines. The results reveal that the algorithm is almost 99% perfect when applied to the Gurmukhi script.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115931188","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}
引用次数: 13
A Novel Compression Technique for Color Image Database 一种新的彩色图像数据库压缩技术
2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289891
N. V. Thakur, O. Kakde
{"title":"A Novel Compression Technique for Color Image Database","authors":"N. V. Thakur, O. Kakde","doi":"10.1109/ADCOM.2006.4289891","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289891","url":null,"abstract":"This paper presents a novel compression technique for color image database using fractal coding and spiral architecture. Fractal coding is used for gray level images. Although new approaches have been proposed that compress gray level and color images, the proposed approach, firstly, forms one-plane image from three color planes of RGB color space image. Then the one-plane image in traditional square structure is represented in spiral architecture for compression. On this new spiral architecture image, fractal coding is applied to get encoded image. Extensive experiments are carried out with various tolerance values. Median is used as the basis in codebook formation. Implementation results are compared and show more compression with little trade off in image quality. Due to the spiral multiplication and minimization of color planes from three to one, the proposed approach is more effective. Proposed approach falls in lossy compression category, with time complexity in the order of n i.e. O(n).","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115182828","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
Character Skew Estimation: A New and Simple Edge based Model 特征偏斜估计:一种新的简单的基于边缘的模型
2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289884
P. Shivakumara, K.G. Hemantha, A.V.N. Manjunath
{"title":"Character Skew Estimation: A New and Simple Edge based Model","authors":"P. Shivakumara, K.G. Hemantha, A.V.N. Manjunath","doi":"10.1109/ADCOM.2006.4289884","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289884","url":null,"abstract":"Estimation of character skew is still elusive goal for document analysis group since it has pixels of different directions. It is too essential as it avoids segmentation problems and which in turn reduces computational burden in segmenting text lines and processing whole text line/document to estimate skew angle of the document [18]. In addition, it is useful in correcting arc shaped, circle and zigzag shaped text lines appeared extensively in map and advertisement documents. This paper presents a simple and new model for estimating skew angle for a character based on selection of dominant edges detected by Canny and Sobel edge detector. The proposed model is simple as it works based on just structural information such as compactness of the edges of a character. The model extracts the coordinates of selected dominant edges and it is fed to axis of inertia to compute the skew angle for the character. We have conducted varieties of experiments on synthetic character images and real images with different types. It is revealed that the model works up to + 20deg with more than 3deg deviations. As a result, it raises many research issues in estimating skew for a character. Finally, the results are compared with the results of well known methods to show that proposed model is competitive for text images.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127414820","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
Recognition of Unconstrained Handwritten Malayalam Characters Using Zero-crossing of Wavelet Coefficients 基于小波系数过零的无约束手写马来拉姆文字识别
2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289886
G. Raju
{"title":"Recognition of Unconstrained Handwritten Malayalam Characters Using Zero-crossing of Wavelet Coefficients","authors":"G. Raju","doi":"10.1109/ADCOM.2006.4289886","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289886","url":null,"abstract":"This work focuses on application of Wavelets in offline recognition of unconstrained isolated handwritten Malayalam characters. The data set consists of 30 samples of each 25 consonants (out of 36) in Malayalam (one of the South Indian Languages). All samples are 256 x 256 gray level images. No preprocessing (such as denoising and thinning) is performed. The images are converted to inverted binary images and wavelet transform is applied (using Db4 filter). For each image, count of zero-crossing in each of the ten subbands is found and is used as the feature for classification. From the analysis of the range of zero-crossing values in different subbands, the 25 characters could be classified into 11 sets. The result from this preliminary work is promising. Hence a detailed study on effect of preprocessing, use of different filters and application of Neuro-Fuzzy classifier is under investigation.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125565997","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}
引用次数: 40
A General Framework for Automatic Verification of Web Services Web服务自动验证的通用框架
2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289933
N. R. Goli, V. Pathari
{"title":"A General Framework for Automatic Verification of Web Services","authors":"N. R. Goli, V. Pathari","doi":"10.1109/ADCOM.2006.4289933","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289933","url":null,"abstract":"Efficient integration of business processes goes a long way in achieving a complete self managing system. Web services related developments provide the technology for building complex distributed systems focusing on the efficient integration of the involved processes. The interaction details and behavior of processes in distributed systems are specified, in this context, by the constructs provided by Web services specification languages. Formally verifying such specifications is a complex task, as the specifications cannot be easily verified by standard formal verification tools. This work developed a framework for automated verification of Web services which use semantic markup languages like, OWL-S for their description, composition and integration. Here we describe a method devised to translate process model description in OWL-S into its equivalent process description in Promela so as to verify the same using the SPIN Model Checker.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125729058","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}
引用次数: 3
Delay Analysis of Scheduling Algorithms for Real-Time Traffic in Packet Switched Networks 分组交换网络中实时流量调度算法的延迟分析
2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289949
P. Prakash, S. Selvan
{"title":"Delay Analysis of Scheduling Algorithms for Real-Time Traffic in Packet Switched Networks","authors":"P. Prakash, S. Selvan","doi":"10.1109/ADCOM.2006.4289949","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289949","url":null,"abstract":"The packet switched data network like Internet, which has traditionally supported throughput sensitive applications such as email and file transfer, is increasingly supporting delay-sensitive multimedia applications such as interactive video. These delay-sensitive applications would often rather sacrifice some throughput for lower delay. Unfortunately, the current packet switched network does not offer choices, but instead provides monolithic best-effort service to all applications. This paper evaluates CBQ (Class Based Queuing), CEDF (Coordinated Earliest Deadline First), WSDRR (Weighted Switch Deficit Round Robin) and RED-Boston scheduling schemes that is sensitive to Quality of Service (QoS) expectations for variety of applications and propose improvements.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123254444","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
Improving Simplified Fuzzy ARTMAP Performance Using Genetic Algorithm for Brain Fingerprint Classification 利用遗传算法改进简化模糊ARTMAP脑指纹分类性能
2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289909
Ramaswamy Palaniappan, Shankar M. Krishnan, Chikkanan Eswaran
{"title":"Improving Simplified Fuzzy ARTMAP Performance Using Genetic Algorithm for Brain Fingerprint Classification","authors":"Ramaswamy Palaniappan, Shankar M. Krishnan, Chikkanan Eswaran","doi":"10.1109/ADCOM.2006.4289909","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289909","url":null,"abstract":"A genetic algorithm is proposed for ordering the input patterns during training for simplified fuzzy ARTMAP (SFA) classifier to improve the individual identification classification performance using brain fingerprints. The results indicate improved classification performance as compared to the existing methods for pattern ordering, namely voting strategy and min-max. As the ordering method is general, it could be used with any dataset to obtain improved classification performance when SFA is used.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116606611","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
Efficient Compression of non-repetitive DNA sequences using Dynamic Programming 使用动态规划的非重复DNA序列的有效压缩
2006 International Conference on Advanced Computing and Communications Pub Date : 2006-12-01 DOI: 10.1109/ADCOM.2006.4289956
K. Srinivasa, M. Jagadish, K. Venugopal, L. Patnaik
{"title":"Efficient Compression of non-repetitive DNA sequences using Dynamic Programming","authors":"K. Srinivasa, M. Jagadish, K. Venugopal, L. Patnaik","doi":"10.1109/ADCOM.2006.4289956","DOIUrl":"https://doi.org/10.1109/ADCOM.2006.4289956","url":null,"abstract":"DNA compression has been a subject of great interest since the availability of genomic databases. Although only two bits are sufficient to encode four bases of DNA ( namely A, G, T and C ), the massive size DNA sequences compels the need for efficient compression. General text compression methods do not make use of characteristics specific to DNA sequences. DNA specific compression algorithms usually take advantage of repeat sequences. DNA sequences with high repetition rates can be best compressed by dictionary-based compression algorithms. However segments of DNA that do not reappear in the sequence are compressed using different text compression scheme. In this paper, we propose an encoding scheme to compress non repeat regions of DNA sequences, based on dynamic programming approach. In order to test the efficiency of the method we incorporate the encoding scheme in a DNA-specific algorithm, DNAPack. The performance of this algorithm is compared with various DNA compression algorithms. The results show that our method achieve better results in many cases.","PeriodicalId":296627,"journal":{"name":"2006 International Conference on Advanced Computing and Communications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121112642","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}
引用次数: 17
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信