WorldWideScience

Sample records for wavelet-based image registration

  1. Wavelet Based Image Denoising Technique

    Directory of Open Access Journals (Sweden)

    Sachin D Ruikar

    2011-03-01

    Full Text Available This paper proposes different approaches of wavelet based image denoising methods. The search for efficient image denoising methods is still a valid challenge at the crossing of functional analysis and statistics. In spite of the sophistication of the recently proposed methods, most algorithms have not yet attained a desirable level of applicability. Wavelet algorithms are useful tool for signal processing such as image compression and denoising. Multi wavelets can be considered as an extension of scalar wavelets. The main aim is to modify the wavelet coefficients in the new basis, the noise can be removed from the data. In this paper, we extend the existing technique and providing a comprehensive evaluation of the proposed method. Results based on different noise, such as Gaussian, Poisson’s, Salt and Pepper, and Speckle performed in this paper. A signal to noise ratio as a measure of the quality of denoising was preferred.

  2. Wavelet based free-form deformations for nonrigid registration

    NARCIS (Netherlands)

    W. Sun (William); W.J. Niessen (Wiro); S.K. Klein (Stefan)

    2014-01-01

    textabstractIn nonrigid registration, deformations may take place on the coarse and fine scales. For the conventional B-splines based free-form deformation (FFD) registration, these coarse- and fine-scale deformations are all represented by basis functions of a single scale. Meanwhile, wavelets have

  3. A Speckle Reduction Filter Using Wavelet-Based Methods for Medical Imaging Application

    Science.gov (United States)

    2001-10-25

    A Speckle Reduction Filter using Wavelet-Based Methods for Medical Imaging Application Su...Wavelet-Based Methods for Medical Imaging Application Contract Number Grant Number Program Element Number Author(s) Project Number Task Number Work

  4. Embedded Zero -Tree Wavelet Based Image Steganography

    OpenAIRE

    Vijendra Rai; Jaishree Jain; Ajay Kr. Yadav; Sheshmani Yadav

    2012-01-01

    Image steganography using Discrete Wavelet Transform can attain very good results as compared to traditional methods, in this paper we discuss a method to embed digital watermark based on modifying frequency coefficient in discrete wavelet transform (DWT) domain. This method uses the embedded zero-tree (EZW) algorithm to insert a watermark in discrete wavelet transform domain. EZW is an effective image compression algorithm, having property that image in the bit stream are generated in order...

  5. Wavelet-Based Denoising Attack on Image Watermarking

    Institute of Scientific and Technical Information of China (English)

    XUAN Jian-hui; WANG Li-na; ZHANG Huan-guo

    2005-01-01

    In this paper, we propose wavelet-based denoising attack methods on image watermarking in discrete cosine transform (DCT) or discrete Fourier transform (DFT) domain or discrete wavelet transform (DWT) domain. Wiener filtering based on wavelet transform is performed in approximation subband to remove DCT or DFT domain watermark,and adaptive wavelet soft thresholding is employed to remove the watermark resided in detail subbands of DWT domain.

  6. Wavelet based hierarchical coding scheme for radar image compression

    Science.gov (United States)

    Sheng, Wen; Jiao, Xiaoli; He, Jifeng

    2007-12-01

    This paper presents a wavelet based hierarchical coding scheme for radar image compression. Radar signal is firstly quantized to digital signal, and reorganized as raster-scanned image according to radar's repeated period frequency. After reorganization, the reformed image is decomposed to image blocks with different frequency band by 2-D wavelet transformation, each block is quantized and coded by the Huffman coding scheme. A demonstrating system is developed, showing that under the requirement of real time processing, the compression ratio can be very high, while with no significant loss of target signal in restored radar image.

  7. Discrete directional wavelet bases for image compression

    Science.gov (United States)

    Dragotti, Pier L.; Velisavljevic, Vladan; Vetterli, Martin; Beferull-Lozano, Baltasar

    2003-06-01

    The application of the wavelet transform in image processing is most frequently based on a separable construction. Lines and columns in an image are treated independently and the basis functions are simply products of the corresponding one dimensional functions. Such method keeps simplicity in design and computation, but is not capable of capturing properly all the properties of an image. In this paper, a new truly separable discrete multi-directional transform is proposed with a subsampling method based on lattice theory. Alternatively, the subsampling can be omitted and this leads to a multi-directional frame. This transform can be applied in many areas like denoising, non-linear approximation and compression. The results on non-linear approximation and denoising show very interesting gains compared to the standard two-dimensional analysis.

  8. Wavelet-based image compression using fixed residual value

    Science.gov (United States)

    Muzaffar, Tanzeem; Choi, Tae-Sun

    2000-12-01

    Wavelet based compression is getting popular due to its promising compaction properties at low bitrate. Zerotree wavelet image coding scheme efficiently exploits multi-level redundancy present in transformed data to minimize coding bits. In this paper, a new technique is proposed to achieve high compression by adding new zerotree and significant symbols to original EZW coder. Contrary to four symbols present in basic EZW scheme, modified algorithm uses eight symbols to generate fewer bits for a given data. Subordinate pass of EZW is eliminated and replaced with fixed residual value transmission for easy implementation. This modification simplifies the coding technique as well and speeds up the process, retaining the property of embeddedness.

  9. Wavelet-based Image Compression using Subband Threshold

    Science.gov (United States)

    Muzaffar, Tanzeem; Choi, Tae-Sun

    2002-11-01

    Wavelet based image compression has been a focus of research in recent days. In this paper, we propose a compression technique based on modification of original EZW coding. In this lossy technique, we try to discard less significant information in the image data in order to achieve further compression with minimal effect on output image quality. The algorithm calculates weight of each subband and finds the subband with minimum weight in every level. This minimum weight subband in each level, that contributes least effect during image reconstruction, undergoes a threshold process to eliminate low-valued data in it. Zerotree coding is done next on the resultant output for compression. Different values of threshold were applied during experiment to see the effect on compression ratio and reconstructed image quality. The proposed method results in further increase in compression ratio with negligible loss in image quality.

  10. Wavelet-based gray-level digital image watermarking

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    The watermarking technique has been proposed as a method by hiding secret information into the im age 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. Thedifferent 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).

  11. Adaptive Image Transmission Scheme over Wavelet-Based OFDM System

    Institute of Scientific and Technical Information of China (English)

    GAOXinying; YUANDongfeng; ZHANGHaixia

    2005-01-01

    In this paper an adaptive image transmission scheme is proposed over Wavelet-based OFDM (WOFDM) system with Unequal error protection (UEP) by the design of non-uniform signal constellation in MLC. Two different data division schemes: byte-based and bitbased, are analyzed and compared. Different bits are protected unequally according to their different contribution to the image quality in bit-based data division scheme, which causes UEP combined with this scheme more powerful than that with byte-based scheme. Simulation results demonstrate that image transmission by UEP with bit-based data division scheme presents much higher PSNR values and surprisingly better image quality. Furthermore, by considering the tradeoff of complexity and BER performance, Haar wavelet with the shortest compactly supported filter length is the most suitable one among orthogonal Daubechies wavelet series in our proposed system.

  12. Wavelet-Based Diffusion Approach for DTI Image Restoration

    Institute of Scientific and Technical Information of China (English)

    ZHANG Xiang-fen; CHEN Wu-fan; TIAN Wei-feng; YE Hong

    2008-01-01

    The Rician noise introduced into the diffusion tensor images (DTIs) can bring serious impacts on tensor calculation and fiber tracking. To decrease the effects of the Rician noise, we propose to consider the wavelet-based diffusion method to denoise multichannel typed diffusion weighted (DW) images. The presented smoothing strategy, which utilizes anisotropic nonlinear diffusion in wavelet domain, successfully removes noise while preserving both texture and edges. To evaluate quantitatively the efficiency of the presented method in accounting for the Rician noise introduced into the DW images, the peak-to-peak signal-to-noise ratio (PSNR) and signal-to-mean squared error ratio (SMSE) metrics are adopted. Based on the synthetic and real data, we calculated the apparent diffusion coefficient (ADC) and tracked the fibers. We made comparisons between the presented model,the wave shrinkage and regularized nonlinear diffusion smoothing method. All the experiment results prove quantitatively and visually the better performance of the presented filter.

  13. Adaptively wavelet-based image denoising algorithm with edge preserving

    Institute of Scientific and Technical Information of China (English)

    Yihua Tan; Jinwen Tian; Jian Liu

    2006-01-01

    @@ A new wavelet-based image denoising algorithm, which exploits the edge information hidden in the corrupted image, is presented. Firstly, a canny-like edge detector identifies the edges in each subband.Secondly, multiplying the wavelet coefficients in neighboring scales is implemented to suppress the noise while magnifying the edge information, and the result is utilized to exclude the fake edges. The isolated edge pixel is also identified as noise. Unlike the thresholding method, after that we use local window filter in the wavelet domain to remove noise in which the variance estimation is elaborated to utilize the edge information. This method is adaptive to local image details, and can achieve better performance than the methods of state of the art.

  14. Majorization-minimization algorithms for wavelet-based image restoration.

    Science.gov (United States)

    Figueiredo, Mário A T; Bioucas-Dias, José M; Nowak, Robert D

    2007-12-01

    Standard formulations of image/signal deconvolution under wavelet-based priors/regularizers lead to very high-dimensional optimization problems involving the following difficulties: the non-Gaussian (heavy-tailed) wavelet priors lead to objective functions which are nonquadratic, usually nondifferentiable, and sometimes even nonconvex; the presence of the convolution operator destroys the separability which underlies the simplicity of wavelet-based denoising. This paper presents a unified view of several recently proposed algorithms for handling this class of optimization problems, placing them in a common majorization-minimization (MM) framework. One of the classes of algorithms considered (when using quadratic bounds on nondifferentiable log-priors) shares the infamous "singularity issue" (SI) of "iteratively reweighted least squares" (IRLS) algorithms: the possibility of having to handle infinite weights, which may cause both numerical and convergence issues. In this paper, we prove several new results which strongly support the claim that the SI does not compromise the usefulness of this class of algorithms. Exploiting the unified MM perspective, we introduce a new algorithm, resulting from using l1 bounds for nonconvex regularizers; the experiments confirm the superior performance of this method, when compared to the one based on quadratic majorization. Finally, an experimental comparison of the several algorithms, reveals their relative merits for different standard types of scenarios.

  15. Wavelet-based zerotree coding of aerospace images

    Science.gov (United States)

    Franques, Victoria T.; Jain, Vijay K.

    1996-06-01

    This paper presents a wavelet based image coding method achieving high levels of compression. A multi-resolution subband decomposition system is constructed using Quadrature Mirror Filters. Symmetric extension and windowing of the multi-scaled subbands are incorporated to minimize the boundary effects. Next, the Embedded Zerotree Wavelet coding algorithm is used for data compression method. Elimination of the isolated zero symbol, for certain subbands, leads to an improved EZW algorithm. Further compression is obtained with an adaptive arithmetic coder. We achieve a PSNR of 26.91 dB at a bit rate of 0.018, 35.59 dB at a bit rate of 0.149, and 43.05 dB at 0.892 bits/pixel for the aerospace image, Refuel.

  16. Research on Wavelet-Based Algorithm for Image Contrast Enhancement

    Institute of Scientific and Technical Information of China (English)

    Wu Ying-qian; Du Pei-jun; Shi Peng-fei

    2004-01-01

    A novel wavelet-based algorithm for image enhancement is proposed in the paper. On the basis of multiscale analysis, the proposed algorithm solves efficiently the problem of noise over-enhancement, which commonly occurs in the traditional methods for contrast enhancement. The decomposed coefficients at same scales are processed by a nonlinear method, and the coefficients at different scales are enhanced in different degree. During the procedure, the method takes full advantage of the properties of Human visual system so as to achieve better performance. The simulations demonstrate that these characters of the proposed approach enable it to fully enhance the content in images, to efficiently alleviate the enhancement of noise and to achieve much better enhancement effect than the traditional approaches.

  17. Image Denoising of Wavelet based Compressed Images Corrupted by Additive White Gaussian Noise

    Directory of Open Access Journals (Sweden)

    Shyam Lal

    2012-08-01

    Full Text Available In this study an efficient algorithm is proposed for removal of additive white Gaussian noise from compressed natural images in wavelet based domain. First, the natural image is compressed by discrete wavelet transform and then proposed hybrid filter is applied for image denoising of compressed images corrupted by Additive White Gaussian Noise (AWGN. The proposed hybrid filter (HMCD is combination of non-linear fourth order partial differential equation and bivariate shrinkage function. The proposed hybrid filter provides better results in term of noise suppression with keeping minimum edge blurring as compared to other existing image denoising techniques for wavelet based compressed images. Simulation and experimental results on benchmark test images demonstrate that the proposed hybrid filter attains competitive image denoising performances as compared with other state-of-the-art image denoising algorithms. It is more effective particularly for the highly corrupted images in wavelet based compressed domain.

  18. The Boundary Processing of Wavelet Based Image Compression

    Institute of Scientific and Technical Information of China (English)

    Yu Sheng-sheng; He Xiao-cheng; Zhou Jing-li; Chen Jia-zhong

    2004-01-01

    When an image, which is decomposed by bi-orthogonal wavelet bases, is reconstructed, some information will be lost at the four edges of the image. At the same time,artificial discontinuities will be introduced. We use a method called symmetric extension to solve the problem. We only consider the case of the two-band filter banks, and the results can be applied to M-band filter banks. There are only two types of symmetric extension in analysis phrase, namely the whole-sample symmetry (WS), the half-sample symmetry (HS), while there are four types of symmetric extension in synthesis phrase, namely the WS, HS, the whole-sample an-ti-symmetry (WA), and the half-sample anti-symmetry (HA) respcctively. We can select the exact type according to the image length and the filter length, and we will show how to do these. The image can be perfectly reconstructed without any edge effects in this way. Finally, simulation results are reported.

  19. Image registration

    CERN Document Server

    Goshtasby, A Ardeshir

    2012-01-01

    This book presents a thorough and detailed guide to image registration, outlining the principles and reviewing state-of-the-art tools and methods. The book begins by identifying the components of a general image registration system, and then describes the design of each component using various image analysis tools. The text reviews a vast array of tools and methods, not only describing the principles behind each tool and method, but also measuring and comparing their performances using synthetic and real data. Features: discusses similarity/dissimilarity measures, point detectors, feature extr

  20. Image superresolution of cytology images using wavelet based patch search

    Science.gov (United States)

    Vargas, Carlos; García-Arteaga, Juan D.; Romero, Eduardo

    2015-01-01

    Telecytology is a new research area that holds the potential of significantly reducing the number of deaths due to cervical cancer in developing countries. This work presents a novel super-resolution technique that couples high and low frequency information in order to reduce the bandwidth consumption of cervical image transmission. The proposed approach starts by decomposing into wavelets the high resolution images and transmitting only the lower frequency coefficients. The transmitted coefficients are used to reconstruct an image of the original size. Additional details are added by iteratively replacing patches of the wavelet reconstructed image with equivalent high resolution patches from a previously acquired image database. Finally, the original transmitted low frequency coefficients are used to correct the final image. Results show a higher signal to noise ratio in the proposed method over simply discarding high frequency wavelet coefficients or replacing directly down-sampled patches from the image-database.

  1. Fusion of Thresholding Rules During Wavelet-Based Noisy Image Compression

    Directory of Open Access Journals (Sweden)

    Bekhtin Yury

    2016-01-01

    Full Text Available The new method for combining semisoft thresholding rules during wavelet-based data compression of images with multiplicative noise is suggested. The method chooses the best thresholding rule and the threshold value using the proposed criteria which provide the best nonlinear approximations and take into consideration errors of quantization. The results of computer modeling have shown that the suggested method provides relatively good image quality after restoration in the sense of some criteria such as PSNR, SSIM, etc.

  2. Mass preserving image registration

    DEFF Research Database (Denmark)

    Gorbunova, Vladlena; Sporring, Jon; Lo, Pechin Chien Pau

    2010-01-01

    The paper presents results the mass preserving image registration method in the Evaluation of Methods for Pulmonary Image Registration 2010 (EMPIRE10) Challenge. The mass preserving image registration algorithm was applied to the 20 image pairs. Registration was evaluated using four different...

  3. Wavelet-based Image Enhancement Using Fourth Order PDE

    DEFF Research Database (Denmark)

    Nadernejad, Ehsan; Forchhammer, Søren

    2011-01-01

    The presence of noise interference signal may cause problems in signal and image analysis; hence signal and image de-noising is often used as a preprocessing stage in many signal processing applications. In this paper, a new method is presented for image de-noising based on fourth order partial...... differential equations (PDEs) and wavelet transform. In the existing wavelet thresholding methods, the final noise reduced image has limited improvement. It is due to keeping the approximate coefficients of the image unchanged. These coefficients have the main information of the image. Since noise affects both...... indicate superiority of the proposed method over the existing waveletbased image de-noising, anisotropic diffusion, and wiener filtering techniques....

  4. A New Wavelet-Based Document Image Segmentation Scheme

    Institute of Scientific and Technical Information of China (English)

    赵健; 李道京; 俞卞章; 耿军平

    2002-01-01

    The document image segmentation is very useful for printing, faxing and data processing. An algorithm is developed for segmenting and classifying document image. Feature used for classification is based on the histogram distribution pattern of different image classes. The important attribute of the algorithm is using wavelet correlation image to enhance raw image's pattern, so the classification accuracy is improved. In this paper document image is divided into four types: background, photo, text and graph. Firstly, the document image background has been distingusished easily by former normally method; secondly, three image types will be distinguished by their typical histograms, in order to make histograms feature clearer, each resolution' s HH wavelet subimage is used to add to the raw image at their resolution. At last, the photo, text and praph have been devided according to how the feature fit to the Laplacian distrbution by -X2 and L. Simulations show that classification accuracy is significantly improved. The comparison with related shows that our algorithm provides both lower classification error rates and better visual results.

  5. A wavelet-based quadtree driven stereo image coding

    Science.gov (United States)

    Bensalma, Rafik; Larabi, Mohamed-Chaker

    2009-02-01

    In this work, a new stereo image coding technique is proposed. The new approach integrates the coding of the residual image with the disparity map. The latter computed in the wavelet transform domain. The motivation behind using this transform is that it imitates some properties of the human visual system (HVS), particularly, the decomposition in the perspective canals. Therefore, using the wavelet transform allows for better perceptual image quality preservation. In order to estimate the disparity map, we used a quadtree segmentation in each wavelet frequency band. This segmentation has the advantage of minimizing the entropy. Dyadic squares in the subbands of target image that they are not matched with other in the reference image constitutes the residuals are coded by using an arithmetic codec. The obtained results are evaluated by using the SSIM and PSNR criteria.

  6. Target Identification Using Harmonic Wavelet Based ISAR Imaging

    Science.gov (United States)

    Shreyamsha Kumar, B. K.; Prabhakar, B.; Suryanarayana, K.; Thilagavathi, V.; Rajagopal, R.

    2006-12-01

    A new approach has been proposed to reduce the computations involved in the ISAR imaging, which uses harmonic wavelet-(HW) based time-frequency representation (TFR). Since the HW-based TFR falls into a category of nonparametric time-frequency (T-F) analysis tool, it is computationally efficient compared to parametric T-F analysis tools such as adaptive joint time-frequency transform (AJTFT), adaptive wavelet transform (AWT), and evolutionary AWT (EAWT). Further, the performance of the proposed method of ISAR imaging is compared with the ISAR imaging by other nonparametric T-F analysis tools such as short-time Fourier transform (STFT) and Choi-Williams distribution (CWD). In the ISAR imaging, the use of HW-based TFR provides similar/better results with significant (92%) computational advantage compared to that obtained by CWD. The ISAR images thus obtained are identified using a neural network-based classification scheme with feature set invariant to translation, rotation, and scaling.

  7. Compression of Ultrasonic NDT Image by Wavelet Based Local Quantization

    Science.gov (United States)

    Cheng, W.; Li, L. Q.; Tsukada, K.; Hanasaki, K.

    2004-02-01

    Compression on ultrasonic image that is always corrupted by noise will cause `over-smoothness' or much distortion. To solve this problem to meet the need of real time inspection and tele-inspection, a compression method based on Discrete Wavelet Transform (DWT) that can also suppress the noise without losing much flaw-relevant information, is presented in this work. Exploiting the multi-resolution and interscale correlation property of DWT, a simple way named DWCs classification, is introduced first to classify detail wavelet coefficients (DWCs) as dominated by noise, signal or bi-effected. A better denoising can be realized by selective thresholding DWCs. While in `Local quantization', different quantization strategies are applied to the DWCs according to their classification and the local image property. It allocates the bit rate more efficiently to the DWCs thus achieve a higher compression rate. Meanwhile, the decompressed image shows the effects of noise suppressed and flaw characters preserved.

  8. Wavelet-based pavement image compression and noise reduction

    Science.gov (United States)

    Zhou, Jian; Huang, Peisen S.; Chiang, Fu-Pen

    2005-08-01

    For any automated distress inspection system, typically a huge number of pavement images are collected. Use of an appropriate image compression algorithm can save disk space, reduce the saving time, increase the inspection distance, and increase the processing speed. In this research, a modified EZW (Embedded Zero-tree Wavelet) coding method, which is an improved version of the widely used EZW coding method, is proposed. This method, unlike the two-pass approach used in the original EZW method, uses only one pass to encode both the coordinates and magnitudes of wavelet coefficients. An adaptive arithmetic encoding method is also implemented to encode four symbols assigned by the modified EZW into binary bits. By applying a thresholding technique to terminate the coding process, the modified EZW coding method can compress the image and reduce noise simultaneously. The new method is much simpler and faster. Experimental results also show that the compression ratio was increased one and one-half times compared to the EZW coding method. The compressed and de-noised data can be used to reconstruct wavelet coefficients for off-line pavement image processing such as distress classification and quantification.

  9. Wavelet-based texture image classification using vector quantization

    Science.gov (United States)

    Lam, Eric P.

    2007-02-01

    Classification of image segments on textures can be helpful for target recognition. Sometimes target cueing is performed before target recognition. Textures are sometimes used to cue an image processor of a potential region of interest. In certain imaging sensors, such as those used in synthetic aperture radar, textures may be abundant. The textures may be caused by the object material or speckle noise. Even speckle noise can create the illusion of texture, which must be compensated in image pre-processing. In this paper, we will discuss how to perform texture classification but constrain the number of wavelet packet node decomposition. The new approach performs a twochannel wavelet decomposition. Comparing the strength of each new subband with others at the same level of the wavelet packet determines when to stop further decomposition. This type of decomposition is performed recursively. Once the decompositions stop, the structure of the packet is stored in a data structure. Using the information from the data structure, dominating channels are extracted. These are defined as paths from the root of the packet to the leaf with the highest strengths. The list of dominating channels are used to train a learning vector quantization neural network.

  10. Wavelet-based image coding using saliency map

    Science.gov (United States)

    Vargic, Radoslav; Kučerová, Júlia; Polec, Jaroslav

    2016-11-01

    Visual information is very important in human perceiving of the surrounding world. During the observation of the considered scene, some image parts are more salient than others. This fact is conventionally addressed using the regions of interest approach. We are presenting an approach that captures the saliency information per pixel basis using one continuous saliency map for a whole image and which is directly used in the lossy image compression algorithm. Although for the encoding/decoding part of the algorithm, the notion region is not necessary anymore; the resulting method can, due to its nature, efficiently emulate large amounts of regions of interest with various significance. We provide reference implementation of this approach based on the set partitioning in hierarchical trees (SPIHT) algorithm and show that the proposed method is effective and has potential to achieve significantly better results in comparison to the original SPIHT algorithm. The approach is not limited to SPIHT algorithm and can be coupled with, e.g., JPEG 2000 as well.

  11. JND measurements and wavelet-based image coding

    Science.gov (United States)

    Shen, Day-Fann; Yan, Loon-Shan

    1998-06-01

    Two major issues in image coding are the effective incorporation of human visual system (HVS) properties and the effective objective measure for evaluating image quality (OQM). In this paper, we treat the two issues in an integrated fashion. We build a JND model based on the measurements of the JND (Just Noticeable Difference) property of HVS. We found that JND does not only depend on the background intensity but also a function of both spatial frequency and patten direction. Wavelet transform, due to its excellent simultaneous Time (space)/frequency resolution, is the best choice to apply the JND model. We mathematically derive an OQM called JND_PSNR that is based on the JND property and wavelet decomposed subbands. JND_PSNR is more consistent with human perception and is recommended as an alternative to the PSNR or SNR. With the JND_PSNR in mind, we proceed to propose a wavelet and JND based codec called JZW. JZW quantizes coefficients in each subband with proper step size according to the subband's importance to human perception. Many characteristics of JZW are discussed, its performance evaluated and compared with other famous algorithms such as EZW, SPIHT and TCCVQ. Our algorithm has 1 - 1.5 dB gain over SPIHT even when we use simple Huffman coding rather than the more efficient adaptive arithmetic coding.

  12. Wavelet-Based Digital Image Fusion on Reconfigurable FPGA Using Handel-C Language

    Directory of Open Access Journals (Sweden)

    Dr. G. Mohan

    2013-07-01

    Full Text Available Field Programmable Gate Array (FPGA technology has become a viable target for the implementation of real time algorithms in different fusion methods have been proposed mainly in the fields of remote sensing and computer vision. Image fusion is basically a process where multiple images (more than one are combined to form a single resultant fused image. This fused image is more productive as compared to its original input images. In most paper image fusion algorithms were implemented in simulation level only. In this paper Wavelet based Image fusion algorithm is employed and implemented on a Field-Programmable-Gate-Array-based hardware system using a Xilinx Platform Studio EDK 11.1 FPGA Spartan 3E is implemented. The FPGA technologies offer basic digital blocks with flexible interconnections to achieve high speed digital hardware realization. The FPGA consists of a system of logic blocks, such as Look up Tables, gates, or flip-flops and some amount of memory. The algorithm will be transferred from computer to FPGA board using JTAG cable. In this proposed work algorithm is developed by using Handle –C language to performing wavelet based image fusion. The result will be transferred back to system to analyze hardware resource taken by FPGA

  13. A data-distributed parallel algorithm for wavelet-based fusion of remote sensing images

    Institute of Scientific and Technical Information of China (English)

    YANG Xuejun; WANG Panfeng; DU Yunfei; ZHOU Haifang

    2007-01-01

    With the increasing importance of multiplatform remote sensing missions,the fast integration or fusion of digital images from disparate sources has become critical to the success of these endeavors.In this paper,to speed up the fusion process,a Data-distributed Parallel Algorithm for wavelet-based Fusion (DPAF for short) of remote sensing images which are not geo-registered remote sensing images is presented for the first time.To overcome the limitations on memory space as well as the computing capability of a single processor,data distribution,data-parallel processing and load balancing techniques are integrated into DPAF.To avoid the inherent communication overhead of a wavelet-based fusion method,a special design called redundant partitioning is used,which is inspired by the characteristics of wavelet transform.Finally,DPAF is evaluated in theory and tested on a 32-CPU cluster of workstations.The experimental results show that our algorithm has good parallel performance and scalability.

  14. Optimum wavelet based masking for the contrast enhancement of medical images using enhanced cuckoo search algorithm.

    Science.gov (United States)

    Daniel, Ebenezer; Anitha, J

    2016-04-01

    Unsharp masking techniques are a prominent approach in contrast enhancement. Generalized masking formulation has static scale value selection, which limits the gain of contrast. In this paper, we propose an Optimum Wavelet Based Masking (OWBM) using Enhanced Cuckoo Search Algorithm (ECSA) for the contrast improvement of medical images. The ECSA can automatically adjust the ratio of nest rebuilding, using genetic operators such as adaptive crossover and mutation. First, the proposed contrast enhancement approach is validated quantitatively using Brain Web and MIAS database images. Later, the conventional nest rebuilding of cuckoo search optimization is modified using Adaptive Rebuilding of Worst Nests (ARWN). Experimental results are analyzed using various performance matrices, and our OWBM shows improved results as compared with other reported literature.

  15. A NOVEL BIOMETRICS TRIGGERED WATERMARKING OF IMAGES BASED ON WAVELET BASED CONTOURLET TRANSFORM

    Directory of Open Access Journals (Sweden)

    Elakkiya Soundar

    2013-01-01

    Full Text Available The rapid development of network and digital technology has led to several issues to the digital content. The technical solution to provide law enforcement and copyright protection is achieved by digital watermarking Digital watermarking is the process of embedding information into a digital image in a way that is difficult to remove. The proposed method contains following phases (i Pre-processing of biometric image (ii key generation from the biometrics of the owner/user and randomization of the host image using Speeded-Up Robust Features (SURF (iii Wavelet-Based Contourlet Transform (WBCT is applied on the host image. The WBCT can give the anisotropy optimal representation of the edges and contours in the image by virtue of the characteristics of multi-scale framework and multi-directionality (iv Singular Value Decomposition (SVD is enforced over the watermark image (v Embedding of the host image with the watermark image. The comparative analysis confirms the efficiency and robustness of the proposed system Index Terms— Digital Watermarking, copyright, Pre-processing, wavelet, Speeded-Up Robust Features.

  16. A new approach to pre-processing digital image for wavelet-based watermark

    Science.gov (United States)

    Agreste, Santa; Andaloro, Guido

    2008-11-01

    The growth of the Internet has increased the phenomenon of digital piracy, in multimedia objects, like software, image, video, audio and text. Therefore it is strategic to individualize and to develop methods and numerical algorithms, which are stable and have low computational cost, that will allow us to find a solution to these problems. We describe a digital watermarking algorithm for color image protection and authenticity: robust, not blind, and wavelet-based. The use of Discrete Wavelet Transform is motivated by good time-frequency features and a good match with Human Visual System directives. These two combined elements are important for building an invisible and robust watermark. Moreover our algorithm can work with any image, thanks to the step of pre-processing of the image that includes resize techniques that adapt to the size of the original image for Wavelet transform. The watermark signal is calculated in correlation with the image features and statistic properties. In the detection step we apply a re-synchronization between the original and watermarked image according to the Neyman-Pearson statistic criterion. Experimentation on a large set of different images has been shown to be resistant against geometric, filtering, and StirMark attacks with a low rate of false alarm.

  17. Wavelet-Based Mixed-Resolution Coding Approach Incorporating with SPT for the Stereo Image

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    With the advances of display technology, three-dimensional(3-D) imaging systems are becoming increasingly popular. One way of stimulating 3-D perception is to use stereo pairs, a pair of images of the same scene acquired from different perspectives. Since there is an inherent redundancy between the images of a stereo pairs, data compression algorithms should be employed to represent stereo pairs efficiently. The proposed techniques generally use blockbased disparity compensation. In order to get the higher compression ratio, this paper employs the wavelet-based mixed-resolution coding technique to incorporate with SPT-based disparity-compensation to compress the stereo image data. The mixed-resolution coding is a perceptually justified technique that is achieved by presenting one eye with a low-resolution image and the other with a high-resolution image. Psychophysical experiments show that the stereo image pairs with one high-resolution image and one low-resolution image provide almost the same stereo depth to that of a stereo image with two high-resolution images. By combining the mixed-resolution coding and SPT-based disparity-compensation techniques, one reference (left) high-resolution image can be compressed by a hierarchical wavelet transform followed by vector quantization and Huffman encoder. After two level wavelet decompositions, for the lowresolution right image and low-resolution left image, subspace projection technique using the fixed block size disparity compensation estimation is used. At the decoder, the low-resolution right subimage is estimated using the disparity from the low-resolution left subimage. A full-size reconstruction is obtained by upsampling a factor of 4 and reconstructing with the synthesis low pass filter. Finally, experimental results are presented, which show that our scheme achieves a PSNR gain (about 0.92dB) as compared to the current block-based disparity compensation coding techniques.``

  18. Wavelet-Based Visible and Infrared Image Fusion: A Comparative Study

    Directory of Open Access Journals (Sweden)

    Angel D. Sappa

    2016-06-01

    Full Text Available This paper evaluates different wavelet-based cross-spectral image fusion strategies adopted to merge visible and infrared images. The objective is to find the best setup independently of the evaluation metric used to measure the performance. Quantitative performance results are obtained with state of the art approaches together with adaptations proposed in the current work. The options evaluated in the current work result from the combination of different setups in the wavelet image decomposition stage together with different fusion strategies for the final merging stage that generates the resulting representation. Most of the approaches evaluate results according to the application for which they are intended for. Sometimes a human observer is selected to judge the quality of the obtained results. In the current work, quantitative values are considered in order to find correlations between setups and performance of obtained results; these correlations can be used to define a criteria for selecting the best fusion strategy for a given pair of cross-spectral images. The whole procedure is evaluated with a large set of correctly registered visible and infrared image pairs, including both Near InfraRed (NIR and Long Wave InfraRed (LWIR.

  19. Selective error detection for error-resilient wavelet-based image coding.

    Science.gov (United States)

    Karam, Lina J; Lam, Tuyet-Trang

    2007-12-01

    This paper introduces the concept of a similarity check function for error-resilient multimedia data transmission. The proposed similarity check function provides information about the effects of corrupted data on the quality of the reconstructed image. The degree of data corruption is measured by the similarity check function at the receiver, without explicit knowledge of the original source data. The design of a perceptual similarity check function is presented for wavelet-based coders such as the JPEG2000 standard, and used with a proposed "progressive similarity-based ARQ" (ProS-ARQ) scheme to significantly decrease the retransmission rate of corrupted data while maintaining very good visual quality of images transmitted over noisy channels. Simulation results with JPEG2000-coded images transmitted over the Binary Symmetric Channel, show that the proposed ProS-ARQ scheme significantly reduces the number of retransmissions as compared to conventional ARQ-based schemes. The presented results also show that, for the same number of retransmitted data packets, the proposed ProS-ARQ scheme can achieve significantly higher PSNR and better visual quality as compared to the selective-repeat ARQ scheme.

  20. A novel wavelet based approach for near lossless image compression using modified duplicate free run length coding

    Directory of Open Access Journals (Sweden)

    Pacha Sreenivasulu

    2014-12-01

    Full Text Available In this paper we are presenting a three-stage near lossless image compression scheme. It belongs to the class of lossless coding which consists of wavelet based decomposition followed by modified duplicate free run-length coding. We go for the selection of optimum bit rate to guarantee minimum MSE (mean square error, high PSNR (peak signal to noise ratio and also ensure that time required for computation is very less unlike other compression schemes. Hence we propose 'A wavelet based novel approach for near lossless image compression'. Which is very much useful for real time applications and is also compared with EZW, SPIHT, SOFM and the proposed method is out performed.

  1. Incorporation of wavelet-based denoising in iterative deconvolution for partial volume correction in whole-body PET imaging

    Energy Technology Data Exchange (ETDEWEB)

    Boussion, N.; Cheze Le Rest, C.; Hatt, M.; Visvikis, D. [INSERM, U650, Laboratoire de Traitement de l' Information Medicale (LaTIM) CHU MORVAN, Brest (France)

    2009-07-15

    Partial volume effects (PVEs) are consequences of the limited resolution of emission tomography. The aim of the present study was to compare two new voxel-wise PVE correction algorithms based on deconvolution and wavelet-based denoising. Deconvolution was performed using the Lucy-Richardson and the Van-Cittert algorithms. Both of these methods were tested using simulated and real FDG PET images. Wavelet-based denoising was incorporated into the process in order to eliminate the noise observed in classical deconvolution methods. Both deconvolution approaches led to significant intensity recovery, but the Van-Cittert algorithm provided images of inferior qualitative appearance. Furthermore, this method added massive levels of noise, even with the associated use of wavelet-denoising. On the other hand, the Lucy-Richardson algorithm combined with the same denoising process gave the best compromise between intensity recovery, noise attenuation and qualitative aspect of the images. The appropriate combination of deconvolution and wavelet-based denoising is an efficient method for reducing PVEs in emission tomography. (orig.)

  2. Registration accuracy and quality of real-life images.

    Directory of Open Access Journals (Sweden)

    Wei-Yen Hsu

    Full Text Available BACKGROUND: A common registration problem for the application of consumer device is to align all the acquired image sequences into a complete scene. Image alignment requires a registration algorithm that will compensate as much as possible for geometric variability among images. However, images captured views from a real scene usually produce different distortions. Some are derived from the optic characteristics of image sensors, and others are caused by the specific scenes and objects. METHODOLOGY/PRINCIPAL FINDINGS: An image registration algorithm considering the perspective projection is proposed for the application of consumer devices in this study. It exploits a multiresolution wavelet-based method to extract significant features. An analytic differential approach is then proposed to achieve fast convergence of point matching. Finally, the registration accuracy is further refined to obtain subpixel precision by a feature-based modified Levenberg-Marquardt method. Due to its feature-based and nonlinear characteristic, it converges considerably faster than most other methods. In addition, vignette compensation and color difference adjustment are also performed to further improve the quality of registration results. CONCLUSIONS/SIGNIFICANCE: The performance of the proposed method is evaluated by testing the synthetic and real images acquired by a hand-held digital still camera and in comparison with two registration techniques in terms of the squared sum of intensity differences (SSD and correlation coefficient (CC. The results indicate that the proposed method is promising in registration accuracy and quality, which are statistically significantly better than other two approaches.

  3. Image registration with uncertainty analysis

    Science.gov (United States)

    Simonson, Katherine M.

    2011-03-22

    In an image registration method, edges are detected in a first image and a second image. A percentage of edge pixels in a subset of the second image that are also edges in the first image shifted by a translation is calculated. A best registration point is calculated based on a maximum percentage of edges matched. In a predefined search region, all registration points other than the best registration point are identified that are not significantly worse than the best registration point according to a predetermined statistical criterion.

  4. Improving quality of medical image compression using biorthogonal CDF wavelet based on lifting scheme and SPIHT coding

    Directory of Open Access Journals (Sweden)

    Beladgham Mohammed

    2011-01-01

    Full Text Available As the coming era is that of digitized medical information, an important challenge to deal with is the storage and transmission requirements of enormous data, including medical images. Compression is one of the indispensable techniques to solve this problem. In this work, we propose an algorithm for medical image compression based on a biorthogonal wavelet transform CDF 9/7 coupled with SPIHT coding algorithm, of which we applied the lifting structure to improve the drawbacks of wavelet transform. In order to enhance the compression by our algorithm, we have compared the results obtained with wavelet based filters bank. Experimental results show that the proposed algorithm is superior to traditional methods in both lossy and lossless compression for all tested images. Our algorithm provides very important PSNR and MSSIM values for MRI images.

  5. A Blind High-Capacity Wavelet-Based Steganography Technique for Hiding Images into other Images

    Directory of Open Access Journals (Sweden)

    HAMAD, S.

    2014-05-01

    Full Text Available The flourishing field of Steganography is providing effective techniques to hide data into different types of digital media. In this paper, a novel technique is proposed to hide large amounts of image data into true colored images. The proposed method employs wavelet transforms to decompose images in a way similar to the Human Visual System (HVS for more secure and effective data hiding. The designed model can blindly extract the embedded message without the need to refer to the original cover image. Experimental results showed that the proposed method outperformed all of the existing techniques not only imperceptibility but also in terms of capacity. In fact, the proposed technique showed an outstanding performance on hiding a secret image whose size equals 100% of the cover image while maintaining excellent visual quality of the resultant stego-images.

  6. Automatic Image Registration of Multi-Modal Remotely Sensed Data with Global Shearlet Features

    Science.gov (United States)

    Murphy, James M.; Le Moigne, Jacqueline; Harding, David J.

    2016-01-01

    Automatic image registration is the process of aligning two or more images of approximately the same scene with minimal human assistance. Wavelet-based automatic registration methods are standard, but sometimes are not robust to the choice of initial conditions. That is, if the images to be registered are too far apart relative to the initial guess of the algorithm, the registration algorithm does not converge or has poor accuracy, and is thus not robust. These problems occur because wavelet techniques primarily identify isotropic textural features and are less effective at identifying linear and curvilinear edge features. We integrate the recently developed mathematical construction of shearlets, which is more effective at identifying sparse anisotropic edges, with an existing automatic wavelet-based registration algorithm. Our shearlet features algorithm produces more distinct features than wavelet features algorithms; the separation of edges from textures is even stronger than with wavelets. Our algorithm computes shearlet and wavelet features for the images to be registered, then performs least squares minimization on these features to compute a registration transformation. Our algorithm is two-staged and multiresolution in nature. First, a cascade of shearlet features is used to provide a robust, though approximate, registration. This is then refined by registering with a cascade of wavelet features. Experiments across a variety of image classes show an improved robustness to initial conditions, when compared to wavelet features alone.

  7. Improving the Performance of Machine Learning Based Multi Attribute Face Recognition Algorithm Using Wavelet Based Image Decomposition Technique

    Directory of Open Access Journals (Sweden)

    S. Sakthivel

    2011-01-01

    Full Text Available Problem statement: Recognizing a face based attributes is an easy task for a human to perform; it is closely automated and requires little mental effort. A computer, on the other hand, has no innate ability to recognize a face or a facial feature and must be programmed with an algorithm to do so. Generally, to recognize a face, different kinds of the facial features were used separately or in a combined manner. In the previous work, we have developed a machine learning based multi attribute face recognition algorithm and evaluated it different set of weights to each input attribute and performance wise it is low compared to proposed wavelet decomposition technique. Approach: In this study, wavelet decomposition technique has been applied as a preprocessing technique to enhance the input face images in order to reduce the loss of classification performance due to changes in facial appearance. The Experiment was specifically designed to investigate the gain in robustness against illumination and facial expression changes. Results: In this study, a wavelet based image decomposition technique has been proposed to enhance the performance by 8.54 percent of the previously designed system. Conclusion: The proposed model has been tested on face images with difference in expression and illumination condition with a dataset obtained from face image databases from Olivetti Research Laboratory.

  8. An RGB Image Encryption Supported by Wavelet-based Lossless Compression

    Directory of Open Access Journals (Sweden)

    Ch. Samson

    2012-09-01

    Full Text Available In this paper we have proposed a method for an RGB image encryption supported by lifting scheme based lossless compression. Firstly we have compressed the input color image using a 2-D integer wavelet transform. Then we have applied lossless predictive coding to achieve additional compression. The compressed image is encrypted by using Secure Advanced Hill Cipher (SAHC involving a pair of involutory matrices, a function called Mix( and an operation called XOR. Decryption followed by reconstruction shows that there is no difference between the output image and the input image. The proposed method can be used for efficient and secure transmission of image data.

  9. Numerical methods for image registration

    CERN Document Server

    Modersitzki, Jan

    2003-01-01

    Based on the author's lecture notes and research, this well-illustrated and comprehensive text is one of the first to provide an introduction to image registration with particular emphasis on numerical methods in medical imaging. Ideal for researchers in industry and academia, it is also a suitable study guide for graduate mathematicians, computer scientists, engineers, medical physicists, and radiologists.Image registration is utilised whenever information obtained from different viewpoints needs to be combined or compared and unwanted distortion needs to be eliminated. For example, CCTV imag

  10. Improving performance of wavelet-based image denoising algorithm using complex diffusion process

    DEFF Research Database (Denmark)

    Nadernejad, Ehsan; Sharifzadeh, Sara; Korhonen, Jari

    2012-01-01

    Image enhancement and de-noising is an essential pre-processing step in many image processing algorithms. In any image de-noising algorithm, the main concern is to keep the interesting structures of the image. Such interesting structures often correspond to the discontinuities (edges......). In this paper, we present a new algorithm for image noise reduction based on the combination of complex diffusion process and wavelet thresholding. In the existing wavelet thresholding methods, the noise reduction is limited, because the approximate coefficients containing the main information of the image...... using a variety of standard images and its performance has been compared against several de-noising algorithms known from the prior art. Experimental results show that the proposed algorithm preserves the edges better and in most cases, improves the measured visual quality of the denoised images...

  11. Radar image registration and rectification

    Science.gov (United States)

    Naraghi, M.; Stromberg, W. D.

    1983-01-01

    Two techniques for radar image registration and rectification are presented. In the registration method, a general 2-D polynomial transform is defined to accomplish the geometric mapping from one image into the other. The degree and coefficients of the polynomial are obtained using an a priori found tiepoint data set. In the second part of the paper, a rectification procedure is developed that models the distortion present in the radar image in terms of the radar sensor's platform parameters and the topographic variations of the imaged scene. This model, the ephemeris data and the digital topographic data are then used in rectifying the radar image. The two techniques are then used in registering and rectifying two examples of radar imagery. Each method is discussed as to its benefits, shortcomings and registration accuracy.

  12. On Decomposing Object Appearance using PCA and Wavelet bases with Applications to Image Segmentation

    DEFF Research Database (Denmark)

    Stegmann, Mikkel Bille; Forchhammer, Søren

    2002-01-01

    Generative models capable of synthesising complete object images have over the past few years proven their worth when interpreting images. Due to the recent development of computational machinery it has become feasible to model the variation of image intensities and landmark positions over the co...

  13. ACIR: automatic cochlea image registration

    Science.gov (United States)

    Al-Dhamari, Ibraheem; Bauer, Sabine; Paulus, Dietrich; Lissek, Friedrich; Jacob, Roland

    2017-02-01

    Efficient Cochlear Implant (CI) surgery requires prior knowledge of the cochlea's size and its characteristics. This information helps to select suitable implants for different patients. To get these measurements, a segmentation method of cochlea medical images is needed. An important pre-processing step for good cochlea segmentation involves efficient image registration. The cochlea's small size and complex structure, in addition to the different resolutions and head positions during imaging, reveals a big challenge for the automated registration of the different image modalities. In this paper, an Automatic Cochlea Image Registration (ACIR) method for multi- modal human cochlea images is proposed. This method is based on using small areas that have clear structures from both input images instead of registering the complete image. It uses the Adaptive Stochastic Gradient Descent Optimizer (ASGD) and Mattes's Mutual Information metric (MMI) to estimate 3D rigid transform parameters. The use of state of the art medical image registration optimizers published over the last two years are studied and compared quantitatively using the standard Dice Similarity Coefficient (DSC). ACIR requires only 4.86 seconds on average to align cochlea images automatically and to put all the modalities in the same spatial locations without human interference. The source code is based on the tool elastix and is provided for free as a 3D Slicer plugin. Another contribution of this work is a proposed public cochlea standard dataset which can be downloaded for free from a public XNAT server.

  14. Robust Wavelet-Based Facial Image Watermarking Against Geometric Attacks Using Coordinate System Recovery

    Institute of Scientific and Technical Information of China (English)

    ZHAO Pei-dong; XIE Jian-ying

    2008-01-01

    A coordinate system of the original image is established using a facial feature point localization technique. After the original image transformed into a new image with the standard coordinate system, a redundant watermark is adaptively embedded in the discrete wavelet transform(DWT) domain based on the statistical characteristics of the wavelet coefficient block. The coordinate system of watermarked image is reestablished as a calibration system. Regardless of the host image rotated, scaled, or translated(RST), all the geometric attacks are eliminated while the watermarked image is transformed into the standard coordinate system. The proposed watermark detection is a blind detection. Experimental results demonstrate the proposed scheme is robust against common and geometric image processing attacks, particularly its robustness against joint geometric attacks.

  15. Wavelet-based improved Chan-Vese model for image segmentation

    Science.gov (United States)

    Zhao, Xiaoli; Zhou, Pucheng; Xue, Mogen

    2016-10-01

    In this paper, a kind of image segmentation approach which based on improved Chan-Vese (CV) model and wavelet transform was proposed. Firstly, one-level wavelet decomposition was adopted to get the low frequency approximation image. And then, the improved CV model, which contains the global term, local term and the regularization term, was utilized to segment the low frequency approximation image, so as to obtain the coarse image segmentation result. Finally, the coarse segmentation result was interpolated into the fine scale as an initial contour, and the improved CV model was utilized again to get the fine scale segmentation result. Experimental results show that our method can segment low contrast images and/or inhomogeneous intensity images more effectively than traditional level set methods.

  16. Wavelet-based method for image filtering using scale-space continuity

    Science.gov (United States)

    Jung, Claudio R.; Scharcanski, Jacob

    2001-04-01

    This paper proposes a novel technique to reduce noise while preserving edge sharpness during image filtering. This method is based on the image multiresolution decomposition by a discrete wavelet transform, given a proper wavelet basis. In the transform spaces, edges are implicitly located and preserved, at the same time that image noise is filtered out. At each resolution level, geometric continuity is used to preserve edges that are not isolated. Finally, we compare consecutive levels to preserve edges having continuity along scales. As a result, the proposed technique produces a filtered version of the original image, where homogeneous regions appear segmented by well-defined edges. Possible applications include image presegmentation and image denoising.

  17. Wavelet Based Intentional Blurring Variance Scheme for Blur Detection in Barcode Images

    Directory of Open Access Journals (Sweden)

    Shamik Tiwari

    2014-05-01

    Full Text Available Blur is an undesirable phenomenon which appears as one of the most frequent causes of image degradation. Automatic blur detection is extremely enviable to restore barcode image or simply utilize them. That is to assess whether a given image is blurred or not. To detect blur, many algorithms have been proposed. These algorithms are different in their performance, time complexity, precision, and robustness in noisy environments. In this paper, we present an efficient method blur detection in barcode images, with no reference perceptual blur metric using wavelets.

  18. Comparison on Integer Wavelet Transforms in Spherical Wavelet Based Image Based Relighting

    Institute of Scientific and Technical Information of China (English)

    WANGZe; LEEYin; LEUNGChising; WONGTientsin; ZHUYisheng

    2003-01-01

    To provide a good quality rendering in the Image based relighting (IBL) system, tremendous reference images under various illumination conditions are needed. Therefore data compression is essential to enable interactive action. And the rendering speed is another crucial consideration for real applications. Based on Spherical wavelet transform (SWT), this paper presents a quick representation method with Integer wavelet transform (IWT) for the IBL system. It focuses on comparison on different IWTs with the Embedded zerotree wavelet (EZW) used in the IBL system. The whole compression procedure contains two major compression steps. Firstly, SWT is applied to consider the correlation among different reference images. Secondly, the SW transformed images are compressed with IWT based image compression approach. Two IWTs are used and good results are showed in the simulations.

  19. A NOVEL BIOMETRICS TRIGGERED WATERMARKING OF IMAGES BASED ON WAVELET BASED CONTOURLET TRANSFORM

    OpenAIRE

    Elakkiya Soundar

    2013-01-01

    The rapid development of network and digital technology has led to several issues to the digital content. The technical solution to provide law enforcement and copyright protection is achieved by digital watermarking Digital watermarking is the process of embedding information into a digital image in a way that is difficult to remove. The proposed method contains following phases (i) Pre-processing of biometric image (ii) key generation from the biometrics of the owner/user and randomization ...

  20. Wavelet-Based Color Pathological Image Watermark through Dynamically Adjusting the Embedding Intensity

    Directory of Open Access Journals (Sweden)

    Guoyan Liu

    2012-01-01

    Full Text Available This paper proposes a new dynamic and robust blind watermarking scheme for color pathological image based on discrete wavelet transform (DWT. The binary watermark image is preprocessed before embedding; firstly it is scrambled by Arnold cat map and then encrypted by pseudorandom sequence generated by robust chaotic map. The host image is divided into n×n blocks, and the encrypted watermark is embedded into the higher frequency domain of blue component. The mean and variance of the subbands are calculated, to dynamically modify the wavelet coefficient of a block according to the embedded 0 or 1, so as to generate the detection threshold. We research the relationship between embedding intensity and threshold and give the effective range of the threshold to extract the watermark. Experimental results show that the scheme can resist against common distortions, especially getting advantage over JPEG compression, additive noise, brightening, rotation, and cropping.

  1. Wavelet-based color pathological image watermark through dynamically adjusting the embedding intensity.

    Science.gov (United States)

    Liu, Guoyan; Liu, Hongjun; Kadir, Abdurahman

    2012-01-01

    This paper proposes a new dynamic and robust blind watermarking scheme for color pathological image based on discrete wavelet transform (DWT). The binary watermark image is preprocessed before embedding; firstly it is scrambled by Arnold cat map and then encrypted by pseudorandom sequence generated by robust chaotic map. The host image is divided into n × n blocks, and the encrypted watermark is embedded into the higher frequency domain of blue component. The mean and variance of the subbands are calculated, to dynamically modify the wavelet coefficient of a block according to the embedded 0 or 1, so as to generate the detection threshold. We research the relationship between embedding intensity and threshold and give the effective range of the threshold to extract the watermark. Experimental results show that the scheme can resist against common distortions, especially getting advantage over JPEG compression, additive noise, brightening, rotation, and cropping.

  2. More efficient ground truth ROI image coding technique :implementation and wavelet based application analysis

    Institute of Scientific and Technical Information of China (English)

    KUMARAYAPA Ajith; ZHANG Ye

    2007-01-01

    In this paper, more efficient, low-complexity and reliable region of interest (ROI) image codec for compressing smooth low texture remote sensing images is proposed. We explore the efficiency of the modified ROI codec with respect to the selected set of convenient wavelet filters, which is a novel method. Such ROI coding experiment analysis representing low bit rate lossy to high quality lossless reconstruction with timing analysis is useful for improving remote sensing ground truth surveillance efficiency in terms of time and quality. The subjective [i.e. fair, five observer (HVS) evaluations using enhanced 3D picture view Hyper memory display technology] and the objective results revealed that for faster ground truth ROI coding applications, the Symlet-4 adaptation performs better than Biorthogonal 4.4 and Biorthogonal 6.8. However, the discrete Meyer wavelet adaptation is the best solution for delayed ROI image reconstructions.

  3. Vector Quantization Techniques For Partial Encryption of Wavelet-based Compressed Digital Images

    Directory of Open Access Journals (Sweden)

    H. A. Younis

    2009-01-01

    Full Text Available The use of image communication has increased in recent years. In this paper, newpartial encryption schemes are used to encrypt only part of the compressed data. Only6.25-25% of the original data is encrypted for four different images, resulting in asignificant reduction in encryption and decryption time. In the compression step, anadvanced clustering analysis technique (Fuzzy C-means (FCM is used. In the encryptionstep, the permutation cipher is used. The effect of number of different clusters is studied.The proposed partial encryption schemes are fast and secure, and do not reduce thecompression performance of the underlying selected compression methods as shown inexperimental results and conclusion.

  4. Improved Wavelet-based Spatial Filter of Damage Imaging Method on Composite Structures

    Institute of Scientific and Technical Information of China (English)

    WANG Yu; YUAN Shenfang; QIU Lei

    2011-01-01

    Piezoelectric sensor array-based spatial filter technology is a new promising method presented in research area of structural health monitoring(SHM)in the recent years.To apply this method to composite structures and give the actual position of damage,this paper proposes a spatial filter-based damage imaging method improved by complex Shannon wavelet transform.The basic principle of spatial filter is analyzed first.Then,this paper proposes a method of using complex Shannon wavelet transform to construct analytic signals of time domain signals of PZT sensors array.The analytic signals are synthesized depending on the principle of the spatial filter to give a damage imaging in the form of angle-time.A method of converting the damage imaging to the form of angle-distance is discussed.Finally,an aircraft composite oil tank is adopted to validate the damage imaging method.The validating results show that this method can recognize angle and distance of damage successfully.

  5. Wavelet-based SAR images despeckling using joint hidden Markov model

    Science.gov (United States)

    Li, Qiaoliang; Wang, Guoyou; Liu, Jianguo; Chen, Shaobo

    2007-11-01

    In the past few years, wavelet-domain hidden Markov models have proven to be useful tools for statistical signal and image processing. The hidden Markov tree (HMT) model captures the key features of the joint probability density of the wavelet coefficients of real-world data. One potential drawback to the HMT framework is the deficiency for taking account of intrascale correlations that exist among neighboring wavelet coefficients. In this paper, we propose to develop a joint hidden Markov model by fusing the wavelet Bayesian denoising technique with an image regularization procedure based on HMT and Markov random field (MRF). The Expectation Maximization algorithm is used to estimate hyperparameters and specify the mixture model. The noise-free wavelet coefficients are finally estimated by a shrinkage function based on local weighted averaging of the Bayesian estimator. It is shown that the joint method outperforms lee filter and standard HMT techniques in terms of the integrative measure of the equivalent number of looks (ENL) and Pratt's figure of merit(FOM), especially when dealing with speckle noise in large variance.

  6. Groupwise registration of aerial images

    OpenAIRE

    Arandjelovic, Ognjen; Pham, Duc-Son; Venkatesh, Svetha

    2015-01-01

    This paper addresses the task of time separated aerial image registration. The ability to solve this problem accurately and reliably is important for a variety of subsequent image understanding applications. The principal challenge lies in the extent and nature of transient appearance variation that a land area can undergo, such as that caused by the change in illumination conditions, seasonal variations, or the occlusion by non-persistent objects (people, cars). Our work introduces several n...

  7. Deformable Registration of Digital Images

    Institute of Scientific and Technical Information of China (English)

    管伟光; 解林; 等

    1998-01-01

    is paper proposes a novel elastic model and presents a deformable registration method based on the model.The method registers images without the need to extract reatures from the images,and therefore works directly on grey-level images.A new similarity metric is given on which the formation of external forces is based.The registration method,taking the coarse-to-fine strategy,constructs external forces in larger scales for the first few iterations to rely more on global evidence,and ther in smaller scales for later iterations to allow local refinements.The stiffness of the elastic body decreases as the process proceeds.To make it widely applicable,the method is not restricted to any type of transformation.The variations between images are thought as general free-form deformations.Because the elastic model designed is linearized,it can be solved very efficiently with high accuracy.The method has been successfully tested on MRI images.It will certainly find other uses such as matching time-varying sequences of pictures for motion analysis,fitting templates into images for non-rigid object recognition,matching stereo images for shape recovery,etc.

  8. A Practical Approach Based on Analytic Deformable Algorithm for Scenic Image Registration.

    Directory of Open Access Journals (Sweden)

    Wei-Yen Hsu

    Full Text Available Image registration is to produce an entire scene by aligning all the acquired image sequences. A registration algorithm is necessary to tolerance as much as possible for intensity and geometric variation among images. However, captured image views of real scene usually produce unexpected distortions. They are generally derived from the optic characteristics of image sensors or caused by the specific scenes and objects.An analytic registration algorithm considering the deformation is proposed for scenic image applications in this study. After extracting important features by the wavelet-based edge correlation method, an analytic registration approach is then proposed to achieve deformable and accurate matching of point sets. Finally, the registration accuracy is further refined to obtain subpixel precision by a feature-based Levenberg-Marquardt (FLM method. It converges evidently faster than most other methods because of its feature-based characteristic.We validate the performance of proposed method by testing with synthetic and real image sequences acquired by a hand-held digital still camera (DSC and in comparison with an optical flow-based motion technique in terms of the squared sum of intensity differences (SSD and correlation coefficient (CC. The results indicate that the proposed method is satisfactory in the registration accuracy and quality of DSC images.

  9. 用于弱目标检测的形态滤波和小波变换图像增强算法%Morphological Filters and Wavelet-based Histogram Equalization Image Enhancement for Weak Target Detection

    Institute of Scientific and Technical Information of China (English)

    吉书鹏; 丁小青

    2003-01-01

    Image enhancement methods are typically aimed at improvement of the overall visibility of features. Though histogram equalization can enhance the contrast by redistributing the gray levels, it has the drawback that it reduces the information in the processed image. In this paper, we present a new image enhancement algorithm. After histogram equalization is carried out, morphological filters and wavelet-based enhancement algorithm is used to clean out the unwanted details and further enhance the image and compensate for the information loss during histogram equalization. Experimental results show that the morphological filters and wavelet-based histogram equalization algorithm can significantly enhance the contrast and increase the information entropy of the image.

  10. Wavelet-based multispectral face recognition

    Institute of Scientific and Technical Information of China (English)

    LIU Dian-ting; ZHOU Xiao-dan; WANG Cheng-wen

    2008-01-01

    This paper proposes a novel wavelet-based face recognition method using thermal infrared (1R) and visible-light face images. The method applies the combination of Gabor and the Fisherfaces method to the reconstructed IR and visible images derived from wavelet frequency subbands. Our objective is to search for the subbands that are insensitive to the variation in expression and in illumination. The classification performance is improved by combining the multispectal information coming from the subbands that attain individually low equal error rate. Experimental results on Notre Dame face database show that the proposed wavelet-based algorithm outperforms previous multispectral images fusion method as well as monospectral method.

  11. Image registration method for medical image sequences

    Science.gov (United States)

    Gee, Timothy F.; Goddard, James S.

    2013-03-26

    Image registration of low contrast image sequences is provided. In one aspect, a desired region of an image is automatically segmented and only the desired region is registered. Active contours and adaptive thresholding of intensity or edge information may be used to segment the desired regions. A transform function is defined to register the segmented region, and sub-pixel information may be determined using one or more interpolation methods.

  12. Semiautomated Multimodal Breast Image Registration

    Directory of Open Access Journals (Sweden)

    Charlotte Curtis

    2012-01-01

    However, due to the highly deformable nature of breast tissues, comparison of 3D and 2D modalities is a challenge. To enable this comparison, a registration technique was developed to map features from 2D mammograms to locations in the 3D image space. This technique was developed and tested using magnetic resonance (MR images as a reference 3D modality, as MR breast imaging is an established technique in clinical practice. The algorithm was validated using a numerical phantom then successfully tested on twenty-four image pairs. Dice's coefficient was used to measure the external goodness of fit, resulting in an excellent overall average of 0.94. Internal agreement was evaluated by examining internal features in consultation with a radiologist, and subjective assessment concludes that reasonable alignment was achieved.

  13. [Progress of research in retinal image registration].

    Science.gov (United States)

    Yu, Lun; Wei, Lifang; Pan, Lin

    2011-10-01

    The retinal image registration has important applications in the processes of auxiliary diagnosis and treatment for a variety of diseases. The retinal image registration can be used to measure the disease process and the therapeutic effect. A variety of retinal image registration techniques have been studied extensively in recent years. However, there are still many problems existing and there are numerous research possibilities. Based on extensive investigation of existing literatures, the present paper analyzes the feature of retinal image and current challenges of retinal image registration, and reviews the transformation models of the retinal image registration technology and the main research algorithms in current retinal image registration, and analyzes the advantages and disadvantages of various types of algorithms. Some research challenges and future developing trends are also discussed.

  14. Mass preserving image registration for lung CT

    DEFF Research Database (Denmark)

    Gorbunova, Vladlena; Sporring, Jon; Lo, Pechin Chien Pau

    2012-01-01

    This paper presents a mass preserving image registration algorithm for lung CT images. To account for the local change in lung tissue intensity during the breathing cycle, a tissue appearance model based on the principle of preservation of total lung mass is proposed. This model is incorporated...... into a standard image registration framework with a composition of a global affine and several free-form B-Spline transformations with increasing grid resolution. The proposed mass preserving registration method is compared to registration using the sum of squared intensity differences as a similarity function...... inhale phases of 4D-CT images. Registration errors, measured as the average distance between vessel tree centerlines in the matched images, are significantly lower for the proposed mass preserving image registration method in the second, third and fourth group, while there is no statistically significant...

  15. Heuristic approach to image registration

    Science.gov (United States)

    Gertner, Izidor; Maslov, Igor V.

    2000-08-01

    Image registration, i.e. correct mapping of images obtained from different sensor readings onto common reference frame, is a critical part of multi-sensor ATR/AOR systems based on readings from different types of sensors. In order to fuse two different sensor readings of the same object, the readings have to be put into a common coordinate system. This task can be formulated as optimization problem in a space of all possible affine transformations of an image. In this paper, a combination of heuristic methods is explored to register gray- scale images. The modification of Genetic Algorithm is used as the first step in global search for optimal transformation. It covers the entire search space with (randomly or heuristically) scattered probe points and helps significantly reduce the search space to a subspace of potentially most successful transformations. Due to its discrete character, however, Genetic Algorithm in general can not converge while coming close to the optimum. Its termination point can be specified either as some predefined number of generations or as achievement of a certain acceptable convergence level. To refine the search, potential optimal subspaces are searched using more delicate and efficient for local search Taboo and Simulated Annealing methods.

  16. Tensor scale-based image registration

    Science.gov (United States)

    Saha, Punam K.; Zhang, Hui; Udupa, Jayaram K.; Gee, James C.

    2003-05-01

    Tangible solutions to image registration are paramount in longitudinal as well as multi-modal medical imaging studies. In this paper, we introduce tensor scale - a recently developed local morphometric parameter - in rigid image registration. A tensor scale-based registration method incorporates local structure size, orientation and anisotropy into the matching criterion, and therefore, allows efficient multi-modal image registration and holds potential to overcome the effects of intensity inhomogeneity in MRI. Two classes of two-dimensional image registration methods are proposed - (1) that computes angular shift between two images by correlating their tensor scale orientation histogram, and (2) that registers two images by maximizing the similarity of tensor scale features. Results of applications of the proposed methods on proton density and T2-weighted MR brain images of (1) the same slice of the same subject, and (2) different slices of the same subject are presented. The basic superiority of tensor scale-based registration over intensity-based registration is that it may allow the use of local Gestalts formed by the intensity patterns over the image instead of simply considering intensities as isolated events at the pixel level. This would be helpful in dealing with the effects of intensity inhomogeneity and noise in MRI.

  17. An Image Registration Method for Colposcopic Images

    Directory of Open Access Journals (Sweden)

    Efrén Mezura-Montes

    2013-01-01

    sequence and a division of such image into small windows. A search process is then carried out to find the window with the highest affinity in each image of the sequence and replace it with the window in the reference image. The affinity value is based on polynomial approximation of the time series computed and the search is bounded by a search radius which defines the neighborhood of each window. The proposed approach is tested in ten 310-frame real cases in two experiments: the first one to determine the best values for the window size and the search radius and the second one to compare the best obtained results with respect to four registration methods found in the specialized literature. The obtained results show a robust and competitive performance of the proposed approach with a significant lower time with respect to the compared methods.

  18. Wavelet threshold image denoising algorithm based on MATLAB different wavelet bases%基于MATLAB不同小波基的小波阈值图像去噪算法

    Institute of Scientific and Technical Information of China (English)

    曾敬枫

    2016-01-01

    Through the introduction of wavelet image denoising method and wavelet threshold denoising steps,this paper discusses the role of wavelet bases in wavelet threshold denoising, and describes the characteristics of several common wavelet bases and their correlation properties. Finally, respectively with a db2 and sym4 two kinds of wavelet bases by MATLAB, to denoise wavelet threshold realizes the image filtering and reconstruction of high frequency coefficients, so the conclusion is obtained that using different wavelet bases affects the results of image denoising.%通过介绍小波图像去噪的方法和小波阈值去噪的步骤,讨论小波基在小波阈值去噪中的作用,阐述了常见的几种小波基的特征及其相关性质的比较。最后通过在MATLAB下,分别选择了db2和sym4两种小波基,进行小波阈值去噪实现图像高频系数的滤波并重建,得到采用不同的小波基影响图像去噪效果的结论。

  19. Edge-based correlation image registration for multispectral imaging

    Science.gov (United States)

    Nandy, Prabal [Albuquerque, NM

    2009-11-17

    Registration information for images of a common target obtained from a plurality of different spectral bands can be obtained by combining edge detection and phase correlation. The images are edge-filtered, and pairs of the edge-filtered images are then phase correlated to produce phase correlation images. The registration information can be determined based on these phase correlation images.

  20. A Multistage Approach for Image Registration.

    Science.gov (United States)

    Bowen, Francis; Hu, Jianghai; Du, Eliza Yingzi

    2016-09-01

    Successful image registration is an important step for object recognition, target detection, remote sensing, multimodal content fusion, scene blending, and disaster assessment and management. The geometric and photometric variations between images adversely affect the ability for an algorithm to estimate the transformation parameters that relate the two images. Local deformations, lighting conditions, object obstructions, and perspective differences all contribute to the challenges faced by traditional registration techniques. In this paper, a novel multistage registration approach is proposed that is resilient to view point differences, image content variations, and lighting conditions. Robust registration is realized through the utilization of a novel region descriptor which couples with the spatial and texture characteristics of invariant feature points. The proposed region descriptor is exploited in a multistage approach. A multistage process allows the utilization of the graph-based descriptor in many scenarios thus allowing the algorithm to be applied to a broader set of images. Each successive stage of the registration technique is evaluated through an effective similarity metric which determines subsequent action. The registration of aerial and street view images from pre- and post-disaster provide strong evidence that the proposed method estimates more accurate global transformation parameters than traditional feature-based methods. Experimental results show the robustness and accuracy of the proposed multistage image registration methodology.

  1. Wavelet based Non LSB Steganography

    Directory of Open Access Journals (Sweden)

    H S Manjunatha Reddy

    2011-11-01

    Full Text Available Steganography is the methods of communicating secrete information hidden in the cover object. The messages hidden in a host data are digital image, video or audio files, etc, and then transmitted secretly to the destination. In this paper we propose Wavelet based Non LSB Steganography (WNLS. The cover image is segmented into 4*4 cells and DWT/IWT is applied on each cell. The 2*2 cell of HH band of DWT/IWT are considered and manipulated with payload bit pairs using identity matrix to generate stego image. The key is used to extract payload bit pairs at the destination. It is observed that the PSNR values are better in the case of IWT compare to DWT for all image formats. The algorithm can’t be detected by existing steganalysis techniques such as chi-square and pair of values techniques. The PSNR values are high in the case of raw images compared to formatted images.

  2. Introduction to Remote Sensing Image Registration

    Science.gov (United States)

    Le Moigne, Jacqueline

    2017-01-01

    For many applications, accurate and fast image registration of large amounts of multi-source data is the first necessary step before subsequent processing and integration. Image registration is defined by several steps and each step can be approached by various methods which all present diverse advantages and drawbacks depending on the type of data, the type of applications, the a prior information known about the data and the type of accuracy that is required. This paper will first present a general overview of remote sensing image registration and then will go over a few specific methods and their applications

  3. Fast fluid registration of medical images

    DEFF Research Database (Denmark)

    Bro-Nielsen, Morten; Gramkow, Claus

    1996-01-01

    This paper offers a new fast algorithm for non-rigid viscous fluid registration of medical images that is at least an order of magnitude faster than the previous method by (Christensen et al., 1994). The core algorithm in the fluid registration method is based on a linear elastic deformation...... of the velocity field of the fluid. Using the linearity of this deformation we derive a convolution filter which we use in a scale-space framework. We also demonstrate that the `demon'-based registration method of (Thirion, 1996) can be seen as an approximation to the fluid registration method and point...

  4. Bayesian technique for image classifying registration.

    Science.gov (United States)

    Hachama, Mohamed; Desolneux, Agnès; Richard, Frédéric J P

    2012-09-01

    In this paper, we address a complex image registration issue arising while the dependencies between intensities of images to be registered are not spatially homogeneous. Such a situation is frequently encountered in medical imaging when a pathology present in one of the images modifies locally intensity dependencies observed on normal tissues. Usual image registration models, which are based on a single global intensity similarity criterion, fail to register such images, as they are blind to local deviations of intensity dependencies. Such a limitation is also encountered in contrast-enhanced images where there exist multiple pixel classes having different properties of contrast agent absorption. In this paper, we propose a new model in which the similarity criterion is adapted locally to images by classification of image intensity dependencies. Defined in a Bayesian framework, the similarity criterion is a mixture of probability distributions describing dependencies on two classes. The model also includes a class map which locates pixels of the two classes and weighs the two mixture components. The registration problem is formulated both as an energy minimization problem and as a maximum a posteriori estimation problem. It is solved using a gradient descent algorithm. In the problem formulation and resolution, the image deformation and the class map are estimated simultaneously, leading to an original combination of registration and classification that we call image classifying registration. Whenever sufficient information about class location is available in applications, the registration can also be performed on its own by fixing a given class map. Finally, we illustrate the interest of our model on two real applications from medical imaging: template-based segmentation of contrast-enhanced images and lesion detection in mammograms. We also conduct an evaluation of our model on simulated medical data and show its ability to take into account spatial variations

  5. Cellular recurrent deep network for image registration

    Science.gov (United States)

    Alam, M.; Vidyaratne, L.; Iftekharuddin, Khan M.

    2015-09-01

    Image registration using Artificial Neural Network (ANN) remains a challenging learning task. Registration can be posed as a two-step problem: parameter estimation and actual alignment/transformation using the estimated parameters. To date ANN based image registration techniques only perform the parameter estimation, while affine equations are used to perform the actual transformation. In this paper, we propose a novel deep ANN based image rigid registration that combines parameter estimation and transformation as a simultaneous learning task. Our previous work shows that a complex universal approximator known as Cellular Simultaneous Recurrent Network (CSRN) can successfully approximate affine transformations with known transformation parameters. This study introduces a deep ANN that combines a feed forward network with a CSRN to perform full rigid registration. Layer wise training is used to pre-train feed forward network for parameter estimation and followed by a CSRN for image transformation respectively. The deep network is then fine-tuned to perform the final registration task. Our result shows that the proposed deep ANN architecture achieves comparable registration accuracy to that of image affine transformation using CSRN with known parameters. We also demonstrate the efficacy of our novel deep architecture by a performance comparison with a deep clustered MLP.

  6. Parallel image registration method for snapshot Fourier transform imaging spectroscopy

    Science.gov (United States)

    Zhang, Yu; Zhu, Shuaishuai; Lin, Jie; Zhu, Feijia; Jin, Peng

    2017-08-01

    A fast and precise registration method for multi-image snapshot Fourier transform imaging spectroscopy is proposed. This method accomplishes registration of an image array using the positional relationship between homologous points in the subimages, which are obtained offline by preregistration. Through the preregistration process, the registration problem is converted to the problem of using a registration matrix to interpolate subimages. Therefore, the hardware interpolation of graphics processing unit (GPU) texture memory, which has speed advantages for its parallel computing, can be used to significantly enhance computational efficiency. Compared to a central processing unit, GPU performance showed ˜27 times acceleration in registration efficiency.

  7. Progressive refinement for robust image registration

    Institute of Scientific and Technical Information of China (English)

    Li Song; Yuanhua Zhou; Jun Zhou

    2005-01-01

    @@ A new image registration algorithm with robust cost function and progressive refinement estimation is developed on the basis of direct method (DM). The robustness lies in M-estimation to avert larger local noise and outliers.

  8. Mass preserving image registration for lung CT

    DEFF Research Database (Denmark)

    Gorbunova, Vladlena; Sporring, Jon; Lo, Pechin;

    2012-01-01

    on four groups of data: 44 pairs of longitudinal inspiratory chest CT scans with small difference in lung volume; 44 pairs of longitudinal inspiratory chest CT scans with large difference in lung volume; 16 pairs of expiratory and inspiratory CT scans; and 5 pairs of images extracted at end exhale and end...... inhale phases of 4D-CT images. Registration errors, measured as the average distance between vessel tree centerlines in the matched images, are significantly lower for the proposed mass preserving image registration method in the second, third and fourth group, while there is no statistically significant......This paper presents a mass preserving image registration algorithm for lung CT images. To account for the local change in lung tissue intensity during the breathing cycle, a tissue appearance model based on the principle of preservation of total lung mass is proposed. This model is incorporated...

  9. Onboard Image Registration from Invariant Features

    Science.gov (United States)

    Wang, Yi; Ng, Justin; Garay, Michael J.; Burl, Michael C

    2008-01-01

    This paper describes a feature-based image registration technique that is potentially well-suited for onboard deployment. The overall goal is to provide a fast, robust method for dynamically combining observations from multiple platforms into sensors webs that respond quickly to short-lived events and provide rich observations of objects that evolve in space and time. The approach, which has enjoyed considerable success in mainstream computer vision applications, uses invariant SIFT descriptors extracted at image interest points together with the RANSAC algorithm to robustly estimate transformation parameters that relate one image to another. Experimental results for two satellite image registration tasks are presented: (1) automatic registration of images from the MODIS instrument on Terra to the MODIS instrument on Aqua and (2) automatic stabilization of a multi-day sequence of GOES-West images collected during the October 2007 Southern California wildfires.

  10. Phase Correlation Based Iris Image Registration Model

    Institute of Scientific and Technical Information of China (English)

    Jun-Zhou Huang; Tie-Niu Tan; Li Ma; Yun-Hong Wang

    2005-01-01

    Iris recognition is one of the most reliable personal identification methods. In iris recognition systems, image registration is an important component. Accurately registering iris images leads to higher recognition rate for an iris recognition system. This paper proposes a phase correlation based method for iris image registration with sub-pixel accuracy.Compared with existing methods, it is insensitive to image intensity and can compensate to a certain extent the non-linear iris deformation caused by pupil movement. Experimental results show that the proposed algorithm has an encouraging performance.

  11. Image registration using adaptive polar transform.

    Science.gov (United States)

    Matungka, Rittavee; Zheng, Yuan F; Ewing, Robert L

    2009-10-01

    Image registration is an essential step in many image processing applications that need visual information from multiple images for comparison, integration, or analysis. Recently, researchers have introduced image registration techniques using the log-polar transform (LPT) for its rotation and scale invariant properties. However, it suffers from nonuniform sampling which makes it not suitable for applications in which the registered images are altered or occluded. Inspired by LPT, this paper presents a new registration algorithm that addresses the problems of the conventional LPT while maintaining the robustness to scale and rotation. We introduce a novel adaptive polar transform (APT) technique that evenly and effectively samples the image in the Cartesian coordinates. Combining APT with an innovative projection transform along with a matching mechanism, the proposed method yields less computational load and more accurate registration than that of the conventional LPT. Translation between the registered images is recovered with the new search scheme using Gabor feature extraction to accelerate the localization procedure. Moreover an image comparison scheme is proposed for locating the area where the image pairs differ. Experiments on real images demonstrate the effectiveness and robustness of the proposed approach for registering images that are subjected to occlusion and alteration in addition to scale, rotation, and translation.

  12. Mid-space-independent deformable image registration.

    Science.gov (United States)

    Aganj, Iman; Iglesias, Juan Eugenio; Reuter, Martin; Sabuncu, Mert Rory; Fischl, Bruce

    2017-02-24

    Aligning images in a mid-space is a common approach to ensuring that deformable image registration is symmetric - that it does not depend on the arbitrary ordering of the input images. The results are, however, generally dependent on the mathematical definition of the mid-space. In particular, the set of possible solutions is typically restricted by the constraints that are enforced on the transformations to prevent the mid-space from drifting too far from the native image spaces. The use of an implicit atlas has been proposed as an approach to mid-space image registration. In this work, we show that when the atlas is aligned to each image in the native image space, the data term of implicit-atlas-based deformable registration is inherently independent of the mid-space. In addition, we show that the regularization term can be reformulated independently of the mid-space as well. We derive a new symmetric cost function that only depends on the transformation morphing the images to each other, rather than to the atlas. This eliminates the need for anti-drift constraints, thereby expanding the space of allowable deformations. We provide an implementation scheme for the proposed framework, and validate it through diffeomorphic registration experiments on brain magnetic resonance images.

  13. Fractional Regularization Term for Variational Image Registration

    Directory of Open Access Journals (Sweden)

    Rafael Verdú-Monedero

    2009-01-01

    Full Text Available Image registration is a widely used task of image analysis with applications in many fields. Its classical formulation and current improvements are given in the spatial domain. In this paper a regularization term based on fractional order derivatives is formulated. This term is defined and implemented in the frequency domain by translating the energy functional into the frequency domain and obtaining the Euler-Lagrange equations which minimize it. The new regularization term leads to a simple formulation and design, being applicable to higher dimensions by using the corresponding multidimensional Fourier transform. The proposed regularization term allows for a real gradual transition from a diffusion registration to a curvature registration which is best suited to some applications and it is not possible in the spatial domain. Results with 3D actual images show the validity of this approach.

  14. Quantifying Surface Characteristics of Ice Crystals using High-Resolution Imagery and Wavelet-based Image Processing Techniques

    Science.gov (United States)

    Brown, T.

    2015-12-01

    The surface characteristics of ice crystals have a considerable impact on the bulk scattering properties of ice clouds. Here, 2.3 μm-resolution silhouettes of crystals imaged by a Cloud Particle Imager (CPI) obtained from the Tropical Warm Pool - International Cloud and Mixed Phase Arctic Cloud Experiments are combined with wavelet analysis to characterize crystal surfaces. Wavelet analysis is a multiresolution tool that is applied to reveal underlying textural details of crystal images on several spatial scales. Images are defined as matrices in which each pixel corresponds to a gray level intensity value. Wavelet functions are used to decompose crystal images into a set of approximation and detail components by applying high and low-pass filters to the rows and columns of the image matrix. Following each level of decomposition, gray level intensity histograms are produced by calculating the frequency distribution of pixel intensities from the detailed coefficients, which contain artifacts, but also important textural information. First-order statistics are calculated from gray level histograms of the detailed coefficients to estimate variability across crystal surfaces, but lack information on the spatial distribution of pixel intensities. Thus, a second-order statistical measure, the gray level co-occurrence matrix (GLCM), is also extracted from the detailed coefficients to provide a more precise measure of surface texture. GLCMs are calculated by how often pairs of pixels with specific values and in certain spatial relationships occur in an image. Several degrees of texture are defined by first and second-order statistics to investigate how the surface texture of crystals varies with environmental conditions. Estimations of surface roughness using the proposed methods may have implications for improving bulk scattering calculations used in satellite retrieval algorithms and global climate model parameterizations.

  15. Expression Detail Synthesis Based on Wavelet-Based Image Fusion%基于小波图像融合的表情细节合成

    Institute of Scientific and Technical Information of China (English)

    王晓慧; 贾珈; 蔡莲红

    2013-01-01

    Expression details are texture changes caused by facial expression, such as wrinkles in the corner of the mouth when smiling and wrinkles on the forehead when surprising. Expression details can help to enhance the realistic experience of synthesized face image. In this paper, we propose to synthesize expression details by using the method of wavelet-based image fusion. We try to mine the texture feature of expression details for natural expression generation. In order to meet the requirements of individual expression detail synthesis, we use different wavelet transforms, such as the traditional wavelet transform and dual-tree complex wavelet transform, and kinds of fusion operators to get rich results. To seamlessly integrate the synthesized image of expression details to the output expressive face image, we select the optimal replacement for both images by clustering and graph cut method. Our proposed approach is applied to not only grayscale images, but also color images by the color space conversion. The experimental results show that the proposed method is effective on the expression detail synthesis, which can enhance the realistic experience of synthesized face image.%表情细节是人脸表情变化时带来的皮肤纹理变化,表情细节合成有助于增强合成表情的真实感.提出了基于小波的图像融合方法,挖掘表情细节的纹理特征本质,并应用到表情细节的合成中,使合成的表情更加真实自然.为了满足表情细节个性化的需求,采用传统的小波变换和双树复小波变换,同时使用不同的融合算子,得到了丰富的表情合成.本方法不仅适用于灰度图像,通过颜色空间的转换还适用于彩色图像.最后还提出了基于聚类和图切割的最优替换区域选取方法,使得合成的表情细节区域与目标图像融为一体.

  16. Automated image registration for FDOPA PET studies

    Science.gov (United States)

    Lin, Kang-Ping; Huang, Sung-Cheng; Yu, Dan-Chu; Melega, William; Barrio, Jorge R.; Phelps, Michael E.

    1996-12-01

    In this study, various image registration methods are investigated for their suitability for registration of L-6-[18F]-fluoro-DOPA (FDOPA) PET images. Five different optimization criteria including sum of absolute difference (SAD), mean square difference (MSD), cross-correlation coefficient (CC), standard deviation of pixel ratio (SDPR), and stochastic sign change (SSC) were implemented and Powell's algorithm was used to optimize the criteria. The optimization criteria were calculated either unidirectionally (i.e. only evaluating the criteria for comparing the resliced image 1 with the original image 2) or bidirectionally (i.e. averaging the criteria for comparing the resliced image 1 with the original image 2 and those for the sliced image 2 with the original image 1). Monkey FDOPA images taken at various known orientations were used to evaluate the accuracy of different methods. A set of human FDOPA dynamic images was used to investigate the ability of the methods for correcting subject movement. It was found that a large improvement in performance resulted when bidirectional rather than unidirectional criteria were used. Overall, the SAD, MSD and SDPR methods were found to be comparable in performance and were suitable for registering FDOPA images. The MSD method gave more adequate results for frame-to-frame image registration for correcting subject movement during a dynamic FDOPA study. The utility of the registration method is further demonstrated by registering FDOPA images in monkeys before and after amphetamine injection to reveal more clearly the changes in spatial distribution of FDOPA due to the drug intervention.

  17. A new wavelet-based reconstruction algorithm for twin image removal in digital in-line holography

    Science.gov (United States)

    Hattay, Jamel; Belaid, Samir; Aguili, Taoufik; Lebrun, Denis

    2016-07-01

    Two original methods are proposed here for digital in-line hologram processing. Firstly, we propose an entropy-based method to retrieve the focus plane which is very useful for digital hologram reconstruction. Secondly, we introduce a new approach to remove the so-called twin images reconstructed by holograms. This is achieved owing to the Blind Source Separation (BSS) technique. The proposed method is made up of two steps: an Adaptive Quincunx Lifting Scheme (AQLS) and a statistical unmixing algorithm. The AQLS tool is based on wavelet packet transform, whose role is to maximize the sparseness of the input holograms. The unmixing algorithm uses the Independent Component Analysis (ICA) tool. Experimental results confirm the ability of convolutive blind source separation to discard the unwanted twin image from in-line digital holograms.

  18. Medical Image Registration and Surgery Simulation

    DEFF Research Database (Denmark)

    Bro-Nielsen, Morten

    1996-01-01

    This thesis explores the application of physical models in medical image registration and surgery simulation. The continuum models of elasticity and viscous fluids are described in detail, and this knowledge is used as a basis for most of the methods described here. Real-time deformable models......, and the use of selective matrix vector multiplication. Fluid medical image registration A new and faster algorithm for non-rigid registration using viscous fluid models is presented. This algorithm replaces the core part of the original algorithm with multi-resolution convolution using a new filter, which...... for surgery simulation Real-time deformable models, using finite element models of linear elasticity, have been developed for surgery simulation. The time consumption of the finite element method is reduced dramaticly, by the use of condensation techniques, explicit inversion of the stiffness matrix...

  19. A survey of medical image registration - under review.

    Science.gov (United States)

    Viergever, Max A; Maintz, J B Antoine; Klein, Stefan; Murphy, Keelin; Staring, Marius; Pluim, Josien P W

    2016-10-01

    A retrospective view on the past two decades of the field of medical image registration is presented, guided by the article "A survey of medical image registration" (Maintz and Viergever, 1998). It shows that the classification of the field introduced in that article is still usable, although some modifications to do justice to advances in the field would be due. The main changes over the last twenty years are the shift from extrinsic to intrinsic registration, the primacy of intensity-based registration, the breakthrough of nonlinear registration, the progress of inter-subject registration, and the availability of generic image registration software packages. Two problems that were called urgent already 20 years ago, are even more urgent nowadays: Validation of registration methods, and translation of results of image registration research to clinical practice. It may be concluded that the field of medical image registration has evolved, but still is in need of further development in various aspects.

  20. Bayesian wavelet-based image deconvolution: a GEM algorithm exploiting a class of heavy-tailed priors.

    Science.gov (United States)

    Bioucas-Dias, José M

    2006-04-01

    Image deconvolution is formulated in the wavelet domain under the Bayesian framework. The well-known sparsity of the wavelet coefficients of real-world images is modeled by heavy-tailed priors belonging to the Gaussian scale mixture (GSM) class; i.e., priors given by a linear (finite of infinite) combination of Gaussian densities. This class includes, among others, the generalized Gaussian, the Jeffreys, and the Gaussian mixture priors. Necessary and sufficient conditions are stated under which the prior induced by a thresholding/shrinking denoising rule is a GSM. This result is then used to show that the prior induced by the "nonnegative garrote" thresholding/shrinking rule, herein termed the garrote prior, is a GSM. To compute the maximum a posteriori estimate, we propose a new generalized expectation maximization (GEM) algorithm, where the missing variables are the scale factors of the GSM densities. The maximization step of the underlying expectation maximization algorithm is replaced with a linear stationary second-order iterative method. The result is a GEM algorithm of O(N log N) computational complexity. In a series of benchmark tests, the proposed approach outperforms or performs similarly to state-of-the art methods, demanding comparable (in some cases, much less) computational complexity.

  1. Deformable image registration with geometric changes

    Institute of Scientific and Technical Information of China (English)

    Yu LIU; Bo ZHU

    2015-01-01

    Geometric changes present a number of difficulties in deformable image registration. In this paper, we propose a global deformation framework to model geometric changes whilst promoting a smooth transformation between source and target images. To achieve this, we have developed an innovative model which significantly reduces the side effects of geometric changes in image registration, and thus improves the registration accuracy. Our key contribution is the introduction of a sparsity-inducing norm, which is typically L1 norm regularization targeting regions where geometric changes occur. This preserves the smoothness of global transformation by eliminating local transformation under different conditions. Numerical solutions are discussed and analyzed to guarantee the stability and fast convergence of our algorithm. To demonstrate the effectiveness and utility of this method, we evaluate it on both synthetic data and real data from traumatic brain injury (TBI). We show that the transformation estimated from our model is able to reconstruct the target image with lower instances of error than a standard elastic registration model.

  2. Algorithm for Fast Registration of Radar Images

    Directory of Open Access Journals (Sweden)

    Subrata Rakshit

    2002-07-01

    Full Text Available Radar imagery provides an all-weather and 24 h coverage, making it ideal for critical defence applications. In some applications, multiple images acquired of an area need to be registered for further processing. Such situations arise for battlefield surveillance based on satellite imagery. The registration has to be done between an earlier (reference image and a new (live image. For automated surveillance, registration is a prerequisite for change detection. Speed is essential due to large volumes of data involved and the need for quick responses. The registration transformation is quite simple, being mainly a global translation. (Scale and rotation corrections can be applied based on known camera parameters. The challenge lies in the fact that the radar images are not as feature-rich as optical images and the image content variation can be as high as 90 per cent. Even though the change on the ground may not be drastic, seasonal variations can significantly alter the radar signatures of ground, vegetation, and water bodies. This necessitates a novel approach different from the techniques developed for optical images. An algorithm has been developed that leads to fast registration of radar images, even in the presence of specular noise and significant scene content variation. The key features of this approach are adaptability to sensor/terrain types, ability to handle large content variations and false positive rejection. The present work shows that this algorithm allows for various cost-performance trade-offs, making it suitable for a wide variety of applications. The algorithm, in various cost-performance configurations, is tested on a set of ERS images. Results of such tests have been reported, indicating the performance of the algorithm for various cost-performance trade-offs.

  3. Image Classifying Registration and Dynamic Region Merging

    Directory of Open Access Journals (Sweden)

    Himadri Nath Moulick

    2013-07-01

    Full Text Available In this paper, we address a complex image registration issue arising when the dependencies between intensities of images to be registered are not spatially homogeneous. Such a situation is frequentlyencountered in medical imaging when a pathology present in one of the images modifies locally intensity dependencies observed on normal tissues. Usual image registration models, which are based on a single global intensity similarity criterion, fail to register such images, as they are blind to local deviations of intensity dependencies. Such a limitation is also encountered in contrast enhanced images where there exist multiple pixel classes having different properties of contrast agent absorption. In this paper, we propose a new model in which the similarity criterion is adapted locally to images by classification of image intensity dependencies. Defined in a Bayesian framework, the similarity criterion is a mixture of probability distributions describing dependencies on two classes. The model also includes a class map which locates pixels of the two classes and weights the two mixture components. The registration problem is formulated both as an energy minimization problem and as a Maximum A Posteriori (MAP estimation problem. It is solved using a gradient descent algorithm. In the problem formulation and resolution, the image deformation and the class map are estimated at the same time, leading to an original combination of registration and classification that we call image classifying registration. Whenever sufficient information about class location is available in applications, the registration can also be performed on its own by fixing a given class map. Finally, we illustrate the interest of our model on two real applications from medical imaging: template-based segmentation of contrast-enhanced images and lesion detection in mammograms. We also conduct an evaluation of our model on simulated medical data and show its ability to take into

  4. Automatic small bowel tumor diagnosis by using multi-scale wavelet-based analysis in wireless capsule endoscopy images

    Directory of Open Access Journals (Sweden)

    Barbosa Daniel C

    2012-01-01

    Full Text Available Abstract Background Wireless capsule endoscopy has been introduced as an innovative, non-invasive diagnostic technique for evaluation of the gastrointestinal tract, reaching places where conventional endoscopy is unable to. However, the output of this technique is an 8 hours video, whose analysis by the expert physician is very time consuming. Thus, a computer assisted diagnosis tool to help the physicians to evaluate CE exams faster and more accurately is an important technical challenge and an excellent economical opportunity. Method The set of features proposed in this paper to code textural information is based on statistical modeling of second order textural measures extracted from co-occurrence matrices. To cope with both joint and marginal non-Gaussianity of second order textural measures, higher order moments are used. These statistical moments are taken from the two-dimensional color-scale feature space, where two different scales are considered. Second and higher order moments of textural measures are computed from the co-occurrence matrices computed from images synthesized by the inverse wavelet transform of the wavelet transform containing only the selected scales for the three color channels. The dimensionality of the data is reduced by using Principal Component Analysis. Results The proposed textural features are then used as the input of a classifier based on artificial neural networks. Classification performances of 93.1% specificity and 93.9% sensitivity are achieved on real data. These promising results open the path towards a deeper study regarding the applicability of this algorithm in computer aided diagnosis systems to assist physicians in their clinical practice.

  5. Image Segmentation, Registration, Compression, and Matching

    Science.gov (United States)

    Yadegar, Jacob; Wei, Hai; Yadegar, Joseph; Ray, Nilanjan; Zabuawala, Sakina

    2011-01-01

    A novel computational framework was developed of a 2D affine invariant matching exploiting a parameter space. Named as affine invariant parameter space (AIPS), the technique can be applied to many image-processing and computer-vision problems, including image registration, template matching, and object tracking from image sequence. The AIPS is formed by the parameters in an affine combination of a set of feature points in the image plane. In cases where the entire image can be assumed to have undergone a single affine transformation, the new AIPS match metric and matching framework becomes very effective (compared with the state-of-the-art methods at the time of this reporting). No knowledge about scaling or any other transformation parameters need to be known a priori to apply the AIPS framework. An automated suite of software tools has been created to provide accurate image segmentation (for data cleaning) and high-quality 2D image and 3D surface registration (for fusing multi-resolution terrain, image, and map data). These tools are capable of supporting existing GIS toolkits already in the marketplace, and will also be usable in a stand-alone fashion. The toolkit applies novel algorithmic approaches for image segmentation, feature extraction, and registration of 2D imagery and 3D surface data, which supports first-pass, batched, fully automatic feature extraction (for segmentation), and registration. A hierarchical and adaptive approach is taken for achieving automatic feature extraction, segmentation, and registration. Surface registration is the process of aligning two (or more) data sets to a common coordinate system, during which the transformation between their different coordinate systems is determined. Also developed here are a novel, volumetric surface modeling and compression technique that provide both quality-guaranteed mesh surface approximations and compaction of the model sizes by efficiently coding the geometry and connectivity

  6. TIMER: tensor image morphing for elastic registration.

    Science.gov (United States)

    Yap, Pew-Thian; Wu, Guorong; Zhu, Hongtu; Lin, Weili; Shen, Dinggang

    2009-08-15

    We propose a novel diffusion tensor imaging (DTI) registration algorithm, called Tensor Image Morphing for Elastic Registration (TIMER), which leverages the hierarchical guidance of regional distributions and local boundaries, both extracted directly from the tensors. Currently available DTI registration methods generally extract tensor scalar features from each tensor to construct scalar maps. Subsequently, regional integration and other operations such as edge detection are performed to extract more features to guide the registration. However, there are two major limitations with these approaches. First, the computed regional features might not reflect the actual regional tensor distributions. Second, by the same token, gradient maps calculated from the tensor-derived scalar feature maps might not represent the actual tissue tensor boundaries. To overcome these limitations, we propose a new approach which extracts regional and edge information directly from a tensor neighborhood. Regional tensor distribution information, such as mean and variance, is computed in a multiscale fashion directly from the tensors by taking into account the voxel neighborhood of different sizes, and hence capturing tensor information at different scales, which in turn can be employed to hierarchically guide the registration. Such multiscale scheme can help alleviate the problem of local minimum and is also more robust to noise since one can better determine the statistical properties of each voxel by taking into account the properties of its surrounding. Also incorporated in our method is edge information extracted directly from the tensors, which is crucial to facilitate registration of tissue boundaries. Experiments involving real subjects, simulated subjects, fiber tracking, and atrophy detection indicate that TIMER performs better than the other methods (Yang et al., 2008; Zhang et al., 2006).

  7. Deformable image registration in radiation therapy

    Energy Technology Data Exchange (ETDEWEB)

    Oh, Seung Jong; Kim, Si Yong [Dept. of Radiation Oncology, Virginia Commonwealth University, Richmond (United States)

    2017-06-15

    The number of imaging data sets has significantly increased during radiation treatment after introducing a diverse range of advanced techniques into the field of radiation oncology. As a consequence, there have been many studies proposing meaningful applications of imaging data set use. These applications commonly require a method to align the data sets at a reference. Deformable image registration (DIR) is a process which satisfies this requirement by locally registering image data sets into a reference image set. DIR identifies the spatial correspondence in order to minimize the differences between two or among multiple sets of images. This article describes clinical applications, validation, and algorithms of DIR techniques. Applications of DIR in radiation treatment include dose accumulation, mathematical modeling, automatic segmentation, and functional imaging. Validation methods discussed are based on anatomical landmarks, physical phantoms, digital phantoms, and per application purpose. DIR algorithms are also briefly reviewed with respect to two algorithmic components: similarity index and deformation models.

  8. Canny edge-based deformable image registration

    Science.gov (United States)

    Kearney, Vasant; Huang, Yihui; Mao, Weihua; Yuan, Baohong; Tang, Liping

    2017-02-01

    This work focuses on developing a 2D Canny edge-based deformable image registration (Canny DIR) algorithm to register in vivo white light images taken at various time points. This method uses a sparse interpolation deformation algorithm to sparsely register regions of the image with strong edge information. A stability criterion is enforced which removes regions of edges that do not deform in a smooth uniform manner. Using a synthetic mouse surface ground truth model, the accuracy of the Canny DIR algorithm was evaluated under axial rotation in the presence of deformation. The accuracy was also tested using fluorescent dye injections, which were then used for gamma analysis to establish a second ground truth. The results indicate that the Canny DIR algorithm performs better than rigid registration, intensity corrected Demons, and distinctive features for all evaluation matrices and ground truth scenarios. In conclusion Canny DIR performs well in the presence of the unique lighting and shading variations associated with white-light-based image registration.

  9. Optimized imaging using non-rigid registration

    Energy Technology Data Exchange (ETDEWEB)

    Berkels, Benjamin, E-mail: berkels@aices.rwth-aachen.de [Interdisciplinary Mathematics Institute, 1523 Greene Street, University of South Carolina, Columbia, SC 29208 (United States); Binev, Peter, E-mail: binev@math.sc.edu [Interdisciplinary Mathematics Institute, 1523 Greene Street, University of South Carolina, Columbia, SC 29208 (United States); Department of Mathematics, 1523 Greene Street, University of South Carolina, Columbia, SC 29208 (United States); Blom, Douglas A., E-mail: doug.blom@sc.edu [NanoCenter, 1212 Greene Street, University of South Carolina, Columbia, SC 29208 (United States); Dahmen, Wolfgang, E-mail: dahmen@igpm.rwth-aachen.de [Interdisciplinary Mathematics Institute, 1523 Greene Street, University of South Carolina, Columbia, SC 29208 (United States); Institut für Geometrie und Praktische Mathematik, RWTH Aachen, Templergraben 55, 52056 Aachen (Germany); Sharpley, Robert C., E-mail: rcsharpley@gmail.com [Interdisciplinary Mathematics Institute, 1523 Greene Street, University of South Carolina, Columbia, SC 29208 (United States); Department of Mathematics, 1523 Greene Street, University of South Carolina, Columbia, SC 29208 (United States); Vogt, Thomas, E-mail: tvogt@mailbox.sc.edu [Interdisciplinary Mathematics Institute, 1523 Greene Street, University of South Carolina, Columbia, SC 29208 (United States); NanoCenter, 1212 Greene Street, University of South Carolina, Columbia, SC 29208 (United States); Department of Chemistry and Biochemistry, 631 Sumter Street, University of South Carolina, Columbia, SC 29208 (United States)

    2014-03-01

    The extraordinary improvements of modern imaging devices offer access to data with unprecedented information content. However, widely used image processing methodologies fall far short of exploiting the full breadth of information offered by numerous types of scanning probe, optical, and electron microscopies. In many applications, it is necessary to keep measurement intensities below a desired threshold. We propose a methodology for extracting an increased level of information by processing a series of data sets suffering, in particular, from high degree of spatial uncertainty caused by complex multiscale motion during the acquisition process. An important role is played by a non-rigid pixel-wise registration method that can cope with low signal-to-noise ratios. This is accompanied by formulating objective quality measures which replace human intervention and visual inspection in the processing chain. Scanning transmission electron microscopy of siliceous zeolite material exhibits the above-mentioned obstructions and therefore serves as orientation and a test of our procedures. - Highlights: • Developed a new process for extracting more information from a series of STEM images. • An objective non-rigid registration process copes with distortions. • Images of zeolite Y show retrieval of all information available from the data set. • Quantitative measures of registration quality were implemented. • Applicable to any serially acquired data, e.g. STM, AFM, STXM, etc.

  10. Symmetry in Image Registration and Deformation Modeling

    DEFF Research Database (Denmark)

    Sommer, Stefan; Jacobs, Henry O.

    We survey the role of symmetry in diffeomorphic registration of landmarks, curves, surfaces, images and higher-order data. The infinite dimensional problem of finding correspondences between objects can for a range of concrete data types be reduced resulting in compact representations of shape...... and spatial structure. This reduction is possible because the available data is incomplete in encoding the full deformation model. Using reduction by symmetry, we describe the reduced models in a common theoretical framework that draws on links between the registration problem and geometric mechanics....... Symmetry also arises in reduction to the Lie algebra using particle relabeling symmetry allowing the equations of motion to be written purely in terms of Eulerian velocity field. Reduction by symmetry has recently been applied for jet-matching and higher-order discrete approximations of the image matching...

  11. 3D Wavelet-Based Filter and Method

    Science.gov (United States)

    Moss, William C.; Haase, Sebastian; Sedat, John W.

    2008-08-12

    A 3D wavelet-based filter for visualizing and locating structural features of a user-specified linear size in 2D or 3D image data. The only input parameter is a characteristic linear size of the feature of interest, and the filter output contains only those regions that are correlated with the characteristic size, thus denoising the image.

  12. A New Extended Projection-Based Image Registration Algorithm

    Institute of Scientific and Technical Information of China (English)

    CHENHuafu; YAODezhong

    2005-01-01

    In the presence of fixed -pattern noise, the projection-based image registration technique is effective but its implementation is only confined to translation registration. Presented in this paper is an extended projectionbased image registration technique in which, by rearranging the projections of images, the image registration is implemented in two steps: rotation and translation, to accomplish two-dimensional (2-D) image registration. Thisapproach transforms the general 2-D optimization procedure into an 1-D projection optimization, thus considerably reducing the amount of computation. The validity ofthe new method is testified by simulation experiment.

  13. Automated landmark-guided deformable image registration

    Science.gov (United States)

    Kearney, Vasant; Chen, Susie; Gu, Xuejun; Chiu, Tsuicheng; Liu, Honghuan; Jiang, Lan; Wang, Jing; Yordy, John; Nedzi, Lucien; Mao, Weihua

    2015-01-01

    The purpose of this work is to develop an automated landmark-guided deformable image registration (LDIR) algorithm between the planning CT and daily cone-beam CT (CBCT) with low image quality. This method uses an automated landmark generation algorithm in conjunction with a local small volume gradient matching search engine to map corresponding landmarks between the CBCT and the planning CT. The landmarks act as stabilizing control points in the following Demons deformable image registration. LDIR is implemented on graphics processing units (GPUs) for parallel computation to achieve ultra fast calculation. The accuracy of the LDIR algorithm has been evaluated on a synthetic case in the presence of different noise levels and data of six head and neck cancer patients. The results indicate that LDIR performed better than rigid registration, Demons, and intensity corrected Demons for all similarity metrics used. In conclusion, LDIR achieves high accuracy in the presence of multimodality intensity mismatch and CBCT noise contamination, while simultaneously preserving high computational efficiency.

  14. Surface driven biomechanical breast image registration

    Science.gov (United States)

    Eiben, Björn; Vavourakis, Vasileios; Hipwell, John H.; Kabus, Sven; Lorenz, Cristian; Buelow, Thomas; Williams, Norman R.; Keshtgar, M.; Hawkes, David J.

    2016-03-01

    Biomechanical modelling enables large deformation simulations of breast tissues under different loading conditions to be performed. Such simulations can be utilised to transform prone Magnetic Resonance (MR) images into a different patient position, such as upright or supine. We present a novel integration of biomechanical modelling with a surface registration algorithm which optimises the unknown material parameters of a biomechanical model and performs a subsequent regularised surface alignment. This allows deformations induced by effects other than gravity, such as those due to contact of the breast and MR coil, to be reversed. Correction displacements are applied to the biomechanical model enabling transformation of the original pre-surgical images to the corresponding target position. The algorithm is evaluated for the prone-to-supine case using prone MR images and the skin outline of supine Computed Tomography (CT) scans for three patients. A mean target registration error (TRE) of 10:9 mm for internal structures is achieved. For the prone-to-upright scenario, an optical 3D surface scan of one patient is used as a registration target and the nipple distances after alignment between the transformed MRI and the surface are 10:1 mm and 6:3 mm respectively.

  15. Multi-modal image registration using structural features.

    Science.gov (United States)

    Kasiri, Keyvan; Clausi, David A; Fieguth, Paul

    2014-01-01

    Multi-modal image registration has been a challenging task in medical images because of the complex intensity relationship between images to be aligned. Registration methods often rely on the statistical intensity relationship between the images which suffers from problems such as statistical insufficiency. The proposed registration method works based on extracting structural features by utilizing the complex phase and gradient-based information. By employing structural relationships between different modalities instead of complex similarity measures, the multi-modal registration problem is converted into a mono-modal one. Therefore, conventional mono-modal similarity measures can be utilized to evaluate the registration results. This new registration paradigm has been tested on magnetic resonance (MR) brain images of different modes. The method has been evaluated based on target registration error (TRE) to determine alignment accuracy. Quantitative results demonstrate that the proposed method is capable of achieving comparable registration accuracy compared to the conventional mutual information.

  16. Enhancing retinal images by nonlinear registration

    CERN Document Server

    Molodij, Guillaume; Glanc, Marie; Chenegros, Guillaume

    2014-01-01

    Being able to image the human retina in high resolution opens a new era in many important fields, such as pharmacological research for retinal diseases, researches in human cognition, nervous system, metabolism and blood stream, to name a few. In this paper, we propose to share the knowledge acquired in the fields of optics and imaging in solar astrophysics in order to improve the retinal imaging at very high spatial resolution in the perspective to perform a medical diagnosis. The main purpose would be to assist health care practitioners by enhancing retinal images and detect abnormal features. We apply a nonlinear registration method using local correlation tracking to increase the field of view and follow structure evolutions using correlation techniques borrowed from solar astronomy technique expertise. Another purpose is to define the tracer of movements after analyzing local correlations to follow the proper motions of an image from one moment to another, such as changes in optical flows that would be o...

  17. Iterative Refinement of Transformation Parameters for Image Registration

    OpenAIRE

    Jharna Majumdar; B. Vanathy; S. Lekshmi

    2010-01-01

    Image registration is an important process in high-level image interpretation systems developed for civilian and defense applications. Registration is carried out in two phases: namely feature extraction and feature correspondence. The basic building block of feature based image registration scheme involves matching feature points that are extracted from a sensed image to their counter parts in the reference image. Features may be control points, corners, junctions or interest points. The obj...

  18. The Registration of Knee Joint Images with Preprocessing

    Directory of Open Access Journals (Sweden)

    Zhenyan Ji

    2011-06-01

    Full Text Available the registration of CT and MR images is important to analyze the effect of PCL and ACL deficiency on knee joint. Because CT and MR images have different limitations, we need register CT and MR images of knee joint and then build a model to do an analysis of the stress distribution on knee joint. In our project, we adopt image registration based on mutual information. In the knee joint images, the information about adipose, muscle and other soft tissue affects the registration accuracy. To eliminate the interference, we propose a combined preprocessing solution BEBDO, which consists of five steps, image blurring, image enhancement, image blurring, image edge detection and image outline preprocessing. We also designed the algorithm of image outline preprocessing. At the end of the paper, an experiment is done to compare the image registration results without the preprocessing and with the preprocessing. The results prove that the preprocessing can improve the image registration accuracy.

  19. High performance deformable image registration algorithms for manycore processors

    CERN Document Server

    Shackleford, James; Sharp, Gregory

    2013-01-01

    High Performance Deformable Image Registration Algorithms for Manycore Processors develops highly data-parallel image registration algorithms suitable for use on modern multi-core architectures, including graphics processing units (GPUs). Focusing on deformable registration, we show how to develop data-parallel versions of the registration algorithm suitable for execution on the GPU. Image registration is the process of aligning two or more images into a common coordinate frame and is a fundamental step to be able to compare or fuse data obtained from different sensor measurements. E

  20. Deformable image registration for image guided prostate radiotherapy

    Energy Technology Data Exchange (ETDEWEB)

    Cassetta, Roberto; Riboldi, Marco; Baroni, Guido [DEIB, Politecnico di Milano, Milano (Italy); Leandro, Kleber; Novaes, Paulo Eduardo [Hospital Vitoria, Santos, SP (Brazil); Goncalves, Vinicius; Sakuraba, Roberto [Hospital Israelita Albert Einstein, Sao Paulo, SP (Brazil); Fattori, Giovanni [Paul Scherrer Institute, Center for Proton Therapy, Villigen (Switzerland)

    2016-07-01

    In this study, we present a CT to CBCT deformable registration method based on the ITK library. An algorithm was developed in order to explore the soft tissue information of the CT-CBCT images to perform deformable image registration (DIR), making efforts to overcome the poor signal-to-noise ratio and HU calibration issues that limits CBCT use for treatment planning purposes. Warped CT images and contours were generated and their impact in adaptive radiotherapy was evaluated by DVH analysis for photon and proton treatments. Considerable discrepancies, related to the treatment planning dose distribution, might be found due to changes in patient’s anatomy. (author)

  1. Accuracy Validation for Medical Image Registration Algorithms: a Review

    Institute of Scientific and Technical Information of China (English)

    Zhe Liu; Xiang Deng; Guang-zhi Wang

    2012-01-01

    Accuracy validation is essential to clinical application of medical image registration techniques.Registration validation remains a challenging problem in practice mainly due to lack of 'ground truth'.In this paper,an overview of current validation methods for medical image registration is presented with detailed discussion of their benefits and drawbacks.Special focus is on non-rigid registration validation.Promising solution is also discussed.

  2. Hierarchical Non-linear Image Registration Integrating Deformable Segmentation

    Institute of Scientific and Technical Information of China (English)

    RAN Xin; QI Fei-hu

    2005-01-01

    A hierarchical non-linear method for image registration was presented, which integrates image segmentation and registration under a variational framework. An improved deformable model is used to simultaneously segment and register feature from multiple images. The objects in the image pair are segmented by evolving a single contour and meanwhile the parameters of affine registration transformation are found out. After that, a contour-constrained elastic registration is applied to register the images correctly. The experimental results indicate that the proposed approach is effective to segment and register medical images.

  3. Medical image registration using sparse coding of image patches.

    Science.gov (United States)

    Afzali, Maryam; Ghaffari, Aboozar; Fatemizadeh, Emad; Soltanian-Zadeh, Hamid

    2016-06-01

    Image registration is a basic task in medical image processing applications like group analysis and atlas construction. Similarity measure is a critical ingredient of image registration. Intensity distortion of medical images is not considered in most previous similarity measures. Therefore, in the presence of bias field distortions, they do not generate an acceptable registration. In this paper, we propose a sparse based similarity measure for mono-modal images that considers non-stationary intensity and spatially-varying distortions. The main idea behind this measure is that the aligned image is constructed by an analysis dictionary trained using the image patches. For this purpose, we use "Analysis K-SVD" to train the dictionary and find the sparse coefficients. We utilize image patches to construct the analysis dictionary and then we employ the proposed sparse similarity measure to find a non-rigid transformation using free form deformation (FFD). Experimental results show that the proposed approach is able to robustly register 2D and 3D images in both simulated and real cases. The proposed method outperforms other state-of-the-art similarity measures and decreases the transformation error compared to the previous methods. Even in the presence of bias field distortion, the proposed method aligns images without any preprocessing.

  4. 3D/2D Registration of medical images

    OpenAIRE

    Tomaževič, D.

    2008-01-01

    The topic of this doctoral dissertation is registration of 3D medical images to corresponding projective 2D images, referred to as 3D/2D registration. There are numerous possible applications of 3D/2D registration in image-aided diagnosis and treatment. In most of the applications, 3D/2D registration provides the location and orientation of the structures in a preoperative 3D CT or MR image with respect to intraoperative 2D X-ray images. The proposed doctoral dissertation tries to find origin...

  5. Nonrigid registration of volumetric images using ranked order statistics

    DEFF Research Database (Denmark)

    Tennakoon, Ruwan; Bab-Hadiashar, Alireza; Cao, Zhenwei

    2014-01-01

    Non-rigid image registration techniques using intensity based similarity measures are widely used in medical imaging applications. Due to high computational complexities of these techniques, particularly for volumetric images, finding appropriate registration methods to both reduce the computation...... burden and increase the registration accuracy has become an intensive area of research. In this paper we propose a fast and accurate non-rigid registration method for intra-modality volumetric images. Our approach exploits the information provided by an order statistics based segmentation method, to find...... the important regions for registration and use an appropriate sampling scheme to target those areas and reduce the registration computation time. A unique advantage of the proposed method is its ability to identify the point of diminishing returns and stop the registration process. Our experiments...

  6. Automatic registration of terrestrial point cloud using panoramic reflectance images

    NARCIS (Netherlands)

    Kang, Z.

    2008-01-01

    Much attention is paid to registration of terrestrial point clouds nowadays. Research is carried out towards improved efficiency and automation of the registration process. This paper reports a new approach for point clouds registration utilizing reflectance panoramic images. The approach follows a

  7. Automatic Image Registration Technique of Remote Sensing Images

    Directory of Open Access Journals (Sweden)

    M. Wahed

    2013-03-01

    Full Text Available Image registration is a crucial step in most image processing tasks for which the final result is achieved from a combination of various resources. Automatic registration of remote-sensing images is a difficult task as it must deal with the intensity changes and variation of scale, rotation and illumination of the images. This paper proposes image registration technique of multi-view, multi- temporal and multi-spectral remote sensing images. Firstly, a preprocessing step is performed by applying median filtering to enhance the images. Secondly, the Steerable Pyramid Transform is adopted to produce multi-resolution levels of reference and sensed images; then, the Scale Invariant Feature Transform (SIFT is utilized for extracting feature points that can deal with the large variations of scale, rotation and illumination between images .Thirdly, matching the features points by using the Euclidian distance ratio; then removing the false matching pairs using the RANdom SAmple Consensus (RANSAC algorithm. Finally, the mapping function is obtained by the affine transformation. Quantitative comparisons of our technique with the related techniques show a significant improvement in the presence of large scale, rotation changes, and the intensity changes. The effectiveness of the proposed technique is demonstrated by the experimental results.

  8. Wavelet-based Evapotranspiration Forecasts

    Science.gov (United States)

    Bachour, R.; Maslova, I.; Ticlavilca, A. M.; McKee, M.; Walker, W.

    2012-12-01

    Providing a reliable short-term forecast of evapotranspiration (ET) could be a valuable element for improving the efficiency of irrigation water delivery systems. In the last decade, wavelet transform has become a useful technique for analyzing the frequency domain of hydrological time series. This study shows how wavelet transform can be used to access statistical properties of evapotranspiration. The objective of the research reported here is to use wavelet-based techniques to forecast ET up to 16 days ahead, which corresponds to the LANDSAT 7 overpass cycle. The properties of the ET time series, both physical and statistical, are examined in the time and frequency domains. We use the information about the energy decomposition in the wavelet domain to extract meaningful components that are used as inputs for ET forecasting models. Seasonal autoregressive integrated moving average (SARIMA) and multivariate relevance vector machine (MVRVM) models are coupled with the wavelet-based multiresolution analysis (MRA) results and used to generate short-term ET forecasts. Accuracy of the models is estimated and model robustness is evaluated using the bootstrap approach.

  9. Multi-modality image registration using the decomposition model

    Science.gov (United States)

    Ibrahim, Mazlinda; Chen, Ke

    2017-04-01

    In medical image analysis, image registration is one of the crucial steps required to facilitate automatic segmentation, treatment planning and other application involving imaging machines. Image registration, also known as image matching, aims to align two or more images so that information obtained can be compared and combined. Different imaging modalities and their characteristics make the task more challenging. We propose a decomposition model combining parametric and non-parametric deformation for multi-modality image registration. Numerical results show that the normalised gradient field perform better than the mutual information with the decomposition model.

  10. A NEW IMAGE REGISTRATION METHOD FOR GREY IMAGES

    Institute of Scientific and Technical Information of China (English)

    Nie Xuan; Zhao Rongchun; Jiang Zetao

    2004-01-01

    The proposed algorithm relies on a group of new formulas for calculating tangent slope so as to address angle feature of edge curves of image. It can utilize tangent angle features to estimate automatically and fully the rotation parameters of geometric transform and enable rough matching of images with huge rotation difference. After angle compensation, it can search for matching point sets by correlation criterion, then calculate parameters of affine transform, enable higher-precision emendation of rotation and transferring. Finally, it fulfills precise matching for images with relax-tense iteration method. Compared with the registration approach based on wavelet direction-angle features, the matching algorithm with tangent feature of image edge is more robust and realizes precise registration of various images. Furthermore, it is also helpful in graphics matching.

  11. A statistical framework for inter-group image registration.

    Science.gov (United States)

    Liao, Shu; Wu, Guorong; Shen, Dinggang

    2012-10-01

    Groupwise image registration plays an important role in medical image analysis. The principle of groupwise image registration is to align a given set of images to a hidden template space in an iteratively manner without explicitly selecting any individual image as the template. Although many approaches have been proposed to address the groupwise image registration problem for registering a single group of images, few attentions and efforts have been paid to the registration problem between two or more different groups of images. In this paper, we propose a statistical framework to address the registration problems between two different image groups. The main contributions of this paper lie in the following aspects: (1) In this paper, we demonstrate that directly registering the group mean images estimated from two different image groups is not sufficient to establish the reliable transformation from one image group to the other image group. (2) A novel statistical framework is proposed to extract anatomical features from the white matter, gray matter and cerebrospinal fluid tissue maps of all aligned images as morphological signatures for each voxel. The extracted features provide much richer anatomical information than the voxel intensity of the group mean image, and can be integrated with the multi-channel Demons registration algorithm to perform the registration process. (3) The proposed method has been extensively evaluated on two publicly available brain MRI databases: the LONI LPBA40 and the IXI databases, and it is also compared with a conventional inter-group image registration approach which directly performs deformable registration between the group mean images of two image groups. Experimental results show that the proposed method consistently achieves higher registration accuracy than the method under comparison.

  12. Efficient Variational Approaches for Deformable Registration of Images

    Directory of Open Access Journals (Sweden)

    Mehmet Ali Akinlar

    2012-01-01

    Full Text Available Dirichlet, anisotropic, and Huber regularization terms are presented for efficient registration of deformable images. Image registration, an ill-posed optimization problem, is solved using a gradient-descent-based method and some fundamental theorems in calculus of variations. Euler-Lagrange equations with homogeneous Neumann boundary conditions are obtained. These equations are discretized by multigrid and finite difference numerical techniques. The method is applied to the registration of brain MR images of size 65×65. Computational results indicate that the presented method is quite fast and efficient in the registration of deformable medical images.

  13. Image Registration for Targeted MRI-guided Transperineal Prostate Biopsy

    Science.gov (United States)

    Fedorov, Andriy; Tuncali, Kemal; Fennessy, Fiona M.; Tokuda, Junichi; Hata, Nobuhiko; Wells, William M.; Kikinis, Ron; Tempany, Clare M.

    2012-01-01

    Purpose To develop and evaluate image registration methodology for automated re-identification of tumor-suspicious foci from pre-procedural MR exams during MR-guided transperineal prostate core biopsy. Materials and Methods A hierarchical approach for automated registration between planning and intra-procedural T2-weighted prostate MRI was developed and evaluated on the images acquired during 10 consecutive MR-guided biopsies. Registration accuracy was quantified at image-based landmarks and by evaluating spatial overlap for the manually segmented prostate and sub-structures. Registration reliability was evaluated by simulating initial mis-registration and analyzing the convergence behavior. Registration precision was characterized at the planned biopsy targets. Results The total computation time was compatible with a clinical setting, being at most 2 minutes. Deformable registration led to a significant improvement in spatial overlap of the prostate and peripheral zone contours compared to both rigid and affine registration. Average in-slice landmark registration error was 1.3±0.5 mm. Experiments simulating initial mis-registration resulted in an estimated average capture range of 6 mm and an average in-slice registration precision of ±0.3 mm. Conclusion Our registration approach requires minimum user interaction and is compatible with the time constraints of our interventional clinical workflow. The initial evaluation shows acceptable accuracy, reliability and consistency of the method. PMID:22645031

  14. DOCUMENT IMAGE REGISTRATION FOR IMPOSED LAYER EXTRACTION

    Directory of Open Access Journals (Sweden)

    Surabhi Narayan

    2017-02-01

    Full Text Available Extraction of filled-in information from document images in the presence of template poses challenges due to geometrical distortion. Filled-in document image consists of null background, general information foreground and vital information imposed layer. Template document image consists of null background and general information foreground layer. In this paper a novel document image registration technique has been proposed to extract imposed layer from input document image. A convex polygon is constructed around the content of the input and the template image using convex hull. The vertices of the convex polygons of input and template are paired based on minimum Euclidean distance. Each vertex of the input convex polygon is subjected to transformation for the permutable combinations of rotation and scaling. Translation is handled by tight crop. For every transformation of the input vertices, Minimum Hausdorff distance (MHD is computed. Minimum Hausdorff distance identifies the rotation and scaling values by which the input image should be transformed to align it to the template. Since transformation is an estimation process, the components in the input image do not overlay exactly on the components in the template, therefore connected component technique is applied to extract contour boxes at word level to identify partially overlapping components. Geometrical features such as density, area and degree of overlapping are extracted and compared between partially overlapping components to identify and eliminate components common to input image and template image. The residue constitutes imposed layer. Experimental results indicate the efficacy of the proposed model with computational complexity. Experiment has been conducted on variety of filled-in forms, applications and bank cheques. Data sets have been generated as test sets for comparative analysis.

  15. Groupwise registration of MR brain images with tumors

    Science.gov (United States)

    Tang, Zhenyu; Wu, Yihong; Fan, Yong

    2017-09-01

    A novel groupwise image registration framework is developed for registering MR brain images with tumors. Our method iteratively estimates a normal-appearance counterpart for each tumor image to be registered and constructs a directed graph (digraph) of normal-appearance images to guide the groupwise image registration. Particularly, our method maps each tumor image to its normal appearance counterpart by identifying and inpainting brain tumor regions with intensity information estimated using a low-rank plus sparse matrix decomposition based image representation technique. The estimated normal-appearance images are groupwisely registered to a group center image guided by a digraph of images so that the total length of ‘image registration paths’ to be the minimum, and then the original tumor images are warped to the group center image using the resulting deformation fields. We have evaluated our method based on both simulated and real MR brain tumor images. The registration results were evaluated with overlap measures of corresponding brain regions and average entropy of image intensity information, and Wilcoxon signed rank tests were adopted to compare different methods with respect to their regional overlap measures. Compared with a groupwise image registration method that is applied to normal-appearance images estimated using the traditional low-rank plus sparse matrix decomposition based image inpainting, our method achieved higher image registration accuracy with statistical significance (p  =  7.02  ×  10-9).

  16. Fingerprint spoof detection using wavelet based local binary pattern

    Science.gov (United States)

    Kumpituck, Supawan; Li, Dongju; Kunieda, Hiroaki; Isshiki, Tsuyoshi

    2017-02-01

    In this work, a fingerprint spoof detection method using an extended feature, namely Wavelet-based Local Binary Pattern (Wavelet-LBP) is introduced. Conventional wavelet-based methods calculate wavelet energy of sub-band images as the feature for discrimination while we propose to use Local Binary Pattern (LBP) operation to capture the local appearance of the sub-band images instead. The fingerprint image is firstly decomposed by two-dimensional discrete wavelet transform (2D-DWT), and then LBP is applied on the derived wavelet sub-band images. Furthermore, the extracted features are used to train Support Vector Machine (SVM) classifier to create the model for classifying the fingerprint images into genuine and spoof. Experiments that has been done on Fingerprint Liveness Detection Competition (LivDet) datasets show the improvement of the fingerprint spoof detection by using the proposed feature.

  17. Enhancing retinal images by nonlinear registration

    Science.gov (United States)

    Molodij, G.; Ribak, E. N.; Glanc, M.; Chenegros, G.

    2015-05-01

    Being able to image the human retina in high resolution opens a new era in many important fields, such as pharmacological research for retinal diseases, researches in human cognition, nervous system, metabolism and blood stream, to name a few. In this paper, we propose to share the knowledge acquired in the fields of optics and imaging in solar astrophysics in order to improve the retinal imaging in the perspective to perform a medical diagnosis. The main purpose would be to assist health care practitioners by enhancing the spatial resolution of the retinal images and increase the level of confidence of the abnormal feature detection. We apply a nonlinear registration method using local correlation tracking to increase the field of view and follow structure evolutions using correlation techniques borrowed from solar astronomy technique expertise. Another purpose is to define the tracer of movements after analyzing local correlations to follow the proper motions of an image from one moment to another, such as changes in optical flows that would be of high interest in a medical diagnosis.

  18. DTI Image Registration under Probabilistic Fiber Bundles Tractography Learning

    Science.gov (United States)

    Lei, Tao; Fan, Yangyu; Zhang, Xiuwei

    2016-01-01

    Diffusion Tensor Imaging (DTI) image registration is an essential step for diffusion tensor image analysis. Most of the fiber bundle based registration algorithms use deterministic fiber tracking technique to get the white matter fiber bundles, which will be affected by the noise and volume. In order to overcome the above problem, we proposed a Diffusion Tensor Imaging image registration method under probabilistic fiber bundles tractography learning. Probabilistic tractography technique can more reasonably trace to the structure of the nerve fibers. The residual error estimation step in active sample selection learning is improved by modifying the residual error model using finite sample set. The calculated deformation field is then registered on the DTI images. The results of our proposed registration method are compared with 6 state-of-the-art DTI image registration methods under visualization and 3 quantitative evaluation standards. The experimental results show that our proposed method has a good comprehensive performance.

  19. GPUs benchmarking in subpixel image registration algorithm

    Science.gov (United States)

    Sanz-Sabater, Martin; Picazo-Bueno, Jose Angel; Micó, Vicente; Ferrerira, Carlos; Granero, Luis; Garcia, Javier

    2015-05-01

    Image registration techniques are used among different scientific fields, like medical imaging or optical metrology. The straightest way to calculate shifting between two images is using the cross correlation, taking the highest value of this correlation image. Shifting resolution is given in whole pixels which cannot be enough for certain applications. Better results can be achieved interpolating both images, as much as the desired resolution we want to get, and applying the same technique described before, but the memory needed by the system is significantly higher. To avoid memory consuming we are implementing a subpixel shifting method based on FFT. With the original images, subpixel shifting can be achieved multiplying its discrete Fourier transform by a linear phase with different slopes. This method is high time consuming method because checking a concrete shifting means new calculations. The algorithm, highly parallelizable, is very suitable for high performance computing systems. GPU (Graphics Processing Unit) accelerated computing became very popular more than ten years ago because they have hundreds of computational cores in a reasonable cheap card. In our case, we are going to register the shifting between two images, doing the first approach by FFT based correlation, and later doing the subpixel approach using the technique described before. We consider it as `brute force' method. So we will present a benchmark of the algorithm consisting on a first approach (pixel resolution) and then do subpixel resolution approaching, decreasing the shifting step in every loop achieving a high resolution in few steps. This program will be executed in three different computers. At the end, we will present the results of the computation, with different kind of CPUs and GPUs, checking the accuracy of the method, and the time consumed in each computer, discussing the advantages, disadvantages of the use of GPUs.

  20. Constrained non-rigid registration for whole body image registration: method and validation

    Science.gov (United States)

    Li, Xia; Yankeelov, Thomas E.; Peterson, Todd E.; Gore, John C.; Dawant, Benoit M.

    2007-03-01

    3D intra- and inter-subject registration of image volumes is important for tasks that include measurements and quantification of temporal/longitudinal changes, atlas-based segmentation, deriving population averages, or voxel and tensor-based morphometry. A number of methods have been proposed to tackle this problem but few of them have focused on the problem of registering whole body image volumes acquired either from humans or small animals. These image volumes typically contain a large number of articulated structures, which makes registration more difficult than the registration of head images, to which the vast majority of registration algorithms have been applied. To solve this problem, we have previously proposed an approach, which initializes an intensity-based non-rigid registration algorithm with a point based registration technique [1, 2]. In this paper, we introduce new constraints into our non-rigid registration algorithm to prevent the bones from being deformed inaccurately. Results we have obtained show that the new constrained algorithm leads to better registration results than the previous one.

  1. Learning-Based Approaches to Deformable Image Registration

    NARCIS (Netherlands)

    Munzing, S.E.A.

    2014-01-01

    Accurate registration of images is an important and often crucial step in many areas of image processing and analysis, yet it is only used in a small percentage of possible applications. Automated registration methods are not considered to be sufficiently robust to handle complex deformations and lo

  2. A framework for shape matching in deformable image registration

    DEFF Research Database (Denmark)

    Noe, Karsten Østergaard; Mosegaard, Jesper; Tanderup, Kari

    2008-01-01

    Many existing image registration methods have difficulties in accurately describing significant rotation and bending of entities (e.g. organs) between two datasets. A common problem in this case is to ensure that the resulting registration is physically plausible, i.e. that the registration...... describes the actual bending/rotation occurring rather than just introducing expansion in some areas and shrinkage in others. In this work we developed a general framework for deformable image registration of two 3D datasets that alleviates this problem. To ensure that only physically feasible and plausible...

  3. Microscopic neural image registration based on the structure of mitochondria

    Science.gov (United States)

    Cao, Huiwen; Han, Hua; Rao, Qiang; Xiao, Chi; Chen, Xi

    2017-02-01

    Microscopic image registration is a key component of the neural structure reconstruction with serial sections of neural tissue. The goal of microscopic neural image registration is to recover the 3D continuity and geometrical properties of specimen. During image registration, various distortions need to be corrected, including image rotation, translation, tissue deformation et.al, which come from the procedure of sample cutting, staining and imaging. Furthermore, there is only certain similarity between adjacent sections, and the degree of similarity depends on local structure of the tissue and the thickness of the sections. These factors make the microscopic neural image registration a challenging problem. To tackle the difficulty of corresponding landmarks extraction, we introduce a novel image registration method for Scanning Electron Microscopy (SEM) images of serial neural tissue sections based on the structure of mitochondria. The ellipsoidal shape of mitochondria ensures that the same mitochondria has similar shape between adjacent sections, and its characteristic of broad distribution in the neural tissue guarantees that landmarks based on the mitochondria distributed widely in the image. The proposed image registration method contains three parts: landmarks extraction between adjacent sections, corresponding landmarks matching and image deformation based on the correspondences. We demonstrate the performance of our method with SEM images of drosophila brain.

  4. Multi-band Image Registration Method Based on Fourier Transform

    Institute of Scientific and Technical Information of China (English)

    庹红娅; 刘允才

    2004-01-01

    This paper presented a registration method based on Fourier transform for multi-band images which is involved in translation and small rotation. Although different band images differ a lot in the intensity and features,they contain certain common information which we can exploit. A model was given that the multi-band images have linear correlations under the least-square sense. It is proved that the coefficients have no effect on the registration progress if two images have linear correlations. Finally, the steps of the registration method were proposed. The experiments show that the model is reasonable and the results are satisfying.

  5. Registration of Standardized Histological Images in Feature Space

    CERN Document Server

    Bagci, Ulas; 10.1117/12.770219

    2009-01-01

    In this paper, we propose three novel and important methods for the registration of histological images for 3D reconstruction. First, possible intensity variations and nonstandardness in images are corrected by an intensity standardization process which maps the image scale into a standard scale where the similar intensities correspond to similar tissues meaning. Second, 2D histological images are mapped into a feature space where continuous variables are used as high confidence image features for accurate registration. Third, we propose an automatic best reference slice selection algorithm that improves reconstruction quality based on both image entropy and mean square error of the registration process. We demonstrate that the choice of reference slice has a significant impact on registration error, standardization, feature space and entropy information. After 2D histological slices are registered through an affine transformation with respect to an automatically chosen reference, the 3D volume is reconstruct...

  6. Automatic nonrigid registration of whole body CT mice images.

    Science.gov (United States)

    Li, Xia; Yankeelov, Thomas E; Peterson, Todd E; Gore, John C; Dawant, Benoit M

    2008-04-01

    Three-dimensional intra- and intersubject registration of image volumes is important for tasks that include quantification of temporal/longitudinal changes, atlas-based segmentation, computing population averages, or voxel and tensor-based morphometry. While a number of methods have been proposed to address this problem, few have focused on the problem of registering whole body image volumes acquired either from humans or small animals. These image volumes typically contain a large number of articulated structures, which makes registration more difficult than the registration of head images, to which the majority of registration algorithms have been applied. This article presents a new method for the automatic registration of whole body computed tomography (CT) volumes, which consists of two main steps. Skeletons are first brought into approximate correspondence with a robust point-based method. Transformations so obtained are refined with an intensity-based nonrigid registration algorithm that includes spatial adaptation of the transformation's stiffness. The approach has been applied to whole body CT images of mice, to CT images of the human upper torso, and to human head and neck CT images. To validate the authors method on soft tissue structures, which are difficult to see in CT images, the authors use coregistered magnetic resonance images. They demonstrate that the approach they propose can successfully register image volumes even when these volumes are very different in size and shape or if they have been acquired with the subjects in different positions.

  7. Analysis of a wavelet-based robust hash algorithm

    Science.gov (United States)

    Meixner, Albert; Uhl, Andreas

    2004-06-01

    This paper paper is a quantitative evaluation of a wavelet-based, robust authentication hashing algorithm. Based on the results of a series of robustness and tampering sensitivity tests, we describepossible shortcomings and propose variousmodifications to the algorithm to improve its performance. The second part of the paper describes and attack against the scheme. It allows an attacker to modify a tampered image, such that it's hash value closely matches the hash value of the original.

  8. Non-rigid image registration using bone growth model

    DEFF Research Database (Denmark)

    Bro-Nielsen, Morten; Gramkow, Claus; Kreiborg, Sven

    1997-01-01

    Non-rigid registration has traditionally used physical models like elasticity and fluids. These models are very seldom valid models of the difference between the registered images. This paper presents a non-rigid registration algorithm, which uses a model of bone growth as a model of the change b...

  9. The role of image registration in brain mapping.

    Science.gov (United States)

    Toga, A W; Thompson, P M

    2001-01-01

    Image registration is a key step in a great variety of biomedical imaging applications. It provides the ability to geometrically align one dataset with another, and is a prerequisite for all imaging applications that compare datasets across subjects, imaging modalities, or across time. Registration algorithms also enable the pooling and comparison of experimental findings across laboratories, the construction of population-based brain atlases, and the creation of systems to detect group patterns in structural and functional imaging data. We review the major types of registration approaches used in brain imaging today. We focus on their conceptual basis, the underlying mathematics, and their strengths and weaknesses in different contexts. We describe the major goals of registration, including data fusion, quantification of change, automated image segmentation and labeling, shape measurement, and pathology detection. We indicate that registration algorithms have great potential when used in conjunction with a digital brain atlas, which acts as a reference system in which brain images can be compared for statistical analysis. The resulting armory of registration approaches is fundamental to medical image analysis, and in a brain mapping context provides a means to elucidate clinical, demographic, or functional trends in the anatomy or physiology of the brain.

  10. A Novel Technique for Prealignment in Multimodality Medical Image Registration

    Directory of Open Access Journals (Sweden)

    Wu Zhou

    2014-01-01

    Full Text Available Image pair is often aligned initially based on a rigid or affine transformation before a deformable registration method is applied in medical image registration. Inappropriate initial registration may compromise the registration speed or impede the convergence of the optimization algorithm. In this work, a novel technique was proposed for prealignment in both monomodality and multimodality image registration based on statistical correlation of gradient information. A simple and robust algorithm was proposed to determine the rotational differences between two images based on orientation histogram matching accumulated from local orientation of each pixel without any feature extraction. Experimental results showed that it was effective to acquire the orientation angle between two unregistered images with advantages over the existed method based on edge-map in multimodalities. Applying the orientation detection into the registration of CT/MR, T1/T2 MRI, and monomadality images with respect to rigid and nonrigid deformation improved the chances of finding the global optimization of the registration and reduced the search space of optimization.

  11. Current trends in medical image registration and fusion

    Directory of Open Access Journals (Sweden)

    Fatma El-Zahraa Ahmed El-Gamal

    2016-03-01

    Full Text Available Recently, medical image registration and fusion processes are considered as a valuable assistant for the medical experts. The role of these processes arises from their ability to help the experts in the diagnosis, following up the diseases’ evolution, and deciding the necessary therapies regarding the patient’s condition. Therefore, the aim of this paper is to focus on medical image registration as well as medical image fusion. In addition, the paper presents a description of the common diagnostic images along with the main characteristics of each of them. The paper also illustrates most well-known toolkits that have been developed to help the working with the registration and fusion processes. Finally, the paper presents the current challenges associated with working with medical image registration and fusion through illustrating the recent diseases/disorders that were addressed through such an analyzing process.

  12. Optimal atlas construction through hierarchical image registration

    Science.gov (United States)

    Grevera, George J.; Udupa, Jayaram K.; Odhner, Dewey; Torigian, Drew A.

    2016-03-01

    Atlases (digital or otherwise) are common in medicine. However, there is no standard framework for creating them from medical images. One traditional approach is to pick a representative subject and then proceed to label structures/regions of interest in this image. Another is to create a "mean" or average subject. Atlases may also contain more than a single representative (e.g., the Visible Human contains both a male and a female data set). Other criteria besides gender may be used as well, and the atlas may contain many examples for a given criterion. In this work, we propose that atlases be created in an optimal manner using a well-established graph theoretic approach using a min spanning tree (or more generally, a collection of them). The resulting atlases may contain many examples for a given criterion. In fact, our framework allows for the addition of new subjects to the atlas to allow it to evolve over time. Furthermore, one can apply segmentation methods to the graph (e.g., graph-cut, fuzzy connectedness, or cluster analysis) which allow it to be separated into "sub-atlases" as it evolves. We demonstrate our method by applying it to 50 3D CT data sets of the chest region, and by comparing it to a number of traditional methods using measures such as Mean Squared Difference, Mattes Mutual Information, and Correlation, and for rigid registration. Our results demonstrate that optimal atlases can be constructed in this manner and outperform other methods of construction using freely available software.

  13. Multimodal image fusion with SIMS: Preprocessing with image registration.

    Science.gov (United States)

    Tarolli, Jay Gage; Bloom, Anna; Winograd, Nicholas

    2016-06-14

    In order to utilize complementary imaging techniques to supply higher resolution data for fusion with secondary ion mass spectrometry (SIMS) chemical images, there are a number of aspects that, if not given proper consideration, could produce results which are easy to misinterpret. One of the most critical aspects is that the two input images must be of the same exact analysis area. With the desire to explore new higher resolution data sources that exists outside of the mass spectrometer, this requirement becomes even more important. To ensure that two input images are of the same region, an implementation of the insight segmentation and registration toolkit (ITK) was developed to act as a preprocessing step before performing image fusion. This implementation of ITK allows for several degrees of movement between two input images to be accounted for, including translation, rotation, and scale transforms. First, the implementation was confirmed to accurately register two multimodal images by supplying a known transform. Once validated, two model systems, a copper mesh grid and a group of RAW 264.7 cells, were used to demonstrate the use of the ITK implementation to register a SIMS image with a microscopy image for the purpose of performing image fusion.

  14. Piecewise nonlinear image registration using DCT basis functions

    Science.gov (United States)

    Gan, Lin; Agam, Gady

    2015-03-01

    The deformation field in nonlinear image registration is usually modeled by a global model. Such models are often faced with the problem that a locally complex deformation cannot be accurately modeled by simply increasing degrees of freedom (DOF). In addition, highly complex models require additional regularization which is usually ineffective when applied globally. Registering locally corresponding regions addresses this problem in a divide and conquer strategy. In this paper we propose a piecewise image registration approach using Discrete Cosine Transform (DCT) basis functions for a nonlinear model. The contributions of this paper are three-folds. First, we develop a multi-level piecewise registration framework that extends the concept of piecewise linear registration and works with any nonlinear deformation model. This framework is then applied to nonlinear DCT registration. Second, we show how adaptive model complexity and regularization could be applied for local piece registration, thus accounting for higher variability. Third, we show how the proposed piecewise DCT can overcome the fundamental problem of a large curvature matrix inversion in global DCT when using high degrees of freedoms. The proposed approach can be viewed as an extension of global DCT registration where the overall model complexity is increased while achieving effective local regularization. Experimental evaluation results provide comparison of the proposed approach to piecewise linear registration using an affine transformation model and a global nonlinear registration using DCT model. Preliminary results show that the proposed approach achieves improved performance.

  15. INTER-GROUP IMAGE REGISTRATION BY HIERARCHICAL GRAPH SHRINKAGE.

    Science.gov (United States)

    Ying, Shihui; Wu, Guorong; Liao, Shu; Shen, Dinggang

    2013-12-31

    In this paper, we propose a novel inter-group image registration method to register different groups of images (e.g., young and elderly brains) simultaneously. Specifically, we use a hierarchical two-level graph to model the distribution of entire images on the manifold, with intra-graph representing the image distribution in each group and the inter-graph describing the relationship between two groups. Then the procedure of inter-group registration is formulated as a dynamic evolution of graph shrinkage. The advantage of our method is that the topology of entire image distribution is explored to guide the image registration. In this way, each image coordinates with its neighboring images on the manifold to deform towards the population center, by following the deformation pathway simultaneously optimized within the graph. Our proposed method has been also compared with other state-of-the-art inter-group registration methods, where our method achieves better registration results in terms of registration accuracy and robustness.

  16. Image Classifying Registration for Gaussian & Bayesian Techniques: A Review

    Directory of Open Access Journals (Sweden)

    Rahul Godghate,

    2014-04-01

    Full Text Available A Bayesian Technique for Image Classifying Registration to perform simultaneously image registration and pixel classification. Medical image registration is critical for the fusion of complementary information about patient anatomy and physiology, for the longitudinal study of a human organ over time and the monitoring of disease development or treatment effect, for the statistical analysis of a population variation in comparison to a so-called digital atlas, for image-guided therapy, etc. A Bayesian Technique for Image Classifying Registration is well-suited to deal with image pairs that contain two classes of pixels with different inter-image intensity relationships. We will show through different experiments that the model can be applied in many different ways. For instance if the class map is known, then it can be used for template-based segmentation. If the full model is used, then it can be applied to lesion detection by image comparison. Experiments have been conducted on both real and simulated data. It show that in the presence of an extra-class, the classifying registration improves both the registration and the detection, especially when the deformations are small. The proposed model is defined using only two classes but it is straightforward to extend it to an arbitrary number of classes.

  17. elastix: a toolbox for intensity-based medical image registration.

    Science.gov (United States)

    Klein, Stefan; Staring, Marius; Murphy, Keelin; Viergever, Max A; Pluim, Josien P W

    2010-01-01

    Medical image registration is an important task in medical image processing. It refers to the process of aligning data sets, possibly from different modalities (e.g., magnetic resonance and computed tomography), different time points (e.g., follow-up scans), and/or different subjects (in case of population studies). A large number of methods for image registration are described in the literature. Unfortunately, there is not one method that works for all applications. We have therefore developed elastix, a publicly available computer program for intensity-based medical image registration. The software consists of a collection of algorithms that are commonly used to solve medical image registration problems. The modular design of elastix allows the user to quickly configure, test, and compare different registration methods for a specific application. The command-line interface enables automated processing of large numbers of data sets, by means of scripting. The usage of elastix for comparing different registration methods is illustrated with three example experiments, in which individual components of the registration method are varied.

  18. Multi-modal registration for correlative microscopy using image analogies.

    Science.gov (United States)

    Cao, Tian; Zach, Christopher; Modla, Shannon; Powell, Debbie; Czymmek, Kirk; Niethammer, Marc

    2014-08-01

    Correlative microscopy is a methodology combining the functionality of light microscopy with the high resolution of electron microscopy and other microscopy technologies for the same biological specimen. In this paper, we propose an image registration method for correlative microscopy, which is challenging due to the distinct appearance of biological structures when imaged with different modalities. Our method is based on image analogies and allows to transform images of a given modality into the appearance-space of another modality. Hence, the registration between two different types of microscopy images can be transformed to a mono-modality image registration. We use a sparse representation model to obtain image analogies. The method makes use of corresponding image training patches of two different imaging modalities to learn a dictionary capturing appearance relations. We test our approach on backscattered electron (BSE) scanning electron microscopy (SEM)/confocal and transmission electron microscopy (TEM)/confocal images. We perform rigid, affine, and deformable registration via B-splines and show improvements over direct registration using both mutual information and sum of squared differences similarity measures to account for differences in image appearance. Copyright © 2013 Elsevier B.V. All rights reserved.

  19. Wavelet-based coding of ultraspectral sounder data

    Science.gov (United States)

    Garcia-Vilchez, Fernando; Serra-Sagrista, Joan; Auli-Llinas, Francesc

    2005-08-01

    In this paper we provide a study concerning the suitability of well-known image coding techniques originally devised for lossy compression of still natural images when applied to lossless compression of ultraspectral sounder data. We present here the experimental results of six wavelet-based widespread coding techniques, namely EZW, IC, SPIHT, JPEG2000, SPECK and CCSDS-IDC. Since the considered techniques are 2-dimensional (2D) in nature but the ultraspectral data are 3D, a pre-processing stage is applied to convert the two spatial dimensions into a single spatial dimension. All the wavelet-based techniques are competitive when compared either to the benchmark prediction-based methods for lossless compression, CALIC and JPEG-LS, or to two common compression utilities, GZIP and BZIP2. EZW, SPIHT, SPECK and CCSDS-IDC provide a very similar performance, while IC and JPEG2000 improve the compression factor when compared to the other wavelet-based methods. Nevertheless, they are not competitive when compared to a fast precomputed vector quantizer. The benefits of applying a pre-processing stage, the Bias Adjusted Reordering, prior to the coding process in order to further exploit the spectral and/or spatial correlation when 2D techniques are employed, are also presented.

  20. Spatial Information Based Medical Image Registration using Mutual Information

    Directory of Open Access Journals (Sweden)

    Benzheng Wei

    2011-06-01

    Full Text Available Image registration is a valuable technique for medical diagnosis and treatment. Due to the inferiority of image registration using maximum mutual information, a new hybrid method of multimodality medical image registration based on mutual information of spatial information is proposed. The new measure that combines mutual information, spatial information and feature characteristics, is proposed. Edge points are used as features, obtained from a morphology gradient detector. Feature characteristics like location, edge strength and orientation are taken into account to compute a joint probability distribution of corresponding edge points in two images. Mutual information based on this function is minimized to find the best alignment parameters. Finally, the translation parameters are calculated by using a modified Particle Swarm Optimization (MPSO algorithm. The experimental results demonstrate the effectiveness of the proposed registration scheme.

  1. Enhanced ATM Security using Biometric Authentication and Wavelet Based AES

    Directory of Open Access Journals (Sweden)

    Sreedharan Ajish

    2016-01-01

    Full Text Available The traditional ATM terminal customer recognition systems rely only on bank cards, passwords and such identity verification methods are not perfect and functions are too single. Biometrics-based authentication offers several advantages over other authentication methods, there has been a significant surge in the use of biometrics for user authentication in recent years. This paper presents a highly secured ATM banking system using biometric authentication and wavelet based Advanced Encryption Standard (AES algorithm. Two levels of security are provided in this proposed design. Firstly we consider the security level at the client side by providing biometric authentication scheme along with a password of 4-digit long. Biometric authentication is achieved by considering the fingerprint image of the client. Secondly we ensure a secured communication link between the client machine to the bank server using an optimized energy efficient and wavelet based AES processor. The fingerprint image is the data for encryption process and 4-digit long password is the symmetric key for the encryption process. The performance of ATM machine depends on ultra-high-speed encryption, very low power consumption, and algorithmic integrity. To get a low power consuming and ultra-high speed encryption at the ATM machine, an optimized and wavelet based AES algorithm is proposed. In this system biometric and cryptography techniques are used together for personal identity authentication to improve the security level. The design of the wavelet based AES processor is simulated and the design of the energy efficient AES processor is simulated in Quartus-II software. Simulation results ensure its proper functionality. A comparison among other research works proves its superiority.

  2. Investigation on Fine Registration for SAR and Optical Image

    Directory of Open Access Journals (Sweden)

    You Hong-jian

    2014-02-01

    Full Text Available The registration of SAR and optical remote sensing image is the basise for fusing of multi-source image and comprehensive analysis. In this paper a new fine registration method for SAR and optical image is proposed. Firstly, three to four corresponding points are selected manually to realize a coarse registration that eliminates the differences in scale and rotation. Many characteristic points in the optical image are detected and the corresponding points in SAR image are extracted using normalized gradient correlations based on the different gradients by operators. An irregular triangle network is constructed using these corresponding points and each triangle region is finely registered. Finally SAR image and optical image are finely registered. Experiment and processed results demonstrate the feasibility of this method.

  3. Avoiding Stair-Step Artifacts in Image Registration for GOES-R Navigation and Registration Assessment

    Science.gov (United States)

    Grycewicz, Thomas J.; Tan, Bin; Isaacson, Peter J.; De Luccia, Frank J.; Dellomo, John

    2016-01-01

    In developing software for independent verification and validation (IVV) of the Image Navigation and Registration (INR) capability for the Geostationary Operational Environmental Satellite R Series (GOES-R) Advanced Baseline Imager (ABI), we have encountered an image registration artifact which limits the accuracy of image offset estimation at the subpixel scale using image correlation. Where the two images to be registered have the same pixel size, subpixel image registration preferentially selects registration values where the image pixel boundaries are close to lined up. Because of the shape of a curve plotting input displacement to estimated offset, we call this a stair-step artifact. When one image is at a higher resolution than the other, the stair-step artifact is minimized by correlating at the higher resolution. For validating ABI image navigation, GOES-R images are correlated with Landsat-based ground truth maps. To create the ground truth map, the Landsat image is first transformed to the perspective seen from the GOES-R satellite, and then is scaled to an appropriate pixel size. Minimizing processing time motivates choosing the map pixels to be the same size as the GOES-R pixels. At this pixel size image processing of the shift estimate is efficient, but the stair-step artifact is present. If the map pixel is very small, stair-step is not a problem, but image correlation is computation-intensive. This paper describes simulation-based selection of the scale for truth maps for registering GOES-R ABI images.

  4. Adaptive Local Image Registration: Analysis on Filter Size

    OpenAIRE

    Vishnukumar S; M.Wilscy

    2012-01-01

    Adaptive Local Image Registration is a Local Image Registration based on an Adaptive Filtering frame work. A filter of appropriate size convolves with reference image and gives the pixel values corresponding to the distorted image and the filter is updated in each stage of the convolution. When the filter converges to the system model, it provides the registered image. The filter size plays an important role in this method. The analysis on the filter size is done using Peak Signal-to-Noise Ra...

  5. Nonrigid Medical Image Registration Based on Mesh Deformation Constraints

    Directory of Open Access Journals (Sweden)

    XiangBo Lin

    2013-01-01

    Full Text Available Regularizing the deformation field is an important aspect in nonrigid medical image registration. By covering the template image with a triangular mesh, this paper proposes a new regularization constraint in terms of connections between mesh vertices. The connection relationship is preserved by the spring analogy method. The method is evaluated by registering cerebral magnetic resonance imaging (MRI image data obtained from different individuals. Experimental results show that the proposed method has good deformation ability and topology-preserving ability, providing a new way to the nonrigid medical image registration.

  6. KW-SIFT descriptor for remote-sensing image registration

    Institute of Scientific and Technical Information of China (English)

    Xiangzeng Liu; Zheng Tian; Weidong Yan; Xifa Duan

    2011-01-01

    A technique to construct an affine invariant descriptor for remote-sensing image registration based on the scale invariant features transform (SIFT) in a kernel space is proposed.Affine invariant SIFT descriptor is first developed in an elliptical region determined by the Hessian matrix of the feature points.Thereafter,the descriptor is mapped to a feature space induced by a kernel, and a new descriptor is constructed by whitening the mapped descriptor in the feature space, with the transform called KW-SIFT.In a final step, the new descriptor is used to register remote-sensing images.Experimental results for remote-sensing image registration indicate that the proposed method improves the registration performance as compared with other related methods.%@@ A technique to construct an affine invariant descriptor for remote-sensing image registration based on the scale invariant features transform (SIFT) in a kernel space is proposed.Affine invariant SIFT descriptor is first developed in an elliptical region determined by the Hessian matrix of the feature points.Thereafter,the descriptor is mapped to a feature space induced by a kernel, and a new descriptor is constructed by whitening the mapped descriptor in the feature space, with the transform called KW-SIFT.In a final step, the new descriptor is used to register remote-sensing images.Experimental results for remote-sensing image registration indicate that the proposed method improves the registration performance as compared with other related methods.

  7. Adaptive mesh generation for image registration and segmentation

    DEFF Research Database (Denmark)

    Fogtmann, Mads; Larsen, Rasmus

    2013-01-01

    This paper deals with the problem of generating quality tetrahedral meshes for image registration. From an initial coarse mesh the approach matches the mesh to the image volume by combining red-green subdivision and mesh evolution through mesh-to-image matching regularized with a mesh quality...

  8. A MNCIE method for registration of ultrasound images

    Institute of Scientific and Technical Information of China (English)

    JIN Jing; WANG Qiang; SHEN Yi

    2007-01-01

    A new approach to the problem of registration of ultrasound images is presented, using a concept of Nonlinear Correlation Information Entropy (NCIE) as the matching criterion. The proposed method applies NCIE to measure the correlation degree between the image intensities of corresponding voxel in the floating and reference images. Registration is achieved by adjustment of the relative position until NCIE between the images is maximized. However, unlike mutual information (MI), NCIE varies in the closed interval [0, 1 ], and around the extremum it varies sharply, which makes it possible that thresholds of NCIE can be used to boost the search for the registration transformation. Using this feature of NCIE, we combine the downhill simplex searching algorithm to register the ultrasound images. The simulations are conducted to testify the effectiveness and rapidity of the proposed registration method, in which the ultrasound floating images are aligned to the reference images with required registration accuracy. Moreover, the NCIE based method can overcome local minima problem by setting thresholds and can take care of the differences in contrast between the floating and reference images.

  9. Deformable image registration between pathological images and MR image via an optical macro image.

    Science.gov (United States)

    Ohnishi, Takashi; Nakamura, Yuka; Tanaka, Toru; Tanaka, Takuya; Hashimoto, Noriaki; Haneishi, Hideaki; Batchelor, Tracy T; Gerstner, Elizabeth R; Taylor, Jennie W; Snuderl, Matija; Yagi, Yukako

    2016-10-01

    Computed tomography (CT) and magnetic resonance (MR) imaging have been widely used for visualizing the inside of the human body. However, in many cases, pathological diagnosis is conducted through a biopsy or resection of an organ to evaluate the condition of tissues as definitive diagnosis. To provide more advanced information onto CT or MR image, it is necessary to reveal the relationship between tissue information and image signals. We propose a registration scheme for a set of PT images of divided specimens and a 3D-MR image by reference to an optical macro image (OM image) captured by an optical camera. We conducted a fundamental study using a resected human brain after the death of a brain cancer patient. We constructed two kinds of registration processes using the OM image as the base for both registrations to make conversion parameters between the PT and MR images. The aligned PT images had shapes similar to the OM image. On the other hand, the extracted cross-sectional MR image was similar to the OM image. From these resultant conversion parameters, the corresponding region on the PT image could be searched and displayed when an arbitrary pixel on the MR image was selected. The relationship between the PT and MR images of the whole brain can be analyzed using the proposed method. We confirmed that same regions between the PT and MR images could be searched and displayed using resultant information obtained by the proposed method. In terms of the accuracy of proposed method, the TREs were 0.56±0.39mm and 0.87±0.42mm. We can analyze the relationship between tissue information and MR signals using the proposed method.

  10. Robust linear registration of CT images using random regression forests

    Science.gov (United States)

    Konukoglu, Ender; Criminisi, Antonio; Pathak, Sayan; Robertson, Duncan; White, Steve; Haynor, David; Siddiqui, Khan

    2011-03-01

    Global linear registration is a necessary first step for many different tasks in medical image analysis. Comparing longitudinal studies1, cross-modality fusion2, and many other applications depend heavily on the success of the automatic registration. The robustness and efficiency of this step is crucial as it affects all subsequent operations. Most common techniques cast the linear registration problem as the minimization of a global energy function based on the image intensities. Although these algorithms have proved useful, their robustness in fully automated scenarios is still an open question. In fact, the optimization step often gets caught in local minima yielding unsatisfactory results. Recent algorithms constrain the space of registration parameters by exploiting implicit or explicit organ segmentations, thus increasing robustness4,5. In this work we propose a novel robust algorithm for automatic global linear image registration. Our method uses random regression forests to estimate posterior probability distributions for the locations of anatomical structures - represented as axis aligned bounding boxes6. These posterior distributions are later integrated in a global linear registration algorithm. The biggest advantage of our algorithm is that it does not require pre-defined segmentations or regions. Yet it yields robust registration results. We compare the robustness of our algorithm with that of the state of the art Elastix toolbox7. Validation is performed via 1464 pair-wise registrations in a database of very diverse 3D CT images. We show that our method decreases the "failure" rate of the global linear registration from 12.5% (Elastix) to only 1.9%.

  11. Temporal mammogram image registration using optimized curvilinear coordinates.

    Science.gov (United States)

    Abdel-Nasser, Mohamed; Moreno, Antonio; Puig, Domenec

    2016-04-01

    Registration of mammograms plays an important role in breast cancer computer-aided diagnosis systems. Radiologists usually compare mammogram images in order to detect abnormalities. The comparison of mammograms requires a registration between them. A temporal mammogram registration method is proposed in this paper. It is based on the curvilinear coordinates, which are utilized to cope both with global and local deformations in the breast area. Temporal mammogram pairs are used to validate the proposed method. After registration, the similarity between the mammograms is maximized, and the distance between manually defined landmarks is decreased. In addition, a thorough comparison with the state-of-the-art mammogram registration methods is performed to show its effectiveness.

  12. Image registration based on matrix perturbation analysis using spectral graph

    Institute of Scientific and Technical Information of China (English)

    Chengcai Leng; Zheng Tian; Jing Li; Mingtao Ding

    2009-01-01

    @@ We present a novel perspective on characterizing the spectral correspondence between nodes of the weighted graph with application to image registration.It is based on matrix perturbation analysis on the spectral graph.The contribution may be divided into three parts.Firstly, the perturbation matrix is obtained by perturbing the matrix of graph model.Secondly, an orthogonal matrix is obtained based on an optimal parameter, which can better capture correspondence features.Thirdly, the optimal matching matrix is proposed by adjusting signs of orthogonal matrix for image registration.Experiments on both synthetic images and real-world images demonstrate the effectiveness and accuracy of the proposed method.

  13. Quicksilver: Fast predictive image registration - A deep learning approach.

    Science.gov (United States)

    Yang, Xiao; Kwitt, Roland; Styner, Martin; Niethammer, Marc

    2017-07-11

    This paper introduces Quicksilver, a fast deformable image registration method. Quicksilver registration for image-pairs works by patch-wise prediction of a deformation model based directly on image appearance. A deep encoder-decoder network is used as the prediction model. While the prediction strategy is general, we focus on predictions for the Large Deformation Diffeomorphic Metric Mapping (LDDMM) model. Specifically, we predict the momentum-parameterization of LDDMM, which facilitates a patch-wise prediction strategy while maintaining the theoretical properties of LDDMM, such as guaranteed diffeomorphic mappings for sufficiently strong regularization. We also provide a probabilistic version of our prediction network which can be sampled during the testing time to calculate uncertainties in the predicted deformations. Finally, we introduce a new correction network which greatly increases the prediction accuracy of an already existing prediction network. We show experimental results for uni-modal atlas-to-image as well as uni-/multi-modal image-to-image registrations. These experiments demonstrate that our method accurately predicts registrations obtained by numerical optimization, is very fast, achieves state-of-the-art registration results on four standard validation datasets, and can jointly learn an image similarity measure. Quicksilver is freely available as an open-source software. Copyright © 2017 Elsevier Inc. All rights reserved.

  14. Cross contrast multi-channel image registration using image synthesis for MR brain images.

    Science.gov (United States)

    Chen, Min; Carass, Aaron; Jog, Amod; Lee, Junghoon; Roy, Snehashis; Prince, Jerry L

    2017-02-01

    Multi-modal deformable registration is important for many medical image analysis tasks such as atlas alignment, image fusion, and distortion correction. Whereas a conventional method would register images with different modalities using modality independent features or information theoretic metrics such as mutual information, this paper presents a new framework that addresses the problem using a two-channel registration algorithm capable of using mono-modal similarity measures such as sum of squared differences or cross-correlation. To make it possible to use these same-modality measures, image synthesis is used to create proxy images for the opposite modality as well as intensity-normalized images from each of the two available images. The new deformable registration framework was evaluated by performing intra-subject deformation recovery, intra-subject boundary alignment, and inter-subject label transfer experiments using multi-contrast magnetic resonance brain imaging data. Three different multi-channel registration algorithms were evaluated, revealing that the framework is robust to the multi-channel deformable registration algorithm that is used. With a single exception, all results demonstrated improvements when compared against single channel registrations using the same algorithm with mutual information.

  15. Semi-automatic elastic registration on thyroid gland ultrasonic image

    Science.gov (United States)

    Xu, Xia; Zhong, Yue; Luo, Yan; Li, Deyu; Lin, Jiangli; Wang, Tianfu

    2007-12-01

    Knowledge of in vivo thyroid volume has both diagnostic and therapeutic importance and could lead to a more precise quantification of absolute activity contained in the thyroid gland. However, the shape of thyroid gland is irregular and difficult to calculate. For precise estimation of thyroid volume by ultrasound imaging, this paper presents a novel semiautomatic minutiae matching method in thyroid gland ultrasonic image by means of thin-plate spline model. Registration consists of four basic steps: feature detection, feature matching, mapping function design, and image transformation and resampling. Due to the connectivity of thyroid gland boundary, we choose active contour model as feature detector, and radials from centric points for feature matching. The proposed approach has been used in thyroid gland ultrasound images registration. Registration results of 18 healthy adults' thyroid gland ultrasound images show this method consumes less time and energy with good objectivity than algorithms selecting landmarks manually.

  16. Registration and 3D visualization of large microscopy images

    Science.gov (United States)

    Mosaliganti, Kishore; Pan, Tony; Sharp, Richard; Ridgway, Randall; Iyengar, Srivathsan; Gulacy, Alexandra; Wenzel, Pamela; de Bruin, Alain; Machiraju, Raghu; Huang, Kun; Leone, Gustavo; Saltz, Joel

    2006-03-01

    Inactivation of the retinoblastoma gene in mouse embryos causes tissue infiltrations into critical sections of the placenta, which has been shown to affect fetal survivability. Our collaborators in cancer genetics are extremely interested in examining the three dimensional nature of these infiltrations given a stack of two dimensional light microscopy images. Three sets of wildtype and mutant placentas was sectioned serially and digitized using a commercial light microscopy scanner. Each individual placenta dataset consisted of approximately 1000 images totaling 700 GB in size, which were registered into a volumetric dataset using National Library of Medicine's (NIH/NLM) Insight Segmentation and Registration Toolkit (ITK). This paper describes our method for image registration to aid in volume visualization of tissue level intermixing for both wildtype and Rb - specimens. The registration process faces many challenges arising from the large image sizes, damages during sectioning, staining gradients both within and across sections, and background noise. These issues limit the direct application of standard registration techniques due to frequent convergence to local solutions. In this work, we develop a mixture of automated and semi-automated enhancements with ground-truth validation for the mutual information-based registration algorithm. Our final volume renderings clearly show tissue intermixing differences between both wildtype and Rb - specimens which are not obvious prior to registration.

  17. Wavelet-based prediction of oil prices

    Energy Technology Data Exchange (ETDEWEB)

    Yousefi, Shahriar [Econometric Group, Department of Economics, University of Southern Denmark, DK-5230 Odense M (Denmark); Weinreich, Ilona [Department of Mathematics and Technology, University of Applied Sciences Koblenz, RheinAhr Campus, D-53424 Remagen (Germany)]. E-mail: weinreich@rheinahrcampus.de; Reinarz, Dominik [Department of Mathematics and Technology, University of Applied Sciences Koblenz, RheinAhr Campus, D-53424 Remagen (Germany)

    2005-07-01

    This paper illustrates an application of wavelets as a possible vehicle for investigating the issue of market efficiency in futures markets for oil. The paper provides a short introduction to the wavelets and a few interesting wavelet-based contributions in economics and finance are briefly reviewed. A wavelet-based prediction procedure is introduced and market data on crude oil is used to provide forecasts over different forecasting horizons. The results are compared with data from futures markets for oil and the relative performance of this procedure is used to investigate whether futures markets are efficiently priced.

  18. Geodesic active fields--a geometric framework for image registration.

    Science.gov (United States)

    Zosso, Dominique; Bresson, Xavier; Thiran, Jean-Philippe

    2011-05-01

    In this paper we present a novel geometric framework called geodesic active fields for general image registration. In image registration, one looks for the underlying deformation field that best maps one image onto another. This is a classic ill-posed inverse problem, which is usually solved by adding a regularization term. Here, we propose a multiplicative coupling between the registration term and the regularization term, which turns out to be equivalent to embed the deformation field in a weighted minimal surface problem. Then, the deformation field is driven by a minimization flow toward a harmonic map corresponding to the solution of the registration problem. This proposed approach for registration shares close similarities with the well-known geodesic active contours model in image segmentation, where the segmentation term (the edge detector function) is coupled with the regularization term (the length functional) via multiplication as well. As a matter of fact, our proposed geometric model is actually the exact mathematical generalization to vector fields of the weighted length problem for curves and surfaces introduced by Caselles-Kimmel-Sapiro. The energy of the deformation field is measured with the Polyakov energy weighted by a suitable image distance, borrowed from standard registration models. We investigate three different weighting functions, the squared error and the approximated absolute error for monomodal images, and the local joint entropy for multimodal images. As compared to specialized state-of-the-art methods tailored for specific applications, our geometric framework involves important contributions. Firstly, our general formulation for registration works on any parametrizable, smooth and differentiable surface, including nonflat and multiscale images. In the latter case, multiscale images are registered at all scales simultaneously, and the relations between space and scale are intrinsically being accounted for. Second, this method is, to

  19. Registration of multitemporal aerial optical images using line features

    Science.gov (United States)

    Zhao, Chenyang; Goshtasby, A. Ardeshir

    2016-07-01

    Registration of multitemporal images is generally considered difficult because scene changes can occur between the times the images are obtained. Since the changes are mostly radiometric in nature, features are needed that are insensitive to radiometric differences between the images. Lines are geometric features that represent straight edges of rigid man-made structures. Because such structures rarely change over time, lines represent stable geometric features that can be used to register multitemporal remote sensing images. An algorithm to establish correspondence between lines in two images of a planar scene is introduced and formulas to relate the parameters of a homography transformation to the parameters of corresponding lines in images are derived. Results of the proposed image registration on various multitemporal images are presented and discussed.

  20. Remote Sensing Image Registration with Line Segments and Their Intersections

    Directory of Open Access Journals (Sweden)

    Chengjin Lyu

    2017-05-01

    Full Text Available Image registration is a basic but essential step for remote sensing image processing, and finding stable features in multitemporal images is one of the most considerable challenges in the field. The main shape contours of artificial objects (e.g., roads, buildings, farmlands, and airports can be generally described as a group of line segments, which are stable features, even in images with evident background changes (e.g., images taken before and after a disaster. In this study, a registration method that uses line segments and their intersections is proposed for multitemporal remote sensing images. First, line segments are extracted in image pyramids to unify the scales of the reference image and the test image. Then, a line descriptor based on the gradient distribution of local areas is constructed, and the segments are matched in image pyramids. Lastly, triplets of intersections of matching lines are selected to estimate affine transformation between two images. Additional corresponding intersections are provided based on the estimated transformation, and an iterative process is adopted to remove outliers. The performance of the proposed method is tested on a variety of optical remote sensing image pairs, including synthetic and real data. Compared with existing methods, our method can provide more accurate registration results, even in images with significant background changes.

  1. Multimodal registration of remotely sensed images based on Jeffrey's divergence

    Science.gov (United States)

    Xu, Xiaocong; Li, Xia; Liu, Xiaoping; Shen, Huanfeng; Shi, Qian

    2016-12-01

    Entropy-based measures (e.g., mutual information, also known as Kullback-Leiber divergence), which quantify the similarity between two signals, are widely used as similarity measures for image registration. Although they are proven superior to many classical statistical measures, entropy-based measures, such as mutual information, may fail to yield the optimum registration if the multimodal image pair has insufficient scene overlap region. To overcome this challenge, we proposed using the symmetric form of Kullback-Leiber divergence, namely Jeffrey's divergence, as the similarity measure in practical multimodal image registration tasks. Mathematical analysis was performed to investigate the causes accounting for the limitation of mutual information when dealing with insufficient scene overlap image pairs. Experimental registrations of SPOT image, Landsat TM image, ALOS PalSAR image, and DEM data were carried out to compare the performance of Jeffrey's divergence and mutual information. Results indicate that Jeffrey's divergence is capable of providing larger feasible search space, which is favorable for exploring optimum transformation parameters in a larger range. This superiority of Jeffrey's divergence was further confirmed by a series of paradigms. Thus, the proposed model is more applicable for registering image pairs that are greatly misaligned or have an insufficient scene overlap region.

  2. PCA-based groupwise image registration for quantitative MRI.

    Science.gov (United States)

    Huizinga, W; Poot, D H J; Guyader, J-M; Klaassen, R; Coolen, B F; van Kranenburg, M; van Geuns, R J M; Uitterdijk, A; Polfliet, M; Vandemeulebroucke, J; Leemans, A; Niessen, W J; Klein, S

    2016-04-01

    Quantitative magnetic resonance imaging (qMRI) is a technique for estimating quantitative tissue properties, such as the T1 and T2 relaxation times, apparent diffusion coefficient (ADC), and various perfusion measures. This estimation is achieved by acquiring multiple images with different acquisition parameters (or at multiple time points after injection of a contrast agent) and by fitting a qMRI signal model to the image intensities. Image registration is often necessary to compensate for misalignments due to subject motion and/or geometric distortions caused by the acquisition. However, large differences in image appearance make accurate image registration challenging. In this work, we propose a groupwise image registration method for compensating misalignment in qMRI. The groupwise formulation of the method eliminates the requirement of choosing a reference image, thus avoiding a registration bias. The method minimizes a cost function that is based on principal component analysis (PCA), exploiting the fact that intensity changes in qMRI can be described by a low-dimensional signal model, but not requiring knowledge on the specific acquisition model. The method was evaluated on 4D CT data of the lungs, and both real and synthetic images of five different qMRI applications: T1 mapping in a porcine heart, combined T1 and T2 mapping in carotid arteries, ADC mapping in the abdomen, diffusion tensor mapping in the brain, and dynamic contrast-enhanced mapping in the abdomen. Each application is based on a different acquisition model. The method is compared to a mutual information-based pairwise registration method and four other state-of-the-art groupwise registration methods. Registration accuracy is evaluated in terms of the precision of the estimated qMRI parameters, overlap of segmented structures, distance between corresponding landmarks, and smoothness of the deformation. In all qMRI applications the proposed method performed better than or equally well as

  3. Manifold learning based registration algorithms applied to multimodal images.

    Science.gov (United States)

    Azampour, Mohammad Farid; Ghaffari, Aboozar; Hamidinekoo, Azam; Fatemizadeh, Emad

    2014-01-01

    Manifold learning algorithms are proposed to be used in image processing based on their ability in preserving data structures while reducing the dimension and the exposure of data structure in lower dimension. Multi-modal images have the same structure and can be registered together as monomodal images if only structural information is shown. As a result, manifold learning is able to transform multi-modal images to mono-modal ones and subsequently do the registration using mono-modal methods. Based on this application, in this paper novel similarity measures are proposed for multi-modal images in which Laplacian eigenmaps are employed as manifold learning algorithm and are tested against rigid registration of PET/MR images. Results show the feasibility of using manifold learning as a way of calculating the similarity between multimodal images.

  4. 3D image registration using a fast noniterative algorithm.

    Science.gov (United States)

    Zhilkin, P; Alexander, M E

    2000-11-01

    This note describes the implementation of a three-dimensional (3D) registration algorithm, generalizing a previous 2D version [Alexander, Int J Imaging Systems and Technology 1999;10:242-57]. The algorithm solves an integrated form of linearized image matching equation over a set of 3D rectangular sub-volumes ('patches') in the image domain. This integrated form avoids numerical instabilities due to differentiation of a noisy image over a lattice, and in addition renders the algorithm robustness to noise. Registration is implemented by first convolving the unregistered images with a set of computationally fast [O(N)] filters, providing four bandpass images for each input image, and integrating the image matching equation over the given patch. Each filter and each patch together provide an independent set of constraints on the displacement field derived by solving a set of linear regression equations. Furthermore, the filters are implemented at a variety of spatial scales, enabling registration parameters at one scale to be used as an input approximation for deriving refined values of those parameters at a finer scale of resolution. This hierarchical procedure is necessary to avoid false matches occurring. Both downsampled and oversampled (undecimating) filtering is implemented. Although the former is computationally fast, it lacks the translation invariance of the latter. Oversampling is required for accurate interpolation that is used in intermediate stages of the algorithm to reconstruct the partially registered from the unregistered image. However, downsampling is useful, and computationally efficient, for preliminary stages of registration when large mismatches are present. The 3D registration algorithm was implemented using a 12-parameter affine model for the displacement: u(x) = Ax + b. Linear interpolation was used throughout. Accuracy and timing results for registering various multislice images, obtained by scanning a melon and human volunteers in various

  5. Regional manifold learning for deformable registration of brain MR images.

    Science.gov (United States)

    Ye, Dong Hye; Hamm, Jihun; Kwon, Dongjin; Davatzikos, Christos; Pohl, Kilian M

    2012-01-01

    We propose a method for deformable registration based on learning the manifolds of individual brain regions. Recent publications on registration of medical images advocate the use of manifold learning in order to confine the search space to anatomically plausible deformations. Existing methods construct manifolds based on a single metric over the entire image domain thus frequently miss regional brain variations. We address this issue by first learning manifolds for specific regions and then computing region-specific deformations from these manifolds. We then determine deformations for the entire image domain by learning the global manifold in such a way that it preserves the region-specific deformations. We evaluate the accuracy of our method by applying it to the LPBA40 dataset and measuring the overlap of the deformed segmentations. The result shows significant improvement in registration accuracy on cortex regions compared to other state of the art methods.

  6. Construction of a class of Daubechies type wavelet bases

    Energy Technology Data Exchange (ETDEWEB)

    Li Dengfeng [Institute of Applied Mathematics, School of Mathematics and Information Sciences Henan University, Kaifeng 475001 (China); Wu Guochang [College of Information, Henan University of Finance and Economics, Zhengzhou 450002 (China)], E-mail: archang-0111@163.com

    2009-10-15

    Extensive work has been done in the theory and the construction of compactly supported orthonormal wavelet bases of L{sup 2}(R). Some of the most distinguished work was done by Daubechies, who constructed a whole family of such wavelet bases. In this paper, we construct a class of orthonormal wavelet bases by using the principle of Daubechies, and investigate the length of support and the regularity of these wavelet bases.

  7. Automatic Image Registration Algorithm Based on Wavelet Transform

    Institute of Scientific and Technical Information of China (English)

    LIU Qiong; NI Guo-qiang

    2006-01-01

    An automatic image registration approach based on wavelet transform is proposed. This proposed method utilizes multiscale wavelet transform to extract feature points. A coarse-to-fine feature matching method is utilized in the feature matching phase. A two-way matching method based on cross-correlation to get candidate point pairs and a fine matching based on support strength combine to form the matching algorithm. At last, based on an affine transformation model, the parameters are iteratively refined by using the least-squares estimation approach. Experimental results have verified that the proposed algorithm can realize automatic registration of various kinds of images rapidly and effectively.

  8. Coercive Region-level Registration for Multi-modal Images

    CERN Document Server

    Chen, Yu-Hui; Newstadt, Gregory; Simmons, Jeffrey; hero, Alfred

    2015-01-01

    We propose a coercive approach to simultaneously register and segment multi-modal images which share similar spatial structure. Registration is done at the region level to facilitate data fusion while avoiding the need for interpolation. The algorithm performs alternating minimization of an objective function informed by statistical models for pixel values in different modalities. Hypothesis tests are developed to determine whether to refine segmentations by splitting regions. We demonstrate that our approach has significantly better performance than the state-of-the-art registration and segmentation methods on microscopy images.

  9. Entropy-Based Block Processing for Satellite Image Registration

    Directory of Open Access Journals (Sweden)

    Ikhyun Lee

    2012-11-01

    Full Text Available Image registration is an important task in many computer vision applications such as fusion systems, 3D shape recovery and earth observation. Particularly, registering satellite images is challenging and time-consuming due to limited resources and large image size. In such scenario, state-of-the-art image registration methods such as scale-invariant feature transform (SIFT may not be suitable due to high processing time. In this paper, we propose an algorithm based on block processing via entropy to register satellite images. The performance of the proposed method is evaluated using different real images. The comparative analysis shows that it not only reduces the processing time but also enhances the accuracy.

  10. Agile multi-scale decompositions for automatic image registration

    Science.gov (United States)

    Murphy, James M.; Leija, Omar Navarro; Le Moigne, Jacqueline

    2016-05-01

    In recent works, the first and third authors developed an automatic image registration algorithm based on a multiscale hybrid image decomposition with anisotropic shearlets and isotropic wavelets. This prototype showed strong performance, improving robustness over registration with wavelets alone. However, this method imposed a strict hierarchy on the order in which shearlet and wavelet features were used in the registration process, and also involved an unintegrated mixture of MATLAB and C code. In this paper, we introduce a more agile model for generating features, in which a flexible and user-guided mix of shearlet and wavelet features are computed. Compared to the previous prototype, this method introduces a flexibility to the order in which shearlet and wavelet features are used in the registration process. Moreover, the present algorithm is now fully coded in C, making it more efficient and portable than the mixed MATLAB and C prototype. We demonstrate the versatility and computational efficiency of this approach by performing registration experiments with the fully-integrated C algorithm. In particular, meaningful timing studies can now be performed, to give a concrete analysis of the computational costs of the flexible feature extraction. Examples of synthetically warped and real multi-modal images are analyzed.

  11. WAVELET BASED CONTENT BASED IMAGE RETRIEVAL USING COLOR AND TEXTURE FEATURE EXTRACTION BY GRAY LEVEL COOCURENCE MATRIX AND COLOR COOCURENCE MATRIX

    Directory of Open Access Journals (Sweden)

    Jeyanthi Prabhu

    2014-01-01

    Full Text Available In this study we proposes an effective content based image retrieval by color and texture based on wavelet coefficient method to achieve good retrieval in efficiency. Color feature extraction is done by color Histogram. The texture feature extraction is acquired by Gray Level Coocurence Matrix (GLCM or Color Coocurence Matrix (CCM. This study provides better result for image retrieval by integrated features. Feature extraction by color Histogram, texture by GLCM, texture by CCM are compared in terms of precision performance measure.

  12. A survey of medical image registration on graphics hardware.

    Science.gov (United States)

    Fluck, O; Vetter, C; Wein, W; Kamen, A; Preim, B; Westermann, R

    2011-12-01

    The rapidly increasing performance of graphics processors, improving programming support and excellent performance-price ratio make graphics processing units (GPUs) a good option for a variety of computationally intensive tasks. Within this survey, we give an overview of GPU accelerated image registration. We address both, GPU experienced readers with an interest in accelerated image registration, as well as registration experts who are interested in using GPUs. We survey programming models and interfaces and analyze different approaches to programming on the GPU. We furthermore discuss the inherent advantages and challenges of current hardware architectures, which leads to a description of the details of the important building blocks for successful implementations. Copyright © 2010 Elsevier Ireland Ltd. All rights reserved.

  13. 2D/3D Image Registration using Regression Learning.

    Science.gov (United States)

    Chou, Chen-Rui; Frederick, Brandon; Mageras, Gig; Chang, Sha; Pizer, Stephen

    2013-09-01

    In computer vision and image analysis, image registration between 2D projections and a 3D image that achieves high accuracy and near real-time computation is challenging. In this paper, we propose a novel method that can rapidly detect an object's 3D rigid motion or deformation from a 2D projection image or a small set thereof. The method is called CLARET (Correction via Limited-Angle Residues in External Beam Therapy) and consists of two stages: registration preceded by shape space and regression learning. In the registration stage, linear operators are used to iteratively estimate the motion/deformation parameters based on the current intensity residue between the target projec-tion(s) and the digitally reconstructed radiograph(s) (DRRs) of the estimated 3D image. The method determines the linear operators via a two-step learning process. First, it builds a low-order parametric model of the image region's motion/deformation shape space from its prior 3D images. Second, using learning-time samples produced from the 3D images, it formulates the relationships between the model parameters and the co-varying 2D projection intensity residues by multi-scale linear regressions. The calculated multi-scale regression matrices yield the coarse-to-fine linear operators used in estimating the model parameters from the 2D projection intensity residues in the registration. The method's application to Image-guided Radiation Therapy (IGRT) requires only a few seconds and yields good results in localizing a tumor under rigid motion in the head and neck and under respiratory deformation in the lung, using one treatment-time imaging 2D projection or a small set thereof.

  14. Fast parallel image registration on CPU and GPU for diagnostic classification of Alzheimer's disease

    NARCIS (Netherlands)

    D.P. Shamonin (Denis); E.E. Bron (Esther); B.P.F. Lelieveldt (Boudewijn); M. Smits (Marion); S.K. Klein (Stefan); M. Staring (Marius)

    2014-01-01

    textabstractNonrigid image registration is an important, but time-consuming task in medical image analysis. In typical neuroimaging studies, multiple image registrations are performed, i.e., for atlas-based segmentation or template construction. Faster image registration routines would therefore be

  15. Fast parallel image registration on CPU and GPU for diagnostic classification of Alzheimer's disease

    NARCIS (Netherlands)

    Shamonin, D.P.; Bron, E.E.; Lelieveldt, B.P.F.; Smits, M.; Klein, S.; Staring, M.

    2014-01-01

    Nonrigid image registration is an important, but time-consuming task in medical image analysis. In typical neuroimaging studies, multiple image registrations are performed, i.e., for atlas-based segmentation or template construction. Faster image registration routines would therefore be beneficial.

  16. Collocation for Diffeomorphic Deformations in Medical Image Registration

    DEFF Research Database (Denmark)

    Darkner, Sune; Pai, Akshay Sadananda Uppinakudru; Liptrot, Matthew George

    2017-01-01

    Diffeomorphic deformation is a popular choice in medical image registration. A fundamental property of diffeomorphisms is in vertibility, implying that once the relation between two points A to B is found, then the relation B to A is given per definition. Consistency is a measure of a numerical...

  17. Registration of multimodal brain images: some experimental results

    Science.gov (United States)

    Chen, Hua-mei; Varshney, Pramod K.

    2002-03-01

    Joint histogram of two images is required to uniquely determine the mutual information between the two images. It has been pointed out that, under certain conditions, existing joint histogram estimation algorithms like partial volume interpolation (PVI) and linear interpolation may result in different types of artifact patterns in the MI based registration function by introducing spurious maxima. As a result, the artifacts may hamper the global optimization process and limit registration accuracy. In this paper we present an extensive study of interpolation-induced artifacts using simulated brain images and show that similar artifact patterns also exist when other intensity interpolation algorithms like cubic convolution interpolation and cubic B-spline interpolation are used. A new joint histogram estimation scheme named generalized partial volume estimation (GPVE) is proposed to eliminate the artifacts. A kernel function is involved in the proposed scheme and when the 1st order B-spline is chosen as the kernel function, it is equivalent to the PVI. A clinical brain image database furnished by Vanderbilt University is used to compare the accuracy of our algorithm with that of PVI. Our experimental results show that the use of higher order kernels can effectively remove the artifacts and, in cases when MI based registration result suffers from the artifacts, registration accuracy can be improved significantly.

  18. Diffeomorphic image registration with automatic time-step adjustment

    DEFF Research Database (Denmark)

    Pai, Akshay Sadananda Uppinakudru; Klein, S.; Sommer, Stefan Horst;

    2015-01-01

    In this paper, we propose an automated Euler's time-step adjustment scheme for diffeomorphic image registration using stationary velocity fields (SVFs). The proposed variational problem aims at bounding the inverse consistency error by adaptively adjusting the number of Euler's step required...

  19. Estimating the Video Registration Using Image Motions

    Directory of Open Access Journals (Sweden)

    N.Kannaiya Raja

    2012-07-01

    Full Text Available In this research, we consider the problems of registering multiple video sequences dynamic scenes which are not limited non rigid objects such as fireworks, blasting, high speed car moving taken from different vantage points. In this paper we propose a simple algorithm we can create different frames on particular videos moving for matching such complex scenes. Our algorithm does not require the cameras to be synchronized, and is not based on frame-by-frame or volume-by-volume registration. Instead, we model each video as the output of a linear dynamical system and transform the task of registering the video sequences to that of registering the parameters of the corresponding dynamical models. In this paper we use of a joint frame together to form distinct frame concurrently. The joint identification and the Jordan canonical form are not only applicable to the case of registering video sequences, but also to the entire genre of algorithms based on the dynamic texture model. We have also shown that out of all the possible choices for the method of identification and canonical form, the JID using JCF performs the best.

  20. Fast Registration Method for Point Clouds Using the Image Information

    Directory of Open Access Journals (Sweden)

    WANG Ruiyan

    2016-01-01

    Full Text Available On the existing laser scanners, there usually is a coaxial camera, which could capture images in the scanning site. For the laser scanners with a coaxial camera, we propose a fast registration method using the image information. Unlike the traditional registration methods that computing the rotation and translation simultaneously, our method calculates them individually. The rotation transformation between the point clouds is obtained by the knowledge of the vision geometry and the image information, while their translation is acquired by our improved ICP algorithm. In the improved ICP algorithm, only the translation vector is updated iteratively, whose input is the point clouds that removing the rotation transformation. Experimental results show that the rotation matrix obtained by the images has a high accuracy. In addition, compared with the traditional ICP algorithm, our algorithm converges faster and is easier to fall into the global optimum.

  1. Multimodality image registration and fusion using neural network

    Institute of Scientific and Technical Information of China (English)

    Mostafa G Mostafa; Aly A Farag; Edward Essock

    2003-01-01

    Multimodality image registration and fusion are essential steps in building 3-D models from remotesensing data. We present in this paper a neural network technique for the registration and fusion of multimodali-ty remote sensing data for the reconstruction of 3-D models of terrain regions. A FeedForward neural network isused to fuse the intensity data sets with the spatial data set after learning its geometry. Results on real data arepresented. Human performance evaluation is assessed on several perceptual tests in order to evaluate the fusionresults.

  2. An accelerated image matching technique for UAV orthoimage registration

    Science.gov (United States)

    Tsai, Chung-Hsien; Lin, Yu-Ching

    2017-06-01

    Using an Unmanned Aerial Vehicle (UAV) drone with an attached non-metric camera has become a popular low-cost approach for collecting geospatial data. A well-georeferenced orthoimage is a fundamental product for geomatics professionals. To achieve high positioning accuracy of orthoimages, precise sensor position and orientation data, or a number of ground control points (GCPs), are often required. Alternatively, image registration is a solution for improving the accuracy of a UAV orthoimage, as long as a historical reference image is available. This study proposes a registration scheme, including an Accelerated Binary Robust Invariant Scalable Keypoints (ABRISK) algorithm and spatial analysis of corresponding control points for image registration. To determine a match between two input images, feature descriptors from one image are compared with those from another image. A ;Sorting Ring; is used to filter out uncorrected feature pairs as early as possible in the stage of matching feature points, to speed up the matching process. The results demonstrate that the proposed ABRISK approach outperforms the vector-based Scale Invariant Feature Transform (SIFT) approach where radiometric variations exist. ABRISK is 19.2 times and 312 times faster than SIFT for image sizes of 1000 × 1000 pixels and 4000 × 4000 pixels, respectively. ABRISK is 4.7 times faster than Binary Robust Invariant Scalable Keypoints (BRISK). Furthermore, the positional accuracy of the UAV orthoimage after applying the proposed image registration scheme is improved by an average of root mean square error (RMSE) of 2.58 m for six test orthoimages whose spatial resolutions vary from 6.7 cm to 10.7 cm.

  3. Automatic Image Registration Using Free and Open Source Software

    OpenAIRE

    Giri Babu, D.; Raja Shekhar, S. S.; Chandrasekar, K.; M. V. R. Sesha Sai; P.G. Diwakar; Dadhwal, V. K.

    2014-01-01

    Image registration is the most critical operation in remote sensing applications to enable location based referencing and analysis of earth features. This is the first step for any process involving identification, time series analysis or change detection using a large set of imagery over a region. Most of the reliable procedures involve time consuming and laborious manual methods of finding the corresponding matching features of the input image with respect to reference. Also the ...

  4. Advanced methods for image registration applied to JET videos

    Energy Technology Data Exchange (ETDEWEB)

    Craciunescu, Teddy, E-mail: teddy.craciunescu@jet.uk [EURATOM-MEdC Association, NILPRP, Bucharest (Romania); Murari, Andrea [Consorzio RFX, Associazione EURATOM-ENEA per la Fusione, Padova (Italy); Gelfusa, Michela [Associazione EURATOM-ENEA – University of Rome “Tor Vergata”, Roma (Italy); Tiseanu, Ion; Zoita, Vasile [EURATOM-MEdC Association, NILPRP, Bucharest (Romania); Arnoux, Gilles [EURATOM/CCFE Fusion Association, Culham Science Centre, Abingdon, Oxon (United Kingdom)

    2015-10-15

    Graphical abstract: - Highlights: • Development of an image registration method for JET IR and fast visible cameras. • Method based on SIFT descriptors and coherent point drift points set registration technique. • Method able to deal with extremely noisy images and very low luminosity images. • Computation time compatible with the inter-shot analysis. - Abstract: The last years have witnessed a significant increase in the use of digital cameras on JET. They are routinely applied for imaging in the IR and visible spectral regions. One of the main technical difficulties in interpreting the data of camera based diagnostics is the presence of movements of the field of view. Small movements occur due to machine shaking during normal pulses while large ones may arise during disruptions. Some cameras show a correlation of image movement with change of magnetic field strength. For deriving unaltered information from the videos and for allowing correct interpretation an image registration method, based on highly distinctive scale invariant feature transform (SIFT) descriptors and on the coherent point drift (CPD) points set registration technique, has been developed. The algorithm incorporates a complex procedure for rejecting outliers. The method has been applied for vibrations correction to videos collected by the JET wide angle infrared camera and for the correction of spurious rotations in the case of the JET fast visible camera (which is equipped with an image intensifier). The method has proved to be able to deal with the images provided by this camera frequently characterized by low contrast and a high level of blurring and noise.

  5. Video image stabilization and registration--plus

    Science.gov (United States)

    Hathaway, David H. (Inventor)

    2009-01-01

    A method of stabilizing a video image displayed in multiple video fields of a video sequence includes the steps of: subdividing a selected area of a first video field into nested pixel blocks; determining horizontal and vertical translation of each of the pixel blocks in each of the pixel block subdivision levels from the first video field to a second video field; and determining translation of the image from the first video field to the second video field by determining a change in magnification of the image from the first video field to the second video field in each of horizontal and vertical directions, and determining shear of the image from the first video field to the second video field in each of the horizontal and vertical directions.

  6. F-TIMER: fast tensor image morphing for elastic registration.

    Science.gov (United States)

    Yap, Pew-Thian; Wu, Guorong; Zhu, Hongtu; Lin, Weili; Shen, Dinggang

    2010-05-01

    We propose a novel diffusion tensor imaging (DTI) registration algorithm, called fast tensor image morphing for elastic registration (F-TIMER). F-TIMER leverages multiscale tensor regional distributions and local boundaries for hierarchically driving deformable matching of tensor image volumes. Registration is achieved by utilizing a set of automatically determined structural landmarks, via solving a soft correspondence problem. Based on the estimated correspondences, thin-plate splines are employed to generate a smooth, topology preserving, and dense transformation, and to avoid arbitrary mapping of nonlandmark voxels. To mitigate the problem of local minima, which is common in the estimation of high dimensional transformations, we employ a hierarchical strategy where a small subset of voxels with more distinctive attribute vectors are first deployed as landmarks to estimate a relatively robust low-degrees-of-freedom transformation. As the registration progresses, an increasing number of voxels are permitted to participate in refining the correspondence matching. A scheme as such allows less conservative progression of the correspondence matching towards the optimal solution, and hence results in a faster matching speed. Compared with its predecessor TIMER, which has been shown to outperform state-of-the-art algorithms, experimental results indicate that F-TIMER is capable of achieving comparable accuracy at only a fraction of the computation cost.

  7. Dense image registration through MRFs and efficient linear programming.

    Science.gov (United States)

    Glocker, Ben; Komodakis, Nikos; Tziritas, Georgios; Navab, Nassir; Paragios, Nikos

    2008-12-01

    In this paper, we introduce a novel and efficient approach to dense image registration, which does not require a derivative of the employed cost function. In such a context, the registration problem is formulated using a discrete Markov random field objective function. First, towards dimensionality reduction on the variables we assume that the dense deformation field can be expressed using a small number of control points (registration grid) and an interpolation strategy. Then, the registration cost is expressed using a discrete sum over image costs (using an arbitrary similarity measure) projected on the control points, and a smoothness term that penalizes local deviations on the deformation field according to a neighborhood system on the grid. Towards a discrete approach, the search space is quantized resulting in a fully discrete model. In order to account for large deformations and produce results on a high resolution level, a multi-scale incremental approach is considered where the optimal solution is iteratively updated. This is done through successive morphings of the source towards the target image. Efficient linear programming using the primal dual principles is considered to recover the lowest potential of the cost function. Very promising results using synthetic data with known deformations and real data demonstrate the potentials of our approach.

  8. Improving JWST Coronagraphic Performance with Accurate Image Registration

    Science.gov (United States)

    Van Gorkom, Kyle; Pueyo, Laurent; Lajoie, Charles-Philippe; JWST Coronagraphs Working Group

    2016-06-01

    The coronagraphs on the James Webb Space Telescope (JWST) will enable high-contrast observations of faint objects at small separations from bright hosts, such as circumstellar disks, exoplanets, and quasar disks. Despite attenuation by the coronagraphic mask, bright speckles in the host’s point spread function (PSF) remain, effectively washing out the signal from the faint companion. Suppression of these bright speckles is typically accomplished by repeating the observation with a star that lacks a faint companion, creating a reference PSF that can be subtracted from the science image to reveal any faint objects. Before this reference PSF can be subtracted, however, the science and reference images must be aligned precisely, typically to 1/20 of a pixel. Here, we present several such algorithms for performing image registration on JWST coronagraphic images. Using both simulated and pre-flight test data (taken in cryovacuum), we assess (1) the accuracy of each algorithm at recovering misaligned scenes and (2) the impact of image registration on achievable contrast. Proper image registration, combined with post-processing techniques such as KLIP or LOCI, will greatly improve the performance of the JWST coronagraphs.

  9. Wavelet-based multifractal analysis of laser biopsy imagery

    CERN Document Server

    Jagtap, Jaidip; Panigrahi, Prasanta K; Pradhan, Asima

    2011-01-01

    In this work, we report a wavelet based multi-fractal study of images of dysplastic and neoplastic HE- stained human cervical tissues captured in the transmission mode when illuminated by a laser light (He-Ne 632.8nm laser). It is well known that the morphological changes occurring during the progression of diseases like cancer manifest in their optical properties which can be probed for differentiating the various stages of cancer. Here, we use the multi-resolution properties of the wavelet transform to analyze the optical changes. For this, we have used a novel laser imagery technique which provides us with a composite image of the absorption by the different cellular organelles. As the disease progresses, due to the growth of new cells, the ratio of the organelle to cellular volume changes manifesting in the laser imagery of such tissues. In order to develop a metric that can quantify the changes in such systems, we make use of the wavelet-based fluctuation analysis. The changing self- similarity during di...

  10. Wavelet-based denoising using local Laplace prior

    Science.gov (United States)

    Rabbani, Hossein; Vafadust, Mansur; Selesnick, Ivan

    2007-09-01

    Although wavelet-based image denoising is a powerful tool for image processing applications, relatively few publications have addressed so far wavelet-based video denoising. The main reason is that the standard 3-D data transforms do not provide useful representations with good energy compaction property, for most video data. For example, the multi-dimensional standard separable discrete wavelet transform (M-D DWT) mixes orientations and motions in its subbands, and produces the checkerboard artifacts. So, instead of M-D DWT, usually oriented transforms suchas multi-dimensional complex wavelet transform (M-D DCWT) are proposed for video processing. In this paper we use a Laplace distribution with local variance to model the statistical properties of noise-free wavelet coefficients. This distribution is able to simultaneously model the heavy-tailed and intrascale dependency properties of wavelets. Using this model, simple shrinkage functions are obtained employing maximum a posteriori (MAP) and minimum mean squared error (MMSE) estimators. These shrinkage functions are proposed for video denoising in DCWT domain. The simulation results shows that this simple denoising method has impressive performance visually and quantitatively.

  11. Verification and Validation of a Fingerprint Image Registration Software

    Directory of Open Access Journals (Sweden)

    Liu Yan

    2006-01-01

    Full Text Available The need for reliable identification and authentication is driving the increased use of biometric devices and systems. Verification and validation techniques applicable to these systems are rather immature and ad hoc, yet the consequences of the wide deployment of biometric systems could be significant. In this paper we discuss an approach towards validation and reliability estimation of a fingerprint registration software. Our validation approach includes the following three steps: (a the validation of the source code with respect to the system requirements specification; (b the validation of the optimization algorithm, which is in the core of the registration system; and (c the automation of testing. Since the optimization algorithm is heuristic in nature, mathematical analysis and test results are used to estimate the reliability and perform failure analysis of the image registration module.

  12. Hierarchical model-based interferometric synthetic aperture radar image registration

    Science.gov (United States)

    Wang, Yang; Huang, Haifeng; Dong, Zhen; Wu, Manqing

    2014-01-01

    With the rapid development of spaceborne interferometric synthetic aperture radar technology, classical image registration methods are incompetent for high-efficiency and high-accuracy masses of real data processing. Based on this fact, we propose a new method. This method consists of two steps: coarse registration that is realized by cross-correlation algorithm and fine registration that is realized by hierarchical model-based algorithm. Hierarchical model-based algorithm is a high-efficiency optimization algorithm. The key features of this algorithm are a global model that constrains the overall structure of the motion estimated, a local model that is used in the estimation process, and a coarse-to-fine refinement strategy. Experimental results from different kinds of simulated and real data have confirmed that the proposed method is very fast and has high accuracy. Comparing with a conventional cross-correlation method, the proposed method provides markedly improved performance.

  13. Uncertainty driven probabilistic voxel selection for image registration.

    Science.gov (United States)

    Oreshkin, Boris N; Arbel, Tal

    2013-10-01

    This paper presents a novel probabilistic voxel selection strategy for medical image registration in time-sensitive contexts, where the goal is aggressive voxel sampling (e.g., using less than 1% of the total number) while maintaining registration accuracy and low failure rate. We develop a Bayesian framework whereby, first, a voxel sampling probability field (VSPF) is built based on the uncertainty on the transformation parameters. We then describe a practical, multi-scale registration algorithm, where, at each optimization iteration, different voxel subsets are sampled based on the VSPF. The approach maximizes accuracy without committing to a particular fixed subset of voxels. The probabilistic sampling scheme developed is shown to manage the tradeoff between the robustness of traditional random voxel selection (by permitting more exploration) and the accuracy of fixed voxel selection (by permitting a greater proportion of informative voxels).

  14. FULLY AUTOMATIC IMAGE-BASED REGISTRATION OF UNORGANIZED TLS DATA

    Directory of Open Access Journals (Sweden)

    M. Weinmann

    2012-09-01

    Full Text Available The estimation of the transformation parameters between different point clouds is still a crucial task as it is usually followed by scene reconstruction, object detection or object recognition. Therefore, the estimates should be as accurate as possible. Recent developments show that it is feasible to utilize both the measured range information and the reflectance information sampled as image, as 2D imagery provides additional information. In this paper, an image-based registration approach for TLS data is presented which consists of two major steps. In the first step, the order of the scans is calculated by checking the similarity of the respective reflectance images via the total number of SIFT correspondences between them. Subsequently, in the second step, for each SIFT correspondence the respective SIFT features are filtered with respect to their reliability concerning the range information and projected to 3D space. Combining the 3D points with 2D observations on a virtual plane yields 3D-to-2D correspondences from which the coarse transformation parameters can be estimated via a RANSAC-based registration scheme including the EPnP algorithm. After this coarse registration, the 3D points are again checked for consistency by using constraints based on the 3D distance, and, finally, the remaining 3D points are used for an ICP-based fine registration. Thus, the proposed methodology provides a fast, reliable, accurate and fully automatic image-based approach for the registration of unorganized point clouds without the need of a priori information about the order of the scans, the presence of regular surfaces or human interaction.

  15. Improving image registration by correspondence interpolation

    DEFF Research Database (Denmark)

    Ólafsdóttir, Hildur; Pedersen, Henrik; Hansen, Michael Sass;

    2011-01-01

    ) quantitatively by registering downsampled brain data using two different interpolators and subsequently applying the deformation fields to the original data. The results show that the interpolator provides better gradient images and a more sharp cardiac atlas. Moreover, it provides better deformation fields...

  16. Registration of Large Motion Blurred Images

    Science.gov (United States)

    2016-05-09

    in which the horizontal rows of the sensor array are scanned at different times. This behaviour results in additional deformations when capturing...public release: distribution unlimited. [11] W.-H. Cho, D.-W. Kim, and K.-S. Hong, “Cmos digital image stabilization,” Consumer Electronics, IEEE

  17. Elastic registration of multiphase CT images of liver

    Science.gov (United States)

    Heldmann, Stefan; Zidowitz, Stephan

    2009-02-01

    In this work we present a novel approach for elastic image registration of multi-phase contrast enhanced CT images of liver. A problem in registration of multiphase CT is that the images contain similar but complementary structures. In our application each image shows a different part of the vessel system, e.g., portal/hepatic venous/arterial, or biliary vessels. Portal, arterial and biliary vessels run in parallel and abut on each other forming the so called portal triad, while hepatic veins run independent. Naive registration will tend to align complementary vessel. Our new approach is based on minimizing a cost function consisting of a distance measure and a regularizer. For the distance we use the recently proposed normalized gradient field measure that focuses on the alignment of edges. For the regularizer we use the linear elastic potential. The key feature of our approach is an additional penalty term using segmentations of the different vessel systems in the images to avoid overlaps of complementary structures. We successfully demonstrate our new method by real data examples.

  18. Palmprint Recognition by Applying Wavelet-Based Kernel PCA

    Institute of Scientific and Technical Information of China (English)

    Murat Ekinci; Murat Aykut

    2008-01-01

    This paper presents a wavelet-based kernel Principal Component Analysis (PCA) method by integrating the Daubechies wavelet representation of palm images and the kernel PCA method for palmprint recognition. Kernel PCA is a technique for nonlinear dimension reduction of data with an underlying nonlinear spatial structure. The intensity values of the palmprint image are first normalized by using mean and standard deviation. The palmprint is then transformed into the wavelet domain to decompose palm images and the lowest resolution subband coefficients are chosen for palm representation.The kernel PCA method is then applied to extract non-linear features from the subband coefficients. Finally, similarity measurement is accomplished by using weighted Euclidean linear distance-based nearest neighbor classifier. Experimental results on PolyU Palmprint Databases demonstrate that the proposed approach achieves highly competitive performance with respect to the published palmprint recognition approaches.

  19. Comparison of Simultaneous and Sequential Two-View Registration for 3D/2D Registration of Vascular Images

    OpenAIRE

    Pathak, Chetna; Van Horn, Mark; Weeks, Susan; Bullitt, Elizabeth

    2005-01-01

    Accurate 3D/2D vessel registration is complicated by issues of image quality, occlusion, and other problems. This study performs a quantitative comparison of 3D/2D vessel registration in which vessels segmented from preoperative CT or MR are registered with biplane x-ray angiograms by either a) simultaneous two-view registration with advance calculation of the relative pose of the two views, or b) sequential registration with each view. We conclude on the basis of phantom studies that, even i...

  20. Some Contributions to Wavelet Based Image Coding

    Science.gov (United States)

    2000-07-01

    MSE or PSNR. However, it is noted that JZW does not implement the embedded property as in EZW and SPIHT and that the embedded property can be...achieved by passing the JND quantized wavelet coefficients to EZW or SPIHT. It is noted that the lowest frequency (the coarsest scale) band (LL band) is the...other higher frequency subbands can be efficiently encoded using our zero-tree encoding scheme which is derived from EZW and [improved version of EZW by

  1. Image registration reveals central lens thickness minimally increases during accommodation

    Directory of Open Access Journals (Sweden)

    Schachar RA

    2017-09-01

    Full Text Available Ronald A Schachar,1 Majid Mani,2 Ira H Schachar31Department of Physics, University of Texas at Arlington, Arlington, TX, 2California Retina Associates, El Centro, 3Byers Eye Institute of Stanford University, Palo Alto, CA, USAPurpose: To evaluate anterior chamber depth, central crystalline lens thickness and lens curvature during accommodation.Setting: California Retina Associates, El Centro, CA, USA.Design: Healthy volunteer, prospective, clinical research swept-source optical coherence biometric image registration study of accommodation.Methods: Ten subjects (4 females and 6 males with an average age of 22.5 years (range: 20–26 years participated in the study. A 45° beam splitter attached to a Zeiss IOLMaster 700 (Carl Zeiss Meditec Inc., Jena, Germany biometer enabled simultaneous imaging of the cornea, anterior chamber, entire central crystalline lens and fovea in the dilated right eyes of subjects before, and during focus on a target 11 cm from the cornea. Images with superimposable foveal images, obtained before and during accommodation, that met all of the predetermined alignment criteria were selected for comparison. This registration requirement assured that changes in anterior chamber depth and central lens thickness could be accurately and reliably measured. The lens radii of curvatures were measured with a pixel stick circle.Results: Images from only 3 of 10 subjects met the predetermined criteria for registration. Mean anterior chamber depth decreased, −67 µm (range: −0.40 to −110 µm, and mean central lens thickness increased, 117 µm (range: 100–130 µm. The lens surfaces steepened, anterior greater than posterior, while the lens, itself, did not move or shift its position as appeared from the lack of movement of the lens nucleus, during 7.8 diopters of accommodation, (range: 6.6–9.7 diopters.Conclusion: Image registration, with stable invariant references for image correspondence, reveals that during accommodation a

  2. a Novel Image Registration Algorithm for SAR and Optical Images Based on Virtual Points

    Science.gov (United States)

    Ai, C.; Feng, T.; Wang, J.; Zhang, S.

    2013-07-01

    Optical image is rich in spectral information, while SAR instrument can work in both day and night and obtain images through fog and clouds. Combination of these two types of complementary images shows the great advantages of better image interpretation. Image registration is an inevitable and critical problem for the applications of multi-source remote sensing images, such as image fusion, pattern recognition and change detection. However, the different characteristics between SAR and optical images, which are due to the difference in imaging mechanism and the speckle noises in SAR image, bring great challenges to the multi-source image registration. Therefore, a novel image registration algorithm based on the virtual points, derived from the corresponding region features, is proposed in this paper. Firstly, image classification methods are adopted to extract closed regions from SAR and optical images respectively. Secondly, corresponding region features are matched by constructing cost function with rotate invariant region descriptors such as area, perimeter, and the length of major and minor axes. Thirdly, virtual points derived from corresponding region features, such as the centroids, endpoints and cross points of major and minor axes, are used to calculate initial registration parameters. Finally, the parameters are corrected by an iterative calculation, which will be terminated when the overlap of corresponding region features reaches its maximum. In the experiment, WordView-2 and Radasat-2 with 0.5 m and 4.7 m spatial resolution respectively, obtained in August 2010 in Suzhou, are used to test the registration method. It is shown that the multi-source image registration algorithm presented above is effective, and the accuracy of registration is up to pixel level.

  3. Batch settling curve registration via image data modeling.

    Science.gov (United States)

    Derlon, Nicolas; Thürlimann, Christian; Dürrenmatt, David; Villez, Kris

    2017-05-01

    To this day, obtaining reliable characterization of sludge settling properties remains a challenging and time-consuming task. Without such assessments however, optimal design and operation of secondary settling tanks is challenging and conservative approaches will remain necessary. With this study, we show that automated sludge blanket height registration and zone settling velocity estimation is possible thanks to analysis of images taken during batch settling experiments. The experimental setup is particularly interesting for practical applications as it consists of off-the-shelf components only, no moving parts are required, and the software is released publicly. Furthermore, the proposed multivariate shape constrained spline model for image analysis appears to be a promising method for reliable sludge blanket height profile registration. Copyright © 2017 Elsevier Ltd. All rights reserved.

  4. Improving multispectral satellite image compression using onboard subpixel registration

    Science.gov (United States)

    Albinet, Mathieu; Camarero, Roberto; Isnard, Maxime; Poulet, Christophe; Perret, Jokin

    2013-09-01

    Future CNES earth observation missions will have to deal with an ever increasing telemetry data rate due to improvements in resolution and addition of spectral bands. Current CNES image compressors implement a discrete wavelet transform (DWT) followed by a bit plane encoding (BPE) but only on a mono spectral basis and do not profit from the multispectral redundancy of the observed scenes. Recent CNES studies have proven a substantial gain on the achievable compression ratio, +20% to +40% on selected scenarios, by implementing a multispectral compression scheme based on a Karhunen Loeve transform (KLT) followed by the classical DWT+BPE. But such results can be achieved only on perfectly registered bands; a default of registration as low as 0.5 pixel ruins all the benefits of multispectral compression. In this work, we first study the possibility to implement a multi-bands subpixel onboard registration based on registration grids generated on-the-fly by the satellite attitude control system and simplified resampling and interpolation techniques. Indeed bands registration is usually performed on ground using sophisticated techniques too computationally intensive for onboard use. This fully quantized algorithm is tuned to meet acceptable registration performances within stringent image quality criteria, with the objective of onboard real-time processing. In a second part, we describe a FPGA implementation developed to evaluate the design complexity and, by extrapolation, the data rate achievable on a spacequalified ASIC. Finally, we present the impact of this approach on the processing chain not only onboard but also on ground and the impacts on the design of the instrument.

  5. Supervised local error estimation for nonlinear image registration using convolutional neural networks

    Science.gov (United States)

    Eppenhof, Koen A. J.; Pluim, Josien P. W.

    2017-02-01

    Error estimation in medical image registration is valuable when validating, comparing, or combining registration methods. To validate a nonlinear image registration method, ideally the registration error should be known for the entire image domain. We propose a supervised method for the estimation of a registration error map for nonlinear image registration. The method is based on a convolutional neural network that estimates the norm of the residual deformation from patches around each pixel in two registered images. This norm is interpreted as the registration error, and is defined for every pixel in the image domain. The network is trained using a set of artificially deformed images. Each training example is a pair of images: the original image, and a random deformation of that image. No manually labeled ground truth error is required. At test time, only the two registered images are required as input. We train and validate the network on registrations in a set of 2D digital subtraction angiography sequences, such that errors up to eight pixels can be estimated. We show that for this range of errors the convolutional network is able to learn the registration error in pairs of 2D registered images at subpixel precision. Finally, we present a proof of principle for the extension to 3D registration problems in chest CTs, showing that the method has the potential to estimate errors in 3D registration problems.

  6. A hybrid genetic algorithm for multi-modal image registration

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    This paper describes a new method for three-dimensional medical image registration. In the interactive image-guided HIFU (High Intensity Focused Ultrasound) therapy system, a fast and precise localization of the tumor is very important. An automatic system is developed for registering pre-operative MR images with intra-operative ultrasound images based on the vessels visible in both of the modalities. When the MR and the ultrasound images are aligned, the centerline points of the vessels in the MR image will align with bright intensities in the ultrasound image. The method applies an optimization strategy combining the genetic algorithm with the conjugated gradients algorithm to minimize the objective function. It provides a feasible way of determining the global solution and makes the method robust to local maximum and insensitive to initial position. Two experiments were designed to evaluate the method, and the results show that our method has better registration accuracy and convergence rate than the other two classic algorithms.

  7. Registration and recognition in images and videos

    CERN Document Server

    Battiato, Sebastiano; Farinella, Giovanni

    2014-01-01

    Computer vision is the science and technology of making machines that see. It is concerned with the theory, design and implementation of algorithms that can automatically process visual data to recognize objects, track and recover their shape and spatial layout. The International Computer Vision Summer School - ICVSS was established in 2007 to provide both an objective and clear overview and an in-depth analysis of the state-of-the-art  research in Computer Vision. The courses are delivered by world renowned experts in the field, from both academia and industry, and cover both theoretical and practical aspects of real Computer Vision problems.  The school is organized every year by University of Cambridge (Computer Vision and Robotics Group) and University of Catania (Image Processing Lab). Different topics are covered each year.This edited volume contains a selection of articles covering some of the talks and tutorials held during the last editions of the school. The chapters provide an in-depth overview o...

  8. Hierarchical segmentation-assisted multimodal registration for MR brain images.

    Science.gov (United States)

    Lu, Huanxiang; Beisteiner, Roland; Nolte, Lutz-Peter; Reyes, Mauricio

    2013-04-01

    Information theory-based metric such as mutual information (MI) is widely used as similarity measurement for multimodal registration. Nevertheless, this metric may lead to matching ambiguity for non-rigid registration. Moreover, maximization of MI alone does not necessarily produce an optimal solution. In this paper, we propose a segmentation-assisted similarity metric based on point-wise mutual information (PMI). This similarity metric, termed SPMI, enhances the registration accuracy by considering tissue classification probabilities as prior information, which is generated from an expectation maximization (EM) algorithm. Diffeomorphic demons is then adopted as the registration model and is optimized in a hierarchical framework (H-SPMI) based on different levels of anatomical structure as prior knowledge. The proposed method is evaluated using Brainweb synthetic data and clinical fMRI images. Both qualitative and quantitative assessment were performed as well as a sensitivity analysis to the segmentation error. Compared to the pure intensity-based approaches which only maximize mutual information, we show that the proposed algorithm provides significantly better accuracy on both synthetic and clinical data.

  9. Physical Constraint Finite Element Model for Medical Image Registration.

    Directory of Open Access Journals (Sweden)

    Jingya Zhang

    Full Text Available Due to being derived from linear assumption, most elastic body based non-rigid image registration algorithms are facing challenges for soft tissues with complex nonlinear behavior and with large deformations. To take into account the geometric nonlinearity of soft tissues, we propose a registration algorithm on the basis of Newtonian differential equation. The material behavior of soft tissues is modeled as St. Venant-Kirchhoff elasticity, and the nonlinearity of the continuum represents the quadratic term of the deformation gradient under the Green- St.Venant strain. In our algorithm, the elastic force is formulated as the derivative of the deformation energy with respect to the nodal displacement vectors of the finite element; the external force is determined by the registration similarity gradient flow which drives the floating image deforming to the equilibrium condition. We compared our approach to three other models: 1 the conventional linear elastic finite element model (FEM; 2 the dynamic elastic FEM; 3 the robust block matching (RBM method. The registration accuracy was measured using three similarities: MSD (Mean Square Difference, NC (Normalized Correlation and NMI (Normalized Mutual Information, and was also measured using the mean and max distance between the ground seeds and corresponding ones after registration. We validated our method on 60 image pairs including 30 medical image pairs with artificial deformation and 30 clinical image pairs for both the chest chemotherapy treatment in different periods and brain MRI normalization. Our method achieved a distance error of 0.320±0.138 mm in x direction and 0.326±0.111 mm in y direction, MSD of 41.96±13.74, NC of 0.9958±0.0019, NMI of 1.2962±0.0114 for images with large artificial deformations; and average NC of 0.9622±0.008 and NMI of 1.2764±0.0089 for the real clinical cases. Student's t-test demonstrated that our model statistically outperformed the other methods in

  10. A fast image registration approach of neural activities in light-sheet fluorescence microscopy images

    Science.gov (United States)

    Meng, Hui; Hui, Hui; Hu, Chaoen; Yang, Xin; Tian, Jie

    2017-03-01

    The ability of fast and single-neuron resolution imaging of neural activities enables light-sheet fluorescence microscopy (LSFM) as a powerful imaging technique in functional neural connection applications. The state-of-art LSFM imaging system can record the neuronal activities of entire brain for small animal, such as zebrafish or C. elegans at single-neuron resolution. However, the stimulated and spontaneous movements in animal brain result in inconsistent neuron positions during recording process. It is time consuming to register the acquired large-scale images with conventional method. In this work, we address the problem of fast registration of neural positions in stacks of LSFM images. This is necessary to register brain structures and activities. To achieve fast registration of neural activities, we present a rigid registration architecture by implementation of Graphics Processing Unit (GPU). In this approach, the image stacks were preprocessed on GPU by mean stretching to reduce the computation effort. The present image was registered to the previous image stack that considered as reference. A fast Fourier transform (FFT) algorithm was used for calculating the shift of the image stack. The calculations for image registration were performed in different threads while the preparation functionality was refactored and called only once by the master thread. We implemented our registration algorithm on NVIDIA Quadro K4200 GPU under Compute Unified Device Architecture (CUDA) programming environment. The experimental results showed that the registration computation can speed-up to 550ms for a full high-resolution brain image. Our approach also has potential to be used for other dynamic image registrations in biomedical applications.

  11. Learning-based deformable image registration for infant MR images in the first year of life.

    Science.gov (United States)

    Hu, Shunbo; Wei, Lifang; Gao, Yaozong; Guo, Yanrong; Wu, Guorong; Shen, Dinggang

    2017-01-01

    Many brain development studies have been devoted to investigate dynamic structural and functional changes in the first year of life. To quantitatively measure brain development in such a dynamic period, accurate image registration for different infant subjects with possible large age gap is of high demand. Although many state-of-the-art image registration methods have been proposed for young and elderly brain images, very few registration methods work for infant brain images acquired in the first year of life, because of (a) large anatomical changes due to fast brain development and (b) dynamic appearance changes due to white-matter myelination. To address these two difficulties, we propose a learning-based registration method to not only align the anatomical structures but also alleviate the appearance differences between two arbitrary infant MR images (with large age gap) by leveraging the regression forest to predict both the initial displacement vector and appearance changes. Specifically, in the training stage, two regression models are trained separately, with (a) one model learning the relationship between local image appearance (of one development phase) and its displacement toward the template (of another development phase) and (b) another model learning the local appearance changes between the two brain development phases. Then, in the testing stage, to register a new infant image to the template, we first predict both its voxel-wise displacement and appearance changes by the two learned regression models. Since such initializations can alleviate significant appearance and shape differences between new infant image and the template, it is easy to just use a conventional registration method to refine the remaining registration. We apply our proposed registration method to align 24 infant subjects at five different time points (i.e., 2-week-old, 3-month-old, 6-month-old, 9-month-old, and 12-month-old), and achieve more accurate and robust registration

  12. Evaluation of whole-body MR to CT deformable image registration

    NARCIS (Netherlands)

    Akbarzadeh, A.; Gutierrez, D.; Baskin, A.; Ay, M. R.; Ahmadian, A.; Alam, N. Riahi; Loevblad, K. O.; Zaidi, H.

    2013-01-01

    Multimodality image registration plays a crucial role in various clinical and research applications. The aim of this study is to present an optimized MR to CT whole-body deformable image registration algorithm and its validation using clinical studies. A 3D intermodality registration technique based

  13. Advances and challenges in deformable image registration: From image fusion to complex motion modelling.

    Science.gov (United States)

    Schnabel, Julia A; Heinrich, Mattias P; Papież, Bartłomiej W; Brady, Sir J Michael

    2016-10-01

    Over the past 20 years, the field of medical image registration has significantly advanced from multi-modal image fusion to highly non-linear, deformable image registration for a wide range of medical applications and imaging modalities, involving the compensation and analysis of physiological organ motion or of tissue changes due to growth or disease patterns. While the original focus of image registration has predominantly been on correcting for rigid-body motion of brain image volumes acquired at different scanning sessions, often with different modalities, the advent of dedicated longitudinal and cross-sectional brain studies soon necessitated the development of more sophisticated methods that are able to detect and measure local structural or functional changes, or group differences. Moving outside of the brain, cine imaging and dynamic imaging required the development of deformable image registration to directly measure or compensate for local tissue motion. Since then, deformable image registration has become a general enabling technology. In this work we will present our own contributions to the state-of-the-art in deformable multi-modal fusion and complex motion modelling, and then discuss remaining challenges and provide future perspectives to the field.

  14. A one-bit approach for image registration

    Science.gov (United States)

    Nguyen, An Hung; Pickering, Mark; Lambert, Andrew

    2015-02-01

    Motion estimation or optic flow computation for automatic navigation and obstacle avoidance programs running on Unmanned Aerial Vehicles (UAVs) is a challenging task. These challenges come from the requirements of real-time processing speed and small light-weight image processing hardware with very limited resources (especially memory space) embedded on the UAVs. Solutions towards both simplifying computation and saving hardware resources have recently received much interest. This paper presents an approach for image registration using binary images which addresses these two requirements. This approach uses translational information between two corresponding patches of binary images to estimate global motion. These low bit-resolution images require a very small amount of memory space to store them and allow simple logic operations such as XOR and AND to be used instead of more complex computations such as subtractions and multiplications.

  15. An improved SIFT algorithm based on KFDA in image registration

    Science.gov (United States)

    Chen, Peng; Yang, Lijuan; Huo, Jinfeng

    2016-03-01

    As a kind of stable feature matching algorithm, SIFT has been widely used in many fields. In order to further improve the robustness of the SIFT algorithm, an improved SIFT algorithm with Kernel Discriminant Analysis (KFDA-SIFT) is presented for image registration. The algorithm uses KFDA to SIFT descriptors for feature extraction matrix, and uses the new descriptors to conduct the feature matching, finally chooses RANSAC to deal with the matches for further purification. The experiments show that the presented algorithm is robust to image changes in scale, illumination, perspective, expression and tiny pose with higher matching accuracy.

  16. Multimodality imaging combination in small animal via point-based registration

    Science.gov (United States)

    Yang, C. C.; Wu, T. H.; Lin, M. H.; Huang, Y. H.; Guo, W. Y.; Chen, C. L.; Wang, T. C.; Yin, W. H.; Lee, J. S.

    2006-12-01

    We present a system of image co-registration in small animal study. Marker-based registration is chosen because of its considerable advantage that the fiducial feature is independent of imaging modality. We also experimented with different scanning protocols and different fiducial marker sizes to improve registration accuracy. Co-registration was conducted using rat phantom fixed by stereotactic frame. Overall, the co-registration accuracy was in sub-millimeter level and close to intrinsic system error. Therefore, we conclude that the system is an accurate co-registration method to be used in small animal studies.

  17. On-line range images registration with GPGPU

    Science.gov (United States)

    Będkowski, J.; Naruniec, J.

    2013-03-01

    This paper concerns implementation of algorithms in the two important aspects of modern 3D data processing: data registration and segmentation. Solution proposed for the first topic is based on the 3D space decomposition, while the latter on image processing and local neighbourhood search. Data processing is implemented by using NVIDIA compute unified device architecture (NIVIDIA CUDA) parallel computation. The result of the segmentation is a coloured map where different colours correspond to different objects, such as walls, floor and stairs. The research is related to the problem of collecting 3D data with a RGB-D camera mounted on a rotated head, to be used in mobile robot applications. Performance of the data registration algorithm is aimed for on-line processing. The iterative closest point (ICP) approach is chosen as a registration method. Computations are based on the parallel fast nearest neighbour search. This procedure decomposes 3D space into cubic buckets and, therefore, the time of the matching is deterministic. First technique of the data segmentation uses accele-rometers integrated with a RGB-D sensor to obtain rotation compensation and image processing method for defining pre-requisites of the known categories. The second technique uses the adapted nearest neighbour search procedure for obtaining normal vectors for each range point.

  18. Robust image registration using adaptive coherent point drift method

    Science.gov (United States)

    Yang, Lijuan; Tian, Zheng; Zhao, Wei; Wen, Jinhuan; Yan, Weidong

    2016-04-01

    Coherent point drift (CPD) method is a powerful registration tool under the framework of the Gaussian mixture model (GMM). However, the global spatial structure of point sets is considered only without other forms of additional attribute information. The equivalent simplification of mixing parameters and the manual setting of the weight parameter in GMM make the CPD method less robust to outlier and have less flexibility. An adaptive CPD method is proposed to automatically determine the mixing parameters by embedding the local attribute information of features into the construction of GMM. In addition, the weight parameter is treated as an unknown parameter and automatically determined in the expectation-maximization algorithm. In image registration applications, the block-divided salient image disk extraction method is designed to detect sparse salient image features and local self-similarity is used as attribute information to describe the local neighborhood structure of each feature. The experimental results on optical images and remote sensing images show that the proposed method can significantly improve the matching performance.

  19. Fluid Registration of Diffusion Tensor Images Using Information Theory

    Science.gov (United States)

    Chiang, Ming-Chang; Leow, Alex D.; Klunder, Andrea D.; Dutton, Rebecca A.; Barysheva, Marina; Rose, Stephen E.; McMahon, Katie L.; de Zubicaray, Greig I.; Toga, Arthur W.; Thompson, Paul M.

    2008-01-01

    We apply an information-theoretic cost metric, the symmetrized Kullback-Leibler (sKL) divergence, or J-divergence, to fluid registration of diffusion tensor images. The difference between diffusion tensors is quantified based on the sKL-divergence of their associated probability density functions (PDFs). Three-dimensional DTI data from 34 subjects were fluidly registered to an optimized target image. To allow large image deformations but preserve image topology, we regularized the flow with a large-deformation diffeomorphic mapping based on the kinematics of a Navier-Stokes fluid. A driving force was developed to minimize the J-divergence between the deforming source and target diffusion functions, while reorienting the flowing tensors to preserve fiber topography. In initial experiments, we showed that the sKL-divergence based on full diffusion PDFs is adaptable to higher-order diffusion models, such as high angular resolution diffusion imaging (HARDI). The sKL-divergence was sensitive to subtle differences between two diffusivity profiles, showing promise for nonlinear registration applications and multisubject statistical analysis of HARDI data. PMID:18390342

  20. Incorporating global information in feature-based multimodal image registration

    Science.gov (United States)

    Li, Yong; Stevenson, Robert

    2014-03-01

    A multimodal image registration framework based on searching the best matched keypoints and the incorporation of global information is proposed. It comprises two key elements: keypoint detection and an iterative process. Keypoints are detected from both the reference and test images. For each test keypoint, a number of reference keypoints are chosen as mapping candidates. A triplet of keypoint mappings determine an affine transformation that is evaluated using a similarity metric between the reference image and the transformed test image by the determined transformation. An iterative process is conducted on triplets of keypoint mappings, keeping track of the best matched reference keypoint. Random sample consensus and mutual information are applied to eliminate outlier keypoint mappings. The similarity metric is defined to be the number of overlapped edge pixels over the entire images, allowing for global information to be incorporated in the evaluation of triplets of mappings. The performance of the framework is investigated with keypoints extracted by scale invariant feature transform and partial intensity invariant feature descriptor. Experimental results show that the proposed framework can provide more accurate registration than existing methods.

  1. Registration Method for CT-MR Image Based on Mutual Information

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    Medical image registration is important in many medical applications. Registration method based on maximization of mutual information of voxel intensities is one of the most popular methods for 3-D multi-modality medical image registration. Generally, the optimization process is easily trapped in local maximum, resulting in wrong registration results. In order to find the correct optimum, a new multi-resolution approach for brain image registration based on normalized mutual information is proposed. In this method, to eliminate the effect of local optima, multi-scale wavelet transformation is adopted to extract the image edge features. Then the feature images are registered,and the result at this level is taken as the initial estimate for the registration of the original images.Three-dimensional volumes are used to test the algorithm. Experimental results show that the registration strategy proposed is a robust and efficient method which can reach sub-voxel accuracy and improve the optimization speed.

  2. Using image synthesis for multi-channel registration of different image modalities

    Science.gov (United States)

    Chen, Min; Jog, Amod; Carass, Aaron; Prince, Jerry L.

    2015-01-01

    This paper presents a multi-channel approach for performing registration between magnetic resonance (MR) images with different modalities. In general, a multi-channel registration cannot be used when the moving and target images do not have analogous modalities. In this work, we address this limitation by using a random forest regression technique to synthesize the missing modalities from the available ones. This allows a single channel registration between two different modalities to be converted into a multi-channel registration with two mono-modal channels. To validate our approach, two openly available registration algorithms and five cost functions were used to compare the label transfer accuracy of the registration with (and without) our multi-channel synthesis approach. Our results show that the proposed method produced statistically significant improvements in registration accuracy (at an α level of 0.001) for both algorithms and all cost functions when compared to a standard multi-modal registration using the same algorithms with mutual information. PMID:26246653

  3. MIND Demons for MR-to-CT deformable image registration in image-guided spine surgery

    Science.gov (United States)

    Reaungamornrat, S.; De Silva, T.; Uneri, A.; Wolinsky, J.-P.; Khanna, A. J.; Kleinszig, G.; Vogt, S.; Prince, J. L.; Siewerdsen, J. H.

    2016-03-01

    Purpose: Localization of target anatomy and critical structures defined in preoperative MR images can be achieved by means of multi-modality deformable registration to intraoperative CT. We propose a symmetric diffeomorphic deformable registration algorithm incorporating a modality independent neighborhood descriptor (MIND) and a robust Huber metric for MR-to-CT registration. Method: The method, called MIND Demons, solves for the deformation field between two images by optimizing an energy functional that incorporates both the forward and inverse deformations, smoothness on the velocity fields and the diffeomorphisms, a modality-insensitive similarity function suitable to multi-modality images, and constraints on geodesics in Lagrangian coordinates. Direct optimization (without relying on an exponential map of stationary velocity fields used in conventional diffeomorphic Demons) is carried out using a Gauss-Newton method for fast convergence. Registration performance and sensitivity to registration parameters were analyzed in simulation, in phantom experiments, and clinical studies emulating application in image-guided spine surgery, and results were compared to conventional mutual information (MI) free-form deformation (FFD), local MI (LMI) FFD, and normalized MI (NMI) Demons. Result: The method yielded sub-voxel invertibility (0.006 mm) and nonsingular spatial Jacobians with capability to preserve local orientation and topology. It demonstrated improved registration accuracy in comparison to the reference methods, with mean target registration error (TRE) of 1.5 mm compared to 10.9, 2.3, and 4.6 mm for MI FFD, LMI FFD, and NMI Demons methods, respectively. Validation in clinical studies demonstrated realistic deformation with sub-voxel TRE in cases of cervical, thoracic, and lumbar spine. Conclusions: A modality-independent deformable registration method has been developed to estimate a viscoelastic diffeomorphic map between preoperative MR and intraoperative CT

  4. Multislice CT brain image registration for perfusion studies

    Science.gov (United States)

    Lin, Zhong Min; Pohlman, Scott; Chandra, Shalabh

    2002-04-01

    During the last several years perfusion CT techniques have been developed as an effective technique for clinically evaluating cerebral hemodynamics. Perfusion CT techniques are capable of measurings functional parameters such as tissue perfusion, blood flow, blood volume, and mean transit time and are commonly used to evaluate stroke patients. However, the quality of functional images of the brain frequently suffers from patient head motion. Because the time window for an effective treatment of stroke patient is narrow, a fast motion correction is required. The purpose of the paper is to present a fast and accurate registration technique for motion correction of multi-slice CT and to demonstrate the effects of the registration on perfusion calculation.

  5. Gradient-Based Approach for Fine Registration of Panorama Images

    Institute of Scientific and Technical Information of China (English)

    Hui Chen

    2004-01-01

    This paper studies the application of gradient-based motion detection techniques (i.e., optical flow methods) for registration of adjacent images taken using a hand-held camera for the purposes of building a panorama. A general 8-parameter model or a more compact 3-parameter model is commonly used for transformation estimation. However, both models are approximations to the real situation when viewpoint position is not absolutely fixed but includes a small translation, and thus distortion and blurring are sometimes present in the final registration results. This paper proposes a new 5-parameter model that shows better result and has less strict requirement on good choice of unknown initial parameters. An analysis of disparity recovery range and its enlargement using Gaussian filter is also given.

  6. Registration of image feature points using differential evolution

    Institute of Scientific and Technical Information of China (English)

    ZHANG Hao; HUANG Zhan-hua; YU Dao-ying

    2005-01-01

    This paper introduces a robust global nonlinear optimizer-differential evolution(DE),which is a simple evolution algorithm to search for an optimal transformation that makes the best alignment of two sets of feature points.To map the problem of matching into the framework of DE,the objective function is proportional to the registration error which is measured by Hausdorff distance,while the parameters of transformation are encoded in floating-point as the functional variables.Three termination criteria are proposed for DE.A simulation of 2-dimensional point sets and a similarity transformation are presented to compare the robustness and convergence properties of DE with genetic algorithm's (GA).And the registration of an object and its contour model have been demonstrated by using of DE to natural images.

  7. Direct Image-To Registration Using Mobile Sensor Data

    Science.gov (United States)

    Kehl, C.; Buckley, S. J.; Gawthorpe, R. L.; Viola, I.; Howell, J. A.

    2016-06-01

    Adding supplementary texture and 2D image-based annotations to 3D surface models is a useful next step for domain specialists to make use of photorealistic products of laser scanning and photogrammetry. This requires a registration between the new camera imagery and the model geometry to be solved, which can be a time-consuming task without appropriate automation. The increasing availability of photorealistic models, coupled with the proliferation of mobile devices, gives users the possibility to complement their models in real time. Modern mobile devices deliver digital photographs of increasing quality, as well as on-board sensor data, which can be used as input for practical and automatic camera registration procedures. Their familiar user interface also improves manual registration procedures. This paper introduces a fully automatic pose estimation method using the on-board sensor data for initial exterior orientation, and feature matching between an acquired photograph and a synthesised rendering of the orientated 3D scene as input for fine alignment. The paper also introduces a user-friendly manual camera registration- and pose estimation interface for mobile devices, based on existing surface geometry and numerical optimisation methods. The article further assesses the automatic algorithm's accuracy compared to traditional methods, and the impact of computational- and environmental parameters. Experiments using urban and geological case studies show a significant sensitivity of the automatic procedure to the quality of the initial mobile sensor values. Changing natural lighting conditions remain a challenge for automatic pose estimation techniques, although progress is presented here. Finally, the automatically-registered mobile images are used as the basis for adding user annotations to the input textured model.

  8. Rapid registration of multimodal images using a reduced number of voxels

    Science.gov (United States)

    Huang, Xishi; Hill, Nicholas A.; Ren, Jing; Peters, Terry M.

    2006-03-01

    Rapid registration of multimodal cardiac images can improve image-guided cardiac surgeries and cardiac disease diagnosis. While mutual information (MI) is arguably the most suitable registration technique, this method is too slow to converge for real time cardiac image registration; moreover, correct registration may not coincide with a global or even local maximum of MI. These limitations become quite evident when registering three-dimensional (3D) ultrasound (US) images and dynamic 3D magnetic resonance (MR) images of the beating heart. To overcome these issues, we present a registration method that uses a reduced number of voxels, while retaining adequate registration accuracy. Prior to registration we preprocess the images such that only the most representative anatomical features are depicted. By selecting samples from preprocessed images, our method dramatically speeds up the registration process, as well as ensuring correct registration. We validated this registration method for registering dynamic US and MR images of the beating heart of a volunteer. Experimental results on in vivo cardiac images demonstrate significant improvements in registration speed without compromising registration accuracy. A second validation study was performed registering US and computed tomography (CT) images of a rib cage phantom. Two similarity metrics, MI and normalized crosscorrelation (NCC) were used to register the image sets. Experimental results on the rib cage phantom indicate that our method can achieve adequate registration accuracy within 10% of the computation time of conventional registration methods. We believe this method has the potential to facilitate intra-operative image fusion for minimally invasive cardio-thoracic surgical navigation.

  9. Complete quantum circuit of Haar wavelet based MRA

    Institute of Scientific and Technical Information of China (English)

    HE Yuguo; SUN Jigui

    2005-01-01

    Wavelet analysis has applications in many areas, such as signal analysis and image processing. We propose a method for generating the complete circuit of Haar wavelet based MRA by factoring butterfly matrices and conditional perfect shuffle permutation matrices. The factorization of butterfly matrices is the essential part of the design. As a result, it is the key point to obtain the circuits of .I2t()W()I2n-2t-2. In this paper, we use a simple means to develop quantum circuits for this kind of matrices. Similarly, the conditional permutation matrix is implemented entirely, combined with the scheme of Fijany and Williams. The cir-cuits and the ideas adopted in the design are simple and in-telligible.

  10. An Advanced Rotation Invariant Descriptor for SAR Image Registration

    Directory of Open Access Journals (Sweden)

    Yuming Xiang

    2017-07-01

    Full Text Available The Scale-Invariant Feature Transform (SIFT algorithm and its many variants have been widely used in Synthetic Aperture Radar (SAR image registration. The SIFT-like algorithms maintain rotation invariance by assigning a dominant orientation for each keypoint, while the calculation of dominant orientation is not robust due to the effect of speckle noise in SAR imagery. In this paper, we propose an advanced local descriptor for SAR image registration to achieve rotation invariance without assigning a dominant orientation. Based on the improved intensity orders, we first divide a circular neighborhood into several sub-regions. Second, rotation-invariant ratio orientation histograms of each sub-region are proposed by accumulating the ratio values of different directions in a rotation-invariant coordinate system. The proposed descriptor is composed of the concatenation of the histograms of each sub-region. In order to increase the distinctiveness of the proposed descriptor, multiple image neighborhoods are aggregated. Experimental results on several satellite SAR images have shown an improvement in the matching performance over other state-of-the-art algorithms.

  11. Medical image retrieval based on plaque appearance and image registration.

    Science.gov (United States)

    Amores, Jaume; Radeva, Petia

    2005-01-01

    The increasing amount of medical images produced and stored daily in hospitals needs a datrabase management system that organizes them in a meaningful way, without the necessity of time-consuming textual annotations for each image. One of the basic ways to organize medical images in taxonomies consists of clustering them depending of plaque appearance (for example, intravascular ultrasound images). Although lately, there has been a lot of research in the field of Content-Based Image Retrieval systems, mostly these systems are designed for dealing a wide range of images but not medical images. Medical image retrieval by content is still an emerging field, and few works are presented in spite of the obvious applications and the complexity of the images demanding research studies. In this chapter, we overview the work on medical image retrieval and present a general framework of medical image retrieval based on plaque appearance. We stress on two basic features of medical image retrieval based on plaque appearance: plaque medical images contain complex information requiring not only local and global descriptors but also context determined by image features and their spatial relations. Additionally, given that most objects in medical images usually have high intra- and inter-patient shape variance, retrieval based on plaque should be invariant to a family of transformations predetermined by the application domain. To illustrate the medical image retrieval based on plaque appearance, we consider a specific image modality: intravascular ultrasound images and present extensive results on the retrieval performance.

  12. Panorama imaging for image-to-physical registration of narrow drill holes inside spongy bones

    Science.gov (United States)

    Bergmeier, Jan; Fast, Jacob Friedemann; Ortmaier, Tobias; Kahrs, Lüder Alexander

    2017-03-01

    Image-to-physical registration based on volumetric data like computed tomography on the one side and intraoperative endoscopic images on the other side is an important method for various surgical applications. In this contribution, we present methods to generate panoramic views from endoscopic recordings for image-to-physical registration of narrow drill holes inside spongy bone. One core application is the registration of drill poses inside the mastoid during minimally invasive cochlear implantations. Besides the development of image processing software for registration, investigations are performed on a miniaturized optical system, achieving 360° radial imaging with one shot by extending a conventional, small, rigid, rod lens endoscope. A reflective cone geometry is used to deflect radially incoming light rays into the endoscope optics. Therefore, a cone mirror is mounted in front of a conventional 0° endoscope. Furthermore, panoramic images of inner drill hole surfaces in artificial bone material are created. Prior to drilling, cone beam computed tomography data is acquired from this artificial bone and simulated endoscopic views are generated from this data. A qualitative and quantitative image comparison of resulting views in terms of image-to-image registration is performed. First results show that downsizing of panoramic optics to a diameter of 3mm is possible. Conventional rigid rod lens endoscopes can be extended to produce suitable panoramic one-shot image data. Using unrolling and stitching methods, images of the inner drill hole surface similar to computed tomography image data of the same surface were created. Registration is performed on ten perturbations of the search space and results in target registration errors of (0:487 +/- 0:438)mm at the entry point and (0:957 +/- 0:948)mm at the exit as well as an angular error of (1:763 +/- 1:536)°. The results show suitability of this image data for image-to-image registration. Analysis of the error

  13. Image navigation and registration for the geostationary lightning mapper (GLM)

    Science.gov (United States)

    van Bezooijen, Roel W. H.; Demroff, Howard; Burton, Gregory; Chu, Donald; Yang, Shu S.

    2016-10-01

    The Geostationary Lightning Mappers (GLM) for the Geostationary Operational Environmental Satellite (GOES) GOES-R series will, for the first time, provide hemispherical lightning information 24 hours a day from longitudes of 75 and 137 degrees west. The first GLM of a series of four is planned for launch in November, 2016. Observation of lightning patterns by GLM holds promise to improve tornado warning lead times to greater than 20 minutes while halving the present false alarm rates. In addition, GLM will improve airline traffic flow management, and provide climatology data allowing us to understand the Earth's evolving climate. The paper describes the method used for translating the pixel position of a lightning event to its corresponding geodetic longitude and latitude, using the J2000 attitude of the GLM mount frame reported by the spacecraft, the position of the spacecraft, and the alignment of the GLM coordinate frame relative to its mount frame. Because the latter alignment will experience seasonal variation, this alignment is determined daily using GLM background images collected over the previous 7 days. The process involves identification of coastlines in the background images and determination of the alignment change necessary to match the detected coastline with the coastline predicted using the GSHHS database. Registration is achieved using a variation of the Lucas-Kanade algorithm where we added a dither and average technique to improve performance significantly. An innovative water mask technique was conceived to enable self-contained detection of clear coastline sections usable for registration. Extensive simulations using accurate visible images from GOES13 and GOES15 have been used to demonstrate the performance of the coastline registration method, the results of which are presented in the paper.

  14. Wavelet-based acoustic recognition of aircraft

    Energy Technology Data Exchange (ETDEWEB)

    Dress, W.B.; Kercel, S.W.

    1994-09-01

    We describe a wavelet-based technique for identifying aircraft from acoustic emissions during take-off and landing. Tests show that the sensor can be a single, inexpensive hearing-aid microphone placed close to the ground the paper describes data collection, analysis by various technique, methods of event classification, and extraction of certain physical parameters from wavelet subspace projections. The primary goal of this paper is to show that wavelet analysis can be used as a divide-and-conquer first step in signal processing, providing both simplification and noise filtering. The idea is to project the original signal onto the orthogonal wavelet subspaces, both details and approximations. Subsequent analysis, such as system identification, nonlinear systems analysis, and feature extraction, is then carried out on the various signal subspaces.

  15. Wavelet-Based Monitoring for Biosurveillance

    Directory of Open Access Journals (Sweden)

    Galit Shmueli

    2013-07-01

    Full Text Available Biosurveillance, focused on the early detection of disease outbreaks, relies on classical statistical control charts for detecting disease outbreaks. However, such methods are not always suitable in this context. Assumptions of normality, independence and stationarity are typically violated in syndromic data. Furthermore, outbreak signatures are typically of unknown patterns and, therefore, call for general detectors. We propose wavelet-based methods, which make less assumptions and are suitable for detecting abnormalities of unknown form. Wavelets have been widely used for data denoising and compression, but little work has been published on using them for monitoring. We discuss monitoring-based issues and illustrate them using data on military clinic visits in the USA.

  16. Distance-Dependent Multimodal Image Registration for Agriculture Tasks

    Directory of Open Access Journals (Sweden)

    Ron Berenstein

    2015-08-01

    Full Text Available Image registration is the process of aligning two or more images of the same scene taken at different times; from different viewpoints; and/or by different sensors. This research focuses on developing a practical method for automatic image registration for agricultural systems that use multimodal sensory systems and operate in natural environments. While not limited to any particular modalities; here we focus on systems with visual and thermal sensory inputs. Our approach is based on pre-calibrating a distance-dependent transformation matrix (DDTM between the sensors; and representing it in a compact way by regressing the distance-dependent coefficients as distance-dependent functions. The DDTM is measured by calculating a projective transformation matrix for varying distances between the sensors and possible targets. To do so we designed a unique experimental setup including unique Artificial Control Points (ACPs and their detection algorithms for the two sensors. We demonstrate the utility of our approach using different experiments and evaluation criteria.

  17. Higher-order Spatial Accuracy in Diffeomorphic Image Registration

    DEFF Research Database (Denmark)

    Jacobs, Henry O.; Sommer, Stefan

    -jets. We show that the solutions convergence to optimal solutions of the original cost functional as the number of particles increases with a convergence rate of O(hd+k) where h is a resolution parameter. The effect of this approach over traditional particle methods is illustrated on synthetic examples......We discretize a cost functional for image registration problems by deriving Taylor expansions for the matching term. Minima of the discretized cost functionals can be computed with no spatial discretization error, and the optimal solutions are equivalent to minimal energy curves in the space of kk...

  18. Scalable High-Performance Image Registration Framework by Unsupervised Deep Feature Representations Learning.

    Science.gov (United States)

    Wu, Guorong; Kim, Minjeong; Wang, Qian; Munsell, Brent C; Shen, Dinggang

    2016-07-01

    Feature selection is a critical step in deformable image registration. In particular, selecting the most discriminative features that accurately and concisely describe complex morphological patterns in image patches improves correspondence detection, which in turn improves image registration accuracy. Furthermore, since more and more imaging modalities are being invented to better identify morphological changes in medical imaging data, the development of deformable image registration method that scales well to new image modalities or new image applications with little to no human intervention would have a significant impact on the medical image analysis community. To address these concerns, a learning-based image registration framework is proposed that uses deep learning to discover compact and highly discriminative features upon observed imaging data. Specifically, the proposed feature selection method uses a convolutional stacked autoencoder to identify intrinsic deep feature representations in image patches. Since deep learning is an unsupervised learning method, no ground truth label knowledge is required. This makes the proposed feature selection method more flexible to new imaging modalities since feature representations can be directly learned from the observed imaging data in a very short amount of time. Using the LONI and ADNI imaging datasets, image registration performance was compared to two existing state-of-the-art deformable image registration methods that use handcrafted features. To demonstrate the scalability of the proposed image registration framework, image registration experiments were conducted on 7.0-T brain MR images. In all experiments, the results showed that the new image registration framework consistently demonstrated more accurate registration results when compared to state of the art.

  19. Scalable High Performance Image Registration Framework by Unsupervised Deep Feature Representations Learning

    Science.gov (United States)

    Wu, Guorong; Kim, Minjeong; Wang, Qian; Munsell, Brent C.

    2015-01-01

    Feature selection is a critical step in deformable image registration. In particular, selecting the most discriminative features that accurately and concisely describe complex morphological patterns in image patches improves correspondence detection, which in turn improves image registration accuracy. Furthermore, since more and more imaging modalities are being invented to better identify morphological changes in medical imaging data,, the development of deformable image registration method that scales well to new image modalities or new image applications with little to no human intervention would have a significant impact on the medical image analysis community. To address these concerns, a learning-based image registration framework is proposed that uses deep learning to discover compact and highly discriminative features upon observed imaging data. Specifically, the proposed feature selection method uses a convolutional stacked auto-encoder to identify intrinsic deep feature representations in image patches. Since deep learning is an unsupervised learning method, no ground truth label knowledge is required. This makes the proposed feature selection method more flexible to new imaging modalities since feature representations can be directly learned from the observed imaging data in a very short amount of time. Using the LONI and ADNI imaging datasets, image registration performance was compared to two existing state-of-the-art deformable image registration methods that use handcrafted features. To demonstrate the scalability of the proposed image registration framework image registration experiments were conducted on 7.0-tesla brain MR images. In all experiments, the results showed the new image registration framework consistently demonstrated more accurate registration results when compared to state-of-the-art. PMID:26552069

  20. Three modality image registration of brain SPECT/CT and MR images for quantitative analysis of dopamine transporter imaging

    Science.gov (United States)

    Yamaguchi, Yuzuho; Takeda, Yuta; Hara, Takeshi; Zhou, Xiangrong; Matsusako, Masaki; Tanaka, Yuki; Hosoya, Kazuhiko; Nihei, Tsutomu; Katafuchi, Tetsuro; Fujita, Hiroshi

    2016-03-01

    Important features in Parkinson's disease (PD) are degenerations and losses of dopamine neurons in corpus striatum. 123I-FP-CIT can visualize activities of the dopamine neurons. The activity radio of background to corpus striatum is used for diagnosis of PD and Dementia with Lewy Bodies (DLB). The specific activity can be observed in the corpus striatum on SPECT images, but the location and the shape of the corpus striatum on SPECT images only are often lost because of the low uptake. In contrast, MR images can visualize the locations of the corpus striatum. The purpose of this study was to realize a quantitative image analysis for the SPECT images by using image registration technique with brain MR images that can determine the region of corpus striatum. In this study, the image fusion technique was used to fuse SPECT and MR images by intervening CT image taken by SPECT/CT. The mutual information (MI) for image registration between CT and MR images was used for the registration. Six SPECT/CT and four MR scans of phantom materials are taken by changing the direction. As the results of the image registrations, 16 of 24 combinations were registered within 1.3mm. By applying the approach to 32 clinical SPECT/CT and MR cases, all of the cases were registered within 0.86mm. In conclusions, our registration method has a potential in superimposing MR images on SPECT images.

  1. Image registration and averaging of low laser power two-photon fluorescence images of mouse retina.

    Science.gov (United States)

    Alexander, Nathan S; Palczewska, Grazyna; Stremplewski, Patrycjusz; Wojtkowski, Maciej; Kern, Timothy S; Palczewski, Krzysztof

    2016-07-01

    Two-photon fluorescence microscopy (TPM) is now being used routinely to image live cells for extended periods deep within tissues, including the retina and other structures within the eye . However, very low laser power is a requirement to obtain TPM images of the retina safely. Unfortunately, a reduction in laser power also reduces the signal-to-noise ratio of collected images, making it difficult to visualize structural details. Here, image registration and averaging methods applied to TPM images of the eye in living animals (without the need for auxiliary hardware) demonstrate the structural information obtained with laser power down to 1 mW. Image registration provided between 1.4% and 13.0% improvement in image quality compared to averaging images without registrations when using a high-fluorescence template, and between 0.2% and 12.0% when employing the average of collected images as the template. Also, a diminishing return on image quality when more images were used to obtain the averaged image is shown. This work provides a foundation for obtaining informative TPM images with laser powers of 1 mW, compared to previous levels for imaging mice ranging between 6.3 mW [Palczewska G., Nat Med.20, 785 (2014) Sharma R., Biomed. Opt. Express4, 1285 (2013)].

  2. Automatic Registration of SAR Images with the Integrated Complementary Invariant Feature

    Directory of Open Access Journals (Sweden)

    Xiao-hua Wang

    2014-01-01

    Full Text Available The accurate Synthetic Aperture Radar (SAR image registration is important for exact analyses of mine deformation and ecological environment change. Currently, many image registration algorithms have been proposed, but these registration algorithms cannot be directly applied to SAR image, so an integrated registration approach is presented in this paper. Firstly, it is the coarse matching with Canny edge dividing regions; secondly, it is the fine matching by SIFT algorithm with improved Canny edge features; finally, obtain accurate registration SAR image. This approach has fewer computations than that simply using SIFT feature matching. Experimental analyses with SAR images of Yanzhou Mine demonstrate the efficiency and the accuracy of this approach for mine SAR image registration, which provides a simple and effective tool in SAR monitoring of mining deformation and ecological changes

  3. [Research on non-rigid medical image registration algorithm based on SIFT feature extraction].

    Science.gov (United States)

    Wang, Anna; Lu, Dan; Wang, Zhe; Fang, Zhizhen

    2010-08-01

    In allusion to non-rigid registration of medical images, the paper gives a practical feature points matching algorithm--the image registration algorithm based on the scale-invariant features transform (Scale Invariant Feature Transform, SIFT). The algorithm makes use of the image features of translation, rotation and affine transformation invariance in scale space to extract the image feature points. Bidirectional matching algorithm is chosen to establish the matching relations between the images, so the accuracy of image registrations is improved. On this basis, affine transform is chosen to complement the non-rigid registration, and normalized mutual information measure and PSO optimization algorithm are also chosen to optimize the registration process. The experimental results show that the method can achieve better registration results than the method based on mutual information.

  4. Wavelet-based embedded zerotree extension to color coding

    Science.gov (United States)

    Franques, Victoria T.

    1998-03-01

    Recently, a new image compression algorithm was developed which employs wavelet transform and a simple binary linear quantization scheme with an embedded coding technique to perform data compaction. This new family of coder, Embedded Zerotree Wavelet (EZW), provides a better compression performance than the current JPEG coding standard for low bit rates. Since EZW coding algorithm emerged, all of the published coding results related to this coding technique are on monochrome images. In this paper the author has enhanced the original coding algorithm to yield a better compression ratio, and has extended the wavelet-based zerotree coding to color images. Color imagery is often represented by several components, such as RGB, in which each component is generally processed separately. With color coding, each component could be compressed individually in the same manner as a monochrome image, therefore requiring a threefold increase in processing time. Most image coding standards employ de-correlated components, such as YIQ or Y, CB, CR and subsampling of the 'chroma' components, such coding technique is employed here. Results of the coding, including reconstructed images and coding performance, will be presented.

  5. A wavelet-based method for multispectral face recognition

    Science.gov (United States)

    Zheng, Yufeng; Zhang, Chaoyang; Zhou, Zhaoxian

    2012-06-01

    A wavelet-based method is proposed for multispectral face recognition in this paper. Gabor wavelet transform is a common tool for orientation analysis of a 2D image; whereas Hamming distance is an efficient distance measurement for face identification. Specifically, at each frequency band, an index number representing the strongest orientational response is selected, and then encoded in binary format to favor the Hamming distance calculation. Multiband orientation bit codes are then organized into a face pattern byte (FPB) by using order statistics. With the FPB, Hamming distances are calculated and compared to achieve face identification. The FPB algorithm was initially created using thermal images, while the EBGM method was originated with visible images. When two or more spectral images from the same subject are available, the identification accuracy and reliability can be enhanced using score fusion. We compare the identification performance of applying five recognition algorithms to the three-band (visible, near infrared, thermal) face images, and explore the fusion performance of combing the multiple scores from three recognition algorithms and from three-band face images, respectively. The experimental results show that the FPB is the best recognition algorithm, the HMM yields the best fusion result, and the thermal dataset results in the best fusion performance compared to other two datasets.

  6. Algorithm for image registration and clutter and jitter noise reduction

    Energy Technology Data Exchange (ETDEWEB)

    Brower, K.L.

    1997-02-01

    This paper presents an analytical, computational method whereby two-dimensional images of an optical source represented in terms of a set of detector array signals can be registered with respect to a reference set of detector array signals. The detector image is recovered from the detector array signals and represented over a local region by a fourth order, two-dimensional taylor series. This local detector image can then be registered by a general linear transformation with respect to a reference detector image. The detector signal in the reference frame is reconstructed by integrating this detector image over the respective reference pixel. For cases in which the general linear transformation is uncertain by up to plus-or-minus two pixels, the general linear transformation can be determined by least squares fitting the detector image to the reference detector image. This registration process reduces clutter and jitter noise to a level comparable to the electronic noise level of the detector system. Test results with and without electronic noise using an analytical test function are presented.

  7. An extension of digital volume correlation for multimodality image registration

    Science.gov (United States)

    Tudisco, E.; Jailin, C.; Mendoza, A.; Tengattini, A.; Andò, E.; Hall, Stephen A.; Viggiani, Gioacchino; Hild, F.; Roux, S.

    2017-09-01

    The question of registering two images (or image volumes) acquired with different modalities, and thus exhibiting different contrast, at different positions is addressed based on an extension of global digital image (or volume) correlation. A specific comparison metric is introduced allowing the signature of the different phases to be related. A first solution consists of a Gaussian mixture to describe the joint distribution of gray levels, which not only provides a matching of both images, but also offers a natural segmentation indicator. A second ‘self-adapting’ solution does not include any postulated a priori model for the joint histogram and leads to a registration of the images based on their initial histograms. The algorithm is implemented with a pyramidal multiscale framework for the sake of robustness. The proposed multiscale technique is tested on two 3D images obtained from x-ray and neutron tomography respectively. The proposed approach brings the two images to coincidence with a sub-pixel accuracy and allows for a ‘natural’ segmentation of the different phases.

  8. Multi-atlas segmentation with particle-based group-wise image registration.

    Science.gov (United States)

    Lee, Joohwi; Lyu, Ilwoo; Styner, Martin

    2014-03-21

    We propose a novel multi-atlas segmentation method that employs a group-wise image registration method for the brain segmentation on rodent magnetic resonance (MR) images. The core element of the proposed segmentation is the use of a particle-guided image registration method that extends the concept of particle correspondence into the volumetric image domain. The registration method performs a group-wise image registration that simultaneously registers a set of images toward the space defined by the average of particles. The particle-guided image registration method is robust with low signal-to-noise ratio images as well as differing sizes and shapes observed in the developing rodent brain. Also, the use of an implicit common reference frame can prevent potential bias induced by the use of a single template in the segmentation process. We show that the use of a particle guided-image registration method can be naturally extended to a novel multi-atlas segmentation method and improves the registration method to explicitly use the provided template labels as an additional constraint. In the experiment, we show that our segmentation algorithm provides more accuracy with multi-atlas label fusion and stability against pair-wise image registration. The comparison with previous group-wise registration method is provided as well.

  9. A novel point cloud registration using 2D image features

    Science.gov (United States)

    Lin, Chien-Chou; Tai, Yen-Chou; Lee, Jhong-Jin; Chen, Yong-Sheng

    2017-01-01

    Since a 3D scanner only captures a scene of a 3D object at a time, a 3D registration for multi-scene is the key issue of 3D modeling. This paper presents a novel and an efficient 3D registration method based on 2D local feature matching. The proposed method transforms the point clouds into 2D bearing angle images and then uses the 2D feature based matching method, SURF, to find matching pixel pairs between two images. The corresponding points of 3D point clouds can be obtained by those pixel pairs. Since the corresponding pairs are sorted by their distance between matching features, only the top half of the corresponding pairs are used to find the optimal rotation matrix by the least squares approximation. In this paper, the optimal rotation matrix is derived by orthogonal Procrustes method (SVD-based approach). Therefore, the 3D model of an object can be reconstructed by aligning those point clouds with the optimal transformation matrix. Experimental results show that the accuracy of the proposed method is close to the ICP, but the computation cost is reduced significantly. The performance is six times faster than the generalized-ICP algorithm. Furthermore, while the ICP requires high alignment similarity of two scenes, the proposed method is robust to a larger difference of viewing angle.

  10. Non-rigid registration of medical images based on ordinal feature and manifold learning

    Science.gov (United States)

    Li, Qi; Liu, Jin; Zang, Bo

    2015-12-01

    With the rapid development of medical imaging technology, medical image research and application has become a research hotspot. This paper offers a solution to non-rigid registration of medical images based on ordinal feature (OF) and manifold learning. The structural features of medical images are extracted by combining ordinal features with local linear embedding (LLE) to improve the precision and speed of the registration algorithm. A physical model based on manifold learning and optimization search is constructed according to the complicated characteristics of non-rigid registration. The experimental results demonstrate the robustness and applicability of the proposed registration scheme.

  11. Constrained branch-and-bound algorithm for image registration

    Institute of Scientific and Technical Information of China (English)

    JIN Jian-qiu; WANG Zhang-ye; PENG Qun-sheng

    2005-01-01

    In this paper, the authors propose a refined Branch-and-Bound algorithm for affine-transformation based image registration. Given two feature point-sets in two images respectively, the authors first extract a sequence of high-probability matched point-pairs by considering well-defined features. Each resultant point-pair can be regarded as a constraint in the search space of Branch-and-Bound algorithm guiding the search process. The authors carry out Branch-and-Bound search with the constraint of a pair-point selected by using Monte Carlo sampling according to the match measures of point-pairs. If such one cannot lead to correct result, additional candidate is chosen to start another search. High-probability matched point-pairs usually results in fewer loops and the search process is accelerated greatly. Experimental results verify the high efficiency and robustness of the author's approach.

  12. Image Registration and Optimization in the Virtual Slaughterhouse

    DEFF Research Database (Denmark)

    Vester-Christensen, Martin

    This thesis presents the development and application of algorithms for the analysis of pig carcasses. Focus is on the simulation and quality estimation of meat products produced in a Danish slaughterhouse. Computed Tomography scans of pig carcasses provide the data used in the application. Image...... analysis is applied in order to imitate some of the cutting processes found in a slaughterhouse but also to give a quantitative measure of the composition of each carcass. The basis of the algorithms is non-linear image registration. This method finds the anatomical correspondence between a reference...... carcass and a template carcass. By iteratively comparing the transformed template with the reference a resulting dense deformation field is found. Propagating a set of landmarks from the reference coordinate system onto the template enables the simulation of slaughtering processes. Non...

  13. Deformable image registration for multimodal lung-cancer staging

    Science.gov (United States)

    Cheirsilp, Ronnarit; Zang, Xiaonan; Bascom, Rebecca; Allen, Thomas W.; Mahraj, Rickhesvar P. M.; Higgins, William E.

    2016-03-01

    Positron emission tomography (PET) and X-ray computed tomography (CT) serve as major diagnostic imaging modalities in the lung-cancer staging process. Modern scanners provide co-registered whole-body PET/CT studies, collected while the patient breathes freely, and high-resolution chest CT scans, collected under a brief patient breath hold. Unfortunately, no method exists for registering a PET/CT study into the space of a high-resolution chest CT scan. If this could be done, vital diagnostic information offered by the PET/CT study could be brought seamlessly into the procedure plan used during live cancer-staging bronchoscopy. We propose a method for the deformable registration of whole-body PET/CT data into the space of a high-resolution chest CT study. We then demonstrate its potential for procedure planning and subsequent use in multimodal image-guided bronchoscopy.

  14. Polyaffine parametrization of image registration based on geodesic flows

    DEFF Research Database (Denmark)

    Hansen, Michael Sass; Thorup, Signe Strann; Warfield, Simon K.

    2012-01-01

    Image registration based on geodesic flows has gained much popularity in recent years. We describe a novel parametrization of the velocity field in a stationary flow equation. We show that the method offers both precision, flexibility, and simplicity of evaluation. With our representation, which...... of geodesic shooting for computational anatomy. We avoid to do warp field convolution by interpolation in a dense field, we can easily calculate warp derivatives in a reference frame of choice, and we can consequently avoid interpolation in the image space altogether....... is very similar to existing methods, we show that we can find an analytical solution. This solution converges exponentially to the true solution, and the gradients may be determined similarly. We compare to existing prominent methods; the log-euclidean polyaffine framework, and the DARTEL implementation...

  15. 3D Elastic Registration of Ultrasound Images Based on Skeleton Feature

    Institute of Scientific and Technical Information of China (English)

    LI Dan-dan; LIU Zhi-Yan; SHEN Yi

    2005-01-01

    In order to eliminate displacement and elastic deformation between images of adjacent frames in course of 3D ultrasonic image reconstruction, elastic registration based on skeleton feature was adopt in this paper. A new automatically skeleton tracking extract algorithm is presented, which can extract connected skeleton to express figure feature. Feature points of connected skeleton are extracted automatically by accounting topical curvature extreme points several times. Initial registration is processed according to barycenter of skeleton. Whereafter, elastic registration based on radial basis function are processed according to feature points of skeleton. Result of example demonstrate that according to traditional rigid registration, elastic registration based on skeleton feature retain natural difference in shape for organ's different part, and eliminate slight elastic deformation between frames caused by image obtained process simultaneously. This algorithm has a high practical value for image registration in course of 3D ultrasound image reconstruction.

  16. Automatic Image Registration Using Free and Open Source Software

    Science.gov (United States)

    Giri Babu, D.; Raja Shekhar, S. S.; Chandrasekar, K.; Sesha Sai, M. V. R.; Diwakar, P. G.; Dadhwal, V. K.

    2014-11-01

    Image registration is the most critical operation in remote sensing applications to enable location based referencing and analysis of earth features. This is the first step for any process involving identification, time series analysis or change detection using a large set of imagery over a region. Most of the reliable procedures involve time consuming and laborious manual methods of finding the corresponding matching features of the input image with respect to reference. Also the process, as it involves human interaction, does not converge with multiple operations at different times. Automated procedures rely on accurately determining the matching locations or points from both the images under comparison and the procedures are robust and consistent over time. Different algorithms are available to achieve this, based on pattern recognition, feature based detection, similarity techniques etc. In the present study and implementation, Correlation based methods have been used with a improvement over newly developed technique of identifying and pruning the false points of match. Free and Open Source Software (FOSS) have been used to develop the methodology to reach a wider audience, without any dependency on COTS (Commercially off the shelf) software. Standard deviation from foci of the ellipse of correlated points, is a statistical means of ensuring the best match of the points of interest based on both intensity values and location correspondence. The methodology is developed and standardised by enhancements to meet the registration requirements of remote sensing imagery. Results have shown a performance improvement, nearly matching the visual techniques and have been implemented in remote sensing operational projects. The main advantage of the proposed methodology is its viability in production mode environment. This paper also shows that the visualization capabilities of MapWinGIS, GDAL's image handling abilities and OSSIM's correlation facility can be efficiently

  17. Registration of Airborne Infrared Images using Platform Attitude Information

    Directory of Open Access Journals (Sweden)

    Ravi Shankar Chekuri

    2014-03-01

    Full Text Available In current warfare scenario stealth and passive threat detection capabilities are considered as prime requirements to accomplish desired mission by the fighter aircrafts. To improve the stealth of an aircraft, the trend is towards detecting threats with the help of passive sensors (Electro Optic or Infrared. Current situation caters for systems like Infra-red Search and Track (IRST and Passive Missile Warning Systems (PMWS. IRST system is a passive target detection system, used for detecting aerial & ground targets. PMWS is a threat detection system used for detecting missiles approaching towards aircraft. Both of these systems detect targets of interest by processing IR images acquired in mid-IR region. The prime challenge in IRST system or PMWS is detecting a moving target of size typically 1~2 pixels in acquired image sequences. The temporal change caused by moving target in consecutive frames can be considered as one important factor to detect them. The temporal change caused by moving target is identified through absolute frame differencing of successive frames. This principle has limitation in application to IRST & PMWS as the imaging sensor with the aircraft is moving. This motion also imparts temporal change in the acquired images. In this paper authors are proposing a method for removing the temporal change caused by the platform motion in two consequently acquired frames using registration process.  The proposed method uses the platform attitude information at frame sampling times. Authors have analyzed the sensitivity of registration process to noisy platform attitude information.Defence Science Journal, 2014, 64(2, pp. 130-135. DOI: http://dx.doi.org/10.14429/dsj.64.5460

  18. Moving object detection by using GPS assisted image registration method

    Directory of Open Access Journals (Sweden)

    Barış Gökçe

    2016-10-01

    Full Text Available In this study, a Global Positioning System (GPS assistance based system has been developed for unmanned ground vehicles (UGV to detect moving objects along their route using a computer vision system. Before the real time application of the UGV, image models were created that represents a default background in specified horizontal positions of the specified coordinates on the route. This model is a type of feature matrix which is much smaller than the pure image matrices. The model matrices were recorded in the system database and a database relation was created between the model and its coordinate. The feature matrices of the images captured when the moment UGV arrived to the determined coordinates are compared with the models belong to present coordinate. As a result of the evaluation image frames are aligned with 2D image registration methods. The silhouettes of the objects are obtained by subtracting aligned frames. Thus, using this developed approach, there is no need for costly solutions to compensate for the noise generated by the moving camera. It was observed from the experiments that the system was able to detect the objects with 90% accuracy and it was able to run with 8% CPU loading and 0.057 s processing time per frame.

  19. Use of Wavelet-Fuzzy Features with PCA for Image Registration

    Directory of Open Access Journals (Sweden)

    Safia Sadruddin

    2014-01-01

    Full Text Available In this paper, we discuss an Image Registration system based on neural network, which uses Wavelet-fuzzy features of an image. In this system, Wavelet-fuzzy features are extracted from an image and then reduced using Principal Component Analysis (PCA. The reduced feature set is then used for training the neural network for image registration. The geometric transformation between the reference and sensed image sets are evaluated using affine transformation parameters. The trained neural network produces registration parameters (translation, rotation and scaling with respect to reference and sensed image. Two parameters namely Mean Absolute Registration Error and Mutual Information are used as evaluation parameters. Experimentally, we show that the proposed technique for image registration is accurate and robust for distorted and noisy inputs.

  20. Manifold-based feature point matching for multi-modal image registration.

    Science.gov (United States)

    Hu, Liang; Wang, Manning; Song, Zhijian

    2013-03-01

    Images captured using different modalities usually have significant variations in their intensities, which makes it difficult to reveal their internal structural similarities and achieve accurate registration. Most conventional feature-based image registration techniques are fast and efficient, but they cannot be used directly for the registration of multi-modal images because of these intensity variations. This paper introduces the theory of manifold learning to transform the original images into mono-modal modalities, which is a feature-based method that is applicable to multi-modal image registration. Subsequently, scale-invariant feature transform is used to detect highly distinctive local descriptors and matches between corresponding images, and a point-based registration is executed. The algorithm was tested with T1- and T2-weighted magnetic resonance (MR) images obtained from BrainWeb. Both qualitative and quantitative evaluations of the method were performed and the results compared with those produced previously. The experiments showed that feature point matching after manifold learning achieved more accurate results than did the similarity measure for multi-modal image registration. This study provides a new manifold-based feature point matching method for multi-modal medical image registration, especially for MR images. The proposed method performs better than do conventional intensity-based techniques in terms of its registration accuracy and is suitable for clinical procedures. Copyright © 2012 John Wiley & Sons, Ltd.

  1. An automated deformable image registration evaluation of confidence tool

    Science.gov (United States)

    Kirby, Neil; Chen, Josephine; Kim, Hojin; Morin, Olivier; Nie, Ke; Pouliot, Jean

    2016-04-01

    Deformable image registration (DIR) is a powerful tool for radiation oncology, but it can produce errors. Beyond this, DIR accuracy is not a fixed quantity and varies on a case-by-case basis. The purpose of this study is to explore the possibility of an automated program to create a patient- and voxel-specific evaluation of DIR accuracy. AUTODIRECT is a software tool that was developed to perform this evaluation for the application of a clinical DIR algorithm to a set of patient images. In brief, AUTODIRECT uses algorithms to generate deformations and applies them to these images (along with processing) to generate sets of test images, with known deformations that are similar to the actual ones and with realistic noise properties. The clinical DIR algorithm is applied to these test image sets (currently 4). From these tests, AUTODIRECT generates spatial and dose uncertainty estimates for each image voxel based on a Student’s t distribution. In this study, four commercially available DIR algorithms were used to deform a dose distribution associated with a virtual pelvic phantom image set, and AUTODIRECT was used to generate dose uncertainty estimates for each deformation. The virtual phantom image set has a known ground-truth deformation, so the true dose-warping errors of the DIR algorithms were also known. AUTODIRECT predicted error patterns that closely matched the actual error spatial distribution. On average AUTODIRECT overestimated the magnitude of the dose errors, but tuning the AUTODIRECT algorithms should improve agreement. This proof-of-principle test demonstrates the potential for the AUTODIRECT algorithm as an empirical method to predict DIR errors.

  2. Biomechanical deformable image registration of longitudinal lung CT images using vessel information

    Science.gov (United States)

    Cazoulat, Guillaume; Owen, Dawn; Matuszak, Martha M.; Balter, James M.; Brock, Kristy K.

    2016-07-01

    Spatial correlation of lung tissue across longitudinal images, as the patient responds to treatment, is a critical step in adaptive radiotherapy. The goal of this work is to expand a biomechanical model-based deformable registration algorithm (Morfeus) to achieve accurate registration in the presence of significant anatomical changes. Six lung cancer patients previously treated with conventionally fractionated radiotherapy were retrospectively evaluated. Exhale CT scans were obtained at treatment planning and following three weeks of treatment. For each patient, the planning CT was registered to the follow-up CT using Morfeus, a biomechanical model-based deformable registration algorithm. To model the complex response of the lung, an extension to Morfeus has been developed: an initial deformation was estimated with Morfeus consisting of boundary conditions on the chest wall and incorporating a sliding interface with the lungs. It was hypothesized that the addition of boundary conditions based on vessel tree matching would provide a robust reduction of the residual registration error. To achieve this, the vessel trees were segmented on the two images by thresholding a vesselness image based on the Hessian matrix’s eigenvalues. For each point on the reference vessel tree centerline, the displacement vector was estimated by applying a variant of the Demons registration algorithm between the planning CT and the deformed follow-up CT. An expert independently identified corresponding landmarks well distributed in the lung to compute target registration errors (TRE). The TRE was: 5.8+/- 2.9 , 3.4+/- 2.3 and 1.6+/- 1.3 mm after rigid registration, Morfeus and Morfeus with boundary conditions on the vessel tree, respectively. In conclusion, the addition of boundary conditions on the vessels significantly improved the accuracy in modeling the response of the lung and tumor over the course of radiotherapy. Minimizing and modeling these geometrical uncertainties will enable

  3. Configurable automatic detection and registration of fiducial frames for device-to-image registration in MRI-guided prostate interventions.

    Science.gov (United States)

    Tokuda, Junichi; Song, Sang-Eun; Tuncali, Kemal; Tempany, Clare; Hata, Nobuhiko

    2013-01-01

    We propose a novel automatic fiducial frame detection and registration method for device-to-image registration in MRI-guided prostate interventions. The proposed method does not require any manual selection of markers, and can be applied to a variety of fiducial frames, which consist of multiple cylindrical MR-visible markers placed in different orientations. The key idea is that automatic extraction of linear features using a line filter is more robust than that of bright spots by thresholding; by applying a line set registration algorithm to the detected markers, the frame can be registered to the MRI. The method was capable of registering the fiducial frame to the MRI with an accuracy of 1.00 +/- 0.73 mm and 1.41 +/- 1.06 degrees in a phantom study, and was sufficiently robust to detect the fiducial frame in 98% of images acquired in clinical cases despite the existence of anatomical structures in the field of view.

  4. [A method for the medical image registration based on the statistics samples averaging distribution theory].

    Science.gov (United States)

    Xu, Peng; Yao, Dezhong; Luo, Fen

    2005-08-01

    The registration method based on mutual information is currently a popular technique for the medical image registration, but the computation for the mutual information is complex and the registration speed is slow. In engineering process, a subsampling technique is taken to accelerate the registration speed at the cost of registration accuracy. In this paper a new method based on statistics sample theory is developed, which has both a higher speed and a higher accuracy as compared with the normal subsampling method, and the simulation results confirm the validity of the new method.

  5. A multi-scale registration of urban aerial image with airborne lidar data

    Science.gov (United States)

    Huang, Shuo; Chen, Siying; Zhang, Yinchao; Guo, Pan; Chen, He

    2015-11-01

    This paper presented a multi-scale progressive registration method of airborne LiDAR data with aerial image. The cores of the proposed method lie in the coarse registration with road networks and the fine registration method using regularized building corners. During the two-stage registration, the exterior orientation parameters (EOP) are continually refined. By validation of the actual flight data of Dunhuang, the experimental result shows that the proposed method can obtain accurate results with low-precision initial EOP, also improve the automatic degree of registration.

  6. Two new approaches for image registration based on spatial-temporal relationship

    Institute of Scientific and Technical Information of China (English)

    Deng Zhipeng; Yang Jie; Liu Xiaojun

    2005-01-01

    How to improve the probability of registration and precision of localization is a hard problem, which is desiderated to solve. The two basic approaches (normalized cross-correlation and phase correlation) for image registration are analysed, two improved approaches based on spatial-temporal relationship are presented. This method adds the correlation matrix according to the displacements in x- cirection and y- directions, and the registration pose is searched in the added matrix. The method overcomes the shortcoming that the probability of registration decreasing with area increasing owing to geometric distortion, improves the probability and the robustness of registration.

  7. An Automated Parallel Image Registration Technique Based on the Correlation of Wavelet Features

    Science.gov (United States)

    LeMoigne, Jacqueline; Campbell, William J.; Cromp, Robert F.; Zukor, Dorothy (Technical Monitor)

    2001-01-01

    With the increasing importance of multiple platform/multiple remote sensing missions, fast and automatic integration of digital data from disparate sources has become critical to the success of these endeavors. Our work utilizes maxima of wavelet coefficients to form the basic features of a correlation-based automatic registration algorithm. Our wavelet-based registration algorithm is tested successfully with data from the National Oceanic and Atmospheric Administration (NOAA) Advanced Very High Resolution Radiometer (AVHRR) and the Landsat/Thematic Mapper(TM), which differ by translation and/or rotation. By the choice of high-frequency wavelet features, this method is similar to an edge-based correlation method, but by exploiting the multi-resolution nature of a wavelet decomposition, our method achieves higher computational speeds for comparable accuracies. This algorithm has been implemented on a Single Instruction Multiple Data (SIMD) massively parallel computer, the MasPar MP-2, as well as on the CrayT3D, the Cray T3E and a Beowulf cluster of Pentium workstations.

  8. Rotation and translation registration of bandlimited interferometric images using a chirp z-transform

    Science.gov (United States)

    Iacchetta, Alexander S.; Fienup, James R.; Leisawitz, David T.

    2016-07-01

    Image reconstruction algorithms for wide-field spatio-spectral interferometry require knowledge of registration parameters associated with low-resolution image measurements at various baseline orientations, such that the images can be registered to within the fine resolution of the final desired image. We have developed an image registration procedure that combines a nonlinear optimization algorithm with the sub-pixel precision of chirp z-transform resampling, particularly for rotation and translation, of bandlimited images with non-radially symmetric aberrations. We show the accuracy of this image registration technique on simulated images that have a complexity comparable to scenes observed experimentally with NASA's wide-field imaging interferometry testbed. Registration to within a tenth of a pixel for translation and within three arcminutes for rotation is demonstrated at the largest simulated noise levels.

  9. Joint Change Detection and Image Registration for Optical Remote Sensing Images

    Directory of Open Access Journals (Sweden)

    Wang Luo

    2012-03-01

    Full Text Available In this letter, a novel method is proposed for jointly unsupervised change detection and image registration over multi-temporal optical remote sensing images. An iterative energy minimization scheme is employed to extract the pixel opacity. Specifically, we extract the consistent points which provide the initial seed nodes and the feature nodes for random walker image segmentation and image registration, respectively. And the seed nodes will be updated according to the analysis of the changed and unchanged regions. Experimental results demonstrate that the proposed method can perform change detection as well as the state of the art methods. In particular, it can perform change detection rapidly and automatically over unregistered optical remote sensing images.

  10. A fully automatic image-to-world registration method for image-guided procedure with intraoperative imaging updates

    Science.gov (United States)

    Li, Senhu; Sarment, David

    2016-03-01

    Image-guided procedure with intraoperative imaging updates has made a big impact on minimally invasive surgery. Compact and mobile CT imaging device combining with current commercial available image guided navigation system is a legitimate and cost-efficient solution for a typical operating room setup. However, the process of manual fiducial-based registration between image and physical spaces (image-to-world) is troublesome for surgeons during the procedure, which results in much procedure interruptions and is the main source of registration errors. In this study, we developed a novel method to eliminate the manual registration process. Instead of using probe to manually localize the fiducials during the surgery, a tracking plate with known fiducial positions relative to the reference coordinates is designed and fabricated through 3D printing technique. The workflow and feasibility of this method has been studied through a phantom experiment.

  11. 3D-2D registration of cerebral angiograms: a method and evaluation on clinical images.

    Science.gov (United States)

    Mitrovic, Uroš; Špiclin, Žiga; Likar, Boštjan; Pernuš, Franjo

    2013-08-01

    Endovascular image-guided interventions (EIGI) involve navigation of a catheter through the vasculature followed by application of treatment at the site of anomaly using live 2D projection images for guidance. 3D images acquired prior to EIGI are used to quantify the vascular anomaly and plan the intervention. If fused with the information of live 2D images they can also facilitate navigation and treatment. For this purpose 3D-2D image registration is required. Although several 3D-2D registration methods for EIGI achieve registration accuracy below 1 mm, their clinical application is still limited by insufficient robustness or reliability. In this paper, we propose a 3D-2D registration method based on matching a 3D vasculature model to intensity gradients of live 2D images. To objectively validate 3D-2D registration methods, we acquired a clinical image database of 10 patients undergoing cerebral EIGI and established "gold standard" registrations by aligning fiducial markers in 3D and 2D images. The proposed method had mean registration accuracy below 0.65 mm, which was comparable to tested state-of-the-art methods, and execution time below 1 s. With the highest rate of successful registrations and the highest capture range the proposed method was the most robust and thus a good candidate for application in EIGI.

  12. Non-rigid registration of medical images based on estimation of deformation states

    Science.gov (United States)

    Marami, Bahram; Sirouspour, Shahin; Capson, David W.

    2014-11-01

    A unified framework for automatic non-rigid 3D-3D and 3D-2D registration of medical images with static and dynamic deformations is proposed in this paper. The problem of non-rigid image registration is approached as a classical state estimation problem using a generic deformation model for the soft tissue. The registration technique employs a dynamic linear elastic continuum mechanics model of the tissue deformation, which is discretized using the finite element method. In the proposed method, the registration is achieved through a Kalman-like filtering process, which incorporates information from the deformation model and a vector of observation prediction errors computed from an intensity-based similarity/distance metric between images. With this formulation, single and multiple-modality, 3D-3D and 3D-2D image registration problems can all be treated within the same framework. The performance of the proposed registration technique was evaluated in a number of different registration scenarios. First, 3D magnetic resonance (MR) images of uncompressed and compressed breast tissue were co-registered. 3D MR images of the uncompressed breast tissue were also registered to a sequence of simulated 2D interventional MR images of the compressed breast. Finally, the registration algorithm was employed to dynamically track a target sub-volume inside the breast tissue during the process of the biopsy needle insertion based on registering pre-insertion 3D MR images to a sequence of real-time simulated 2D interventional MR images. Registration results indicate that the proposed method can be effectively employed for the registration of medical images in image-guided procedures, such as breast biopsy in which the tissue undergoes static and dynamic deformations.

  13. Knee osteoarthritis image registration: data from the Osteoarthritis Initiative

    Science.gov (United States)

    Galván-Tejada, Jorge I.; Celaya-Padilla, José M.; Treviño, Victor; Tamez-Peña, José G.

    2015-03-01

    Knee osteoarthritis is a very common disease, in early stages, changes in joint structures are shown, some of the most common symptoms are; formation of osteophytes, cartilage degradation and joint space reduction, among others. Based on a joint space reduction measurement, Kellgren-Lawrence grading scale, is a very extensive used tool to asses radiological OA knee x-ray images, based on information obtained from these assessments, the objective of this work is to correlate the Kellgren-Lawrence score to the bilateral asymmetry between knees. Using public data from the Osteoarthritis initiative (OAI), a set of images with different Kellgren-Lawrencescores were used to determine a relationship of Kellgren-Lawrence score and the bilateral asymmetry, in order to measure the asymmetry between the knees, the right knee was registered to match the left knee, then a series of similarity metrics, mutual information, correlation, and mean squared error where computed to correlate the deformation (mismatch) of the knees to the Kellgren-Lawrence score. Radiological information was evaluated and scored by OAI radiologist groups. The results of the study suggest an association between Radiological Kellgren-Lawrence score and image registration metrics, mutual information and correlation is higher in the early stages, and mean squared error is higher in advanced stages. This association can be helpful to develop a computer aided grading tool.

  14. Hierarchical Multi-modal Image Registration by Learning Common Feature Representations.

    Science.gov (United States)

    Ge, Hongkun; Wu, Guorong; Wang, Li; Gao, Yaozong; Shen, Dinggang

    2015-10-05

    Mutual information (MI) has been widely used for registering images with different modalities. Since most inter-modality registration methods simply estimate deformations in a local scale, but optimizing MI from the entire image, the estimated deformations for certain structures could be dominated by the surrounding unrelated structures. Also, since there often exist multiple structures in each image, the intensity correlation between two images could be complex and highly nonlinear, which makes global MI unable to precisely guide local image deformation. To solve these issues, we propose a hierarchical inter-modality registration method by robust feature matching. Specifically, we first select a small set of key points at salient image locations to drive the entire image registration. Since the original image features computed from different modalities are often difficult for direct comparison, we propose to learn their common feature representations by projecting them from their native feature spaces to a common space, where the correlations between corresponding features are maximized. Due to the large heterogeneity between two high-dimension feature distributions, we employ Kernel CCA (Canonical Correlation Analysis) to reveal such non-linear feature mappings. Then, our registration method can take advantage of the learned common features to reliably establish correspondences for key points from different modality images by robust feature matching. As more and more key points take part in the registration, our hierarchical feature-based image registration method can efficiently estimate the deformation pathway between two inter-modality images in a global to local manner. We have applied our proposed registration method to prostate CT and MR images, as well as the infant MR brain images in the first year of life. Experimental results show that our method can achieve more accurate registration results, compared to other state-of-the-art image registration

  15. Evaluation of 3 different registration techniques in image-guided bimaxillary surgery.

    Science.gov (United States)

    Sun, Yi; Luebbers, Heinz-Theo; Agbaje, Jimoh Olubanwo; Schepers, Serge; Vrielinck, Luc; Lambrichts, Ivo; Politis, Constantinus

    2013-07-01

    Perioperative navigation is an upcoming tool in orthognathic surgery. This study aimed to access the feasibility of the technique and to evaluate the success rate of 3 different registration methods--facial surface registration, anatomic landmark-based registration, and template-based registration. The BrainLab navigation system (BrainLab AG, Feldkirchen, Germany) was used as an additional precision tool for 85 patients who underwent bimaxillary orthognathic surgery from February 2010 to June 2012. Eighteen cases of facial surface-based registration, 63 cases of anatomic landmark-based registration, and 8 cases of template-based registration were analyzed. The overall success rate of facial surface-based registration was 39%, which was significant lower than template-based (100%, P = 0.013) and anatomic landmark-based registration (95%, P bimaxillary orthognathic surgery has been proved to be feasible. The registration process is the critical point regarding success of intraoperative navigation. Anatomic landmark-based registration is a reliable technique for image-guided bimaxillary surgery. In contrast, facial surface-based registration is highly unreliable.

  16. Echocardiography to magnetic resonance image registration for use in image-guided cardiac catheterization procedures

    Energy Technology Data Exchange (ETDEWEB)

    Ma Yingliang; Penney, Graeme P; Razavi, Reza; Rhode, Kawal S [Division of Imaging Sciences, King' s College, London SE1 7EH (United Kingdom); Rinaldi, C Aldo; Cooklin, Mike [Department of Cardiology, Guy' s and St Thomas' NHS Foundation Trust, London, SE1 7EH (United Kingdom)], E-mail: y.ma@kcl.ac.uk

    2009-08-21

    We present a robust method to register three-dimensional echocardiography (echo) images to magnetic resonance images (MRI) based on anatomical features, which is designed to be used in the registration pipeline for overlaying MRI-derived roadmaps onto two-dimensional live x-ray images during cardiac catheterization procedures. The features used in image registration are the endocardial surface of the left ventricle and the centre line of the descending aorta. The MR-derived left ventricle surface is generated using a fully automated algorithm, and the echo-derived left ventricle surface is produced using a semi-automatic segmentation method provided by the QLab software (Philips Healthcare) that it is routinely used in clinical practice. We test our method on data from six volunteers and four patients. We validated registration accuracy using two methods: the first calculated a root mean square distance error using expert identified anatomical landmarks, and the second method used catheters as landmarks in two clinical electrophysiology procedures. Results show a mean error of 4.1 mm, which is acceptable for our clinical application, and no failed registrations were observed. In addition, our algorithm works on clinical data, is fast and only requires a small amount of manual input, and so it is applicable for use during cardiac catheterization procedures.

  17. EVolution : an edge-based variational method for non-rigid multi-modal image registration

    NARCIS (Netherlands)

    Denis de Senneville, B; Zachiu, C; Ries, M; Moonen, C

    2016-01-01

    Image registration is part of a large variety of medical applications including diagnosis, monitoring disease progression and/or treatment effectiveness and, more recently, therapy guidance. Such applications usually involve several imaging modalities such as ultrasound, computed tomography,

  18. Evaluation of accuracy of B-spline transformation-based deformable image registration with different parameter settings for thoracic images

    OpenAIRE

    Kanai, Takayuki; Kadoya, Noriyuki; Ito, Kengo; Onozato, Yusuke; Cho, Sang Yong; Kishi, Kazuma; Dobashi, Suguru; Umezawa, Rei; Matsushita, Haruo; Takeda, Ken; Jingu, Keiichi

    2014-01-01

    Deformable image registration (DIR) is fundamental technique for adaptive radiotherapy and image-guided radiotherapy. However, further improvement of DIR is still needed. We evaluated the accuracy of B-spline transformation-based DIR implemented in elastix. This registration package is largely based on the Insight Segmentation and Registration Toolkit (ITK), and several new functions were implemented to achieve high DIR accuracy. The purpose of this study was to clarify whether new functions ...

  19. Automatic masking for robust 3D-2D image registration in image-guided spine surgery

    Science.gov (United States)

    Ketcha, M. D.; De Silva, T.; Uneri, A.; Kleinszig, G.; Vogt, S.; Wolinsky, J.-P.; Siewerdsen, J. H.

    2016-03-01

    During spinal neurosurgery, patient-specific information, planning, and annotation such as vertebral labels can be mapped from preoperative 3D CT to intraoperative 2D radiographs via image-based 3D-2D registration. Such registration has been shown to provide a potentially valuable means of decision support in target localization as well as quality assurance of the surgical product. However, robust registration can be challenged by mismatch in image content between the preoperative CT and intraoperative radiographs, arising, for example, from anatomical deformation or the presence of surgical tools within the radiograph. In this work, we develop and evaluate methods for automatically mitigating the effect of content mismatch by leveraging the surgical planning data to assign greater weight to anatomical regions known to be reliable for registration and vital to the surgical task while removing problematic regions that are highly deformable or often occluded by surgical tools. We investigated two approaches to assigning variable weight (i.e., "masking") to image content and/or the similarity metric: (1) masking the preoperative 3D CT ("volumetric masking"); and (2) masking within the 2D similarity metric calculation ("projection masking"). The accuracy of registration was evaluated in terms of projection distance error (PDE) in 61 cases selected from an IRB-approved clinical study. The best performing of the masking techniques was found to reduce the rate of gross failure (PDE > 20 mm) from 11.48% to 5.57% in this challenging retrospective data set. These approaches provided robustness to content mismatch and eliminated distinct failure modes of registration. Such improvement was gained without additional workflow and has motivated incorporation of the masking methods within a system under development for prospective clinical studies.

  20. Modeling lung motion using consistent image registration in four-dimensional computed tomography for radiation therapy

    Science.gov (United States)

    Lu, Wei; Song, Joo Hyun; Christensen, Gary E.; Parikh, Parag J.; Bradley, Jeffrey D.; Low, Daniel A.

    2006-03-01

    Respiratory motion is a significant source of error in conformal radiation therapy for the thorax and upper abdomen. Four-dimensional computed tomography (4D CT) has been proposed to reduce the uncertainty caused by internal respiratory organ motion. A 4D CT dataset is retrospectively reconstructed at various stages of a respiratory cycle. An important tool for 4D treatment planning is deformable image registration. An inverse consistent image registration is used to model lung motion from one respiratory stage to another during a breathing cycle. This diffeomorphic registration jointly estimates the forward and reverse transformations providing more accurate correspondence between two images. Registration results and modeled motions in the lung are shown for three example respiratory stages. The results demonstrate that the consistent image registration satisfactorily models the large motions in the lung, providing a useful tool for 4D planning and delivering.

  1. 3-D Registration on Carotid Artery imaging data: MRI for different timesteps

    CERN Document Server

    Bizopoulos, Paschalis A; Michalis, Lampros K; Koutsouris, Dimitrios D; Fotiadis, Dimitrios I

    2016-01-01

    A common problem which is faced by the researchers when dealing with arterial carotid imaging data is the registration of the geometrical structures between different imaging modalities or different timesteps. The use of the "Patient Position" DICOM field is not adequate to achieve accurate results due to the fact that the carotid artery is a relatively small structure and even imperceptible changes in patient position and/or direction make it difficult. While there is a wide range of simple/advanced registration techniques in the literature, there is a considerable number of studies which address the geometrical structure of the carotid artery without using any registration technique. On the other hand the existence of various registration techniques prohibits an objective comparison of the results using different registration techniques. In this paper we present a method for estimating the statistical significance that the choice of the registration technique has on the carotid geometry. One-Way Analysis of...

  2. A registration strategy for long spatio-temporal aerial remote sensing image sequence

    Science.gov (United States)

    Cao, Yutian; Yan, Dongmei; Li, Jianming; Wang, Gang

    2015-12-01

    A novel registration strategy for aerial image sequence is put forward to adapt to the long spatio-temporal span of the aerial remote sensing imaging. By setting keyframe, this strategy aligns all images in sequence to a unified datum with high registration sustainability and precision. The contrast experiment on different registration strategies is carried out based on SIFT feature matching of mid-infrared aerial sequences. The experiment results show that the proposed strategy performs well on long spatio-temporal sequences with different imaging resolutions and scenes.

  3. Applications of digital image processing techniques to problems of data registration and correlation

    Science.gov (United States)

    Green, W. B.

    1978-01-01

    An overview is presented of the evolution of the computer configuration at JPL's Image Processing Laboratory (IPL). The development of techniques for the geometric transformation of digital imagery is discussed and consideration is given to automated and semiautomated image registration, and the registration of imaging and nonimaging data. The increasing complexity of image processing tasks at IPL is illustrated with examples of various applications from the planetary program and earth resources activities. It is noted that the registration of existing geocoded data bases with Landsat imagery will continue to be important if the Landsat data is to be of genuine use to the user community.

  4. Hyperspectral Imaging for Cancer Surgical Margin Delineation: Registration of Hyperspectral and Histological Images.

    Science.gov (United States)

    Lu, Guolan; Halig, Luma; Wang, Dongsheng; Chen, Zhuo Georgia; Fei, Baowei

    2014-03-12

    The determination of tumor margins during surgical resection remains a challenging task. A complete removal of malignant tissue and conservation of healthy tissue is important for the preservation of organ function, patient satisfaction, and quality of life. Visual inspection and palpation is not sufficient for discriminating between malignant and normal tissue types. Hyperspectral imaging (HSI) technology has the potential to noninvasively delineate surgical tumor margin and can be used as an intra-operative visual aid tool. Since histological images provide the ground truth of cancer margins, it is necessary to warp the cancer regions in ex vivo histological images back to in vivo hyperspectral images in order to validate the tumor margins detected by HSI and to optimize the imaging parameters. In this paper, principal component analysis (PCA) is utilized to extract the principle component bands of the HSI images, which is then used to register HSI images with the corresponding histological image. Affine registration is chosen to model the global transformation. A B-spline free form deformation (FFD) method is used to model the local non-rigid deformation. Registration experiment was performed on animal hyperspectral and histological images. Experimental results from animals demonstrated the feasibility of the hyperspectral imaging method for cancer margin detection.

  5. Technical Note: Deformable image registration on partially matched images for radiotherapy applications

    Science.gov (United States)

    Yang, Deshan; Goddu, S. Murty; Lu, Wei; Pechenaya, Olga L.; Wu, Yu; Deasy, Joseph O.; El Naqa, Issam; Low, Daniel A.

    2010-01-01

    In radiation therapy applications, deformable image registrations (DIRs) are often carried out between two images that only partially match. Image mismatching could present as superior-inferior coverage differences, field-of-view (FOV) cutoffs, or motion crossing the image boundaries. In this study, the authors propose a method to improve the existing DIR algorithms so that DIR can be carried out in such situations. The basic idea is to extend the image volumes and define the extension voxels (outside the FOV or outside the original image volume) as NaN (not-a-number) values that are transparent to all floating-point computations in the DIR algorithms. Registrations are then carried out with one additional rule that NaN voxels can match any voxels. In this way, the matched sections of the images are registered properly, and the mismatched sections of the images are registered to NaN voxels. This method makes it possible to perform DIR on partially matched images that otherwise are difficult to register. It may also improve DIR accuracy, especially near or in the mismatched image regions. PMID:20175475

  6. Technical Note: Deformable image registration on partially matched images for radiotherapy applications

    Energy Technology Data Exchange (ETDEWEB)

    Yang Deshan; Goddu, S. Murty; Lu Wei; Pechenaya, Olga L.; Wu Yu; Deasy, Joseph O.; El Naqa, Issam; Low, Daniel A. [Department of Radiation Oncology, Washington University in Saint Louis, Missouri 63110 (United States)

    2010-01-15

    In radiation therapy applications, deformable image registrations (DIRs) are often carried out between two images that only partially match. Image mismatching could present as superior-inferior coverage differences, field-of-view (FOV) cutoffs, or motion crossing the image boundaries. In this study, the authors propose a method to improve the existing DIR algorithms so that DIR can be carried out in such situations. The basic idea is to extend the image volumes and define the extension voxels (outside the FOV or outside the original image volume) as NaN (not-a-number) values that are transparent to all floating-point computations in the DIR algorithms. Registrations are then carried out with one additional rule that NaN voxels can match any voxels. In this way, the matched sections of the images are registered properly, and the mismatched sections of the images are registered to NaN voxels. This method makes it possible to perform DIR on partially matched images that otherwise are difficult to register. It may also improve DIR accuracy, especially near or in the mismatched image regions.

  7. A prospective comparison between auto-registration and manual registration of real-time ultrasound with MR images for percutaneous ablation or biopsy of hepatic lesions.

    Science.gov (United States)

    Cha, Dong Ik; Lee, Min Woo; Song, Kyoung Doo; Oh, Young-Taek; Jeong, Ja-Yeon; Chang, Jung-Woo; Ryu, Jiwon; Lee, Kyong Joon; Kim, Jaeil; Bang, Won-Chul; Shin, Dong Kuk; Choi, Sung Jin; Koh, Dalkwon; Seo, Bong Koo; Kim, Kyunga

    2017-06-01

    To compare the accuracy and required time for image fusion of real-time ultrasound (US) with pre-procedural magnetic resonance (MR) images between positioning auto-registration and manual registration for percutaneous radiofrequency ablation or biopsy of hepatic lesions. This prospective study was approved by the institutional review board, and all patients gave written informed consent. Twenty-two patients (male/female, n = 18/n = 4; age, 61.0 ± 7.7 years) who were referred for planning US to assess the feasibility of radiofrequency ablation (n = 21) or biopsy (n = 1) for focal hepatic lesions were included. One experienced radiologist performed the two types of image fusion methods in each patient. The performance of auto-registration and manual registration was evaluated. The accuracy of the two methods, based on measuring registration error, and the time required for image fusion for both methods were recorded using in-house software and respectively compared using the Wilcoxon signed rank test. Image fusion was successful in all patients. The registration error was not significantly different between the two methods (auto-registration: median, 3.75 mm; range, 1.0-15.8 mm vs. manual registration: median, 2.95 mm; range, 1.2-12.5 mm, p = 0.242). The time required for image fusion was significantly shorter with auto-registration than with manual registration (median, 28.5 s; range, 18-47 s, vs. median, 36.5 s; range, 14-105 s, p = 0.026). Positioning auto-registration showed promising results compared with manual registration, with similar accuracy and even shorter registration time.

  8. Deformable image and dose registration evaluation using two commercial programs

    Directory of Open Access Journals (Sweden)

    Rachel Tuohy

    2014-03-01

    Full Text Available Purpose: To evaluate the daily dose delivered to the patients using daily imaging.Methods: Thirty (n = 30 patients that were previously treated in our clinic (10 prostate, 10 SBRT lung and 10 abdomen were used in this study. The patients’ plans were optimized and calculated using the Pinnacle treatment planning system. The daily CBCT scans were retrieved and imported into the Velocity and RayStation software along with the corresponding planning CTs, structure sets and 3D dose distributions. In addition, the critical structures were contoured on each CBCT by the prescribing physician and were included in the evaluation of the daily delivered dose. After registering each CBCT scan to the planning CT using deformable registration, the dose volume histograms (DVH for the organs at risk (OAR and the respective planning target volumes (PTV were calculated in Velocity and Raystation.Results: For the prostate patients, we observed daily volume changes for the bladder, rectum and sigmoid. The DVH analysis for those patients showed variation in the sparing of the critical structures while PTV coverage showed no significant changes. Similar results were observed for patients with abdominal targets. In contrast, in SBRT lung patients, the DVH for the critical structures and the PTV were comparable to those from the initial treatment plan. By using daily CBCT dose reconstruction, we proved PTV coverage for prostate and abdominal targets is adequate. However, there is significant dosimetric change for the OAR. These changes were random with no apparent trending. For lung SBRT patients, the delivered daily dose for both PTV and OAR is comparable to the planned dose with no significant differences.Conclusion: Daily tracking of the delivered dose is feasible. The doses can be evaluated only if the OARs have been segmented taken into account any daily anatomical changes and not by deformation of the structures along.-------------------Cite this article as

  9. A Parallel Nonrigid Registration Algorithm Based on B-Spline for Medical Images

    Directory of Open Access Journals (Sweden)

    Xiaogang Du

    2016-01-01

    Full Text Available The nonrigid registration algorithm based on B-spline Free-Form Deformation (FFD plays a key role and is widely applied in medical image processing due to the good flexibility and robustness. However, it requires a tremendous amount of computing time to obtain more accurate registration results especially for a large amount of medical image data. To address the issue, a parallel nonrigid registration algorithm based on B-spline is proposed in this paper. First, the Logarithm Squared Difference (LSD is considered as the similarity metric in the B-spline registration algorithm to improve registration precision. After that, we create a parallel computing strategy and lookup tables (LUTs to reduce the complexity of the B-spline registration algorithm. As a result, the computing time of three time-consuming steps including B-splines interpolation, LSD computation, and the analytic gradient computation of LSD, is efficiently reduced, for the B-spline registration algorithm employs the Nonlinear Conjugate Gradient (NCG optimization method. Experimental results of registration quality and execution efficiency on the large amount of medical images show that our algorithm achieves a better registration accuracy in terms of the differences between the best deformation fields and ground truth and a speedup of 17 times over the single-threaded CPU implementation due to the powerful parallel computing ability of Graphics Processing Unit (GPU.

  10. MUTUAL INFORMATION BASED 3D NON-RIGID REGISTRATION OF CT/MR ABDOMEN IMAGES

    Institute of Scientific and Technical Information of China (English)

    2001-01-01

    A mutual information based 3D non-rigid registration approach was proposed for the registration of deformable CT/MR body abdomen images. The Parzen Windows Density Estimation (PWDE) method is adopted to calculate the mutual information between the two modals of CT and MRI abdomen images. By maximizing MI between the CT and MR volume images, the overlapping part of them reaches the biggest, which means that the two body images of CT and MR matches best to each other. Visible Human Project (VHP) Male abdomen CT and MRI Data are used as experimental data sets. The experimental results indicate that this approach of non-rigid 3D registration of CT/MR body abdominal images can be achieved effectively and automatically, without any prior processing procedures such as segmentation and feature extraction, but has a main drawback of very long computation time. Key words: medical image registration; multi-modality; mutual information; non-rigid; Parzen window density estimation

  11. Implicit reference-based group-wise image registration and its application to structural and functional MRI.

    Science.gov (United States)

    Geng, Xiujuan; Christensen, Gary E; Gu, Hong; Ross, Thomas J; Yang, Yihong

    2009-10-01

    In this study, an implicit reference group-wise (IRG) registration with a small deformation, linear elastic model was used to jointly estimate correspondences between a set of MRI images. The performance of pair-wise and group-wise registration algorithms was evaluated for spatial normalization of structural and functional MRI data. Traditional spatial normalization is accomplished by group-to-reference (G2R) registration in which a group of images are registered pair-wise to a reference image. G2R registration is limited due to bias associated with selecting a reference image. In contrast, implicit reference group-wise (IRG) registration estimates correspondences between a group of images by jointly registering the images to an implicit reference corresponding to the group average. The implicit reference is estimated during IRG registration eliminating the bias associated with selecting a specific reference image. Registration performance was evaluated using segmented T1-weighted magnetic resonance images from the Nonrigid Image Registration Evaluation Project (NIREP), DTI and fMRI images. Implicit reference pair-wise (IRP) registration-a special case of IRG registration for two images-is shown to produce better relative overlap than IRG for pair-wise registration using the same small deformation, linear elastic registration model. However, IRP-G2R registration is shown to have significant transitivity error, i.e., significant inconsistencies between correspondences defined by different pair-wise transformations. In contrast, IRG registration produces consistent correspondence between images in a group at the cost of slightly reduced pair-wise RO accuracy compared to IRP-G2R. IRG spatial normalization of the fractional anisotropy (FA) maps of DTI is shown to have smaller FA variance compared with G2R methods using the same elastic registration model. Analyses of fMRI data sets with sensorimotor and visual tasks show that IRG registration, on average, increases the

  12. Rigid registration of CT, MR and cryosection images using a GLCM framework

    OpenAIRE

    Bro-Nielsen, Morten; Grimson, E.; Mosges, R.

    1997-01-01

    The majority of the available rigid registration measures are based on a 2-dimensional histogram of corresponding grey-values in the registered images. This paper shows that these features are similar to a family of texture measures based on grey level co-occurrence matrices (GLCM). Features from the GLCM literature are compared to the current range of measures using images from the visible human data set. The voxel-based rigid registration of cryosection and CT images have not been reported ...

  13. Exploiting image registration for automated resonance assignment in NMR.

    Science.gov (United States)

    Strickland, Madeleine; Stephens, Thomas; Liu, Jian; Tjandra, Nico

    2015-06-01

    Analysis of protein NMR data involves the assignment of resonance peaks in a number of multidimensional data sets. To establish resonance assignment a three-dimensional search is used to match a pair of common variables, such as chemical shifts of the same spin system, in different NMR spectra. We show that by displaying the variables to be compared in two-dimensional plots the process can be simplified. Moreover, by utilizing a fast Fourier transform cross-correlation algorithm, more common to the field of image registration or pattern matching, we can automate this process. Here, we use sequential NMR backbone assignment as an example to show that the combination of correlation plots and segmented pattern matching establishes fast backbone assignment in fifteen proteins of varying sizes. For example, the 265-residue RalBP1 protein was 95.4% correctly assigned in 10 s. The same concept can be applied to any multidimensional NMR data set where analysis comprises the comparison of two variables. This modular and robust approach offers high efficiency with excellent computational scalability and could be easily incorporated into existing assignment software.

  14. Automatic Registration of Terrestrial Laser Scanning Point Clouds using Panoramic Reflectance Images.

    Science.gov (United States)

    Kang, Zhizhong; Li, Jonathan; Zhang, Liqiang; Zhao, Qile; Zlatanova, Sisi

    2009-01-01

    This paper presents a new approach to the automatic registration of terrestrial laser scanning (TLS) point clouds using panoramic reflectance images. The approach follows a two-step procedure that includes both pair-wise registration and global registration. The pair-wise registration consists of image matching (pixel-to-pixel correspondence) and point cloud registration (point-to-point correspondence), as the correspondence between the image and the point cloud (pixel-to-point) is inherent to the reflectance images. False correspondences are removed by a geometric invariance check. The pixel-to-point correspondence and the computation of the rigid transformation parameters (RTPs) are integrated into an iterative process that allows for the pair-wise registration to be optimised. The global registration of all point clouds is obtained by a bundle adjustment using a circular self-closure constraint. Our approach is tested with both indoor and outdoor scenes acquired by a FARO LS 880 laser scanner with an angular resolution of 0.036° and 0.045°, respectively. The results show that the pair-wise and global registration accuracies are of millimetre and centimetre orders, respectively, and that the process is fully automatic and converges quickly.

  15. Stride for Developing a New Image Registration Technique using Mutual Information and Optimization Technique

    Directory of Open Access Journals (Sweden)

    Sumitha

    2014-01-01

    Full Text Available Registration is a fundamental task in image processing used to match two or more pictures taken, for example, at different times, from different sensors, or from different viewpoints. Specific examples of systems where image registration is a significant component include matching a target with a real-time image of a scene for target recognition, monitoring global land usage using satellite images, matching stereo images to recover shape for autonomous navigation, and aligning images from different medical modalities for diagnosis. Methods are classified according to the different aspects of mutual information based registration. The main division is in aspects of the methodology and of the application. The part on methodology describes choices made on facets such as preprocessing of images, grey value interpolation, optimization, adaptations to the mutual information measure and different types of geometrical transformations. The part on applications is a reference of the literature available on different modalities, on interpatient registration and on different anatomical objects This paper overviews the theoretical aspects of an image registration problem. The purpose of this paper is to present a survey of image registration techniques

  16. Feasibility analysis of high resolution tissue image registration using 3-D synthetic data

    Directory of Open Access Journals (Sweden)

    Yachna Sharma

    2011-01-01

    Full Text Available Background: Registration of high-resolution tissue images is a critical step in the 3D analysis of protein expression. Because the distance between images (~4-5μm thickness of a tissue section is nearly the size of the objects of interest (~10-20μm cancer cell nucleus, a given object is often not present in both of two adjacent images. Without consistent correspondence of objects between images, registration becomes a difficult task. This work assesses the feasibility of current registration techniques for such images. Methods: We generated high resolution synthetic 3-D image data sets emulating the constraints in real data. We applied multiple registration methods to the synthetic image data sets and assessed the registration performance of three techniques (i.e., mutual information (MI, kernel density estimate (KDE method [1], and principal component analysis (PCA at various slice thicknesses (with increments of 1μm in order to quantify the limitations of each method. Results: Our analysis shows that PCA, when combined with the KDE method based on nuclei centers, aligns images corresponding to 5μm thick sections with acceptable accuracy. We also note that registration error increases rapidly with increasing distance between images, and that the choice of feature points which are conserved between slices improves performance. Conclusions: We used simulation to help select appropriate features and methods for image registration by estimating best-case-scenario errors for given data constraints in histological images. The results of this study suggest that much of the difficulty of stained tissue registration can be reduced to the problem of accurately identifying feature points, such as the center of nuclei.

  17. Accurate band-to-band registration of AOTF imaging spectrometer using motion detection technology

    Science.gov (United States)

    Zhou, Pengwei; Zhao, Huijie; Jin, Shangzhong; Li, Ningchuan

    2016-05-01

    This paper concerns the problem of platform vibration induced band-to-band misregistration with acousto-optic imaging spectrometer in spaceborne application. Registrating images of different bands formed at different time or different position is difficult, especially for hyperspectral images form acousto-optic tunable filter (AOTF) imaging spectrometer. In this study, a motion detection method is presented using the polychromatic undiffracted beam of AOTF. The factors affecting motion detect accuracy are analyzed theoretically, and calculations show that optical distortion is an easily overlooked factor to achieve accurate band-to-band registration. Hence, a reflective dual-path optical system has been proposed for the first time, with reduction of distortion and chromatic aberration, indicating the potential of higher registration accuracy. Consequently, a spectra restoration experiment using additional motion detect channel is presented for the first time, which shows the accurate spectral image registration capability of this technique.

  18. Parallel Processing and Bio-inspired Computing for Biomedical Image Registration

    Directory of Open Access Journals (Sweden)

    Silviu Ioan Bejinariu

    2014-07-01

    Full Text Available Image Registration (IR is an optimization problem computing optimal parameters of a geometric transform used to overlay one or more source images to a given model by maximizing a similarity measure. In this paper the use of bio-inspired optimization algorithms in image registration is analyzed. Results obtained by means of three different algorithms are compared: Bacterial Foraging Optimization Algorithm (BFOA, Genetic Algorithm (GA and Clonal Selection Algorithm (CSA. Depending on the images type, the registration may be: area based, which is slow but more precise, and features based, which is faster. In this paper a feature based approach based on the Scale Invariant Feature Transform (SIFT is proposed. Finally, results obtained using sequential and parallel implementations on multi-core systems for area based and features based image registration are compared.

  19. Correcting image placement errors using registration control (RegC®) technology in the photomask periphery

    Science.gov (United States)

    Cohen, Avi; Lange, Falk; Ben-Zvi, Guy; Graitzer, Erez; Vladimir, Dmitriev

    2012-11-01

    The ITRS roadmap specifies wafer overlay control as one of the major tasks for the sub 40 nm nodes in addition to CD control and defect control. Wafer overlay is strongly dependent on mask image placement error (registration errors or Reg errors)1. The specifications for registration or mask placement accuracy are significantly tighter in some of the double patterning techniques (DPT). This puts a heavy challenge on mask manufacturers (mask shops) to comply with advanced node registration specifications. The conventional methods of feeding back the systematic registration error to the E-beam writer and re-writing the mask are becoming difficult, expensive and not sufficient for the advanced nodes especially for double pattering technologies. Six production masks were measured on a standard registration metrology tool and the registration errors were calculated and plotted. Specially developed algorithm along with the RegC Wizard (dedicated software) was used to compute a correction lateral strain field that would minimize the registration errors. This strain field was then implemented in the photomask bulk material using an ultra short pulse laser based system. Finally the post process registration error maps were measured and the resulting residual registration error field with and without scale and orthogonal errors removal was calculated. In this paper we present a robust process flow in the mask shop which leads up to 32% registration 3sigma improvement, bringing some out-of-spec masks into spec, utilizing the RegC® process in the photomask periphery while leaving the exposure field optically unaffected.

  20. An information theoretic approach for non-rigid image registration using voxel class probabilities.

    Science.gov (United States)

    D'Agostino, Emiliano; Maes, Frederik; Vandermeulen, Dirk; Suetens, Paul

    2006-06-01

    We propose two information theoretic similarity measures that allow to incorporate tissue class information in non-rigid image registration. The first measure assumes that tissue class probabilities have been assigned to each of the images to be registered by prior segmentation of both of them. One image is then non-rigidly deformed to match the other such that the fuzzy overlap of corresponding voxel object labels becomes similar to the ideal case whereby the tissue probability maps of both images are identical. Image similarity is assessed during registration by the divergence between the ideal and actual joint class probability distributions of both images. A second registration measure is proposed that applies in case a segmentation is available for only one of the images, for instance an atlas image that is to be matched to a study image to guide the segmentation thereof. Intensities in one image are matched to the fuzzy class labels in the other image by minimizing the conditional entropy of the intensities in the first image given the class labels in the second image. We derive analytic expressions for the gradient of each measure with respect to individual voxel displacements to derive a force field that drives the registration process, which is regularized by a viscous fluid model. The performance of the class-based measures is evaluated in the context of non-rigid inter-subject registration and atlas-based segmentation of MR brain images and compared with maximization of mutual information using only intensity information. Our results demonstrate that incorporation of class information in the registration measure significantly improves the overlap between corresponding tissue classes after non-rigid matching. The methods proposed here open new perspectives for integrating segmentation and registration in a single process, whereby the output of one is used to guide the other.

  1. dPIRPLE: a joint estimation framework for deformable registration and penalized-likelihood CT image reconstruction using prior images

    Science.gov (United States)

    Dang, H.; Wang, A. S.; Sussman, Marc S.; Siewerdsen, J. H.; Stayman, J. W.

    2014-09-01

    Sequential imaging studies are conducted in many clinical scenarios. Prior images from previous studies contain a great deal of patient-specific anatomical information and can be used in conjunction with subsequent imaging acquisitions to maintain image quality while enabling radiation dose reduction (e.g., through sparse angular sampling, reduction in fluence, etc). However, patient motion between images in such sequences results in misregistration between the prior image and current anatomy. Existing prior-image-based approaches often include only a simple rigid registration step that can be insufficient for capturing complex anatomical motion, introducing detrimental effects in subsequent image reconstruction. In this work, we propose a joint framework that estimates the 3D deformation between an unregistered prior image and the current anatomy (based on a subsequent data acquisition) and reconstructs the current anatomical image using a model-based reconstruction approach that includes regularization based on the deformed prior image. This framework is referred to as deformable prior image registration, penalized-likelihood estimation (dPIRPLE). Central to this framework is the inclusion of a 3D B-spline-based free-form-deformation model into the joint registration-reconstruction objective function. The proposed framework is solved using a maximization strategy whereby alternating updates to the registration parameters and image estimates are applied allowing for improvements in both the registration and reconstruction throughout the optimization process. Cadaver experiments were conducted on a cone-beam CT testbench emulating a lung nodule surveillance scenario. Superior reconstruction accuracy and image quality were demonstrated using the dPIRPLE algorithm as compared to more traditional reconstruction methods including filtered backprojection, penalized-likelihood estimation (PLE), prior image penalized-likelihood estimation (PIPLE) without registration, and

  2. Multi-modal image registration based on gradient orientations of minimal uncertainty.

    Science.gov (United States)

    De Nigris, Dante; Collins, D Louis; Arbel, Tal

    2012-12-01

    In this paper, we propose a new multi-scale technique for multi-modal image registration based on the alignment of selected gradient orientations of reduced uncertainty. We show how the registration robustness and accuracy can be improved by restricting the evaluation of gradient orientation alignment to locations where the uncertainty of fixed image gradient orientations is minimal, which we formally demonstrate correspond to locations of high gradient magnitude. We also embed a computationally efficient technique for estimating the gradient orientations of the transformed moving image (rather than resampling pixel intensities and recomputing image gradients). We have applied our method to different rigid multi-modal registration contexts. Our approach outperforms mutual information and other competing metrics in the context of rigid multi-modal brain registration, where we show sub-millimeter accuracy with cases obtained from the retrospective image registration evaluation project. Furthermore, our approach shows significant improvements over standard methods in the highly challenging clinical context of image guided neurosurgery, where we demonstrate misregistration of less than 2 mm with relation to expert selected landmarks for the registration of pre-operative brain magnetic resonance images to intra-operative ultrasound images.

  3. Orthogonal moments for determining correspondence between vessel bifurcations for retinal image registration.

    Science.gov (United States)

    Patankar, Sanika S; Kulkarni, Jayant V

    2015-05-01

    Retinal image registration is a necessary step in diagnosis and monitoring of Diabetes Retinopathy (DR), which is one of the leading causes of blindness. Long term diabetes affects the retinal blood vessels and capillaries eventually causing blindness. This progressive damage to retina and subsequent blindness can be prevented by periodic retinal screening. The extent of damage caused by DR can be assessed by comparing retinal images captured during periodic retinal screenings. During image acquisition at the time of periodic screenings translation, rotation and scale (TRS) are introduced in the retinal images. Therefore retinal image registration is an essential step in automated system for screening, diagnosis, treatment and evaluation of DR. This paper presents an algorithm for registration of retinal images using orthogonal moment invariants as features for determining the correspondence between the dominant points (vessel bifurcations) in the reference and test retinal images. As orthogonal moments are invariant to TRS; moment invariants features around a vessel bifurcation are unaltered due to TRS and can be used to determine the correspondence between reference and test retinal images. The vessel bifurcation points are located in segmented, thinned (mono pixel vessel width) retinal images and labeled in corresponding grayscale retinal images. The correspondence between vessel bifurcations in reference and test retinal image is established based on moment invariants features. Further the TRS in test retinal image with respect to reference retinal image is estimated using similarity transformation. The test retinal image is aligned with reference retinal image using the estimated registration parameters. The accuracy of registration is evaluated in terms of mean error and standard deviation of the labeled vessel bifurcation points in the aligned images. The experimentation is carried out on DRIVE database, STARE database, VARIA database and database provided

  4. Historical Image Registration and Land-Use Land-Cover Change Analysis

    Directory of Open Access Journals (Sweden)

    Fang-Ju Jao

    2014-12-01

    Full Text Available Historical aerial images are important to retain past ground surface information. The land-use land-cover change in the past can be identified using historical aerial images. Automatic historical image registration and stitching is essential because the historical image pose information was usually lost. In this study, the Scale Invariant Feature Transform (SIFT algorithm was used for feature extraction. Subsequently, the present study used the automatic affine transformation algorithm for historical image registration, based on SIFT features and control points. This study automatically determined image affine parameters and simultaneously transformed from an image coordinate system to a ground coordinate system. After historical aerial image registration, the land-use land-cover change was analyzed between two different years (1947 and 1975 at the Tseng Wen River estuary. Results show that sandbars and water zones were transformed into a large number of fish ponds between 1947 and 1975.

  5. Overcoming Registration Uncertainty in Image Super-Resolution: Maximize or Marginalize?

    Directory of Open Access Journals (Sweden)

    Andrew Zisserman

    2007-01-01

    Full Text Available In multiple-image super-resolution, a high-resolution image is estimated from a number of lower-resolution images. This usually involves computing the parameters of a generative imaging model (such as geometric and photometric registration, and blur and obtaining a MAP estimate by minimizing a cost function including an appropriate prior. Two alternative approaches are examined. First, both registrations and the super-resolution image are found simultaneously using a joint MAP optimization. Second, we perform Bayesian integration over the unknown image registration parameters, deriving a cost function whose only variables of interest are the pixel values of the super-resolution image. We also introduce a scheme to learn the parameters of the image prior as part of the super-resolution algorithm. We show examples on a number of real sequences including multiple stills, digital video, and DVDs of movies.

  6. Group-wise feature-based registration of CT and ultrasound images of spine

    Science.gov (United States)

    Rasoulian, Abtin; Mousavi, Parvin; Hedjazi Moghari, Mehdi; Foroughi, Pezhman; Abolmaesumi, Purang

    2010-02-01

    Registration of pre-operative CT and freehand intra-operative ultrasound of lumbar spine could aid surgeons in the spinal needle injection which is a common procedure for pain management. Patients are always in a supine position during the CT scan, and in the prone or sitting position during the intervention. This leads to a difference in the spinal curvature between the two imaging modalities, which means a single rigid registration cannot be used for all of the lumbar vertebrae. In this work, a method for group-wise registration of pre-operative CT and intra-operative freehand 2-D ultrasound images of the lumbar spine is presented. The approach utilizes a pointbased registration technique based on the unscented Kalman filter, taking as input segmented vertebrae surfaces in both CT and ultrasound data. Ultrasound images are automatically segmented using a dynamic programming approach, while the CT images are semi-automatically segmented using thresholding. Since the curvature of the spine is different between the pre-operative and the intra-operative data, the registration approach is designed to simultaneously align individual groups of points segmented from each vertebra in the two imaging modalities. A biomechanical model is used to constrain the vertebrae transformation parameters during the registration and to ensure convergence. The mean target registration error achieved for individual vertebrae on five spine phantoms generated from CT data of patients, is 2.47 mm with standard deviation of 1.14 mm.

  7. Prostate: registration of digital histopathologic images to in vivo MR images acquired by using endorectal receive coil.

    Science.gov (United States)

    Ward, Aaron D; Crukley, Cathie; McKenzie, Charles A; Montreuil, Jacques; Gibson, Eli; Romagnoli, Cesare; Gomez, Jose A; Moussa, Madeleine; Chin, Joseph; Bauman, Glenn; Fenster, Aaron

    2012-06-01

    To develop and evaluate a technique for the registration of in vivo prostate magnetic resonance (MR) images to digital histopathologic images by using image-guided specimen slicing based on strand-shaped fiducial markers relating specimen imaging to histopathologic examination. The study was approved by the institutional review board (the University of Western Ontario Health Sciences Research Ethics Board, London, Ontario, Canada), and written informed consent was obtained from all patients. This work proposed and evaluated a technique utilizing developed fiducial markers and real-time three-dimensional visualization in support of image guidance for ex vivo prostate specimen slicing parallel to the MR imaging planes prior to digitization, simplifying the registration process. Means, standard deviations, root-mean-square errors, and 95% confidence intervals are reported for all evaluated measurements. The slicing error was within the 2.2 mm thickness of the diagnostic-quality MR imaging sections, with a tissue block thickness standard deviation of 0.2 mm. Rigid registration provided negligible postregistration overlap of the smallest clinically important tumors (0.2 cm(3)) at histologic examination and MR imaging, whereas the tested nonrigid registration method yielded a mean target registration error of 1.1 mm and provided useful coregistration of such tumors. This method for the registration of prostate digital histopathologic images to in vivo MR images acquired by using an endorectal receive coil was sufficiently accurate for coregistering the smallest clinically important lesions with 95% confidence.

  8. Automated robust registration of grossly misregistered whole-slide images with varying stains

    Science.gov (United States)

    Litjens, G.; Safferling, K.; Grabe, N.

    2016-03-01

    Cancer diagnosis and pharmaceutical research increasingly depend on the accurate quantification of cancer biomarkers. Identification of biomarkers is usually performed through immunohistochemical staining of cancer sections on glass slides. However, combination of multiple biomarkers from a wide variety of immunohistochemically stained slides is a tedious process in traditional histopathology due to the switching of glass slides and re-identification of regions of interest by pathologists. Digital pathology now allows us to apply image registration algorithms to digitized whole-slides to align the differing immunohistochemical stains automatically. However, registration algorithms need to be robust to changes in color due to differing stains and severe changes in tissue content between slides. In this work we developed a robust registration methodology to allow for fast coarse alignment of multiple immunohistochemical stains to the base hematyoxylin and eosin stained image. We applied HSD color model conversion to obtain a less stain color dependent representation of the whole-slide images. Subsequently, optical density thresholding and connected component analysis were used to identify the relevant regions for registration. Template matching using normalized mutual information was applied to provide initial translation and rotation parameters, after which a cost function-driven affine registration was performed. The algorithm was validated using 40 slides from 10 prostate cancer patients, with landmark registration error as a metric. Median landmark registration error was around 180 microns, which indicates performance is adequate for practical application. None of the registrations failed, indicating the robustness of the algorithm.

  9. EVolution: an edge-based variational method for non-rigid multi-modal image registration.

    Science.gov (United States)

    Denis de Senneville, B; Zachiu, C; Ries, M; Moonen, C

    2016-10-21

    Image registration is part of a large variety of medical applications including diagnosis, monitoring disease progression and/or treatment effectiveness and, more recently, therapy guidance. Such applications usually involve several imaging modalities such as ultrasound, computed tomography, positron emission tomography, x-ray or magnetic resonance imaging, either separately or combined. In the current work, we propose a non-rigid multi-modal registration method (namely EVolution: an edge-based variational method for non-rigid multi-modal image registration) that aims at maximizing edge alignment between the images being registered. The proposed algorithm requires only contrasts between physiological tissues, preferably present in both image modalities, and assumes deformable/elastic tissues. Given both is shown to be well suitable for non-rigid co-registration across different image types/contrasts (T1/T2) as well as different modalities (CT/MRI). This is achieved using a variational scheme that provides a fast algorithm with a low number of control parameters. Results obtained on an annotated CT data set were comparable to the ones provided by state-of-the-art multi-modal image registration algorithms, for all tested experimental conditions (image pre-filtering, image intensity variation, noise perturbation). Moreover, we demonstrate that, compared to existing approaches, our method possesses increased robustness to transient structures (i.e. that are only present in some of the images).

  10. EVolution: an edge-based variational method for non-rigid multi-modal image registration

    Science.gov (United States)

    de Senneville, B. Denis; Zachiu, C.; Ries, M.; Moonen, C.

    2016-10-01

    Image registration is part of a large variety of medical applications including diagnosis, monitoring disease progression and/or treatment effectiveness and, more recently, therapy guidance. Such applications usually involve several imaging modalities such as ultrasound, computed tomography, positron emission tomography, x-ray or magnetic resonance imaging, either separately or combined. In the current work, we propose a non-rigid multi-modal registration method (namely EVolution: an edge-based variational method for non-rigid multi-modal image registration) that aims at maximizing edge alignment between the images being registered. The proposed algorithm requires only contrasts between physiological tissues, preferably present in both image modalities, and assumes deformable/elastic tissues. Given both is shown to be well suitable for non-rigid co-registration across different image types/contrasts (T1/T2) as well as different modalities (CT/MRI). This is achieved using a variational scheme that provides a fast algorithm with a low number of control parameters. Results obtained on an annotated CT data set were comparable to the ones provided by state-of-the-art multi-modal image registration algorithms, for all tested experimental conditions (image pre-filtering, image intensity variation, noise perturbation). Moreover, we demonstrate that, compared to existing approaches, our method possesses increased robustness to transient structures (i.e. that are only present in some of the images).

  11. A first step toward uncovering the truth about weight tuning in deformable image registration

    Science.gov (United States)

    Pirpinia, Kleopatra; Bosman, Peter A. N.; Sonke, Jan-Jakob; van Herk, Marcel; Alderliesten, Tanja

    2016-03-01

    Deformable image registration is currently predominantly solved by optimizing a weighted linear combination of objectives. Successfully tuning the weights associated with these objectives is not trivial, leading to trial-and-error approaches. Such an approach assumes an intuitive interplay between weights, optimization objectives, and target registration errors. However, it is not known whether this always holds for existing registration methods. To investigate the interplay between weights, optimization objectives, and registration errors, we employ multi-objective optimization. Here, objectives of interest are optimized simultaneously, causing a set of multiple optimal solutions to exist, called the optimal Pareto front. Our medical application is in breast cancer and includes the challenging prone-supine registration problem. In total, we studied the interplay in three different ways. First, we ran many random linear combinations of objectives using the well-known registration software elastix. Second, since the optimization algorithms used in registration are typically of a local-search nature, final solutions may not always form a Pareto front. We therefore employed a multi-objective evolutionary algorithm that finds weights that correspond to registration outcomes that do form a Pareto front. Third, we examined how the interplay differs if a true multi-objective (i.e., weight-free) image registration method is used. Results indicate that a trial-and-error weight-adaptation approach can be successful for the easy prone to prone breast image registration case, due to the absence of many local optima. With increasing problem difficulty the use of more advanced approaches can be of value in finding and selecting the optimal registration outcomes.

  12. Fast parallel image registration on CPU and GPU for diagnostic classification of Alzheimer's disease.

    Science.gov (United States)

    Shamonin, Denis P; Bron, Esther E; Lelieveldt, Boudewijn P F; Smits, Marion; Klein, Stefan; Staring, Marius

    2013-01-01

    Nonrigid image registration is an important, but time-consuming task in medical image analysis. In typical neuroimaging studies, multiple image registrations are performed, i.e., for atlas-based segmentation or template construction. Faster image registration routines would therefore be beneficial. In this paper we explore acceleration of the image registration package elastix by a combination of several techniques: (i) parallelization on the CPU, to speed up the cost function derivative calculation; (ii) parallelization on the GPU building on and extending the OpenCL framework from ITKv4, to speed up the Gaussian pyramid computation and the image resampling step; (iii) exploitation of certain properties of the B-spline transformation model; (iv) further software optimizations. The accelerated registration tool is employed in a study on diagnostic classification of Alzheimer's disease and cognitively normal controls based on T1-weighted MRI. We selected 299 participants from the publicly available Alzheimer's Disease Neuroimaging Initiative database. Classification is performed with a support vector machine based on gray matter volumes as a marker for atrophy. We evaluated two types of strategies (voxel-wise and region-wise) that heavily rely on nonrigid image registration. Parallelization and optimization resulted in an acceleration factor of 4-5x on an 8-core machine. Using OpenCL a speedup factor of 2 was realized for computation of the Gaussian pyramids, and 15-60 for the resampling step, for larger images. The voxel-wise and the region-wise classification methods had an area under the receiver operator characteristic curve of 88 and 90%, respectively, both for standard and accelerated registration. We conclude that the image registration package elastix was substantially accelerated, with nearly identical results to the non-optimized version. The new functionality will become available in the next release of elastix as open source under the BSD license.

  13. Simultaneous 3D–2D image registration and C-arm calibration: Application to endovascular image-guided interventions

    Energy Technology Data Exchange (ETDEWEB)

    Mitrović, Uroš [Faculty of Electrical Engineering, University of Ljubljana, Tržaška 25, Ljubljana 1000, Slovenia and Cosylab, Control System Laboratory, Teslova ulica 30, Ljubljana 1000 (Slovenia); Pernuš, Franjo [Faculty of Electrical Engineering, University of Ljubljana, Tržaška 25, Ljubljana 1000 (Slovenia); Likar, Boštjan; Špiclin, Žiga, E-mail: ziga.spiclin@fe.uni-lj.si [Faculty of Electrical Engineering, University of Ljubljana, Tržaška 25, Ljubljana 1000, Slovenia and Sensum, Computer Vision Systems, Tehnološki Park 21, Ljubljana 1000 (Slovenia)

    2015-11-15

    Purpose: Three-dimensional to two-dimensional (3D–2D) image registration is a key to fusion and simultaneous visualization of valuable information contained in 3D pre-interventional and 2D intra-interventional images with the final goal of image guidance of a procedure. In this paper, the authors focus on 3D–2D image registration within the context of intracranial endovascular image-guided interventions (EIGIs), where the 3D and 2D images are generally acquired with the same C-arm system. The accuracy and robustness of any 3D–2D registration method, to be used in a clinical setting, is influenced by (1) the method itself, (2) uncertainty of initial pose of the 3D image from which registration starts, (3) uncertainty of C-arm’s geometry and pose, and (4) the number of 2D intra-interventional images used for registration, which is generally one and at most two. The study of these influences requires rigorous and objective validation of any 3D–2D registration method against a highly accurate reference or “gold standard” registration, performed on clinical image datasets acquired in the context of the intervention. Methods: The registration process is split into two sequential, i.e., initial and final, registration stages. The initial stage is either machine-based or template matching. The latter aims to reduce possibly large in-plane translation errors by matching a projection of the 3D vessel model and 2D image. In the final registration stage, four state-of-the-art intrinsic image-based 3D–2D registration methods, which involve simultaneous refinement of rigid-body and C-arm parameters, are evaluated. For objective validation, the authors acquired an image database of 15 patients undergoing cerebral EIGI, for which accurate gold standard registrations were established by fiducial marker coregistration. Results: Based on target registration error, the obtained success rates of 3D to a single 2D image registration after initial machine-based and

  14. Sensitivity study of voxel-based PET image comparison to image registration algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Yip, Stephen, E-mail: syip@lroc.harvard.edu; Chen, Aileen B.; Berbeco, Ross [Department of Radiation Oncology, Brigham and Women’s Hospital, Dana-Farber Cancer Institute and Harvard Medical School, Boston, Massachusetts 02115 (United States); Aerts, Hugo J. W. L. [Department of Radiation Oncology, Brigham and Women’s Hospital, Dana-Farber Cancer Institute and Harvard Medical School, Boston, Massachusetts 02115 and Department of Radiology, Brigham and Women’s Hospital and Harvard Medical School, Boston, Massachusetts 02115 (United States)

    2014-11-01

    Purpose: Accurate deformable registration is essential for voxel-based comparison of sequential positron emission tomography (PET) images for proper adaptation of treatment plan and treatment response assessment. The comparison may be sensitive to the method of deformable registration as the optimal algorithm is unknown. This study investigated the impact of registration algorithm choice on therapy response evaluation. Methods: Sixteen patients with 20 lung tumors underwent a pre- and post-treatment computed tomography (CT) and 4D FDG-PET scans before and after chemoradiotherapy. All CT images were coregistered using a rigid and ten deformable registration algorithms. The resulting transformations were then applied to the respective PET images. Moreover, the tumor region defined by a physician on the registered PET images was classified into progressor, stable-disease, and responder subvolumes. Particularly, voxels with standardized uptake value (SUV) decreases >30% were classified as responder, while voxels with SUV increases >30% were progressor. All other voxels were considered stable-disease. The agreement of the subvolumes resulting from difference registration algorithms was assessed by Dice similarity index (DSI). Coefficient of variation (CV) was computed to assess variability of DSI between individual tumors. Root mean square difference (RMS{sub rigid}) of the rigidly registered CT images was used to measure the degree of tumor deformation. RMS{sub rigid} and DSI were correlated by Spearman correlation coefficient (R) to investigate the effect of tumor deformation on DSI. Results: Median DSI{sub rigid} was found to be 72%, 66%, and 80%, for progressor, stable-disease, and responder, respectively. Median DSI{sub deformable} was 63%–84%, 65%–81%, and 82%–89%. Variability of DSI was substantial and similar for both rigid and deformable algorithms with CV > 10% for all subvolumes. Tumor deformation had moderate to significant impact on DSI for progressor

  15. Three-dimensional elastic image registration based on strain energy minimization: application to prostate magnetic resonance imaging.

    Science.gov (United States)

    Zhang, Bao; Arola, Dwayne D; Roys, Steve; Gullapalli, Rao P

    2011-08-01

    The use of magnetic resonance (MR) imaging in conjunction with an endorectal coil is currently the clinical standard for the diagnosis of prostate cancer because of the increased sensitivity and specificity of this approach. However, imaging in this manner provides images and spectra of the prostate in the deformed state because of the insertion of the endorectal coil. Such deformation may lead to uncertainties in the localization of prostate cancer during therapy. We propose a novel 3-D elastic registration procedure that is based on the minimization of a physically motivated strain energy function that requires the identification of similar features (points, curves, or surfaces) in the source and target images. The Gauss-Seidel method was used in the numerical implementation of the registration algorithm. The registration procedure was validated on synthetic digital images, MR images from prostate phantom, and MR images obtained on patients. The registration error, assessed by averaging the displacement of a fiducial landmark in the target to its corresponding point in the registered image, was 0.2 ± 0.1 pixels on synthetic images. On the prostate phantom and patient data, the registration errors were 1.0 ± 0.6 pixels (0.6 ± 0.4 mm) and 1.8 ± 0.7 pixels (1.1 ± 0.4 mm), respectively. Registration also improved image similarity (normalized cross-correlation) from 0.72 ± 0.10 to 0.96 ± 0.03 on patient data. Registration results on digital images, phantom, and prostate data in vivo demonstrate that the registration procedure can be used to significantly improve both the accuracy of localized therapies such as brachytherapy or external beam therapy and can be valuable in the longitudinal follow-up of patients after therapy.

  16. Generation of synthetic CT data using patient specific daily MR image data and image registration

    Science.gov (United States)

    Melanie Kraus, Kim; Jäkel, Oliver; Niebuhr, Nina I.; Pfaffenberger, Asja

    2017-02-01

    To fully exploit the advantages of magnetic resonance imaging (MRI) for radiotherapy (RT) treatment planning, a method is required to overcome the problem of lacking electron density information. We aim to establish and evaluate a new method for computed tomography (CT) data generation based on MRI and image registration. The thereby generated CT data is used for dose accumulation. We developed a process flow based on an initial pair of rigidly co-registered CT and T2-weighted MR image representing the same anatomical situation. Deformable image registration using anatomical landmarks is performed between the initial MRI data and daily MR images. The resulting transformation is applied to the initial CT, thus fractional CT data is generated. Furthermore, the dose for a photon intensity modulated RT (IMRT) or intensity modulated proton therapy (IMPT) plan is calculated on the generated fractional CT and accumulated on the initial CT via inverse transformation. The method is evaluated by the use of phantom CT and MRI data. Quantitative validation is performed by evaluation of the mean absolute error (MAE) between the measured and the generated CT. The effect on dose accumulation is examined by means of dose-volume parameters. One patient case is presented to demonstrate the applicability of the method introduced here. Overall, CT data derivation lead to MAEs with a median of 37.0 HU ranging from 29.9 to 66.6 HU for all investigated tissues. The accuracy of image registration showed to be limited in the case of unexpected air cavities and at tissue boundaries. The comparisons of dose distributions based on measured and generated CT data agree well with the published literature. Differences in dose volume parameters kept within 1.6% and 3.2% for photon and proton RT, respectively. The method presented here is particularly suited for application in adaptive RT in current clinical routine, since only minor additional technical equipment is required.

  17. A Wavelet-Based Multiresolution Reconstruction Method for Fluorescent Molecular Tomography

    Directory of Open Access Journals (Sweden)

    Wei Zou

    2009-01-01

    Full Text Available Image reconstruction of fluorescent molecular tomography (FMT often involves repeatedly solving large-dimensional matrix equations, which are computationally expensive, especially for the case where there are large deviations in the optical properties between the target and the reference medium. In this paper, a wavelet-based multiresolution reconstruction approach is proposed for the FMT reconstruction in combination with a parallel forward computing strategy, in which both the forward and the inverse problems of FMT are solved in the wavelet domain. Simulation results demonstrate that the proposed approach can significantly speed up the reconstruction process and improve the image quality of FMT.

  18. Automatic multi-resolution image registration based on genetic algorithm and Hausdorff distance

    Institute of Scientific and Technical Information of China (English)

    Famao Ye; Lin Su; Shukai Li

    2006-01-01

    @@ Image registration is a crucial step in all image analysis tasks in which the final information is gained from the combination of various data sources, and it is difficult to automatically register due to the complexity of image. An approach based on genetic algorithm and Hausdorff distance to automatic image registration is presented. We use a multi-resolution edge tracker to find out the fine-quality edges and utilize the Hausdorff distance between the input image and the reference image as similarity measure. We use wavelet decomposition and genetic algorithm, which combine local search methods with global ones balancing exploration and exploitation, to speed up the search of the best transformation parameters.Experimental results show that the proposed approach is a promising method for registration of image.

  19. Hybrid bronchoscope tracking using a magnetic tracking sensor and image registration.

    Science.gov (United States)

    Mori, Kensaku; Deguchi, Daisuke; Akiyama, Kenta; Kitasaka, Takayuki; Maurer, Calvin R; Suenaga, Yasuhito; Takabatake, Hirotsugu; Mori, Masaki; Natori, Hiroshi

    2005-01-01

    In this paper, we propose a hybrid method for tracking a bronchoscope that uses a combination of magnetic sensor tracking and image registration. The position of a magnetic sensor placed in the working channel of the bronchoscope is provided by a magnetic tracking system. Because of respiratory motion, the magnetic sensor provides only the approximate position and orientation of the bronchoscope in the coordinate system of a CT image acquired before the examination. The sensor position and orientation is used as the starting point for an intensity-based registration between real bronchoscopic video images and virtual bronchoscopic images generated from the CT image. The output transformation of the image registration process is the position and orientation of the bronchoscope in the CT image. We tested the proposed method using a bronchial phantom model. Virtual breathing motion was generated to simulate respiratory motion. The proposed hybrid method successfully tracked the bronchoscope at a rate of approximately 1 Hz.

  20. Redundant Discrete Wavelet Transform Based Super-Resolution Using Sub-Pixel Image Registration

    Science.gov (United States)

    2003-03-01

    AFIT/GE/ENG/03-18 REDUNDANT DISCRETE WAVELET TRANSFORM BASED SUPER-RESOLUTION USING SUB-PIXEL IMAGE REGISTRATION THESIS Daniel L. Ward Second...position of the United States Air Force, Department of Defense, or the United States Government. AFIT/GE/ENG/03-18 REDUNDANT DISCRETE WAVELET TRANSFORM BASED...O3-18 REDUNDANT DISCRETE WAVELET TRANSFORM BASED SUPER-RESOLUTION USING SUB-PIXEL IMAGE REGISTRATION THESIS Daniel Lee Ward, B.S.E.E. Second

  1. Semiautomatic registration of 3D transabdominal ultrasound images for patient repositioning during postprostatectomy radiotherapy

    Energy Technology Data Exchange (ETDEWEB)

    Presles, Benoît, E-mail: benoit.presles@creatis.insa-lyon.fr; Rit, Simon; Sarrut, David [Université de Lyon, CREATIS, CNRS UMR5220, Inserm U1044, INSA-Lyon, Université Lyon 1, Lyon F-69621, France and Léon Bérard Cancer Center, Université de Lyon, Lyon F-69373 (France); Fargier-Voiron, Marie; Liebgott, Hervé [Université de Lyon, CREATIS, CNRS UMR5220, Inserm U1044, INSA-Lyon, Université Lyon 1, Lyon F-69621 (France); Biston, Marie-Claude; Munoz, Alexandre; Pommier, Pascal [Léon Bérard Cancer Center, Université de Lyon, Lyon F-69373 (France); Lynch, Rod [The Andrew Love Cancer Centre, University Hospital Geelong, Geelong 3220 (Australia)

    2014-12-15

    Purpose: The aim of the present work is to propose and evaluate registration algorithms of three-dimensional (3D) transabdominal (TA) ultrasound (US) images to setup postprostatectomy patients during radiation therapy. Methods: Three registration methods have been developed and evaluated to register a reference 3D-TA-US image acquired during the planning CT session and a 3D-TA-US image acquired before each treatment session. The first method (method A) uses only gray value information, whereas the second one (method B) uses only gradient information. The third one (method C) combines both sets of information. All methods restrict the comparison to a region of interest computed from the dilated reference positioning volume drawn on the reference image and use mutual information as a similarity measure. The considered geometric transformations are translations and have been optimized by using the adaptive stochastic gradient descent algorithm. Validation has been carried out using manual registration by three operators of the same set of image pairs as the algorithms. Sixty-two treatment US images of seven patients irradiated after a prostatectomy have been registered to their corresponding reference US image. The reference registration has been defined as the average of the manual registration values. Registration error has been calculated by subtracting the reference registration from the algorithm result. For each session, the method has been considered a failure if the registration error was above both the interoperator variability of the session and a global threshold of 3.0 mm. Results: All proposed registration algorithms have no systematic bias. Method B leads to the best results with mean errors of −0.6, 0.7, and −0.2 mm in left–right (LR), superior–inferior (SI), and anterior–posterior (AP) directions, respectively. With this method, the standard deviations of the mean error are of 1.7, 2.4, and 2.6 mm in LR, SI, and AP directions, respectively

  2. Kernel Bundle Diffeomorphic Image Registration Using Stationary Velocity Fields and Wendland Basis Functions.

    Science.gov (United States)

    Pai, Akshay; Sommer, Stefan; Sorensen, Lauge; Darkner, Sune; Sporring, Jon; Nielsen, Mads

    2016-06-01

    In this paper, we propose a multi-scale, multi-kernel shape, compactly supported kernel bundle framework for stationary velocity field-based image registration (Wendland kernel bundle stationary velocity field, wKB-SVF). We exploit the possibility of directly choosing kernels to construct a reproducing kernel Hilbert space (RKHS) instead of imposing it from a differential operator. The proposed framework allows us to minimize computational cost without sacrificing the theoretical foundations of SVF-based diffeomorphic registration. In order to recover deformations occurring at different scales, we use compactly supported Wendland kernels at multiple scales and orders to parameterize the velocity fields, and the framework allows simultaneous optimization over all scales. The performance of wKB-SVF is extensively compared to the 14 non-rigid registration algorithms presented in a recent comparison paper. On both MGH10 and CUMC12 datasets, the accuracy of wKB-SVF is improved when compared to other registration algorithms. In a disease-specific application for intra-subject registration, atrophy scores estimated using the proposed registration scheme separates the diagnostic groups of Alzheimer's and normal controls better than the state-of-the-art segmentation technique. Experimental results show that wKB-SVF is a robust, flexible registration framework that allows theoretically well-founded and computationally efficient multi-scale representation of deformations and is equally well-suited for both inter- and intra-subject image registration.

  3. Inverse consistent non-rigid image registration based on robust point set matching.

    Science.gov (United States)

    Yang, Xuan; Pei, Jihong; Shi, Jingli

    2014-01-01

    Robust point matching (RPM) has been extensively used in non-rigid registration of images to robustly register two sets of image points. However, except for the location at control points, RPM cannot estimate the consistent correspondence between two images because RPM is a unidirectional image matching approach. Therefore, it is an important issue to make an improvement in image registration based on RPM. In our work, a consistent image registration approach based on the point sets matching is proposed to incorporate the property of inverse consistency and improve registration accuracy. Instead of only estimating the forward transformation between the source point sets and the target point sets in state-of-the-art RPM algorithms, the forward and backward transformations between two point sets are estimated concurrently in our algorithm. The inverse consistency constraints are introduced to the cost function of RPM and the fuzzy correspondences between two point sets are estimated based on both the forward and backward transformations simultaneously. A modified consistent landmark thin-plate spline registration is discussed in detail to find the forward and backward transformations during the optimization of RPM. The similarity of image content is also incorporated into point matching in order to improve image matching. Synthetic data sets, medical images are employed to demonstrate and validate the performance of our approach. The inverse consistent errors of our algorithm are smaller than RPM. Especially, the topology of transformations is preserved well for our algorithm for the large deformation between point sets. Moreover, the distance errors of our algorithm are similar to that of RPM, and they maintain a downward trend as whole, which demonstrates the convergence of our algorithm. The registration errors for image registrations are evaluated also. Again, our algorithm achieves the lower registration errors in same iteration number. The determinant of the

  4. Registration of renal SPECT and 2.5D US images.

    Science.gov (United States)

    Galdames, Francisco J; Perez, Claudio A; Estévez, Pablo A; Held, Claudio M; Jaillet, Fabrice; Lobo, Gabriel; Donoso, Gilda; Coll, Claudia

    2011-06-01

    Image registration is the process of transforming different image data sets of an object into the same coordinate system. This is a relevant task in the field of medical imaging; one of its objectives is to combine information from different imaging modalities. The main goal of this study is the registration of renal SPECT (Single Photon Emission Computerized Tomography) images and a sparse set of ultrasound slices (2.5D US), combining functional and anatomical information. Registration is performed after kidney segmentation in both image types. The SPECT segmentation is achieved using a deformable model based on a simplex mesh. The 2.5D US image segmentation is carried out in each of the 2D slices employing a deformable contour and Gabor filters to capture multi-scale image features. Moreover, a renal medulla detection method was developed to improve the US segmentation. A nonlinear optimization algorithm is used for the registration. In this process, movements caused by patient breathing during US image acquisition are also corrected. Only a few reports describe registration between SPECT images and a sparse set of US slices of the kidney, and they usually employ an optical localizer, unlike our method, that performs movement correction using information only from the SPECT and US images. Moreover, it does not require simultaneous acquisition of both image types. The registration method and both segmentations were evaluated separately. The SPECT segmentation was evaluated qualitatively by medical experts, obtaining a score of 5 over a scale from 1 to 5, where 5 represents a perfect segmentation. The 2.5D US segmentation was evaluated quantitatively, by comparing our method with an expert manual segmentation, and obtaining an average error of 3.3mm. The registration was evaluated quantitatively and qualitatively. Quantitatively the distance between the manual segmentation of the US images and the model extracted from the SPECT image was measured, obtaining an

  5. A new region descriptor for multi-modal medical image registration and region detection.

    Science.gov (United States)

    Xiaonan Wan; Dongdong Yu; Feng Yang; Caiyun Yang; Chengcai Leng; Min Xu; Jie Tian

    2015-08-01

    Establishing accurate anatomical correspondences plays a critical role in multi-modal medical image registration and region detection. Although many features based registration methods have been proposed to detect these correspondences, they are mostly based on the point descriptor which leads to high memory cost and could not represent local region information. In this paper, we propose a new region descriptor which depicts the features in each region, instead of in each point, as a vector. First, feature attributes of each point are extracted by a Gabor filter bank combined with a gradient filter. Then, the region descriptor is defined as the covariance of feature attributes of each point inside the region, based on which a cost function is constructed for multi-modal image registration. Finally, our proposed region descriptor is applied to both multi-modal region detection and similarity metric measurement in multi-modal image registration. Experiments demonstrate the feasibility and effectiveness of our proposed region descriptor.

  6. Landmark Optimization Using Local Curvature for Point-Based Nonlinear Rodent Brain Image Registration

    Directory of Open Access Journals (Sweden)

    Yutong Liu

    2012-01-01

    Full Text Available Purpose. To develop a technique to automate landmark selection for point-based interpolating transformations for nonlinear medical image registration. Materials and Methods. Interpolating transformations were calculated from homologous point landmarks on the source (image to be transformed and target (reference image. Point landmarks are placed at regular intervals on contours of anatomical features, and their positions are optimized along the contour surface by a function composed of curvature similarity and displacements of the homologous landmarks. The method was evaluated in two cases (=5 each. In one, MRI was registered to histological sections; in the second, geometric distortions in EPI MRI were corrected. Normalized mutual information and target registration error were calculated to compare the registration accuracy of the automatically and manually generated landmarks. Results. Statistical analyses demonstrated significant improvement (<0.05 in registration accuracy by landmark optimization in most data sets and trends towards improvement (<0.1 in others as compared to manual landmark selection.

  7. MREG V1.1 : a multi-scale image registration algorithm for SAR applications.

    Energy Technology Data Exchange (ETDEWEB)

    Eichel, Paul H.

    2013-08-01

    MREG V1.1 is the sixth generation SAR image registration algorithm developed by the Signal Processing&Technology Department for Synthetic Aperture Radar applications. Like its predecessor algorithm REGI, it employs a powerful iterative multi-scale paradigm to achieve the competing goals of sub-pixel registration accuracy and the ability to handle large initial offsets. Since it is not model based, it allows for high fidelity tracking of spatially varying terrain-induced misregistration. Since it does not rely on image domain phase, it is equally adept at coherent and noncoherent image registration. This document provides a brief history of the registration processors developed by Dept. 5962 leading up to MREG V1.1, a full description of the signal processing steps involved in the algorithm, and a user's manual with application specific recommendations for CCD, TwoColor MultiView, and SAR stereoscopy.

  8. Two-step image registration by artificial immune system and chamfer matching

    Institute of Scientific and Technical Information of China (English)

    Famao Ye; Shaoping Xu; Yuhong Xiong

    2008-01-01

    Image registration is the precondition and foundation in the fusion of multi-source image data. A two-step approach based on artificial immune system and chamfer matching to register images from different types of sensors is presented. In the first step, it extracts the large edges and takes chamfer distance between the input image and the reference image as similarity measure and uses artificial immune network algorithm to speed up the searching of the initial transformation parameters. In the second step, an area-based method is utilized to refine the initial transformation and enhance the registration accuracy. Experimental results show that the proposed approach is a promising method for registration of multi-sensor images.

  9. An efficient similarity measure technique for medical image registration

    Indian Academy of Sciences (India)

    Vilas H Gaidhane; Yogesh V Hote; Vijander Singh

    2012-12-01

    In this paper, an efficient similarity measure technique is proposed for medical image registration. The proposed approach is based on the Gerschgorin circles theorem. In this approach, image registration is carried out by considering Gerschgorin bounds of a covariance matrix of two compared images with normalized energy. The beauty of this approach is that there is no need to calculate image features like eigenvalues and eigenvectors. This technique is superior to other well-known techniques such as normalized cross-correlation method and eigenvalue-based similarity measures since it avoids the false registration and requires less computation. The proposed approach is sensitive to small defects and robust to change in illuminations and noise. Experimental results on various synthetic medical images have shown the effectiveness of the proposed technique for detecting and locating the disease in the complicated medical images.

  10. Deep Adaptive Log-Demons: Diffeomorphic Image Registration with Very Large Deformations

    Directory of Open Access Journals (Sweden)

    Liya Zhao

    2015-01-01

    Full Text Available This paper proposes a new framework for capturing large and complex deformation in image registration. Traditionally, this challenging problem relies firstly on a preregistration, usually an affine matrix containing rotation, scale, and translation and afterwards on a nonrigid transformation. According to preregistration, the directly calculated affine matrix, which is obtained by limited pixel information, may misregistrate when large biases exist, thus misleading following registration subversively. To address this problem, for two-dimensional (2D images, the two-layer deep adaptive registration framework proposed in this paper firstly accurately classifies the rotation parameter through multilayer convolutional neural networks (CNNs and then identifies scale and translation parameters separately. For three-dimensional (3D images, affine matrix is located through feature correspondences by a triplanar 2D CNNs. Then deformation removal is done iteratively through preregistration and demons registration. By comparison with the state-of-the-art registration framework, our method gains more accurate registration results on both synthetic and real datasets. Besides, principal component analysis (PCA is combined with correlation like Pearson and Spearman to form new similarity standards in 2D and 3D registration. Experiment results also show faster convergence speed.

  11. A two-step framework for the registration of HE stained and FTIR images

    Science.gov (United States)

    Peñaranda, Francisco; Naranjo, Valery; Verdú, Rafaél.; Lloyd, Gavin R.; Nallala, Jayakrupakar; Stone, Nick

    2016-03-01

    FTIR spectroscopy is an emerging technology with high potential for cancer diagnosis but with particular physical phenomena that require special processing. Little work has been done in the field with the aim of registering hyperspectral Fourier-Transform Infrared (FTIR) spectroscopic images and Hematoxilin and Eosin (HE) stained histological images of contiguous slices of tissue. This registration is necessary to transfer the location of relevant structures that the pathologist may identify in the gold standard HE images. A two-step registration framework is presented where a representative gray image extracted from the FTIR hypercube is used as an input. This representative image, which must have a spatial contrast as similar as possible to a gray image obtained from the HE image, is calculated through the spectrum variation in the fingerprint region. In the first step of the registration algorithm a similarity transformation is estimated from interest points, which are automatically detected by the popular SURF algorithm. In the second stage, a variational registration framework defined in the frequency domain compensates for local anatomical variations between both images. After a proper tuning of some parameters the proposed registration framework works in an automated way. The method was tested on 7 samples of colon tissue in different stages of cancer. Very promising qualitative and quantitative results were obtained (a mean correlation ratio of 92.16% with a standard deviation of 3.10%).

  12. New approach for the pelvic registration and fusion of CT and MR images

    Science.gov (United States)

    Liu, Yuh-Hwan; Sun, Yung-Nien; Chiou, Jong-Iuan

    1997-04-01

    This paper presents a two-passed registration method to register the pelvic CT and MR images. The geometrical relationship between CT and Mr images is determined by some uniquely selected internal landmarks which are all located on the coxal bone. Thus, it can be assumed to be a rigid transformation. In the first passed registration, the relative feature vectors, such as the normal vectors, such as the normal vectors of acetabular rim planes and the vector connecting two centroids of rims, are extracted and used for registration. The relative feature vectors determined based on the edge of acetabular rims are one of few features which can be observed on both CT and Mr images. The registration results based on the relative feature vectors are less influenced by the variation in the accuracy of the detection of absolute feature points. In the second passed registration, the corner points of sacrum are used to eliminate the distortion in z-directions. The least square error approximation is used to obtain the transformation matrix in both registration passes. In addition, a complete system is developed to provide clinicians with all image processing operations and visualization. For the visualization of fused data, 2D overlapping display and 3D transparent display are used to illustrate the correspondence of different structures, including bones and soft tissues. The fused images well demonstrate the information from two complementary modalities and are highly appreciated in clinical applications.

  13. Accelerating image registration of MRI by GPU-based parallel computation.

    Science.gov (United States)

    Huang, Teng-Yi; Tang, Yu-Wei; Ju, Shiun-Ying

    2011-06-01

    Automatic image registration for MRI applications generally requires many iteration loops and is, therefore, a time-consuming task. This drawback prolongs data analysis and delays the workflow of clinical routines. Recent advances in the massively parallel computation of graphic processing units (GPUs) may be a solution to this problem. This study proposes a method to accelerate registration calculations, especially for the popular statistical parametric mapping (SPM) system. This study reimplemented the image registration of SPM system to achieve an approximately 14-fold increase in speed in registering single-modality intrasubject data sets. The proposed program is fully compatible with SPM, allowing the user to simply replace the original image registration library of SPM to gain the benefit of the computation power provided by commodity graphic processors. In conclusion, the GPU computation method is a practical way to accelerate automatic image registration. This technology promises a broader scope of application in the field of image registration. Copyright © 2011 Elsevier Inc. All rights reserved.

  14. Wavelet based characterization of ex vivo vertebral trabecular bone structure with 3T MRI compared to microCT

    Energy Technology Data Exchange (ETDEWEB)

    Krug, R; Carballido-Gamio, J; Burghardt, A; Haase, S; Sedat, J W; Moss, W C; Majumdar, S

    2005-04-11

    Trabecular bone structure and bone density contribute to the strength of bone and are important in the study of osteoporosis. Wavelets are a powerful tool to characterize and quantify texture in an image. In this study the thickness of trabecular bone was analyzed in 8 cylindrical cores of the vertebral spine. Images were obtained from 3 Tesla (T) magnetic resonance imaging (MRI) and micro-computed tomography ({micro}CT). Results from the wavelet based analysis of trabecular bone were compared with standard two-dimensional structural parameters (analogous to bone histomorphometry) obtained using mean intercept length (MR images) and direct 3D distance transformation methods ({micro}CT images). Additionally, the bone volume fraction was determined from MR images. We conclude that the wavelet based analyses delivers comparable results to the established MR histomorphometric measurements. The average deviation in trabecular thickness was less than one pixel size between the wavelet and the standard approach for both MR and {micro}CT analysis. Since the wavelet based method is less sensitive to image noise, we see an advantage of wavelet analysis of trabecular bone for MR imaging when going to higher resolution.

  15. WAVELET BASED SPECTRAL CORRELATION METHOD FOR DPSK CHIP RATE ESTIMATION

    Institute of Scientific and Technical Information of China (English)

    Li Yingxiang; Xiao Xianci; Tai Hengming

    2004-01-01

    A wavelet-based spectral correlation algorithm to detect and estimate BPSK signal chip rate is proposed. Simulation results show that the proposed method can correctly estimate the BPSK signal chip rate, which may be corrupted by the quadratic characteristics of the spectral correlation function, in a low SNR environment.

  16. Augmented reality navigation with automatic marker-free image registration using 3-D image overlay for dental surgery.

    Science.gov (United States)

    Wang, Junchen; Suenaga, Hideyuki; Hoshi, Kazuto; Yang, Liangjing; Kobayashi, Etsuko; Sakuma, Ichiro; Liao, Hongen

    2014-04-01

    Computer-assisted oral and maxillofacial surgery (OMS) has been rapidly evolving since the last decade. State-of-the-art surgical navigation in OMS still suffers from bulky tracking sensors, troublesome image registration procedures, patient movement, loss of depth perception in visual guidance, and low navigation accuracy. We present an augmented reality navigation system with automatic marker-free image registration using 3-D image overlay and stereo tracking for dental surgery. A customized stereo camera is designed to track both the patient and instrument. Image registration is performed by patient tracking and real-time 3-D contour matching, without requiring any fiducial and reference markers. Real-time autostereoscopic 3-D imaging is implemented with the help of a consumer-level graphics processing unit. The resulting 3-D image of the patient's anatomy is overlaid on the surgical site by a half-silvered mirror using image registration and IP-camera registration to guide the surgeon by exposing hidden critical structures. The 3-D image of the surgical instrument is also overlaid over the real one for an augmented display. The 3-D images present both stereo and motion parallax from which depth perception can be obtained. Experiments were performed to evaluate various aspects of the system; the overall image overlay error of the proposed system was 0.71 mm.

  17. Two Solutions for Registration of Ultrasound to MRI for Image-Guided Prostate Interventions

    Science.gov (United States)

    Moradi, Mehdi; Janoos, Firdaus; Fedorov, Andriy; Risholm, Petter; Kapur, Tina; Wolfsberger, Luciant D.; Nguyen, Paul L.; Tempany, Clare M; Wells, William M

    2013-01-01

    Ultrasound-guided prostate interventions could benefit from incorporating the radiologic localization of the tumor which can be acquired from multiparametric MRI. To enable this integration, we propose and compare two solutions for registration of T2 weighted MR images with transrectal ultrasound. Firstly, we propose an innovative and practical approach based on deformable registration of binary label maps obtained from manual segmentation of the gland in the two modalities. This resulted in a target registration error of 3.6±1.7 mm. Secondly, we report a novel surface-based registration method that uses a biomechanical model of the tissue and results in registration error of 3.2±1.3 mm. We compare the two methods in terms of accuracy, clinical use and technical limitations. PMID:23366095

  18. A Novel Method for Brain MRI Super-resolution by Wavelet-based POCS and Adaptive Edge Zoom

    Directory of Open Access Journals (Sweden)

    N. Hema Rajini,

    2010-10-01

    Full Text Available This paper aims to make the super-resolution of a high-resolution image from a sequence of low-resolution frames containing non-stationary objects. The challenges of making super-resolution image, like unavoidable smoothing effects, introduction of artifacts, computational efficiency in time and computational efficiency in memory requirements, are considered and a novel method is proposed to solve these problems. The proposed method handles the super-resolution process by using wavelet based projection-onto-convex-set with adaptive edge zoom algorithm. Adaptive edge zoom algorithm address the problem of producing enlarged picture from the given digital image. Wavelet based projection-onto-convex-set method is usedto enhance spatial resolution of MRI brain images from a temporal sequence. This method produces more clarity with high peak signal-to-noise ratio.

  19. Hierarchical and successive approximate registration of the non-rigid medical image based on thin-plate splines

    Science.gov (United States)

    Hu, Jinyan; Li, Li; Yang, Yunfeng

    2017-06-01

    The hierarchical and successive approximate registration method of non-rigid medical image based on the thin-plate splines is proposed in the paper. There are two major novelties in the proposed method. First, the hierarchical registration based on Wavelet transform is used. The approximate image of Wavelet transform is selected as the registered object. Second, the successive approximation registration method is used to accomplish the non-rigid medical images registration, i.e. the local regions of the couple images are registered roughly based on the thin-plate splines, then, the current rough registration result is selected as the object to be registered in the following registration procedure. Experiments show that the proposed method is effective in the registration process of the non-rigid medical images.

  20. An Image-Based Approach for the Co-Registration of Multi-Temporal UAV Image Datasets

    OpenAIRE

    Irene Aicardi; Francesco Nex; Markus Gerke; Andrea Maria Lingua

    2016-01-01

    During the past years, UAVs (Unmanned Aerial Vehicles) became very popular as low-cost image acquisition platforms since they allow for high resolution and repetitive flights in a flexible way. One application is to monitor dynamic scenes. However, the fully automatic co-registration of the acquired multi-temporal data still remains an open issue. Most UAVs are not able to provide accurate direct image georeferencing and the co-registration process is mostly performed with the manual introduc...

  1. Automatic localization of landmark sets in head CT images with regression forests for image registration initialization

    Science.gov (United States)

    Zhang, Dongqing; Liu, Yuan; Noble, Jack H.; Dawant, Benoit M.

    2016-03-01

    Cochlear Implants (CIs) are electrode arrays that are surgically inserted into the cochlea. Individual contacts stimulate frequency-mapped nerve endings thus replacing the natural electro-mechanical transduction mechanism. CIs are programmed post-operatively by audiologists but this is currently done using behavioral tests without imaging information that permits relating electrode position to inner ear anatomy. We have recently developed a series of image processing steps that permit the segmentation of the inner ear anatomy and the localization of individual contacts. We have proposed a new programming strategy that uses this information and we have shown in a study with 68 participants that 78% of long term recipients preferred the programming parameters determined with this new strategy. A limiting factor to the large scale evaluation and deployment of our technique is the amount of user interaction still required in some of the steps used in our sequence of image processing algorithms. One such step is the rough registration of an atlas to target volumes prior to the use of automated intensity-based algorithms when the target volumes have very different fields of view and orientations. In this paper we propose a solution to this problem. It relies on a random forest-based approach to automatically localize a series of landmarks. Our results obtained from 83 images with 132 registration tasks show that automatic initialization of an intensity-based algorithm proves to be a reliable technique to replace the manual step.

  2. Fast Parallel Image Registration on CPU and GPU for Diagnostic Classification of Alzheimer's Disease

    Directory of Open Access Journals (Sweden)

    Denis P Shamonin

    2014-01-01

    Full Text Available Nonrigid image registration is an important, but time-consuming taskin medical image analysis. In typical neuroimaging studies, multipleimage registrations are performed, i.e. for atlas-based segmentationor template construction. Faster image registration routines wouldtherefore be beneficial.In this paper we explore acceleration of the image registrationpackage elastix by a combination of several techniques: iparallelization on the CPU, to speed up the cost function derivativecalculation; ii parallelization on the GPU building on andextending the OpenCL framework from ITKv4, to speed up the Gaussianpyramid computation and the image resampling step; iii exploitationof certain properties of the B-spline transformation model; ivfurther software optimizations.The accelerated registration tool is employed in a study ondiagnostic classification of Alzheimer's disease and cognitivelynormal controls based on T1-weighted MRI. We selected 299participants from the publicly available Alzheimer's DiseaseNeuroimaging Initiative database. Classification is performed with asupport vector machine based on gray matter volumes as a marker foratrophy. We evaluated two types of strategies (voxel-wise andregion-wise that heavily rely on nonrigid image registration.Parallelization and optimization resulted in an acceleration factorof 4-5x on an 8-core machine. Using OpenCL a speedup factor of ~2was realized for computation of the Gaussian pyramids, and 15-60 forthe resampling step, for larger images. The voxel-wise and theregion-wise classification methods had an area under thereceiver operator characteristic curve of 88% and 90%,respectively, both for standard and accelerated registration.We conclude that the image registration package elastix wassubstantially accelerated, with nearly identical results to thenon-optimized version. The new functionality will become availablein the next release of elastix as open source under the BSD license.

  3. Wavelet-based correlations of impedance cardiography signals and heart rate variability

    Science.gov (United States)

    Podtaev, Sergey; Dumler, Andrew; Stepanov, Rodion; Frick, Peter; Tziberkin, Kirill

    2010-04-01

    The wavelet-based correlation analysis is employed to study impedance cardiography signals (variation in the impedance of the thorax z(t) and time derivative of the thoracic impedance (- dz/dt)) and heart rate variability (HRV). A method of computer thoracic tetrapolar polyrheocardiography is used for hemodynamic registrations. The modulus of wavelet-correlation function shows the level of correlation, and the phase indicates the mean phase shift of oscillations at the given scale (frequency). Significant correlations essentially exceeding the values obtained for noise signals are defined within two spectral ranges, which correspond to respiratory activity (0.14-0.5 Hz), endothelial related metabolic activity and neuroendocrine rhythms (0.0095-0.02 Hz). Probably, the phase shift of oscillations in all frequency ranges is related to the peculiarities of parasympathetic and neuro-humoral regulation of a cardiovascular system.

  4. Registration of electronic portal images for patient set-up verification.

    Science.gov (United States)

    Matsopoulos, George K; Asvestas, Pantelis A; Delibasis, Konstantinos K; Kouloulias, Vassilios; Uzunoglu, Nikolaos; Karaiskos, Pantelis; Sandilos, Panagiotis

    2004-07-21

    Images acquired from an electronic portal imaging device are aligned with digitally reconstructed radiographs (DRRs) or other portal images to verify patient positioning during radiation therapy. Most of the currently available computer aided registration methods are based on the manual placement of corresponding landmarks. The purpose of the paper is twofold: (a) the establishment of a methodology for patient set-up verification during radiotherapy based on the registration of electronic portal images, and (b) the evaluation of the proposed methodology in a clinical environment. The estimation of set-up errors, using the proposed methodology, can be accomplished by matching the portal image of the current fraction of the treatment with the portal image of the baseline treatment (reference portal image) using a nearly automated technique. The proposed registration method is tested on a number of phantom data as well as on data from four patients. The phantom data included portal images that corresponded to various positions of the phantom on the treatment couch. For each patient, a set of 30 portal images was used. For the phantom data (for both transverse and lateral portal images), the maximum absolute deviations of the translational shifts were within 1.5 mm, whereas the in-plane rotation angle error was less than 0.5 degrees. The two-way Anova revealed no statistical significant variability both within observer and between-observer measurements (P > 0.05). For the patient data, the mean values obtained with manual and the proposed registration methods were within 0.5 mm. In conclusion, the proposed registration method has been incorporated within a system, called ESTERR-PRO. Its image registration capability achieves high accuracy and both intra- and inter-user reproducibility. The system is fully operational within the Radiotherapy Department of 'HYGEIA' Hospital in Athens and it could be easily installed in any other clinical environment since it requires

  5. Patient-specific biomechanical model as whole-body CT image registration tool.

    Science.gov (United States)

    Li, Mao; Miller, Karol; Joldes, Grand Roman; Doyle, Barry; Garlapati, Revanth Reddy; Kikinis, Ron; Wittek, Adam

    2015-05-01

    Whole-body computed tomography (CT) image registration is important for cancer diagnosis, therapy planning and treatment. Such registration requires accounting for large differences between source and target images caused by deformations of soft organs/tissues and articulated motion of skeletal structures. The registration algorithms relying solely on image processing methods exhibit deficiencies in accounting for such deformations and motion. We propose to predict the deformations and movements of body organs/tissues and skeletal structures for whole-body CT image registration using patient-specific non-linear biomechanical modelling. Unlike the conventional biomechanical modelling, our approach for building the biomechanical models does not require time-consuming segmentation of CT scans to divide the whole body into non-overlapping constituents with different material properties. Instead, a Fuzzy C-Means (FCM) algorithm is used for tissue classification to assign the constitutive properties automatically at integration points of the computation grid. We use only very simple segmentation of the spine when determining vertebrae displacements to define loading for biomechanical models. We demonstrate the feasibility and accuracy of our approach on CT images of seven patients suffering from cancer and aortic disease. The results confirm that accurate whole-body CT image registration can be achieved using a patient-specific non-linear biomechanical model constructed without time-consuming segmentation of the whole-body images.

  6. SIFT and shape information incorporated into fluid model for non-rigid registration of ultrasound images.

    Science.gov (United States)

    Lu, Xuesong; Zhang, Su; Yang, Wei; Chen, Yazhu

    2010-11-01

    Non-rigid registration of ultrasound images takes an important role in image-guided radiotherapy and surgery. Intensity-based method is popular in non-rigid registration, but it is sensitive to intensity variations and has problems with matching small structure features for the existence of speckles in ultrasound images. In this paper, we develop a new algorithm integrating the intensity and feature of ultrasound images. Both global shape information and local keypoint information extracted by scale invariant feature transform (SIFT) are incorporated into intensity similarity measure as the body force of viscous fluid model in a Bayesian framework. Experiments were performed on synthetic and clinical ultrasound images of breast and kidney. It is shown that shape and keypoint information significantly improves fluid model for non-rigid registration, especially for alignment of small structure features in accuracy.

  7. Level set motion assisted non-rigid 3D image registration

    Science.gov (United States)

    Yang, Deshan; Deasy, Joseph O.; Low, Daniel A.; El Naqa, Issam

    2007-03-01

    Medical imaging applications of rigid and non-rigid elastic deformable image registration are undergoing wide scale development. Our approach determines image deformation maps through a hierarchical process, from global to local scales. Vemuri (2000) reported a registration method, based on levelset evolution theory, to morph an image along the motion gradient until it deforms to the reference image. We have applied this level set motion method as basis to iteratively compute the incremental motion fields and then we approximated the field using a higher-level affine and non-rigid motion model. In such a way, we combine sequentially the global affine motion, local affine motion and local non-rigid motion. Our method is fully automated, computationally efficient, and is able to detect large deformations if used together with multi-grid approaches, potentially yielding greater registration accuracy.

  8. A combined alignment and registration scheme of psoriasis lesion |images

    DEFF Research Database (Denmark)

    Maletti, Gabriela Mariel; Ersbøll, Bjarne Kjær

    2003-01-01

    A two-stage registration scheme of psoriasis lesion patterns is proposed. In the first stage, global rotation and translation effects of assumed equally scaled psoriasis lesion patterns are removed. In the second stage, only local translation effects are removed. In both stages a novel algorithm...

  9. Wavelet-based technique for target segmentation

    Science.gov (United States)

    Sadjadi, Firooz A.

    1995-07-01

    Segmentation of targets embedded in clutter obtained by IR imaging sensors is one of the challenging problems in automatic target recognition (ATR). In this paper a new texture-based segmentation technique is presented that uses the statistics of 2D wavelet decomposition components of the lcoal sections of the image. A measure of statistical similarity is then used to segment the image and separate the target from the background. This technique is applied on a set of real sequential IR imagery and has shown to produce a high degree of segmentation accuracy across varying ranges.

  10. A novel 3D wavelet based filter for visualizing features in noisy biological data

    Energy Technology Data Exchange (ETDEWEB)

    Moss, W C; Haase, S; Lyle, J M; Agard, D A; Sedat, J W

    2005-01-05

    We have developed a 3D wavelet-based filter for visualizing structural features in volumetric data. The only variable parameter is a characteristic linear size of the feature of interest. The filtered output contains only those regions that are correlated with the characteristic size, thus denoising the image. We demonstrate the use of the filter by applying it to 3D data from a variety of electron microscopy samples including low contrast vitreous ice cryogenic preparations, as well as 3D optical microscopy specimens.

  11. 3D nonrigid medical image registration using a new information theoretic measure

    Science.gov (United States)

    Li, Bicao; Yang, Guanyu; Coatrieux, Jean Louis; Li, Baosheng; Shu, Huazhong

    2015-11-01

    This work presents a novel method for the nonrigid registration of medical images based on the Arimoto entropy, a generalization of the Shannon entropy. The proposed method employed the Jensen-Arimoto divergence measure as a similarity metric to measure the statistical dependence between medical images. Free-form deformations were adopted as the transformation model and the Parzen window estimation was applied to compute the probability distributions. A penalty term is incorporated into the objective function to smooth the nonrigid transformation. The goal of registration is to optimize an objective function consisting of a dissimilarity term and a penalty term, which would be minimal when two deformed images are perfectly aligned using the limited memory BFGS optimization method, and thus to get the optimal geometric transformation. To validate the performance of the proposed method, experiments on both simulated 3D brain MR images and real 3D thoracic CT data sets were designed and performed on the open source elastix package. For the simulated experiments, the registration errors of 3D brain MR images with various magnitudes of known deformations and different levels of noise were measured. For the real data tests, four data sets of 4D thoracic CT from four patients were selected to assess the registration performance of the method, including ten 3D CT images for each 4D CT data covering an entire respiration cycle. These results were compared with the normalized cross correlation and the mutual information methods and show a slight but true improvement in registration accuracy.

  12. Spatially varying Riemannian elasticity regularization: Application to thoracic CT registration in image-guided radiotherapy

    DEFF Research Database (Denmark)

    Bjerre, Troels; Hansen, Mads Fogtmann; Aznar, M.;

    2012-01-01

    For deformable registration of computed tomography (CT) scans in image guided radiation therapy (IGRT) we apply Riemannian elasticity regularization. We explore the use of spatially varying elasticity parameters to encourage bone rigidity and local tissue volume change only in the gross tumor......-model we achieved a total mean target registration error (TRE) of 0.92 ± 0.49 mm. Using spatially varying regularization for the HL case, deformation was limited to the GTV and lungs....

  13. A Comparative Analysis of Exemplar Based and Wavelet Based Inpainting Technique

    Directory of Open Access Journals (Sweden)

    Vaibhav V Nalawade

    2012-06-01

    Full Text Available Image inpainting is the process of filling in of missing region so as to preserve its overall continuity. Image inpainting is manipulation and modification of an image in a form that is not easily detected. Digital image inpainting is relatively new area of research, but numerous and different approaches to tackle the inpainting problem have been proposed since the concept was first introduced. This paper compares two separate techniques viz, Exemplar based inpainting technique and Wavelet based inpainting technique, each portraying a different set of characteristics. The algorithms analyzed under exemplar technique are large object removal by exemplar based inpainting technique (Criminisi’s and modified exemplar (Cheng. The algorithm analyzed under wavelet is Chen’s visual image inpainting method. A number of examples on real and synthetic images are demonstrated to compare the results of different algorithms using both qualitative and quantitative parameters.

  14. Image to physical space registration of supine breast MRI for image guided breast surgery

    Science.gov (United States)

    Conley, Rebekah H.; Meszoely, Ingrid M.; Pheiffer, Thomas S.; Weis, Jared A.; Yankeelov, Thomas E.; Miga, Michael I.

    2014-03-01

    Breast conservation therapy (BCT) is a desirable option for many women diagnosed with early stage breast cancer and involves a lumpectomy followed by radiotherapy. However, approximately 50% of eligible women will elect for mastectomy over BCT despite equal survival benefit (provided margins of excised tissue are cancer free) due to uncertainty in outcome with regards to complete excision of cancerous cells, risk of local recurrence, and cosmesis. Determining surgical margins intraoperatively is difficult and achieving negative margins is not as robust as it needs to be, resulting in high re-operation rates and often mastectomy. Magnetic resonance images (MRI) can provide detailed information about tumor margin extents, however diagnostic images are acquired in a fundamentally different patient presentation than that used in surgery. Therefore, the high quality diagnostic MRIs taken in the prone position with pendant breast are not optimal for use in surgical planning/guidance due to the drastic shape change between preoperative images and the common supine surgical position. This work proposes to investigate the value of supine MRI in an effort to localize tumors intraoperatively using image-guidance. Mock intraoperative setups (realistic patient positioning in non-sterile environment) and preoperative imaging data were collected from a patient scheduled for a lumpectomy. The mock intraoperative data included a tracked laser range scan of the patient's breast surface, tracked center points of MR visible fiducials on the patient's breast, and tracked B-mode ultrasound and strain images. The preoperative data included a supine MRI with visible fiducial markers. Fiducial markers localized in the MRI were rigidly registered to their mock intraoperative counterparts using an optically tracked stylus. The root mean square (RMS) fiducial registration error using the tracked markers was 3.4mm. Following registration, the average closest point distance between the MR

  15. Biomechanical-based image registration for head and neck radiation treatment

    Energy Technology Data Exchange (ETDEWEB)

    Al-Mayah, Adil; Moseley, Joanne; Hunter, Shannon; Velec, Mike; Chau, Lily; Breen, Stephen; Brock, Kristy, E-mail: adil.al-mayah@rmp.uhn.on.c [Radiation Medicine Program, Princess Margaret Hospital, 610 University Ave. Toronto, Ontario, M5G 2M9 (Canada)

    2010-11-07

    Deformable image registration of four head and neck cancer patients has been conducted using a biomechanical-based model. Patient-specific 3D finite element models have been developed using CT and cone-beam CT image data of the planning and a radiation treatment session. The model consists of seven vertebrae (C1 to C7), mandible, larynx, left and right parotid glands, tumor and body. Different combinations of boundary conditions are applied in the model in order to find the configuration with a minimum registration error. Each vertebra in the planning session is individually aligned with its correspondence in the treatment session. Rigid alignment is used for each individual vertebra and the mandible since no deformation is expected in the bones. In addition, the effect of morphological differences in the external body between the two image sessions is investigated. The accuracy of the registration is evaluated using the tumor and both parotid glands by comparing the calculated Dice similarity index of these structures following deformation in relation to their true surface defined in the image of the second session. The registration is improved when the vertebrae and mandible are aligned in the two sessions with the highest average Dice index of 0.86 {+-} 0.08, 0.84 {+-} 0.11 and 0.89 {+-} 0.04 for the tumor, left and right parotid glands, respectively. The accuracy of the center of mass location of tumor and parotid glands is also improved by deformable image registration where the errors in the tumor and parotid glands decrease from 4.0 {+-} 1.1, 3.4 {+-} 1.5 and 3.8 {+-} 0.9 mm using rigid registration to 2.3 {+-} 1.0, 2.5 {+-} 0.8 and 2.0 {+-} 0.9 mm in the deformable image registration when alignment of vertebrae and mandible is conducted in addition to the surface projection of the body.

  16. Wavelet based approach for facial expression recognition

    Directory of Open Access Journals (Sweden)

    Zaenal Abidin

    2015-03-01

    Full Text Available Facial expression recognition is one of the most active fields of research. Many facial expression recognition methods have been developed and implemented. Neural networks (NNs have capability to undertake such pattern recognition tasks. The key factor of the use of NN is based on its characteristics. It is capable in conducting learning and generalizing, non-linear mapping, and parallel computation. Backpropagation neural networks (BPNNs are the approach methods that mostly used. In this study, BPNNs were used as classifier to categorize facial expression images into seven-class of expressions which are anger, disgust, fear, happiness, sadness, neutral and surprise. For the purpose of feature extraction tasks, three discrete wavelet transforms were used to decompose images, namely Haar wavelet, Daubechies (4 wavelet and Coiflet (1 wavelet. To analyze the proposed method, a facial expression recognition system was built. The proposed method was tested on static images from JAFFE database.

  17. An approach to automatic blood vessel image registration of microcirculation for blood flow analysis on nude mice.

    Science.gov (United States)

    Lin, Wen-Chen; Wu, Chih-Chieh; Zhang, Geoffrey; Wu, Tung-Hsin; Lin, Yang-Hsien; Huang, Tzung-Chi; Liu, Ren-Shyan; Lin, Kang-Ping

    2011-04-01

    Image registration is often a required and a time-consuming step in blood flow analysis of large microscopic video sequences in vivo. In order to obtain stable images for blood flow analysis, frame-to-frame image matching as a preprocessing step is a solution to the problem of movement during image acquisition. In this paper, microscopic system analysis without fluorescent labelling is performed to provide precise and continuous quantitative data of blood flow rate in individual microvessels of nude mice. The performance properties of several matching metrics are evaluated through simulated image registrations. An automatic image registration programme based on Powell's optimisation search method with low calculation redundancy was implemented. The matching method by variance of ratio is computationally efficient and improves the registration robustness and accuracy in practical application of microcirculation registration. The presented registration method shows acceptable results in close requisition to analyse red blood cell velocities, confirming the scientific potential of the system in blood flow analysis.

  18. Non-rigid image registration under non-deterministic deformation bounds

    Science.gov (United States)

    Ge, Qian; Lokare, Namita; Lobaton, Edgar

    2015-01-01

    Image registration aims to identify the mapping between corresponding locations in an anatomic structure. Most traditional approaches solve this problem by minimizing some error metric. However, they do not quantify the uncertainty behind their estimates and the feasibility of other solutions. In this work, it is assumed that two images of the same anatomic structure are related via a Lipschitz non-rigid deformation (the registration map). An approach for identifying point correspondences with zero false-negative rate and high precision is introduced under this assumption. This methodology is then extended to registration of regions in an image which is posed as a graph matching problem with geometric constraints. The outcome of this approach is a homeomorphism with uncertainty bounds characterizing its accuracy over the entire image domain. The method is tested by applying deformation maps to the LPBA40 dataset.

  19. An effective visualisation and registration system for image-guided robotic partial nephrectomy.

    Science.gov (United States)

    Pratt, Philip; Mayer, Erik; Vale, Justin; Cohen, Daniel; Edwards, Eddie; Darzi, Ara; Yang, Guang-Zhong

    2012-03-01

    Robotic partial nephrectomy is presently the fastest-growing robotic surgical procedure, and in comparison to traditional techniques it offers reduced tissue trauma and likelihood of post-operative infection, while hastening recovery time and improving cosmesis. It is also an ideal candidate for image guidance technology since soft tissue deformation, while still present, is localised and less problematic compared to other surgical procedures. This work describes the implementation and ongoing development of an effective image guidance system that aims to address some of the remaining challenges in this area. Specific innovations include the introduction of an intuitive, partially automated registration interface, and the use of a hardware platform that makes sophisticated augmented reality overlays practical in real time. Results and examples of image augmentation are presented from both retrospective and live cases. Quantitative analysis of registration error verifies that the proposed registration technique is appropriate for the chosen image guidance targets.

  20. Perspective Intensity Images for Co-Registration of Terrestrial Laser Scanner and Digital Camera

    Science.gov (United States)

    Liang, Yubin; Qiu, Yan; Cui, Tiejun

    2016-06-01

    Co-registration of terrestrial laser scanner and digital camera has been an important topic of research, since reconstruction of visually appealing and measurable models of the scanned objects can be achieved by using both point clouds and digital images. This paper presents an approach for co-registration of terrestrial laser scanner and digital camera. A perspective intensity image of the point cloud is firstly generated by using the collinearity equation. Then corner points are extracted from the generated perspective intensity image and the camera image. The fundamental matrix F is then estimated using several interactively selected tie points and used to obtain more matches with RANSAC. The 3D coordinates of all the matched tie points are directly obtained or estimated using the least squares method. The robustness and effectiveness of the presented methodology is demonstrated by the experimental results. Methods presented in this work may also be used for automatic registration of terrestrial laser scanning point clouds.

  1. On the accuracy of localization achievable in fiducial-based stereoscopic image registration system using an electronic portal imaging device.

    Science.gov (United States)

    Ung, N M; Wee, L

    2012-06-01

    Portal imaging using electronic portal imaging device (EPID) is a well-established image-guided radiation therapy (IGRT) technique for external beam radiation therapy. The aims of this study are threefold; (i) to assess the accuracy of isocentre localization in the fiducial-based stereoscopic image registration, (ii) to investigate the impact of errors in the beam collimation device on stereoscopic registration, and (iii) to evaluate the intra- and inter-observer variability in stereoscopic registration. Portal images of a ball bearing phantom were acquired and stereoscopic image registrations were performed based on a point centred in the ball bearing as the surrogate for registration. Experiments were replicated by applying intentional offsets in the beam collimation device to simulate collimation errors. The accuracy of fiducial markers localization was performed by repeating the experiment using three spherical lead shots implanted in a pelvic phantom. Portal images of pelvis phantom were given to four expert users to assess the inter-observer variability in performing registration. The isocentre localization accuracy tested using ball bearing phantom was within 0.3 mm. Gravity-induced systematic errors of beam collimation device by 2 mm resulted in positioning offsets of the order of 2 mm opposing the simulated errors. Relatively large inter-portal pair projection errors ranges from 1.3 mm to 1.8 mm were observed with simulated errors in the beam collimation device. The intra-user and inter-user variabilities were observed to be 0.8 and 0.4 mm respectively. Fiducial-based stereoscopic image registration using EPID is robust for IGRT procedure.

  2. Influence of image registration on ADC images computed from free-breathing diffusion MRIs of the abdomen

    Science.gov (United States)

    Guyader, Jean-Marie; Bernardin, Livia; Douglas, Naomi H. M.; Poot, Dirk H. J.; Niessen, Wiro J.; Klein, Stefan

    2014-03-01

    The apparent diffusion coefficient (ADC) is an imaging biomarker providing quantitative information on the diffusion of water in biological tissues. This measurement could be of relevance in oncology drug development, but it suffers from a lack of reliability. ADC images are computed by applying a voxelwise exponential fitting to multiple diffusion-weighted MR images (DW-MRIs) acquired with different diffusion gradients. In the abdomen, respiratory motion induces misalignments in the datasets, creating visible artefacts and inducing errors in the ADC maps. We propose a multistep post-acquisition motion compensation pipeline based on 3D non-rigid registrations. It corrects for motion within each image and brings all DW-MRIs to a common image space. The method is evaluated on 10 datasets of free-breathing abdominal DW-MRIs acquired from healthy volunteers. Regions of interest (ROIs) are segmented in the right part of the abdomen and measurements are compared in the three following cases: no image processing, Gaussian blurring of the raw DW-MRIs and registration. Results show that both blurring and registration improve the visual quality of ADC images, but compared to blurring, registration yields visually sharper images. Measurement uncertainty is reduced both by registration and blurring. For homogeneous ROIs, blurring and registration result in similar median ADCs, which are lower than without processing. In a ROI at the interface between liver and kidney, registration and blurring yield different median ADCs, suggesting that uncorrected motion introduces a bias. Our work indicates that averaging procedures on the scanner should be avoided, as they remove the opportunity to perform motion correction.

  3. Validation of accuracy in image co-registration with computed tomography and magnetic resonance imaging in Gamma Knife radiosurgery.

    Science.gov (United States)

    Nakazawa, Hisato; Mori, Yoshimasa; Komori, Masataka; Shibamoto, Yuta; Tsugawa, Takahiko; Kobayashi, Tatsuya; Hashizume, Chisa

    2014-09-01

    The latest version of Leksell GammaPlan (LGP) is equipped with Digital Imaging and Communication in Medicine (DICOM) image-processing functions including image co-registration. Diagnostic magnetic resonance imaging (MRI) taken prior to Gamma Knife treatment is available for virtual treatment pre-planning. On the treatment day, actual dose planning is completed on stereotactic MRI or computed tomography (CT) (with a frame) after co-registration with the diagnostic MRI and in association with the virtual dose distributions. This study assesses the accuracy of image co-registration in a phantom study and evaluates its usefulness in clinical cases. Images of three kinds of phantoms and 11 patients are evaluated. In the phantom study, co-registration errors of the 3D coordinates were measured in overall stereotactic space and compared between stereotactic CT and diagnostic CT, stereotactic MRI and diagnostic MRI, stereotactic CT and diagnostic MRI, and stereotactic MRI and diagnostic MRI co-registered with stereotactic CT. In the clinical study, target contours were compared between stereotactic MRI and diagnostic MRI co-registered with stereotactic CT. The mean errors of coordinates between images were < 1 mm in all measurement areas in both the phantom and clinical patient studies. The co-registration function implemented in LGP has sufficient geometrical accuracy to assure appropriate dose planning in clinical use. © The Author 2014. Published by Oxford University Press on behalf of The Japan Radiation Research Society and Japanese Society for Radiation Oncology.

  4. Registration of 2D to 3D joint images using phase-based mutual information

    Science.gov (United States)

    Dalvi, Rupin; Abugharbieh, Rafeef; Pickering, Mark; Scarvell, Jennie; Smith, Paul

    2007-03-01

    Registration of two dimensional to three dimensional orthopaedic medical image data has important applications particularly in the area of image guided surgery and sports medicine. Fluoroscopy to computer tomography (CT) registration is an important case, wherein digitally reconstructed radiographs derived from the CT data are registered to the fluoroscopy data. Traditional registration metrics such as intensity-based mutual information (MI) typically work well but often suffer from gross misregistration errors when the image to be registered contains a partial view of the anatomy visible in the target image. Phase-based MI provides a robust alternative similarity measure which, in addition to possessing the general robustness and noise immunity that MI provides, also employs local phase information in the registration process which makes it less susceptible to the aforementioned errors. In this paper, we propose using the complex wavelet transform for computing image phase information and incorporating that into a phase-based MI measure for image registration. Tests on a CT volume and 6 fluoroscopy images of the knee are presented. The femur and the tibia in the CT volume were individually registered to the fluoroscopy images using intensity-based MI, gradient-based MI and phase-based MI. Errors in the coordinates of fiducials present in the bone structures were used to assess the accuracy of the different registration schemes. Quantitative results demonstrate that the performance of intensity-based MI was the worst. Gradient-based MI performed slightly better, while phase-based MI results were the best consistently producing the lowest errors.

  5. Historical Image Registration and Land-Use Land-Cover Change Analysis

    OpenAIRE

    Fang-Ju Jao; Hone-Jay Chu; Yi-Hsing Tseng

    2014-01-01

    Historical aerial images are important to retain past ground surface information. The land-use land-cover change in the past can be identified using historical aerial images. Automatic historical image registration and stitching is essential because the historical image pose information was usually lost. In this study, the Scale Invariant Feature Transform (SIFT) algorithm was used for feature extraction. Subsequently, the present study used the automatic affine transformation algorithm for h...

  6. IMAGE REGISTRATION OF HIGH-RESOLUTION UAV DATA: THE NEW HYPARE ALGORITHM

    OpenAIRE

    T. Bahr; Jin, X.; Lasica, R.; Giessel, D.

    2013-01-01

    Unmanned aerial vehicles play an important role in the present-day civilian and military intelligence. Equipped with a variety of sensors, such as SAR imaging modes, E/O- and IR sensor technology, they are due to their agility suitable for many applications. Hence, the necessity arises to use fusion technologies and to develop them continuously. Here an exact image-to-image registration is essential. It serves as the basis for important image processing operations such as georeferenc...

  7. The Experimental Research on the Frameless Registration of DSA/CT Images

    Institute of Scientific and Technical Information of China (English)

    HUANG Yong-feng; LI Wen; ZENG Pei-feng; ZHAO Jun

    2006-01-01

    DSA images show vessels with clarity and CT images show bones distinctly. In this paper, we present an experimental research on the frameless registration of DSA/CT images based on localization algorithm. With four external markers, the vessels and bones in human brain can be integrated. The mean accuracy of simulated experiment is about 2.0 mm. The experiment proved that the 3D images composed cerebral anatomy and vasculature could help neurosurgeons perform accurate diagnosis and make right operation planning.

  8. Cooperative Moving Object Segmentation using Two Cameras based on Background Subtraction and Image Registration

    Directory of Open Access Journals (Sweden)

    Zhigao Cui

    2014-03-01

    Full Text Available Moving camera, such as PTZ (pan-tilt-zoom camera, has been widely applied in visual surveillance system. However, it’s difficult to extract moving objects because of the dynamic background caused by the camera motion. In this paper, a novel framework for moving object segmentation exploiting two cameras collaboration is presented by combining background subtraction and image registration method. The proposed method uses one static camera to capture large-view images at low resolution, and one moving camera (i.e. PTZ camera to capture local-view images at high resolution. Different with methods using a single moving camera, the moving objects can be effectively segmented in the static camera image by background subtraction method. Then image registration method can be applied to extract moving region in the moving camera image. To deal with the resolution and intensity discrepancy between two synchronized images, we design a practical three-step image registration method, which has higher registration accuracy than traditional feature based method. Experimental results on outdoor scene demonstrate the effectiveness and robustness of proposed approach.

  9. Comparing nonrigid registration techniques for motion corrected MR prostate diffusion imaging

    Energy Technology Data Exchange (ETDEWEB)

    Buerger, C., E-mail: christian.buerger@philips.com; Sénégas, J.; Kabus, S.; Carolus, H.; Schulz, H.; Renisch, S. [Philips Research Hamburg, Hamburg 22335 (Germany); Agarwal, H. [Philips Research North America, Briarcliff Manor, New York 10510 and Molecular Imaging Program, NCI, National Institute of Health, Bethesda, Maryland 20892 (United States); Turkbey, B.; Choyke, P. L. [Molecular Imaging Program, NCI, National Institute of Health, Bethesda, Maryland 20892 (United States)

    2015-01-15

    Purpose: T{sub 2}-weighted magnetic resonance imaging (MRI) is commonly used for anatomical visualization in the pelvis area, such as the prostate, with high soft-tissue contrast. MRI can also provide functional information such as diffusion-weighted imaging (DWI) which depicts the molecular diffusion processes in biological tissues. The combination of anatomical and functional imaging techniques is widely used in oncology, e.g., for prostate cancer diagnosis and staging. However, acquisition-specific distortions as well as physiological motion lead to misalignments between T{sub 2} and DWI and consequently to a reduced diagnostic value. Image registration algorithms are commonly employed to correct for such misalignment. Methods: The authors compare the performance of five state-of-the-art nonrigid image registration techniques for accurate image fusion of DWI with T{sub 2}. Results: Image data of 20 prostate patients with cancerous lesions or cysts were acquired. All registration algorithms were validated using intensity-based as well as landmark-based techniques. Conclusions: The authors’ results show that the “fast elastic image registration” provides most accurate results with a target registration error of 1.07 ± 0.41 mm at minimum execution times of 11 ± 1 s.

  10. Evaluating automatic registration of UAV imagery using multi-temporal ortho images

    Science.gov (United States)

    Saur, Günter; Krüger, Wolfgang

    2016-10-01

    Accurate geo-registration of acquired imagery is an important task when using unmanned aerial vehicles (UAV) for video reconnaissance and surveillance. As an example, change detection needs accurately geo-registered images for selecting and comparing co-located images taken at different points in time. One challenge using small UAVs lies in the instable flight behavior and using low-weight cameras. Thus, there is a need to stabilize and register the UAV imagery by image processing methods since using only direct approaches based on positional information coming from a GPS and attitude and acceleration measured by an inertial measurement unit (IMU) are not accurate enough. In order to improve this direct geo-registration (or "pre-registration"), image matching techniques are applied to align the UAV imagery to geo-registered reference images. The main challenge consists in matching images taken from different sensors at different day time and seasons. In this paper, we present evaluation methods for measuring the performance of image registration algorithms w.r.t. multi-temporal input data. They are based on augmenting a set of aligned image pairs by synthetic pre-registrations to an evaluation data set including truth transformations. The evaluation characteristics are based on quantiles of transformation residuals at certain control points. For a test site, video frames of a UAV mission and several ortho images from a period of 12 years are collected and synthetic pre-registrations corresponding to real flight parameters and registration errors are computed. Two algorithms A1 and A2 based on extracting key-points with a floating point descriptor (A1) and a binary descriptor (A2) are applied to the evaluation data set. As evaluation result, the algorithm A1 turned out to perform better than A2. Using affine or Helmert transformation types, both algorithms perform better than in the projective case. Furthermore, the evaluation classifies the ortho images w

  11. Synchronization and Registration of Cine Magnetic Resonance and Dynamic Computed Tomography Images of the Heart.

    Science.gov (United States)

    Betancur, Julian; Simon, Antoine; Langella, Bernard; Leclercq, Christophe; Hernandez, Alfredo; Garreau, Mireille

    2016-09-01

    The synchronization and registration of dynamic computed tomography (CT) and magnetic resonance images (MRI) of the heart is required to perform a combined analysis of their complementary information. We propose a novel method that synchronizes and registers intrapatient dynamic CT and cine-MRI short axis view (SAX). For the synchronization step, a normalized cross-correlation curve is computed from each image sequence to describe the global cardiac dynamics. The time axes of these curves are then warped using an adapted dynamic time warping (DTW) procedure. The adaptation constrains the time deformation to obtain a coherent warping function. The registration step then computes the rigid transformation that maximizes the multiimage normalized mutual information of DTW-synchronized images. The DTW synchronization and the multiimage registration were evaluated using dynamic CT and cine-SAX acquisitions from nine patients undergoing cardiac resynchronization therapy. The distance between the end-systolic phases after DTW was used to evaluate the synchronization. Mean errors, expressed as a percentage of the RR-intervals, were 3.9% and 3.7% after adapted DTW synchronization against 10.8% and 11.3% after linear synchronization, for dynamic CT and cine-SAX, respectively. This suggests that the adapted DTW synchronization leads to a coherent warping of cardiac dynamics. The multiimage registration was evaluated using fiducial points. Compared to a monoimage and a two-image registration, the multiimage registration of DTW-synchronized images obtained the lowest mean fiducial error showing that the use of dynamic voxel intensity information improves the registration.

  12. Accurate Estimation of Orientation Parameters of Uav Images Through Image Registration with Aerial Oblique Imagery

    Science.gov (United States)

    Onyango, F. A.; Nex, F.; Peter, M. S.; Jende, P.

    2017-05-01

    Unmanned Aerial Vehicles (UAVs) have gained popularity in acquiring geotagged, low cost and high resolution images. However, the images acquired by UAV-borne cameras often have poor georeferencing information, because of the low quality on-board Global Navigation Satellite System (GNSS) receiver. In addition, lightweight UAVs have a limited payload capacity to host a high quality on-board Inertial Measurement Unit (IMU). Thus, orientation parameters of images acquired by UAV-borne cameras may not be very accurate. Poorly georeferenced UAV images can be correctly oriented using accurately oriented airborne images capturing a similar scene by finding correspondences between the images. This is not a trivial task considering the image pairs have huge variations in scale, perspective and illumination conditions. This paper presents a procedure to successfully register UAV and aerial oblique imagery. The proposed procedure implements the use of the AKAZE interest operator for feature extraction in both images. Brute force is implemented to find putative correspondences and later on Lowe's ratio test (Lowe, 2004) is used to discard a significant number of wrong matches. In order to filter out the remaining mismatches, the putative correspondences are used in the computation of multiple homographies, which aid in the reduction of outliers significantly. In order to increase the number and improve the quality of correspondences, the impact of pre-processing the images using the Wallis filter (Wallis, 1974) is investigated. This paper presents the test results of different scenarios and the respective accuracies compared to a manual registration of the finally computed fundamental and essential matrices that encode the orientation parameters of the UAV images with respect to the aerial images.

  13. ACCURATE ESTIMATION OF ORIENTATION PARAMETERS OF UAV IMAGES THROUGH IMAGE REGISTRATION WITH AERIAL OBLIQUE IMAGERY

    Directory of Open Access Journals (Sweden)

    F. A. Onyango

    2017-05-01

    Full Text Available Unmanned Aerial Vehicles (UAVs have gained popularity in acquiring geotagged, low cost and high resolution images. However, the images acquired by UAV-borne cameras often have poor georeferencing information, because of the low quality on-board Global Navigation Satellite System (GNSS receiver. In addition, lightweight UAVs have a limited payload capacity to host a high quality on-board Inertial Measurement Unit (IMU. Thus, orientation parameters of images acquired by UAV-borne cameras may not be very accurate. Poorly georeferenced UAV images can be correctly oriented using accurately oriented airborne images capturing a similar scene by finding correspondences between the images. This is not a trivial task considering the image pairs have huge variations in scale, perspective and illumination conditions. This paper presents a procedure to successfully register UAV and aerial oblique imagery. The proposed procedure implements the use of the AKAZE interest operator for feature extraction in both images. Brute force is implemented to find putative correspondences and later on Lowe’s ratio test (Lowe, 2004 is used to discard a significant number of wrong matches. In order to filter out the remaining mismatches, the putative correspondences are used in the computation of multiple homographies, which aid in the reduction of outliers significantly. In order to increase the number and improve the quality of correspondences, the impact of pre-processing the images using the Wallis filter (Wallis, 1974 is investigated. This paper presents the test results of different scenarios and the respective accuracies compared to a manual registration of the finally computed fundamental and essential matrices that encode the orientation parameters of the UAV images with respect to the aerial images.

  14. Robust methods for automatic image-to-world registration in cone-beam CT interventional guidance

    Energy Technology Data Exchange (ETDEWEB)

    Dang, H.; Otake, Y.; Schafer, S.; Stayman, J. W.; Kleinszig, G.; Siewerdsen, J. H. [Department of Biomedical Engineering, Johns Hopkins University, Baltimore, Maryland 21202 (United States); Siemens Healthcare XP Division, Erlangen 91052 (Germany); Department of Biomedical Engineering, Johns Hopkins University, Baltimore, Maryland 21202 (United States)

    2012-10-15

    Purpose: Real-time surgical navigation relies on accurate image-to-world registration to align the coordinate systems of the image and patient. Conventional manual registration can present a workflow bottleneck and is prone to manual error and intraoperator variability. This work reports alternative means of automatic image-to-world registration, each method involving an automatic registration marker (ARM) used in conjunction with C-arm cone-beam CT (CBCT). The first involves a Known-Model registration method in which the ARM is a predefined tool, and the second is a Free-Form method in which the ARM is freely configurable. Methods: Studies were performed using a prototype C-arm for CBCT and a surgical tracking system. A simple ARM was designed with markers comprising a tungsten sphere within infrared reflectors to permit detection of markers in both x-ray projections and by an infrared tracker. The Known-Model method exercised a predefined specification of the ARM in combination with 3D-2D registration to estimate the transformation that yields the optimal match between forward projection of the ARM and the measured projection images. The Free-Form method localizes markers individually in projection data by a robust Hough transform approach extended from previous work, backprojected to 3D image coordinates based on C-arm geometric calibration. Image-domain point sets were transformed to world coordinates by rigid-body point-based registration. The robustness and registration accuracy of each method was tested in comparison to manual registration across a range of body sites (head, thorax, and abdomen) of interest in CBCT-guided surgery, including cases with interventional tools in the radiographic scene. Results: The automatic methods exhibited similar target registration error (TRE) and were comparable or superior to manual registration for placement of the ARM within {approx}200 mm of C-arm isocenter. Marker localization in projection data was robust across all

  15. Infrared image non-rigid registration based on regional information entropy demons algorithm

    Science.gov (United States)

    Lu, Chaoliang; Ma, Lihua; Yu, Ming; Cui, Shumin; Wu, Qingrong

    2015-02-01

    Infrared imaging fault detection which is treated as an ideal, non-contact, non-destructive testing method is applied to the circuit board fault detection. Since Infrared images obtained by handheld infrared camera with wide-angle lens have both rigid and non-rigid deformations. To solve this problem, a new demons algorithm based on regional information entropy was proposed. The new method overcame the shortcomings of traditional demons algorithm that was sensitive to the intensity. First, the information entropy image was gotten by computing regional information entropy of the image. Then, the deformation between the two images was calculated that was the same as demons algorithm. Experimental results demonstrated that the proposed algorithm has better robustness in intensity inconsistent images registration compared with the traditional demons algorithm. Achieving accurate registration between intensity inconsistent infrared images provided strong support for the temperature contrast.

  16. An efficient registration and fusion algorithm for large misalignment remote sensing images

    Science.gov (United States)

    Li, Lingling; Li, Cuihua; Zeng, Xiaoming; Li, Bao

    2007-11-01

    In this paper, an efficient technique to perform automatic registration and fusion for large misalignment remote sensing images is proposed. It complements SIFT features with Harris-affine features, and uses the ratio of the first and second nearest neighbor distance to setup the initial correspondences, then uses the affine invariant of Mahalanobis distance to remove the mismatched feature points. From this correspondence of the points, the affine matrix between two different images can be determined. All points in the sensed image are mapped to the reference using the estimated transformation matrix and the corresponding gray levels are assigned by re-sampling the image in the sensed image. Finally, we develop Burt's match and saliency metric and use neighborhood space frequency to fuse the registrated reference and sensed remote sensing images in NSCT domain. Experiments on remote sensing images with large misalignment demonstrate the superb performance of the algorithm.

  17. Image-based motion estimation for cardiac CT via image registration

    Science.gov (United States)

    Cammin, J.; Taguchi, K.

    2010-03-01

    Images reconstructed from tomographic projection data are subject to motion artifacts from organs that move during the duration of the scan. The effect can be reduced by taking the motion into account in the reconstruction algorithm if an estimate of the deformation exists. This paper presents the estimation of the three-dimensional cardiac motion by registering reconstructed images from cardiac quiet phases as a first step towards motion-compensated cardiac image reconstruction. The non-rigid deformations of the heart are parametrized on a coarse grid on the image volume and are interpolated with cubic b-splines. The optimization problem of finding b-spline coefficients that best describe the observed deformations is ill-posed due to the large number of parameters and the resulting motion vector field is sensitive to the choice of initial parameters. Particularly challenging is the task to capture the twisting motion of the heart. The motion vector field from a dynamic computer phantom of the human heart is used to initialize the transformation parameters for the optimization process with realistic starting values. The results are evaluated by comparing the registered images and the obtained motion vector field to the case when the registration is performed without using prior knowledge about the expected cardiac motion. We find that the registered images are similar for both approaches, but the motion vector field obtained from motion estimation initialized with the phantom describes the cardiac contraction and twisting motion more accurately.

  18. Image registration algorithm using Mexican hat function-based operator and grouped feature matching strategy.

    Directory of Open Access Journals (Sweden)

    Feng Jin

    Full Text Available Feature detection and matching are crucial for robust and reliable image registration. Although many methods have been developed, they commonly focus on only one class of image features. The methods that combine two or more classes of features are still novel and significant. In this work, methods for feature detection and matching are proposed. A Mexican hat function-based operator is used for image feature detection, including the local area detection and the feature point detection. For the local area detection, we use the Mexican hat operator for image filtering, and then the zero-crossing points are extracted and merged into the area borders. For the feature point detection, the Mexican hat operator is performed in scale space to get the key points. After the feature detection, an image registration is achieved by using the two classes of image features. The feature points are grouped according to a standardized region that contains correspondence to the local area, precise registration is achieved eventually by the grouped points. An image transformation matrix is estimated by the feature points in a region and then the best one is chosen through competition of a set of the transformation matrices. This strategy has been named the Grouped Sample Consensus (GCS. The GCS has also ability for removing the outliers effectively. The experimental results show that the proposed algorithm has high registration accuracy and small computational volume.

  19. Curvelet-based sampling for accurate and efficient multimodal image registration

    Science.gov (United States)

    Safran, M. N.; Freiman, M.; Werman, M.; Joskowicz, L.

    2009-02-01

    We present a new non-uniform adaptive sampling method for the estimation of mutual information in multi-modal image registration. The method uses the Fast Discrete Curvelet Transform to identify regions along anatomical curves on which the mutual information is computed. Its main advantages of over other non-uniform sampling schemes are that it captures the most informative regions, that it is invariant to feature shapes, orientations, and sizes, that it is efficient, and that it yields accurate results. Extensive evaluation on 20 validated clinical brain CT images to Proton Density (PD) and T1 and T2-weighted MRI images from the public RIRE database show the effectiveness of our method. Rigid registration accuracy measured at 10 clinical targets and compared to ground truth measurements yield a mean target registration error of 0.68mm(std=0.4mm) for CT-PD and 0.82mm(std=0.43mm) for CT-T2. This is 0.3mm (1mm) more accurate in the average (worst) case than five existing sampling methods. Our method has the lowest registration errors recorded to date for the registration of CT-PD and CT-T2 images in the RIRE website when compared to methods that were tested on at least three patient datasets.

  20. Nonrigid registration algorithm for longitudinal breast MR images and the preliminary analysis of breast tumor response

    Science.gov (United States)

    Li, Xia; Dawant, Benoit M.; Welch, E. Brian; Chakravarthy, A. Bapsi; Freehardt, Darla; Mayer, Ingrid; Kelley, Mark; Meszoely, Ingrid; Gore, John C.; Yankeelov, Thomas E.

    2009-02-01

    Although useful for the detection of breast cancers, conventional imaging methods, including mammography and ultrasonography, do not provide adequate information regarding response to therapy. Dynamic contrast enhanced MRI (DCE-MRI) has emerged as a promising technique to provide relevant information on tumor status. Consequently, accurate longitudinal registration of breast MR images is critical for the comparison of changes induced by treatment at the voxel level. In this study, a nonrigid registration algorithm is proposed to allow for longitudinal registration of breast MR images obtained throughout the course of treatment. We accomplish this by modifying the adaptive bases algorithm (ABA) through adding a tumor volume preserving constraint in the cost function. The registration results demonstrate the proposed algorithm can successfully register the longitudinal breast MR images and permit analysis of the parameter maps. We also propose a novel validation method to evaluate the proposed registration algorithm quantitatively. These validations also demonstrate that the proposed algorithm constrains tumor deformation well and performs better than the unconstrained ABA algorithm.

  1. Non-Rigid Image Registration Algorithm Based on B-Splines Approximation

    Institute of Scientific and Technical Information of China (English)

    ZHANG Hongying; ZHANG Jiawan; SUN Jizhou; SUN Yigang

    2007-01-01

    An intensity-based non-rigid registration algorithm is discussed, which uses Gaussian smoothing to constrain the transformation to be smooth, and thus preserves the topology of images. In view of the insufficiency of the uniform Gaussian filtering of the deformation field, an automatic and accurate non-rigid image registration method based on B-splines approximation is proposed. The regularization strategy is adopted by using multi-level B-splines approximation to regularize the dis-placement fields in a coarse-to-fine manner. Moreover, it assigns the different weights to the estimated displacements according to their reliabilities. In this way, the level of regularity can be adapted locally. Experiments were performed on both synthetic and real medical images of brain, and the results show that the proposed method improves the registration accuracy and robustness.

  2. The registration of dual-modality ship target images based on edge extraction

    Science.gov (United States)

    Zhang, Weimin; Wang, Risheng; Zhou, Fugen

    2014-11-01

    In this paper, we study the problem of visible and IR(infrared) ship target image registration with scale changes. We mainly focus on the infrared and visible image feature extraction and matching method. A method based on Force Field Transformation is used to determine the ship target contour area. Canny edge detection method is applied to obtain the edge features. During the process of image registration, we take the cross-correlation as the similarity measure and propose an improved Powell algorithm based on multi-scale searching to optimize the registration parameters. Through the edge fusion results, we can see the corresponding edges are almost overlapped, indicating that the method could achieve satisfying results. Also the average error distance of match is less than one pixel.

  3. Adaptive robust image registration approach based on adequately sampling polar transform and weighted angular projection function

    Science.gov (United States)

    Wei, Zhao; Tao, Feng; Jun, Wang

    2013-10-01

    An efficient, robust, and accurate approach is developed for image registration, which is especially suitable for large-scale change and arbitrary rotation. It is named the adequately sampling polar transform and weighted angular projection function (ASPT-WAPF). The proposed ASPT model overcomes the oversampling problem of conventional log-polar transform. Additionally, the WAPF presented as the feature descriptor is robust to the alteration in the fovea area of an image, and reduces the computational cost of the following registration process. The experimental results show two major advantages of the proposed method. First, it can register images with high accuracy even when the scale factor is up to 10 and the rotation angle is arbitrary. However, the maximum scaling estimated by the state-of-the-art algorithms is 6. Second, our algorithm is more robust to the size of the sampling region while not decreasing the accuracy of the registration.

  4. A Porcine Liver Model for Validation of Registration Accuracy in Image-Guided Surgery

    Science.gov (United States)

    Peterhans, Matthias; Dagon, Benoît; Berg, Anne Vom; Inderbitzin, Daniel; Baur, Charles; Weber, Stefan

    Correct registration between pre-operative high-resolution images and intra-operative data of lower detail is a fundamental requirement in image-guided liver surgery. We propose a multi modality liver model for measuring the accuracy of such registration methods. A freshly explanted porcine liver is artificially perfused by a peristaltic pump and liver motion is simulated by means of inflatable objects positioned around the liver. Co-registered ultrasound and CT data sets are acquired in different deformation scenarios and allow compar-ing registration outcomes with a CT data set serving as ground truth. The pre-sent work describes the experimental setup and summarizes the results from ultrasound and CT imaging.

  5. Medical image registration algorithms assesment Bronze Standard application enactment on grids using the MOTEUR workflow engine

    CERN Document Server

    Glatard, T; Pennec, X

    2006-01-01

    Medical image registration is pre-processing needed for many medical image analysis procedures. A very large number of registration algorithms are available today, but their performance is often not known and very difficult to assess due to the lack of gold standard. The Bronze Standard algorithm is a very data and compute intensive statistical approach for quantifying registration algorithms accuracy. In this paper, we describe the Bronze Standard application and we discuss the need for grids to tackle such computations on medical image databases. We demonstrate MOTEUR, a service-based workflow engine optimized for dealing with data intensive applications. MOTEUR eases the enactment of the Bronze Standard and similar applications on the EGEE production grid infrastructure. It is a generic workflow engine, based on current standards and freely available, that can be used to instrument legacy application code at low cost.

  6. Enhanced ATM Security using Biometric Authentication and Wavelet Based AES

    OpenAIRE

    Sreedharan Ajish

    2016-01-01

    The traditional ATM terminal customer recognition systems rely only on bank cards, passwords and such identity verification methods are not perfect and functions are too single. Biometrics-based authentication offers several advantages over other authentication methods, there has been a significant surge in the use of biometrics for user authentication in recent years. This paper presents a highly secured ATM banking system using biometric authentication and wavelet based Advanced Encryption ...

  7. Classification of Underwater Signals Using Wavelet-Based Decompositions

    Science.gov (United States)

    1998-06-01

    proposed by Learned and Willsky [21], uses the SVD information obtained from the power mapping, the second one selects the most within-a-class...34 SPIE, Vol. 2242, pp. 792-802, Wavelet Applications, 1994 [14] R. Coifman and D. Donoho, "Translation-Invariant Denoising ," Internal Report...J. Barsanti, Jr., Denoising of Ocean Acoustic Signals Using Wavelet-Based Techniques, MSEE Thesis, Naval Postgraduate School, Monterey, California

  8. Efficient 3-D medical image registration using a distributed blackboard architecture.

    Science.gov (United States)

    Tait, Roger J; Schaefer, Gerald; Hopgood, Adrian A; Zhu, Shao Ying

    2006-01-01

    A major drawback of 3-D medical image registration techniques is the performance bottleneck associated with re-sampling and similarity computation. Such bottlenecks limit registration applications in clinical situations where fast execution times are required and become particularly apparent in the case of registering 3-D data sets. In this paper a novel framework for high performance intensity-based volume registration is presented. Geometric alignment of both reference and sensed volume sets is achieved through a combination of scaling, translation, and rotation. Crucially, resampling and similarity computation is performed intelligently by a set of knowledge sources. The knowledge sources work in parallel and communicate with each other by means of a distributed blackboard architecture. Partitioning of the blackboard is used to balance communication and processing workloads. Large-scale registrations with substantial speedups, when compared with a conventional implementation, have been demonstrated.

  9. GPU-accelerated Block Matching Algorithm for Deformable Registration of Lung CT Images.

    Science.gov (United States)

    Li, Min; Xiang, Zhikang; Xiao, Liang; Castillo, Edward; Castillo, Richard; Guerrero, Thomas

    2015-12-01

    Deformable registration (DR) is a key technology in the medical field. However, many of the existing DR methods are time-consuming and the registration accuracy needs to be improved, which prevents their clinical applications. In this study, we propose a parallel block matching algorithm for lung CT image registration, in which the sum of squared difference metric is modified as the cost function and the moving least squares approach is used to generate the full displacement field. The algorithm is implemented on Graphic Processing Unit (GPU) with the Compute Unified Device Architecture (CUDA). Results show that the proposed parallel block matching method achieves a fast runtime while maintaining an average registration error (standard deviation) of 1.08 (0.69) mm.

  10. WAVELET-BASED FINE GRANULARITY SCALABLE VIDEO CODING

    Institute of Scientific and Technical Information of China (English)

    Zhang Jiangshan; Zhu Guangxi

    2003-01-01

    This letter proposes an efficient wavelet-based Fine Granularity Scalable (FGS)coding scheme, where the base layer is encoded with a newly designed wavelet-based coder, and the enhancement layer is encoded with Progressive Fine Granularity Scalable (PFGS) coding.This algorithm involves multi-frame motion compensation, rate-distortion optimizing strategy with Lagrangian cost function and context-based adaptive arithmetic coding. In order to improve efficiency of the enhancement layer coding, an improved motion estimation scheme that uses both information from the base layer and the enhancement layer is also proposed in this letter. The wavelet-based coder significantly improves the coding efficiency of the base layer compared with MPEG-4 ASP (Advanced Simple Profile) and H.26L TML9. The PFGS coding is a significant improvement over MPEG-4 FGS coding at the enhancement layer. Experiments show that single layer coding efficiency gain of the proposed scheme is about 2.0-3.0dB and 0.3-1.0dB higher than that of MPEG-4 ASP and H.26L TML9, respectively. The overall coding efficiency gain of the proposed scheme is about 4.0-5.0dB higher than that of MPEG-4 FGS.

  11. Fast Wavelet-Based Visual Classification

    CERN Document Server

    Yu, Guoshen

    2008-01-01

    We investigate a biologically motivated approach to fast visual classification, directly inspired by the recent work of Serre et al. Specifically, trading-off biological accuracy for computational efficiency, we explore using wavelet and grouplet-like transforms to parallel the tuning of visual cortex V1 and V2 cells, alternated with max operations to achieve scale and translation invariance. A feature selection procedure is applied during learning to accelerate recognition. We introduce a simple attention-like feedback mechanism, significantly improving recognition and robustness in multiple-object scenes. In experiments, the proposed algorithm achieves or exceeds state-of-the-art success rate on object recognition, texture and satellite image classification, language identification and sound classification.

  12. A strategy for multimodal deformable image registration to integrate PET/MR into radiotherapy treatment planning

    Energy Technology Data Exchange (ETDEWEB)

    Leibfarth, Sara; Moennich, David; Thorwarth, Daniela [Section for Biomedical Physics, Dept. of Radiation Oncology, Univ. Hospital Tuebingen, Tuebingen (Germany)], e-mail: Sara.Leibfarth@med.uni-tuebingen.de; Welz, Stefan; Siegel, Christine; Zips, Daniel [Dept. of Radiation Oncology, Univ. Hospital Tuebingen, Tuebingen (Germany); Schwenzer, Nina [Dept. of Diagnostic and Interventional Radiology, Univ. Hospital Tuebingen, Tuebingen (Germany); Holger Schmidt, Holger [Dept. of Diagnostic and Interventional Radiology, Univ. Hospital Tuebingen, Tuebingen (Germany); Lab. for Preclinical Imaging and Imaging Technology of the Werner Siemens Foundation, Dept. of Preclinical Imaging and Radiopharmacy, Tuebingen (Germany)

    2013-10-15

    Background: Combined positron emission tomography (PET)/magnetic resonance imaging (MRI) is highly promising for biologically individualized radiotherapy (RT). Hence, the purpose of this work was to develop an accurate and robust registration strategy to integrate combined PET/MR data into RT treatment planning. Material and methods: Eight patient datasets consisting of an FDG PET/computed tomography (CT) and a subsequently acquired PET/MR of the head and neck (HN) region were available. Registration strategies were developed based on CT and MR data only, whereas the PET components were fused with the resulting deformation field. Following a rigid registration, deformable registration was performed with a transform parametrized by B-splines. Three different optimization metrics were investigated: global mutual information (GMI), GMI combined with a bending energy penalty (BEP) for regularization (GMI + BEP) and localized mutual information with BEP (LMI + BEP). Different quantitative registration quality measures were developed, including volumetric overlap and mean distance measures for structures segmented on CT and MR as well as anatomical landmark distances. Moreover, the local registration quality in the tumor region was assessed by the normalized cross correlation (NCC) of the two PET datasets. Results: LMI + BEP yielded the most robust and accurate registration results. For GMI, GMI + BEP and LMI + BEP, mean landmark distances (standard deviations) were 23.9 mm (15.5 mm), 4.8 mm (4.0 mm) and 3.0 mm (1.0 mm), and mean NCC values (standard deviations) were 0.29 (0.29), 0.84 (0.14) and 0.88 (0.06), respectively. Conclusion: Accurate and robust multimodal deformable image registration of CT and MR in the HN region can be performed using a B-spline parametrized transform and LMI + BEP as optimization metric. With this strategy, biologically individualized RT based on combined PET/MRI in terms of dose painting is possible.

  13. Deformable image registration for cone-beam CT guided transoral robotic base-of-tongue surgery

    Science.gov (United States)

    Reaungamornrat, S.; Liu, W. P.; Wang, A. S.; Otake, Y.; Nithiananthan, S.; Uneri, A.; Schafer, S.; Tryggestad, E.; Richmon, J.; Sorger, J. M.; Siewerdsen, J. H.; Taylor, R. H.

    2013-07-01

    Transoral robotic surgery (TORS) offers a minimally invasive approach to resection of base-of-tongue tumors. However, precise localization of the surgical target and adjacent critical structures can be challenged by the highly deformed intraoperative setup. We propose a deformable registration method using intraoperative cone-beam computed tomography (CBCT) to accurately align preoperative CT or MR images with the intraoperative scene. The registration method combines a Gaussian mixture (GM) model followed by a variation of the Demons algorithm. First, following segmentation of the volume of interest (i.e. volume of the tongue extending to the hyoid), a GM model is applied to surface point clouds for rigid initialization (GM rigid) followed by nonrigid deformation (GM nonrigid). Second, the registration is refined using the Demons algorithm applied to distance map transforms of the (GM-registered) preoperative image and intraoperative CBCT. Performance was evaluated in repeat cadaver studies (25 image pairs) in terms of target registration error (TRE), entropy correlation coefficient (ECC) and normalized pointwise mutual information (NPMI). Retraction of the tongue in the TORS operative setup induced gross deformation >30 mm. The mean TRE following the GM rigid, GM nonrigid and Demons steps was 4.6, 2.1 and 1.7 mm, respectively. The respective ECC was 0.57, 0.70 and 0.73, and NPMI was 0.46, 0.57 and 0.60. Registration accuracy was best across the superior aspect of the tongue and in proximity to the hyoid (by virtue of GM registration of surface points on these structures). The Demons step refined registration primarily in deeper portions of the tongue further from the surface and hyoid bone. Since the method does not use image intensities directly, it is suitable to multi-modality registration of preoperative CT or MR with intraoperative CBCT. Extending the 3D image registration to the fusion of image and planning data in stereo-endoscopic video is anticipated to

  14. Improving supervised classification accuracy using non-rigid multimodal image registration: detecting prostate cancer

    Science.gov (United States)

    Chappelow, Jonathan; Viswanath, Satish; Monaco, James; Rosen, Mark; Tomaszewski, John; Feldman, Michael; Madabhushi, Anant

    2008-03-01

    Computer-aided diagnosis (CAD) systems for the detection of cancer in medical images require precise labeling of training data. For magnetic resonance (MR) imaging (MRI) of the prostate, training labels define the spatial extent of prostate cancer (CaP); the most common source for these labels is expert segmentations. When ancillary data such as whole mount histology (WMH) sections, which provide the gold standard for cancer ground truth, are available, the manual labeling of CaP can be improved by referencing WMH. However, manual segmentation is error prone, time consuming and not reproducible. Therefore, we present the use of multimodal image registration to automatically and accurately transcribe CaP from histology onto MRI following alignment of the two modalities, in order to improve the quality of training data and hence classifier performance. We quantitatively demonstrate the superiority of this registration-based methodology by comparing its results to the manual CaP annotation of expert radiologists. Five supervised CAD classifiers were trained using the labels for CaP extent on MRI obtained by the expert and 4 different registration techniques. Two of the registration methods were affi;ne schemes; one based on maximization of mutual information (MI) and the other method that we previously developed, Combined Feature Ensemble Mutual Information (COFEMI), which incorporates high-order statistical features for robust multimodal registration. Two non-rigid schemes were obtained by succeeding the two affine registration methods with an elastic deformation step using thin-plate splines (TPS). In the absence of definitive ground truth for CaP extent on MRI, classifier accuracy was evaluated against 7 ground truth surrogates obtained by different combinations of the expert and registration segmentations. For 26 multimodal MRI-WMH image pairs, all four registration methods produced a higher area under the receiver operating characteristic curve compared to that

  15. SU-E-J-237: Image Feature Based DRR and Portal Image Registration

    Energy Technology Data Exchange (ETDEWEB)

    Wang, X; Chang, J [NY Weill Cornell Medical Ctr, NY (United States)

    2014-06-01

    Purpose: Two-dimensional (2D) matching of the kV X-ray and digitally reconstructed radiography (DRR) images is an important setup technique for image-guided radiotherapy (IGRT). In our clinics, mutual information based methods are used for this purpose on commercial linear accelerators, but with often needs for manual corrections. This work proved the feasibility that feature based image transform can be used to register kV and DRR images. Methods: The scale invariant feature transform (SIFT) method was implemented to detect the matching image details (or key points) between the kV and DRR images. These key points represent high image intensity gradients, and thus the scale invariant features. Due to the poor image contrast from our kV image, direct application of the SIFT method yielded many detection errors. To assist the finding of key points, the center coordinates of the kV and DRR images were read from the DICOM header, and the two groups of key points with similar relative positions to their corresponding centers were paired up. Using these points, a rigid transform (with scaling, horizontal and vertical shifts) was estimated. We also artificially introduced vertical and horizontal shifts to test the accuracy of our registration method on anterior-posterior (AP) and lateral pelvic images. Results: The results provided a satisfactory overlay of the transformed kV onto the DRR image. The introduced vs. detected shifts were fit into a linear regression. In the AP image experiments, linear regression analysis showed a slope of 1.15 and 0.98 with an R2 of 0.89 and 0.99 for the horizontal and vertical shifts, respectively. The results are 1.2 and 1.3 with R2 of 0.72 and 0.82 for the lateral image shifts. Conclusion: This work provided an alternative technique for kV to DRR alignment. Further improvements in the estimation accuracy and image contrast tolerance are underway.

  16. Implementation of Image Registration Algorithms for Real-time Target Tracking Through Video Sequences

    Directory of Open Access Journals (Sweden)

    Jharna Majumdar

    2002-07-01

    Full Text Available "Automatic detection and tracking of interesting targets from a sequence of images obtained from a reconnaissance platform is an interesting area of research for defence-related applications. Image registration is the basic step used in target tracking application. The paper briefly reviews some of the image registration algorithms, analyse their performance using a suitable image processing hardware, and selects the most suitable algorithm for a real-time target tracking application using cubic-spline model and spline model Kalman filter for the prediction of an occluded target. The algorithms developed are implemented in a ground-based image exploitation system (GIES developed at the Aeronautical Development Establishment for unmanned aerial vehicle application, and the results presented for the images obtained during actual flight trial.

  17. Deformable image registration for geometrical evaluation of DIBH radiotherapy treatment of lung cancer patients

    DEFF Research Database (Denmark)

    Ottosson, Wiviann; Lykkegaard Andersen, J. A.; Borrisova, S.

    2014-01-01

    Respiration and anatomical variation during radiotherapy (RT) of lung cancer yield dosimetric uncertainties of the delivered dose, possibly affecting the clinical outcome if not corrected for. Adaptive radiotherapy (ART), based on deformable image registration (DIR) and Deep-Inspiration-Breath-Ho......Respiration and anatomical variation during radiotherapy (RT) of lung cancer yield dosimetric uncertainties of the delivered dose, possibly affecting the clinical outcome if not corrected for. Adaptive radiotherapy (ART), based on deformable image registration (DIR) and Deep....... Delineations of anatomical structures were performed on each image set. The CT images were retrospective rigidly and deformable registered to all obtained images using the Varian Smart Adapt v. 11.0. The registered images were analysed for volume change and Dice Similarity Coefficient (DSC). Result...

  18. Evaluation of various Deformable Image Registrations for Point and Volume Variations

    CERN Document Server

    Han, Su Chul; Park, Seungwoo; Lee, Soon Sung; Jung, Haijo; Kim, Mi-Sook; Yoo, Hyung Jun; Ji, Young Hoon; Yi, Chul Young; Kim, Kum Bae

    2015-01-01

    The accuracy of deformable image registration (DIR) has a significant dosimetric impact in radiation treatment planning. We evaluated accuracy of various DIR algorithms using variations of the deformation point and volume. The reference image (Iref) and volume (Vref) was first generated with virtual deformation QA software (ImSimQA, Oncology System Limited, UK). We deformed Iref with axial movement of deformation point and Vref depending on the types of deformation that are the deformation1 is to increase the Vref (relaxation) and the deformation 2 is to decrease . The deformed image (Idef) and volume (Vdef) acquired by ImSimQA software were inversely deformed to Iref and Vref using DIR algorithms. As a result, we acquired deformed image (Iid) from Idef and volume (Vid) from Vdef. The DIR algorithms were the Horn Schunk optical flow (HS), Iterative Optical Flow (IOF), Modified Demons (MD) and Fast Demons (FD) with the Deformable Image Registration and Adaptive Radiotherapy Toolkit (DIRART) of MATLAB. The imag...

  19. 3D non-rigid registration using surface and local salient features for transrectal ultrasound image-guided prostate biopsy

    Science.gov (United States)

    Yang, Xiaofeng; Akbari, Hamed; Halig, Luma; Fei, Baowei

    2011-03-01

    We present a 3D non-rigid registration algorithm for the potential use in combining PET/CT and transrectal ultrasound (TRUS) images for targeted prostate biopsy. Our registration is a hybrid approach that simultaneously optimizes the similarities from point-based registration and volume matching methods. The 3D registration is obtained by minimizing the distances of corresponding points at the surface and within the prostate and by maximizing the overlap ratio of the bladder neck on both images. The hybrid approach not only capture deformation at the prostate surface and internal landmarks but also the deformation at the bladder neck regions. The registration uses a soft assignment and deterministic annealing process. The correspondences are iteratively established in a fuzzy-to-deterministic approach. B-splines are used to generate a smooth non-rigid spatial transformation. In this study, we tested our registration with pre- and postbiopsy TRUS images of the same patients. Registration accuracy is evaluated using manual defined anatomic landmarks, i.e. calcification. The root-mean-squared (RMS) of the difference image between the reference and floating images was decreased by 62.6+/-9.1% after registration. The mean target registration error (TRE) was 0.88+/-0.16 mm, i.e. less than 3 voxels with a voxel size of 0.38×0.38×0.38 mm3 for all five patients. The experimental results demonstrate the robustness and accuracy of the 3D non-rigid registration algorithm.

  20. The role of regularization in deformable image registration for head and neck adaptive radiotherapy.

    Science.gov (United States)

    Ciardo, D; Peroni, M; Riboldi, M; Alterio, D; Baroni, G; Orecchia, R

    2013-08-01

    Deformable image registration provides a robust mathematical framework to quantify morphological changes that occur along the course of external beam radiotherapy treatments. As clinical reliability of deformable image registration is not always guaranteed, algorithm regularization is commonly introduced to prevent sharp discontinuities in the quantified deformation and achieve anatomically consistent results. In this work we analyzed the influence of regularization on two different registration methods, i.e. B-Splines and Log Domain Diffeomorphic Demons, implemented in an open-source platform. We retrospectively analyzed the simulation computed tomography (CTsim) and the corresponding re-planning computed tomography (CTrepl) scans in 30 head and neck cancer patients. First, we investigated the influence of regularization levels on hounsfield units (HU) information in 10 test patients for each considered method. Then, we compared the registration results of the open-source implementation at selected best performing regularization levels with a clinical commercial software on the remaining 20 patients in terms of mean volume overlap, surface and center of mass distances between manual outlines and propagated structures. The regularized B-Splines method was not statistically different from the commercial software. The tuning of the regularization parameters allowed open-source algorithms to achieve better results in deformable image registration for head and neck patients, with the additional benefit of a framework where regularization can be tuned on a patient specific basis.

  1. MatchGUI: A Graphical MATLAB-Based Tool for Automatic Image Co-Registration

    Science.gov (United States)

    Ansar, Adnan I.

    2011-01-01

    MatchGUI software, based on MATLAB, automatically matches two images and displays the match result by superimposing one image on the other. A slider bar allows focus to shift between the two images. There are tools for zoom, auto-crop to overlap region, and basic image markup. Given a pair of ortho-rectified images (focused primarily on Mars orbital imagery for now), this software automatically co-registers the imagery so that corresponding image pixels are aligned. MatchGUI requires minimal user input, and performs a registration over scale and inplane rotation fully automatically

  2. Automated registration of multispectral MR vessel wall images of the carotid artery

    Energy Technology Data Exchange (ETDEWEB)

    Klooster, R. van ' t; Staring, M.; Reiber, J. H. C.; Lelieveldt, B. P. F.; Geest, R. J. van der, E-mail: rvdgeest@lumc.nl [Department of Radiology, Division of Image Processing, Leiden University Medical Center, 2300 RC Leiden (Netherlands); Klein, S. [Department of Radiology and Department of Medical Informatics, Biomedical Imaging Group Rotterdam, Erasmus MC, Rotterdam 3015 GE (Netherlands); Kwee, R. M.; Kooi, M. E. [Department of Radiology, Cardiovascular Research Institute Maastricht, Maastricht University Medical Center, Maastricht 6202 AZ (Netherlands)

    2013-12-15

    Purpose: Atherosclerosis is the primary cause of heart disease and stroke. The detailed assessment of atherosclerosis of the carotid artery requires high resolution imaging of the vessel wall using multiple MR sequences with different contrast weightings. These images allow manual or automated classification of plaque components inside the vessel wall. Automated classification requires all sequences to be in alignment, which is hampered by patient motion. In clinical practice, correction of this motion is performed manually. Previous studies applied automated image registration to correct for motion using only nondeformable transformation models and did not perform a detailed quantitative validation. The purpose of this study is to develop an automated accurate 3D registration method, and to extensively validate this method on a large set of patient data. In addition, the authors quantified patient motion during scanning to investigate the need for correction. Methods: MR imaging studies (1.5T, dedicated carotid surface coil, Philips) from 55 TIA/stroke patients with ipsilateral <70% carotid artery stenosis were randomly selected from a larger cohort. Five MR pulse sequences were acquired around the carotid bifurcation, each containing nine transverse slices: T1-weighted turbo field echo, time of flight, T2-weighted turbo spin-echo, and pre- and postcontrast T1-weighted turbo spin-echo images (T1W TSE). The images were manually segmented by delineating the lumen contour in each vessel wall sequence and were manually aligned by applying throughplane and inplane translations to the images. To find the optimal automatic image registration method, different masks, choice of the fixed image, different types of the mutual information image similarity metric, and transformation models including 3D deformable transformation models, were evaluated. Evaluation of the automatic registration results was performed by comparing the lumen segmentations of the fixed image and

  3. Image navigation and registration performance assessment tool set for the GOES-R Advanced Baseline Imager and Geostationary Lightning Mapper

    Science.gov (United States)

    De Luccia, Frank J.; Houchin, Scott; Porter, Brian C.; Graybill, Justin; Haas, Evan; Johnson, Patrick D.; Isaacson, Peter J.; Reth, Alan D.

    2016-05-01

    The GOES-R Flight Project has developed an Image Navigation and Registration (INR) Performance Assessment Tool Set (IPATS) for measuring Advanced Baseline Imager (ABI) and Geostationary Lightning Mapper (GLM) INR performance metrics in the post-launch period for performance evaluation and long term monitoring. For ABI, these metrics are the 3-sigma errors in navigation (NAV), channel-to-channel registration (CCR), frame-to-frame registration (FFR), swath-to-swath registration (SSR), and within frame registration (WIFR) for the Level 1B image products. For GLM, the single metric of interest is the 3-sigma error in the navigation of background images (GLM NAV) used by the system to navigate lightning strikes. 3-sigma errors are estimates of the 99. 73rd percentile of the errors accumulated over a 24 hour data collection period. IPATS utilizes a modular algorithmic design to allow user selection of data processing sequences optimized for generation of each INR metric. This novel modular approach minimizes duplication of common processing elements, thereby maximizing code efficiency and speed. Fast processing is essential given the large number of sub-image registrations required to generate INR metrics for the many images produced over a 24 hour evaluation period. Another aspect of the IPATS design that vastly reduces execution time is the off-line propagation of Landsat based truth images to the fixed grid coordinates system for each of the three GOES-R satellite locations, operational East and West and initial checkout locations. This paper describes the algorithmic design and implementation of IPATS and provides preliminary test results.

  4. Intrasubject registration for change analysis in medical imaging

    NARCIS (Netherlands)

    Staring, M.

    2008-01-01

    Image matching is important for the comparison of medical images. Comparison is of clinical relevance for the analysis of differences due to changes in the health of a patient. For example, when a disease is imaged at two time points, then one wants to know if it is stable, has regressed, or

  5. Multi-sensor image registration using multi-resolution shape analysis

    Institute of Scientific and Technical Information of China (English)

    2006-01-01

    Multi-sensor image registration has been widely used in remote sensing and medical image field, but registration performance is degenerated when heterogeneous images are involved. An image registration method based on multi-resolution shape analysis is proposed in this paper, to deal with the problem that the shape of similar objects is always invariant. The contours of shapes are first detected as visual features using an extended contour search algorithm in order to reduce effects of noise, and the multi-resolution shape descriptor is constructed through Fourier curvature representation of the contour's chain code. Then a minimum distance function is used to judge the similarity between two contours. To avoid the effect of different resolution and intensity distribution, suitable resolution of each image is selected by maximizing the consistency of its pyramid shapes. Finally,the transformation parameters are estimated based on the matched control-point pairs which are the centers of gravity of the closed contours. Multi-sensor Landsat TM imagery and infrared imagery have been used as experimental data for comparison with the classical contour-based registration. Our results have been shown to be superior to the classical ones.

  6. A novel scheme for automatic nonrigid image registration using deformation invariant feature and geometric constraint

    Science.gov (United States)

    Deng, Zhipeng; Lei, Lin; Zhou, Shilin

    2015-10-01

    Automatic image registration is a vital yet challenging task, particularly for non-rigid deformation images which are more complicated and common in remote sensing images, such as distorted UAV (unmanned aerial vehicle) images or scanning imaging images caused by flutter. Traditional non-rigid image registration methods are based on the correctly matched corresponding landmarks, which usually needs artificial markers. It is a rather challenging task to locate the accurate position of the points and get accurate homonymy point sets. In this paper, we proposed an automatic non-rigid image registration algorithm which mainly consists of three steps: To begin with, we introduce an automatic feature point extraction method based on non-linear scale space and uniform distribution strategy to extract the points which are uniform distributed along the edge of the image. Next, we propose a hybrid point matching algorithm using DaLI (Deformation and Light Invariant) descriptor and local affine invariant geometric constraint based on triangulation which is constructed by K-nearest neighbor algorithm. Based on the accurate homonymy point sets, the two images are registrated by the model of TPS (Thin Plate Spline). Our method is demonstrated by three deliberately designed experiments. The first two experiments are designed to evaluate the distribution of point set and the correctly matching rate on synthetic data and real data respectively. The last experiment is designed on the non-rigid deformation remote sensing images and the three experimental results demonstrate the accuracy, robustness, and efficiency of the proposed algorithm compared with other traditional methods.

  7. Co-registration of ultrasound and frequency-domain photoacoustic radar images and image improvement for tumor detection

    Science.gov (United States)

    Dovlo, Edem; Lashkari, Bahman; Choi, Sung soo Sean; Mandelis, Andreas

    2015-03-01

    This paper demonstrates the co-registration of ultrasound (US) and frequency domain photoacoustic radar (FD-PAR) images with significant image improvement from applying image normalization, filtering and amplification techniques. Achieving PA imaging functionality on a commercial Ultrasound instrument could accelerate clinical acceptance and use. Experimental results presented demonstrate live animal testing and show enhancements in signal-to-noise ratio (SNR), contrast and spatial resolution. The co-registered image produced from the US and phase PA images, provides more information than both images independently.

  8. Methods for fine registration of cadastre graphs to images.

    Science.gov (United States)

    Trias-Sanz, Roger; Pierrot-Deseilligny, Marc; Louchet, Jean; Stamon, Georges

    2007-11-01

    We propose two algorithms to match edges in a geometrically-imprecise graph to geometrically-precise strong boundaries in an image, where the graph is meant to give an a priori partition of the image into objects. This can be used to partition an image into objects described by imprecise external data, and thus to simplify the segmentation problem. We apply them to the problem of registering cadastre data to georeferenced aerial images, thus correcting the lack of geometrical detail of the cadastre data, and the fact that cadastre data gives information of a different nature than that found in images (fiscal information as opposed to actual land use).

  9. A SAR IMAGE REGISTRATION METHOD BASED ON SIFT ALGORITHM

    Directory of Open Access Journals (Sweden)

    W. Lu

    2017-09-01

    Full Text Available In order to improve the stability and rapidity of synthetic aperture radar (SAR images matching, an effective method was presented. Firstly, the adaptive smoothing filtering was employed for image denoising in image processing based on Wallis filtering to avoid the follow-up noise is amplified. Secondly, feature points were extracted by a simplified SIFT algorithm. Finally, the exact matching of the images was achieved with these points. Compared with the existing methods, it not only maintains the richness of features, but a-lso reduces the noise of the image. The simulation results show that the proposed algorithm can achieve better matching effect.

  10. a SAR Image Registration Method Based on Sift Algorithm

    Science.gov (United States)

    Lu, W.; Yue, X.; Zhao, Y.; Han, C.

    2017-09-01

    In order to improve the stability and rapidity of synthetic aperture radar (SAR) images matching, an effective method was presented. Firstly, the adaptive smoothing filtering was employed for image denoising in image processing based on Wallis filtering to avoid the follow-up noise is amplified. Secondly, feature points were extracted by a simplified SIFT algorithm. Finally, the exact matching of the images was achieved with these points. Compared with the existing methods, it not only maintains the richness of features, but a-lso reduces the noise of the image. The simulation results show that the proposed algorithm can achieve better matching effect.

  11. GPU-accelerated elastic 3D image registration for intra-surgical applications.

    Science.gov (United States)

    Ruijters, Daniel; ter Haar Romeny, Bart M; Suetens, Paul

    2011-08-01

    Local motion within intra-patient biomedical images can be compensated by using elastic image registration. The application of B-spline based elastic registration during interventional treatment is seriously hampered by its considerable computation time. The graphics processing unit (GPU) can be used to accelerate the calculation of such elastic registrations by using its parallel processing power, and by employing the hardwired tri-linear interpolation capabilities in order to efficiently perform the cubic B-spline evaluation. In this article it is shown that the similarity measure and its derivatives also can be calculated on the GPU, using a two pass approach. On average a speedup factor 50 compared to a straight-forward CPU implementation was reached.

  12. A Contour-Guided Deformable Image Registration Algorithm for Adaptive Radiotherapy

    CERN Document Server

    Gu, Xuejun; Wang, Jing; Yordy, John; Mell, Loren; Jia, Xun; Jiang, Steve B

    2013-01-01

    In adaptive radiotherapy, deformable image registration is often conducted between the planning CT and treatment CT (or cone beam CT) to generate a deformation vector field (DVF) for dose accumulation and contour propagation. The auto propagated contours on the treatment CT may contain relatively large errors, especially in low contrast regions. A clinician inspection and editing of the propagated contours are frequently needed. The edited contours are able to meet the clinical requirement for adaptive therapy; however, the DVF is still inaccurate and inconsistent with the edited contours. The purpose of this work is to develop a contour-guided deformable image registration (CG-DIR) algorithm to improve the accuracy and consistency of the DVF for adaptive radiotherapy. Incorporation of the edited contours into the registration algorithm is realized by regularizing the objective function of the original demons algorithm with a term of intensity matching between the delineated structures set pairs. The CG-DIR a...

  13. PROBABILISTIC NON-RIGID REGISTRATION OF PROSTATE IMAGES: MODELING AND QUANTIFYING UNCERTAINTY

    Science.gov (United States)

    Risholm, Petter; Fedorov, Andriy; Pursley, Jennifer; Tuncali, Kemal; Cormack, Robert; Wells, William M.

    2012-01-01

    Registration of pre- to intra-procedural prostate images needs to handle the large changes in position and shape of the prostate caused by varying rectal filling and patient positioning. We describe a probabilistic method for non-rigid registration of prostate images which can quantify the most probable deformation as well as the uncertainty of the estimated deformation. The method is based on a biomechanical Finite Element model which treats the prostate as an elastic material. We use a Markov Chain Monte Carlo sampler to draw deformation configurations from the posterior distribution. In practice, we simultaneously estimate the boundary conditions (surface displacements) and the internal deformations of our biomechanical model. The proposed method was validated on a clinical MRI dataset with registration results comparable to previously published methods, but with the added benefit of also providing uncertainty estimates which may be important to take into account during prostate biopsy and brachytherapy procedures. PMID:22288004

  14. Multimodal image registration using floating regressors in the joint intensity scatter plot.

    Science.gov (United States)

    Orchard, Jeff

    2008-08-01

    This paper presents a new approach for multimodal medical image registration and compares it to normalized mutual information (NMI) and the correlation ratio (CR). Like NMI and CR, the new method's measure of registration quality is based on the distribution of points in the joint intensity scatter plot (JISP); compact clusters indicate good registration. This method iteratively fits the JISP clusters with regressors (in the form of points and line segments), and uses those regressors to efficiently compute the next motion increment. The result is a striking, dynamic process in which the regressors float around the JISP, tracking groups of points as they contract into tight clusters. One of the method's strengths is that it is intuitive and customizable, offering a multitude of ways to incorporate prior knowledge to guide the registration process. Moreover, the method is adaptive, and can adjust itself to fit data that does not quite match the prior model. Finally, the method is efficiently expandable to higher-dimensional scatter plots, avoiding the "curse of dimensionality" inherent in histogram-based registration methods such as MI and NMI. In two sets of experiments, a simple implementation of the new registration framework is shown to be comparable to (if not superior to) state-of-the-art implementations of NMI and CR in both accuracy and convergence robustness.

  15. Registration of clinical volumes to beams-eye-view images for real-time tracking

    Energy Technology Data Exchange (ETDEWEB)

    Bryant, Jonathan H.; Rottmann, Joerg; Lewis, John H.; Mishra, Pankaj; Berbeco, Ross I., E-mail: rberbeco@lroc.harvard.edu [Department of Radiation Oncology, Brigham and Women’s Hospital, Dana-Farber Cancer Institute and Harvard Medical School, Boston, Massachusetts 02115 (United States); Keall, Paul J. [Radiation Physics Laboratory, Sydney Medical School, University of Sydney, Sydney, New South Wales 2006 (Australia)

    2014-12-15

    Purpose: The authors combine the registration of 2D beam’s eye view (BEV) images and 3D planning computed tomography (CT) images, with relative, markerless tumor tracking to provide automatic absolute tracking of physician defined volumes such as the gross tumor volume (GTV). Methods: During treatment of lung SBRT cases, BEV images were continuously acquired with an electronic portal imaging device (EPID) operating in cine mode. For absolute registration of physician-defined volumes, an intensity based 2D/3D registration to the planning CT was performed using the end-of-exhale (EoE) phase of the four dimensional computed tomography (4DCT). The volume was converted from Hounsfield units into electron density by a calibration curve and digitally reconstructed radiographs (DRRs) were generated for each beam geometry. Using normalized cross correlation between the DRR and an EoE BEV image, the best in-plane rigid transformation was found. The transformation was applied to physician-defined contours in the planning CT, mapping them into the EPID image domain. A robust multiregion method of relative markerless lung tumor tracking quantified deviations from the EoE position. Results: The success of 2D/3D registration was demonstrated at the EoE breathing phase. By registering at this phase and then employing a separate technique for relative tracking, the authors are able to successfully track target volumes in the BEV images throughout the entire treatment delivery. Conclusions: Through the combination of EPID/4DCT registration and relative tracking, a necessary step toward the clinical implementation of BEV tracking has been completed. The knowledge of tumor volumes relative to the treatment field is important for future applications like real-time motion management, adaptive radiotherapy, and delivered dose calculations.

  16. An Improved InSAR Image Co-Registration Method for Pairs with Relatively Big Distortions or Large Incoherent Areas

    Directory of Open Access Journals (Sweden)

    Zhenwei Chen

    2016-09-01

    Full Text Available Co-registration is one of the most important steps in interferometric synthetic aperture radar (InSAR data processing. The standard offset-measurement method based on cross-correlating uniformly distributed patches takes no account of specific geometric transformation between images or characteristics of ground scatterers. Hence, it is inefficient and difficult to obtain satisfying co-registration results for image pairs with relatively big distortion or large incoherent areas. Given this, an improved co-registration strategy is proposed in this paper which takes both the geometric features and image content into consideration. Firstly, some geometric transformations including scale, flip, rotation, and shear between images were eliminated based on the geometrical information, and the initial co-registration polynomial was obtained. Then the registration points were automatically detected by integrating the signal-to-clutter-ratio (SCR thresholds and the amplitude information, and a further co-registration process was performed to refine the polynomial. Several comparison experiments were carried out using 2 TerraSAR-X data from the Hong Kong airport and 21 PALSAR data from the Donghai Bridge. Experiment results demonstrate that the proposed method brings accuracy and efficiency improvements for co-registration and processing abilities in the cases of big distortion between images or large incoherent areas in the images. For most co-registrations, the proposed method can enhance the reliability and applicability of co-registration and thus promote the automation to a higher level.

  17. An Improved InSAR Image Co-Registration Method for Pairs with Relatively Big Distortions or Large Incoherent Areas.

    Science.gov (United States)

    Chen, Zhenwei; Zhang, Lei; Zhang, Guo

    2016-09-17

    Co-registration is one of the most important steps in interferometric synthetic aperture radar (InSAR) data processing. The standard offset-measurement method based on cross-correlating uniformly distributed patches takes no account of specific geometric transformation between images or characteristics of ground scatterers. Hence, it is inefficient and difficult to obtain satisfying co-registration results for image pairs with relatively big distortion or large incoherent areas. Given this, an improved co-registration strategy is proposed in this paper which takes both the geometric features and image content into consideration. Firstly, some geometric transformations including scale, flip, rotation, and shear between images were eliminated based on the geometrical information, and the initial co-registration polynomial was obtained. Then the registration points were automatically detected by integrating the signal-to-clutter-ratio (SCR) thresholds and the amplitude information, and a further co-registration process was performed to refine the polynomial. Several comparison experiments were carried out using 2 TerraSAR-X data from the Hong Kong airport and 21 PALSAR data from the Donghai Bridge. Experiment results demonstrate that the proposed method brings accuracy and efficiency improvements for co-registration and processing abilities in the cases of big distortion between images or large incoherent areas in the images. For most co-registrations, the proposed method can enhance the reliability and applicability of co-registration and thus promote the automation to a higher level.

  18. Cortical region of interest definition on SPECT brain images using X-ray CT registration

    Energy Technology Data Exchange (ETDEWEB)

    Tzourio, N.; Sutton, D. (Commissariat a l' Energie Atomique, Orsay (France). Service Hospitalier Frederic Joliot); Joliot, M. (Commissariat a l' Energie Atomique, Orsay (France). Service Hospitalier Frederic Joliot INSERM, Orsay (France)); Mazoyer, B.M. (Commissariat a l' Energie Atomique, Orsay (France). Service Hospitalier Frederic Joliot Antenne d' Information Medicale, C.H.U. Bichat, Paris (France)); Charlot, V. (Hopital Louis Mourier, Colombes (France). Service de Psychiatrie); Salamon, G. (CHU La Timone, Marseille (France). Service de Neuroradiologie)

    1992-11-01

    We present a method for brain single photon emission computed tomography (SPECT) analysis based on individual registration of anatomical (CT) and functional ([sup 133]Xe regional cerebral blood flow) images and on the definition of three-dimensional functional regions of interest. Registration of CT and SPECT is performed through adjustment of CT-defined cortex limits to the SPECT image. Regions are defined by sectioning a cortical ribbon on the CT images, copied over the SPECT images and pooled through slices to give 3D cortical regions of interest. The proposed method shows good intra- and interobserver reproducibility (regional intraclass correlation coefficient [approx equal]0.98), and good accuracy in terms of repositioning ([approx equal]3.5 mm) as compared to the SPECT image resolution (14 mm). The method should be particularly useful for analysing SPECT studies when variations in brain anatomy (normal or abnormal) must be accounted for. (orig.).

  19. A general technique for interstudy registration of multifunction and multimodality images

    Energy Technology Data Exchange (ETDEWEB)

    Lin, K.P.; Huang, S.C.; Bacter, L.R.; Phelps, M.E. (Univ. of California, Los Angeles, CA (United States). School of Medicine)

    1994-12-01

    A technique that can register anatomic/structural brain images (e.g., MRI) with various functional images (e.g., PET-FDG and PET-FDOPA) of the same subject has been developed. The procedure of this technique includes the following steps: (1) segmentation of MRI brain images into gray matter (GM), white matter (WM), cerebral spinal fluid (CSF), and, muscle (MS) components, (2) assignment of appropriate radio-tracer concentrations to various components depending on the kind of functional image that is being registered, (3) generation of simulated functional images to have a spatial resolution that is comparable to that of the measured ones, (4) alignment of the measured functional images to the simulated ones that are based on MRI images. A self-organization clustering method is used to segment the MRI images. The image alignment is based on the criterion of least squares of the pixel-by-pixel differences between the two sets of images that are being matched and on the Powell's algorithm for minimization. The technique was applied successfully for registering the MRI, PET-FDG, and PET-FDOPA images. This technique offers a general solution to the registration of structural images to functional images and to the registration of different functional images of markedly different distributions.

  20. Computed tomography lung iodine contrast mapping by image registration and subtraction

    Science.gov (United States)

    Goatman, Keith; Plakas, Costas; Schuijf, Joanne; Beveridge, Erin; Prokop, Mathias

    2014-03-01

    Pulmonary embolism (PE) is a relatively common and potentially life threatening disease, affecting around 600,000 people annually in the United States alone. Prompt treatment using anticoagulants is effective and saves lives, but unnecessary treatment risks life threatening haemorrhage. The specificity of any diagnostic test for PE is therefore as important as its sensitivity. Computed tomography (CT) angiography is routinely used to diagnose PE. However, there are concerns it may over-report the condition. Additional information about the severity of an occlusion can be obtained from an iodine contrast map that represents tissue perfusion. Such maps tend to be derived from dual-energy CT acquisitions. However, they may also be calculated by subtracting pre- and post-contrast CT scans. Indeed, there are technical advantages to such a subtraction approach, including better contrast-to-noise ratio for the same radiation dose, and bone suppression. However, subtraction relies on accurate image registration. This paper presents a framework for the automatic alignment of pre- and post-contrast lung volumes prior to subtraction. The registration accuracy is evaluated for seven subjects for whom pre- and post-contrast helical CT scans were acquired using a Toshiba Aquilion ONE scanner. One hundred corresponding points were annotated on the pre- and post-contrast scans, distributed throughout the lung volume. Surface-to-surface error distances were also calculated from lung segmentations. Prior to registration the mean Euclidean landmark alignment error was 2.57mm (range 1.43-4.34 mm), and following registration the mean error was 0.54mm (range 0.44-0.64 mm). The mean surface error distance was 1.89mm before registration and 0.47mm after registration. There was a commensurate reduction in visual artefacts following registration. In conclusion, a framework for pre- and post-contrast lung registration has been developed that is sufficiently accurate for lung subtraction

  1. Localization and registration accuracy in image guided neurosurgery: a clinical study.

    Science.gov (United States)

    Shamir, Reuben R; Joskowicz, Leo; Spektor, Sergey; Shoshan, Yigal

    2009-01-01

    To measure and compare the clinical localization and registration errors in image-guided neurosurgery, with the purpose of revising current assumptions. Twelve patients who underwent brain surgeries with a navigation system were randomly selected. A neurosurgeon localized and correlated the landmarks on preoperative MRI images and on the intraoperative physical anatomy with a tracked pointer. In the laboratory, we generated 612 scenarios in which one landmark pair was defined as the target and the remaining ones were used to compute the registration transformation. Four errors were measured: (1) fiducial localization error (FLE); (2) target registration error (TRE); (3) fiducial registration error (FRE); (4) Fitzpatrick's target registration error estimation (F-TRE). We compared the different errors and computed their correlation. The image and physical FLE ranges were 0.5-2.0 and 1.6-3.0 mm, respectively. The measured TRE, FRE and F-TRE were 4.1 +/- 1.6, 3.9 +/- 1.2, and 3.7 +/- 2.2 mm, respectively. Low correlations of 0.19 and 0.37 were observed between the FRE and TRE and between the F-TRE and the TRE, respectively. The differences of the FRE and F-TRE from the TRE were 1.3 +/- 1.0 mm (max = 5.5 mm) and 1.3 +/- 1.2 mm (max = 7.3 mm), respectively. Contrary to common belief, the FLE presents significant variations. Moreover, both the FRE and the F-TRE are poor indicators of the TRE in image-to-patient registration.

  2. Image registration via level-set motion: applications to atlas-based segmentation.

    Science.gov (United States)

    Vemuri, B C; Ye, J; Chen, Y; Leonard, C M

    2003-03-01

    Image registration is an often encountered problem in various fields including medical imaging, computer vision and image processing. Numerous algorithms for registering image data have been reported in these areas. In this paper, we present a novel curve evolution approach expressed in a level-set framework to achieve image intensity morphing and a simple non-linear PDE for the corresponding coordinate registration. The key features of the intensity morphing model are that (a) it is very fast and (b) existence and uniqueness of the solution for the evolution model are established in a Sobolev space as opposed to using viscosity methods. The salient features of the coordinate registration model are its simplicity and computational efficiency. The intensity morph is easily achieved via evolving level-sets of one image into the level-sets of the other. To explicitly estimate the coordinate transformation between the images, we derive a non-linear PDE-based motion model which can be solved very efficiently. We demonstrate the performance of our algorithm on a variety of images including synthetic and real data. As an application of the PDE-based motion model, atlas based segmentation of hippocampal shape from several MR brain scans is depicted. In each of these experiments, automated hippocampal shape recovery results are validated via manual "expert" segmentations.

  3. Wide-area image restoration using a new iterative registration method

    Science.gov (United States)

    Fraser, Donald; Lambert, Andrew J.

    2000-11-01

    Over a wide field of view (e.g., 100 arcsec in optical astronomy) the point spread function due to atmospheric effects is found to be far form position invariant, and appears as a combination of local warping and local blurring. Recently, we discussed a method in which the first step in restoration is to register all points in every frame of a movie sequence to the corresponding points in a prototype image. After registration, each frame is de- warped and summed to form an average, motion-blur corrected result. Previously, we applied a hierarchical, windowed cross correlation process to obtain local x and y registration information, similar to common methods in stereo cartography. We discuss a new approach to image registration for this purpose. Suppose two images to be registered differ mainly in varying random, but spatially coherent warping (such as occurs as one effect of a slowly varying wavefront tip-tilt over a wide field of vies). Imagine that one image, the reference image, is represented by a solid surface corresponding to its intensity distribution. Imagine that the second image is also represented by a surface, but in the form of a flexible, rubber mold. If the two images are identical, then the mold fits the solid like a glove. If one image includes local warping relative to the other, then the mold or glove must be forced to fit though local distortions.

  4. Three-dimensional nonrigid landmark-based magnetic resonance to transrectal ultrasound registration for image-guided prostate biopsy.

    Science.gov (United States)

    Sun, Yue; Qiu, Wu; Yuan, Jing; Romagnoli, Cesare; Fenster, Aaron

    2015-04-01

    Registration of three-dimensional (3-D) magnetic resonance (MR) to 3-D transrectal ultrasound (TRUS) prostate images is an important step in the planning and guidance of 3-D TRUS guided prostate biopsy. In order to accurately and efficiently perform the registration, a nonrigid landmark-based registration method is required to account for the different deformations of the prostate when using these two modalities. We describe a nonrigid landmark-based method for registration of 3-D TRUS to MR prostate images. The landmark-based registration method first makes use of an initial rigid registration of 3-D MR to 3-D TRUS images using six manually placed approximately corresponding landmarks in each image. Following manual initialization, the two prostate surfaces are segmented from 3-D MR and TRUS images and then nonrigidly registered using the following steps: (1) rotationally reslicing corresponding segmented prostate surfaces from both 3-D MR and TRUS images around a specified axis, (2) an approach to find point correspondences on the surfaces of the segmented surfaces, and (3) deformation of the surface of the prostate in the MR image to match the surface of the prostate in the 3-D TRUS image and the interior using a thin-plate spline algorithm. The registration accuracy was evaluated using 17 patient prostate MR and 3-D TRUS images by measuring the target registration error (TRE). Experimental results showed that the proposed method yielded an overall mean TRE of [Formula: see text] for the rigid registration and [Formula: see text] for the nonrigid registration, which is favorably comparable to a clinical requirement for an error of less than 2.5 mm. A landmark-based nonrigid 3-D MR-TRUS registration approach is proposed, which takes into account the correspondences on the prostate surface, inside the prostate, as well as the centroid of the prostate. Experimental results indicate that the proposed method yields clinically sufficient accuracy.

  5. PCA and level set based non-rigid image registration for MRI and Paxinos-Watson atlas of rat brain

    Science.gov (United States)

    Cai, Chao; Liu, Ailing; Ding, Mingyue; Zhou, Chengping

    2007-12-01

    Image registration provides the ability to geometrically align one dataset with another. It is a basic task in a great variety of biomedical imaging applications. This paper introduced a novel three-dimensional registration method for Magnetic Resonance Image (MRI) and Paxinos-Watson Atlas of rat brain. For the purpose of adapting to a large range and non-linear deformation between MRI and atlas in higher registration accuracy, based on the segmentation of rat brain, we chose the principle components analysis (PCA) automatically performing the linear registration, and then, a level set based nonlinear registration correcting some small distortions. We implemented this registration method in a rat brain 3D reconstruction and analysis system. Experiments have demonstrated that this method can be successfully applied to registering the low resolution and noise affection MRI with Paxinos-Watson Atlas of rat brain.

  6. Experimental examination of similarity measures and preprocessing methods used for image registration

    Science.gov (United States)

    Svedlow, M.; Mcgillem, C. D.; Anuta, P. E.

    1976-01-01

    The criterion used to measure the similarity between images and thus find the position where the images are registered is examined. The three similarity measures considered are the correlation coefficient, the sum of the absolute differences, and the correlation function. Three basic types of preprocessing are then discussed: taking the magnitude of the gradient of the images, thresholding the images at their medians, and thresholding the magnitude of the gradient of the images at an arbitrary level to be determined experimentally. These multitemporal registration techniques are applied to remote imagery of agricultural areas.

  7. TU-CD-BRA-01: A Novel 3D Registration Method for Multiparametric Radiological Images

    Energy Technology Data Exchange (ETDEWEB)

    Akhbardeh, A [The Russell H. Morgan Department of Radiology and Radiological Sciences, The Johns Hopkins University School of Medicine, Baltimore, MD (United States); Parekth, VS [Department of Computer Science, The Johns Hopkins University, Baltimore, MD (United States); Jacobs, MA [The Russell H. Morgan Department of Radiology and Radiological Sciences and Sidney Kimmel Comprehensive Cancer Center, The Johns Hopkins University School of Medicine, Sparks, MD (United States)

    2015-06-15

    Purpose: Multiparametric and multimodality radiological imaging methods, such as, magnetic resonance imaging(MRI), computed tomography(CT), and positron emission tomography(PET), provide multiple types of tissue contrast and anatomical information for clinical diagnosis. However, these radiological modalities are acquired using very different technical parameters, e.g.,field of view(FOV), matrix size, and scan planes, which, can lead to challenges in registering the different data sets. Therefore, we developed a hybrid registration method based on 3D wavelet transformation and 3D interpolations that performs 3D resampling and rotation of the target radiological images without loss of information Methods: T1-weighted, T2-weighted, diffusion-weighted-imaging(DWI), dynamic-contrast-enhanced(DCE) MRI and PET/CT were used in the registration algorithm from breast and prostate data at 3T MRI and multimodality(PET/CT) cases. The hybrid registration scheme consists of several steps to reslice and match each modality using a combination of 3D wavelets, interpolations, and affine registration steps. First, orthogonal reslicing is performed to equalize FOV, matrix sizes and the number of slices using wavelet transformation. Second, angular resampling of the target data is performed to match the reference data. Finally, using optimized angles from resampling, 3D registration is performed using similarity transformation(scaling and translation) between the reference and resliced target volume is performed. After registration, the mean-square-error(MSE) and Dice Similarity(DS) between the reference and registered target volumes were calculated. Results: The 3D registration method registered synthetic and clinical data with significant improvement(p<0.05) of overlap between anatomical structures. After transforming and deforming the synthetic data, the MSE and Dice similarity were 0.12 and 0.99. The average improvement of the MSE in breast was 62%(0.27 to 0.10) and prostate was

  8. A first step toward uncovering the truth about weight tuning in deformable image registration

    NARCIS (Netherlands)

    K. Pirpinia (Kleopatra); P.A.N. Bosman (Peter); J.-J. Sonke (Jan-Jakob); M. van Herk (Marcel); T. Alderliesten (Tanja)

    2016-01-01

    textabstractDeformable image registration is currently predominantly solved by optimizing a weighted linear combination of objectives. Successfully tuning the weights associated with these objectives is not trivial, leading to trial-and-error approaches. Such an approach assumes an intuitive

  9. Physical Simulator of Infrared Spectroradiometer with Spatial Resolution Enhancement Using Subpixel Image Registration and Processing

    Directory of Open Access Journals (Sweden)

    Lyalko, V.І.

    2015-11-01

    Full Text Available The mathematical and physical models of the new frame infrared spectroradiometer based on microbolometer array sensor with subpixel image registration are presented. It is planned to include the radiometer into onboard instrumentation of the future «Sich» satellite system for the land surface physical characterization by enhanced spatial resolution infrared space imagery.

  10. Rigid registration of CT, MR and cryosection images using a GLCM framework

    DEFF Research Database (Denmark)

    Bro-Nielsen, Morten; Grimson, E.; Mosges, R.

    1997-01-01

    The majority of the available rigid registration measures are based on a 2-dimensional histogram of corresponding grey-values in the registered images. This paper shows that these features are similar to a family of texture measures based on grey level co-occurrence matrices (GLCM). Features from...

  11. Registration of Urban Aerial Image and LiDAR Based on Line Vectors

    Directory of Open Access Journals (Sweden)

    Qinghong Sheng

    2017-09-01

    Full Text Available In a traditional registration of a single aerial image with airborne light detection and ranging (LiDAR data using linear features that regard line direction as a control or linear features as constraints in the solution, lacking the constraint of linear position leads to the error propagation of the adjustment model. To solve this problem, this paper presents a line vector-based registration mode (LVR in which image rays and LiDAR lines are expressed by a line vector that integrates the line direction and the line position. A registration equation of line vector is set up by coplanar imaging rays and corresponding control lines. Three types of datasets consisting of synthetic, theInternational Society for Photogrammetry and Remote Sensing (ISPRS test project, and real aerial data are used. A group of progressive experiments is undertaken to evaluate the robustness of the LVR. Experimental results demonstrate that the integrated line direction and the line position contributes a great deal to the theoretical and real accuracies of the unknowns, as well as the stability of the adjustment model. This paper provides a new suggestion that, for a single image and LiDAR data, registration in urban areas can be accomplished by accommodating rich line features.

  12. Co-Registration of Multitemporal Uav Image Datasets for Monitoring Applications: a New Approach

    Science.gov (United States)

    Aicardi, I.; Nyapwere, N.; Nex, F.; Gerke, M.; Lingua, A. M.; Koeva, M. N.

    2016-06-01

    In the last years we have witnessed a rapid development of UAVs (Unmanned Aerial Vehicles), especially for image collection. One of the advantages is the possibility to perform high resolution and repeated flights in a cheap way to detect changes over time. Thus, dynamic scenes can be monitored acquiring image blocks in different epochs in a flexible way. Anyway, most of UAVs are not able to provide accurate direct geo-referencing information, so image blocks from different epochs still need to be co-registered to efficiently detect changes. This task is mostly completed using GCPs (Ground Control Points), although this approach is time consuming as manual intervention is needed. This paper aims at investigating new techniques to automate the co-registration of image blocks without the use of GCPs, just relying on an image based co-registration (IBCR) approach. The image alignment is initially performed on a reference (anchor) epoch and the registration of the following (slave) epochs is performed including some (anchor) images from the reference epoch with fixed external orientation parameters. This allows constraining the Bundle Block Adjustment of the slave epoch to be consistent with the reference one. The study involved the use of 10 multi-temporal image block over a large building construction site, and spanning a time frame of 2 years. Different tests have been performed for the reference image choice with a manual approach and then evaluating the reached accuracy. The performed tests on the chosen test site have shown that the accuracy of the proposed methodology provides results comparable to the common GCPs registration approach.

  13. CO-REGISTRATION OF MULTITEMPORAL UAV IMAGE DATASETS FOR MONITORING APPLICATIONS: A NEW APPROACH

    Directory of Open Access Journals (Sweden)

    I. Aicardi

    2016-06-01

    Full Text Available In the last years we have witnessed a rapid development of UAVs (Unmanned Aerial Vehicles, especially for image collection. One of the advantages is the possibility to perform high resolution and repeated flights in a cheap way to detect changes over time. Thus, dynamic scenes can be monitored acquiring image blocks in different epochs in a flexible way. Anyway, most of UAVs are not able to provide accurate direct geo-referencing information, so image blocks from different epochs still need to be co-registered to efficiently detect changes. This task is mostly completed using GCPs (Ground Control Points, although this approach is time consuming as manual intervention is needed. This paper aims at investigating new techniques to automate the co-registration of image blocks without the use of GCPs, just relying on an image based co-registration (IBCR approach. The image alignment is initially performed on a reference (anchor epoch and the registration of the following (slave epochs is performed including some (anchor images from the reference epoch with fixed external orientation parameters. This allows constraining the Bundle Block Adjustment of the slave epoch to be consistent with the reference one. The study involved the use of 10 multi-temporal image block over a large building construction site, and spanning a time frame of 2 years. Different tests have been performed for the reference image choice with a manual approach and then evaluating the reached accuracy. The performed tests on the chosen test site have shown that the accuracy of the proposed methodology provides results comparable to the common GCPs registration approach.

  14. An Image-Based Approach for the Co-Registration of Multi-Temporal UAV Image Datasets

    Directory of Open Access Journals (Sweden)

    Irene Aicardi

    2016-09-01

    Full Text Available During the past years, UAVs (Unmanned Aerial Vehicles became very popular as low-cost image acquisition platforms since they allow for high resolution and repetitive flights in a flexible way. One application is to monitor dynamic scenes. However, the fully automatic co-registration of the acquired multi-temporal data still remains an open issue. Most UAVs are not able to provide accurate direct image georeferencing and the co-registration process is mostly performed with the manual introduction of ground control points (GCPs, which is time consuming, costly and sometimes not possible at all. A new technique to automate the co-registration of multi-temporal high resolution image blocks without the use of GCPs is investigated in this paper. The image orientation is initially performed on a reference epoch and the registration of the following datasets is achieved including some anchor images from the reference data. The interior and exterior orientation parameters of the anchor images are then fixed in order to constrain the Bundle Block Adjustment of the slave epoch to be aligned with the reference one. The study involved the use of two different datasets acquired over a construction site and a post-earthquake damaged area. Different tests have been performed to assess the registration procedure using both a manual and an automatic approach for the selection of anchor images. The tests have shown that the procedure provides results comparable to the traditional GCP-based strategy and both the manual and automatic selection of the anchor images can provide reliable results.

  15. A Frequency Domain Approach to Registration of Aliased Images with Application to Super-resolution

    Directory of Open Access Journals (Sweden)

    Vandewalle Patrick

    2006-01-01

    Full Text Available Super-resolution algorithms reconstruct a high-resolution image from a set of low-resolution images of a scene. Precise alignment of the input images is an essential part of such algorithms. If the low-resolution images are undersampled and have aliasing artifacts, the performance of standard registration algorithms decreases. We propose a frequency domain technique to precisely register a set of aliased images, based on their low-frequency, aliasing-free part. A high-resolution image is then reconstructed using cubic interpolation. Our algorithm is compared to other algorithms in simulations and practical experiments using real aliased images. Both show very good visual results and prove the attractivity of our approach in the case of aliased input images. A possible application is to digital cameras where a set of rapidly acquired images can be used to recover a higher-resolution final image.

  16. A fast inverse consistent deformable image registration method based on symmetric optical flow computation

    Science.gov (United States)

    Yang, Deshan; Li, Hua; Low, Daniel A.; Deasy, Joseph O.; El Naqa, Issam

    2008-11-01

    Deformable image registration is widely used in various radiation therapy applications including daily treatment planning adaptation to map planned tissue or dose to changing anatomy. In this work, a simple and efficient inverse consistency deformable registration method is proposed with aims of higher registration accuracy and faster convergence speed. Instead of registering image I to a second image J, the two images are symmetrically deformed toward one another in multiple passes, until both deformed images are matched and correct registration is therefore achieved. In each pass, a delta motion field is computed by minimizing a symmetric optical flow system cost function using modified optical flow algorithms. The images are then further deformed with the delta motion field in the positive and negative directions respectively, and then used for the next pass. The magnitude of the delta motion field is forced to be less than 0.4 voxel for every pass in order to guarantee smoothness and invertibility for the two overall motion fields that are accumulating the delta motion fields in both positive and negative directions, respectively. The final motion fields to register the original images I and J, in either direction, are calculated by inverting one overall motion field and combining the inversion result with the other overall motion field. The final motion fields are inversely consistent and this is ensured by the symmetric way that registration is carried out. The proposed method is demonstrated with phantom images, artificially deformed patient images and 4D-CT images. Our results suggest that the proposed method is able to improve the overall accuracy (reducing registration error by 30% or more, compared to the original and inversely inconsistent optical flow algorithms), reduce the inverse consistency error (by 95% or more) and increase the convergence rate (by 100% or more). The overall computation speed may slightly decrease, or increase in most cases

  17. A fast inverse consistent deformable image registration method based on symmetric optical flow computation

    Energy Technology Data Exchange (ETDEWEB)

    Yang Deshan; Li Hua; Low, Daniel A; Deasy, Joseph O; Naqa, Issam El [Department of Radiation Oncology, School of Medicine, Washington University in St. Louis, 4921 Parkview Place, LL, St. Louis, MO 63110 (United States)

    2008-11-07

    Deformable image registration is widely used in various radiation therapy applications including daily treatment planning adaptation to map planned tissue or dose to changing anatomy. In this work, a simple and efficient inverse consistency deformable registration method is proposed with aims of higher registration accuracy and faster convergence speed. Instead of registering image I to a second image J, the two images are symmetrically deformed toward one another in multiple passes, until both deformed images are matched and correct registration is therefore achieved. In each pass, a delta motion field is computed by minimizing a symmetric optical flow system cost function using modified optical flow algorithms. The images are then further deformed with the delta motion field in the positive and negative directions respectively, and then used for the next pass. The magnitude of the delta motion field is forced to be less than 0.4 voxel for every pass in order to guarantee smoothness and invertibility for the two overall motion fields that are accumulating the delta motion fields in both positive and negative directions, respectively. The final motion fields to register the original images I and J, in either direction, are calculated by inverting one overall motion field and combining the inversion result with the other overall motion field. The final motion fields are inversely consistent and this is ensured by the symmetric way that registration is carried out. The proposed method is demonstrated with phantom images, artificially deformed patient images and 4D-CT images. Our results suggest that the proposed method is able to improve the overall accuracy (reducing registration error by 30% or more, compared to the original and inversely inconsistent optical flow algorithms), reduce the inverse consistency error (by 95% or more) and increase the convergence rate (by 100% or more). The overall computation speed may slightly decrease, or increase in most cases

  18. Multi-modal inter-subject registration of mouse brain images

    Science.gov (United States)

    Li, Xia; Yankeelov, Thomas E.; Rosen, Glenn; Gore, John C.; Dawant, Benoit M.

    2006-03-01

    The importance of small animal imaging in fundamental and clinical research is growing rapidly. These studies typically involve micro PET, micro MR, and micro CT images as well as optical or fluorescence images. Histological images are also often used to complement and/or validate the in vivo data. As is the case for human studies, automatic registration of these imaging modalities is a critical component of the overall analysis process, but, the small size of the animals and thus the limited spatial resolution of the in vivo images present specific challenges. In this paper, we propose a series of methods and techniques that permit the inter-subject registration of micro MR and histological images. We then compare results obtained by registering directly MR volumes to each other using a non-rigid registration algorithm we have developed at our institution with results obtained by registering first the MR volumes to their corresponding histological volume, which we reconstruct from 2D cross-sections, and then registering histological volumes to each other. We show that the second approach is preferable.

  19. Dynamic lung modeling and tumor tracking using deformable image registration and geometric smoothing.

    Science.gov (United States)

    Zhang, Yongjie; Jing, Yiming; Liang, Xinghua; Xu, Guoliang; Dong, Lei

    2012-09-01

    A greyscale-based fully automatic deformable image registration algorithm, based on an optical flow method together with geometric smoothing, is developed for dynamic lung modeling and tumor tracking. In our computational processing pipeline, the input data is a set of 4D CT images with 10 phases. The triangle mesh of the lung model is directly extracted from the more stable exhale phase (Phase 5). In addition, we represent the lung surface model in 3D volumetric format by applying a signed distance function and then generate tetrahedral meshes. Our registration algorithm works for both triangle and tetrahedral meshes. In CT images, the intensity value reflects the local tissue density. For each grid point, we calculate the displacement from the static image (phase 5) to match with the moving image (other phases) by using merely intensity values of the CT images. The optical flow computation is followed by a regularization of the deformation field using geometric smoothing. Lung volume change and the maximum lung tissue movement are used to evaluate the accuracy of the application. Our testing results suggest that the application of deformable registration algorithm is an effective way for delineating and tracking tumor motion in image-guided radiotherapy.

  20. Robust feature estimation by non-rigid hierarchical image registration and its application in disparity measurement

    Science.gov (United States)

    Badshah, Amir; Choudhry, Aadil Jaleel; Ullah, Shan

    2017-03-01

    Industries are moving towards automation in order to increase productivity and ensure quality. Variety of electronic and electromagnetic systems are being employed to assist human operator in fast and accurate quality inspection of products. Majority of these systems are equipped with cameras and rely on diverse image processing algorithms. Information is lost in 2D image, therefore acquiring accurate 3D data from 2D images is an open issue. FAST, SURF and SIFT are well-known spatial domain techniques for features extraction and henceforth image registration to find correspondence between images. The efficiency of these methods is measured in terms of the number of perfect matches found. A novel fast and robust technique for stereo-image processing is proposed. It is based on non-rigid registration using modified normalized phase correlation. The proposed method registers two images in hierarchical fashion using quad-tree structure. The registration process works through global to local level resulting in robust matches even in presence of blur and noise. The computed matches can further be utilized to determine disparity and depth for industrial product inspection. The same can be used in driver assistance systems. The preliminary tests on Middlebury dataset produced satisfactory results. The execution time for a 413 x 370 stereo-pair is 500ms approximately on a low cost DSP.

  1. Evaluation of whole-body MR to CT deformable image registration.

    Science.gov (United States)

    Akbarzadeh, A; Gutierrez, D; Baskin, A; Ay, M R; Ahmadian, A; Riahi Alam, N; Lövblad, K O; Zaidi, H

    2013-07-08

    Multimodality image registration plays a crucial role in various clinical and research applications. The aim of this study is to present an optimized MR to CT whole-body deformable image registration algorithm and its validation using clinical studies. A 3D intermodality registration technique based on B-spline transformation was performed using optimized parameters of the elastix package based on the Insight Toolkit (ITK) framework. Twenty-eight (17 male and 11 female) clinical studies were used in this work. The registration was evaluated using anatomical landmarks and segmented organs. In addition to 16 anatomical landmarks, three key organs (brain, lungs, and kidneys) and the entire body volume were segmented for evaluation. Several parameters--such as the Euclidean distance between anatomical landmarks, target overlap, Dice and Jaccard coefficients, false positives and false negatives, volume similarity, distance error, and Hausdorff distance--were calculated to quantify the quality of the registration algorithm. Dice coefficients for the majority of patients (> 75%) were in the 0.8-1 range for the whole body, brain, and lungs, which satisfies the criteria to achieve excellent alignment. On the other hand, for kidneys, Dice coefficients for volumes of 25% of the patients meet excellent volume agreement requirement, while the majority of patients satisfy good agreement criteria (> 0.6). For all patients, the distance error was in 0-10 mm range for all segmented organs. In summary, we optimized and evaluated the accuracy of an MR to CT deformable registration algorithm. The registered images constitute a useful 3D whole-body MR-CT atlas suitable for the development and evaluation of novel MR-guided attenuation correction procedures on hybrid PET-MR systems.

  2. Multimodal Registration and Fusion for 3D Thermal Imaging

    Directory of Open Access Journals (Sweden)

    Moulay A. Akhloufi

    2015-01-01

    Full Text Available 3D vision is an area of computer vision that has attracted a lot of research interest and has been widely studied. In recent years we witness an increasing interest from the industrial community. This interest is driven by the recent advances in 3D technologies, which enable high precision measurements at an affordable cost. With 3D vision techniques we can conduct advanced manufactured parts inspections and metrology analysis. However, we are not able to detect subsurface defects. This kind of detection is achieved by other techniques, like infrared thermography. In this work, we present a new registration framework for 3D and thermal infrared multimodal fusion. The resulting fused data can be used for advanced 3D inspection in Nondestructive Testing and Evaluation (NDT&E applications. The fusion permits the simultaneous visible surface and subsurface inspections to be conducted in the same process. Experimental tests were conducted with different materials. The obtained results are promising and show how these new techniques can be used efficiently in a combined NDT&E-Metrology analysis of manufactured parts, in areas such as aerospace and automotive.

  3. Image Navigation and Registration Performance Assessment Evaluation Tools for GOES-R ABI and GLM

    Science.gov (United States)

    Houchin, Scott; Porter, Brian; Graybill, Justin; Slingerland, Philip

    2017-01-01

    The GOES-R Flight Project has developed an Image Navigation and Registration (INR) Performance Assessment Tool Set (IPATS) for measuring Advanced Baseline Imager (ABI) and Geostationary Lightning Mapper (GLM) INR performance metrics in the post-launch period for performance evaluation and long term monitoring. IPATS utilizes a modular algorithmic design to allow user selection of data processing sequences optimized for generation of each INR metric. This novel modular approach minimizes duplication of common processing elements, thereby maximizing code efficiency and speed. Fast processing is essential given the large number of sub-image registrations required to generate INR metrics for the many images produced over a 24 hour evaluation period. This paper describes the software design and implementation of IPATS and provides preliminary test results.

  4. Automated registration of freehand B-mode ultrasound and magnetic resonance imaging of the carotid arteries based on geometric features

    DEFF Research Database (Denmark)

    Carvalho, Diego D. B.; Arias Lorza, Andres Mauricio; Niessen, Wiro J.;

    2017-01-01

    An automated method for registering B-mode ultrasound (US) and magnetic resonance imaging (MRI) of the carotid arteries is proposed. The registration uses geometric features, namely, lumen centerlines and lumen segmentations, which are extracted fully automatically from the images after manual...... annotation of three seed points in US and MRI. The registration procedure starts with alignment of the lumen centerlines using a point-based registration algorithm. The resulting rigid transformation is used to initialize a rigid and subsequent non-rigid registration procedure that jointly aligns centerlines...

  5. Landmark matching based automatic retinal image registration with linear programming and self-similarities.

    Science.gov (United States)

    Zheng, Yuanjie; Hunter, Allan A; Wu, Jue; Wang, Hongzhi; Gao, Jianbin; Maguire, Maureen G; Gee, James C

    2011-01-01

    In this paper, we address the problem of landmark matching based retinal image registration. Two major contributions render our registration algorithm distinguished from many previous methods. One is a novel landmark-matching formulation which enables not only a joint estimation of the correspondences and transformation model but also the optimization with linear programming. The other contribution lies in the introduction of a reinforced self-similarities descriptor in characterizing the local appearance of landmarks. Theoretical analysis and a series of preliminary experimental results show both the effectiveness of our optimization scheme and the high differentiating ability of our features.

  6. Registration of phase-contrast images in propagation-based X-ray phase tomography.

    Science.gov (United States)

    Weber, L; Hänsch, A; Wolfram, U; Pacureanu, A; Cloetens, P; Peyrin, F; Rit, S; Langer, M

    2017-08-16

    X-ray phase tomography aims at reconstructing the 3D electron density distribution of an object. It offers enhanced sensitivity compared to attenuation-based X-ray absorption tomography. In propagation-based methods, phase contrast is achieved by letting the beam propagate after interaction with the object. The phase shift is then retrieved at each projection angle, and subsequently used in tomographic reconstruction to obtain the refractive index decrement distribution, which is proportional to the electron density. Accurate phase retrieval is achieved by combining images at different propagation distances. For reconstructions of good quality, the phase-contrast images recorded at different distances need to be accurately aligned. In this work, we characterise the artefacts related to misalignment of the phase-contrast images, and investigate the use of different registration algorithms for aligning in-line phase-contrast images. The characterisation of artefacts is done by a simulation study and comparison with experimental data. Loss in resolution due to vibrations is found to be comparable to attenuation-based computed tomography. Further, it is shown that registration of phase-contrast images is nontrivial due to the difference in contrast between the different images, and the often periodical artefacts present in the phase-contrast images if multilayer X-ray optics are used. To address this, we compared two registration algorithms for aligning phase-contrast images acquired by magnified X-ray nanotomography: one based on cross-correlation and one based on mutual information. We found that the mutual information-based registration algorithm was more robust than a correlation-based method. © 2017 The Authors Journal of Microscopy © 2017 Royal Microscopical Society.

  7. Fully Automated Prostate Magnetic Resonance Imaging and Transrectal Ultrasound Fusion via a Probabilistic Registration Metric

    OpenAIRE

    Sparks, Rachel; Bloch, B. Nicolas; Feleppa, Ernest; Barratt, Dean; Madabhushi, Anant

    2013-01-01

    In this work, we present a novel, automated, registration method to fuse magnetic resonance imaging (MRI) and transrectal ultrasound (TRUS) images of the prostate. Our methodology consists of: (1) delineating the prostate on MRI, (2) building a probabilistic model of prostate location on TRUS, and (3) aligning the MRI prostate segmentation to the TRUS probabilistic model. TRUS-guided needle biopsy is the current gold standard for prostate cancer (CaP) diagnosis. Up to 40% of CaP lesions appea...

  8. MO-F-BRA-04: Voxel-Based Statistical Analysis of Deformable Image Registration Error via a Finite Element Method.

    Science.gov (United States)

    Li, S; Lu, M; Kim, J; Glide-Hurst, C; Chetty, I; Zhong, H

    2012-06-01

    Purpose Clinical implementation of adaptive treatment planning is limited by the lack of quantitative tools to assess deformable image registration errors (R-ERR). The purpose of this study was to develop a method, using finite element modeling (FEM), to estimate registration errors based on mechanical changes resulting from them. Methods An experimental platform to quantify the correlation between registration errors and their mechanical consequences was developed as follows: diaphragm deformation was simulated on the CT images in patients with lung cancer using a finite element method (FEM). The simulated displacement vector fields (F-DVF) were used to warp each CT image to generate a FEM image. B-Spline based (Elastix) registrations were performed from reference to FEM images to generate a registration DVF (R-DVF). The F- DVF was subtracted from R-DVF. The magnitude of the difference vector was defined as the registration error, which is a consequence of mechanically unbalanced energy (UE), computed using 'in-house-developed' FEM software. A nonlinear regression model was used based on imaging voxel data and the analysis considered clustered voxel data within images. Results A regression model analysis showed that UE was significantly correlated with registration error, DVF and the product of registration error and DVF respectively with R̂2=0.73 (R=0.854). The association was verified independently using 40 tracked landmarks. A linear function between the means of UE values and R- DVF*R-ERR has been established. The mean registration error (N=8) was 0.9 mm. 85.4% of voxels fit this model within one standard deviation. Conclusions An encouraging relationship between UE and registration error has been found. These experimental results suggest the feasibility of UE as a valuable tool for evaluating registration errors, thus supporting 4D and adaptive radiotherapy. The research was supported by NIH/NCI R01CA140341. © 2012 American Association of Physicists in

  9. A Robust Wavelet Based Watermarking System for Color Video

    Directory of Open Access Journals (Sweden)

    Mohsen Ashourian

    2011-09-01

    Full Text Available In this paper, we propose a wavelet based watermarking system. The system uses wavelet transform for red, green and blues channel independently. We use space-time coding for encoding the watermark message before data embedding. The bit-error-rate of the recovered message is calculated. The embedding factor is selected in such a way that the host video maintains the same quality with/without using space-time coding. The developed system is further examined, when host video faces compression and noise addition. The result shows the effectiveness of the proposed watermarking system, especially when space-time coding is used.

  10. Medical Image Registration by means of a Bio-Inspired Optimization Strategy

    Directory of Open Access Journals (Sweden)

    Hariton Costin

    2012-07-01

    Full Text Available Medical imaging mainly treats and processes missing, ambiguous, complementary, redundant and distorted data. Biomedical image registration is the process of geometric overlaying or alignment of two or more 2D/3D images of the same scene, taken at different time slots, from different angles, and/or by different acquisition systems. In medical practice, it is becoming increasingly important in diagnosis, treatment planning, functional studies, computer-guided therapies, and in biomedical research. Technically, image registration implies a complex optimization of different parameters, performed at local or/and global levels. Local optimization methods frequently fail because functions of the involved metrics with respect to transformation parameters are generally nonconvex and irregular. Therefore, global methods are often required, at least at the beginning of the procedure. In this paper, a new evolutionary and bio-inspired approach -- bacterial foraging optimization -- is adapted for single-slice to 3-D PET and CT multimodal image registration. Preliminary results of optimizing the normalized mutual information similarity metric validated the efficacy of the proposed method by using a freely available medical image database.

  11. Automatic Registration of Low Altitude UAV Sequent Images and Laser Point Clouds

    Directory of Open Access Journals (Sweden)

    CHEN Chi

    2015-05-01

    Full Text Available It is proposed that a novel registration method for automatic co-registration of unmanned aerial vehicle (UAV images sequence and laser point clouds. Firstly, contours of building roofs are extracted from the images sequence and laser point clouds using marked point process and local salient region detection, respectively. The contours from each data are matched via back-project proximity. Secondly, the exterior orientations of the images are recovered using a linear solver based on the contours corner pairs followed by a co-planar optimization which is implicated by the matched lines form contours pairs. Finally, the exterior orientation parameters of images are further optimized by matching 3D points generated from images sequence and laser point clouds using an iterative near the point (ICP algorithm with relative movement threshold constraint. Experiments are undertaken to check the validity and effectiveness of the proposed method. The results show that the proposed method achieves high-precision co-registration of low-altitude UAV image sequence and laser points cloud robustly. The accuracy of the co-produced DOMs meets 1:500 scale standards.

  12. [Rapid 2D-3D medical image registration based on CUDA].

    Science.gov (United States)

    Li, Lingzhi; Zou, Beiji

    2014-08-01

    The medical image registration between preoperative three-dimensional (3D) scan data and intraoperative two-dimensional (2D) image is a key technology in the surgical navigation. Most previous methods need to generate 2D digitally reconstructed radiographs (DRR) images from the 3D scan volume data, then use conventional image similarity function for comparison. This procedure includes a large amount of calculation and is difficult to archive real-time processing. In this paper, with using geometric feature and image density mixed characteristics, we proposed a new similarity measure function for fast 2D-3D registration of preoperative CT and intraoperative X-ray images. This algorithm is easy to implement, and the calculation process is very short, while the resulting registration accuracy can meet the clinical use. In addition, the entire calculation process is very suitable for highly parallel numerical calculation by using the algorithm based on CUDA hardware acceleration to satisfy the requirement of real-time application in surgery.

  13. Automatic registration of imaging mass spectrometry data to the Allen Brain Atlas transcriptome

    Science.gov (United States)

    Abdelmoula, Walid M.; Carreira, Ricardo J.; Shyti, Reinald; Balluff, Benjamin; Tolner, Else; van den Maagdenberg, Arn M. J. M.; Lelieveldt, B. P. F.; McDonnell, Liam; Dijkstra, Jouke

    2014-03-01

    Imaging Mass Spectrometry (IMS) is an emerging molecular imaging technology that provides spatially resolved information on biomolecular structures; each image pixel effectively represents a molecular mass spectrum. By combining the histological images and IMS-images, neuroanatomical structures can be distinguished based on their biomolecular features as opposed to morphological features. The combination of IMS data with spatially resolved gene expression maps of the mouse brain, as provided by the Allen Mouse Brain atlas, would enable comparative studies of spatial metabolic and gene expression patterns in life-sciences research and biomarker discovery. As such, it would be highly desirable to spatially register IMS slices to the Allen Brain Atlas (ABA). In this paper, we propose a multi-step automatic registration pipeline to register ABA histology to IMS- images. Key novelty of the method is the selection of the best reference section from the ABA, based on pre-processed histology sections. First, we extracted a hippocampus-specific geometrical feature from the given experimental histological section to initially localize it among the ABA sections. Then, feature-based linear registration is applied to the initially localized section and its two neighbors in the ABA to select the most similar reference section. A non-rigid registration yields a one-to-one mapping of the experimental IMS slice to the ABA. The pipeline was applied on 6 coronal sections from two mouse brains, showing high anatomical correspondence, demonstrating the feasibility of complementing biomolecule distributions from individual mice with the genome-wide ABA transcriptome.

  14. Technical Note: DIRART- A software suite for deformable image registration and adaptive radiotherapy research

    Energy Technology Data Exchange (ETDEWEB)

    Yang Deshan; Brame, Scott; El Naqa, Issam; Aditya, Apte; Wu Yu; Murty Goddu, S.; Mutic, Sasa; Deasy, Joseph O.; Low, Daniel A. [Department of Radiation Oncology, School of Medicine, Washington University in Saint Louis, Missouri 63110 (United States)

    2011-01-15

    Purpose: Recent years have witnessed tremendous progress in image guide radiotherapy technology and a growing interest in the possibilities for adapting treatment planning and delivery over the course of treatment. One obstacle faced by the research community has been the lack of a comprehensive open-source software toolkit dedicated for adaptive radiotherapy (ART). To address this need, the authors have developed a software suite called the Deformable Image Registration and Adaptive Radiotherapy Toolkit (DIRART). Methods: DIRART is an open-source toolkit developed in MATLAB. It is designed in an object-oriented style with focus on user-friendliness, features, and flexibility. It contains four classes of DIR algorithms, including the newer inverse consistency algorithms to provide consistent displacement vector field in both directions. It also contains common ART functions, an integrated graphical user interface, a variety of visualization and image-processing features, dose metric analysis functions, and interface routines. These interface routines make DIRART a powerful complement to the Computational Environment for Radiotherapy Research (CERR) and popular image-processing toolkits such as ITK. Results: DIRART provides a set of image processing/registration algorithms and postprocessing functions to facilitate the development and testing of DIR algorithms. It also offers a good amount of options for DIR results visualization, evaluation, and validation. Conclusions: By exchanging data with treatment planning systems via DICOM-RT files and CERR, and by bringing image registration algorithms closer to radiotherapy applications, DIRART is potentially a convenient and flexible platform that may facilitate ART and DIR research.

  15. Large deformation diffeomorphic metric mapping registration of reconstructed 3D histological section images and in vivo MR images

    Directory of Open Access Journals (Sweden)

    Can Ceritoglu

    2010-05-01

    Full Text Available Our current understanding of neuroanatomical abnormalities in neuropsychiatric diseases is based largely on magnetic resonance imaging (MRI and post mortem histological analyses of the brain. Further advances in elucidating altered brain structure in these human conditions might emerge from combining MRI and histological methods. We propose a multistage method for registering 3D volumes reconstructed from histological sections to corresponding in vivo MRI volumes from the same subjects: (1 manual segmentation of white matter (WM, gray matter (GM and cerebrospinal fluid (CSF compartments in histological sections, (2 alignment of consecutive histological sections using 2D rigid transformation to construct a 3D histological image volume from the aligned sections, (3 registration of reconstructed 3D histological volumes to the corresponding 3D MRI volumes using 3D affine transformation, (4 intensity normalization of images via histogram matching and (5 registration of the volumes via intensity based Large Deformation Diffeomorphic Metric (LDDMM image matching algorithm. Here we demonstrate the utility of our method in the transfer of cytoarchitectonic information from histological sections to identify regions of interest in MRI scans of nine adult macaque brains for morphometric analyses. LDDMM improved the accuracy of the registration via decreased distances between GM/CSF surfaces after LDDMM (0.39±0.13 mm compared to distances after affine registration (0.76±0.41 mm. Similarly, WM/GM distances decreased to 0.28±0.16 mm after LDDMM compared to 0.54±0.39 mm after affine registration. The multistage registration method may find broad application for mapping histologically based information, e.g., receptor distributions, gene expression, onto MRI volumes.

  16. On the Optimization of the Geodesic Active Fields (GAF) for Image Registration: Application to multi-scale registration of cortical maps on the sphere

    OpenAIRE

    Ciller Ruiz, Carlos

    2012-01-01

    [ANGLÈS] This work presents an analysis and optimization, both in terms of optimal parameters and speed, of the novel geodesic active fields framework for surface image registration on the sphere, presented by Zosso, Dominique in his PhD thesis at the École Polytechnique Fédérale de Lausanne. The relevance of surface registration to medical imaging is that there is a lot of anatomical information in the form of collected surface points, giving information about the cortical folding pattern. H...

  17. Validation of the deformable image registration system elastix in the head and neck region

    DEFF Research Database (Denmark)

    Zukauskaite, R.; Brink, C.; Hansen, C. R.

    2015-01-01

    evaluates the accuracy of the open source deformable registration tool elastix when used for registration of different organ structures on planning CT and relapse CT scans of head and neck patients. Materials and Methods: Twenty patients treated with definitive IMRT for oral cavity, oropharynx...... cord, mandible, right/left parotid and submandibular glands, thyroid gland and vertebrae C3-5) on planning CT (pCT), relapse CT (rCT) and re-delineated again on the planning CT (reCT). The contouring on the relapse CT was mapped to the planning CT using elastix (http://elastix.isi.uu.nl/). Spatial...... delineation. Significant correlations within single organs were not found. Conclusions: Deformable registration of head and neck CT images using elastix resulted in a combined delineation and deformation uncertainty of approximately twice the uncertainty related to the manual delineation performed on one CT...

  18. Reduction by Lie Group Symmetries in Diffeomorphic Image Registration and Deformation Modelling

    Directory of Open Access Journals (Sweden)

    Stefan Sommer

    2015-05-01

    Full Text Available We survey the role of reduction by symmetry in the large deformation diffeomorphic metric mapping framework for registration of a variety of data types (landmarks, curves, surfaces, images and higher-order derivative data. Particle relabelling symmetry allows the equations of motion to be reduced to the Lie algebra allowing the equations to be written purely in terms of the Eulerian velocity field. As a second use of symmetry, the infinite dimensional problem of finding correspondences between objects can be reduced for a range of concrete data types, resulting in compact representations of shape and spatial structure. Using reduction by symmetry, we describe these models in a common theoretical framework that draws on links between the registration problem and geometric mechanics. We outline these constructions and further cases where reduction by symmetry promises new approaches to the registration of complex data types.

  19. Using patient-specific phantoms to evaluate deformable image registration algorithms for adaptive radiation therapy.

    Science.gov (United States)

    Stanley, Nick; Glide-Hurst, Carri; Kim, Jinkoo; Adams, Jeffrey; Li, Shunshan; Wen, Ning; Chetty, Indrin J; Zhong, Hualiang

    2013-11-04

    The quality of adaptive treatment planning depends on the accuracy of its underlying deformable image registration (DIR). The purpose of this study is to evaluate the performance of two DIR algorithms, B-spline-based deformable multipass (DMP) and deformable demons (Demons), implemented in a commercial software package. Evaluations were conducted using both computational and physical deformable phantoms. Based on a finite element method (FEM), a total of 11 computational models were developed from a set of CT images acquired from four lung and one prostate cancer patients. FEM generated displacement vector fields (DVF) were used to construct the lung and prostate image phantoms. Based on a fast-Fourier transform technique, image noise power spectrum was incorporated into the prostate image phantoms to create simulated CBCT images. The FEM-DVF served as a gold standard for verification of the two registration algorithms performed on these phantoms. The registration algorithms were also evaluated at the homologous points quantified in the CT images of a physical lung phantom. The results indicated that the mean errors of the DMP algorithm were in the range of 1.0 ~ 3.1 mm for the computational phantoms and 1.9 mm for the physical lung phantom. For the computational prostate phantoms, the corresponding mean error was 1.0-1.9 mm in the prostate, 1.9-2.4mm in the rectum, and 1.8-2.1 mm over the entire patient body. Sinusoidal errors induced by B-spline interpolations were observed in all the displacement profiles of the DMP registrations. Regions of large displacements were observed to have more registration errors. Patient-specific FEM models have been developed to evaluate the DIR algorithms implemented in the commercial software package. It has been found that the accuracy of these algorithms is patient dependent and related to various factors including tissue deformation magnitudes and image intensity gradients across the regions of interest. This may suggest that

  20. Feasibility study for image-guided kidney surgery: Assessment of required intraoperative surface for accurate physical to image space registrations

    Science.gov (United States)

    Benincasa, Anne B.; Clements, Logan W.; Herrell, S. Duke; Galloway, Robert L.

    2008-01-01

    A notable complication of applying current image-guided surgery techniques of soft tissue to kidney resections (nephrectomies) is the limited field of view of the intraoperative kidney surface. This limited view constrains the ability to obtain a sufficiently geometrically descriptive surface for accurate surface-based registrations. The authors examined the effects of the limited view by using two orientations of a kidney phantom to model typical laparoscopic and open partial nephrectomy views. Point-based registrations, using either rigidly attached markers or anatomical landmarks as fiducials, served as initial alignments for surface-based registrations. Laser range scanner (LRS) obtained surfaces were registered to the phantom’s image surface using a rigid iterative closest point algorithm. Subsets of each orientation’s LRS surface were used in a robustness test to determine which parts of the surface yield the most accurate registrations. Results suggest that obtaining accurate registrations is a function of the percentage of the total surface and of geometric surface properties, such as curvature. Approximately 28% of the total surface is required regardless of the location of that surface subset. However, that percentage decreases when the surface subset contains information from opposite ends of the surface and∕or unique anatomical features, such as the renal artery and vein. PMID:18841875

  1. Elastic registration of prostate MR images based on estimation of deformation states.

    Science.gov (United States)

    Marami, Bahram; Sirouspour, Shahin; Ghoul, Suha; Cepek, Jeremy; Davidson, Sean R H; Capson, David W; Trachtenberg, John; Fenster, Aaron

    2015-04-01

    Magnetic resonance imaging (MRI) is being used increasingly for image-guided targeted biopsy and focal therapy of prostate cancer. In this paper, a combined rigid and deformable registration technique is proposed to register pre-treatment diagnostic 3T magnetic resonance (MR) images of the prostate, with the identified target tumor(s), to intra-treatment 1.5T MR images. The pre-treatment T2-weighted MR images were acquired with patients in a supine position using an endorectal coil in a 3T scanner, while the intra-treatment T2-weighted MR images were acquired in a 1.5T scanner before insertion of the needle with patients in the semi-lithotomy position. Both the rigid and deformable registration algorithms employ an intensity-based distance metric defined based on the modality independent neighborhoo