CORRESPONDENCE PROBLEM AND TRANSFORMATION FUNCTION ARE THE MAIN CHALLENGES IN REGISTRATION SO WE TRY TO SOLVE THESE PROBLEMS CONCURRENTLY TO ACHIEVE REASONABLE AND OPTIMUM RESULTS. WE EMPLOY NON-RIGID REGISTRATION AS A NON-RIGID POINT MATCHING PROBLEM. WE HAVE ALSO USED THE TPS–RPM ALGORITHM. IN ADDITION THE BINARY CORRESPONDENCE IMPROVED TO FUZZY CORRESPONDENCE THROUGH THE MEANING OF SOFT-ASSIGN AND DETERMINISTIC ANNEALING.TPS-RPM IS APPLIED ON MS LESION IN MRI IMAGES WHICH ACHIEVED CONSECUTIVE WEEKS TO FOLLOW UP THE FLUCTUATION.WE COMPARE THE ITERATED CLOSEST POINT ICP’S RESULT TO TPSRPM IN ORDER TO DEMONSTRATE THE POWER OF THE TPS-RPM. OUR COMPARISON IS DONE BY EVALUATED METRICS SUCH AS DICE SIMILARITY MEASURE AND ACCURACY OBTAINED 0.87 AND 0.88 IN ICP, RESPECTIVELY. FOR TPS-RPM THE DICE SIMILARITY MEASURE AND ACCURACY ARE 0.9 AND 0.89, RESPECTIVELY.