Please use this identifier to cite or link to this item:
|Title:||The use of entropy minimization for the solution of blind source separation problems in image analysis|
|Keywords:||Blind source separation|
|Citation:||Guo, L., Garland, M. (2006-06). The use of entropy minimization for the solution of blind source separation problems in image analysis. Pattern Recognition 39 (6) : 1066-1073. ScholarBank@NUS Repository. https://doi.org/10.1016/j.patcog.2005.09.006|
|Abstract:||Entropy minimization is closely associated with pattern recognition. The present contribution uses a direct minimization of an entropy like function to solve the blind source separation problem for image reconstruction. The mixture patterns are decomposed using SVD and then global stochastic optimization is used to find the first irreducible image pattern. Further images are then subsequently reconstructed, by imposing a 2D correlation coefficient for dissimilarity to prevent repeated images, until all images are exhaustively enumerated. Three test cases are used, including (1) a set of three black and white texturally different photographs (2) a set of three RGB geometrically similar photographs and (3) an underdetermined problem involving an imbedded watermark. Cases 1 and 2 are easily solved with outstanding image quality. Both searches are conducted in an unsupervised manner - no a priori information is used. In Case 3, the watermark is enhanced after targeting the region for entropy minimization. The present results have a wide variety of applications, including image and spectroscopic analysis. © 2005 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.|
|Source Title:||Pattern Recognition|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 20, 2018
WEB OF SCIENCETM
checked on Sep 5, 2018
checked on Jun 29, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.