8000
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Q_MU is the arithmetic mean of the pixel intensities in I. Assuming n by m pixels, this will be
Q_MU = 1/(m*n) \sum_i=1^n\sum_j=1^m I_i,j
Q_MBB is the mean of all regions V in I. Assuming that n and m are both divisible by 32, we get
Q_MBB = 1/(m/32n/32) \sum_a=1^n/32\sum_b=1^m/32 1/(3232) \sum_i=1^32\sum_j=1^32 I_(a-1)*32+i,(b-1)*32+j
which will give the exact same result.
In case n or m are not evenly divisible by 32, we would still get very similar results.
So I'm not sure how much sense it makes to keep both.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Q_MU is the arithmetic mean of the pixel intensities in I. Assuming n by m pixels, this will be
Q_MU = 1/(m*n) \sum_i=1^n\sum_j=1^m I_i,j
Q_MBB is the mean of all regions V in I. Assuming that n and m are both divisible by 32, we get
Q_MBB = 1/(m/32n/32) \sum_a=1^n/32\sum_b=1^m/32 1/(3232) \sum_i=1^32\sum_j=1^32 I_(a-1)*32+i,(b-1)*32+j
which will give the exact same result.
In case n or m are not evenly divisible by 32, we would still get very similar results.
So I'm not sure how much sense it makes to keep both.
The text was updated successfully, but these errors were encountered: