Paper
25 February 2005 Computationally efficient histogram extraction for rectangular image regions
Author Affiliations +
Proceedings Volume 5671, Real-Time Imaging IX; (2005) https://doi.org/10.1117/12.588109
Event: Electronic Imaging 2005, 2005, San Jose, California, United States
Abstract
In this contribution, we propose a computationally fast algorithm to compute local feature histograms of an image. existing histogram extraction is done by evaluating the distribution of image features such as color, edge, etc. within a local image windows centered each pixels. This approach is computationally very demanding since it requires evaluation of the feature distributions for every possible local window in the image. We develop an accumulated histogram propagation method that takes advantage of the fact that the local windows are overlaps and their feature histograms are highly correlated. Instead of evaluating the distributions independently, we propagate the distribution information in a 2D sweeping fashion. Our simulations prove that the proposed algorithm significantly accelarates histogram extraction and enables computation of e.g. posterier propabilities and likelihood values, which are frequently used for object detection, and tracking, as well as in other vision applications such as calibration and recognition.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Fatih Porikli "Computationally efficient histogram extraction for rectangular image regions", Proc. SPIE 5671, Real-Time Imaging IX, (25 February 2005); https://doi.org/10.1117/12.588109
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications and 1 patent.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Feature extraction

Detection and tracking algorithms

Image processing

Chemical elements

Computer vision technology

Data conversion

Machine vision

RELATED CONTENT


Back to Top