Entity

Time filter

Source Type


Bag S.,International Institute of Information Technology Bhubaneswar | Harit G.,Center for Information and Communication Technology | Bhowmick P.,Indian Institute of Technology Kharagpur
Pattern Recognition | Year: 2014

In this paper we propose a novel character recognition method for Bangla compound characters. Accurate recognition of compound characters is a difficult problem due to their complex shapes. Our strategy is to decompose a compound character into skeletal segments. The compound character is then recognized by extracting the convex shape primitives and using a template matching scheme. The novelty of our approach lies in the formulation of appropriate rules of character decomposition for segmenting the character skeleton into stroke segments and then grouping them for extraction of meaningful shape components. Our technique is applicable to both printed and handwritten characters. The proposed method performs well for complex-shaped compound characters, which were confusing to the existing methods. © 2013 Elsevier Ltd. All rights reserved. Source


Sharma S.,International Institute of Information Technology Bhubaneswar | Agarwal P.,National Institute of Technology Rourkela | Jena S.K.,National Institute of Technology Rourkela
International Journal of Information and Communication Technology | Year: 2016

Wireless sensor networks (WSNs) are made of the sensor nodes with restricted battery life and transmission capability. In this paper, we propose an energy aware multipath routing protocol for wireless sensor networks. This protocol is designed to improve the lifetime, latency and reliability through discovering multiple paths from the source node to the sink (base station). It is the sink initiated route discovery process with the known location information of the source node. At the end of the route formation, one primary path and number of alternate paths are built. The proposed protocol is implemented and compared with the existing protocols and found that it outperformed the existing protocols in terms of energy consumption, throughput, latency and network lifetime. Copyright © 2016 Inderscience Enterprises Ltd. Source


Patnaik B.,International Institute of Information Technology Bhubaneswar | Patnaik B.,Indian Institute of Technology Bhubaneswar | Sahu P.K.,Indian Institute of Technology Bhubaneswar
Optik | Year: 2013

In this paper, an ultra high capacity optical system with transmission capacity of 1.28 Tbps using optimized modulation format is presented. The system design is achieved by using a 64-channel 20 Gbps dense wavelength division multiplexing (DWDM) technique. The proposed optimized modulation format has narrower bandwidth than conventional intensity modulation (IM) schemes. It has also high dispersion tolerance. Thus, makes it possible to attain an ultra high capacity long distance transmission. The performance characteristics of the system for different modulation formats are compared through simulation at 20 Gbps. The system is also analyzed for pre, post and symmetrical dispersion compensation techniques. We have also investigated the filtering performance of the system, using narrow-band optical filters at each input and output channel, to improve the coverage range of the proposed system. These filters have been used for analysing the DWDM system performance, for channel spacings of 100 GHz and 50 GHz. The system is designed and simulated for a coverage distance of 200 km and more. The proposed ultra high capacity system is expected to be more technically viable due to the use of optimized modulation format. Results and analysis of the proposed system are also presented. This system will be highly useful for high speed data processing, in the present communication and computer networks. © 2012 Elsevier GmbH. All rights reserved. Source


Mishra B.,International Institute of Information Technology Bhubaneswar | Panigrahy S.K.,National Institute of Technology Rourkela | Charan Tripathy T.,Kalam Institute of Technology | Jena D.,International Institute of Information Technology Bhubaneswar | Jena S.K.,National Institute of Technology Rourkela
Proceedings of the 2011 World Congress on Information and Communication Technologies, WICT 2011 | Year: 2011

In this paper, a secure and efficient protocol for vehicular ad hoc networks has been proposed that ensures both message authentication and privacy preservation. As safety related message may contain life critical information, it is a necessity that the sender as well as the message are authentic. The proposed scheme is based on a secure elliptic curve digital signature algorithm approach. The proposed scheme supports conditional privacy, where the user's location can be revealed at the willingness of the user. Apart from this, the scheme is secure against attacks like DoS, Sybil and Grey/Black Hole attacks. From the comparison with previously proposed schemes, it is found that the proposed scheme as based on elliptic curve discrete logarithmic problem, outperforms existing algorithms based on integer factoring and discrete logarithmic problem. © 2011 IEEE. Source


Mondal P.,Indian Institute of Technology Kharagpur | Biswal P.K.,International Institute of Information Technology Bhubaneswar | Banerjee S.,Indian Institute of Technology Kharagpur
Computers and Electrical Engineering | Year: 2015

Affine Transform (AT) is widely used in high-speed image processing systems. This transform plays an important role in various high-speed image processing applications. AT, an important process during the intensity-based image registration, is applied iteratively during the registration. This is also used for the analysis of the interior of an organ and to get a better view of the organs from various angles in 3D coordinate system. Hence, for real-time medical image registration and visualization of the acquired volumetric images, acceleration of AT is very much sought for. In this paper, a parallel and pipelined architecture of the proposed AT algorithm has been presented. This will accelerate the transform process and reduce the processing time of medical image registration. The architecture is mapped in Field-Programmable Gate Array (FPGA) for prototyping and verification. The results show that the computational complexity of the proposed parallel algorithm is almost 4 times better than that of the conventional algorithm. © 2015 Elsevier Ltd. Source

Discover hidden collaborations