You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@commons.apache.org by "Thomas Neidhart (JIRA)" <ji...@apache.org> on 2015/12/28 21:10:49 UTC

[jira] [Updated] (MATH-1171) clustering implementations have unnecessary overhead

     [ https://issues.apache.org/jira/browse/MATH-1171?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Thomas Neidhart updated MATH-1171:
----------------------------------
    Attachment: image_clustering_example.png

Attached a screenshot of the image clustering example.

> clustering implementations have unnecessary overhead
> ----------------------------------------------------
>
>                 Key: MATH-1171
>                 URL: https://issues.apache.org/jira/browse/MATH-1171
>             Project: Commons Math
>          Issue Type: Bug
>            Reporter: Mark
>         Attachments: image_clustering_example.png
>
>
> I want to apply clustering algorithms like KMeansPlusPlusClusterer to pictures. And creating a point instance for each pixel is not a good idea.
> Therefore the interface should not be based on Collections, but on some interface that provides sort of "get(index)" accessors to data that is potentially stored in a pixel array etc.



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)