Samuel Leventhal's repositories
Classifications-Of-Songs-via-Homology-of-Chroma-Features
Homological features are identified through persistent homology of song chroma features whose persistence diagrams serve as a signature for song clustering. Clustering algorithms emplyeed are k-Means and k-Median.
neural-net-path-tracer
conditional generative advisarial network trained on rendered images and conditional image buffers to automate path traced images and global illumination using vtk-m and pytorch
Convolutional_Neural_Net_Lymphoma
Deep, dense convolutional neural net to discern between different Lymphoma types (Burkitt and Diffuse Large B-Cell) from images of patient tissue samples.
UnSupUnetMSCSegmentation
unsupervised u-neural net using morse smale complex topological segmentation at various persistences to learn segmentation of optic vessel images. Contribution is the lack of needed hand segmentation used in the original Unet paper by Ronneberger et. al. via topological training set.
Artificial-Intelligence-Berkeley-CS188
Learned about search problems (A*, CSP, minimax), reinforcement learning, bayes nets, hidden markov models, and machine learning
Convolutional-Nueral-Net-For-3D-Protein-Renderings
Classifies images of proteins by family taken from 3D models via a convolutional nueral net to encode images into a feature vector used as input by a long short term memory nueral net.
examples
A set of examples around pytorch in Vision, Text, Reinforcement Learning, etc.
Markov-Chain-Based-File-Replicator
An implemented a Nondeterministic Finite Automaton to replicate various literary works where our program output is based on stochastic production laws designed according to chain frequencies within any given text file. For the purpose of example our production schematic is used to produce replicas of such stories as To Kill a Mockingbird and multiple Shakespearean plays. The purpose of this write up is then to demonstrate how this automaton was implemented, what possible alterations can be made to achieve other simple computational models, and the possible advantages/disadvantages they may provide in trying to replicate human writing. More specifically it is shown that our Nondeterministic Finite Automaton, based on Markov chain production rules can be interpreted as a context free grammar and can be easily altered into a Context Sensitive Grammar for various applications or improvement in certain areas.
NeuralMT
FBK Neural Machine Translation Toolkit with instance-based adaptation
PAVE_ISAV
Journal Submission for PAVE project at ORNL with Mark Kim and Dave Pugmire
signedDistanceField_2D_Images
Computes the signed distance field over a 2D image using the Gaussian mean of the first channel as the isovalue.