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

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

筛选
英文 中文
An Effective Motion Re-estimation in Frame-Skipping Video Transcoding 一种有效的跳帧视频转码运动重估计方法
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.135
V. Patil, Rajeev Kumar
{"title":"An Effective Motion Re-estimation in Frame-Skipping Video Transcoding","authors":"V. Patil, Rajeev Kumar","doi":"10.1109/ICCTA.2007.135","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.135","url":null,"abstract":"A new motion vector (MV) composition method, which we call temporal bi-directional dominant vector selection (TBDVS), for frame-skipping transcoding of pre-coded video is presented. The TBDVS utilizes a existing relationship, in pre-coded video, between the pixels of a frame and its reference frame(s) via MVs and selects a dominant MV from a set of candidate MVs to minimize prediction errors. It is general enough to handle frame-skipping, including I frame, in an arbitrary manner from a generic I-B-P frame structure video. Experimental results using cascaded pixel-domain transcoder show performance gain over the existing methods in terms of both quality and bit rate. We also propose a refinement method that adaptively adjusts the search range to further improve the performance at marginal cost","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"74 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":"126518400","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
Concept Pre-digestion Method for Image Relevance Reinforcement Learning 图像相关强化学习的概念预消化方法
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.43
Sudhakara P. Reddy, R. Bapi, C. Bhagvati, B. Deekshatulu
{"title":"Concept Pre-digestion Method for Image Relevance Reinforcement Learning","authors":"Sudhakara P. Reddy, R. Bapi, C. Bhagvati, B. Deekshatulu","doi":"10.1109/ICCTA.2007.43","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.43","url":null,"abstract":"Relevance feedback (RF) is commonly used to improve the performance of CBIR system by allowing incorporation of user feedback iteratively. Recently, a method called image relevance reinforcement learning (IRRL) has been proposed for integrating several existing RF techniques as well as for exploiting RF sessions of multiple users. The precision obtained at the end of every iteration is used was a reward signal in the Q-learning based reinforcement learning (RL) approach. The objective of learning in IRRL is to estimate the optimal RF technique to be applied for a given query at a specific iteration. The main drawback of IRRL is its prohibitive learning time and storage requirement. We propose a way of addressing these difficulties by performing `pre-digestion' of concepts before applying IRRL. Experimental results on two databases of images demonstrated the viability of the proposed approach","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"50 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":"134515622","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
A Novel Integrated Approach Using Dynamic Thresholding and Edge Detection (IDTED) for Automatic Detection of Exudates in Digital Fundus Retinal Images 基于动态阈值和边缘检测(IDTED)的数字眼底视网膜图像渗出物自动检测方法
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.16
Anantha Vidya Sagar, S. Balasubramaniam, V. Chandrasekaran
{"title":"A Novel Integrated Approach Using Dynamic Thresholding and Edge Detection (IDTED) for Automatic Detection of Exudates in Digital Fundus Retinal Images","authors":"Anantha Vidya Sagar, S. Balasubramaniam, V. Chandrasekaran","doi":"10.1109/ICCTA.2007.16","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.16","url":null,"abstract":"The automatic screening of patients for early detection and prevention of diabetic retinopathy (DR) has been the prime focus in recent times due to the large ratio of patients to medical ophthalmologists. Exudate detection is one of the main steps of DR. A reliable method for detection of exudates is presented in this paper. Optic disc (OD) is localized by the principle component analysis (PCA). Active contour based approach is used for accurate segmentation of boundary of OD. In our IDTED method, pre-processing techniques such as histogram specification and local contrast enhancement are integrated with dynamic thresholding (DT) and edge detection for exudate detection. The IDTED algorithm, when tested on 25 digital fundus retinal images and compared with the performance of a human grader, has shown a mean sensitivity of 99% and a mean predictivity of 93%","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":"132814424","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}
引用次数: 36
Unsupervised Thresholding of Affymetrix Microarray Data Affymetrix微阵列数据的无监督阈值分割
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.129
M. Trotter, B. Buxton
{"title":"Unsupervised Thresholding of Affymetrix Microarray Data","authors":"M. Trotter, B. Buxton","doi":"10.1109/ICCTA.2007.129","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.129","url":null,"abstract":"Unsupervised thresholding provides a data-driven alternative to manually-situated thresholds for those wishing to extract class structure from unlabelled data. The analysis of microarray data provides one such scenario, in which thresholds placed on the output of multiple hypothesis tests are the most common method of determining, for example, which genes of a genome-wide assay are expressed under different experimental conditions. The Affymetrix GeneChip microarray platform is a popular method of determining genome-wide gene expression. Here, we apply a well-known image segmentation algorithm to determine the simplest property inferred from Affymetrix microarray data $the detection of specific signal. The effective separation of specific and non-specific signal by an unsupervised thresholding algorithm demonstrates the potential of data-driven methods to complement and, in certain circumstances, replace manual thresholds in the analysis of this platform","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"47 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":"133035028","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
Machine Extraction of Landforms from Multispectral Images Using Texture and Neural Methods 基于纹理和神经网络的多光谱图像地形机器提取
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.84
P. Chowdhury, B. Deshmukh, Anil Goswami
{"title":"Machine Extraction of Landforms from Multispectral Images Using Texture and Neural Methods","authors":"P. Chowdhury, B. Deshmukh, Anil Goswami","doi":"10.1109/ICCTA.2007.84","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.84","url":null,"abstract":"This study makes an attempt towards machine generation of landform maps from optical remote sensing data. The automation in our approach is to the extent that the training of multilayer perceptrons (MLP) used as a classifier is carried out offline, and subsequently the trained MLP is used to identify the landform classes in a given unknown satellite image. Emphasis of this paper is on exploring potential of gray level co-occurrence (GLC) texture statistics computed from a reasonably extensive database created using multispectral images for landform discrimination. GLC texture statistics form the feature of the pattern vector used for training the MLP. Generalization results are assessed using the cross validation mechanism. Our results for aeolian landforms suggest the textural method to be promising in machine extraction of landforms","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"79 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":"131447564","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
Ranking of Optical Character Prototypes in a Large Database Using Isothetic Chord Lengths 利用等音弦长度对大型数据库中的光学字符原型进行排序
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.109
Partha Bhowmick, A. Biswas, B. Bhattacharya
{"title":"Ranking of Optical Character Prototypes in a Large Database Using Isothetic Chord Lengths","authors":"Partha Bhowmick, A. Biswas, B. Bhattacharya","doi":"10.1109/ICCTA.2007.109","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.109","url":null,"abstract":"A novel algorithm for conferring a ranking system on the prototypes of a large database of optical/handwritten characters is proposed. The ranking system is designed using the (isothetic) chord lengths of the enclosing isothetic polygons corresponding to the prototypes, for a prescribed grid-size. As the derivation of structural information of a character by thinning or by edge detection is susceptible to its impurity during imaging or post-processing, an isothetic polygon is used that captures the geometric structure of the character in an elegant way. The proposed scheme has a striking potential in deciding the relative merit and usefulness of a particular prototype with respect to the other prototypes of the corresponding character in the concerned database. Several quantitative measures have been suggested, and supporting experimental results have been reported, which justify the strength and efficiency of the proposed method","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":"129128977","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
Characterization of Isothetic Polygons for Image Indexing and Retrieval 面向图像索引与检索的等值多边形特征
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.36
A. Biswas, Partha Bhowmick, B. Bhattacharya
{"title":"Characterization of Isothetic Polygons for Image Indexing and Retrieval","authors":"A. Biswas, Partha Bhowmick, B. Bhattacharya","doi":"10.1109/ICCTA.2007.36","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.36","url":null,"abstract":"A novel algorithm for two-level indexing of a binary image in a database is proposed. The scheme is based on certain elementary geometric features of the tightly fitting isothetic polygon circumscribing the digital object (and/or those inscribing the holes in the interior of the object). These features, being simple and precise, are used to form a higher level description of the underlying objects present in an image. The edges of an isothetic polygon are classified into three types based on the types of vertices defining an edge. The number of each type of edges is used for first-level of indexing, and the total edge length is used in the second level. The scheme has been tested on two benchmark logo databases, and the retrieval results demonstrate the elegance, robustness, efficiency, and speed of the proposed method","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":"121172261","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
An Overlap Removal Algorithm for Macrocell Placement in VLSI Layouts VLSI布局中Macrocell放置的重叠去除算法
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.30
M. Thenappan, Arasu T. Senthil, K. Sreekanth, Ramesh S. Guzar
{"title":"An Overlap Removal Algorithm for Macrocell Placement in VLSI Layouts","authors":"M. Thenappan, Arasu T. Senthil, K. Sreekanth, Ramesh S. Guzar","doi":"10.1109/ICCTA.2007.30","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.30","url":null,"abstract":"An efficient overlap removal algorithm in the context of macrocell placement is presented in this paper. The algorithm works on a novel augmented constraint graph and removes overlap in the presence of fixed location, spacing and boundary constraints imposed on macro cells. We propose a modified parallel plane shadowing sweep algorithm for creation of constraint graph and an augmentation scheme to handle constraints effectively. The spatial relations that exist among the macro cells in an overlapping placement are retained in the overlap free placement. A peripheral placement of macro cells is made feasible by utilizing the information in the constraint graph to compact the macro cells towards the periphery in conjunction with the legalization of the macro cells. Experimental results obtained with and without compaction on randomly generated testcases based on GSRC floorplanning benchmarks are presented. The runtime of the algorithm has been shown to scale linearly with increasing number of blocks","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"25 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":"116717972","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 Finite State Analysis of Time-Triggered CAN (TTCAN) Protocol Using Spin 基于自旋的时间触发CAN (TTCAN)协议的有限状态分析
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.4
I. Saha, Suman Roy
{"title":"A Finite State Analysis of Time-Triggered CAN (TTCAN) Protocol Using Spin","authors":"I. Saha, Suman Roy","doi":"10.1109/ICCTA.2007.4","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.4","url":null,"abstract":"The paper presents a case study of the use of model checking for the analysis of an industrial protocol, a time triggered version of the CAN protocol (TTCAN). Our analysis of this protocol was carried out using the model checker Spin. The original CAN protocol can easily be modeled in Spin, but specifying TTCAN requires the provision of explicitly using time in the modeling language. With a view to express time triggered properties we use a discrete time version of Spin (DT-Spin). This extension allows one to quantify discrete time elapse between events by specifying the time slice in which they occur. Using DT-Spin we have been able to model TTCAN, and subsequently, verify a few of its time-triggered properties. This experience shows that it is possible to largely model TDMA-based protocols using discrete time","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"298 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":"124260356","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
Neural Network Control of Coordinated Multiple Manipulator Systems 协调多机械臂系统的神经网络控制
2007 International Conference on Computing: Theory and Applications (ICCTA'07) Pub Date : 2007-03-05 DOI: 10.1109/ICCTA.2007.90
N. Kumar, V. Panwar, N. Sukavanam
{"title":"Neural Network Control of Coordinated Multiple Manipulator Systems","authors":"N. Kumar, V. Panwar, N. Sukavanam","doi":"10.1109/ICCTA.2007.90","DOIUrl":"https://doi.org/10.1109/ICCTA.2007.90","url":null,"abstract":"This paper proposes a neural network (NN) based control scheme for coordinated multiple robot manipulators carrying a common object. Firstly, an integrated dynamic model of the manipulators and the object is derived in terms of object position and orientation as states of the derived model. Based on this model a controller is proposed that achieves the stability in the sense of Lyapunov for the trajectory tracking of the object as well as tracking of the desired internal forces arising in the system. A feedforward neural network is employed to learn the unknown dynamics of robot manipulators and the object. Finally, numerical simulation studies are carried for two three-link planar manipulators moving a circular disc on specified trajectory","PeriodicalId":308247,"journal":{"name":"2007 International Conference on Computing: Theory and Applications (ICCTA'07)","volume":"437 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":"126119727","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
首页 上一页
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学术官方微信