39 research outputs found

    Performance Comparison of Total Variation based Image Regularization Algorithms

    Get PDF
    The mathematical approach calculus of variation is commonly used to find an unknown function that minimizes or maximizes the functional. Retrieving the original image from the degraded one, such problems are called inverse problems. The most basic example for inverse problem is image denoising. Variational methods are formulated as optimization problems and provides a good solution to image denoising. Three such variational methods Tikhonov model, ROF model and Total Variation-L1 model for image denoising are studied and implemented. Performance of these variational algorithms are analyzed for different values of regularization parameter. It is found that small value of regularization parameter causes better noise removal whereas large value of regularization parameter preserves well sharp edges. The Euler’s Lagrangian equation corresponding to an energy functional used in variational methods is solved using gradient descent method and the resulting partial differential equation is solved using Euler’s forward finite difference method. The quality metrics are computed and the results are compared in this paper.

    Application of Least Square Denoising to Improve ADMM Based Hyperspectral Image Classification

    Get PDF
    AbstractHyperspectral images contain a huge amount of spatial and spectral information so that, almost any type of Earth feature can be discriminated from any other feature. But, for this classification to be possible, it is to be ensured that there is as less noise as possible in the captured data. Unfortunately, noise is unavoidable in nature and most hyperspectral images need denoising before they can be processed for classification work. In this paper, we are presenting a new approach for denoising hyperspectral images based on Least Square Regularization. Then, the hyperspectral data is classified using Basis Pursuit classifier, a constrained L1 minimization problem. To improve the time requirement for classification, Alternating Direction Method of Multipliers (ADMM) solver is used instead of CVX (convex optimization) solver. The method proposed is compared with other existing denoising methods such as Legendre-Fenchel (LF), Wavelet thresholding and Total Variation (TV). It is observed that the proposed Least Square (LS) denoising method improves classification accuracy much better than other existing denoising techniques. Even with fewer training sets, the proposed denoising technique yields better classification accuracy, thus proving least square denoising to be a powerful denoising technique

    Remotely Sensed Image Inpainting With MNLTV Model

    Get PDF
    Image processing is an significant component of modern technologies as it provides the perfection in pictorial information for human interpretation and processing of image data for storage, transmission and representation. In remotely sensed images because of poor atmospheric condition and sensor malfunction (Instrument error such as SLC-OFF failure on may13,2003 the scan line corrector (SLC)of LANDSAT7 Enhanced Thematic Mapper Plus(ETM+)sensor failed permanently causing around 20% of pixel not scanned which become called dead pixels)there is usually great deal of missing information which reduce utilization rate. Remotely sensed images often suffer from strip noise ,random dead pixels. The techniques to recover good image from contaminated one are called image destriping for strips and image inpainting for dead pixels, therefore reconstruction of filling dead pixels and removing uninteresting object is an important issue in remotely sensed images. In past decades ,missing information reconstruction of remote sensing data has become an active research field and large number of algorithms have been developed. This paper presented to solve image destriping , image inpainting and removal of uninteresting object based on multichannel nonlocal total variation. In this algorithm we consider nonlocal method which has superior performance in dealing with textured images.To optimize variation model a Bregmanized-operator-splitting algorithm is employed. Furthermore proposed inpainting algorithm is used for text removal, scratch removal ,pepper and salt noise removal ,object removal etc. The proposed inpainting algorithm was tested on simulated data

    Learning a Dilated Residual Network for SAR Image Despeckling

    Full text link
    In this paper, to break the limit of the traditional linear models for synthetic aperture radar (SAR) image despeckling, we propose a novel deep learning approach by learning a non-linear end-to-end mapping between the noisy and clean SAR images with a dilated residual network (SAR-DRN). SAR-DRN is based on dilated convolutions, which can both enlarge the receptive field and maintain the filter size and layer depth with a lightweight structure. In addition, skip connections and residual learning strategy are added to the despeckling model to maintain the image details and reduce the vanishing gradient problem. Compared with the traditional despeckling methods, the proposed method shows superior performance over the state-of-the-art methods on both quantitative and visual assessments, especially for strong speckle noise.Comment: 18 pages, 13 figures, 7 table

    Denoising of Hyperspectral Images Using Group Low-Rank Representation

    Get PDF
    Hyperspectral images (HSIs) have been used in a wide range of fields, such as agriculture, food safety, mineralogy and environment monitoring, but being corrupted by various kinds of noise limits its efficacy. Low-rank representation (LRR) has proved its effectiveness in the denoising of HSIs. However, it just employs local information for denoising, which results in ineffectiveness when local noise is heavy. In this paper, we propose an approach of group low-rank representation (GLRR) for the HSI denoising. In our GLRR, a corrupted HSI is divided into overlapping patches, the similar patches are combined into a group, and the group is reconstructed as a whole using LRR. The proposed method enables the exploitation of both the local similarity within a patch and the nonlocal similarity across the patches in a group simultaneously. The additional nonlocallysimilar patches can bring in extra structural information to the corrupted patches, facilitating the detection of noise as outliers. LRR is applied to the group of patches, as the uncorrupted patches enjoy intrinsic low-rank structure. The effectiveness of the proposed GLRR method is demonstrated qualitatively and quantitatively by using both simulated and real-world data in experiments
    corecore