C语言实现直方图统计和直方图均衡化

C语言实现直方图统计

#include <stdio.h>

void DrawHistogram(int nArray[], int nCount, char ch) {

    for (int i = 0; i < nCount; i++) {
        for (int j = 0; j < nArray[i]; j++)
            printf("%c", ch);
        printf(" %d\n", nArray[i]);
    }
    printf("\n");
}

void CountRangeItems(int dArray[], int nDataItems, int nArray[]) {
    for (int i = 0; i < nDataItems; i++) {
        if (dArray[i] <= 160) nArray[0]++;
        else if (dArray[i] < 165) nArray[1]++;
        else if (dArray[i] < 170) nArray[2]++;
        else if (dArray[i] < 175) nArray[3]++;
        else if (dArray[i] > 175) nArray[4]++;
    }
}

int main() {
    int height[] = { 185, 176, 165, 169, 160, 152, 173, 196, 178, 169, 166, 182, 181, 171, 159, 163, 168 };
    int nArray[5] = { 0 };
    int nCount = 5, size = sizeof(height) / sizeof(height[0]);
    CountRangeItems(height, size, nArray);
    DrawHistogram(nArray, nCount, '*');
    getchar();
    return 0;
}

C语言实现直方图均衡化

#include <stdio.h>

void DrawHistogram(int nArray[], int nCount, char ch) {

    for (int i = 0; i < nCount; i++) {
        for (int j = 0; j < nArray[i]; j++)
            printf("%c", ch);
        printf(" %d\n", nArray[i]);
    }
    printf("\n");
}

void CountRangeItems(int dArray[], int nDataItems, int nArray[]) {
    for (int i = 0; i < nDataItems; i++) {
        if (dArray[i] <= 160) nArray[0]++;
        else if (dArray[i] < 165) nArray[1]++;
        else if (dArray[i] < 170) nArray[2]++;
        else if (dArray[i] < 175) nArray[3]++;
        else if (dArray[i] > 175) nArray[4]++;
    }
}

int main() {
    int height[] = { 158, 176, 165, 159, 160, 182, 173, 159, 178, 169, 166, 182, 179, 171, 159, 166, 157, 176, 171, 159 };
    int nArray[5] = { 0 };
    int nCount = 5, size = sizeof(height) / sizeof(height[0]);
    CountRangeItems(height, size, nArray);
    DrawHistogram(nArray, nCount, '*');
    printf("\n");

    //直方图归一化
    float histPDF[] = { 0 };
    printf("直方图归一化:\n");
    for (int i = 0; i < nCount; i++)
    {
        histPDF[i] = float(nArray[i])/20.0;
        //printf(" (%d) ", nArray[i]);
        printf("%.2f ", histPDF[i]);
    }

    //累积直方图
    printf("\n累积直方图:\n");
    float histCDF[] = { 0 };
    for (int i = 0; i < nCount; i++)
    {
        if (0 == i)
            histCDF[i] = histPDF[i];
        else 
            histCDF[i] = histCDF[i - 1] + histPDF[i];
        printf("%.2f ",histCDF[i]);

    }
    //直方图均衡化,映射
    printf("\n直方图均衡化:\n");
    int histEQU[] = {0};
    for (int i = 0; i < nCount; i++)
    {
        histEQU[i] = (int)(5.0 * histCDF[i] + 0.5);
        printf("%d ",histEQU[i]);
    }
    getchar();
    return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值