Velocity Reviews (http://www.velocityreviews.com/forums/index.php)
-   C++ (http://www.velocityreviews.com/forums/f39-c.html)
-   -   Does anybody know a fast algorithm for this? (http://www.velocityreviews.com/forums/t532368-does-anybody-know-a-fast-algorithm-for-this.html)

 Luna Moon 08-25-2007 05:29 AM

Does anybody know a fast algorithm for this?

In a 2D array of double(floating point) numbers,

ideally it should have an ordering on two dimensions:

for left to right, the numbers should increase,

from bottom to up, the numbers should increase,

if in the middle of some row and some column, there are valleys and
peaks, which means that the ordering is violated,

I want to detect these violations and set the peaks or valleys to some
predefined constants, say -1.

my question is:

how to do that efficiently in C/C++, also also Matlab?

Basically, the question is how to detect peaks and valleys which
violate the ordering and set them to an alert number, say -1. This is
like "highlighting" ...

Thanks!

 Gianni Mariani 08-25-2007 05:44 AM

Re: Does anybody know a fast algorithm for this?

Luna Moon wrote:
> In a 2D array of double(floating point) numbers,
>
> ideally it should have an ordering on two dimensions:
>
> for left to right, the numbers should increase,
>
> from bottom to up, the numbers should increase,
>
> if in the middle of some row and some column, there are valleys and
> peaks, which means that the ordering is violated,
>
> I want to detect these violations and set the peaks or valleys to some
> predefined constants, say -1.
>
> my question is:
>
> how to do that efficiently in C/C++, also also Matlab?
>
> Basically, the question is how to detect peaks and valleys which
> violate the ordering and set them to an alert number, say -1. This is
> like "highlighting" ...

Does the 2D array fit into the primary cache ? If it does, then a
brainless for loop for each array will work fine. If however it does
not fit into cache you would benefit greatly if you tiled your algorithm
(i.e. did the analysis in tiles). Doing it in tiles allows you to
multi-thread the code so you can run analysis of multiple tiles
simultaneously.

 Kai-Uwe Bux 08-25-2007 03:54 PM

Re: Does anybody know a fast algorithm for this?

Luna Moon wrote:

> In a 2D array of double(floating point) numbers,
>
> ideally it should have an ordering on two dimensions:
>
> for left to right, the numbers should increase,
>
> from bottom to up, the numbers should increase,
>
> if in the middle of some row and some column, there are valleys and
> peaks, which means that the ordering is violated,
>
> I want to detect these violations and set the peaks or valleys to some
> predefined constants, say -1.
>
> my question is:
>
> how to do that efficiently in C/C++, also also Matlab?

[snip]

I don't think that this is really language dependent.

Note that not a single entry is in violation of the order but a pair of
adjacent (horizontally or vertically) entries (this raises the question,
where you want to put the -1).

The entries form a pattern like this:

x--x--x--x
| | | |
x--x--x--x
| | | |
x--x--x--x

You can assign values to the entries so that there is exactly one violating
edge and you can even make it so that this edge can be anywhere. For this
reasin, just verifying that no violations happen requires inspection of all
horizontal and vertical edges in the pattern. The number of edges is
approximately twice the number of entries in the matrix. Therefore, no
algorithm can have better than linear (in the number of matrix entries)
runtime in the worst case. Thus, I would go with the simple, straight
forward implementation.

Best

Kai-Uwe Bux

 All times are GMT. The time now is 06:32 AM.