II.D. Registration Procedure

JC Junyu Chen
YL Ye Li
YD Yong Du
EF Eric C. Frey
ask Ask a question
Favorite

The overall algorithm for the proposed method is shown in Algorithm. 1. In the beginning, we initialized an untrained ConvNet (fθ) for a given pair of moving and fixed images, Im and If. First, the untrained fθ produces an initial deformation field, ϕ. Second, we deform the moving image with ϕ (i.e., Imϕ). Then, the registration loss is computed as:

where ℒsim represents the similarity measure between Id and If, ℛ represents the value of the regularizer applied to the deformation field, and λ is a user-defined weighting parameter to control the effectiveness of ℛ. The loss is back-propagated to update the parameters in fθ. The above procedure is repeated for a pre-specified number of iterations.

Since no information other than the given image pair is needed, the proposed method requires no prior training and is thus fully and truly unsupervised. The ConvNet is capable of learning an ”optimal” deformation from a single pair of images. In the next section, we discuss a series of experiments that were performed to study the effectiveness of the proposed method.

Do you have any questions about this protocol?

Post your question to gather feedback from the community. We will also invite the authors of this article to respond.

post Post a Question
0 Q&A