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

2007 International Conference on Computing: Theory and Applications (ICCTA'07)最新文献

筛选
英文 中文
Reconfigurable Frame Parser Design for Multi-Radio Support on Asynchronous Microprocessor Cores 异步微处理器内核支持多无线电的可重构帧解析器设计
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.110
D. Guha, T. Srikanthan
{"title":"Reconfigurable Frame Parser Design for Multi-Radio Support on Asynchronous Microprocessor Cores","authors":"D. Guha, T. Srikanthan","doi":"10.1109/ICCTA.2007.110","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.110","url":null,"abstract":"The abstract is to be in fully-justified italicized text, at the top of the left-hand column as it is, below the author information. Designing a reconfigurable frame parser to translate radio protocol descriptions to asynchronous microprocessor cores is a relatively recent concept. As asynchronous microprocessors do not run an operating system, the paradigm of multi-radio support on these cores need to be investigated in a different light than the conventional software defined radios. The main challenge in such a design is realizing multi-radio FFD (fully functional device) emulation on an extremely low-memory footprint before translating it to the asynchronous core. In this work-in-progress paper, we describe some of the design methodologies involved in designing a reconfigurable radio MAC frame parser for translating multi-radio protocol description to asynchronous processor cores. We intend to realize this run-time in hardware and are working to realize a prototype on FPGA. The prototype would demonstrate a design methodology to include asynchronous instruction set targets in dynamic run-time multi-language compiler translation","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116190861","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
Secondary Diagonal FLD for Fingerspelling Recognition 二级对角线FLD的指纹拼写识别
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.115
M. Suraj, D. S. Guru
{"title":"Secondary Diagonal FLD for Fingerspelling Recognition","authors":"M. Suraj, D. S. Guru","doi":"10.1109/ICCTA.2007.115","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.115","url":null,"abstract":"The problem of recognising fingerspelling alphabets for sign language interpretation is addressed in this paper. An appearance based model is proposed. The proposed model suggests a modification to the existing diagonal FLD model at two stages, one at rearranging of images and the other at adjusting the contrast of the images by the use of histogram equalisation. The proposed model is called SecDia FLD. An extensive experimentation conducted on a large fingerspelling dataset revealed the superiority of the proposed model. In addition, we have also brought out the effectiveness of the proposed model on the Yale face dataset","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116344611","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
Cluster Based Training for Scaling Non-linear Support Vector Machines 基于聚类的缩放非线性支持向量机训练
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.39
S. Asharaf, M. Murty, S. Shevade
{"title":"Cluster Based Training for Scaling Non-linear Support Vector Machines","authors":"S. Asharaf, M. Murty, S. Shevade","doi":"10.1109/ICCTA.2007.39","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.39","url":null,"abstract":"Support vector machines (SVMs) are hyperplane classifiers defined in a kernel induced feature space. The data size dependent training time complexity of SVMs usually prohibits its use in applications involving more than a few thousands of data points. In this paper, we propose a novel kernel based incremental data clustering approach and its use for scaling non-linear support vector machines to handle large data sets. The clustering method introduced can find cluster abstractions of the training data in a kernel induced feature space. These cluster abstractions are then used for selective sampling based training of support vector machines to reduce the training time without compromising the generalization performance. Experiments done with real world datasets show that this approach gives good generalization performance at reasonable computational expense","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126122989","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
New Distance Measure for Microarray Gene Expressions Using Linear Dynamic Range of Photo Multiplier Tube 利用光电倍增管线性动态范围测量微阵列基因表达的新距离
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.92
S. S. Ray, S. Bandyopadhyay, S. Pal
{"title":"New Distance Measure for Microarray Gene Expressions Using Linear Dynamic Range of Photo Multiplier Tube","authors":"S. S. Ray, S. Bandyopadhyay, S. Pal","doi":"10.1109/ICCTA.2007.92","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.92","url":null,"abstract":"This paper deals with a new distance measure for genes using their microarray expressions. The distance measure is called, \"maxrange distance \", where an experiment specific normalization factor is incorporated in the computation of the distance. The normalization factor is dependent on the linear dynamic range of the photo multiplier tube (PMT) for scanning fluorescence intensities of the gene expression values. Superiority of this distance measure in the microarray gene ordering problem has been extensively established on widely studied microarray data sets by performing statistical tests","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126044402","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
An Integrated Scheme for Compression and Interactive Access to Document Images 文档图像压缩与交互访问的集成方案
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.29
Gaurav Harit, Ritu Garg, S. Chaudhury
{"title":"An Integrated Scheme for Compression and Interactive Access to Document Images","authors":"Gaurav Harit, Ritu Garg, S. Chaudhury","doi":"10.1109/ICCTA.2007.29","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.29","url":null,"abstract":"We present an integrated scheme for document image compression which preserves the layout structure, and still allows the display of textual portions to adapt to the user preferences and screen area. We encode the layout structure of the document images in an XML representation. The textual components and picture components are compressed separately into different representations. We derive an SVG (scalable vector graphics) representation of the complete document image. Compression is achieved since the word-images are encoded using specifications for geometric primitives that compose a word. A document rendered from its SVG representation can be adapted for display and interactive access through common browsers on desktop as well as mobile devices. We demonstrate the effectiveness of the proposed scheme for document access","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131327655","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}
引用次数: 6
Semantic Integration of Heterogeneous Databases on the Web Web上异构数据库的语义集成
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.117
N. Chatterjee, M. Krishna
{"title":"Semantic Integration of Heterogeneous Databases on the Web","authors":"N. Chatterjee, M. Krishna","doi":"10.1109/ICCTA.2007.117","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.117","url":null,"abstract":"The Web is replete with databases, many of which are modeled on the relational paradigm. Currently, for the purpose of simultaneous querying data from multiple databases, the federated database technique is used extensively. However, the effectiveness of such a technique is suspect when it comes to querying heterogeneous databases. Therefore, it becomes imperative to develop an efficient methodology for the semantic integration of heterogeneous online databases. This may be realized by defining a mapping from a relational database to a description that utilises the resource description framework (RDF). Such a representation would be machine processable and would make the semantics as expressed by databases more explicit and, thereby, facilitate their integration","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"20 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131550924","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 Pose Recovery Algorithm to Minimize the Effects of Pose Variation on the Matching Performance of Elastic Bunch Graph Based Multiview Face Recognition System 基于弹性束图的多视图人脸识别系统姿态变化对匹配性能影响最小的姿态恢复算法
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.18
Debasis Mazumdar, Kunal Chanda, M. Bhattacharya, Sonali Mitra
{"title":"A Pose Recovery Algorithm to Minimize the Effects of Pose Variation on the Matching Performance of Elastic Bunch Graph Based Multiview Face Recognition System","authors":"Debasis Mazumdar, Kunal Chanda, M. Bhattacharya, Sonali Mitra","doi":"10.1109/ICCTA.2007.18","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.18","url":null,"abstract":"Multiview face recognition is a challenging task of deformable pattern recognition. Machine recognition of human from his/her facial images available at any pose, intensity and expression is the ultimate goal of multiview face recognition system. In the present work the effect of variation of poses on the overall performance of face recognition engine based on elastic bunch graph matching technique is studied using K-means clustering algorithm. A geometry-based pose recovery algorithm is proposed to improve the performance of the system","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"215 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134431468","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
A Local Search Heuristic for Biobjective Intersecting Geometric Graphs 双目标相交几何图的局部搜索启发式算法
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.10
Rajeev Kumar, P. Singh, B. Bhattacharya
{"title":"A Local Search Heuristic for Biobjective Intersecting Geometric Graphs","authors":"Rajeev Kumar, P. Singh, B. Bhattacharya","doi":"10.1109/ICCTA.2007.10","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.10","url":null,"abstract":"In this work, we consider the problem of constructing spanning trees from two geometric graphs corresponding to two nets, each with multiple terminals, with a goal to minimize the total edge cost and the number of intersections among the edges of the two trees. Such an optimization problem is computationally hard for which no efficient algorithm or good heuristic is known to exist. Additionally, in a biobjective setting, the major challenge to solve a problem is to obtain many representative diverse solutions across the (near-) optimal Pareto-front. We present a local search based heuristic to find near-optimal Pareto-front in the feasible solution space. Each element of this solution set is a tuple of two spanning trees corresponding to the given geometric graphs. The heuristic is shown to give superior results over the existing stochastic technique","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117130377","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
Fast, Reliable & Secure Digital Communication Using Hadamard Matrices 使用Hadamard矩阵的快速，可靠和安全的数字通信
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.61
S. Pal
{"title":"Fast, Reliable & Secure Digital Communication Using Hadamard Matrices","authors":"S. Pal","doi":"10.1109/ICCTA.2007.61","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.61","url":null,"abstract":"The symmetric, orthogonal and self-inverting properties of Hadamard matrices make them useful for a number of present day applications. In addition, the binary nature of elements of the basis vectors helps in the design of efficient algorithms for coding, compression and security of digital media together with their compact hardware realization. This paper presents schemes for providing fast, reliable and secure communications over resource constrained wireless networks using Hadamard matrices. Error-correction and bandwidth expansion capabilities are demonstrated for unobtrusive communication of text and speech. Fast encryption of speech signal using permutations on Hadamard matrices is demonstrated. Techniques for extending the key-space for improving the security of such schemes are also reported","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126950287","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
Hyperspectral Image Analysis--A Robust Algorithm Using Support Vectors and Principal Components 高光谱图像分析——基于支持向量和主成分的鲁棒算法
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.69
S. S, M. Wilscy
{"title":"Hyperspectral Image Analysis--A Robust Algorithm Using Support Vectors and Principal Components","authors":"S. S, M. Wilscy","doi":"10.1109/ICCTA.2007.69","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.69","url":null,"abstract":"This paper presents a new algorithm for hyperspectral image analysis using spectral-angle based support vector clustering (SVC) and principal component analysis (PCA). In the classical approach to hyper-spectral dimensionality reduction based on principal component analysis (PCA), no meaning or behavior of the spectrum is considered and results are influenced by majority components in the scene. A spectral angle based classification before dimensionality reduction is a possible solution to this problem. Clustering based on support vectors using spectral based kernels is proposed in this work, which is found to generate good results in hyperspectral image classification. The algorithm is tested with two hyperspectral image data sets of 210 bands each, which are taken with hyper-spectral digital imagery collection experiment (HYDICE) air-borne sensors. A comparative study of the proposed algorithm and other two conventional algorithms (PCA alone and PCA with spectral angle mapping (SAM)) is also done","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133938648","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}
引用次数: 11
首页 上一页 下一页 尾页
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学术官方微信