yujanshrestha
commented
6 years ago Map step: For a given tetrahedra calculate a cost and gradient per vertex. Reduce step: Combine above with simple addition
Closed yujanshrestha closed 6 years ago
yujanshrestha
commented
6 years ago Map step: For a given tetrahedra calculate a cost and gradient per vertex. Reduce step: Combine above with simple addition
Given an image and priors calculate the mutual information cost and gradient. Use numpy's histogram instead of rolling our own.
Return a cost (single float) as well as a gradient (vector of size N x 3 where N is the number of nodes in the mesh and 3 is dx, dy, and dz for each node.