An Effective Approach of Secured Medical Image Transmission Using Encryption Method

Various chaos-based image encryption schemes have been proposed in last few years. The proposed image encryption method uses chaotic map. The encryption is done by using 256 bit long external secret key. The initial condition for the chaotic mapping is evaluated by the use of external secret key along with the mapping function. Besides that, the proposed method is made more robust by applying multiple operations to the pixels of the image depending on the outcome of the calculation of the logistic map. Moreover, block shuffling of the image and modifying the secret key after encryption of each row is also done to add chaos to the proposed method.     

A New Color Image Encryption Scheme Using CML and a Fractional-Order Chaotic System

The chaos-based image cryptosystems have been widely investigated in recent years to provide real-time encryption and transmission. In this paper, a novel color image encryption algorithm by using coupled-map lattices (CML) and a fractional-order chaotic system is proposed to enhance the security and robustness of the encryption algorithms with a permutation-diffusion structure. To make the encryption procedure more confusing and complex, an image division-shuffling process is put forward, where the plain-image is first divided into four sub-images, and then the position of the pixels in the whole image is shuffled. In order to generate initial conditions and parameters of two chaotic systems, a 280-bit long external secret key is employed. The key space analysis, various statistical analysis, information entropy analysis, differential analysis and key sensitivity analysis are introduced to test the security of the new image encryption algorithm. The cryptosystem speed is analyzed and tested as well. Experimental results confirm that, in comparison to other image encryption schemes, the new algorithm has higher security and is fast for practical image encryption. Moreover, an extensive tolerance analysis of some common image processing operations such as noise adding, cropping, JPEG compression, rotation, brightening and darkening, has been performed on the proposed image encryption technique. Corresponding results reveal that the proposed image encryption method has good robustness against some image processing operations and geometric attacks.     

A Fast Color Image Encryption Algorithm Using 4-Pixel Feistel Structure

Algorithms using 4-pixel Feistel structure and chaotic systems have been shown to resolve security problems caused by large data capacity and high correlation among pixels for color image encryption. In this paper, a fast color image encryption algorithm based on the modified 4-pixel Feistel structure and multiple chaotic maps is proposed to improve the efficiency of this type of algorithm. Two methods are used. First, a simple round function based on a piecewise linear function and tent map are used to reduce computational cost during each iteration. Second, the 4-pixel Feistel structure reduces round number by changing twist direction securely to help the algorithm proceed efficiently. While a large number of simulation experiments prove its security performance, additional special analysis and a corresponding speed simulation show that these two methods increase the speed of the proposed algorithm (0.15s for a 256*256 color image) to twice that of an algorithm with a similar structure (0.37s for the same size image). Additionally, the method is also faster than other recently proposed algorithms.     

Optical-CT Dual-Modality Mapping Base on DRR Registration

Optical-CT dual-modality imaging requires the mapping between 2D fluorescence images and 3D body surface light flux. In this paper, we proposed an optical-CT dual-modality image mapping algorithm based on the Digitally Reconstructed Radiography (DRR) registration. In the process of registration, a series of DRR images were computed from CT data using the ray casting algorithm. Then, the improved HMNI similarity strategy based on Hausdorff distance was used to complete the registration of the white-light optical images and DRR virtual images. According to the corresponding relationship obtained by the image registration and the Lambert’s cosine law based on the pin-hole imaging model, the 3D light intensity distribution on the surface of the object could be solved. The feasibility and effectiveness of the mapping algorithm are verified by the irregular phantom and mouse experiments.     

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.

     

An Image Encryption Algorithm Utilizing Julia Sets and Hilbert Curves

Image encryption is an important and effective technique to protect image security. In this paper, a novel image encryption algorithm combining Julia sets and Hilbert curves is proposed. The algorithm utilizes Julia sets’ parameters to generate a random sequence as the initial keys and gets the final encryption keys by scrambling the initial keys through the Hilbert curve. The final cipher image is obtained by modulo arithmetic and diffuse operation. In this method, it needs only a few parameters for the key generation, which greatly reduces the storage space. Moreover, because of the Julia sets’ properties, such as infiniteness and chaotic characteristics, the keys have high sensitivity even to a tiny perturbation. The experimental results indicate that the algorithm has large key space, good statistical property, high sensitivity for the keys, and effective resistance to the chosen-plaintext attack.     

Karyotyping of comparative genomic hybridization human metaphases using kernel nearest-neighbor algorithm

BACKGROUND: Comparative genomic hybridization (CGH) is a relatively new molecular cytogenetic method that detects chromosomal imbalances. Automatic karyotyping is an important step in CGH analysis because the precise position of the chromosome abnormality must be located and manual karyotyping is tedious and time-consuming. In the past, computer-aided karyotyping was done by using the 4',6-diamidino-2-phenylindole, dihydrochloride (DAPI)-inverse images, which required complex image enhancement procedures. METHODS: An innovative method, kernel nearest-neighbor (K-NN) algorithm, is proposed to accomplish automatic karyotyping. The algorithm is an application of the "kernel approach," which offers an alternative solution to linear learning machines by mapping data into a high dimensional feature space. By implicitly calculating Euclidean or Mahalanobis distance in a high dimensional image feature space, two kinds of K-NN algorithms are obtained. New feature extraction methods concerning multicolor information in CGH images are used for the first time. RESULTS: Experiment results show that the feature extraction method of using multicolor information in CGH images improves greatly the classification success rate. A high success rate of about 91.5% has been achieved, which shows that the K-NN classifier efficiently accomplishes automatic chromosome classification from relatively few samples. CONCLUSIONS: The feature extraction method proposed here and K-NN classifiers offer a promising computerized intelligent system for automatic karyotyping of CGH human chromosomes.     

Mining-based associative image filtering using harmonic mean

With the development of IT convergence technologies, users can now more easily access useful information. These days, diverse and far-reaching information is being rapidly produced and distributed instantly in digitized format. Studies are continuously seeking to develop more efficient methods of delivering information to a greater number of users. Image filtering, which extracts features of interest from images, was developed to address the weakness of collaborative filtering, which is limited to superficial data analysis. However, image filtering has its own weakness of requiring complicated calculations to obtain the similarity between images. In this study, to resolve these problems, we propose associative image filtering based on the mining method utilizing the harmonic mean. Using data mining’s Apriori algorithm, this study investigated the association among preferred images from an associative image group and obtained a prediction based on user preference mean. In so doing, we observed a positive relationship between the various image preferences and the various distances between images’ color histograms. Preference mean was calculated based on the arithmetic mean, geometric mean, and harmonic mean. We found through performance analysis that the harmonic mean had the highest accuracy. In associative image filtering, we used the harmonic mean in order to anticipate preferences. In testing accuracy with MAE utilizing the proposed method, this study demonstrated an improvement of approximately 12 % on average compared to previous collaborative image filtering.     

Distributed Biomedical Scheme for Controlled Recovery of Medical Encrypted Images

With an advancement in biomedical applications, many images are communicated over the public networks. Therefore, these medical images are prone to various security threats. Development of end to end secure communication protocol for these medical images is found to be a challenging task. Therefore, many researchers have proposed various image medica image encryption techniques to provide end to end security of medical images. However, the existing approaches of block-based recovery of the secret through progressive sharing paradigm have support for limited threshold value of the chosen blocks out of the total number of the blocks during the communication of the image. Most of the suggested scheme has fixed threshold value for the blocks during recovery of secret; works good for a limited threshold (k) value out of number of blocks (n) in which secret has been divided for security. A novel threshold based (any value of k and n) blockwide recovery of secret in progressive secret sharing has been introduced and analyzed for distributed environment. The proposed threshold block wise splitting using progressive visual secret sharing (T-BPVSS) achieves any general higher value of threshold for recovery of secret medical images. Proposed scheme is tested based on various parameters such as varying values of threshold for recovery of secret during enhanced security scenario, as well as changing dimensions of the images and introducing noise in the images. A detailed distributed computing recovery solution is also suggested for the original secret by using distribution technique of shares across the networks of computers. The scheme satisfies for perfect security condition in distributed environment using at least minimum decided threshold numbers of participants (k) before revealing any of the blocks of secret medical image.     

Data preparation for artificial intelligence in medical imaging: A comprehensive guide to open-access platforms and tools

The vast amount of data produced by today’s medical imaging systems has led medical professionals to turn to novel technologies in order to efficiently handle their data and exploit the rich information present in them. In this context, artificial intelligence (AI) is emerging as one of the most prominent solutions, promising to revolutionise every day clinical practice and medical research. The pillar supporting the development of reliable and robust AI algorithms is the appropriate preparation of the medical images to be used by the AI-driven solutions. Here, we provide a comprehensive guide for the necessary steps to prepare medical images prior to developing or applying AI algorithms. The main steps involved in a typical medical image preparation pipeline include: (i) image acquisition at clinical sites, (ii) image de-identification to remove personal information and protect patient privacy, (iii) data curation to control for image and associated information quality, (iv) image storage, and (v) image annotation. There exists a plethora of open access tools to perform each of the aforementioned tasks and are hereby reviewed. Furthermore, we detail medical image repositories covering different organs and diseases. Such repositories are constantly increasing and enriched with the advent of big data. Lastly, we offer directions for future work in this rapidly evolving field.     

Blockchain-based federated learning methodologies in smart environments

Blockchain technology is an undeniable ledger technology that stores transactions in high-security chains of blocks. Blockchain can solve security and privacy issues in a variety of domains. With the rapid development of smart environments and complicated contracts between users and intelligent devices, federated learning (FL) is a new paradigm to improve accuracy and precision factors of data mining by supporting information privacy and security. Much sensitive information such as patient health records, safety industrial information, and banking personal information in various domains of the Internet of Things (IoT) including smart city, smart healthcare, and smart industry should be collected and gathered to train and test with high potential privacy and secured manner. Using blockchain technology to the adaption of intelligent learning can influence maintaining and sustaining information security and privacy. Finally, blockchain-based FL mechanisms are very hot topics and cut of scientific edge in data science and artificial intelligence. This research proposes a systematic study on the discussion of privacy and security in the field of blockchain-based FL methodologies on the scientific databases to provide an objective road map of the status of this issue. According to the analytical results of this research, blockchain-based FL has been grown significantly during these 5 years and blockchain technology has been used more to solve problems related to patient healthcare records, image retrieval, cancer datasets, industrial equipment, and economical information in the field of IoT applications and smart environments.

     

A Method for the Evaluation of Image Quality According to the Recognition Effectiveness of Objects in the Optical Remote Sensing Image Using Machine Learning Algorithm

Objective and effective image quality assessment (IQA) is directly related to the application of optical remote sensing images (ORSI). In this study, a new IQA method of standardizing the target object recognition rate (ORR) is presented to reflect quality. First, several quality degradation treatments with high-resolution ORSIs are implemented to model the ORSIs obtained in different imaging conditions; then, a machine learning algorithm is adopted for recognition experiments on a chosen target object to obtain ORRs; finally, a comparison with commonly used IQA indicators was performed to reveal their applicability and limitations. The results showed that the ORR of the original ORSI was calculated to be up to 81.95%, whereas the ORR ratios of the quality-degraded images to the original images were 65.52%, 64.58%, 71.21%, and 73.11%. The results show that these data can more accurately reflect the advantages and disadvantages of different images in object identification and information extraction when compared with conventional digital image assessment indexes. By recognizing the difference in image quality from the application effect perspective, using a machine learning algorithm to extract regional gray scale features of typical objects in the image for analysis, and quantitatively assessing quality of ORSI according to the difference, this method provides a new approach for objective ORSI assessment.     

Cryo-electron microscope image denoising based on the geodesic distance

Background

To perform a three-dimensional (3-D) reconstruction of electron cryomicroscopy (cryo-EM) images of viruses, it is necessary to determine the similarity of image blocks of the two-dimensional (2-D) projections of the virus. The projections containing high resolution information are typically very noisy. Instead of the traditional Euler metric, this paper proposes a new method, based on the geodesic metric, to measure the similarity of blocks.

Results

Our method is a 2-D image denoising approach. A data set of 2243 cytoplasmic polyhedrosis virus (CPV) capsid particle images in different orientations was used to test the proposed method. Relative to Block-matching and three-dimensional filtering (BM3D), Stein’s unbiased risk estimator (SURE), Bayes shrink and K-means singular value decomposition (K-SVD), the experimental results show that the proposed method can achieve a peak signal-to-noise ratio (PSNR) of 45.65. The method can remove the noise from the cryo-EM image and improve the accuracy of particle picking.

Conclusions

The main contribution of the proposed model is to apply the geodesic distance to measure the similarity of image blocks. We conclude that manifold learning methods can effectively eliminate the noise of the cryo-EM image and improve the accuracy of particle picking.

     

Nonrigid Registration Regularized by Shape Information: Application to Atlas Construction of Cardiac CT Images

Cardiac atlases play an important role in the computer-aided diagnosis of cardiovascular diseases, in particular they need to deal with large and highly variable image datasets. In this paper, we propose a new nonrigid registration algorithm incorporating shape information, to produce comprehensive atlases. For one thing, the multiscale gradient orientation features of images are combined to form the construction of multifeature mutual information. Additionally, the shape information of multiple-objects in images is incorporated into the cost function for registration. We demonstrate the merits of the new registration algorithm on the 3D data sets of 15 patients. The experimental results show that the new registration algorithm can outperform the conventional intensity-based registration method. The obtained atlas can represent the cardiac structures more accurately.     

Noise suppressed,multifocus image fusion for enhanced intraoperative navigation

Current intraoperative imaging systems are typically not able to provide ‘sharp’ images over entire large areas or entire organs. Distinct structures such as tissue margins or groups of malignant cells are therefore often difficult to detect, especially under low signal‐to‐noise‐ratio conditions. In this report, we introduce a noise suppressed multifocus image fusion algorithm, that provides detailed reconstructions even when images are acquired under sub‐optimal conditions, such is the case for real time fluorescence intraoperative surgery. The algorithm makes use of the Anscombe transform combined with a multi‐level stationary wavelet transform with individual threshold‐based shrinkage. While the imaging system is integrated with a respiratory monitor triggering system, it can be easily adapted to any commercial imaging system. The developed algorithm is made available as a plugin for Osirix. (© 2013 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Theoretical Limits on Errors and Acquisition Rates in Localizing Switchable Fluorophores

A variety of recent imaging techniques are able to beat the diffraction limit in fluorescence microcopy by activating and localizing subsets of the fluorescent molecules in the specimen, and repeating this process until all of the molecules have been imaged. In these techniques there is a tradeoff between speed (activating more molecules per imaging cycle) and error rates (activating more molecules risks producing overlapping images that hide information on molecular positions), and so intelligent image processing approaches are needed to identify and reject overlapping images. We introduce here a formalism for defining error rates, derive a general relationship between error rates, image acquisition rates, and the performance characteristics of the image processing algorithms, and show that there is a minimum acquisition time irrespective of algorithm performance. We also consider algorithms that can infer molecular positions from images of overlapping blurs, and derive the dependence of the minimum acquisition time on algorithm performance.     

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.     

Rapid pedobarographic image registration based on contour curvature and optimization

Image registration, the process of optimally aligning homologous structures in multiple images, has recently been demonstrated to support automated pixel-level analysis of pedobarographic images and, subsequently, to extract unique and biomechanically relevant information from plantar pressure data. Recent registration methods have focused on robustness, with slow but globally powerful algorithms. In this paper, we present an alternative registration approach that affords both speed and accuracy, with the goal of making pedobarographic image registration more practical for near-real-time laboratory and clinical applications. The current algorithm first extracts centroid-based curvature trajectories from pressure image contours, and then optimally matches these curvature profiles using optimization based on dynamic programming. Special cases of disconnected images (that occur in high-arched subjects, for example) are dealt with by introducing an artificial spatially linear bridge between adjacent image clusters. Two registration algorithms were developed: a ‘geometric’ algorithm, which exclusively matched geometry, and a ‘hybrid’ algorithm, which performed subsequent pseudo-optimization. After testing the two algorithms on 30 control image pairs considered in a previous study, we found that, when compared with previously published results, the hybrid algorithm improved overlap ratio (p=0.010), but both current algorithms had slightly higher mean-squared error, assumedly because they did not consider pixel intensity. Nonetheless, both algorithms greatly improved the computational efficiency (25±8 and 53±9 ms per image pair for geometric and hybrid registrations, respectively). These results imply that registration-based pixel-level pressure image analyses can, eventually, be implemented for practical clinical purposes.