Efficient Color Image Segmentation Algorithm with Two-Layer Pyramid Structure
DESCRIPTION
This paper presents a fast algorithm for color image segmentation by combining K-means and a two-layer pyramid structure, reducing computation time. The improved K-means with integer lookup tables enhances efficiency, guiding clustering in different resolution layers. Experimental results demonstrate the proposed algorithm's significant speed advantage over the original K-means.
1 / 23
Télécharger la présentation
Efficient Color Image Segmentation Algorithm with Two-Layer Pyramid Structure
An Image/Link below is provided (as is) to download presentation
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.
Content is provided to you AS IS for your information and personal use only.
Download presentation by click this link.
While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
During download, if you can't get a presentation, the file might be deleted by the publisher.
E N D
Presentation Transcript
More Related
Audio
Live Player