Mapping complex tissue architecture with diffusion spectrum magnetic resonance imaging.

Methods are presented to map complex fiber architectures in tissues by imaging the 3D spectra of tissue water diffusion with MR. First, theoretical considerations show why and under what conditions diffusion contrast is positive. Using this result, spin displacement spectra that are conventionally phase-encoded can be accurately reconstructed by a Fourier transform of the measured signal's modulus. Second, studies of in vitro and in vivo samples demonstrate correspondence between the orientational maxima of the diffusion spectrum and those of the fiber orientation density at each location. In specimens with complex muscular tissue, such as the tongue, diffusion spectrum images show characteristic local heterogeneities of fiber architectures, including angular dispersion and intersection. Cerebral diffusion spectra acquired in normal human subjects resolve known white matter tracts and tract intersections. Finally, the relation between the presented model-free imaging technique and other available diffusion MRI schemes is discussed.

Parallel imaging with phase scrambling.

PURPOSE: Most existing methods for accelerated parallel imaging in MRI require additional data, which are used to derive information about the sensitivity profile of each radiofrequency (RF) channel. In this work, a method is presented to avoid the acquisition of separate coil calibration data for accelerated Cartesian trajectories. METHODS: Quadratic phase is imparted to the image to spread the signals in k-space (aka phase scrambling). By rewriting the Fourier transform as a convolution operation, a window can be introduced to the convolved chirp function, allowing a low-resolution image to be reconstructed from phase-scrambled data without prominent aliasing. This image (for each RF channel) can be used to derive coil sensitivities to drive existing parallel imaging techniques. As a proof of concept, the quadratic phase was applied by introducing an offset to the x(2) - y(2) shim and the data were reconstructed using adapted versions of the image space-based sensitivity encoding and GeneRalized Autocalibrating Partially Parallel Acquisitions algorithms. RESULTS: The method is demonstrated in a phantom (1 × 2, 1 × 3, and 2 × 2 acceleration) and in vivo (2 × 2 acceleration) using a 3D gradient echo acquisition. CONCLUSION: Phase scrambling can be used to perform parallel imaging acceleration without acquisition of separate coil calibration data, demonstrated here for a 3D-Cartesian trajectory. Further research is required to prove the applicability to other 2D and 3D sampling schemes. Magn Reson Med, 2014. © 2014 Wiley Periodicals, Inc.

Direct Fourier Tomographic Reconstruction Image-To-Image Filter

We present an open-source ITK implementation of a directFourier method for tomographic reconstruction, applicableto parallel-beam x-ray images. Direct Fourierreconstruction makes use of the central-slice theorem tobuild a polar 2D Fourier space from the 1D transformedprojections of the scanned object, that is resampled intoa Cartesian grid. Inverse 2D Fourier transform eventuallyyields the reconstructed image. Additionally, we providea complex wrapper to the BSplineInterpolateImageFunctionto overcome ITKâeuro?s current lack for image interpolatorsdealing with complex data types. A sample application ispresented and extensively illustrated on the Shepp-Loganhead phantom. We show that appropriate input zeropaddingand 2D-DFT oversampling rates together with radial cubicb-spline interpolation improve 2D-DFT interpolationquality and are efficient remedies to reducereconstruction artifacts.

Poincar wave equations as Fourier transformations of Galilei wave equations

The relationship between the Poincar and Galilei groups allows us to write the Poincar wave equations for arbitrary spin as a Fourier transform of the Galilean ones. The relation between the Lagrangian formulation for both cases is also studied.

Unidirectional quantum walks: Evolution and exit times

In this paper we focus our attention on a particle that follows a unidirectional quantum walk, an alternative version of the currently widespread discrete-time quantum walk on a line. Here the walker at each time step can either remain in place or move in a fixed direction, e.g., rightward or upward. While both formulations are essentially equivalent, the present approach leads us to consider discrete Fourier transforms, which eventually results in obtaining explicit expressions for the wave functions in terms of finite sums and allows the use of efficient algorithms based on the fast Fourier transform. The wave functions here obtained govern the probability of finding the particle at any given location but determine as well the exit-time probability of the walker from a fixed interval, which is also analyzed.

A transformada de Fourier em basic

In this paper we describe three computer programs in Basic language about the Fourier transform (FFT) which are available in the Internet site http://artemis.ffclrp.usp.br/SoftwareE.htm (in English) or http://artemis.ffclrp.usp.br/softwareP.htm (in Portuguese) since October 1998. Those are addresses to the Web Page of our Laboratory of Organic Synthesis. The programs can be downloaded and used by anyone who is interested on the subject. The texts, menus and captions in the programs are written in English.

Utilização de filtro de transformada de fourier para a minimização de ruídos em sinais analíticos

Instrumental data always present some noise. The analytical data information and instrumental noise generally has different frequencies. Thus is possible to remove the noise using a digital filter based on Fourier transform and inverse Fourier transform. This procedure enhance the signal/noise ratio and consecutively increase the detection limits on instrumental analysis. The basic principle of Fourier transform filter with modifications implemented to improve its performance is presented. A numerical example, as well as a real voltammetric example are showed to demonstrate the Fourier transform filter implementation. The programs to perform the Fourier transform filter, in Matlab and Visual Basic languages, are included as appendices

Usando um website para explicar a espectrometria de ressonância ciclotrônica de íons por transformada de Fourier

This article shows the usefulness of a website to explain the concepts, operational events, vacuum system, applications and an experimental sequence of the Fourier Transform Ion Ciclotron Resonance Mass Spectrometry technique (http://143.107.46.113/icr/icrj.html).

Estudo comparativo sobre filtragem de sinais instrumentais usando transformadas de Fourier e Wavelet

A comparative study of the Fourier (FT) and the wavelet transforms (WT) for instrumental signal denoising is presented. The basic principles of wavelet theory are described in a succinct and simplified manner. For illustration, FT and WT are used to filter UV-VIS and plasma emission spectra using MATLAB software for computation. Results show that FT and WT filters are comparable when the signal does not display sharp peaks (UV-VIS spectra), but the WT yields a better filtering when the filling factor of the signal is small (plasma spectra), since it causes low peak distortion.

Theoretical investigation of electronic excitation transfer between chlorophylls in light-harvesting antenna of photosystem ii using quantum computers

The excitation energy transfer between chlorophylls in major and minor antenna complexes of photosystem II (PSII) was investigated using quantum Fourier transforms. These transforms have an important role in the efficiency of quantum algorithms of quantum computers. The equation 2n=N was used to make the connection between excitation energy transfers using quantum Fourier transform, where n is the number of qubits required for simulation of transfers and N is the number of chlorophylls in the antenna complexes.

Filtros digitais por transformadas de Fourier aplicados em eletroquímica

The electrochemical properties of micro and nano-electrodes are widely investigated due to their low faradaic and capacitive currents, leading to a new generation of smart and implantable devices. However, the current signals obtained in low-dimensional devices are strongly influenced by noise sources. In this paper, we show the evaluation of filters based on Fast Fourier Transform (FFT) and their implementation in a graphical user interface (GUI) in MATLAB®. As a case study, we evaluated an electrochemical reaction process of charge transfer via outer-sphere. Results showed successful removal of most of the noise in signals, thus proving a promising tool for low-scale measurement.

Análise exploratória aplicada a espectros de reflexão total atenuada no infravermelho com transformada de Fourier (ATR-FTIR) de blendas de biodiesel/diesel

In this study, hierarchical cluster analysis (HCA) and principal component analysis (PCA) were used to classify blends produced from diesel S500 and different kinds of biodiesel produced by the TDSP methodology. The different kinds of biodiesel studied in this work were produced from three raw materials: soybean oil, waste cooking oil and hydrogenated vegetable oil. Methylic and ethylic routes were employed for the production of biodiesel. HCA and PCA were performed on the data from attenuated total reflectance Fourier transform infrared spectroscopy, showing the separation of the blends into groups according to biodiesel content present in the blends and to the kind of biodiesel used to form the mixtures.

Development of Time - Frequency Techniques for Sonar Applications

Sonar signal processing comprises of a large number of signal processing algorithms for implementing functions such as Target Detection, Localisation, Classification, Tracking and Parameter estimation. Current implementations of these functions rely on conventional techniques largely based on Fourier Techniques, primarily meant for stationary signals. Interestingly enough, the signals received by the sonar sensors are often non-stationary and hence processing methods capable of handling the non-stationarity will definitely fare better than Fourier transform based methods.Time-frequency methods(TFMs) are known as one of the best DSP tools for nonstationary signal processing, with which one can analyze signals in time and frequency domains simultaneously. But, other than STFT, TFMs have been largely limited to academic research because of the complexity of the algorithms and the limitations of computing power. With the availability of fast processors, many applications of TFMs have been reported in the fields of speech and image processing and biomedical applications, but not many in sonar processing. A structured effort, to fill these lacunae by exploring the potential of TFMs in sonar applications, is the net outcome of this thesis. To this end, four TFMs have been explored in detail viz. Wavelet Transform, Fractional Fourier Transfonn, Wigner Ville Distribution and Ambiguity Function and their potential in implementing five major sonar functions has been demonstrated with very promising results. What has been conclusively brought out in this thesis, is that there is no "one best TFM" for all applications, but there is "one best TFM" for each application. Accordingly, the TFM has to be adapted and tailored in many ways in order to develop specific algorithms for each of the applications.

Development of a New Transform:MRT

Fourier transform methods are employed heavily in digital signal processing. Discrete Fourier Transform (DFT) is among the most commonly used digital signal transforms. The exponential kernel of the DFT has the properties of symmetry and periodicity. Fast Fourier Transform (FFT) methods for fast DFT computation exploit these kernel properties in different ways. In this thesis, an approach of grouping data on the basis of the corresponding phase of the exponential kernel of the DFT is exploited to introduce a new digital signal transform, named the M-dimensional Real Transform (MRT), for l-D and 2-D signals. The new transform is developed using number theoretic principles as regards its specific features. A few properties of the transform are explored, and an inverse transform presented. A fundamental assumption is that the size of the input signal be even. The transform computation involves only real additions. The MRT is an integer-to-integer transform. There are two kinds of redundancy, complete redundancy & derived redundancy, in MRT. Redundancy is analyzed and removed to arrive at a more compact version called the Unique MRT (UMRT). l-D UMRT is a non-expansive transform for all signal sizes, while the 2-D UMRT is non-expansive for signal sizes that are powers of 2. The 2-D UMRT is applied in image processing applications like image compression and orientation analysis. The MRT & UMRT, being general transforms, will find potential applications in various fields of signal and image processing.

Efficient Watermarking Schemes for Speaker Verification Guaranteeing Non-repudiation

Presently different audio watermarking methods are available; most of them inclined towards copyright protection and copy protection. This is the key motive for the notion to develop a speaker verification scheme that guar- antees non-repudiation services and the thesis is its outcome. The research presented in this thesis scrutinizes the field of audio water- marking and the outcome is a speaker verification scheme that is proficient in addressing issues allied to non-repudiation to a great extent. This work aimed in developing novel audio watermarking schemes utilizing the fun- damental ideas of Fast-Fourier Transform (FFT) or Fast Walsh-Hadamard Transform (FWHT). The Mel-Frequency Cepstral Coefficients (MFCC) the best parametric representation of the acoustic signals along with few other key acoustic characteristics is employed in crafting of new schemes. The au- dio watermark created is entirely dependent to the acoustic features, hence named as FeatureMark and is crucial in this work. In any watermarking scheme, the quality of the extracted watermark de- pends exclusively on the pre-processing action and in this work framing and windowing techniques are involved. The theme non-repudiation provides immense significance in the audio watermarking schemes proposed in this work. Modification of the signal spectrum is achieved in a variety of ways by selecting appropriate FFT/FWHT coefficients and the watermarking schemes were evaluated for imperceptibility, robustness and capacity char- acteristics. The proposed schemes are unequivocally effective in terms of maintaining the sound quality, retrieving the embedded FeatureMark and in terms of the capacity to hold the mark bits. Robust nature of these marking schemes is achieved with the help of syn- chronization codes such as Barker Code with FFT based FeatureMarking scheme and Walsh Code with FWHT based FeatureMarking scheme. An- other important feature associated with this scheme is the employment of an encryption scheme towards the preparation of its FeatureMark that scrambles the signal features that helps to keep the signal features unreve- laed. A comparative study with the existing watermarking schemes and the ex- periments to evaluate imperceptibility, robustness and capacity tests guar- antee that the proposed schemes can be baselined as efficient audio water- marking schemes. The four new digital audio watermarking algorithms in terms of their performance are remarkable thereby opening more opportu- nities for further research.