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

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

筛选
英文 中文
Chromatogram Image Pre-Processing and Feature Extraction for Automatic Soil Analysis 自动土壤分析的色谱图像预处理与特征提取
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.38
V. Saritha, M. Minu, Sukhendu Das, D. Khemani
{"title":"Chromatogram Image Pre-Processing and Feature Extraction for Automatic Soil Analysis","authors":"V. Saritha, M. Minu, Sukhendu Das, D. Khemani","doi":"10.1109/ICCTA.2007.38","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.38","url":null,"abstract":"A circular paper chromatogram is obtained from an alkaline solution of silver nitrate and soil. The shape, size, color and textural patterns of the chromatogram image are hypothesized to contain important information of the mineral content in the soil. We present a method to automatically analyze the chromatogram image for feature extraction. Image pre-processing is an important step before extracting the features of the image. Chromatogram image preprocessing involves detecting the center of the chromatogram, normalization and then segmentation into different concentric regions. Since chromatogram patterns are similar to iris (human eye) patterns, we have adopted iris-preprocessing methods. In this paper, we present a combination of different approaches: to detect the center, normalize and segment the chromatogram. Centre detection algorithm finds the center of the chromatogram which is assumed as the origin for normalization. Chromatogram normalization involves transforming from Cartesian to polar coordinates, so that chromatogram looks like an unwrapped polar image. Finally, color texture segmentation is used to detect different regions. Results of feature extraction are compared to that given by soil experts to test the accuracy of the system","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"33 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":"134414436","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
A Unified Approach to Encoding and Classification Using Bimodal Projection-Based Features 基于双峰投影特征的统一编码和分类方法
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.20
Dipti Deodhare, M. Vidyasagar, M. Murty
{"title":"A Unified Approach to Encoding and Classification Using Bimodal Projection-Based Features","authors":"Dipti Deodhare, M. Vidyasagar, M. Murty","doi":"10.1109/ICCTA.2007.20","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.20","url":null,"abstract":"In general the objective of accurately encoding the input data and the objective of extracting good features to facilitate classification are not consistent with each other. As a result, good encoding methods may not be effective mechanisms for classification. In this paper, an earlier proposed unsupervised feature extraction mechanism for pattern classification has been extended to obtain an invertible map. The method of bimodal projection-based features was inspired by the general class of methods called projection pursuit. The principle of projection pursuit concentrates on projections that discriminate between clusters and not faithful representations. The basic feature map obtained by the method of bimodal projections has been extended to overcome this. The extended feature map is an embedding of the input space in the feature space. As a result, the inverse map exists and hence the representation of the input space in the feature space is exact. This map can be naturally expressed as a feedforward neural network","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"54 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":"129607049","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
Edge Filtering Using Orientation Entropy 利用方向熵进行边缘滤波
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.56
Arijit K. Das, Prasenjit K. Mitra, Swaroop Ghosh, Asok K. Ray
{"title":"Edge Filtering Using Orientation Entropy","authors":"Arijit K. Das, Prasenjit K. Mitra, Swaroop Ghosh, Asok K. Ray","doi":"10.1109/ICCTA.2007.56","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.56","url":null,"abstract":"The paper introduces the concept of orientation entropy for quantifying the propensity of a pixel belonging to the edge. Intensity variation at a pixel is measured as an integral of a logarithmic function over all possible direction which represents the heterogeneity of intensity variation in the neighborhood of that point. This is unlike traditional edge filters which uses divergence operator considering the maximum intensity variation among all possible directions. The proposed entropic filter is found to provide visually superior edges for a number of benchmark images considered in our experiments","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":"130856928","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
ISPIHT-Improved SPIHT: A Simplified and Efficient Subband Coding Scheme 改进的SPIHT:一种简化高效的子带编码方案
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.79
Y. Singh
{"title":"ISPIHT-Improved SPIHT: A Simplified and Efficient Subband Coding Scheme","authors":"Y. Singh","doi":"10.1109/ICCTA.2007.79","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.79","url":null,"abstract":"Proposed here is a new subband coding scheme entitled ISPIHT (Improved SPIHT). It is simpler in its coding approach yet it is more efficient in time and memory keeping the performance of SPIHT preserved. It requires less no of compression operations during the coding. The memory requirement for ISPIHT is about two times less than SPIHT","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"189 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":"123211367","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
A Multi-objective Genetic Algorithm with Relative Distance: Method, Performance Measures and Constraint Handling 一种具有相对距离的多目标遗传算法:方法、性能度量和约束处理
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.13
P. Tripathi, S. Bandyopadhyay, S. Pal
{"title":"A Multi-objective Genetic Algorithm with Relative Distance: Method, Performance Measures and Constraint Handling","authors":"P. Tripathi, S. Bandyopadhyay, S. Pal","doi":"10.1109/ICCTA.2007.13","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.13","url":null,"abstract":"A novel multi-objective evolutionary algorithm (MOEA), called multi-objective genetic algorithm with relative distance (MOGARD) is described. A novel relative distance parameter that ensures convergence to the Pareto optimal front and a nearest neighbour based method for maintaining diversity in the non-dominated set is used. Two novel performance measures are formulated to estimate the performance of the MOEAs. A penalty based constraint handling concept is introduced in MOGARD, for handling constraints. Experimental results demonstrate the superiority of MOGARD on several test problems, as compared to other recent and well known algorithms","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"729 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":"121802854","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
Rubberband Algorithms for Solving Various 2D or 3D Shortest Path Problems 解决各种2D或3D最短路径问题的橡皮带算法
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.113
Fajie Li, R. Klette
{"title":"Rubberband Algorithms for Solving Various 2D or 3D Shortest Path Problems","authors":"Fajie Li, R. Klette","doi":"10.1109/ICCTA.2007.113","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.113","url":null,"abstract":"This reviewing paper provides a complete discussion of an algorithm (called rubberband algorithm), which was proposed by Billow and Klette in 2000-2002 for the calculation of minimum-length polygonal curves in cube-curves in 3D space. The paper describes how this original algorithm was transformed afterwards, \"step-by-step\", into a general, provably correct, and time-efficient algorithm which solves the indented task for simple cube-curves of any complexity. Variations of this algorithm are then used to solve various Euclidean shortest path (ESP) problems, such as calculating the ESP inside of a simple cube arc, inside of a simple polygon, on the surface of a convex polytope, or inside of a simply-connected polyhedron, demonstrating a general (!) methodology of rubberband algorithms. The paper also reports how such algorithms improve various time complexity results of best algorithms for problems such as the touring polygons, parts cutting, safari and zookeeper, and the watchman route","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"55 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":"127550265","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}
引用次数: 32
AFDM Approach for Experience Inclusion in Learning Controllers 学习控制器经验包容的AFDM方法
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.23
S. Gopinath, I. Kar, R. Bhatt
{"title":"AFDM Approach for Experience Inclusion in Learning Controllers","authors":"S. Gopinath, I. Kar, R. Bhatt","doi":"10.1109/ICCTA.2007.23","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.23","url":null,"abstract":"In this paper a new method of experience inclusion in iterative learning controllers (ILC) is proposed. Approximate fuzzy data model (AFDM) technique has been adopted for the process of initial input selection. Instead of zero initial input assumption as in most of the ILC algorithms, in this paper the idea of using past trajectory tracking experiences in the selection of initial input for tracking a new trajectory tracking task has been highlighted. Performance of the proposed AFDM based ILC approach, on initial error reduction and error convergence issues are proved. Comparison with existing local learning technique on the selection of initial input for ILC algorithm proves the efficacy of the proposed AFDM based method","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"89 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":"115826060","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
Test Data Compression by Spilt-VIHC (SVIHC) 基于SVIHC的测试数据压缩
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.123
C. Giri, B. M. Rao, S. Chattopadhyay
{"title":"Test Data Compression by Spilt-VIHC (SVIHC)","authors":"C. Giri, B. M. Rao, S. Chattopadhyay","doi":"10.1109/ICCTA.2007.123","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.123","url":null,"abstract":"This paper suggests a new test data compression scheme that performs Huffman coding on different sections of test data file separately. It improves upon the single Huffman tree based approach by up to 6% in compression ratio, 29% in test application time, sacrificing only 6.1% in the decoder area. The scheme compares favourably with other works reported in the literature. While for most of the cases, it produces better compression ratios, the area requirements are much lesser than other contemporary works","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"16 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":"130390506","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
SISO Based Turbo Equalization and Decoding for ISI Corrupted Wireless Channels 基于SISO的ISI损坏无线信道Turbo均衡与解码
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.118
A. Tripathy, S. S. Pathak, S. Chakrabarti
{"title":"SISO Based Turbo Equalization and Decoding for ISI Corrupted Wireless Channels","authors":"A. Tripathy, S. S. Pathak, S. Chakrabarti","doi":"10.1109/ICCTA.2007.118","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.118","url":null,"abstract":"The maximum a posteriori (MAP) probability algorithm and the soft output Viterbi algorithm (SOVA), usually known as soft in soft out (SISO) algorithms are used for data detection in non minimum phase channels representative of an outdoor cellular wireless environment. The performance of combinations of MAP and SOVA based equalizer and decoder is evaluated by simulation experiment. The performance does not improve much for more than five iterations in a severe ISI channel. The results obtained for 1 dB to 4 dB bit energy to noise power show that almost identical results are obtained for two other combinations of the SOVA and MAP in a serial concatenated scheme to take care of ISI. Theoretical analysis seems to support the viewpoint that all 4 possible combinations of MAP and SOVA algorithms result in an almost identical performance towards higher iteration numbers. Hence, SOVA-SOVA combination may be more suitable from implementation point of view than the other 3 combinations","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":"128945160","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
An Example Based Approach for Parsing Natural Language Sentences 一种基于实例的自然语言句子解析方法
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.28
N. Chatterjee, Shailly Goyal
{"title":"An Example Based Approach for Parsing Natural Language Sentences","authors":"N. Chatterjee, Shailly Goyal","doi":"10.1109/ICCTA.2007.28","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.28","url":null,"abstract":"Development of a parser from scratch is typically time-consuming and error prone. A more efficient approach may lie in adapting an example-based parsing scheme, provided an appropriate strategy is developed for knowledge elicitation from the example base. This paper proposes such a scheme for developing a Link Grammar based parser. The proposed scheme extracts knowledge from an already parsed example base in the form of \"link information\" and \"phrase templates\". For a given input sentence the parsing algorithm first extracts the possible links for the constituent words from the link dictionary. Then using the phrase templates and the possible links of the words, the sentence is parsed bottom-up. Algorithms have been developed to identify different phrases in the input sentence and to handle unknown words. The examples considered in this work are for English sentence. The proposed scheme uses very little language-specific information. Hence, the proposed algorithms can be adapted for other languages as well","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":"122715599","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
首页 上一页 下一页 尾页
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学术官方微信