Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Roshan M. D’Souza is active.

Publication


Featured researches published by Roshan M. D’Souza.


PLOS ONE | 2013

Creation of Resveratrol-Enriched Rice for the Treatment of Metabolic Syndrome and Related Diseases

So-Hyeon Baek; Woon-Chul Shin; Hak-Seung Ryu; Dae-Woo Lee; Eunjung Moon; Chun-Sun Seo; Eunson Hwang; Hyun-Seo Lee; Mi-Hyun Ahn; Youngju Jeon; Hyeon-Jung Kang; Sang-Won Lee; Sun Yeou Kim; Roshan M. D’Souza; Hyeonjin Kim; Seong-Tshool Hong; Jong-Seong Jeon

Resveratrol has been clinically shown to possess a number of human health benefits. As a result, many attempts have been made to engineer resveratrol production in major cereal grains but have been largely unsuccessful. In this study, we report the creation of a transgenic rice plant that accumulates 1.9 µg resveratrol/g in its grain, surpassing the previously reported anti-metabolic syndrome activity of resveratrol through a synergistic interaction between the transgenic resveratrol and the endogenous properties of the rice. Consumption of our transgenic resveratrol-enriched rice significantly improved all aspects of metabolic syndrome and related diseases in animals fed a high-fat diet. Compared with the control animals, the resveratrol-enriched rice reduced body weight, blood glucose, triglycerides, total cholesterol, and LDL-cholesterol by 24.7%, 22%, 37.4%, 27%, and 59.6%, respectively. The resveratrol-enriched rice from our study may thus provide a safe and convenient means of preventing metabolic syndrome and related diseases without major lifestyle changes or the need for daily medications. These results also suggest that future transgenic plants could be improved if the synergistic interactions of the transgene with endogenous traits of the plant are considered in the experimental design.


Quantitative imaging in medicine and surgery | 2015

State-of-the-art in retinal optical coherence tomography image analysis.

Ahmadreza Baghaie; Zeyun Yu; Roshan M. D’Souza

Optical coherence tomography (OCT) is an emerging imaging modality that has been widely used in the field of biomedical imaging. In the recent past, it has found uses as a diagnostic tool in dermatology, cardiology, and ophthalmology. In this paper we focus on its applications in the field of ophthalmology and retinal imaging. OCT is able to non-invasively produce cross-sectional volumetric images of the tissues which can be used for analysis of tissue structure and properties. Due to the underlying physics, OCT images suffer from a granular pattern, called speckle noise, which restricts the process of interpretation. This requires specialized noise reduction techniques to eliminate the noise while preserving image details. Another major step in OCT image analysis involves the use of segmentation techniques for distinguishing between different structures, especially in retinal OCT volumes. The outcome of this step is usually thickness maps of different retinal layers which are very useful in study of normal/diseased subjects. Lastly, movements of the tissue under imaging as well as the progression of disease in the tissue affect the quality and the proper interpretation of the acquired images which require the use of different image registration techniques. This paper reviews various techniques that are currently used to process raw image data into a form that can be clearly interpreted by clinicians.


PLOS ONE | 2013

Efficient computation of k-Nearest Neighbour Graphs for large high-dimensional data sets on GPU clusters.

Ali Dashti; Ivan Komarov; Roshan M. D’Souza

This paper presents an implementation of the brute-force exact k-Nearest Neighbor Graph (k-NNG) construction for ultra-large high-dimensional data cloud. The proposed method uses Graphics Processing Units (GPUs) and is scalable with multi-levels of parallelism (between nodes of a cluster, between different GPUs on a single node, and within a GPU). The method is applicable to homogeneous computing clusters with a varying number of nodes and GPUs per node. We achieve a 6-fold speedup in data processing as compared with an optimized method running on a cluster of CPUs and bring a hitherto impossible -NNG generation for a dataset of twenty million images with 15 k dimensionality into the realm of practical possibility.


PLOS ONE | 2012

Accelerating the Gillespie τ-Leaping Method using graphics processing units.

Ivan Komarov; Roshan M. D’Souza; Jose-Juan Tapia

The Gillespie τ-Leaping Method is an approximate algorithm that is faster than the exact Direct Method (DM) due to the progression of the simulation with larger time steps. However, the procedure to compute the time leap τ is quite expensive. In this paper, we explore the acceleration of the τ-Leaping Method using Graphics Processing Unit (GPUs) for ultra-large networks ( reaction channels). We have developed data structures and algorithms that take advantage of the unique hardware architecture and available libraries. Our results show that we obtain a performance gain of over 60x when compared with the best conventional implementations.


international symposium on visual computing | 2014

Fast Mesh-Based Medical Image Registration

Ahmadreza Baghaie; Zeyun Yu; Roshan M. D’Souza

In this paper a fast triangular mesh based registration method is proposed. Having Template and Reference images as inputs, the template image is triangulated using a content adaptive mesh generation algorithm. Considering the pixel values at mesh nodes, interpolated using spline interpolation method for both of the images, the energy functional needed for image registration is minimized. The minimization process was achieved using a mesh based discretization of the distance measure and regularization term which resulted in a sparse system of linear equations, which due to the smaller size in comparison to the pixel-wise registration method, can be solved directly. Mean Squared Difference (MSD) is used as a metric for evaluating the results. Using the mesh based technique, higher speed was achieved compared to pixel-based curvature registration technique with fast DCT solver. The implementation was done in MATLAB without any specific optimization. Higher speeds can be achieved using C/C++ implementations.


international symposium on visual computing | 2015

Dense Correspondence and Optical Flow Estimation Using Gabor, Schmid and Steerable Descriptors

Ahmadreza Baghaie; Roshan M. D’Souza; Zeyun Yu

In this paper, the use of three dense descriptors, namely Schmid, Gabor and steerable descriptors, is introduced and investigated for optical flow estimation and dense correspondence of different scenes and compared with the well-known dense SIFT/SIFTFlow. Several examples of optical flow estimation and dense correspondence across scenes with high variations in the intensity levels, difference in the presence of features and different misalignment models (rigid, deformable, homography etc.) are studied and the results are quantitatively/qualitatively compared with dense SIFT/SIFTFlow. The proposed dense descriptors provide comparable or better results than dense SIFT/SIFTFlow which shows the high potential in this area for more thorough investigations.


Journal of Imaging | 2017

Dense Descriptors for Optical Flow Estimation: A Comparative Study

Ahmadreza Baghaie; Roshan M. D’Souza; Zeyun Yu

Estimating the displacements of intensity patterns between sequential frames is a very well-studied problem, which is usually referred to as optical flow estimation. The first assumption among many of the methods in the field is the brightness constancy during movements of pixels between frames. This assumption is proven to be not true in general, and therefore, the use of photometric invariant constraints has been studied in the past. One other solution can be sought by use of structural descriptors rather than pixels for estimating the optical flow. Unlike sparse feature detection/description techniques and since the problem of optical flow estimation tries to find a dense flow field, a dense structural representation of individual pixels and their neighbors is computed and then used for matching and optical flow estimation. Here, a comparative study is carried out by extending the framework of SIFT-flow to include more dense descriptors, and comprehensive comparisons are given. Overall, the work can be considered as a baseline for stimulating more interest in the use of dense descriptors for optical flow estimation.


arXiv: Tissues and Organs | 2015

A brief comparison between available bio-printing methods

Ali Bakhshinejad; Roshan M. D’Souza

The scarcity of organs for transplant has led to large waiting lists of very sick patients. In drug development, the time required for human trials greatly increases the time to market. Drug companies are searching for alternative environments where the in - vivo conditions can be closely replicated. Both these problems could be addressed by manufacturing artificial human tissue. Recently, researchers in tissue engineering have developed tissue generation methods based on 3-D printing to fabricate artificial human tissue. Broadly, these methods could be classified as laser-assisted and laser free. The former have very fine spatial resolutions (10s of μm) but suffer from slow speed (<; 102 drops per second). The later have lower spatial resolutions (100s of μ m) but are very fast (up to 5 × 103 drops per second). In this paper we review state-of-the-art methods in each of these classes and provide a comparison based on reported resolution, printing speed, cell density and cell viability.


Computer methods in biomechanics and biomedical engineering. Imaging & visualization | 2018

A comparative study on the application of SIFT, SURF, BRIEF and ORB for 3D surface reconstruction of electron microscopy images

Ahmad Pahlavan Tafti; Ahmadreza Baghaie; Andrew B. Kirkpatrick; Jessica D. Holz; Heather A. Owen; Roshan M. D’Souza; Zeyun Yu

Image feature detector and descriptor algorithms have made a big advance in almost every area of computer vision applications including object localisation, object tracking, mobile robot mapping, watermarking, panorama stitching and 3D surface reconstruction by assisting the detection and description of feature points in a set of given images. In this paper, we evaluate the performance of four robust feature detection algorithms namely SIFT, SURF, BRIEF and ORB on multi-view 3D surface reconstruction of microscopic samples obtained by a scanning electron microscope (SEM), a widely used equipment in biological and materials sciences for determining the surface attributes of micro objects. To this end, we first develop an optimised multi-view framework for SEM extrinsic calibration and its 3D surface reconstruction. We design a Differential Evolutionary-based algorithm to solve the problem in a global optimisation platform. Several qualitative and quantitative comparisons such as reliability on SEM extrinsic calibration and validity on 3D visualisation performed on real microscopic objects as well as a synthetic model. The present evaluation is expected to provide better insights and consideration to determine which algorithm is well deserved for multi-view 3D SEM surface reconstruction.


Journal of Biomechanics | 2017

Merging computational fluid dynamics and 4D Flow MRI using proper orthogonal decomposition and ridge regression

Ali Bakhshinejad; Ahmadreza Baghaie; Alireza Vali; David Saloner; Vitaliy L. Rayz; Roshan M. D’Souza

Time resolved phase-contrast magnetic resonance imaging 4D-PCMR (also called 4D Flow MRI) data while capable of non-invasively measuring blood velocities, can be affected by acquisition noise, flow artifacts, and resolution limits. In this paper, we present a novel method for merging 4D Flow MRI with computational fluid dynamics (CFD) to address these limitations and to reconstruct de-noised, divergence-free high-resolution flow-fields. Proper orthogonal decomposition (POD) is used to construct the orthonormal basis of the local sampling of the space of all possible solutions to the flow equations both at the low-resolution level of the 4D Flow MRI grid and the high-level resolution of the CFD mesh. Low-resolution, de-noised flow is obtained by projecting in vivo 4D Flow MRI data onto the low-resolution basis vectors. Ridge regression is then used to reconstruct high-resolution de-noised divergence-free solution. The effects of 4D Flow MRI grid resolution, and noise levels on the resulting velocity fields are further investigated. A numerical phantom of the flow through a cerebral aneurysm was used to compare the results obtained using the POD method with those obtained with the state-of-the-art de-noising methods. At the 4D Flow MRI grid resolution, the POD method was shown to preserve the small flow structures better than the other methods, while eliminating noise. Furthermore, the method was shown to successfully reconstruct details at the CFD mesh resolution not discernible at the 4D Flow MRI grid resolution. This method will improve the accuracy of the clinically relevant flow-derived parameters, such as pressure gradients and wall shear stresses, computed from in vivo 4D Flow MRI data.

Collaboration


Dive into the Roshan M. D’Souza's collaboration.

Top Co-Authors

Avatar

Ahmadreza Baghaie

University of Wisconsin–Milwaukee

View shared research outputs
Top Co-Authors

Avatar

Zeyun Yu

University of Wisconsin–Milwaukee

View shared research outputs
Top Co-Authors

Avatar

Ali Bakhshinejad

University of Wisconsin–Milwaukee

View shared research outputs
Top Co-Authors

Avatar

Heather A. Owen

University of Wisconsin–Milwaukee

View shared research outputs
Top Co-Authors

Avatar

Ivan Komarov

University of Wisconsin–Milwaukee

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

David Saloner

University of California

View shared research outputs
Top Co-Authors

Avatar

Mojtaba F. Fathi

University of Wisconsin–Milwaukee

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Ali Dashti

University of Wisconsin–Milwaukee

View shared research outputs
Researchain Logo
Decentralizing Knowledge