Learning-based low-rank Hankel structured matrix approach (Conference Presentation)

Author(s):  
Jong Chul Ye
2019 ◽  
Vol 15 (2) ◽  
pp. 133-140
Author(s):  
Ramesh Bhandari ◽  
Sharad Kumar Ghimire

 Automatically extracting most conspicuous object from an image is useful and important for many computer vision related tasks. Performance of several applications such as object segmentation, image classification based on salient object and content based image editing in computer vision can be improved using this technique. In this research work, performance of structured matrix decomposition with contour based spatial prior is analyzed for extracting salient object from the complex scene. To separate background and salient object, structured matrix decomposition model based on low rank matrix recovery theory is used along with two structural regularizations. Tree structured sparsity inducing regularization is used to capture image structure and to enforce the same object to assign similar saliency values. And, Laplacian regularization is used to enlarge the gap between background part and salient object part. In addition to structured matrix decomposition model, general high level priors along with biologically inspired contour based spatial prior is integrated to improve the performance of saliency related tasks. The performance of the proposed method is evaluated on two demanding datasets, namely, ICOSEG and PASCAL-S for complex scene images. For PASCAL-S dataset precision recall curve of proposed method starts from 0.81 and follows top and right-hand border more than structured matrix decomposition which starts from 0.79. Similarly, structural similarity index score, which is 0.596654 and 0.394864 without using contour based spatial prior and 0.720875 and 0.568001 using contour based spatial prior for ICOSEG and PASCAL-S datasets shows improved result.


2018 ◽  
Vol 7 (4) ◽  
pp. 2309
Author(s):  
Baby Victoria.L ◽  
Sathappan S

Noise removal from the color images is the most significant and challenging task in image processing. Among different conventional filter methods, a robust Annihilating filter-based Low-rank Hankel matrix (r-ALOHA) approach was proposed as an impulse noise removal algorithm that uses the sparse and low-rank decomposition of a Hankel structured matrix to decompose the sparse impulse noise components from an original image. However, in this algorithm, the patch image was considered as it was sparse in the Fourier domain only. It requires an analysis of noise removal performance by considering the other transform domains. Hence in this article, the r-ALOHA can be extended into other transform domains such as log and exponential. In the log and exponential domain, the logarithmic and exponential functions are used for modeling the multiplicative noise model. But, this model is used only for positive outcomes. Therefore, wavelet transform domain is applied to the noise model that localizes an image pixel in both frequency and time domain simultaneously. Moreover, it separates the most vital information in a given image. Thus, it is feasible for obtaining a better approximation of the considered function using few coefficients. Finally, the experimental results show the performance effectiveness of the proposed algorithm.  


2015 ◽  
Author(s):  
Junhong Min ◽  
Lina Carlini ◽  
Michael Unser ◽  
Suliana Manley ◽  
Jong Chul Ye

2019 ◽  
Vol 2019 (11) ◽  
pp. 252-1-252-5
Author(s):  
Hansol Kim ◽  
Paul Oh ◽  
Sangyoon Lee ◽  
Moon Gi Kang

Sign in / Sign up

Export Citation Format

Share Document