Oded Green

Oded Green

Auto-generated profile, based on publicly available information

Oded Green

NVIDIA Corp., Santa Clara, California, United States United States

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 December 2017 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
OGOded Green
Oded Green
Median filtering is a smoothing technique for noise removal in images. While there are various implementations of median filtering for a single-core CPU, there are few implementations for accelerators and multi-core systems. Many parallel implementations of median filtering use a sorting algorithm for rearranging the values within a filtering window and taking the median of the sorted value. While using sorting algorithms allows for simple parallel implementations, the cost of the sorting becomes prohibitive as the filtering windows grows. This makes such algorithms, sequential and parallel alike, inefficient. In this work we introduce the first software parallel median filtering that is non-sorting based. The new algorithm uses efficient histogram based operations. These reduce the computational requirements of the new algorithm while also accessing the image fewer times. We show an implementation of our algorithm for both the CPU and NVIDIA’s CUDA supported GPU. The new algorithm is compared with several other leading CPU and GPU implementations. The CPU implementation has near perfect linear scaling with a 3.7X speedup on a quad-core system. Our GPU implementation is several orders of magnitude faster than the other GPU implementations for mid-size median filters. For small kernels, 3 × 3 and 5 × 5, comparison based approaches are preferable as fewer operations are required. Lastly, the new algorithm is open-source and can be found in the OpenCV library.

7 July 2022 in ACM Journal of Experimental Algorithmics
Verified
Journal Article
Open access
AGAlexander van der Grinten
Alexander van der Grinten
EBElisabetta Bergamini
Elisabetta Bergamini
OGOded Green
Oded Green
David BaderDavid Bader
David Bader
HMHenning Meyerhenke
Henning Meyerhenke
Network analysis defines a number of centrality measures to identify the most central nodes in a network. Fast computation of those measures is a major challenge in algorithmic network analysis. Aside from closeness and betweenness, Katz centrality is one of the established centrality measures. In this article, we consider the problem of computing rankings for Katz centrality. In particular, we propose upper and lower bounds on the Katz score of a given node. Previous approaches relied on numerical approximation or heuristics to compute Katz centrality rankings; however, we construct an algorithm that iteratively improves those upper and lower bounds until a correct Katz ranking is obtained. We extend our algorithm to dynamic graphs while maintaining its correctness guarantees. Experiments demonstrate that our static graph algorithm outperforms both numerical approaches and heuristics with speedups between \( 1.5\times \) and \( 3.5\times \) , depending on the desired quality guarantees. Our dynamic graph algorithm improves upon the static algorithm for update batches of less than 10,000 edges. We provide efficient parallel CPU and GPU implementations of our algorithms that enable near real-time Katz centrality computation for graphs with hundreds of millions of edges in fractions of seconds.

15 November 2025
Verified
Conference Paper
Open access
OGOded Green
Oded Green
JEJoe Eaton
Joe Eaton
ATAlok Tripathy
Alok Tripathy
CNCorey Nolet
Corey Nolet
JLJustin Luitjens
Justin Luitjens

29 April 2026 in bioRxiv
Verified
Preprint
Open access
PDF file
MSMohammadali Serajian
Mohammadali Serajian
MLMahsa Lotfollahi
Mahsa Lotfollahi
OGOded Green
Oded Green
KSKaleb Smith
Kaleb Smith
SMSimone Marini
Simone Marini
CBChristina Boucher
Christina Boucher
Multidrug-resistant and extensively drug-resistant Mycobacterium tuberculosis (MTB) represents a growing global health crisis, characterized by limited treatment options and high mortality rates. Rapid and accurate prediction of resistance profiles is critical to guide effective therapy and curb transmission. Whole-genome sequencing (WGS) offers promise for individualized resistance profiling, yet existing computational tools remain constrained by predefined mutation catalogs and prohibitive resource requirements for large-scale analyses. Here, we present AURA, a GPU-accelerated, pangenome-scale machine learning framework for de novo resistance prediction. Trained on 12,185 globally diverse MTB isolates, AURA predicts resistance to 13 first-line, second-line, and repurposed antibiotics with high precision and identifies 59 novel resistance-associated loci, including variants in katG, pncA, rpoC , and members of the PE/PGRS gene family. By enabling model training on an unprecedented genomic scale, AURA provides new insights into the genetic architecture of resistance and establishes a scalable platform for precision-guided therapy and global surveillance of MTB.


1 November 2019
Verified
Conference Paper
Open access
PSPiyush Sao
Piyush Sao
CEChristian Engelmann
Christian Engelmann
SESrinivas Eswar
Srinivas Eswar
OGOded Green
Oded Green
RVRichard Vuduc
Richard Vuduc
For the problem of computing the connected components of a graph, this paper considers the design of algorithms that are resilient to transient hardware faults, like bit flips. More specifically, it applies the technique of \emph{self-stabilization}. A system is self-stabilizing if, when starting from a valid or invalid state, it is guaranteed to reach a valid state after a finite number of steps. Therefore on a machine subject to a transient fault, a self-stabilizing algorithm could recover if that fault caused the system to enter an invalid state. We give a comprehensive analysis of the valid and invalid states during label propagation and derive algorithms to verify and correct the invalid state. The self-stabilizing label-propagation algorithm performs $\bigo{V \log V}$ additional computation and requires $\bigo{V}$ additional storage over its conventional counterpart (and, as such, does not increase asymptotic complexity over conventional \labelprop). When run against a battery of simulated fault injection tests, the self-stabilizing label propagation algorithm exhibits more resilient behavior than a triple modular redundancy (TMR) based fault-tolerant algorithm in $80\%$ of cases. From a performance perspective, it also outperforms TMR as it requires fewer iterations in total. Beyond the fault-tolerance properties of self-stabilizing label-propagation, we believe, they are useful from the theoretical perspective; and may have other use-cases.