新版本对直方图不再使用之前的histogram的形式,而是用统一的Mat或者MatND的格式来存储直方图,可见新版本Mat数据结构的优势。

C++: void calcHist(const Mat* images, int nimages, const int* channels, InputArray mask, OutputArray hist, intdims, const int* histSize, const float** ranges, bool uniform=true, bool accumulate=false )

计算直方图

Parameters:

  • images – Source arrays. They all should have the same depth, CV_8U or CV_32F , and the same size. Each of them can have an arbitrary number of channels.
  • nimages – Number of source images.
  • channels – List of the dims channels used to compute the histogram. The first array channels are numerated from 0 to images[0].channels()-1 , the second array channels are counted fromimages[0].channels() to images[0].channels() + images[1].channels()-1, and so on.
  • mask – Optional mask. If the matrix is not empty, it must be an 8-bit array of the same size asimages[i] . The non-zero mask elements mark the array elements counted in the histogram.
  • hist – Output histogram, which is a dense or sparse dims -dimensional array.
  • dims – Histogram dimensionality that must be positive and not greater than CV_MAX_DIMS (equal to 32 in the current OpenCV version).
  • histSize – Array of histogram sizes in each dimension.
  • ranges – Array of the dims arrays of the histogram bin boundaries in each dimension. When the histogram is uniform ( uniform =true), then for each dimension i it is enough to specify the lower (inclusive) boundary of the 0-th histogram bin and the upper (exclusive) boundary for the last histogram bin histSize[i]-1 . That is, in case of a uniform histogram each ofranges[i] is an array of 2 elements. When the histogram is not uniform ( uniform=false ), then each of ranges[i] contains histSize[i]+1 elements: . The array elements, that are not between and , are not counted in the histogram.
  • uniform – Flag indicating whether the histogram is uniform or not (see above).
  • accumulate – Accumulation flag. If it is set, the histogram is not cleared in the beginning when it is allocated. This feature enables you to compute a single histogram from several sets of arrays, or to update the histogram in time.

void rectangle(Mat& img, Point pt1, Point pt2, const Scalar& color, int thickness=1, int lineType=8, intshift=0)

画矩形

#include "stdafx.h"

#include <cv.h>
#include <highgui.h> using namespace cv; int main( int argc, char** argv )
{
Mat src, hsv; /* if( argc != 2 || !(src=imread(argv[1], 1)).data )
return -1; */ src=imread("zhang.jpg", 1); cvtColor(src, hsv, CV_BGR2HSV); // Quantize the hue to 30 levels
// and the saturation to 32 levels
int hbins = 30, sbins = 32; // bin 步长 int histSize[] = {hbins, sbins};
// hue varies from 0 to 179, see cvtColor
float hranges[] = { 0, 180 };
// saturation varies from 0 (black-gray-white) to
// 255 (pure spectrum color)
float sranges[] = { 0, 256 };
const float* ranges[] = { hranges, sranges };
MatND hist;
// we compute the histogram from the 0-th and 1-st channels
int channels[] = {0, 1}; // --- hue && saturation calcHist( &hsv, 1, channels, Mat(), // do not use mask
hist, 2, histSize, ranges,
true, // the histogram is uniform
false );
double maxVal=0;
minMaxLoc(hist, 0, &maxVal, 0, 0); // Finds the global minimum and maximum in an array.
// void minMaxLoc(InputArray src, double* minVal, double* maxVal=0, Point* minLoc=0, Point* maxLoc=0, InputArray mask=noArray()) // 直方图显示
int scale = 10;
Mat histImg = Mat::zeros(sbins*scale, hbins*10, CV_8UC3); for( int h = 0; h < hbins; h++ )
for( int s = 0; s < sbins; s++ )
{
float binVal = hist.at<float>(h, s);
int intensity = cvRound(binVal*255/maxVal);
rectangle( histImg, Point(h*scale, s*scale),
Point( (h+1)*scale - 1, (s+1)*scale - 1),
Scalar::all(intensity), // 二维直方图,颜色之深浅代表出现个数之多寡
CV_FILLED );
} namedWindow( "Source", 1 );
imshow( "Source", src ); namedWindow( "H-S Histogram", 1 );
imshow( "H-S Histogram", histImg );
waitKey();
}

C++: void equalizeHist(InputArray src, OutputArray dst)

直方图均衡化

Parameters:

  • src – Source 8-bit single channel image.

  • dst – Destination image of the same size and type as src .

The function equalizes the histogram of the input image using the following algorithm:

  1. Calculate the histogram for src .

  2. Normalize the histogram so that the sum of histogram bins is 255.

  3. Compute the integral of the histogram:

  4. Transform the image using as a look-up table:

compareHist

double compareHist(const SparseMat& H1, const SparseMat& H2, int method)

直方图比较

Parameters:

  • H1 – First compared histogram.

  • H2 – Second compared histogram of the same size as H1 .
  • method

    Comparison method that could be one of the following:

    • CV_COMP_CORREL Correlation  相关性 相同为1,范围0<x<=1

    • CV_COMP_CHISQR Chi-Square   卡方 相同为0 [0,inf)
    • CV_COMP_INTERSECT Intersection   直方图交 ,数值越大越相似
    • CV_COMP_BHATTACHARYYA Bhattacharyya distance
    • CV_COMP_HELLINGER Synonym for CV_COMP_BHATTACHARYYA Bhattacharyya 距离,相同为0 [0,inf)

#include "stdafx.h"

#include <cv.h>
#include <highgui.h>
#include "stdio.h" using namespace std;
using namespace cv; int main( int argc, char** argv )
{
Mat src1, src2,dst;
Mat hsv1,hsv2;
MatND hist1,hist2; src1=imread("zhang.jpg", 1);
src2=imread("zhou.jpg",1);
cvtColor(src1,hsv1,CV_RGB2HSV);
cvtColor(src2,hsv2,CV_RGB2HSV); int hbins=30,sbins=32;
int histSize[]={hbins,sbins}; float hranges[]={0,180};
float sranges[]={0,256};
const float* ranges[]={hranges,sranges}; int channels[]={0,1}; calcHist(&hsv1,1,channels,Mat(),hist1,2,histSize,ranges,true,false);
calcHist(&hsv2,1,channels,Mat(),hist2,2,histSize,ranges,true,false); double temp;
temp=compareHist(hist1,hist2,CV_COMP_CORREL);
cout<<"CV_COMP_CORREL "<<temp<<endl; temp=compareHist(hist1,hist2,CV_COMP_CHISQR);
cout<<"CV_COMP_CHISQR "<<temp<<endl; temp=compareHist(hist1,hist2,CV_COMP_INTERSECT);
cout<<"CV_COMP_INTERSECT "<<temp<<endl; temp=compareHist(hist1,hist2,CV_COMP_BHATTACHARYYA);
cout<<"CV_COMP_BHATTACHARYYA "<<temp<<endl; namedWindow("src1");
imshow("src1",src1); namedWindow("src2");
imshow("src2",src2); waitKey(); cvDestroyAllWindows();
return 0;
}

遇到 ~ 编译器错误 C2078

初始值设定项的数目超过了要初始化的对象数。

// C2078.cpp
int main() {
int d[2] = {1, 2, 3}; // C2078
int e[2] = {1, 2}; // OK char a[]={"a", "b"}; // C2078
char *b[]={"a", "b"}; // OK
char c[]={'a', 'b'}; // OK
}
 
 
  • OPENCV(5) —— 图像直方图的更多相关文章

    1. 【图像处理】基于OpenCV实现图像直方图的原理

      背景 图像的直方图是衡量图像像素分布的一种方式,可以通过分析像素分布,使用直方图均衡化对图像进行优化,让图像变的清晰. opencv官方对图像直方图的定义如下: 直方图是图像中像素强度分布的图形表达方 ...

    2. OpenCV(7)-图像直方图

      直方图定义可参考这里.图像的直方图用来表示图像像素的统计信息,它统计了图像每一个通道(如果是多通道)中,每个像素的个数(比例). 计算直方图 OpenCV提供了直接计算直方图的函数 void calc ...

    3. 8、OpenCV Python 图像直方图

      __author__ = "WSX" import cv2 as cv import numpy as np from matplotlib import pyplot as pl ...

    4. opencv:图像直方图均衡化

      // 直方图均衡化 Mat gray, dst; cvtColor(src, gray, COLOR_BGR2GRAY); equalizeHist(gray, dst); imshow(" ...

    5. OpenCV 绘制图像直方图

      OpenCV绘制图像直方图,版本2.4.11 直方图可展示图像中的像素分布,是用以表示数字图像中亮度分布的直方图,标绘了图像中每个亮度值的像素数.可以借助观察该直方图了解需要如何调整亮度分布.这种直方 ...

    6. opencv:图像直方图相似性比较

      void hist_compare(Mat src1, Mat src2) { int histSize[] = { 256, 256, 256 }; int channels[] = { 0, 1, ...

    7. OpenCV成长之路(5):图像直方图的应用

      正如第4篇文章所说的图像直方图在特征提取方面有着很重要的作用,本文将举两个实际工程中非常实用的例子来说明图像直方图的应用. 一.直方图的反向映射. 我们以人脸检测举例,在人脸检测中,我们第一步往往需要 ...

    8. OpenCV成长之路(4):图像直方图

      一.图像直方图的概念 图像直方图是反映一个图像像素分布的统计表,其实横坐标代表了图像像素的种类,可以是灰度的,也可以是彩色的.纵坐标代表了每一种颜色值在图像中的像素总数或者占所有像素个数的百分比. 图 ...

    9. OpenCV成长之路:图像直方图的应用

      OpenCV成长之路:图像直方图的应用 2014-04-11 13:57:03 标签:opencv 图像 直方图 原创作品,允许转载,转载时请务必以超链接形式标明文章 原始出处 .作者信息和本声明.否 ...

    随机推荐

    1. hdoj-5099-Comparison of Android versions

      Comparison of Android versions Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (J ...

    2. 面试题:Student s = new Student();在内存中做了哪些事情?即创建一个对象做了哪些事情

      lStudent s = new Student();在内存中做了哪些事情? •载入Student.class文件进内存(方法区) •在栈内存为s开辟空间 •在堆内存为学生对象开辟空间 •对学生对象的 ...

    3. Android-Universal-Image-Loader 的使用说明

      这个图片异步载入并缓存的类已经被非常多开发人员所使用,是最经常使用的几个开源库之中的一个,主流的应用,随便反编译几个火的项目,都能够见到它的身影. 但是有的人并不知道怎样去使用这库怎样进行配置,网上查 ...

    4. spfile

      1 让ORACLE自己主动从spfile启动  SQL> create spfile='/dev/vx/rdsk/vgora/lv_spfile' from pfile;  SQL> sh ...

    5. POJ 1012 Joseph(打表题)

      题意:约瑟夫环的变形.要求寻找到一个杀人循环节m使后半节的坏人先被所有杀光. 直接链表模拟出结果,再打表即可: 代码:(凝视的是打表码) #include<iostream> #inclu ...

    6. Build.VERSION.SDK_INT >= Build.VERSION_CODES.GINGERBREAD

      Build.VERSION.SDK_INT是系统的版本,Build.VERSION_CODES.GINGERBREAD是版本号. 到VERSION.SDK_INT不禁诧异,这是何物?! 看API的定义 ...

    7. Frame Stacking ZOJ 1083,poj 1128

      Frame Stacking Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 4034   Accepted: 1352 De ...

    8. Java中MySQL事务处理举例

      实例(以sql语句中的insert语句为例) import java.sql.Connection; import java.sql.DriverManager; import java.sql.Pr ...

    9. AngularJs轻松入门(三)MVC架构

      MVC应用程序架构最早于1970年起源于Smalltalk语言,后来在桌面应用程序开发中使用较为广泛,如今在WEB开发中也非常流行.MVC的核心思想是將数据的管理(Model).业务逻辑控制(Cont ...

    10. hdu 2018 - 递推

      dp[i][1..4] 第i年时年龄为1234的牛的数目 */ #include <cstdio> #include <cstring> ; ]; int main(){ me ...