Borrar filtros
Borrar filtros

how to select a seed point in clustering?

10 visualizaciones (últimos 30 días)
Sreepriya Jeejesh
Sreepriya Jeejesh el 5 de Jun. de 2018
Comentada: Aditya Adhikary el 5 de Jun. de 2018
seed point selection in clustering technique for segmentation.
  2 comentarios
Walter Roberson
Walter Roberson el 5 de Jun. de 2018
Are you asking how you tell a particular clustering routine which seed point to use, or are you asking for advice as to which location you should tell a clustering routine to use?
Sreepriya Jeejesh
Sreepriya Jeejesh el 5 de Jun. de 2018
Editada: Walter Roberson el 5 de Jun. de 2018
i need a code for adaptive clustering.steps is here.could you please help me?
  1. Define seed point Co by calculating the averageintensity of that image.
  2. Define a pixels cluster which the intensities areless than Co
  3. Calculate the average intensity C1 of that cluster.
  4. Iterate the process by returning to step 2 fordefining additional pixels cluster and thencalculating C2.
  5. We repeat above processes until(Ci-1-Ci)<T.where T is a calibrated parameter.
Co,C1,...Ck represent the cluster centers.
The final step is to group image pixels in such a way that pixel is assigned to the nearest cluster center measuring by Euclidian distance of intensity.

Iniciar sesión para comentar.

Respuesta aceptada

Aditya Adhikary
Aditya Adhikary el 5 de Jun. de 2018
Editada: Aditya Adhikary el 5 de Jun. de 2018
For k-means, you can specify the seed using the 'Start' parameter. If you specify a numeric matrix while using this parameter, it can interpret it as the seeds. For more information on how to use this option, read the documentation: kmeans Name-Value pair arguments.
  2 comentarios
Sreepriya Jeejesh
Sreepriya Jeejesh el 5 de Jun. de 2018
i need a code for adaptive clustering.steps is here.could you please help me? 1. Define seed point Co by calculating the average intensity of that image. 2. Define a pixels cluster which the intensities are less than Co 3. Calculate the average intensity C1 of that cluster. 4. Iterate the process by returning to step 2 for defining additional pixels cluster and then calculatingC2. 5. We repeat above processes until(Ci-1-Ci)<T. where T is a calibrated parameter. Co,C1,...Ck represent the cluster centers. The final step is to group image pixels in such a way that pixel is assigned to the nearest cluster center measuring by Euclidian distance of intensity.
Aditya Adhikary
Aditya Adhikary el 5 de Jun. de 2018
You may like to refer to Adaptive k-means clustering for images.

Iniciar sesión para comentar.

Más respuestas (0)

Etiquetas

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by