Biomedical Image Processing Using FCM Algorithm Based on the Wavelet Transform

An effective processing method for biomedical images and the Fuzzy C-mean (FCM) algorithm based on the wavelet transform are investigated.By using hierarchical wavelet decomposition, an original image could be decomposed into one lower image and several detail images. The segmentation started at the lowest resolution with the FCM clustering algorithm and the texture feature extracted from various sub-bands. With the improvement of the FCM algorithm, FCM alternation frequency was decreased and the accuracy of segmentation was advanced.

An Algorithm for Ship Wake Detection from the SAR Images Using the Radon Transform and Morphological Image Processing

Using the Radon transform and morphological image processing, an algorithm for ship's wake detection in the SAR (synthetic aperture radar) image is developed. Being manipulated in the Radon space to invert the gray-level and binary images, the linear texture of ship wake in oceanic clutter can be well detected. It has been applied to the automatic detection of a moving ship from the SEASAT SAR image. The results show that this algorithm is well robust in a strong noisy background and is not very sensitive to the threshold parameter and the working window size.

A secure image steganography algorithm based on least significant bit and integer wavelet transform

The rapid development of data communication in modern era demands secure exchange of information. Steganography is an established method for hiding secret data from an unauthorized access into a cover object in such a way that it is invisible to human eyes. The cover object can be image, text, audio,or video. This paper proposes a secure steganography algorithm that hides a bitstream of the secret text into the least significant bits（LSBs） of the approximation coefficients of the integer wavelet transform（IWT） of grayscale images as well as each component of color images to form stego-images. The embedding and extracting phases of the proposed steganography algorithms are performed using the MATLAB software. Invisibility, payload capacity, and security in terms of peak signal to noise ratio（PSNR） and robustness are the key challenges to steganography. The statistical distortion between the cover images and the stego-images is measured by using the mean square error（MSE） and the PSNR, while the degree of closeness between them is evaluated using the normalized cross correlation（NCC）. The experimental results show that, the proposed algorithms can hide the secret text with a large payload capacity with a high level of security and a higher invisibility. Furthermore, the proposed technique is computationally efficient and better results for both PSNR and NCC are achieved compared with the previous algorithms.

Multisensor image fusion algorithm using nonseparable wavelet frame transform

A muitisensor image fusion algorithm is described using 2-dimensional nonseparable wavelet frame （NWF） transform. The source muitisensor images are first decomposed by the NWF transform. Then, the NWF transform coefficients of the source images are combined into the composite NWF transform coefficients. Inverse NWF transform is performed on the composite NWF transform coefficients in order to obtain the intermediate fused image. Finally, intensity adjustment is applied to the intermediate fused image in order to maintain the dynamic intensity range. Experiment resuits using real data show that the proposed algorithm works well in muitisensor image fusion.

Using Graphics Processing Units to Parallelize the FDK Algorithm for Tomographic Image Reconstruction

The paper presents the implementation of a parallel version of FDK （Felkamp, David e Kress） algorithm using graphics processing units. Discussion was briefly some elements the computed tomographic scan and FDK algorithm; and some ideas about GPUs （Graphics Processing Units） and its use in general purpose computing were presented. The paper shows a computational implementation of FDK algorithm and the process of parallelization of this implementation. Compare the parallel version of the algorithm with the sequential version, used speedup as a performance metric. To evaluate the performance of parallel version, two GPUs, GeForce 9400GT （16 cores） a low capacity GPU and Quadro 2000 （192 cores） a medium capacity GPU was reached speedup of 3.37.

Parallel Image Processing Technology of Surface Detection System

To improve image processing speed and detection precision of a surface detection system on a strip surface,based on the analysis of the characteristics of image data and image processing in detection system on the strip surface,the design of parallel image processing system and the methods of algorithm implementation have been studied. By using field programmable gate array(FPGA) as hardware platform of implementation and considering the characteristic of detection system on the strip surface,a parallel image processing system implemented by using multi IP kernel is designed. According to different computing tasks and the load balancing capability of parallel processing system,the system could set different calculating numbers of nodes to meet the system's demand and save the hardware cost.

Adaptive template filter method for image processing based on immune genetic algorithm

To preserve the original signal as much as possible and filter random noises as many as possible in image processing,a threshold optimization-based adaptive template filtering algorithm was proposed.Unlike conventional filters whose template shapes and coefficients were fixed,multi-templates were defined and the right template for each pixel could be matched adaptively based on local image characteristics in the proposed method.The superiority of this method was verified by former results concerning the matching experiment of actual image with the comparison of conventional filtering methods.The adaptive search ability of immune genetic algorithm with the elitist selection and elitist crossover(IGAE) was used to optimize threshold t of the transformation function,and then combined with wavelet transformation to estimate noise variance.Multi-experiments were performed to test the validity of IGAE.The results show that the filtered result of t obtained by IGAE is superior to that of t obtained by other methods,IGAE has a faster convergence speed and a higher computational efficiency compared with the canonical genetic algorithm with the elitism and the immune algorithm with the information entropy and elitism by multi-experiments.

An Orthogonal Wavelet Transform Fractionally Spaced Blind Equalization Algorithm Based on the Optimization of Genetic Algorithm

An orthogonal wavelet transform fractionally spaced blind equalization algorithm based on the optimization of genetic algorithm(WTFSE-GA) is proposed in viewof the lowconvergence rate,large steady-state mean square error and local convergence of traditional constant modulus blind equalization algorithm(CMA).The proposed algorithm can reduce the signal autocorrelation through the orthogonal wavelet transform of input signal of fractionally spaced blind equalizer,and decrease the possibility of CMA local convergence by using the global random search characteristics of genetic algorithm to optimize the equalizer weight vector.The proposed algorithm has the faster convergence rate and smaller mean square error compared with FSE and WT-FSE.The efficiency of the proposed algorithm is proved by computer simulation of underwater acoustic channels.

Entropy of images after wavelet transform

We studied the variation of image entropy before and after wavelet decomposition, the optimal number of wavelet decomposition layers, and the effect of wavelet bases and image frequency components on entropy. Numerous experiments were done on typical images to calculate (using Matlab) the entropy before and after wavelet transform. It was verified that, to obtain minimal entropy, a three-layer decomposition should be adopted rather than higher orders. The result achieved by using biorthogonal wavelet decomposition is better than that of the orthogonal wavelet decomposition. The results are not directly proportional to the vanishing moment, however.

Method of Infrared Image Enhancement Based on Stationary Wavelet Transform

Aiming at the problem,i.e.infrared images own the characters of bad contrast ratio and fuzzy edges,a method to enhance the contrast of infrared image is given,which is based on stationary wavelet transform.After making stationary wavelet transform to an infrared image,denoising is done by the proposed method of double-threshold shrinkage in detail coefficient matrixes that have high noisy intensity.For the approximation coefficient matrix with low noisy intensity,enhancement is done by the proposed method based on histogram.The enhanced image can be got by wavelet coefficient reconstruction.Furthermore,an evaluation criterion of enhancement performance is introduced.The results show that this algorithm ensures target enhancement and restrains additive Gauss white noise effectively.At the same time,its amount of calculation is small and operation speed is fast.

Application of Image Fusion Methods to Cell Imaging Processing

Aim To fuse the fluorescence image and transmission image of a cell into a single image containing more information than any of the individual image. Methods Image fusion technology was applied to biological cell imaging processing. It could match the images and improve the confidence and spatial resolution of the images. Using two algorithms, double thresholds algorithm and denoising algorithm based on wavelet transform,the fluorescence image and transmission image of a Cell were merged into a composite image. Results and Conclusion The position of fluorescence and the structure of cell can be displyed in the composite image. The signal-to-noise ratio of the exultant image is improved to a large extent. The algorithms are not only useful to investigate the fluorescence and transmission images, but also suitable to observing two or more fluoascent label proes in a single cell.

Study of image processing for V-shape groove and robotic weld seam tracking based on laser vision

Single-stripe laser was applied to acquire V-shape groove contour information. Most of arc light and splash noise was removed and stripe laser image was kept by wavelet transform. Half-threshold algorithm was used for image segmentation and stripe laser image was gotten after refining. Weld seam center position was identified and extracted by extreme curvature corner detection method. The location of torch was detected to accord the frequency of computer program with robot program and serial communication program. The tracking experiments of sidelong, reflex and curve weld line show that the system can meet the demand of the tracking precision under normal welding conditions.

IMAGE WAVELET DENOISING USING THE ROBUST LOCAL THRESHOLD

This paper suggests a scheme of image denoising based on two-dimensional discrete wavelet transform. The denoising algorithm is described with some operators. By thresholding the wavelet transform coefficients of noisy images, the original image can be reconstructed correctly. Different threshold selections and thresholding methods are discussed. A new robust local threshold scheme is proposed. Quantifying the performance of image denoising schemes by using the mean square error, the performance of the robust local threshold scheme is demonstrated and is compared with the universal threshold scheme. The experiment shows that image denoising using the robust local threshold performs better than that using the universal threshold.

An Improved Medical Image Fusion Algorithm for Anatomical and Functional Medical Images

In recent years,many medical image fusion methods had been exploited to derive useful information from multimodality medical image data,but,not an appropriate fusion algorithm for anatomical and functional medical images.In this paper,the traditional method of wavelet fusion is improved and a new fusion algorithm of anatomical and functional medical images,in which high-frequency and low-frequency coefficients are studied respectively.When choosing high-frequency coefficients,the global gradient of each sub-image is calculated to realize adaptive fusion,so that the fused image can reserve the functional information;while choosing the low coefficients is based on the analysis of the neighborbood region energy,so that the fused image can reserve the anatomical image's edge and texture feature.Experimental results and the quality evaluation parameters show that the improved fusion algorithm can enhance the edge and texture feature and retain the function information and anatomical information effectively.

An Adaptive Method of Image CompressionBased on Wavelet Analysis

Through research for image compression based on wavelet analysis in recent years, we put forward an adaptive wavelet decomposition strategy. Whether sub-images are to be decomposed or not are decided by their energy defined by certain criterion. Then we derive the adaptive wavelet decomposition tree (AWDT) and the way of adjustable compression ratio. According to the feature of AWDT, this paper also deals with the strategies which are used to handle different sub-images in the procedure of quantification and coding of the wavelet coefficients. Through experiments, not only the algorithm in the paper can adapt to various images, but also the quality of recovered image is improved though compression ratio is higher and adjustable. When their compression ratios are near, the quality of subjective vision and PSNR of the algorithm are better than those of JPEG algorithm.

NEW FAST ALGORITHM OF 2-D DISCRETE COSINE TRANSFORM

In this paper, a new algorithm for the fast computation of a 2-D discrete cosine transform (DCT) is presented. It is shown that the N×N DCT, where N = 2m, can be computed using only N 1-D DCT’s and additions, instead of using 2N 1-D DCT’s as in the conventional row-column approach. Hence the total number of multiplications for the proposed algorithm is only half of that required for the row-column approach, and is also less than that of most of other fast algorithms, while the number of additions is almost comparable to that of others.

Wavelet-based gray-level digital image watermarking

The watermarking technique has been proposed as a method by hiding secret information into the image to protect the copyright of multimedia data. But most previous work focuses on the algorithms of embedding one dimensional watermarks or two dimensional binary digital watermarks. In this paper, a wavelet based method for embedding a gray level digital watermark into an image is proposed. By still image decomposition technique, a gray level digital watermark is decompounded into a series of bitplanes. By discrete wavelet transform ( DWT ), the host image is decomposed into multiresolution representations with hierarchical structure. The different bitplanes of the gray level watermark is embedded into the corresponding resolution of the decomposed host image. The experimental results show that the proposed techniques can successfully survive image processing operations and the lossy compression techniques such as Joint Photographic Experts Group (JPEG).

New Optimal DWT Domain Image Watermarking Technique via Genetic Algorithm

A novel optimal image watermarking scheme is proposed in which the genetic algorithm (GA) is employed to obtain the improvement of algorithm performance. Arnold transform is utilized to obtain the scrambled watermark, and then the embedding and extraction of watermark are implemented in digital wavelet transform (DWT) domain. During the watermarking process, GA is employed to search optimal parameters of embedding strength and times of Arnold transform to gain the optimization of watermarking performance. Simulation results show that the proposed method can improve the quality of watermarked image and give almost the same robustness of the watermark.