Abstract
Sampling-based image matting is an important basic operator of image processing. The matting results are depended on the quality of sample selection. The sample selection produces a pair of samples for each pixel to detect whether the pixel is in the foreground of an image. Therefore, how to optimize the production is usually modeled as a large-scale optimization problem. In this study, particle swarm optimization is applied to solve the problem because its property of rapid convergence is positive to the real-time demand of image matting. We regard every two dimensions of a particle as a sample pair for a undetermined pixel. The encoding can make image matting more effective when there are relevant pixels in the image. The experimental result indicates that the proposed particle swarm optimization performs better than existing optimization method for image matting.
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.
