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

3rd International Conference on Trendz in Information Sciences & Computing (TISC2011)最新文献

筛选
英文 中文
Edge Detection of CT scan Spine disc image using Canny Edge Detection Algorithm based on Magnitude and Edge Length 基于幅度和边缘长度的Canny边缘检测算法在CT扫描脊柱椎间盘图像中的应用
3rd International Conference on Trendz in Information Sciences & Computing (TISC2011) Pub Date : 2011-12-01 DOI: 10.1109/TISC.2011.6169100
E. Punarselvam, P. Suresh
{"title":"Edge Detection of CT scan Spine disc image using Canny Edge Detection Algorithm based on Magnitude and Edge Length","authors":"E. Punarselvam, P. Suresh","doi":"10.1109/TISC.2011.6169100","DOIUrl":"https://doi.org/10.1109/TISC.2011.6169100","url":null,"abstract":"In this paper, a Spinal unit otherwise known as vertebral column consists of 24 separate bony vertebrae together with 5 fused vertebrae, it is the unique interaction between the solid and fluid components that provide the disc the strength and flexibility required to bear loading of the lumbar spine. In this work Magnitude and Edge Length based Canny Edge Detection Algorithm has been proposed to pre processing of boundary detection of the CT scan Spine disc image. To find the correct boundary in noisy image of spine disc is still a difficult one. The proposed Canny Edge Detection algorithm has been used to detect the boundaries of spine disc image from the noisy image. The performance of proposed technique has been verified and validated with the standard medical values. The results show that the proposed technique performs well and produced very near to the optimal solution. This method is robust for all kinds of noisy images.","PeriodicalId":412303,"journal":{"name":"3rd International Conference on Trendz in Information Sciences & Computing (TISC2011)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124378009","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
Processing location prediction queries by pattern indices 根据模式索引处理位置预测查询
3rd International Conference on Trendz in Information Sciences & Computing (TISC2011) Pub Date : 2011-12-01 DOI: 10.1109/TISC.2011.6169083
Mehrnoosh Tarafdar, M. Haghjoo
{"title":"Processing location prediction queries by pattern indices","authors":"Mehrnoosh Tarafdar, M. Haghjoo","doi":"10.1109/TISC.2011.6169083","DOIUrl":"https://doi.org/10.1109/TISC.2011.6169083","url":null,"abstract":"Predicting the possible next location of moving objects is a helpful task in database systems and wireless networks. Extracting mobility patterns from past trajectories is very suitable and different methods have been studied for this purpose. But most of them, except a few, focus on data mining techniques and not on database requirements such as proper indexing techniques and management of discovered patterns. Some of the existing methods do not store timings for patterns and none of them can handle long-term predictions. In this paper, we propose an indexing technique called Trajectory Pattern Indexing for Prediction or TPIP. In complexity analysis, it shows lower searching time than just one similar solution. It also makes it possible to process long-term predictions. With TPIP, we can store patterns with same location sequence but different timing; with no redundancy.","PeriodicalId":412303,"journal":{"name":"3rd International Conference on Trendz in Information Sciences & Computing (TISC2011)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127537731","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
A survey on Zigbee based wireless sensor networks in agriculture 基于Zigbee的农业无线传感器网络研究进展
3rd International Conference on Trendz in Information Sciences & Computing (TISC2011) Pub Date : 2011-12-01 DOI: 10.1109/TISC.2011.6169090
T. Kalaivani, A. Allirani, P. Priya
{"title":"A survey on Zigbee based wireless sensor networks in agriculture","authors":"T. Kalaivani, A. Allirani, P. Priya","doi":"10.1109/TISC.2011.6169090","DOIUrl":"https://doi.org/10.1109/TISC.2011.6169090","url":null,"abstract":"This paper focuses on providing an overview of zigbee based wireless sensor network (WSN) as applied in agriculture for intelligent farming. In this research work, a survey on wireless sensor networks and their standards and technologies in the field of agriculture was carried out. Based on the analysis and survey, the need for intelligent farming especially in developing countries like India, has grown to a greater extent. In this paper we try to survey different applications of zigbee based wireless sensor network in agriculture such as monitoring of environmental conditions like weather, soil moisture content, soil temperature, soil fertility, weed-disease detection, monitoring leaf temperature/moisture content and monitoring growth of the crop, precision agriculture, automated irrigation facility, storage of agricultural products etc. This paper also provides the possible research issues existing in Physical layer of ZigBee.","PeriodicalId":412303,"journal":{"name":"3rd International Conference on Trendz in Information Sciences & Computing (TISC2011)","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124180738","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}
引用次数: 102
An effective video search re-ranking for content based video retrieval 基于内容的视频检索的有效视频搜索重新排序
3rd International Conference on Trendz in Information Sciences & Computing (TISC2011) Pub Date : 2011-12-01 DOI: 10.1109/TISC.2011.6169084
P. Geetha, Vasumathi K. Narayanan
{"title":"An effective video search re-ranking for content based video retrieval","authors":"P. Geetha, Vasumathi K. Narayanan","doi":"10.1109/TISC.2011.6169084","DOIUrl":"https://doi.org/10.1109/TISC.2011.6169084","url":null,"abstract":"Content-Based searching and retrieval of video data has become a challenging and important issue among the search engines. Mostly videos were retrieved based on keyword from a large collection of videos. Given a text query by users, the system then returns a series of approximately relevant video shots by matching the input text with the text documents associated with the video shots. Users are usually interested in the top ranked portion of returned search results and therefore it is crucial for search engines to achieve accuracy on the search results. In this paper content based video searching re-ranking and retrieval framework is proposed to improve the efficiency and accuracy of the search engines. Here input is given as a video, where the video is converted into frames and key frames are extracted. Motion estimation, Colour, edge and texture features are extracted for the key frames. Initial ranking on the search results is done for distinct features. Then features are Fused and finally re-ranked to form a unified accurate search result.","PeriodicalId":412303,"journal":{"name":"3rd International Conference on Trendz in Information Sciences & Computing (TISC2011)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121905626","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
Noise robust zerocrossing rate computation for audio signal classification 音频信号分类的噪声鲁棒过零率计算
3rd International Conference on Trendz in Information Sciences & Computing (TISC2011) Pub Date : 2011-12-01 DOI: 10.1109/TISC.2011.6169086
P. Kathirvel, M. Sabarimalai Manikandan, S. Senthilkumar, K. P. Soman
{"title":"Noise robust zerocrossing rate computation for audio signal classification","authors":"P. Kathirvel, M. Sabarimalai Manikandan, S. Senthilkumar, K. P. Soman","doi":"10.1109/TISC.2011.6169086","DOIUrl":"https://doi.org/10.1109/TISC.2011.6169086","url":null,"abstract":"Zero-crossing rate (ZCR) is one of the most important acoustic feature that has been widely used in voice activity detection, voiced/unvoiced speech classification, music/speech classification image processing, optics, biomedical engineering, radar and fluid mechanics. The conventional time-domain ZCR measurement is sensitive to nonstationary noise. In this paper, we present a noise robust zerocrossing rate computation method. The number of zerocrossings is computed in autocorrelation-domain rather than in time-domain. The accuracy of the proposed measurement method is evaluated using both sinusoidal and speech waveforms under different signal-to-noise ratios (SNRs). Experimental results show that the proposed ZCR measurement method achieves better accuracy than the conventional ZCR measurement methods in the literature.","PeriodicalId":412303,"journal":{"name":"3rd International Conference on Trendz in Information Sciences & Computing (TISC2011)","volume":"270 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132540322","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
Multi path routing protocol for Improving Reliability in IEEE 802.16 Wireless Mesh networks 用于提高IEEE 802.16无线Mesh网络可靠性的多路径路由协议
3rd International Conference on Trendz in Information Sciences & Computing (TISC2011) Pub Date : 2011-12-01 DOI: 10.1109/TISC.2011.6169096
K. Valarmathi, N. Malmurugan
{"title":"Multi path routing protocol for Improving Reliability in IEEE 802.16 Wireless Mesh networks","authors":"K. Valarmathi, N. Malmurugan","doi":"10.1109/TISC.2011.6169096","DOIUrl":"https://doi.org/10.1109/TISC.2011.6169096","url":null,"abstract":"In IEEE 802.16 Wireless Mesh networks (WMN), multipath routing is used to improve the reliability and load balancing. But existing multipath routing protocols for WMNs, causes congestion in the gateways because of routing and control message flooding. In this paper, a multipath routing protocol is proposed to improve the reliability and provide fault-tolerance in IEEE 802.16 WMNs. In this protocol, the interference and load of each link is determined based on which a combined routing metric is designed. Multiple shortest paths are then established and the path with least combined metric is chosen as primary path. In case of any failures in primary path, the data transmission can be rerouted through the backup path. By simulation results, we show that the proposed protocol has improved throughput with reduced delay and overhead when compared to the existing protocols.","PeriodicalId":412303,"journal":{"name":"3rd International Conference on Trendz in Information Sciences & Computing (TISC2011)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128572978","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 experiential analysis of microarray time series data of cancer metastasis using XMAS 利用XMAS对肿瘤转移的微阵列时间序列数据进行经验分析
3rd International Conference on Trendz in Information Sciences & Computing (TISC2011) Pub Date : 2011-12-01 DOI: 10.1109/TISC.2011.6169085
A. Azariah Samuel, M. Xavier Suresh, M. Vaishnavi Devi, K. Radha
{"title":"An experiential analysis of microarray time series data of cancer metastasis using XMAS","authors":"A. Azariah Samuel, M. Xavier Suresh, M. Vaishnavi Devi, K. Radha","doi":"10.1109/TISC.2011.6169085","DOIUrl":"https://doi.org/10.1109/TISC.2011.6169085","url":null,"abstract":"Time series microarray analysis provides an invaluable insight into genetic progression of biological processes such as tumor metastasis. Many algorithms sustain statistical analysis which limits user interaction. We use XMAS to extract knowledge from datasets which increases human-computer synergy, thus providing increased analysis experience. Cancer Metastasis involves complex biological pathway information. The domain knowledge to deciphering these complex data can be integrated using XMAS which offers visual interaction and interoperable operators. Thus XMAS differs from the traditional ‘sit back’ approach of traditional systems to offer ‘sit forward’ analysis to validate results in an unparalleled serendipitous manner.","PeriodicalId":412303,"journal":{"name":"3rd International Conference on Trendz in Information Sciences & Computing (TISC2011)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127366651","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
Automated distributed dynamic survivable RWA protocol for WDM networks 面向WDM网络的自动化分布式动态可存活RWA协议
3rd International Conference on Trendz in Information Sciences & Computing (TISC2011) Pub Date : 2011-12-01 DOI: 10.1109/TISC.2011.6169113
T. K. Ramesh, R. Janani, S. Prannoy Kiran, T. Swapna, P. Vaya
{"title":"Automated distributed dynamic survivable RWA protocol for WDM networks","authors":"T. K. Ramesh, R. Janani, S. Prannoy Kiran, T. Swapna, P. Vaya","doi":"10.1109/TISC.2011.6169113","DOIUrl":"https://doi.org/10.1109/TISC.2011.6169113","url":null,"abstract":"In this paper, we have designed a distributed dynamic survivable RWA protocol based on automatic updation (ADDR). The updation mechanism involves calculation of number of free wavelengths and shortest distance at the source node to identify the optimal and backup lightpath to reduce the congestion and delay in the network. As soon as the request approaches the node, it is served with the best lightpath with the help of the data available in the node table which reduces the setup time. Backup lightpath is used for survivability. The selection of backup lightpath is done in such a way that there is no shared link between the primary and backup lightpath but it can be shared with another backup lightpath. Grooming is used for low speed traffics to reduce the connection request blocking. By simulation results, we showed that our proposed protocol has low blocking probability.","PeriodicalId":412303,"journal":{"name":"3rd International Conference on Trendz in Information Sciences & Computing (TISC2011)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132257491","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
End-to-end transmission of spatial data using dynamic allocation of resources 使用动态资源分配的端到端空间数据传输
3rd International Conference on Trendz in Information Sciences & Computing (TISC2011) Pub Date : 2011-12-01 DOI: 10.1109/TISC.2011.6169094
G. Vincent, T. Sasipraba
{"title":"End-to-end transmission of spatial data using dynamic allocation of resources","authors":"G. Vincent, T. Sasipraba","doi":"10.1109/TISC.2011.6169094","DOIUrl":"https://doi.org/10.1109/TISC.2011.6169094","url":null,"abstract":"Delivering GIS (Geographical Information System) services against the user query is a very valuable task as the GIS application requires the support of exclusive routing and networking resources. Since these kinds of applications are carrying spatial as well as attributed data and they are integrated as a service component, obviously the veracity and size of the application is bigger than the conventional one. Furthermore, the spatial data which is used in GIS application is high resolution satellite images. Traditionally, end-to-end transmission of spatial data contents will be rendered to the client browser consumes more time, and the veracity of the content must be safe-guarded. Since the GIS image constitutes of various layers and they are in an integrated format, the image is obviously bulk in size. It poses major threat to the end user by unnecessarily wait for a long time to render the spatial data into the client browser. So a novel routing strategy must be adapted to ensure the best effort delivery of GIS data. In this paper, we have introduced QGIS routing (QoS routing for GIS applications) technique used to handle the user query well and the appropriate network resources will be allotted. To foster the proposed method, We have designed a GIS system for emergency management as a test bed to verify and validate with the proposed method. The application specific QoS attributes are tested and the experimental result shows a very favorable result.","PeriodicalId":412303,"journal":{"name":"3rd International Conference on Trendz in Information Sciences & Computing (TISC2011)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126318327","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
Design and implementation of orthogonal wavelet division multiplexing (OHWDM) with minimum bit error rate 最小误码率正交小波分复用(OHWDM)的设计与实现
3rd International Conference on Trendz in Information Sciences & Computing (TISC2011) Pub Date : 2011-12-01 DOI: 10.1109/TISC.2011.6169097
N. R. Raajan, B. Monisha, M. Ram Kumar, A. Jenifer Philomina, M. Priya, D. Parthiban, S. Suganya
{"title":"Design and implementation of orthogonal wavelet division multiplexing (OHWDM) with minimum bit error rate","authors":"N. R. Raajan, B. Monisha, M. Ram Kumar, A. Jenifer Philomina, M. Priya, D. Parthiban, S. Suganya","doi":"10.1109/TISC.2011.6169097","DOIUrl":"https://doi.org/10.1109/TISC.2011.6169097","url":null,"abstract":"In this paper, we propose a new modulation/multiplexing system using wavelet transform. This new modulation technique makes use of the existing standard (orthogonal frequency division multiplexing) OFDM system and replacing the Fourier transform blocks by wavelet transform blocks. There are different types of wavelet transforms are available, out of which 4 were chosen. They are Haar, Daubechies4, Biorthogonal and reverse Biorthogonal transforms. The performance of the wavelet based OFDM system using various modulations like BPSK, DPSK, QPSK, DQPSK, OQPSK and 16-QAM was assessed by various parameters such as bit error rate, eye diagram and constellation diagram. The best among all the transforms was concluded to be the haar transform and the best modulation was BPSK. The sample results of all the transforms with bpsk with an SNR of 18db are as shown. The proposed system is named (orthogonal haar wavelet division multiplexing) OHWDM.","PeriodicalId":412303,"journal":{"name":"3rd International Conference on Trendz in Information Sciences & Computing (TISC2011)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121600438","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
下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信
小红书