A Simplified Implementation of Edge Detection in MATLAB is Faster and More Sensitive than Fast Fourier Transform for Actin Fiber Alignment Quantification

2011 ◽  
Vol 17 (2) ◽  
pp. 156-166 ◽  
Author(s):  
Steven Frank Kemeny ◽  
Alisa Morss Clyne

AbstractFiber alignment plays a critical role in the structure and function of cells and tissues. While fiber alignment quantification is important to experimental analysis and several different methods for quantifying fiber alignment exist, many studies focus on qualitative rather than quantitative analysis perhaps due to the complexity of current fiber alignment methods. Speed and sensitivity were compared in edge detection and fast Fourier transform (FFT) for measuring actin fiber alignment in cells exposed to shear stress. While edge detection using matrix multiplication was consistently more sensitive than FFT, image processing time was significantly longer. However, when MATLAB functions were used to implement edge detection, MATLAB's efficient element-by-element calculations and fast filtering techniques reduced computation cost 100 times compared to the matrix multiplication edge detection method. The new computation time was comparable to the FFT method, and MATLAB edge detection produced well-distributed fiber angle distributions that statistically distinguished aligned and unaligned fibers in half as many sample images. When the FFT sensitivity was improved by dividing images into smaller subsections, processing time grew larger than the time required for MATLAB edge detection. Implementation of edge detection in MATLAB is simpler, faster, and more sensitive than FFT for fiber alignment quantification.

1992 ◽  
Vol 70 (2) ◽  
pp. 555-559 ◽  
Author(s):  
André D. Bandrauk ◽  
Hai Shen

A new method of splitting exponential operators is proposed for the exponential form of the operator solution to the time-dependent Schrödinger equation. The method is shown to hold for any desired accuracy in the time increment. A comparison of different algorithms is made as a function of accuracy and computation time. Keywords: splitting operator, Fast Fourier Transform (FFT), Schrödinger equations.


1983 ◽  
Vol 37 (3) ◽  
pp. 273-279 ◽  
Author(s):  
K. L. Sala ◽  
R. W. Yip ◽  
R. LeSage

The use of the fast Fourier transform in the processing of photographic data obtained from picosecond continuum spectroscopy is described. The resulting reduction in the complexity and computation time has permitted all of the data acquisition and processing to be carried out with an eight-bit microcomputer. Specific examples of some key problems in the data processing that are peculiar to this spectroscopic technique and methods of overcoming these problems are discussed. Experimental results that serve to illustrate both the experimental technique itself as well as the versatility and reliability of the data processing algorithm are presented for the transient absorption of a Cr(III) complex in solutions.


1995 ◽  
Vol 49 (5) ◽  
pp. 630-638 ◽  
Author(s):  
P. A. Mosier-Boss ◽  
S. H. Lieberman ◽  
R. Newbery

The use of shifted-spectra, first-derivative spectroscopy (or edge detection), and fast Fourier transform filtering techniques for fluorescence rejection in Raman spectra is demonstrated. These techniques take advantage of the fact that Raman signals are very narrow in comparison to fluorescence bands in order to discriminate between the two. None of these techniques require modification of existing instrumentation. Fast Fourier transform filtering and deconvolution techniques also provide a means of improving spectral resolution and the signal-to-noise ratio.


2014 ◽  
Vol 2014 ◽  
pp. 1-12
Author(s):  
K. K. L. B. Adikaram ◽  
M. A. Hussein ◽  
M. Effenberger ◽  
T. Becker

With the increasing demand for online/inline data processing efficient Fourier analysis becomes more and more relevant. Due to the fact that the bit reversal process requires considerable processing time of the Fast Fourier Transform (FFT) algorithm, it is vital to optimize the bit reversal algorithm (BRA). This paper is to introduce an efficient BRA with multiple memory structures. In 2009, Elster showed the relation between the first and the second halves of the bit reversal permutation (BRP) and stated that it may cause serious impact on cache performance of the computer, if implemented. We found exceptions, especially when the said index mapping was implemented with multiple one-dimensional memory structures instead of multidimensional or one-dimensional memory structure. Also we found a new index mapping, even after the recursive splitting of BRP into equal sized slots. The four-array and the four-vector versions of BRA with new index mapping reported 34% and 16% improvement in performance in relation to similar versions of Linear BRA of Elster which uses single one-dimensional memory structure.


Biomaterials ◽  
2006 ◽  
Vol 27 (32) ◽  
pp. 5524-5534 ◽  
Author(s):  
Chantal Ayres ◽  
Gary L. Bowlin ◽  
Scott C. Henderson ◽  
Leander Taylor ◽  
Jackie Shultz ◽  
...  

2008 ◽  
Vol 19 (5) ◽  
pp. 603-621 ◽  
Author(s):  
Chantal E. Ayres ◽  
B. Shekhar Jha ◽  
Hannah Meredith ◽  
James R. Bowman ◽  
Gary L. Bowlin ◽  
...  

Author(s):  
David W Walker

This article investigates the recursive Morton ordering of two-dimensional arrays as an efficient way to access hierarchical memory across a range of heterogeneous computer platforms, ranging from manycore devices, multicore processors, clusters and distributed environments. A brief overview of previous research in this area is given, and algorithms that make use of Morton ordering are described. These are then used to investigate the efficiency of the Morton ordering approach by performance experiments on different processors. In particular, timing results are presented for matrix multiplication, Cholesky factorization and fast Fourier transform algorithms. The use of the Morton ordering approach leads naturally to algorithms that are recursive and exposes parallelism at each level of recursion. Thus, the approach advocated in this talk not only provides convenient and efficient access to hierarchical memory but also provides a basis for exploiting parallelism.


Sign in / Sign up

Export Citation Format

Share Document