Sulav Malla

Projects


Try dragging the nodes around

Force Directed Graph

As part of a project in my Data Visualization class, I had made a force directed graph of a dataset that contained character coappearence in Victor Hugo's Les MisĖerables, compiled by Donald Knuth. As seen above, these graphs are interactive, aesthetically pleasing, and often reveal structures in the network. You can try dragging the nodes around in the above graph.

Tools used: Processing, p5.js

code


Deep Feature vs Traditional Feature for Bone Texture Characterization

Osteoporosis can be identified by looking at 2D x-ray images of the bone. The high degree of similarity between images of a healthy bone and a diseased one makes classification a challenge. A good bone texture characterization technique is essential for identifying osteoporosis cases. Standard texture feature extraction techniques like Local Binary Pattern (LBP), Gray Level Co-occurrence Matrix (GLCM), Law's etc. have been used for this purpose. In this project, we draw a comparison between deep features extracted from convolution neural network against these traditional features. Our results show that deep features have more discriminative power as classifiers trained on them always outperform the ones trained on traditional features.

Tools used: Weka, MatConvNet, MATLAB, python

project report


A Faster Parallel Algorithm for Analyzing Drug-Drug Interaction from MEDLINE Database

Use of multiple medications can have hazardous effect on health due to Drug-Drug interaction (DDI). MEDLINE database contains many articles related to DDI and a random-sampling-based algorithm has been purposed to automatically identify DDI by reading the substance field of MEDLINE records. However, this single threaded algorithm cannot fully utilize the processing capability of multi-core processors that are common today. As the number of cores in a single processor continue to rise, a parallel program that can better utilize these resources at hand become increasingly important. In this project, we introduce a parallel version of the existing algorithm that can run on multiple cores simultaneously, making the computation faster. Experimental results on same hardware show that calculations done using our parallel multi-threaded program is up to 19 times faster compared to the original single threaded one.

Tools used: python, C++, OpenMP, Intel VTune Amplifier, Intel compilers

project report

code