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

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

筛选
英文 中文
Unsupervised Change Detection in Remote-Sensing Images Using Modified Self-Organizing Feature Map Neural Network 基于改进自组织特征映射神经网络的遥感图像无监督变化检测
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.128
Swarnajyoti Patra, Susmita K. Ghosh, Ashish Ghosh
{"title":"Unsupervised Change Detection in Remote-Sensing Images Using Modified Self-Organizing Feature Map Neural Network","authors":"Swarnajyoti Patra, Susmita K. Ghosh, Ashish Ghosh","doi":"10.1109/ICCTA.2007.128","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.128","url":null,"abstract":"In this paper we propose an unsupervised context-sensitive technique for change-detection in multitemporal remote sensing images. A modified self-organizing feature map neural network is used. Each spatial position of the input image corresponds to a neuron in the output layer and the number of neurons in the input layer is equal to the dimension of the input patterns. The network is updated depending on some threshold value and when the network converges status of output neurons depict the change-detection map. To select a suitable threshold for initialization of the network, a correlation based and an energy based criteria are suggested. Experimental results, carried out on two multispectral remote sensing images, confirm the effectiveness of the proposed approach","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"7 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":"134346973","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
ICE: The Isothetic Convex Envelope of a Digital Object 数字对象的等形凸包络
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.70
Partha Bhowmick, A. Biswas, B. Bhattacharya
{"title":"ICE: The Isothetic Convex Envelope of a Digital Object","authors":"Partha Bhowmick, A. Biswas, B. Bhattacharya","doi":"10.1109/ICCTA.2007.70","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.70","url":null,"abstract":"A novel algorithm to derive the isothetic convex envelope (ICE) of an object using a digital geometric technique is proposed in this paper. ICE is defined as the isothetic convex polygon that contains the digital object, with an aim of capturing its underlying shape information. Slackening the tightness of an ICE corresponding to a digital object is achievable by increasing the grid size, and for a slackened ICE with lesser output complexity (i.e., with lesser number of vertices), the runtime of the algorithm falls significantly. The proposed algorithm is marked by its dependence on object boundary instead of object size, and usage of primitive integer operations in the digital domain, which, in entirety, ensures its speedy execution and acceptability in a real-world application. Experimental results including CPU time demonstrate the elegance of ICE and the efficiency of the proposed algorithm","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"7 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":"130801673","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
High Fidelity Inpainting for Critical Applications Using Image Fusion 使用图像融合的关键应用的高保真图像绘制
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.68
Anima Mishra, Bishwajit Sharma, S. Rakshit
{"title":"High Fidelity Inpainting for Critical Applications Using Image Fusion","authors":"Anima Mishra, Bishwajit Sharma, S. Rakshit","doi":"10.1109/ICCTA.2007.68","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.68","url":null,"abstract":"We propose a novel image restoration technique based on complementary information present in two or more images. While standalone image inpainting techniques fill the missing information artificially, use of spatiotemporal image sequence is suitable and reliable for critical applications, since it gathers the unavailable information in one image from other images in the sequence. There are two important issues to be dealt with before utilizing such sequences. Firstly, the images should be correctly registered in order to correctly access the undamaged images for in-painting the damaged one. Secondly, the illumination conditions should be taken care of, without which shadowing effects are generated since two images can differ in the illumination conditions, as well as sensor gain settings. In this work, a RANSAC based registration technique is used to perform efficient registration in presence of artefacts. Next, the dynamic range of the images are equalized to achieve illumination coherence. Further, we use fusion methods to incorporate information from all undamaged images into the damaged image. Cosmetic inpainting is used only if no other information is present. This work has uses in annotation removal from military and medical images and video, restoration of damaged video frames, etc. The results confirm the efficiency of the proposed method","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":"132627784","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
An Approach for Pre-Silicon Power Modeling 一种预硅功率建模方法
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.26
Prashant Agrawal, G. SrinivasaR.S.T., Ajit N. Oke, Saurabh Vijay
{"title":"An Approach for Pre-Silicon Power Modeling","authors":"Prashant Agrawal, G. SrinivasaR.S.T., Ajit N. Oke, Saurabh Vijay","doi":"10.1109/ICCTA.2007.26","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.26","url":null,"abstract":"Accurate estimation of power in pre-silicon is very important and finally to validate this against post-silicon measurement is essential throughout product lifecycle. Thermal design power (TDP) estimates are used to design package thermal solutions. In this paper a modeling approach for dynamic power estimation under TDP conditions is proposed. In this approach, separate models are built for each partition in the design. The model uses only bandwidth and the effective toggle rate of the input data for estimating the total switched capacitance and dynamic power. The model takes into account the effect of cross-coupling capacitance on dynamic power. The results obtained from the model are within 7% of the measured data","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"21 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":"115557509","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
Some Improvements over the BLEU Metric for Measuring Translation Quality for Hindi 对BLEU度量印地语翻译质量的改进
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.120
N. Chatterjee, Anish Johnson, M. Krishna
{"title":"Some Improvements over the BLEU Metric for Measuring Translation Quality for Hindi","authors":"N. Chatterjee, Anish Johnson, M. Krishna","doi":"10.1109/ICCTA.2007.120","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.120","url":null,"abstract":"The BLEU translation quality evaluation metric is a modified n-gram precision measure that uses a number of reference translations of a given candidate text in order to evaluate its quality of translation. In this paper, we propose some modifications to this metric so that it suits Indian languages; more specifically, Hindi. The problem of using BLEU in Hindi presents two difficulties: non-availability of multiple references and prevalence of free word order in sentence construction. It is established that the validity of BLEU scores generally increases with the number of reference translations used. Further, Hindi being a free word order language, naive n-gram matching as adopted by BLEU does not accurately predict the quality of a translated text. In our approach we have modified BLEU in order to take care of the above-mentioned shortcomings. Our proposed metric has obtained a closer correlation with human judgment while using just one reference translation","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"41 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":"115676135","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}
引用次数: 25
Automatic Seal Information Reader 自动印章信息读取器
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.33
F. Nourbakhsh, P. Pati, A. Ramakrishnan
{"title":"Automatic Seal Information Reader","authors":"F. Nourbakhsh, P. Pati, A. Ramakrishnan","doi":"10.1109/ICCTA.2007.33","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.33","url":null,"abstract":"Seals contain a lot of vital information about the document. Seal detection is a necessary step to gain access to that information. In the present paper, we present a correlation based technique which exploits the existence of some constant character strings and their topology for detection of seals. We also present a technique which separates the false positives from the actual seals. We achieved an accuracy of about 98% for extraction of such kind of seals. Once the seal is extracted from a page image, an OCR has been employed to read the contextual information present in the seal. A knowledge based post-processing step is employed to enhance the accuracy of the recognized text strings","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":"125849636","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
Digital Signal Types Identification Using a Hierarchical SVM-Based Classifier and Efficient Features 基于层次支持向量机分类器和高效特征的数字信号类型识别
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.50
A. Ebrahimzadeh, S. Seyedin
{"title":"Digital Signal Types Identification Using a Hierarchical SVM-Based Classifier and Efficient Features","authors":"A. Ebrahimzadeh, S. Seyedin","doi":"10.1109/ICCTA.2007.50","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.50","url":null,"abstract":"Automatic digital signal type identification (ADSTI) is an important topic for both military and civilian communication applications. Most of proposed techniques (identifiers) can only recognize a few types of digital signal and usually need high levels of SNR. This paper presents a technique that includes a variety of digital signal types. In this technique a hierarchical support vector machine based structure is proposed for multi-class classification. Combination of higher order moments and higher order cumulants up to eighth are utilized as the effective features. Genetic algorithm is used to parameter selection in order to improve the performance of identifier. Simulation results show that proposed identifier has high performance even at low SNR values","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"26 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":"125853880","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
Adaptive Index Coding Scheme for VQ Indices Compression VQ索引压缩的自适应索引编码方案
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.21
Somasundaram Karuppanagounder, S. Domnic
{"title":"Adaptive Index Coding Scheme for VQ Indices Compression","authors":"Somasundaram Karuppanagounder, S. Domnic","doi":"10.1109/ICCTA.2007.21","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.21","url":null,"abstract":"An efficient lossless coding scheme to encode vector quantization (VQ) indices is presented in this paper. In our scheme, we have designed a new coding model based on the schemes proposed in the previous works. The computational complexity of the method is quite low and its memory requirement is small. So that it can be implemented in hardware. The experimental results show that the proposed scheme gives better compression than existing lossless index coding schemes","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":"129795407","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
Lower Bound on Bandwidth for Channel Assignment in Multimedia Cellular Networks with 2-Band Buffering 带2波段缓冲的多媒体蜂窝网络信道分配的带宽下界
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.83
G. K. Audhya, B. Sinha
{"title":"Lower Bound on Bandwidth for Channel Assignment in Multimedia Cellular Networks with 2-Band Buffering","authors":"G. K. Audhya, B. Sinha","doi":"10.1109/ICCTA.2007.83","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.83","url":null,"abstract":"This paper deals with the minimum bandwidth requirement for channel assignment in a hexagonal cellular network with 2-band buffering, where channel interference does not extend beyond two cells. For simplicity, we consider here only two different types of multimedia signals, requiring different bandwidths. For a cellular network with single demand for each type of signal, we derive lower bounds on the minimum bandwidth, satisfying all possible frequency separation constraints for avoiding interference. The results obtained are useful in comparing the performance of any multimedia channel assignment algorithm in regard to optimality of the bandwidth used","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"126 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":"128186781","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
Exploitation of Multivalued Type Proximity for Symbolic Feature Selection 多值类型接近在符号特征选择中的应用
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.58
B. B. Kiranagi, D. S. Guru, M. Ichino
{"title":"Exploitation of Multivalued Type Proximity for Symbolic Feature Selection","authors":"B. B. Kiranagi, D. S. Guru, M. Ichino","doi":"10.1109/ICCTA.2007.58","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.58","url":null,"abstract":"In this paper, a simple and efficient feature selection scheme for symbolic data is proposed. The proposed scheme exploits the symbolic multivalued proximity measures for feature selection. The effectiveness of the proposed scheme has been demonstrated through experiments on standard symbolic data sets","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":"127143472","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学术官方微信