完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | CHANG, PR | en_US |
dc.contributor.author | HSIEH, TH | en_US |
dc.date.accessioned | 2014-12-08T15:03:34Z | - |
dc.date.available | 2014-12-08T15:03:34Z | - |
dc.date.issued | 1995-01-01 | en_US |
dc.identifier.issn | 1057-7149 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1109/83.350812 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/2116 | - |
dc.description.abstract | The process of separating a color signal into illumination and surface reflectance components is a fundamental issue in color reproduction and constancy. This color-signal separation can be carried out by minimizing the error in the least squares fit of the product of the illumination and the surface spectral reflectance to the actual color signal. Moreover, when taking in account the physical realizability constraints on both the surface reflectance and illumination, the feasible solutions to the nonlinear least-squares problem should satisfy a number of linear inequalities. Four distinct novel optimization algorithms are presented to employ these constraints to minimize the nonlinear least squares fitting error. The first approach, which is based on Ritter's superlinear convergent method, provides a computationally superior algorithm to find the minimum solution to the nonlinear least-squares error problem subject to linear inequality constraints. Unfortunately, this gradient-like algorithm may sometimes be trapped at a local minimum or become unstable when the parameters involved in the algorithm are not tuned properly. The remaining three methods are based on the stable and promising global minimizer called simulated annealing. The annealing algorithm can always find the global minimum solution with probability one, but its convergence is extremely slow. To tackle this difficulty, a cost-effective variable-separable formulation based on the concept of Golub and Pereyra is adopted to reduce the nonlinear least-squares problem to be a small-scale nonlinear least-squares problem whose solution state space is less than that of the original space. It will be shown that the computational burden is reduced by an order of magnitude. The computational efficiency can be further improved when the original Boltzman generating distribution of the classical annealing is replaced by the Cauchy distribution. Finally, a number of test samples are conducted to verify the effectiveness of the proposed methods. | en_US |
dc.language.iso | en_US | en_US |
dc.title | CONSTRAINED NONLINEAR OPTIMIZATION APPROACHES TO COLOR-SIGNAL SEPARATION | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1109/83.350812 | en_US |
dc.identifier.journal | IEEE TRANSACTIONS ON IMAGE PROCESSING | en_US |
dc.citation.volume | 4 | en_US |
dc.citation.issue | 1 | en_US |
dc.citation.spage | 81 | en_US |
dc.citation.epage | 94 | en_US |
dc.contributor.department | 交大名義發表 | zh_TW |
dc.contributor.department | 電信工程研究所 | zh_TW |
dc.contributor.department | National Chiao Tung University | en_US |
dc.contributor.department | Institute of Communications Engineering | en_US |
dc.identifier.wosnumber | WOS:A1995QA48700007 | - |
dc.citation.woscount | 16 | - |
顯示於類別: | 期刊論文 |