50 likes | 145 Views
UCF REU Week 8. Lam Tran. Deepest Descent and Jensen’s . Current Approach. Pick gradient surface with the smallest distance in E uclidean space. New Approach. Cluster Similar Gradient Surfaces Jensen’s approximation cost function with EM algorithms. New Approach II.
E N D
UCF REU Week 8 Lam Tran
Current Approach • Pick gradient surface with the smallest distance in Euclidean space.
New Approach • Cluster Similar Gradient Surfaces • Jensen’s approximation cost function with EM algorithms.
New Approach II Get gradient surfaces for each pixel on penny (done) Cluster gradient surfaces with Expectation-Maximization (EM) for each pixel (done) Upper bound cost with Jensen’s Inequality (in progress)