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

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

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．