Haar-like feature和Haar wavelet
Haar-like features are digital image features used in object recognition. They owe their name to their intuitive similarity with Haar wavelets and were used in the first real-time face detector.[1]
Historically, working with only image intensities (i.e., the RGB pixel values at each and every pixel of image) made the task of feature calculation computationally expensive. A publication by Papageorgiou et al.[2] discussed working with an alternate feature set based on Haar wavelets instead of the usual image intensities. Viola and Jones[1] adapted the idea of using Haar wavelets and developed the so-called Haar-like features. A Haar-like feature considers adjacent rectangular regions at a specific location in a detection window, sums up the pixel intensities in each region and calculates the difference between these sums. This difference is then used to categorize subsections of an image. For example, let us say we have an image database with human faces. It is a common observation that among all faces the region of the eyes is darker than the region of the cheeks. Therefore a common Haar feature for face detection is a set of two adjacent rectangles that lie above the eye and the cheek region. The position of these rectangles is defined relative to a detection window that acts like a bounding box to the target object (the face in this case).
In the detection phase of the Viola–Jones object detection framework, a window of the target size is moved over the input image, and for each subsection of the image the Haar-like feature is calculated. This difference is then compared to a learned threshold that separates non-objects from objects. Because such a Haar-like feature is only a weak learner or classifier (its detection quality is slightly better than random guessing) a large number of Haar-like features are necessary to describe an object with sufficient accuracy. In the Viola–Jones object detection framework, the Haar-like features are therefore organized in something called a classifier cascade to form a strong learner or classifier.
The key advantage of a Haar-like feature over most other features is its calculation speed. Due to the use of integral images, a Haar-like feature of any size can be calculated in constant time (approximately 60 microprocessor instructions for a 2-rectangle feature).
最新文章
- DbContext 和ObjectContext两者的区别
- centos6配置网卡
- WPF 图片显示中的保留字符问题
- 贝叶斯决策_bayes（新闻分类）
- lighttpd的超时参数详解
- Machine Learning Done Wrong
- [Python shelve模块Error]bsddb.db.DBPageNotFoundError: (-30986, 'DB_PAGE_NOTFOUND: Requested page not found')
- ip地址0.0.0.0与127.0.0.1的区别（转载）
- ubuntu 添加右键打开方式，无法添加程序打开方式
- linux利用命令重置大量密码
- innerHTML，outerHTML，innerText，outerText
- 洛谷P2845-Switching on the Lights 开关灯
- Light OJ 1148
- SIP消息
- Android APK反编译（一）
- 堆排序——HeapSort
- MySQL5.7在JSON解析后丢失小数部分的Bug
- [hihoCoder] #1089 : 最短路径·二：Floyd算法
- 正则表达式—RegEx(RegularExpressio)（三）
- Django框架【基础篇】