[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: fast hist() / histogram() implementation in C++
From: |
Andy Adler |
Subject: |
Re: fast hist() / histogram() implementation in C++ |
Date: |
Thu, 3 Jun 2004 18:41:21 -0400 (EDT) |
On Fri, 28 May 2004, Petr Mikulik wrote:
>
> I acknowledge the effort in improving hist.m. Is is as fast as M-language
> allows. Unfortunately, using it for large images (e.g. 2D detector data)
> like 512^2 and above goes beyond the user patiency (at least, for me). That
> was my move to reimplement my own favourite histogram.m into histogram.oct.
> ...
> Thus, in average, 50x speedup is achieved for linearly spaced bins,
> and 27x for logarithmically (or whichever non-linearly) spaced bins.
These improvements do appear to be impressive.
I would recommend that you contribute them to octave-forge,
probably in the main/general directory.
Additionally, you can ask jwe if he is prepared to add them to
octave. I suspect that, at minimum, he will ask for a comprehensive
set of tests. There were a few bug reports about the last changes
to hist.m
Andy
-------------------------------------------------------------
Octave is freely available under the terms of the GNU GPL.
Octave's home on the web: http://www.octave.org
How to fund new projects: http://www.octave.org/funding.html
Subscription information: http://www.octave.org/archive.html
-------------------------------------------------------------
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- Re: fast hist() / histogram() implementation in C++,
Andy Adler <=