Conference Paper

Blind Image Extraction by Using Local Smooth Information.

DOI: 10.1109/ICNC.2009.84 Conference: Fifth International Conference on Natural Computation, ICNC 2009, Tianjian, China, 14-16 August 2009, 6 Volumes
Source: DBLP

ABSTRACT This paper proposes a new approach to blind image extraction. By using the property that most of near pixels are smooth, blind image extraction is formulated to a generalized eigen-decomposition problem. The key point of our method is the formulation of matrix pencil. Since the image is two dimensional, the values of a small patch are smooth. Based on this observation, two mixed signals are formulated in columnwise order or in rowwise order respectively. The matrix pencil is constructed by using these two mixed signals. The separation weight vector can be obtained by generalized eigen-decomposition. Compared with the 'Non-Negative ICA' algorithm, the original signals in our algorithm are not required to be well-grounded, which means that they have a non-zero pdf in the region of zeros. In contrast to many second order methods in recent literatures, the two dimensional signals are used. Simulation results on mixed images are employed to further illustrate the advantages of our approach.

0 Bookmarks
 · 
42 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A novel global search algorithm based method is proposed to separate MR images blindly in this paper. The key point of the method is the formulation of the new matrix which forms a generalized permutation of the original mixing matrix. Since the lowest entropy is closely associated with the smooth degree of source images, blind image separation can be formulated to an entropy minimization problem by using the property that most of neighbor pixels are smooth. A new dataset can be obtained by multiplying the mixed matrix by the inverse of the new matrix. Thus, the search technique is used to searching for the lowest entropy values of the new data. Accordingly, the separation weight vector associated with the lowest entropy values can be obtained. Compared with the conventional independent component analysis (ICA), the original signals in the proposed algorithm are not required to be independent. Simulation results on MR images are employed to further show the advantages of the proposed method.
    Computational and Mathematical Methods in Medicine 01/2014; 2014:726712. · 0.79 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper proposes a novel approach to blind image separation. By using the property that the near pixels have close correlation, blind image separation is formulated to diagonalize several difference correlation matrices. Two algorithms are proposed based on generalized eigen-decomposition and a joint approximate diagonaliztion method respectively. The key point of our method is the formulation of difference correlation matrices. Since the mixed images are two dimensional, two mixed signals are formulated in columnwise order or in rowwise order respectively. Based on the close correlation of near pixels, the matrices to be diagonalized are constructed. The separation matrix for the mixed images can be obtained by generalized eigen-decomposition or joint approximate diagonalization. Compared with the 'Non-Negative PCA' algorithm, the original signals in our algorithm are not required to be well-grounded, which means that they have a non-zero pdf in the region of zeros. In contrast to many second order methods in recent literatures, the two dimensional signals are used. Simulation results on mixed images are employed to further illustrate the advantages of our approach.
    01/2009;