Abstract
A clustering and quadratic programming based projection onto convex sets(CQPOCS)algorithm for fast feature point matching is presented in this paper．Via feature point clustering,the problem of matching model point set and taget point set is converted in to the problem of matching corresponding clusters,thus reducing the computational cost．Then,quatratic programming based POCS algorithm is used to solve the cluster matching problem without incurring the successive POCS algorithm’s accumulating deviation due to successive projections onto row convex sets and column convex sets．Simulation results show that our CQPOCS algorithm has satisfactory matching accuracy and computational safety．
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
