A solution to histogram-equalization and other related problems by shortest path methods
作者：
Highlights：
•
摘要
Given a list C =〈c1, c2, ... cN〉, ck = f(xk) ≥ 0 and x1 < x2 < ... xN, the histogram-equalization problem consists of decomposing the list C into M
论文关键词：Shortest path,Histogram equalization,Step-function approximation
论文评审过程：Received 9 January 1997, Accepted 8 May 1997, Available online 7 June 2001.
论文官网地址：https://doi.org/10.1016/S0031-3203(97)00049-6
