Minimizing Loss of Information at Competitive PLIP Algorithms for Image Segmentation with Noisy Back Ground
Authors: not saved
Abstract:
In this paper, two training systems for selecting PLIP parameters have been demonstrated. The first compares the MSE of a high precision result to that of a lower precision approximation in order to minimize loss of information. The second uses EMEE scores to maximize visual appeal and further reduce information loss. It was shown that, in the general case of basic addition, subtraction, or multiplication of any two images, γ, k, and λ = 1026 and β = 2 are effective parameter values. It was also found that, for more specialized cases, it can be effective to use the training systems outlined here for a more application-specific PLIP. Further, the case where different parameter values are used was shown, demonstrating the potential practical application of data hiding.
similar resources
Comparison of algorithms for ultrasound image segmentation without ground truth
Image segmentation is a pre-requisite to medical image analysis. A variety of segmentation algorithms have been proposed, and most are evaluated on a small dataset or based on classification of a single feature. The lack of a gold standard (ground truth) further adds to the discrepancy in these comparisons. This work proposes a new methodology for comparing image segmentation algorithms without...
full textAlgorithms for Image Segmentation
In image analysis, segmentation is the partitioning of a digital image into multiple regions (sets of pixels), according to some homogeneity criterion. The problem of segmentation is a well-studied one in literature and there are a wide variety of approaches that are used. Different approaches are suited to different types of images and the quality of output of a particular algorithm is difficu...
full textInformation-Theoretic Image Reconstruction and Segmentation from Noisy Projections
The minimum message length (MML) principle for inductive inference has been successfully applied to image segmentation where the images are modelled by Markov random fields (MRF). We have extended this work to be capable of simultaneously reconstructing and segmenting images that have been observed only through noisy projections. The noise added to each projection depends on the classes of the ...
full textAn Algorithm for Noisy Image Segmentation
This paper presents a segmentation algorithm for gray-level images and addresses issues related to its performance on noisy images. It formulates an image segmentation problem as a partition of an image into (arbitrarily-shaped) connected regions to minimize the sum of graylevel variations over all partitioned regions, under the constraints that (1) each partitioned region has at least a specif...
full textRobust Method for Noisy Image Segmentation
A major problem in noisy image processing is the effective segmentation of its components. In this paper, we are proposing a K Medoid clustering algorithm for noisy image segmentation, which is able to segment all types of noisy images efficiently. As the presented clustering algorithm selects the centroids randomly hence it is less sensitive , to any type of noise as compare to other clusterin...
full textCompetitive Segmentation: A Struggle for Image Space
In this paper, we propose a competitive image segmentation algorithm. It is a dynamic evolving optimization method, which we call the population algorithm. The method is inspired from nature, where the image segments are a population of entities that struggle for the limited image space and settle territory expansion con icts locally without central authority. Hence, it is a region-based segmen...
full textMy Resources
Journal title
volume 2 issue 5
pages 34- 38
publication date 2013-05-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023