__/ [ tirzan ] on Monday 27 March 2006 16:31 \__
> Roy Schestowitz wrote:
>
>> You can look up a precise description by searching the Web. In short,
>> histogram bins involve taking the pixels whose values lie within a given
>> range (say 0..255) and then partitioning that range into smaller chunks
>> (bins or 'buckets'). You could, for example, have a bin that contains all
>> pixels whose (grey-level) value is between 1 and 10.
>
> yes! thanks!
>
>> What are "min" and "max"?
>
> the min and the max grey value on the image, we can consider min=0 and
> max=255
> but (maybe) is more convenient to calculate the min and the max
> before...
>
>> This seems okay, but why not use many of the
>> existing implementation, which could be /far/ more efficient?
>
> do you have any link? or any example of a more efficient
> implementation?
>
>> Hope it helps,
>
> sure!
> thanks
>
> tirzan
Have a look at VXL:
http://vxl.sourceforge.net/
It is very extensive and Open Source too.
Hope it helps,
Roy
--
Roy S. Schestowitz | Useless fact: sheep outnumber people in NZ
http://Schestowitz.com | SuSE Linux ¦ PGP-Key: 0x74572E8E
6:15pm up 19 days 8:00, 8 users, load average: 1.36, 0.91, 0.74
http://iuron.com - help build a non-profit search engine
|
|
