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

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

筛选
英文 中文
Text/Graphics Separation in Color Maps 彩色地图中的文本/图形分离
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.124
P. Roy, J. Lladós, U. Pal
{"title":"Text/Graphics Separation in Color Maps","authors":"P. Roy, J. Lladós, U. Pal","doi":"10.1109/ICCTA.2007.124","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.124","url":null,"abstract":"Text/graphics separation in document image analysis is one of the main concerns in present research work. The complexity enhances when both text and graphics overlap in the context of maps in color images. This paper discusses a number of improvements to text/graphics separation methods to make it suitable for maps. Emphasize is given to the overlapping regions of text and graphics. It also discusses a method of color separation using clustering method for the purpose of text/graphics separation","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"138 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":"123258138","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}
引用次数: 38
On the Link Excess Life in Mobile Wireless Networks 移动无线网络中链路超时寿命研究
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.96
A. Nayebi, A. Khosravi, H. Sarbazi-Azad
{"title":"On the Link Excess Life in Mobile Wireless Networks","authors":"A. Nayebi, A. Khosravi, H. Sarbazi-Azad","doi":"10.1109/ICCTA.2007.96","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.96","url":null,"abstract":"In this paper, one of the most important parameters in performance evaluation and protocol design of wireless networks, link excess life (LEL), is investigated. An analytical model for LEL is proposed and evaluated. Evaluation of the proposed model leads to the first closed form expression for the excess life PDF. The closed form expression affords ease of further evaluations, e.g., an interesting result is that the average excess life is infinite for the proposed model. The effect of relative velocity distribution on the link excess life PDF is also investigated. The superposition property of LEL is mentioned and used to explore a systematic method for evaluation of the effect of stationary or pausing nodes on link excess life as well as a general method to approximate the link excess life PDF for various relative velocity distributions. Moreover, the effect of the buffer zone on the link excess life PDF in topology control is also investigated analytically. A simulation framework is developed and extensive simulations are performed to validate the results","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"190 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":"123399554","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 Model for Service Composition with Multiple QoS Constraints 具有多个QoS约束的服务组合模型
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1007/978-3-540-72360-8_52
Xingzhi Feng, Quanyuan Wu, Huaimin Wang, Yi Ren, Changguo Guo
{"title":"A Model for Service Composition with Multiple QoS Constraints","authors":"Xingzhi Feng, Quanyuan Wu, Huaimin Wang, Yi Ren, Changguo Guo","doi":"10.1007/978-3-540-72360-8_52","DOIUrl":"https://doi.org/10.1007/978-3-540-72360-8_52","url":null,"abstract":"","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"51 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":"122255266","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}
引用次数: 19
Co-articulation Modeling for Handwriting Synthesis 手写体合成的协同发音建模
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.40
J. H. Kim, H. Choi
{"title":"Co-articulation Modeling for Handwriting Synthesis","authors":"J. H. Kim, H. Choi","doi":"10.1109/ICCTA.2007.40","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.40","url":null,"abstract":"Summary form only given. Personal style handwriting synthesis aims to produce texts in the writer's style from a few handwriting samples. A handwriting synthesis system usually focuses on the production of the glyph, a handwriting unit separated by a space such as English word, Tamil word, Chinese character, Korean character, etc. Since, the glyph consists of one or more of components, called graphemes, and a grapheme is an atomic unit of glyph that has a relatively unique shape, grapheme is a most desirable unit of handwriting generation. However, handwritten grapheme generation is not simple as it sounds, because a grapheme is written differently depending on its neighboring graphemes, which is called co-articulation effect. Noticing the value of statistical structure analysis in character recognition, KAIST has used Bayesian network to model strokes and stroke relationships of handwritten characters. Bayesian network modeling overcomes the crudeness of naive Bayesian approach as well as the complexity of brute force Bayesian approach. From the given handwritten samples, we have constructed writer independent Bayesian network models utilizing the hierarchy of pixel-stroke-grapheme-glyph. The proposed system is applied to the Korean character synthesis. Experimental results demonstrate a high degree of visual plausibility","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"30 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":"123791993","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
Word Sense Disambiguation Using Extended WordNet 基于扩展WordNet的词义消歧
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.134
S. Naskar, Sivaji Bandyopadhyay
{"title":"Word Sense Disambiguation Using Extended WordNet","authors":"S. Naskar, Sivaji Bandyopadhyay","doi":"10.1109/ICCTA.2007.134","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.134","url":null,"abstract":"In this paper we propose an Extended WordNet based word sense disambiguation algorithm for disambiguating nouns, verbs and adjectives. The algorithm is inspired by the Lesk algorithm and involves looking for overlaps between the context of a word in a sentence and the contexts constructed from the WordNet. The algorithm relies on the sense tagged synset glosses provided by the Extended WordNet. The system has been evaluated on the first 10 Semcor 2.0 files and produces a precision of 85.9%, and 62.1% recall","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"157 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":"121613443","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}
引用次数: 16
Empirical Performance Evaluation of Adaptive Routing in Necklace Hypercubes: A Comparative Study 项链超立方体中自适应路由的实证性能评价:比较研究
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.57
S. Meraji, A. Nayebi, H. Sarbazi-Azad
{"title":"Empirical Performance Evaluation of Adaptive Routing in Necklace Hypercubes: A Comparative Study","authors":"S. Meraji, A. Nayebi, H. Sarbazi-Azad","doi":"10.1109/ICCTA.2007.57","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.57","url":null,"abstract":"The necklace hypercube network has recently been introduced as an attractive alternative to the well-known hypercube. Previous research on this network topology has mainly focused on topological properties and VLSI aspects of this network. In this paper, we propose some adaptive routing algorithm for the necklace hypercubes. The performance of necklace hypercubes using the proposed routing algorithm is then evaluated by means of simulation experiments. Experiments are realized under different working loads and for different network factors. Moreover, a comparison between the necklace hypercube and the well-known hypercube network is conducted. The comparison has been done considering implementation constraints including constant pin-out and constant bisection band-width constraints","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"12 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":"131400893","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
Kernel Auto-Regressive Model with eXogenous Inputs for Nonlinear Time Series Prediction 非线性时间序列预测的外生输入核自回归模型
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.80
Venkataramana B. Kini, C. Sekhar
{"title":"Kernel Auto-Regressive Model with eXogenous Inputs for Nonlinear Time Series Prediction","authors":"Venkataramana B. Kini, C. Sekhar","doi":"10.1109/ICCTA.2007.80","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.80","url":null,"abstract":"In this paper we present a novel approach for nonlinear time series prediction using kernel methods. The kernel methods such as support vector machine (SVM) and support vector regression (SVR) deal with nonlinear problems assuming independent and identically distributed (i.i.d.) data, without explicit notion of time. However, the problem of prediction necessitates temporal information. In this regard, we propose a novel time series modeling technique, kernel auto-regressive model with exogenous inputs (KARX) and associated estimation methods. Amongst others the advantage of KARX model compared to the widely used nonlinear auto-regressive exogenous (NARX) model (which is implemented using artificial neural network (ANN)) is, implicit nonlinear mapping and better regularization capability. In this work, we make use of Kalman recursions instead of quadratic programming which is generally used in kernel methods. Also, we employ online estimation schemes for estimating model noise parameters. The efficacy of the approach is demonstrated on artificial time series as well as real world time series acquired from aircraft engines","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"9 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":"134295979","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
Scalable Clustering with smoka 使用smoka的可伸缩集群
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.114
J. Kogan
{"title":"Scalable Clustering with smoka","authors":"J. Kogan","doi":"10.1109/ICCTA.2007.114","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.114","url":null,"abstract":"The paper reports a multi-step clustering procedure equipped with a divergence (a distance like junction derived from a convex function). The first step of the procedure is a BIRCH like algorithm capable to convert very large datasets to \"summaries\" that require much less computer memory. The second step is the principal direction divisive partitioning algorithm (PDDP) that partitions the set of \"summaries\" into k clusters. This partition is the input for a smoothed k-means based clustering algorithm (smoka). The final partition of \"summaries\" generated by smoka induces a partition of the original dataset. Preliminary numerical experiments with text collections reported in the paper demonstrate smoka's remarkable accuracy and speed of convergence","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"115 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":"133883469","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
Pose-Invariant 3D Object Recognition Using Linear Combination of 2D Views and Evolutionary Optimisation 基于二维视图线性组合和进化优化的姿态不变三维目标识别
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.105
V. Zografos, B. Buxton
{"title":"Pose-Invariant 3D Object Recognition Using Linear Combination of 2D Views and Evolutionary Optimisation","authors":"V. Zografos, B. Buxton","doi":"10.1109/ICCTA.2007.105","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.105","url":null,"abstract":"In this work, we present a method for model-based recognition of 3d objects from a small number of 2d intensity images taken from nearby, but otherwise arbitrary viewpoints. Our method works by linearly combining images from two (or more) viewpoints of a 3d object to synthesise novel views of the object. The object is recognised in a target image by matching to such a synthesised, novel view. All that is required is the recovery of the linear combination parameters, and since we are working directly with pixel intensities, we suggest searching the parameter space using an evolutionary optimisation algorithm in order to efficiently recover the optimal parameters and thus recognise the object in the scene","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"3 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":"114577464","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}
引用次数: 9
A Fuzzy Technique for Segmentation of Handwritten Bangla Word Images 手写体孟加拉文字图像的模糊分割技术
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.7
Subhadip Basu, R. Sarkar, N. Das, M. Kundu, M. Nasipuri, D. K. Basu
{"title":"A Fuzzy Technique for Segmentation of Handwritten Bangla Word Images","authors":"Subhadip Basu, R. Sarkar, N. Das, M. Kundu, M. Nasipuri, D. K. Basu","doi":"10.1109/ICCTA.2007.7","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.7","url":null,"abstract":"A fuzzy technique for segmentation of handwritten Bangla word images is presented. It works in two steps. In first step, the black pixels constituting the Matra (i.e., the longest horizontal line joining the tops of individual characters of a Bangla word) in the target word image is identified by using a fuzzy feature. In second step, some of the black pixels on the Matra are identified as segment points (i.e., the points through which the word is to be segmented) by using three fuzzy features. On experimentation with a set of 210 samples of handwritten Bangla words, collected from different sources, the average success rate of the technique is shown to be 95.32%. Apart from certain limitations, the technique can be considered as a significant step towards the development of a full-fledged Bangla OCR system, especially for handwritten documents","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"373 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":"121756087","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}
引用次数: 41
首页 上一页 下一页 尾页
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学术官方微信