Secure Similar Image Search and Copyright Protection over Encrypted Medical Image Databases

The recent advances in digital medical imaging and storage in cloud are bringing about more demands for efficient and secure image retrieval and management. Typically, medical images are very sensitive to changes where any modifications in its content may bring about an erroneous medical diagnosis. Therefore, securing medical images is a very essential process and the major task is, the medical image must maintain their sensitive contents at the time of reconstruction. The proposed methodology executes a secure image encryption and search of medical images proficiently over encrypted image database without leaking any sensitive data. It also ensures medical data integrity by introducing an efficient recovery mechanism on ROI of the image. The proposed scheme obtains recovery information about the image from the ROI of the medical data and embeds it in the RONI region using IWT transform which act as a reversible watermarking. If any alterations or tampers are caused to ROI at the third-party end, then it can be identified and recovered from the obtained recovery data. Besides, the model also executes a Copyright protection scheme to locate the authorized users, who illegally duplicate and distribute the retrieved image to unauthorized entities.     

Medical image registration using fuzzy theory

Mutual information (MI)-based registration, which uses MI as the similarity measure, is a representative method in medical image registration. It has an excellent robustness and accuracy, but with the disadvantages of a large amount of calculation and a long processing time. In this paper, by computing the medical image moments, the centroid is acquired. By applying fuzzy c-means clustering, the coordinates of the medical image are divided into two clusters to fit a straight line, and the rotation angles of the reference and floating images are computed, respectively. Thereby, the initial values for registering the images are determined. When searching the optimal geometric transformation parameters, we put forward the two new concepts of fuzzy distance and fuzzy signal-to-noise ratio (FSNR), and we select FSNR as the similarity measure between the reference and floating images. In the experiments, the Simplex method is chosen as multi-parameter optimisation. The experimental results show that this proposed method has a simple implementation, a low computational cost, a fast registration and good registration accuracy. Moreover, it can effectively avoid trapping into the local optima. It is adapted to both mono-modality and multi-modality image registrations.     

Registration of pedobarographic image data in the frequency domain

Image registration has been used to support pixel-level data analysis on pedobarographic image data sets. Some registration methods have focused on robustness and sacrificed speed, but a recent approach based on external contours offered both high computational processing speed and high accuracy. However, since contours can be influenced by local perturbations, we sought more global methods. Thus, we propose two new registration methods based on the Fourier transform, cross-correlation and phase correlation which offer high computational speed. We found out that both proposed methods revealed high accuracy for the similarity measures considered, using control geometric transformations. Additionally, both methods revealed high computational processing speed which, combined with their accuracy and robustness, allows their implementation in near-real-time applications. Furthermore, we found that the current methods were robust to moderate levels of noise, and consequently, do not require noise removal procedure like the contours method does.     

Multiplexed Nanometric 3D Tracking of Microbeads Using an FFT-Phasor Algorithm

Many single-molecule biophysical techniques rely on nanometric tracking of microbeads to obtain quantitative information about the mechanical properties of biomolecules such as chromatin fibers. Their three-dimensional (3D) position can be resolved by holographic analysis of the diffraction pattern in wide-field imaging. Fitting this diffraction pattern to Lorenz-Mie scattering theory yields the bead’s position with nanometer accuracy in three dimensions but is computationally expensive. Real-time multiplexed bead tracking therefore requires a more efficient tracking method, such as comparison with previously measured diffraction patterns, known as look-up tables. Here, we introduce an alternative 3D phasor algorithm that provides robust bead tracking with nanometric localization accuracy in a z range of over 10 μm under nonoptimal imaging conditions. The algorithm is based on a two-dimensional cross correlation using fast Fourier transforms with computer-generated reference images, yielding a processing rate of up to 10,000 regions of interest per second. We implemented the technique in magnetic tweezers and tracked the 3D position of over 100 beads in real time on a generic CPU. The accuracy of 3D phasor tracking was extensively tested and compared to a look-up table approach using Lorenz-Mie simulations, avoiding experimental uncertainties. Its easy implementation, efficiency, and robustness can improve multiplexed biophysical bead-tracking applications, especially when high throughput is required and image artifacts are difficult to avoid.     

A watershed approach for improving medical image segmentation

In this paper, a novel watershed approach based on seed region growing and image entropy is presented which could improve the medical image segmentation. The proposed algorithm enables the prior information of seed region growing and image entropy in its calculation. The algorithm starts by partitioning the image into several levels of intensity using watershed multi-degree immersion process. The levels of intensity are the input to a computationally efficient seed region segmentation process which produces the initial partitioning of the image regions. These regions are fed to entropy procedure to carry out a suitable merging which produces the final segmentation. The latter process uses a region-based similarity representation of the image regions to decide whether regions can be merged. The region is isolated from the level and the residual pixels are uploaded to the next level and so on, we recall this process as multi-level process and the watershed is called multi-level watershed. The proposed algorithm is applied to challenging applications: grey matter–white matter segmentation in magnetic resonance images (MRIs). The established methods and the proposed approach are experimented by these applications to a variety of simulating immersion, multi-degree, multi-level seed region growing and multi-level seed region growing with entropy. It is shown that the proposed method achieves more accurate results for medical image oversegmentation.     

A novel multi-head CNN design to identify plant diseases using the fusion of RGB images

Plant diseases and insect pests cause a significant threat to agricultural production. Early detection and diagnosis of these diseases are critical and can reduce economic losses. The recent development of deep learning (DL) benefits various fields, such as image processing, remote sensing, medical diagnosis, and agriculture. This work proposed a novel approach based on DL for plant disease detection by fusing RGB and segmented images. A multi-headed DenseNet-based architecture was developed, considering two images as input. We evaluated the model on a public dataset, PlantVillage, consisting of 54183 images with 38 classes. The fivefold cross-validation technique achieved an average accuracy, recall, precision, and f1-score of 98.17%, 98.17%, 98.16%, and 98.12%, respectively. The proposed approach can distinguish various plant diseases with different characteristics by image fusion. The high success rate with low standard deviation proves the robustness of the model, and the model can be integrated into plant disease detection and early warning system.     

A diabetic retinopathy detection method using an improved pillar K-means algorithm

The paper presents a new approach for medical image segmentation. Exudates are a visible sign of diabetic retinopathy that is the major reason of vision loss in patients with diabetes. If the exudates extend into the macular area, blindness may occur. Automated detection of exudates will assist ophthalmologists in early diagnosis. This segmentation process includes a new mechanism for clustering the elements of high-resolution images in order to improve precision and reduce computation time. The system applies K-means clustering to the image segmentation after getting optimized by Pillar algorithm; pillars are constructed in such a way that they can withstand the pressure. Improved pillar algorithm can optimize the K-means clustering for image segmentation in aspects of precision and computation time. This evaluates the proposed approach for image segmentation by comparing with Kmeans and Fuzzy C-means in a medical image. Using this method, identification of dark spot in the retina becomes easier and the proposed algorithm is applied on diabetic retinal images of all stages to identify hard and soft exudates, where the existing pillar K-means is more appropriate for brain MRI images. This proposed system help the doctors to identify the problem in the early stage and can suggest a better drug for preventing further retinal damage.     

A secure lossless recovery for medical images based on image encoding and data self-embedding

To protect the security of data outsourced to the cloud, the tampers detection and recovery for outsourced image have aroused the concern of people. A secure tampering detection and lossless recovery for medical images (MI) using permutation ordered binary (POB) number system is proposed. In the proposed scheme, the region of interest (ROI) of MI is first extracted, and then, ROI is divided into some no-overlapping blocks, and image encoding is conducted on these blocks based on the better compression performance of JPEG-LS for medical image. After that, the generated compression data by all the blocks are divided into high 4-bit and low 4-bit planes, and shuffling and combination are used to generate two plane images. Owing to the substantial redundancies space in the compressed data, the data of each plane are spread to the size of the original image. Lastly, authentication data of two bits is obtained for every pixel and inserted into the pixel itself within the each plane, and the corresponding 10-bit data is transformed into the POB value of 8-bit. Furthermore, encryption is implemented on the above image to produce two shares which can be outsourced to the cloud server. The users can detect tampered part and recover original image when they down load the shares from the cloud. Extensive experiments on some ordinary medical image and COVID-19 image datasets show that the proposed approach can locate the tampered parts within the MI, and the original MI can be recovered without any loss even if one of the shares are totally destroyed, or two shares are tampered at the ration not more than 50%. Some comparisons and analysis are given to show the better performance of the scheme.

     

自适应指数加权互信息配准医学图像的测度及相应算法

为配准医学图像,本文提出了一种新的自适应指数加权的互信息(Adaptive Exponential Weighted Mutual Informa- tion,AEWMI)测度,分析表明:通过对互信息(Mutual Information,MI)测度进行指数加权可以提高测度曲线的峰值尖锐性和平滑性;而指数的权值则可以通过评估待配准图像的质量和分辨率大小来自适应确定。仿真实验结果在验证分析结果的同时也表明,基于本文AEWMI测度的配准方案,对图像噪声、分辨率差异等有较高的鲁棒性,且可有效地提高配准的成功率。     

基于多孔小波融合的PET/CT 图像增强及其评价

目的:为解决融合图像视觉效果增强与量化信息损失之间的矛盾,本文提出一种基于非降采样的多孔小波(àtrous wavelet)分解的PET/CT图像融合方法,使得融合图像既有利于肿瘤诊断又能用于放疗靶区勾画和放射性定量分析。方法:对PET和CT图像分别进行多孔小波分解,以包含肿瘤目标的适当大小的感兴趣区域的清晰度为目标函数,采用Nelder-Mead算法对PET和CT图像高频分解系数之比进行优化获得最终的融合系数,使融合图像充分增加解剖学信息的同时又尽量保持PET图像原有的局部和整体灰度信息。结果:融合图像质量评价表明,本文方法能将有价值的PET功能信息与精确的CT解剖信息结合在一起,并克服传统小波融合损失图像量化信息的不足。结论:基于多孔小波融合的PET/CT图像既能用于肿瘤诊断,又能同时用于肿瘤学放射性计算和适形放疗计划制定等量化研究。     

Medical image registration using fuzzy theory

Mutual information (MI)-based registration, which uses MI as the similarity measure, is a representative method in medical image registration. It has an excellent robustness and accuracy, but with the disadvantages of a large amount of calculation and a long processing time. In this paper, by computing the medical image moments, the centroid is acquired. By applying fuzzy c-means clustering, the coordinates of the medical image are divided into two clusters to fit a straight line, and the rotation angles of the reference and floating images are computed, respectively. Thereby, the initial values for registering the images are determined. When searching the optimal geometric transformation parameters, we put forward the two new concepts of fuzzy distance and fuzzy signal-to-noise ratio (FSNR), and we select FSNR as the similarity measure between the reference and floating images. In the experiments, the Simplex method is chosen as multi-parameter optimisation. The experimental results show that this proposed method has a simple implementation, a low computational cost, a fast registration and good registration accuracy. Moreover, it can effectively avoid trapping into the local optima. It is adapted to both mono-modality and multi-modality image registrations.     

Automatic liver segmentation in MRI images using an iterative watershed algorithm and artificial neural network

Precise liver segmentation in abdominal MRI images is one of the most important steps for the computer-aided diagnosis of liver pathology. The first and essential step for diagnosis is automatic liver segmentation, and this process remains challenging. Extensive research has examined liver segmentation; however, it is challenging to distinguish which algorithm produces more precise segmentation results that are applicable to various medical imaging techniques. In this paper, we present a new automatic system for liver segmentation in abdominal MRI images. The system includes several successive steps. Preprocessing is applied to enhance the image (edge-preserved noise reduction) by using mathematical morphology. The proposed algorithm for liver region extraction is a combined algorithm that utilizes MLP neural networks and watershed algorithm. The traditional watershed transformation generally results in oversegmentation when directly applied to medical image segmentation. Therefore, we use trained neural networks to extract features of the liver region. The extracted features are used to monitor the quality of the segmentation using the watershed transform and adjust the required parameters automatically. The process of adjusting parameters is performed sequentially in several iterations. The proposed algorithm extracts liver region in one slice of the MRI images and the boundary tracking algorithm is suggested to extract the liver region in other slices, which is left as our future work. This system was applied to a series of test images to extract the liver region. Experimental results showed positive results for the proposed algorithm.     

2D fast rotational matching for image processing of biophysical data

In 3D single particle reconstruction, which involves the translational and rotational matching of a large number of electron microscopy (EM) images, the algorithmic performance is largely dependent on the efficiency and accuracy of the underlying 2D image alignment kernel. We present a novel fast rotational matching kernel for 2D images (FRM2D) that significantly reduces the cost of this alignment. The alignment problem is formulated using one translational and two rotational degrees of freedom. This allows us to take advantage of fast Fourier transforms (FFTs) in rotational space to accelerate the search of the two angular parameters, while the remaining translational parameter is explored, within a limited range, by exhaustive search. Since there are no boundary effects in FFTs of cyclic angular variables, we avoid the expensive zero padding associated with Fourier transforms in linear space. To verify the robustness of our method, efficiency and accuracy tests were carried out over a range of noise levels in realistic simulations of EM images. Performance tests against two standard alignment methods, resampling to polar coordinates and self-correlation, demonstrate that FRM2D compares very favorably to the traditional methods. FRM2D exhibits a comparable or higher robustness against noise and a significant gain in efficiency that depends on the fineness of the angular sampling and linear search range.     

Application of novel lossless compression of medical images using prediction and contextual error modeling

Conduction of tele-3D-computer assisted operations as well as other telemedicine procedures often requires highest possible quality of transmitted medical images and video. Unfortunately, those data types are always associated with high telecommunication and storage costs that sometimes prevent more frequent usage of such procedures. We present a novel algorithm for lossless compression of medical images that is extremely helpful in reducing the telecommunication and storage costs. The algorithm models the image properties around the current, unknown pixel and adjusts itself to the local image region. The main contribution of this work is the enhancement of the well known approach of predictor blends through highly adaptive determination of blending context on a pixel-by-pixel basis using classification technique. We show that this approach is well suited for medical image data compression. Results obtained with the proposed compression method on medical images are very encouraging, beating several well known lossless compression methods. The predictor proposed can also be used in other image processing applications such as segmentation and extraction of image regions.     

Possibility Study of Scale Invariant Feature Transform (SIFT) Algorithm Application to Spine Magnetic Resonance Imaging

The purpose of this study is an application of scale invariant feature transform (SIFT) algorithm to stitch the cervical-thoracic-lumbar (C-T-L) spine magnetic resonance (MR) images to provide a view of the entire spine in a single image. All MR images were acquired with fast spin echo (FSE) pulse sequence using two MR scanners (1.5 T and 3.0 T). The stitching procedures for each part of spine MR image were performed and implemented on a graphic user interface (GUI) configuration. Moreover, the stitching process is performed in two categories; manual point-to-point (mPTP) selection that performed by user specified corresponding matching points, and automated point-to-point (aPTP) selection that performed by SIFT algorithm. The stitched images using SIFT algorithm showed fine registered results and quantitatively acquired values also indicated little errors compared with commercially mounted stitching algorithm in MRI systems. Our study presented a preliminary validation of the SIFT algorithm application to MRI spine images, and the results indicated that the proposed approach can be performed well for the improvement of diagnosis. We believe that our approach can be helpful for the clinical application and extension of other medical imaging modalities for image stitching.     

Improved and Robust Detection of Cell Nuclei from Four Dimensional Fluorescence Images

Segmentation-free direct methods are quite efficient for automated nuclei extraction from high dimensional images. A few such methods do exist but most of them do not ensure algorithmic robustness to parameter and noise variations. In this research, we propose a method based on multiscale adaptive filtering for efficient and robust detection of nuclei centroids from four dimensional (4D) fluorescence images. A temporal feedback mechanism is employed between the enhancement and the initial detection steps of a typical direct method. We estimate the minimum and maximum nuclei diameters from the previous frame and feed back them as filter lengths for multiscale enhancement of the current frame. A radial intensity-gradient function is optimized at positions of initial centroids to estimate all nuclei diameters. This procedure continues for processing subsequent images in the sequence. Above mechanism thus ensures proper enhancement by automated estimation of major parameters. This brings robustness and safeguards the system against additive noises and effects from wrong parameters. Later, the method and its single-scale variant are simplified for further reduction of parameters. The proposed method is then extended for nuclei volume segmentation. The same optimization technique is applied to final centroid positions of the enhanced image and the estimated diameters are projected onto the binary candidate regions to segment nuclei volumes.Our method is finally integrated with a simple sequential tracking approach to establish nuclear trajectories in the 4D space. Experimental evaluations with five image-sequences (each having 271 3D sequential images) corresponding to five different mouse embryos show promising performances of our methods in terms of nuclear detection, segmentation, and tracking. A detail analysis with a sub-sequence of 101 3D images from an embryo reveals that the proposed method can improve the nuclei detection accuracy by 9 over the previous methods, which used inappropriate large valued parameters. Results also confirm that the proposed method and its variants achieve high detection accuracies ( 98 mean F-measure) irrespective of the large variations of filter parameters and noise levels.     

Dynamic optimization of bioprocesses: efficient and robust numerical strategies

The dynamic optimization (open loop optimal control) of non-linear bioprocesses is considered in this contribution. These processes can be described by sets of non-linear differential and algebraic equations (DAEs), usually subject to constraints in the state and control variables. A review of the available solution techniques for this class of problems is presented, highlighting the numerical difficulties arising from the non-linear, constrained and often discontinuous nature of these systems. In order to surmount these difficulties, we present several alternative stochastic and hybrid techniques based on the control vector parameterization (CVP) approach. The CVP approach is a direct method which transforms the original problem into a non-linear programming (NLP) problem, which must be solved by a suitable (efficient and robust) solver. In particular, a hybrid technique uses a first global optimization phase followed by a fast second phase based on a local deterministic method, so it can handle the nonconvexity of many of these NLPs. The efficiency and robustness of these techniques is illustrated by solving several challenging case studies regarding the optimal control of fed-batch bioreactors and other bioprocesses. In order to fairly evaluate their advantages, a careful and critical comparison with several other direct approaches is provided. The results indicate that the two-phase hybrid approach presents the best compromise between robustness and efficiency.     

Fast processing of microscopic images using object-based extended depth of field

Background

Microscopic analysis requires that foreground objects of interest, e.g. cells, are in focus. In a typical microscopic specimen, the foreground objects may lie on different depths of field necessitating capture of multiple images taken at different focal planes. The extended depth of field (EDoF) technique is a computational method for merging images from different depths of field into a composite image with all foreground objects in focus. Composite images generated by EDoF can be applied in automated image processing and pattern recognition systems. However, current algorithms for EDoF are computationally intensive and impractical, especially for applications such as medical diagnosis where rapid sample turnaround is important. Since foreground objects typically constitute a minor part of an image, the EDoF technique could be made to work much faster if only foreground regions are processed to make the composite image. We propose a novel algorithm called object-based extended depths of field (OEDoF) to address this issue.

Methods

The OEDoF algorithm consists of four major modules: 1) color conversion, 2) object region identification, 3) good contrast pixel identification and 4) detail merging. First, the algorithm employs color conversion to enhance contrast followed by identification of foreground pixels. A composite image is constructed using only these foreground pixels, which dramatically reduces the computational time.

Results

We used 250 images obtained from 45 specimens of confirmed malaria infections to test our proposed algorithm. The resulting composite images with all in-focus objects were produced using the proposed OEDoF algorithm. We measured the performance of OEDoF in terms of image clarity (quality) and processing time. The features of interest selected by the OEDoF algorithm are comparable in quality with equivalent regions in images processed by the state-of-the-art complex wavelet EDoF algorithm; however, OEDoF required four times less processing time.

Conclusions

This work presents a modification of the extended depth of field approach for efficiently enhancing microscopic images. This selective object processing scheme used in OEDoF can significantly reduce the overall processing time while maintaining the clarity of important image features. The empirical results from parasite-infected red cell images revealed that our proposed method efficiently and effectively produced in-focus composite images. With the speed improvement of OEDoF, this proposed algorithm is suitable for processing large numbers of microscope images, e.g., as required for medical diagnosis.

     

Neutrosophic Based Nakagami Total Variation Method for Speckle Suppression in Thyroid Ultrasound Images

Background

Neutrosophic based methods are becoming very popular in denoising of images due to the capability of handling indeterminacy. The main goal of denoising is to maintain balance between edge preservation and speckle reduction.

A Slantlet transform based intelligent system for magnetic resonance brain image classification

The present paper proposes the development of a new approach for automated diagnosis, based on classification of magnetic resonance (MR) human brain images. Wavelet transform based methods are a well-known tool for extracting frequency space information from non-stationary signals. In this paper, the proposed method employs an improved version of orthogonal discrete wavelet transform (DWT) for feature extraction, called Slantlet transform, which can especially be useful to provide improved time localization with simultaneous achievement of shorter supports for the filters. For each two-dimensional MR image, we have computed its intensity histogram and Slantlet transform has been applied on this histogram signal. Then a feature vector, for each image, is created by considering the magnitudes of Slantlet transform outputs corresponding to six spatial positions, chosen according to a specific logic. The features hence derived are used to train a neural network based binary classifier, which can automatically infer whether the image is that of a normal brain or a pathological brain, suffering from Alzheimer's disease. An excellent classification ratio of 100% could be achieved for a set of benchmark MR brain images, which was significantly better than the results reported in a very recent research work employing wavelet transform, neural networks and support vector machines.