Description: This paper presents a quadratic programming based cluster correspondence projection (QPCCP) algorithm, where the optimal correspondences are searched via gradient descent and the constraints on the correspondence are satis-fied by projection onto appropriate convex set
To Search:
File list (Check if you may need any files):
QPCCP
QPCCP.pdf
.....\cluster_fun.m
.....\cluster_fun_N.m
.....\demodata_ex2.mat
.....\demodata_ex3.mat
.....\demodata_ex4.mat
.....\demodata_ex5.mat
.....\generate_point_set.m
.....\gradient_CQPOCS_main.m
.....\plot_intermediate.m
.....\Quad_Clust_POCS_fun.m
.....\README.txt
.....\TPS_transform.m
Download