MSc, M.Tech

R. Nandakumar currently serves as Assistant Professor in the Department of Computer Science and I.T., School of Arts & Sciences, Amrita Vishwa Vidyapeetham, Kochi.  

Qualification: M.Tech. (CS), M.Sc. (Physics), UGC-NET (Physics)


Publication Type: Journal Article

Year of Publication Title


Athul Motty, Yogitha A, and R. Nandakumar, “FLAG Semaphore Detection Using Tenserflow and OpenCV ”, International Journal of Recent Technology and Engineering (IJRTE) , vol. 7, no. 6, 2019.[Abstract]

This paper studies the automatic recognition of Flag Semaphores. We consider both static semaphores wherein the flags are held by the signaler in fixed positions and also dynamic signaling with flags (used internationally for aircraft marshalling and also by mariners). Reading Static semaphores such as those used by mariners are our main focus. We suggest the use of image processing and machine learning techniques to recognize and detect the flags and the signaler. OpenCV technology was used to capture the images and the TensorFlow API to detect the static semaphores. We could achieve promising results in the detection of static flag semaphores - a confidence level of 99%. We conclude that for deciphering signals where the flags are in motion, more sophisticated machine learning methods would be needed.

More »»


Sibin James, Pranav Prakash, and R. Nandakumar, “The TREE LIST – Introducing a Data Structure ”, International Journal of Recent Technology and Engineering (IJRTE) , vol. 7, no. 6, 2019.[Abstract]

The array and the linked list are two classic data structures. The array allows constant time random access (achieved in C language with the [] operator) but suffers from its fixed size and relative inflexibility (the latter becomes an issue while performing deletions). The linked list, on the other hand allows dynamic allocation of memory leading to greater flexibility (manifested in easy insertions and deletions) but suffers from slow search speed - O(N) . We describe a complete binary tree-based data structure which we call TREE LIST. It allows dynamic allocation of memory (hence free from many of the fixed size issues of the array) and provides random access with O(log N) complexity - which is an improvement over the linked list although not as fast as the array. We also discuss some other aspects of this data structure – in particular how it supports some of the classic sorting algorithms.

More »»
Faculty Research Interest: