Automated glaucoma diagnosis using bit-plane slicing and local binary pattern techniques

2019 ◽  
Vol 105 ◽  
pp. 72-80 ◽  
Author(s):  
Shishir Maheshwari ◽  
Vivek Kanhangad ◽  
Ram Bilas Pachori ◽  
Sulatha V. Bhandary ◽  
U. Rajendra Acharya
PLoS ONE ◽  
2021 ◽  
Vol 16 (1) ◽  
pp. e0244691
Author(s):  
WAQAR ISHAQ ◽  
ELIYA BUYUKKAYA ◽  
MUSHTAQ ALI ◽  
ZAKIR KHAN

The vertical collaborative clustering aims to unravel the hidden structure of data (similarity) among different sites, which will help data owners to make a smart decision without sharing actual data. For example, various hospitals located in different regions want to investigate the structure of common disease among people of different populations to identify latent causes without sharing actual data with other hospitals. Similarly, a chain of regional educational institutions wants to evaluate their students’ performance belonging to different regions based on common latent constructs. The available methods used for finding hidden structures are complicated and biased to perform collaboration in measuring similarity among multiple sites. This study proposes vertical collaborative clustering using a bit plane slicing approach (VCC-BPS), which is simple and unique with improved accuracy, manages collaboration among various data sites. The VCC-BPS transforms data from input space to code space, capturing maximum similarity locally and collaboratively at a particular bit plane. The findings of this study highlight the significance of those particular bits which fit the model in correctly classifying class labels locally and collaboratively. Thenceforth, the data owner appraises local and collaborative results to reach a better decision. The VCC-BPS is validated by Geyser, Skin and Iris datasets and its results are compared with the composite dataset. It is found that the VCC-BPS outperforms existing solutions with improved accuracy in term of purity and Davies-Boulding index to manage collaboration among different data sites. It also performs data compression by representing a large number of observations with a small number of data symbols.


2016 ◽  
Vol 9 (2) ◽  
pp. 23 ◽  
Author(s):  
Sofyan M. A. Hayajneh ◽  
AbdulRahman Rashad ◽  
Omar A. Saraereh ◽  
Obaida Al hazaimeh

The objective of this paper is to introduce a fully computerized, simple and low-computational cost technique that can be used in the preprocessing stages of digital images. This technique is specially designed to detect the principal (largest) closed shape object that embody the useful information in certain image types and neglect and avoid other noisy objects and artifacts. The detection process starts by calculating certain statistics of the image to estimate the amount of bit-plane slicing required to exclude the non-informative and noisy background. A simple closing morphological operation is then applied and followed by circular filter applied only on the outer coarse edge to finalize the detection process.  The proposed technique takes its importance from the huge explosion of images that need accurate processing in real time speedy manner. The proposed technique is implemented using MATLAB and tested on many solar and medical images; it was shown by the quantitative evaluation that the proposed technique can handle real-life (e.g. solar, medical fundus) images and shows very good potential even under noisy and artifacts conditions. Compared to the publicly available datasets, 97% and 99% of similarity detection is achieved in medical and solar images, respectively. Although it is well-know, the morphological bit-plane slicing technique is hoped to be used in the preprocessing stages of different applications to ease the subsequent image processing stages especially in real time applications where the proposed technique showed dramatic (~100 times) saving in processing time.


Authenticity of image and its copyright protection are one of the essential application of watermarking. In this paper, a hybrid technique for watermarking in DWT domain is presented for its application in the field of providing authentication to images. In this work binary image is used as watermark and is embedded in the 'host image'. Before embedding the watermark in the host, the host image is splitted into 8 bit planes using bit plane slicing. Followed that DWT is applied to the least significant bit plane which partitions the respective plane into low frequency (LL subband) and high frequency (HH, HL and LH subbands). The SVD is applied to HH subband of least significant bit plane and watermark is embedded on the singular matrix part of SVD. To analyse the robustness of the scheme proposed in this paper, watermarked image is attacked by different image processing attacks. Original watermark and extracted watermark is compared on the scale of normalized correlation to measure the robustness of the scheme against various attacks.


Sign in / Sign up

Export Citation Format

Share Document