• DocumentCode
    1863098
  • Title

    The path assigned mean shift algorithm: A new fast mean shift implementation for colour image segmentation

  • Author

    Pooransingh, Akash ; Radix, Cathy-Ann ; Kokaram, Anil

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Univ. of the West Indies, St. Augustin, NY
  • fYear
    2008
  • fDate
    12-15 Oct. 2008
  • Firstpage
    597
  • Lastpage
    600
  • Abstract
    This paper presents a novel method for colour image segmentation derived from the mean shift theorem. When applied to colour image segmentation tasks, the path assigned mean shift algorithm performed 1.5 to 5 times faster than existing fast mean shift methods such as the hierarchical ´neighbourhood consistency´ FMS Method proposed by Zhang with comparable results. The complexity of the new PAMS algorithm can be represented as O(Phi2) where Phi represents the total number of unassigned points per iteration of the algorithm.
  • Keywords
    computational complexity; image colour analysis; image segmentation; iterative methods; colour image segmentation; complexity algorithm; hierarchical neighbourhood consistency; iteration method; path assigned mean shift algorithm; two dimensional clustering; Bandwidth; Color; Convergence; Educational institutions; Equations; Flexible manufacturing systems; Image processing; Image segmentation; Kernel; Multidimensional systems; Colour Image Segmentation; Fast Mean Shift; Mean Shift; Path Assigned Mean Shift;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Image Processing, 2008. ICIP 2008. 15th IEEE International Conference on
  • Conference_Location
    San Diego, CA
  • ISSN
    1522-4880
  • Print_ISBN
    978-1-4244-1765-0
  • Electronic_ISBN
    1522-4880
  • Type

    conf

  • DOI
    10.1109/ICIP.2008.4711825
  • Filename
    4711825