Time filter

Source Type

Mohamed A.E.G.,Islamic University | Faudzi A.A.M.,Center for Artificial Intelligence and Robotics
2015 10th Asian Control Conference: Emerging Control Techniques for a Sustainable World, ASCC 2015 | Year: 2015

The modal method for modeling in time - domain model of pressure transients in hydraulic transmission lines is shown to be equivalent to a variation method. Attenuation factors, similar to the windows used in spectral analysis, are used to attenuate Gibbs phenomenon oscillations. Explicit formulas are given for various end conditions. The method is also applied to nonlinear damping models. © 2015 IEEE.


Sidharth S.,Center for Artificial Intelligence and Robotics | Sebastian M.P.,Indian Institute of Management Kozhikode
ACE 2010 - 2010 International Conference on Advances in Computer Engineering | Year: 2010

The WiMAX IEEE 802.16 (e) is defined as the Worldwide Interoperability for Microwave Access by the WiMAX Forum, formed in April 2001 to promote conformance and interoperability of the IEEE 802.16 standard, officially known as WirelessMAN. The absence of physical boundaries makes in general a wireless network more vulnerable than a wired network. The IEEE 802.16 provides a security sublayer in the MAC layer to address the privacy issues across the fixed BWA (Broadband Wireless Access). Several proposals have been published to address the flaws in IEEE802.16 security after the release of IEEE802.16-2001. However, even with the modified version IEEE802.16-2004, the security problems still persist and many additional flaws have emerged. This paper examines the threats against the authentication protocols of WiMAX and proposes a new authentication protocol which is more reliable and secure. The proposed protocol is rigid against the attacks like Denial of service (DOS), Man-in-the-middle and replay. © 2010 IEEE.


Panigrahi N.,Center for Artificial Intelligence and Robotics | Mishra C.S.,National Institute of Technology Rourkela
Defence Science Journal | Year: 2015

Map projections are mathematical methods for projecting spherical coordinates in the form of (9, X) to the map coordinates in the form of (X,Y) in Cartesian reference frame. Numerous methods for map projection have been derived and are being used for preparation of cartographic products. These map projections take into account specific position of the viewer on the datum surface for derivation of the map projections. A generic method for azimuthal map projection where the position of the viewer can be taken at an arbitrary point on the datum surface is derived. Using this generic method all the specific azimuthal map projections can be derived. © 2015, DESIDOC.


Lakshmi A.,Center for Artificial Intelligence and Robotics | Rakshit S.,Center for Artificial Intelligence and Robotics
2010 IEEE 2nd International Advance Computing Conference, IACC 2010 | Year: 2010

An efficient non-orthogonal pyramid representation was proposed by Burt. However it has been stated in literature that the Laplacian sub bands of Burt pyramid have redundant information. In this paper, we propose a modified pyramid representation to reduce the redundancy in Laplacian sub bands. The proposed pyramid representation makes use of well studied de-blurring algorithm to get a prediction of blurred Gaussian images. The proposed pyramid is an improvement on Burt pyramid as it exhibits reduced sub-band frequency overlap, cross correlation and mutual information. The advantage of using this pyramid representation in image magnification and Progressive image transmission (PIT) in noisy and unreliable networks is discussed here. ©2010 IEEE.


Lakshmi A.,Center for Artificial Intelligence and Robotics | Rakshit S.,Center for Artificial Intelligence and Robotics
2010 IEEE 2nd International Advance Computing Conference, IACC 2010 | Year: 2010

Image descriptors encode the images in the database as feature vectors. Feature vectors play main role in content based image retrieval. This paper proposes a new feature vector based on wavelets. Most of the natural images have short span high frequencies and low frequencies extending for larger span. Hence, the design of our feature vector is such that it provides higher spatial localization and lower frequency resolution at higher frequencies and the reverse for lower frequencies. The energy of the frequency content of the image at various sub-bands and different spatial resolution (higher for higher frequency bands) is stored as feature vector. Thus, the given feature vector encodes high frequency information as well. The superiority of the proposed algorithm over some traditional algorithms is substantiated with results. ©2010 IEEE.


Lakshmi A.,Center for Artificial Intelligence and Robotics | Faheema A.G.J.,Center for Artificial Intelligence and Robotics | Deodhare D.,Center for Artificial Intelligence and Robotics
Infrared Physics and Technology | Year: 2016

Pedestrian detection is a key problem in night vision processing with a dozen of applications that will positively impact the performance of autonomous systems. Despite significant progress, our study shows that performance of state-of-the-art thermal image pedestrian detectors still has much room for improvement. The purpose of this paper is to overcome the challenge faced by the thermal image pedestrian detectors, which employ intensity based Region Of Interest (ROI) extraction followed by feature based validation. The most striking disadvantage faced by the first module, ROI extraction, is the failed detection of cloth insulted parts. To overcome this setback, this paper employs an algorithm and a principle of region growing pursuit tuned to the scale of the pedestrian. The statistics subtended by the pedestrian drastically vary with the scale and deviation from normality approach facilitates scale detection. Further, the paper offers an adaptive mathematical threshold to resolve the problem of subtracting the background while extracting cloth insulated parts as well. The inherent false positives of the ROI extraction module are limited by the choice of good features in pedestrian validation step. One such feature is curvelet feature, which has found its use extensively in optical images, but has as yet no reported results in thermal images. This has been used to arrive at a pedestrian detector with a reduced false positive rate. This work is the first venture made to scrutinize the utility of curvelet for characterizing pedestrians in thermal images. Attempt has also been made to improve the speed of curvelet transform computation. The classification task is realized through the use of the well known methodology of Support Vector Machines (SVMs). The proposed method is substantiated with qualified evaluation methodologies that permits us to carry out probing and informative comparisons across state-of-the-art features, including deep learning methods, with six standard and in-house databases. With reference to deep learning, our algorithm exhibits comparable performance. More important is that it has significant lower requirements in terms of compute power and memory, thus making it more relevant for depolyment in resource constrained platforms with significant size, weight and power constraints. © 2016 Elsevier B.V. All rights reserved.


Krishna V.,Center for Artificial Intelligence and Robotics | Suri N.N.R.R.,Center for Artificial Intelligence and Robotics | Athithan G.,Center for Artificial Intelligence and Robotics
Proceedings of the 2012 International Conference on Recent Advances in Computing and Software Systems, RACSS 2012 | Year: 2012

Graph mining has been a widely studied domain over the years. Graph representation of real world problems has enabled the development of simple solutions bringing in better clarity. Graph mining has various sub domains among which graph matching is a prominent one having a number of algorithms. With the rise of new applications involving large sets of networked data, the performance of these algorithms has become important. The graph based representations for social networks and communication networks have led to the evolution of multi-labelled large graphs which are still not completely handled by the existing algorithms. The requirement of a fast and efficient indexing process so as to accommodate dynamic graphs without having to opt for incremental indexing is another major challenge. In this paper, we propose MuGRAM- a multi-labelled graph matching approach aimed at addressing the above mentioned issues. This approach is capable of handling multiple labels for vertices as well as edges of reference graphs. An enhanced indexing method proposed in the paper ensures a fast indexing process. A breadth first search oriented spanning tree along with a novel technique for neighbourhood matching ensures fast query processing. Experimental evaluation of MuGRAM in comparison with some of the recent algorithms in the field highlights its superior performance. © 2012 IEEE.


Syed I.A.,Center for Artificial Intelligence and Robotics | Sharma B.,Center for Artificial Intelligence and Robotics
2013 IEEE 2nd International Conference on Image Information Processing, IEEE ICIIP 2013 | Year: 2013

We propose a novel technique for registration of 3D point sets using both the RGB data as well as the depth data. The main advantage of any RGB-D sensor is the pixel wise correspondence between RGB values and depth values, which can be leveraged to register two RGB-D datasets. RGB images are used for correspondence identification and these correspondences are transferred to depth images to be used for the registration algorithm. RANSAC is used for rejection of noisy data points, which increases the registration accuracy. We also analyze and present an error threshold selection strategy for fitting 3D points. Our approach achieves faster execution, thus enabling real-time implementation of change detection and 3D mapping of the environment, etc. Multiple feature extraction methods have been tested to evaluate tradeoffs between accuracy and time. © 2013 IEEE.


Kundu A.,Center for Artificial Intelligence and Robotics
Procedia Computer Science | Year: 2015

Gateways implementing IPSec protocol suite are used to provide secure communication between different client machines over public infrastructure. However the exploitation of covert storage channel in the IPSec protocol may defeat the very purpose of protecting leakage of information from the client machine. This threat gets more aggravated as some of the channels might be exploited from the client machine even without compromising the security of the IPSec gateways. The possibility of information leakage by compromising only the client machine, either in form of a colluding insider or due to the presence of some malware at the client machine, poses a serious threat to any organization dealing with sensitive information and a resourceful adversary. The existing approaches to mitigate the threats against storage covert channels severely restrict the usability of many QoS aware applications by reducing the allowance of relevant header fields to minimum. This work overcomes the same by creating separate partitions based on application specific QoS requirements. Subsequent IPSec processing involves extension of the scope of security services as per the predefined QoS requirements. This is achieved by appropriate allowance of QoS related header fields using a comprehensive treatment of the storage and timing covert channels. When compared with existing approaches, the proposed approach provides better usability in QoS demanding contexts while maintaining equivalent strength of protection against storage covert channels and providing equivalent performance. The paper also outlines an implementation strategy of the same on Linux kernel IPSec stack. © 2015 The Authors.


Lakshmi A.,Center for Artificial Intelligence and Robotics | Rakshit S.,Center for Artificial Intelligence and Robotics
Communications in Computer and Information Science | Year: 2011

In image retrieval, Curvelet global features have been used so far. They have shown promising results in characterizing texture because of its inherent ability to capture edge information more accurately than Wavelet and Gabor. Global feature fails to characterize the local features of the images. So, we have proposed a technique to combine the global texture (Curvelet) and color features with local features derived from Salient regions. We present a Salient region detector (based on Curvelet) that extracts the regions where variations occur. We show that using the global distribution of local features in addition to global features provides better retrieval performance than those features which represents the global nature of the image alone. © Springer-Verlag Berlin Heidelberg 2011.

Loading Center for Artificial Intelligence and Robotics collaborators
Loading Center for Artificial Intelligence and Robotics collaborators