Groupwise non-rigid image alignment is a difficult non-linear optimization problem involving many parameters and often large datasets. Previous methods have explored various metrics and optimization strategies. Good results have been previously achieved with simple metrics, requiring complex optimization, often with many unintuitive parameters that require careful tuning for each dataset. In this chapter, the problem is restructured to use a simpler, iterative optimization algorithm, with very few free parameters. The warps are refined using an iterative Levenberg-Marquardt minimization to the mean, based on updating the locations of a small number of points and incorporating a stiffness constraint. This optimization approach is efficient, has very few free parameters to tune, and the authors show how to tune the few remaining parameters. Results show that the method reliably aligns various datasets including two facial datasets and two medical datasets of prostate and brain MRI images and demonstrates efficiency in terms of performance and a reduction of the computational cost.
Nanosilica was extracted from rice husk, which was locally collected from the Iraqi mill at Al-Mishikhab district in Najaf Governorate, Iraq. The precipitation method was used to prepared Nanosilica powder from rice husk ash, after treating it thermally at 700°C, followed by dissolving the silica in the alkaline solution and getting a sodium silicate solution. Two samples of the final solution were collected to study the effect of filtration on the purity of the sample by X-ray fluorescence spectrometry (XRF). The result shows that the filtered samples have purity above while the non-filtered sample purity was around The structure analysis investigated by the X-ray diffraction (XRD), found that the Nanosilica powder has an amorphous
... Show More
(20)
(14)
(1)
(1)
(5)
(3)
In this study, a fast block matching search algorithm based on blocks' descriptors and multilevel blocks filtering is introduced. The used descriptors are the mean and a set of centralized low order moments. Hierarchal filtering and MAE similarity measure were adopted to nominate the best similar blocks lay within the pool of neighbor blocks. As next step to blocks nomination the similarity of the mean and moments is used to classify the nominated blocks and put them in one of three sub-pools, each one represents certain nomination priority level (i.e., most, less & least level). The main reason of the introducing nomination and classification steps is a significant reduction in the number of matching instances of the pixels belong to the c
... Show More
(8)
(6)
(19)
(19)
A new algorithm is proposed to compress speech signals using wavelet transform and linear predictive coding. Signal compression based on the concept of selecting a small number of approximation coefficients after they are compressed by the wavelet decomposition (Haar and db4) at a suitable chosen level and ignored details coefficients, and then approximation coefficients are windowed by a rectangular window and fed to the linear predictor. Levinson Durbin algorithm is used to compute LP coefficients, reflection coefficients and predictor error. The compress files contain LP coefficients and previous sample. These files are very small in size compared to the size of the original signals. Compression ratio is calculated from the size of th
... Show MoreIn the present work, pattern recognition is carried out by the contrast and relative variance of clouds. The K-mean clustering process is then applied to classify the cloud type; also, texture analysis being adopted to extract the textural features and using them in cloud classification process. The test image used in the classification process is the Meteosat-7 image for the D3 region.The K-mean method is adopted as an unsupervised classification. This method depends on the initial chosen seeds of cluster. Since, the initial seeds are chosen randomly, the user supply a set of means, or cluster centers in the n-dimensional space.The K-mean cluster has been applied on two bands (IR2 band) and (water vapour band).The textural analysis is used
... Show More
Surveillance cameras are video cameras used for the purpose of observing an area. They are often connected to a recording device or IP network, and may be watched by a security guard or law enforcement officer. In case of location have less percentage of movement (like home courtyard during night); then we need to check whole recorded video to show where and when that motion occur which are wasting in time. So this paper aims at processing the real time video captured by a Webcam to detect motion in the Scene using MATLAB 2012a, with keeping in mind that camera still recorded which means real time detection. The results show accuracy and efficiency in detecting motion