Evolutionary Computation Based Optimization of Image Zernike Moments Shape Feature Vector

The image shape feature can be described by the image Zernike moments. In this paper, we points out the problem that the high dimension image Zernike moments shape feature vector can describe more detail of the original image but has too many elements making trouble for the next image analysis phases. Then the low dimension image Zernike moments shape feature vector should be improved and optimized to describe more detail of the original image. So the optimization algorithm based on evolutionary computation is designed and implemented in this paper to solve this problem. The experimental results demonstrate the feasibility of the optimization algorithm.

An effective copy-move forgery detection algorithm using fractional quaternion Zernike moments and improved PatchMatch algorithm

An effective algorithm is proposed to detect copy-move forgery.In this algorithm,first,the PatchMatch algorithm is improved by using a reliable order-statistics-based approximate nearest neighbor search algorithm(ROSANNA)to modify the propagation process.Then,fractional quaternion Zernike moments(FrQZMs)are considered to be features extracted from color forged images.Finally,the extracted FrQZMs features are matched by the improved PatchMatch algorithm.The experimental results on two publicly available datasets(FAU and GRIP datasets)show that the proposed algorithm performs better than the state-of-the-art algorithms not only in objective criteria F-measure value but also in visual.Moreover,the proposed algorithm is robust to some attacks,such as additive white Gaussian noise,JPEG compression,rotation,and scaling.

Image Zernike Moments Shape Feature Evaluation Based on Image Reconstruction

The evaluation approach to the accuracy of the image feature descriptors plays an important role in image feature extraction. We point out that the image shape feature can be described by the Zernike moments set while briefly introducing the basic concept of the Zernike moment. After talking about the image reconstruction technique based on the inverse transformation of Zernike moment, the evaluation approach to the accuracy of the Zernike moments shape feature via the dissimilarity degree and the reconstruction ratio between the original image and the reconstructed image is proposed. The experiment results demonstrate the feasibility of this evaluation approach to image Zernike moments shape feature.

Visual positioning of rectangular lead components based on Harris corners and Zernike moments

With the increasing necessities for reliable printed circuit board(PCB) product, there has been a considerable demand for high speed and high precision vision positioning system. To locate a rectangular lead component with high accuracy and reliability, a new visual positioning method was introduced. Considering the limitations of Ghosal sub-pixel edge detection algorithm, an improved algorithm was proposed, in which Harris corner features were used to coarsely detect the edge points and Zernike moments were adopted to accurately detect the edge points. Besides, two formulas were developed to determine the edge intersections whose sub-pixel coordinates were calculated with bilinear interpolation and conjugate gradient method. The last experimental results show that the proposed method can detect the deflection and offset, and the detection errors are less than 0.04° and 0.02 pixels.

Pseudo Zernike Moment and Deep Stacked Sparse Autoencoder for COVID-19 Diagnosis

(Aim)COVID-19 is an ongoing infectious disease.It has caused more than 107.45 m confirmed cases and 2.35 m deaths till 11/Feb/2021.Traditional computer vision methods have achieved promising results on the automatic smart diagnosis.(Method)This study aims to propose a novel deep learning method that can obtain better performance.We use the pseudo-Zernike moment(PZM),derived from Zernike moment,as the extracted features.Two settings are introducing:(i)image plane over unit circle;and(ii)image plane inside the unit circle.Afterward,we use a deep-stacked sparse autoencoder(DSSAE)as the classifier.Besides,multiple-way data augmentation is chosen to overcome overfitting.The multiple-way data augmentation is based on Gaussian noise,salt-and-pepper noise,speckle noise,horizontal and vertical shear,rotation,Gamma correction,random translation and scaling.(Results)10 runs of 10-fold cross validation shows that our PZM-DSSAE method achieves a sensitivity of 92.06%±1.54%,a specificity of 92.56%±1.06%,a precision of 92.53%±1.03%,and an accuracy of 92.31%±1.08%.Its F1 score,MCC,and FMI arrive at 92.29%±1.10%,84.64%±2.15%,and 92.29%±1.10%,respectively.The AUC of our model is 0.9576.(Conclusion)We demonstrate“image plane over unit circle”can get better results than“image plane inside a unit circle.”Besides,this proposed PZM-DSSAE model is better than eight state-of-the-art approaches.

Blur Image Edge to Enhance Zernike Moments for Object Recognition

Zernike moments (ZMs) are a set of orthogonal moments which have been successfully used in the fields of image processing and pattern recognition. A combination of edge blurring with ZMs computation was introduced. In this study, several kinds of artificial binary stripe images were used to investigate the effects of edge blurring on the absolute mean error of reconstructed image from high-order ZMs. After the blurring process, the reconstruction errors were increased dramatically at edge pixels, but decreased on non-edge pixels. The experimental results demonstrated that 2-pixel blurring approach provided better performance for reducing reconstruction error. Finally, a template matching between two real images was simulated to illustrate the effectiveness of the proposed method.

Performance of Object Classification Using Zernike Moment

Moments have been used in all sorts of object classification systems based on image. There are lots of moments studied by many researchers in the area of object classification and one of the most preference moments is the Zernike moment. In this paper, the performance of object classification using the Zernike moment has been explored. The classifier based on neural networks has been used in this study. The results indicate the best performance in identifying the aggregate is at 91.4% with a ten orders of the Zernike moment. This encouraging result has shown that the Zernike moment is a suitable moment to be used as a feature of object classification systems.

Rotation, Scaling and Translation Invariant Blind Image Watermarking Scheme Utilizing Zernike Moments

A novel adaptive blind image watermarking scheme resistant to Rotation, scaling and translation (RST) attacks is proposed in this paper. Based on fuzzy clustering theory and Human visual system (HVS) model, the spread spectrum watermark is adaptively embedded in Discrete wavelet transform (DWT) domain. In order to register RST transform parameters, a hierarchical neural network is utilized to learn image geometric pattern represented by low order Zernike moments. Watermark extraction is carried out after watermarked image has been synchronized without original image. It only needs a trained neural network.Experiments show that it can embed more robust watermark under certain visual distance, effectively resist Joint photographic experts group (JPEG) compression, noise and RST attacks.

A Theoretical Comparison among Recursive Algorithms for Fast Computation of Zernike Moments Using the Concept of Time Complexity

Zernike polynomials have been used in different fields such as optics, astronomy, and digital image analysis for many years. To form these polynomials, Zernike moments are essential to be determined. One of the main issues in realizing the moments is using factorial terms in their equation which causes higher time complexity. As a solution, several methods have been presented to reduce the time complexity of these polynomials in recent years. The purpose of this research is to study several methods among the most popular recursive methods for fast Zernike computation and compare them together by a global theoretical evaluation system called worst-case time complexity. In this study, we have analyzed the selected algorithms and calculated the worst-case time complexity for each one. After that, the results are represented and explained and finally, a conclusion has been made by comparing these criteria among the studied algorithms. According to time complexity, we have observed that although some algorithms such as Wee method and Modified Prata method were successful in having the smaller time complexities, some other approaches did not make any significant difference compared to the classical algorithm.

Osteosarcoma Segmentation in MRI Based on Zernike Moment and SVM

Osteosarcoma is primary malignant neoplasms derived from cells of mesenchymal origin, and often has distinct phenotypes at different stages. The location of tumor and reaction zone can be identified by an expert in magnetic resonance imaging (MRI), with MRI being one of the choices for evaluating the extent of osteosarcoma. However, it is still a challenge to automatically extract tumor from its surrounding tissues because of their low intensity differences in MRI. We investigated an approach based on Zernike moment and support vector machine (SVM) for osteosarcoma segmentation in T1-weighted image (TIWI). Firstly, the different order moments around each pixel are calculated in small windows. Secondly, the grayscale and the module values of different order moments are used as a texture feature vector which is then used as the training set for SVM. Finally, an SVM classifier is trained based on this set of features to identify the osteosarcoma, and the segmented tumor tissue is rendered in 3D by the ray casting algorithm based on graphics processing unit (GPU). The performance of the method is validated on T1WI, showing that the segmentation method has a high similarity index with the expert's manual segmentation.

A Geometric Robust Watermarking Algorithm Based on DWT-DCT and Zernike Moments

This paper proposed a novel multibits watermarking algorithm providing robustness against geometric attacks. The robustness is achieved from three aspects： （1） Choosing the inscribed disk of the host image as the Zernike moments computation domain and the square in the disk as the watermarking embedding domain. （2） Embedding the watermark in the cascade discrete wavelet transform-discrete cosine transform （DWT-DCT） domain by modulating the specified coefficient pair in each sub block. （3） Saving two selected Zernike moments of the original watermarked image to estimate and correct the geometric attacks before watermark extraction. Experimental results show that the proposed algorithm is robust to any angle of rotation attacks and wide range of scaling attacks, and as well, a variety of other attacks such as lossy compression, common signal processing.

A Zernike-moment-based non-local denoising filter for cryo-EM images

Cryo-electron microscopy (cryo-EM) plays an important role in determining the structure of proteins, viruses, and even the whole cell. It can capture dynamic structural changes of large protein complexes, which other methods such as X-ray crystallography and nuclear magnetic resonance analysis find difficult. The signal-to-noise ratio of cryo-EM images is low and the contrast is very weak, and therefore, the images are very noisy and require filtering. In this paper, a filtering method based on non-local means and Zernike moments is proposed. The method takes into account the rotational symmetry of some biological molecules to enhance the signal-to-noise ratio of cryo-EM images. The method may be useful in cryo-EM image processing such as the automatic selection of particles, orientation determination, and the building of initial models.

Sub-pixel edge detection method for miniature parts in microscopic field of view

In order to improve the edge detection precision of miniature parts in microscopic field of viewa sub-pixel edge detectionalgorithm combining non-orthogonal quadratic B-spline wavelet transform algorithm and Zernike moment algorithm is proposed.Non-orthogonal quadratic B-spline wavelet transform algorithm is adopted to get the pixel edge of miniature parts?andthe moment invariant of Zernike moment algorithm is used for refining the pixel edge to get sub-pixel edges.A real-time detectionsystem based on the proposed algorithm for miniature parts is established.The general system structure and operational principle are given,the real-time image acquisition and detection are completed,the results of edge detection are analyzed and the detection precision is evaluated.The results show that parts size can be0.01-10mm and the detection precision reaches0.01%-0.1%.Therefore,the edge of the miniature parts can be accurately identified and the detection precision can be improved to sub-pixel level,which meets the requirements of miniature parts precision detection.

Illumination Invariant Recognition of Three-Dimensional Texture in Color Images

In this paper, illumination-affine invariant methods are presented based onaffine moment normalization techniques, Zernike moments, and multiband correlation functions. Themethods are suitable for the illumination invariant recognition of 3D color texture. Complex valuedmoments (i.e., Zernike moments) and affine moment normalization are used in the derivation ofillumination affine invariants where the real valued affine moment invariants fail to provide affineinvariants that are independent of illumination changes. Three different moment normalizationmethods have been used, two of which are based on affine moment normalization technique and thethird is based on reducing the affine transformation to a Euclidian transform. It is shown that fora change of illumination and orientation, the affinely normalized Zernike moment matrices arerelated by a linear transform. Experimental results are obtained in two tests: the first is usedwith textures of outdoor scenes while the second is performed on the well-known CUReT texturedatabase. Both tests show high recognition efficiency of the proposed recognition methods.

Analyzing Antarctic ice sheet snowmelt with dynamic Big Earth Data

Big Earth Data—big data associated with Earth sciences—can potentially revolutionize research on climate change,sustainable development,and other issues of global concern.For example,analyzing massive amounts of satellite imagery of polar environments,which are sensitive to the effects of climate change,provides insights into global climate trends.This study proposes a method to use Big Earth Data to explore changes in snowmelt over the Antarctic ice sheet from 1979 to 2016.The method uses Zernike moments to observe melt area in Antarctica and uses the Mann-Kendall test to detect temporal changes and abnormal information about the continent’s melt area.The melting trend in the time-series data matched the changes in temperature and seasonal transitions.The results do not demonstrate significant change in the area of surface melt;however,abrupt changes in melt conditions linked to temperature changes over the Antarctic ice sheet were observed within the time series.The experiment results demonstrate that the proposed method is robust,adaptive,and capable of extracting the core features of melting snow.

Video super-resolution reconstruction based on deep convolutional neural network and spatio-temporal similarity

Existing learning-based super-resolution （SR） reconstruction algorithms are mainly designed for single image, which ignore the spatio-temporal relationship between video frames. Aiming at applying the advantages of learning-based algorithms to video SR field, a novel video SR reconstruction algorithm based on deep convolutional neural network （CNN） and spatio-temporal similarity （STCNN-SR） was proposed in this paper. It is a deep learning method for video SR reconstruction, which considers not onlv the mapping relationship among associated low-resolution （LR） and high-resolution （HR） image blocks, but also the spatio-temporal non-local complementary and redundant information between adjacent low-resolution video frames. The reconstruction speed can be improved obviously with the pre-trained end-to-end reconstructed coefficients. Moreover, the performance of video SR will be further improved by the optimization process with spatio-temporal similarity. Experimental results demonstrated that the proposed algorithm achieves a competitive SR quality on both subjective and objective evaluations, when compared to other state-of-the-art algorithms.

Two-Factor Cancelable Biometrics Authenticator

Biometrics-based authentication system offers advantages of providing high reliability and accuracy. However the contemporary authentication system is impuissance to compromise. If a biometrics data is compromised, it cannot be replaced and rendered unusable. In this paper, a cancelable biometrics-based authenticator is proposed to solve this irrevocability issue. The proposed approach is a two-factor authentication system, which requires both of the random data and facial feature in order to access the system. In this system, tokenized pseudo-random data is coupled with momentbased facial feature via inner product algorithm. The output of the product is then discretized to generate a set of private binary code, coined as 2factor-Hashing code, which is acted as verification key. If this biometrics-based verification key is compromised, a new one can be issued by replacing a different set of random number via token replacement. Then, the compromised one is rendered completely useless. This feature offers an extra protection layer against biometrics fabrication since the verification code is replaceable. Experimental results demonstrate that the proposed system provides zero Equal Error Rate in which there is a clear separation in between the genuine and the imposter distribution populations.