Abstract
In this paper, a novel block matching algorithm SPSO based on hybrid simplex method (SM) and particle swarm optimization (PSO) is proposed, which combines the high accurate local search ability of SM and the powerful global search ability of PSO. To reduce computational complexity and improve the performance of block matching algorithm, the selection of initial habitats based on fixed points and random points, the early termination and the SM searching after finishing each iterating of PSO are used. Experimental results verify that the SPSO algorithm can achieve better PSNR value than conventional block matching algorithms TSS and DS with little sacrifice of time consumption, especially for violent motion.
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.
