2014 Annual IEEE India Conference (INDICON)最新文献

筛选
英文 中文
Efficient iceberg query evaluation using set representation 使用集合表示的高效冰山查询评估
2014 Annual IEEE India Conference (INDICON) Pub Date : 2014-12-01 DOI: 10.1109/INDICON.2014.7030537
V. Rao, P. Sammulal
{"title":"Efficient iceberg query evaluation using set representation","authors":"V. Rao, P. Sammulal","doi":"10.1109/INDICON.2014.7030537","DOIUrl":"https://doi.org/10.1109/INDICON.2014.7030537","url":null,"abstract":"Iceberg query (IBQ) is a special class of aggregation query which compute aggregations upon user provided threshold (T). In data mining area, efficient evaluation of iceberg queries has been attracted by many researchers due to enormous production of data in industries and commercial sectors. In literature, different strategies were found for IBQ evaluation, but using compressed bitmap index technique provides efficient strategy among all. In this paper, we propose a new strategy for computing IBQ, which builds a set for each attribute value, contains its occurrences in the attribute column and performs set operations for producing result. An experimentation on synthetic dataset demonstrates our approach is efficient than existing strategies for lower thresholds.","PeriodicalId":409794,"journal":{"name":"2014 Annual IEEE India Conference (INDICON)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122073520","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
Shirorekha extraction in Character Segmentation for printed devanagri text in Document Image Processing 文档图像处理中印文字符分割中的Shirorekha提取
2014 Annual IEEE India Conference (INDICON) Pub Date : 2014-12-01 DOI: 10.1109/INDICON.2014.7030535
Ambadas B. Shinde, Y. Dandawate
{"title":"Shirorekha extraction in Character Segmentation for printed devanagri text in Document Image Processing","authors":"Ambadas B. Shinde, Y. Dandawate","doi":"10.1109/INDICON.2014.7030535","DOIUrl":"https://doi.org/10.1109/INDICON.2014.7030535","url":null,"abstract":"Finding Structural Layout, Text Line Segmentation, Word Level Segmentation and Character Level Segmentation is major step in offline OCR systems for Devanagari Script in Document Image Processing. This paper proposes a Word and Character Segmentation method for machine printed Devanagari text. A complete word and character segmentation system for Devanagari printed text is presented here. Sometimes, interline space and fused characters make line segmentation and character segmentation a difficult task respectively. We have tested our method on documents in Marathi scripts. A novel technique of character segmentation for printed Devanagari text is presented here. After removing the Shirorekha (header line) of Devanagari text, the bounding boxes are used to surround the segmented characters. Results obtained from this method are encouraging because of morphological operations. In this method we are proposing some basic morphological operations on the scanned document images and got much better results.","PeriodicalId":409794,"journal":{"name":"2014 Annual IEEE India Conference (INDICON)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123944270","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}
引用次数: 14
Accurate 3D terrain modeling by range data fusion from two heterogeneous range scanners 由两个异构距离扫描仪的距离数据融合精确的三维地形建模
2014 Annual IEEE India Conference (INDICON) Pub Date : 2014-12-01 DOI: 10.1109/INDICON.2014.7030692
M. Singh, K. Venkatesh, A. Dutta
{"title":"Accurate 3D terrain modeling by range data fusion from two heterogeneous range scanners","authors":"M. Singh, K. Venkatesh, A. Dutta","doi":"10.1109/INDICON.2014.7030692","DOIUrl":"https://doi.org/10.1109/INDICON.2014.7030692","url":null,"abstract":"In this paper, we propose a new method for range data fusion from two heterogeneous range acquisition systems (i.e. Laser range scanner and Microsoft Kinect) for the extraction of accurate, realistic and rapidly 3D terrain surface. First we present an active contour model for unsupervised segmentation of RGB image and corresponding depth image by minimizing the total energy function. An unsupervised method for effective curve initialization is based on an equally divided n-regions mean and variance of saliency map. We have transformed both range sensors 3D data to transformed reference frame using PCA algorithm and apply the ICP algorithm to align both data in the reference frame. The alignment of both range scanner data in the transform reference frame is 100 times faster than directly apply the ICP algorithm. To generate the highly precise 3D fused data, we have selected the coarser detailed region of terrain from Kinect and fine detailed region from the Laser range scanner. The 3D fused terrain surface is generated using a Delaunay triangulation algorithm. Finally, the experimental results demonstrate the highly robust and precision of the proposed approach. Therefore, we have generated a seamless integration of terrain 3D surface from two different range scanners 3D range data which validate the correctness of the real 3D surface model of the terrain.","PeriodicalId":409794,"journal":{"name":"2014 Annual IEEE India Conference (INDICON)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125770158","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
Extraction of glottal closure and opening instants using zero frequency filtering 使用零频率滤波提取声门关闭和打开的瞬间
2014 Annual IEEE India Conference (INDICON) Pub Date : 2014-12-01 DOI: 10.1109/INDICON.2014.7030502
K. Deepak, K. Ramesh, S. Prasanna
{"title":"Extraction of glottal closure and opening instants using zero frequency filtering","authors":"K. Deepak, K. Ramesh, S. Prasanna","doi":"10.1109/INDICON.2014.7030502","DOIUrl":"https://doi.org/10.1109/INDICON.2014.7030502","url":null,"abstract":"In this paper a simple method is proposed using zero frequency filtering (ZFF) of a close approximate glottal flow derivative (GFD) to extract glottal closure (GCI's) and opening instants (GOI's) from speech. The GFD is obtained from iterative adaptive inverse filtering (IAIF) which contains such instants. It is observed that GCI's can be located by positive zero crossings of zero frequency filtered signal (ZFFS) obtained from GFD. However, GOI's can be located using GFD from negative to positive zero crossing regions of ZFFS. The method is evaluated using CMU-Arctic databases and compared with other state of the art methods under clean and noisy conditions. The performance of the proposed methods are robust under noisy conditions and comparable to other existing methods.","PeriodicalId":409794,"journal":{"name":"2014 Annual IEEE India Conference (INDICON)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128179566","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
Energy efficient implementation of 16-Bit ALU using block enabled clock gating technique 高效节能的16位ALU的实现使用块使能时钟门控技术
2014 Annual IEEE India Conference (INDICON) Pub Date : 2014-12-01 DOI: 10.1109/INDICON.2014.7030531
Roopa R. Kulkarni, S. Kulkarni
{"title":"Energy efficient implementation of 16-Bit ALU using block enabled clock gating technique","authors":"Roopa R. Kulkarni, S. Kulkarni","doi":"10.1109/INDICON.2014.7030531","DOIUrl":"https://doi.org/10.1109/INDICON.2014.7030531","url":null,"abstract":"The need to design and develop high performance and high speed VLSI systems such as NOCs in networking or SOCs in communication and computing has shifted the focus from traditional performance parameters towards the analysis of power consumption. In such devices managing the power among the domains of a system is of real concern. Hence, the low power design techniques namely: clock gating, power gating, dynamic voltage scaling and frequency scaling are of most important. In this paper the clock gating technique is applied to a 16-bit ALU. In the this work the ALU is divided into two functional units namely: Arithmetic unit and Logical Unit. The demultiplexer is used as a selector of the functional unit for which the clock is applied. The design is simulated using QuestaSim power aware simulator, implemented and synthesized using Precision synthesis tool on a Spartan 6 FPGA. Power analysis is carried out using Xilinx XPower analyzer. The design is tested for a wide band of frequencies from 1MHz to 5000MHz. The Clock and dynamic power reduction is observed for lower frequencies but for high frequency the target device has the limitation. The clock gating technique when applied to the design it is observed that the clock power is reduced by an average of 70% for lower frequencies and an average of 30% for higher frequencies. This reduction is at the cost increase in area by 2%.","PeriodicalId":409794,"journal":{"name":"2014 Annual IEEE India Conference (INDICON)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128683678","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
Hardwired BIST architecture of SRAM 硬连线SRAM的BIST架构
2014 Annual IEEE India Conference (INDICON) Pub Date : 2014-12-01 DOI: 10.1109/INDICON.2014.7030466
S. Majumdar, P. Bansod
{"title":"Hardwired BIST architecture of SRAM","authors":"S. Majumdar, P. Bansod","doi":"10.1109/INDICON.2014.7030466","DOIUrl":"https://doi.org/10.1109/INDICON.2014.7030466","url":null,"abstract":"This work proposed an on-chip architectural design, validation and feasibility of a BIST for 8×8 SRAM using 0.18 μm UMC technology in Cadence Virtuoso and Spectre Tool for storage and retrieval faults detection. As, the technology shrinks and share of memories in complex systems increases, memories become susceptible to faults. Storage and retrieval faults are genuinely faced by SRAM. This type of fault occurs due to improper storage or retrieval of data i.e. breakage in the word line or in bit line. Thus, it become a major issue for test engineers, as area overhead is a constraint. From the results obtained, it has been observed that the proposed architecture, for detecting the storage and retrieval faults is working properly but the area and power due to BIST is increased with comparison to the circuit under test alone. The feasibility of proposed BIST architecture is checked by calculating the area and power overhead of BIST for large size memories.","PeriodicalId":409794,"journal":{"name":"2014 Annual IEEE India Conference (INDICON)","volume":"06 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127193625","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
PAPR reduction in OFDM systems OFDM系统中PAPR的降低
2014 Annual IEEE India Conference (INDICON) Pub Date : 2014-12-01 DOI: 10.1109/INDICON.2014.7030615
P. Pradhan, S. Yadav, S. K. Patra
{"title":"PAPR reduction in OFDM systems","authors":"P. Pradhan, S. Yadav, S. K. Patra","doi":"10.1109/INDICON.2014.7030615","DOIUrl":"https://doi.org/10.1109/INDICON.2014.7030615","url":null,"abstract":"In a communication system, operation of the transmitter power amplifier is limited to linear range. Input signal with an amplitude more than the transmitter power amplifier linear range results in signal distortion. Hence, the input signal to the transmitter should be with low peak to average power ratio. This paper presents a new method of reducing the peak to average power ratio in OFDM system. The proposed method is based on DCT aided successive addition and subtraction of OFDM symbols inside the single OFDM frame. Performance of the proposed method is evaluated and found to be superior to PTS, SLM techniques.","PeriodicalId":409794,"journal":{"name":"2014 Annual IEEE India Conference (INDICON)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127275391","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}
引用次数: 44
Credibility-based result verification for Map-reduce 基于可信度的Map-reduce结果验证
2014 Annual IEEE India Conference (INDICON) Pub Date : 2014-12-01 DOI: 10.1109/INDICON.2014.7030682
Tina Annie Samuel, Nizar M. Abdul
{"title":"Credibility-based result verification for Map-reduce","authors":"Tina Annie Samuel, Nizar M. Abdul","doi":"10.1109/INDICON.2014.7030682","DOIUrl":"https://doi.org/10.1109/INDICON.2014.7030682","url":null,"abstract":"The Hadoop architecture and Map-reduce paradigm together provide a cost-effective distributed computing environment for large data banks. The system performs effective, fault-tolerant and speedy processing of data by replicating data and computation on multiple nodes. This can lead to a scenario known as collusion where malicious nodes might join hands and return wrong results. Thus, there is a need to verify the results. Majority voting scheme is the most common approach, but it suffers from the problem of declaring the results returned by malicious nodes as acceptable if those nodes form the majority. Thus, majority alone cannot be used to ascertain the correctness of a result. We propose a credibility-based approach for result verification. It assigns credibility values to nodes based on their execution outcomes and uses them effectively for result verification. Our experiments show that the proposed approach is much more accurate than majority-based scheme.","PeriodicalId":409794,"journal":{"name":"2014 Annual IEEE India Conference (INDICON)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129982335","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
Evolutionary algorithm for cost reduction in cellular network 蜂窝网络中成本降低的进化算法
2014 Annual IEEE India Conference (INDICON) Pub Date : 2014-12-01 DOI: 10.1109/INDICON.2014.7030436
S. Parija, P. K. Sahu, S. S. Singh
{"title":"Evolutionary algorithm for cost reduction in cellular network","authors":"S. Parija, P. K. Sahu, S. S. Singh","doi":"10.1109/INDICON.2014.7030436","DOIUrl":"https://doi.org/10.1109/INDICON.2014.7030436","url":null,"abstract":"Mobility management is a prime issue in a wireless computing environment. There is a need to develop various algorithms that could capture this complexity and used to solve the mobility management scenarios. When a mobile user moves from one cell to another cell some amount of cost is acquired for the same. These cells are assigned as either “reporting cell” or “non-reporting cell”, also known as reporting cell planning problem (RCP). In this paper, to reduce the total cost, two optimization techniques are adopted and compared to solve the problem. Total cost in location management signifies location update cost and paging cost. Two optimization algorithms needed to capture the issue are Genetic Algorithm (GA) and Binary Particle Swarm Optimization Algorithm (BPSO) which is also compared to measure the performance in terms of cost. For the same problem BPSO is shown to outperform GA in terms of quality of solution and also proved to be efficient in a competitive approach for the several benchmark issues. The simulation results also indicate BPSO is robust, gives higher solution quality and offers faster global convergence. These proposed techniques are also validated on service data and compared with the synthetic data of the different subscribers present in different reporting cells. A number of optimization problems are solved using this evolutionary algorithm and results obtained are quite satisfactory.","PeriodicalId":409794,"journal":{"name":"2014 Annual IEEE India Conference (INDICON)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130073555","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
TDMA scheduling of group aware tree in Wireless Sensor Networks 无线传感器网络中组感知树的TDMA调度
2014 Annual IEEE India Conference (INDICON) Pub Date : 2014-12-01 DOI: 10.1109/INDICON.2014.7030689
T. Vasavada, S. Srivastava
{"title":"TDMA scheduling of group aware tree in Wireless Sensor Networks","authors":"T. Vasavada, S. Srivastava","doi":"10.1109/INDICON.2014.7030689","DOIUrl":"https://doi.org/10.1109/INDICON.2014.7030689","url":null,"abstract":"Data collection is an important operation in Wireless Sensor Networks. Sensors are deployed in given region of interest. They sense physical phenomenon and transfer data to a central node known as Sink. Tree is a widely used routing topology and Time Division Multiple Access (TDMA) is a widely used Medium Access Control (MAC) protocol. Sink is at the root of the tree. Often nodes in a tree aggregate the data coming from children with their own data. Data aggregation results in energy conservation and reduction in network traffic. Often sensor networks are heterogeneous in nature. Multiple groups (or types) of sensors are deployed in given region. In heterogeneous network, tree formation should consider presence of different groups. That is, a node should select node of same group as itself as parent. This is known as group aware tree formation. Other approach is static tree formation. In static tree formation, parent is selected without considering its group. Group aware tree formation increases chances of aggregation. Inspired from work done in [9] and [10], we have implemented group aware tree formation .Group aware tree formation is followed by TDMA scheduling of edges. Performance measures like energy consumption and number of time-slots used are examined. It is concluded that group aware tree formation results in less number of required timeslots compared to static tree and energy consumption is also less.","PeriodicalId":409794,"journal":{"name":"2014 Annual IEEE India Conference (INDICON)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129046439","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
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学术官方微信