A solution to histogram-equalization and other related problems by shortest path methods

Given a list C =〈 c 1, c 2, ... c N〉, c k = f( x k ) ≥ 0 and x 1 < x 2 < ... x N, the histogram-equalization problem consists of decomposing the list C into M

Saved in:
Bibliographic Details
Published in:Pattern recognition 1998-03, Vol.31 (3), p.231-234
Main Author: Kundu, Sukhamay
Format: Article
Language:English
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Artificial intelligence
Computer science
control theory
systems
Exact sciences and technology
Histogram equalization
Information retrieval. Graph
Pattern recognition. Digital image processing. Computational geometry
Shortest path
Step-function approximation
Theoretical computing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Given a list C =〈 c 1, c 2, ... c N〉, c k = f( x k ) ≥ 0 and x 1 < x 2 < ... x N, the histogram-equalization problem consists of decomposing the list C into M
ISSN:0031-3203
1873-5142
DOI:10.1016/S0031-3203(97)00049-6