Re: Selective Gaussian -> Early test app posted
- From: "Lord Crc" <lordcrc@xxxxxxxxxxx>
- Date: 18 Jul 2005 19:39:53 -0700
"Mattias Andersson" <mattias@xxxxxxxxxxxxx> wrote:
>Lord Crc wrote:
>>
>> I belive the Selective Gaussian is not separable, because you do not
>> use all pixels when computing it (hence the name of the algorithm :).
>> Since you've lost this, you might aswell allow arbitrary kernels.
[snip]
>Now, consider the following two expressions:
>
> Sum[ y = y1..y2 ] Sum[ x = x1..x2 ] ( p[x, y] a[x, y] exp(-x^2/c)
>exp(-y^2/c) )
>
> <=>
>
> Sum[ y = y1..y2 ] ( exp(-y^2/c) Sum[ x = x1..x2 ] ( p[x, y] a[x, y]
>exp(-x^2/c) ) )
Since a[] changes for each reference pixel, I can't see how you CANNOT perform SOME kind of operation at each pixel within the radius of the reference pixel. The least you have to do is to actually create a[] (ie do the test). If you then sum each horizontal row in the kernel and then sum vertically, you're actually performing more work than in the original.
So no, I still don't see how this helps at all :)
Then again, it's 4:40am :)
- Asbjørn
.
- References:
- Selective Gaussian -> Early test app posted
- From: Eric Grange
- Re: Selective Gaussian -> Early test app posted
- From: Mattias Andersson
- Re: Selective Gaussian -> Early test app posted
- From: Lord Crc
- Re: Selective Gaussian -> Early test app posted
- From: Mattias Andersson
- Selective Gaussian -> Early test app posted
- Prev by Date: MM4 and AllocMemSize
- Next by Date: Re: Fastcode MM - Nexus Validation
- Previous by thread: Re: Selective Gaussian -> Early test app posted
- Next by thread: Re: Selective Gaussian -> Early test app posted
- Index(es):
Relevant Pages
|