Gradient vector flow: Difference between revisions

Revision as of 22:27, 1 April 2020

Revision as of 22:35, 1 April 2020

Line 53:

<math>\mathcal{E}</math> itself (1) can be directly discretized and minimized, for example, by gradient descent. Second, the partial

differential equations in (2) can be discretized and solved iteratively. The original GVF paper used an iterative

approach, while later papers introduced considerably faster implementations such as an octree-based method~\cite{<ref name =":HerxCVIU2004> {{Cite journal | title = Silhouette and stereo fusion for 3D object modeling | journal = Computer Vision and Image Understanding | volume = 96 | issue = 3 | pages = 367-392 | year = 2004 | publisher = Elsevier | first1 = C. H. | last1 = Esteban | first2 = F. | last2 = Schmitt}}</ref>,

a multi-grid method~\cite{HanxIETIP07}, and an augmented Lagrangian method~\cite{RenxPRL12}. In addition, very fast GPU implementations

have been developed in~\cite{SmixJRTIP15, SmixJRTIP16}.