Image compression-encryption algorithms by combining hyper-chaotic system with discrete fractional random transform

Science.gov (United States)

Gong, Lihua; Deng, Chengzhi; Pan, Shumin; Zhou, Nanrun

2018-07-01

Based on hyper-chaotic system and discrete fractional random transform, an image compression-encryption algorithm is designed. The original image is first transformed into a spectrum by the discrete cosine transform and the resulting spectrum is compressed according to the method of spectrum cutting. The random matrix of the discrete fractional random transform is controlled by a chaotic sequence originated from the high dimensional hyper-chaotic system. Then the compressed spectrum is encrypted by the discrete fractional random transform. The order of DFrRT and the parameters of the hyper-chaotic system are the main keys of this image compression and encryption algorithm. The proposed algorithm can compress and encrypt image signal, especially can encrypt multiple images once. To achieve the compression of multiple images, the images are transformed into spectra by the discrete cosine transform, and then the spectra are incised and spliced into a composite spectrum by Zigzag scanning. Simulation results demonstrate that the proposed image compression and encryption algorithm is of high security and good compression performance.

Infrared and visible image fusion using discrete cosine transform and swarm intelligence for surveillance applications

Science.gov (United States)

Paramanandham, Nirmala; Rajendiran, Kishore

2018-01-01

A novel image fusion technique is presented for integrating infrared and visible images. Integration of images from the same or various sensing modalities can deliver the required information that cannot be delivered by viewing the sensor outputs individually and consecutively. In this paper, a swarm intelligence based image fusion technique using discrete cosine transform (DCT) domain is proposed for surveillance application which integrates the infrared image with the visible image for generating a single informative fused image. Particle swarm optimization (PSO) is used in the fusion process for obtaining the optimized weighting factor. These optimized weighting factors are used for fusing the DCT coefficients of visible and infrared images. Inverse DCT is applied for obtaining the initial fused image. An enhanced fused image is obtained through adaptive histogram equalization for a better visual understanding and target detection. The proposed framework is evaluated using quantitative metrics such as standard deviation, spatial frequency, entropy and mean gradient. The experimental results demonstrate the outperformance of the proposed algorithm over many other state- of- the- art techniques reported in literature.

Image secure transmission for optical orthogonal frequency-division multiplexing visible light communication systems using chaotic discrete cosine transform

Science.gov (United States)

Wang, Zhongpeng; Zhang, Shaozhong; Chen, Fangni; Wu, Ming-Wei; Qiu, Weiwei

2017-11-01

A physical encryption scheme for orthogonal frequency-division multiplexing (OFDM) visible light communication (VLC) systems using chaotic discrete cosine transform (DCT) is proposed. In the scheme, the row of the DCT matrix is permutated by a scrambling sequence generated by a three-dimensional (3-D) Arnold chaos map. Furthermore, two scrambling sequences, which are also generated from a 3-D Arnold map, are employed to encrypt the real and imaginary parts of the transmitted OFDM signal before the chaotic DCT operation. The proposed scheme enhances the physical layer security and improves the bit error rate (BER) performance for OFDM-based VLC. The simulation results prove the efficiency of the proposed encryption method. The experimental results show that the proposed security scheme not only protects image data from eavesdroppers but also keeps the good BER and peak-to-average power ratio performances for image-based OFDM-VLC systems.

Structural-functional lung imaging using a combined CT-EIT and a Discrete Cosine Transformation reconstruction method.

Science.gov (United States)

Schullcke, Benjamin; Gong, Bo; Krueger-Ziolek, Sabine; Soleimani, Manuchehr; Mueller-Lisse, Ullrich; Moeller, Knut

2016-05-16

Lung EIT is a functional imaging method that utilizes electrical currents to reconstruct images of conductivity changes inside the thorax. This technique is radiation free and applicable at the bedside, but lacks of spatial resolution compared to morphological imaging methods such as X-ray computed tomography (CT). In this article we describe an approach for EIT image reconstruction using morphologic information obtained from other structural imaging modalities. This leads to recon- structed images of lung ventilation that can easily be superimposed with structural CT or MRI images, which facilitates image interpretation. The approach is based on a Discrete Cosine Transformation (DCT) of an image of the considered transversal thorax slice. The use of DCT enables reduction of the dimensionality of the reconstruction and ensures that only conductivity changes of the lungs are reconstructed and displayed. The DCT based approach is well suited to fuse morphological image information with functional lung imaging at low computational costs. Results on simulated data indicate that this approach preserves the morphological structures of the lungs and avoids blurring of the solution. Images from patient measurements reveal the capabilities of the method and demonstrate benefits in possible applications.

The optimal digital filters of sine and cosine transforms for geophysical transient electromagnetic method

Science.gov (United States)

Zhao, Yun-wei; Zhu, Zi-qiang; Lu, Guang-yin; Han, Bo

2018-03-01

The sine and cosine transforms implemented with digital filters have been used in the Transient electromagnetic methods for a few decades. Kong (2007) proposed a method of obtaining filter coefficients, which are computed in the sample domain by Hankel transform pair. However, the curve shape of Hankel transform pair changes with a parameter, which usually is set to be 1 or 3 in the process of obtaining the digital filter coefficients of sine and cosine transforms. First, this study investigates the influence of the parameter on the digital filter algorithm of sine and cosine transforms based on the digital filter algorithm of Hankel transform and the relationship between the sine, cosine function and the ±1/2 order Bessel function of the first kind. The results show that the selection of the parameter highly influences the precision of digital filter algorithm. Second, upon the optimal selection of the parameter, it is found that an optimal sampling interval s also exists to achieve the best precision of digital filter algorithm. Finally, this study proposes four groups of sine and cosine transform digital filter coefficients with different length, which may help to develop the digital filter algorithm of sine and cosine transforms, and promote its application.

Inversion algorithms for the spherical Radon and cosine transform

International Nuclear Information System (INIS)

Louis, A K; Riplinger, M; Spiess, M; Spodarev, E

2011-01-01

We consider two integral transforms which are frequently used in integral geometry and related fields, namely the spherical Radon and cosine transform. Fast algorithms are developed which invert the respective transforms in a numerically stable way. So far, only theoretical inversion formulae or algorithms for atomic measures have been derived, which are not so important for applications. We focus on two- and three-dimensional cases, where we also show that our method leads to a regularization. Numerical results are presented and show the validity of the resulting algorithms. First, we use synthetic data for the inversion of the Radon transform. Then we apply the algorithm for the inversion of the cosine transform to reconstruct the directional distribution of line processes from finitely many intersections of their lines with test lines (2D) or planes (3D), respectively. Finally we apply our method to analyse a series of microscopic two- and three-dimensional images of a fibre system

Infrared images target detection based on background modeling in the discrete cosine domain

Science.gov (United States)

Ye, Han; Pei, Jihong

2018-02-01

Background modeling is the critical technology to detect the moving target for video surveillance. Most background modeling techniques are aimed at land monitoring and operated in the spatial domain. A background establishment becomes difficult when the scene is a complex fluctuating sea surface. In this paper, the background stability and separability between target are analyzed deeply in the discrete cosine transform (DCT) domain, on this basis, we propose a background modeling method. The proposed method models each frequency point as a single Gaussian model to represent background, and the target is extracted by suppressing the background coefficients. Experimental results show that our approach can establish an accurate background model for seawater, and the detection results outperform other background modeling methods in the spatial domain.

A novel adaptive discrete cosine transform-domain filter for gap-inpainting of high resolution PET scanners

International Nuclear Information System (INIS)

Shih, Cheng-Ting; Lin, Hsin-Hon; Chuang, Keh-Shih; Wu, Jay; Chang, Shu-Jun

2014-01-01

Purpose: Several positron emission tomography (PET) scanners with special detector block arrangements have been developed in recent years to improve the resolution of PET images. However, the discontinuous detector blocks cause gaps in the sinogram. This study proposes an adaptive discrete cosine transform-based (aDCT) filter for gap-inpainting. Methods: The gap-corrupted sinogram was morphologically closed and subsequently converted to the DCT domain. A certain number of the largest coefficients in the DCT spectrum were identified to determine the low-frequency preservation region. The weighting factors for the remaining coefficients were determined by an exponential weighting function. The aDCT filter was constructed and applied to two digital phantoms and a simulated phantom introduced with various levels of noise. Results: For the Shepp-Logan head phantom, the aDCT filter filled the gaps effectively. For the Jaszczak phantom, no secondary artifacts were induced after aDCT filtering. The percent mean square error and mean structure similarity of the aDCT filter were superior to those of the DCT2 filter at all noise levels. For the simulated striatal dopamine innervation study, the aDCT filter recovered the shape of the striatum and restored the striatum to reference activity ratios to the ideal value. Conclusions: The proposed aDCT filter can recover the missing gap data in the sinogram and improve the image quality and quantitative accuracy of PET images

A novel adaptive discrete cosine transform-domain filter for gap-inpainting of high resolution PET scanners

Energy Technology Data Exchange (ETDEWEB)

Shih, Cheng-Ting; Lin, Hsin-Hon; Chuang, Keh-Shih [Department of Biomedical Engineering and Environmental Sciences, National Tsing Hua University, Hsinchu 30013, Taiwan (China); Wu, Jay, E-mail: jwu@mail.cmu.edu.tw [Department of Biomedical Imaging and Radiological Science, China Medical University, Taichung 40402, Taiwan (China); Chang, Shu-Jun [Health Physics Division, Institute of Nuclear Energy Research, Atomic Energy Council, Taoyuan 32546, Taiwan (China)

2014-08-15

Purpose: Several positron emission tomography (PET) scanners with special detector block arrangements have been developed in recent years to improve the resolution of PET images. However, the discontinuous detector blocks cause gaps in the sinogram. This study proposes an adaptive discrete cosine transform-based (aDCT) filter for gap-inpainting. Methods: The gap-corrupted sinogram was morphologically closed and subsequently converted to the DCT domain. A certain number of the largest coefficients in the DCT spectrum were identified to determine the low-frequency preservation region. The weighting factors for the remaining coefficients were determined by an exponential weighting function. The aDCT filter was constructed and applied to two digital phantoms and a simulated phantom introduced with various levels of noise. Results: For the Shepp-Logan head phantom, the aDCT filter filled the gaps effectively. For the Jaszczak phantom, no secondary artifacts were induced after aDCT filtering. The percent mean square error and mean structure similarity of the aDCT filter were superior to those of the DCT2 filter at all noise levels. For the simulated striatal dopamine innervation study, the aDCT filter recovered the shape of the striatum and restored the striatum to reference activity ratios to the ideal value. Conclusions: The proposed aDCT filter can recover the missing gap data in the sinogram and improve the image quality and quantitative accuracy of PET images.

Deteksi Pemalsuan Citra dengan Teknik Copy-Move Menggunakan Metode Ordinal Measure dari Koefisien Discrete Cosine Transform

Directory of Open Access Journals (Sweden)

Zulfan

2016-07-01

Full Text Available This article discusses a new method for the detection of forgery images generated by copy-move technique. Copy-move technique is one of image forgery techniques which taking a particular object from its original image and add it on that image for the purpose of increasing the number of or changing the same object in the original image. This study aims to detect the forged image generated by the copy-move techniques and copy-move forged image that has been modified by the rotation operation and histogram equalization. Detection feature used is Ordinal Measure of Discrete Cosine Transform coefficient (OM-DCT. Detection starts with division of the image into a block size of BXB (B = 16x16, 32x32 and 64x64 and two-dimensional DCT was performed to each of blocks. The feature distance from the original to the fake image, was calculated by the Euclidian distance and each feature has a distance of less than or equal to the threshold value (T according to the observations will be marked as a forged part. The results show that there are blocks detected on the copy-move image, whether on the unmodified copy-move forge image or those which modified by the rotation operation and histogram equalization. The number of blocks that are found in the copy-move object varies according to the size of the detection block used.

The discrete Fourier transform theory, algorithms and applications

CERN Document Server

Sundaraajan, D

2001-01-01

This authoritative book provides comprehensive coverage of practical Fourier analysis. It develops the concepts right from the basics and gradually guides the reader to the advanced topics. It presents the latest and practically efficient DFT algorithms, as well as the computation of discrete cosine and Walsh-Hadamard transforms. The large number of visual aids such as figures, flow graphs and flow charts makes the mathematical topic easy to understand. In addition, the numerous examples and the set of C-language programs (a supplement to the book) help greatly in understanding the theory and

Automatic gender determination from 3D digital maxillary tooth plaster models based on the random forest algorithm and discrete cosine transform.

Science.gov (United States)

Akkoç, Betül; Arslan, Ahmet; Kök, Hatice

2017-05-01

One of the first stages in the identification of an individual is gender determination. Through gender determination, the search spectrum can be reduced. In disasters such as accidents or fires, which can render identification somewhat difficult, durable teeth are an important source for identification. This study proposes a smart system that can automatically determine gender using 3D digital maxillary tooth plaster models. The study group was composed of 40 Turkish individuals (20 female, 20 male) between the ages of 21 and 24. Using the iterative closest point (ICP) algorithm, tooth models were aligned, and after the segmentation process, models were transformed into depth images. The local discrete cosine transform (DCT) was used in the process of feature extraction, and the random forest (RF) algorithm was used for the process of classification. Classification was performed using 30 different seeds for random generator values and 10-fold cross-validation. A value of 85.166% was obtained for average classification accuracy (CA) and a value of 91.75% for the area under the ROC curve (AUC). A multi-disciplinary study is performed here that includes computer sciences, medicine and dentistry. A smart system is proposed for the determination of gender from 3D digital models of maxillary tooth plaster models. This study has the capacity to extend the field of gender determination from teeth. Copyright © 2017 Elsevier B.V. All rights reserved.

A robust image watermarking in contourlet transform domain

Science.gov (United States)

Sharma, Rajat; Gupta, Abhishek Kumar; Singh, Deepak; Verma, Vivek Singh; Bhardwaj, Anuj

2017-10-01

A lot of work has been done in the field of image watermarking to overcome the problems of rightful ownership, copyright protection etc. In order to provide a robust solution of such issues, the authors propose a hybrid approach that involves contourlet, lifting wavelet, and discrete cosine transform. The first level coefficients of the original image which are obtained using contourlet transform are further decomposed using one level lifting wavelet transform. After that, these coefficients are modified using discrete cosine transform. Whereas, second level subband of contourlet transform coefficients are used to obtain block wise modification parameter based on edge detection and entropy calculations. Watermark bits are embedded by quantizing the discrete cosine transform coefficient blocks obtained using HL sub-band of first level lifting wavelet transform coefficients. The experimental results reveal that the proposed scheme has high robustness and imperceptibility.

Digital Watermarks Using Discrete Wavelet Transformation and Spectrum Spreading

Directory of Open Access Journals (Sweden)

Ryousuke Takai

2003-12-01

Full Text Available In recent tears, digital media makes rapid progress through the development of digital technology. Digital media normally assures fairly high quality, nevertheless can be easily reproduced in a perfect form. This perfect reproducibility takes and advantage from a certain point of view, while it produces an essential disadvantage, since digital media is frequently copied illegally. Thus the problem of the copyright protection becomes a very important issue. A solution of this problem is to embed digital watermarks that is not perceived clearly by usual people, but represents the proper right of original product. In our method, the images data in the frequency domain are transformed by the Discrete Wavelet Transform and analyzed by the multi resolution approximation, [1]. Further, the spectrum spreading is executed by using PN-sequences. Choi and Aizawa [7] embed watermarks by using block correlation of DCT coefficients. Thus, we apply Discrete Cosine Transformation, abbreviated to DCT, instead of the Fourier transformation in order to embed watermarks.If the value of this variance is high then we decide that the block has bigger magnitude for visual fluctuations. Henceforth, we may embed stronger watermarks, which gives resistance for images processing, such as attacks and/or compressions.

A Ramp Cosine Cepstrum Model for the Parameter Estimation of Autoregressive Systems at Low SNR

Directory of Open Access Journals (Sweden)

Zhu Wei-Ping

2010-01-01

Full Text Available A new cosine cepstrum model-based scheme is presented for the parameter estimation of a minimum-phase autoregressive (AR system under low levels of signal-to-noise ratio (SNR. A ramp cosine cepstrum (RCC model for the one-sided autocorrelation function (OSACF of an AR signal is first proposed by considering both white noise and periodic impulse-train excitations. Using the RCC model, a residue-based least-squares optimization technique that guarantees the stability of the system is then presented in order to estimate the AR parameters from noisy output observations. For the purpose of implementation, the discrete cosine transform, which can efficiently handle the phase unwrapping problem and offer computational advantages as compared to the discrete Fourier transform, is employed. From extensive experimentations on AR systems of different orders, it is shown that the proposed method is capable of estimating parameters accurately and consistently in comparison to some of the existing methods for the SNR levels as low as −5 dB. As a practical application of the proposed technique, simulation results are also provided for the identification of a human vocal tract system using noise-corrupted natural speech signals demonstrating a superior estimation performance in terms of the power spectral density of the synthesized speech signals.

Discretization of four types of Weyl group orbit functions

International Nuclear Information System (INIS)

Hrivnák, Jiří

2013-01-01

The discrete Fourier calculus of the four families of special functions, called C–, S–, S s – and S l -functions, is summarized. Functions from each of the four families of special functions are discretely orthogonal over a certain finite set of points. The generalizations of discrete cosine and sine transforms of one variable — the discrete S s – and S l -transforms of the group F 4 — are considered in detail required for their exploitation in discrete Fourier spectral methods. The continuous interpolations, induced by the discrete expansions, are presented

Baecklund transformations for discrete Painleve equations: Discrete PII-PV

International Nuclear Information System (INIS)

Sakka, A.; Mugan, U.

2006-01-01

Transformation properties of discrete Painleve equations are investigated by using an algorithmic method. This method yields explicit transformations which relates the solutions of discrete Painleve equations, discrete P II -P V , with different values of parameters. The particular solutions which are expressible in terms of the discrete analogue of the classical special functions of discrete Painleve equations can also be obtained from these transformations

Analytic discrete cosine harmonic wavelet transform based OFDM ...

Indian Academy of Sciences (India)

ADCHWT_OFDM) has been proposed in this paper. Analytic DCHWT has been realized by applying DCHWT to the original signal and to its Hilbert transform. ADCHWT has been found to be computationally efficient and very effective in improving ...

3-D Discrete Analytical Ridgelet Transform

OpenAIRE

Helbert , David; Carré , Philippe; Andrès , Éric

2006-01-01

International audience; In this paper, we propose an implementation of the 3-D Ridgelet transform: the 3-D discrete analytical Ridgelet transform (3-D DART). This transform uses the Fourier strategy for the computation of the associated 3-D discrete Radon transform. The innovative step is the definition of a discrete 3-D transform with the discrete analytical geometry theory by the construction of 3-D discrete analytical lines in the Fourier domain. We propose two types of 3-D discrete lines:...

Comparative analysis of chosen transforms in the context of de-noising harmonic signals

Directory of Open Access Journals (Sweden)

Artur Zacniewski

2015-09-01

Full Text Available In the article, comparison of popular transforms used i.a. in denoising harmonical signals was presented. The division of signals submitted to mathematical analysis was shown and chosen transforms such as Short Time Fourier Transform, Wigner-Ville Distribution, Wavelet Transform and Discrete Cosine Transform were presented. Harmonic signal with white noise added was submitted for research. During research, the parameters of noise were changed to analyze the effects of using particular transform on noised signal. The importance of right choice for transform and its parameters (different for particular kind of transform was shown. Small changes in parameters or different functions used in transform can lead to considerably different results.[b]Keywords[/b]: denoising of harmonical signals, wavelet transform, discrete cosine transform, DCT

Efficient Implementation of Complex Modulated Filter Banks Using Cosine and Sine Modulated Filter Banks

Directory of Open Access Journals (Sweden)

Viholainen Ari

2006-01-01

Full Text Available The recently introduced exponentially modulated filter bank (EMFB is a -channel uniform, orthogonal, critically sampled, and frequency-selective complex modulated filter bank that satisfies the perfect reconstruction (PR property if the prototype filter of an -channel PR cosine modulated filter bank (CMFB is used. The purpose of this paper is to present various implementation structures for the EMFBs in a unified framework. The key idea is to use cosine and sine modulated filter banks as building blocks and, therefore, polyphase, lattice, and extended lapped transform (ELT type of implementation solutions are studied. The ELT-based EMFBs are observed to be very competitive with the existing modified discrete Fourier transform filter banks (MDFT-FBs when comparing the number of multiplications/additions and the structural simplicity. In addition, EMFB provides an alternative channel stacking arrangement that could be more natural in certain subband processing applications and data transmission systems.

Large quantum Fourier transforms are never exactly realized by braiding conformal blocks

International Nuclear Information System (INIS)

Freedman, Michael H.; Wang, Zhenghan

2007-01-01

Fourier transform is an essential ingredient in Shor's factoring algorithm. In the standard quantum circuit model with the gate set {U(2), controlled-NOT}, the discrete Fourier transforms F N =(ω ij ) NxN , i,j=0,1,...,N-1, ω=e 2πi at ∼sol∼ at N , can be realized exactly by quantum circuits of size O(n 2 ), n=ln N, and so can the discrete sine or cosine transforms. In topological quantum computing, the simplest universal topological quantum computer is based on the Fibonacci (2+1)-topological quantum field theory (TQFT), where the standard quantum circuits are replaced by unitary transformations realized by braiding conformal blocks. We report here that the large Fourier transforms F N and the discrete sine or cosine transforms can never be realized exactly by braiding conformal blocks for a fixed TQFT. It follows that an approximation is unavoidable in the implementation of Fourier transforms by braiding conformal blocks

Solution of the Doppler broadening function based on the fourier cosine transform

Energy Technology Data Exchange (ETDEWEB)

Goncalves, Alessandro da C [COPPE/UFRJ - Programa de Engenharia Nuclear, Universidade Federal do Rio de Janeiro, P.O. Box 68509, 21941-914 Rio de Janeiro, RJ (Brazil)], E-mail: agoncalves@con.ufrj.br; Martinez, Aquilino S.; Silva, Fernando C. da [COPPE/UFRJ - Programa de Engenharia Nuclear, Universidade Federal do Rio de Janeiro, P.O. Box 68509, 21941-914 Rio de Janeiro, RJ (Brazil)

2008-10-15

This paper provides a new integral representation for the Doppler broadening function {psi}({xi}, x), which is interpreted as being a Fourier cosine transform. This integral form allows the obtaining of an analytical solution in a simple and accurate functional manner as regards the elementary functions. The solution obtained through the new integral representation can be widely used in several applications such as the calculation of self-shielding factors and measurement corrections for the microscopic cross section through the activation technique.

Solution of the Doppler broadening function based on the fourier cosine transform

International Nuclear Information System (INIS)

Goncalves, Alessandro da C; Martinez, Aquilino S.; Silva, Fernando C. da

2008-01-01

This paper provides a new integral representation for the Doppler broadening function ψ(ξ, x), which is interpreted as being a Fourier cosine transform. This integral form allows the obtaining of an analytical solution in a simple and accurate functional manner as regards the elementary functions. The solution obtained through the new integral representation can be widely used in several applications such as the calculation of self-shielding factors and measurement corrections for the microscopic cross section through the activation technique

3-D discrete analytical ridgelet transform.

Science.gov (United States)

Helbert, David; Carré, Philippe; Andres, Eric

2006-12-01

In this paper, we propose an implementation of the 3-D Ridgelet transform: the 3-D discrete analytical Ridgelet transform (3-D DART). This transform uses the Fourier strategy for the computation of the associated 3-D discrete Radon transform. The innovative step is the definition of a discrete 3-D transform with the discrete analytical geometry theory by the construction of 3-D discrete analytical lines in the Fourier domain. We propose two types of 3-D discrete lines: 3-D discrete radial lines going through the origin defined from their orthogonal projections and 3-D planes covered with 2-D discrete line segments. These discrete analytical lines have a parameter called arithmetical thickness, allowing us to define a 3-D DART adapted to a specific application. Indeed, the 3-D DART representation is not orthogonal, It is associated with a flexible redundancy factor. The 3-D DART has a very simple forward/inverse algorithm that provides an exact reconstruction without any iterative method. In order to illustrate the potentiality of this new discrete transform, we apply the 3-D DART and its extension to the Local-DART (with smooth windowing) to the denoising of 3-D image and color video. These experimental results show that the simple thresholding of the 3-D DART coefficients is efficient.

On E-discretization of tori of compact simple Lie groups. II

Science.gov (United States)

Hrivnák, Jiří; Juránek, Michal

2017-10-01

Ten types of discrete Fourier transforms of Weyl orbit functions are developed. Generalizing one-dimensional cosine, sine, and exponential, each type of the Weyl orbit function represents an exponential symmetrized with respect to a subgroup of the Weyl group. Fundamental domains of even affine and dual even affine Weyl groups, governing the argument and label symmetries of the even orbit functions, are determined. The discrete orthogonality relations are formulated on finite sets of points from the refinements of the dual weight lattices. Explicit counting formulas for the number of points of the discrete transforms are deduced. Real-valued Hartley orbit functions are introduced, and all ten types of the corresponding discrete Hartley transforms are detailed.

Discrete Gabor transform and discrete Zak transform

NARCIS (Netherlands)

Bastiaans, M.J.; Namazi, N.M.; Matthews, K.

1996-01-01

Gabor's expansion of a discrete-time signal into a set of shifted and modulated versions of an elementary signal or synthesis window is introduced, along with the inverse operation, i.e. the Gabor transform, which uses an analysis window that is related to the synthesis window and with the help of

Study on the algorithm of computational ghost imaging based on discrete fourier transform measurement matrix

Science.gov (United States)

Zhang, Leihong; Liang, Dong; Li, Bei; Kang, Yi; Pan, Zilan; Zhang, Dawei; Gao, Xiumin; Ma, Xiuhua

2016-07-01

On the basis of analyzing the cosine light field with determined analytic expression and the pseudo-inverse method, the object is illuminated by a presetting light field with a determined discrete Fourier transform measurement matrix, and the object image is reconstructed by the pseudo-inverse method. The analytic expression of the algorithm of computational ghost imaging based on discrete Fourier transform measurement matrix is deduced theoretically, and compared with the algorithm of compressive computational ghost imaging based on random measurement matrix. The reconstruction process and the reconstruction error are analyzed. On this basis, the simulation is done to verify the theoretical analysis. When the sampling measurement number is similar to the number of object pixel, the rank of discrete Fourier transform matrix is the same as the one of the random measurement matrix, the PSNR of the reconstruction image of FGI algorithm and PGI algorithm are similar, the reconstruction error of the traditional CGI algorithm is lower than that of reconstruction image based on FGI algorithm and PGI algorithm. As the decreasing of the number of sampling measurement, the PSNR of reconstruction image based on FGI algorithm decreases slowly, and the PSNR of reconstruction image based on PGI algorithm and CGI algorithm decreases sharply. The reconstruction time of FGI algorithm is lower than that of other algorithms and is not affected by the number of sampling measurement. The FGI algorithm can effectively filter out the random white noise through a low-pass filter and realize the reconstruction denoising which has a higher denoising capability than that of the CGI algorithm. The FGI algorithm can improve the reconstruction accuracy and the reconstruction speed of computational ghost imaging.

Discrete integrable systems and hodograph transformations arising from motions of discrete plane curves

International Nuclear Information System (INIS)

Feng Baofeng; Maruno, Ken-ichi; Inoguchi, Jun-ichi; Kajiwara, Kenji; Ohta, Yasuhiro

2011-01-01

We consider integrable discretizations of some soliton equations associated with the motions of plane curves: the Wadati-Konno-Ichikawa elastic beam equation, the complex Dym equation and the short pulse equation. They are related to the modified KdV or the sine-Gordon equations by the hodograph transformations. Based on the observation that the hodograph transformations are regarded as the Euler-Lagrange transformations of the curve motions, we construct the discrete analogues of the hodograph transformations, which yield integrable discretizations of those soliton equations. (paper)

Segmentation Technique for Image Indexing and Retrieval on Discrete Cosines Domain

Directory of Open Access Journals (Sweden)

Suhendro Yusuf Irianto

2013-03-01

Full Text Available This paper uses region growing segmentation technique to segment the Discrete Cosines (DC  image. The problem of content Based image retrieval (CBIR is the luck of accuracy in matching between image query and image in the database as it matches object and background in the same time.   This the reason previous CBIR techniques inaccurate and time consuming. The CBIR   based on the segmented region proposed in this work  separates object from background as CBIR need only match the object not the background.  By using region growing technique on DC image, it reduces the number of image       regions.    The proposed of recursive region growing is not new technique but its application on DC images to build    indexing keys is quite new and not yet presented by many     authors. The experimental results show  that the proposed methods on   segmented images present good precision which are higher than 0.60 on all classes . It can be concluded that  region growing segmented based CBIR more efficient    compare to DC images  in term of their precision 0.59 and 0.75, respectively. Moreover,  DC based CBIR  can save time and simplify algorithm compare to DCT images.

On the discrete Gabor transform and the discrete Zak transform

NARCIS (Netherlands)

Bastiaans, M.J.; Geilen, M.C.W.

1996-01-01

Gabor's expansion of a discrete-time signal into a set of shifted and modulated versions of an elementary signal (or synthesis window) and the inverse operation -- the Gabor transform -- with which Gabor's expansion coefficients can be determined, are introduced. It is shown how, in the case of a

A Fast, Simple, and Stable Chebyshev--Legendre Transform Using an Asymptotic Formula

KAUST Repository

Hale, Nicholas; Townsend, Alex

2014-01-01

-known asymptotic formula for Legendre polynomials of large degree as a weighted linear combination of Chebyshev polynomials, which can then be evaluated by using the discrete cosine transform. Numerical results are provided to demonstrate the efficiency

A new expression for doppler broadening function based on Fourier Cosine Transform

Energy Technology Data Exchange (ETDEWEB)

Goncalves, Alessandro da C.; Martinez, Aquilino S.; Silva, Fernando C. da [Universidade Federal, Rio de Janeiro, RJ (Brazil). Coordenacao dos Programas de Pos-graduacao de Engenharia. Programa de Engenharia Nuclear]. E-mails: agoncalves@con.ufrj.br; aquilino@lmp.ufrj.br; fernando@con.ufrj.br

2007-07-01

The main objective of this paper consists of the derivation of an analytical solution for the Doppler broadening function {psi} ({xi}, x). The analytical solution is derived from a new integral expression for the {psi} ({xi}, x) function, which can be interpreted as a Fourier cosine transform. The expression obtained for {psi} ({xi}, x) in terms of elementary functions, proved quite simple and accurate, leading to a similar solution obtained through the differential equation for the {psi} ({xi}, x) function, using the methods of Frobenius and of parameter variation. The Doppler broadening function is widely used in applications related to the treatment of nuclear resonances, calculations of multigroup parameters and resonance self-shielding factors, and to correct microscopic cross section measurements through the activation technique. (author)

A new expression for doppler broadening function based on Fourier Cosine Transform

International Nuclear Information System (INIS)

Goncalves, Alessandro da C.; Martinez, Aquilino S.; Silva, Fernando C. da

2007-01-01

The main objective of this paper consists of the derivation of an analytical solution for the Doppler broadening function Ψ (ξ, x). The analytical solution is derived from a new integral expression for the Ψ (ξ, x) function, which can be interpreted as a Fourier cosine transform. The expression obtained for Ψ (ξ, x) in terms of elementary functions, proved quite simple and accurate, leading to a similar solution obtained through the differential equation for the Ψ (ξ, x) function, using the methods of Frobenius and of parameter variation. The Doppler broadening function is widely used in applications related to the treatment of nuclear resonances, calculations of multigroup parameters and resonance self-shielding factors, and to correct microscopic cross section measurements through the activation technique. (author)

Calculation Scheme Based on a Weighted Primitive: Application to Image Processing Transforms

Directory of Open Access Journals (Sweden)

Gregorio de Miguel Casado

2007-01-01

Full Text Available This paper presents a method to improve the calculation of functions which specially demand a great amount of computing resources. The method is based on the choice of a weighted primitive which enables the calculation of function values under the scope of a recursive operation. When tackling the design level, the method shows suitable for developing a processor which achieves a satisfying trade-off between time delay, area costs, and stability. The method is particularly suitable for the mathematical transforms used in signal processing applications. A generic calculation scheme is developed for the discrete fast Fourier transform (DFT and then applied to other integral transforms such as the discrete Hartley transform (DHT, the discrete cosine transform (DCT, and the discrete sine transform (DST. Some comparisons with other well-known proposals are also provided.

Implementation of quantum and classical discrete fractional Fourier transforms

Science.gov (United States)

Weimann, Steffen; Perez-Leija, Armando; Lebugle, Maxime; Keil, Robert; Tichy, Malte; Gräfe, Markus; Heilmann, René; Nolte, Stefan; Moya-Cessa, Hector; Weihs, Gregor; Christodoulides, Demetrios N.; Szameit, Alexander

2016-01-01

Fourier transforms, integer and fractional, are ubiquitous mathematical tools in basic and applied science. Certainly, since the ordinary Fourier transform is merely a particular case of a continuous set of fractional Fourier domains, every property and application of the ordinary Fourier transform becomes a special case of the fractional Fourier transform. Despite the great practical importance of the discrete Fourier transform, implementation of fractional orders of the corresponding discrete operation has been elusive. Here we report classical and quantum optical realizations of the discrete fractional Fourier transform. In the context of classical optics, we implement discrete fractional Fourier transforms of exemplary wave functions and experimentally demonstrate the shift theorem. Moreover, we apply this approach in the quantum realm to Fourier transform separable and path-entangled biphoton wave functions. The proposed approach is versatile and could find applications in various fields where Fourier transforms are essential tools. PMID:27006089

Implementation of quantum and classical discrete fractional Fourier transforms.

Science.gov (United States)

Weimann, Steffen; Perez-Leija, Armando; Lebugle, Maxime; Keil, Robert; Tichy, Malte; Gräfe, Markus; Heilmann, René; Nolte, Stefan; Moya-Cessa, Hector; Weihs, Gregor; Christodoulides, Demetrios N; Szameit, Alexander

2016-03-23

Fourier transforms, integer and fractional, are ubiquitous mathematical tools in basic and applied science. Certainly, since the ordinary Fourier transform is merely a particular case of a continuous set of fractional Fourier domains, every property and application of the ordinary Fourier transform becomes a special case of the fractional Fourier transform. Despite the great practical importance of the discrete Fourier transform, implementation of fractional orders of the corresponding discrete operation has been elusive. Here we report classical and quantum optical realizations of the discrete fractional Fourier transform. In the context of classical optics, we implement discrete fractional Fourier transforms of exemplary wave functions and experimentally demonstrate the shift theorem. Moreover, we apply this approach in the quantum realm to Fourier transform separable and path-entangled biphoton wave functions. The proposed approach is versatile and could find applications in various fields where Fourier transforms are essential tools.

A discrete dislocation–transformation model for austenitic single crystals

International Nuclear Information System (INIS)

Shi, J; Turteltaub, S; Remmers, J J C; Van der Giessen, E

2008-01-01

A discrete model for analyzing the interaction between plastic flow and martensitic phase transformations is developed. The model is intended for simulating the microstructure evolution in a single crystal of austenite that transforms non-homogeneously into martensite. The plastic flow in the untransformed austenite is simulated using a plane-strain discrete dislocation model. The phase transformation is modeled via the nucleation and growth of discrete martensitic regions embedded in the austenitic single crystal. At each instant during loading, the coupled elasto-plasto-transformation problem is solved using the superposition of analytical solutions for the discrete dislocations and discrete transformation regions embedded in an infinite homogeneous medium and the numerical solution of a complementary problem used to enforce the actual boundary conditions and the heterogeneities in the medium. In order to describe the nucleation and growth of martensitic regions, a nucleation criterion and a kinetic law suitable for discrete regions are specified. The constitutive rules used in discrete dislocation simulations are supplemented with additional evolution rules to account for the phase transformation. To illustrate the basic features of the model, simulations of specimens under plane-strain uniaxial extension and contraction are analyzed. The simulations indicate that plastic flow reduces the average stress at which transformation begins, but it also reduces the transformation rate when compared with benchmark simulations without plasticity. Furthermore, due to local stress fluctuations caused by dislocations, martensitic systems can be activated even though transformation would not appear to be favorable based on the average stress. Conversely, the simulations indicate that the plastic hardening behavior is influenced by the reduction in the effective austenitic grain size due to the evolution of transformation. During cyclic simulations, the coupled plasticity-transformation

Image Retrieval Algorithm Based on Discrete Fractional Transforms

Science.gov (United States)

Jindal, Neeru; Singh, Kulbir

2013-06-01

The discrete fractional transforms is a signal processing tool which suggests computational algorithms and solutions to various sophisticated applications. In this paper, a new technique to retrieve the encrypted and scrambled image based on discrete fractional transforms has been proposed. Two-dimensional image was encrypted using discrete fractional transforms with three fractional orders and two random phase masks placed in the two intermediate planes. The significant feature of discrete fractional transforms benefits from its extra degree of freedom that is provided by its fractional orders. Security strength was enhanced (1024!)4 times by scrambling the encrypted image. In decryption process, image retrieval is sensitive for both correct fractional order keys and scrambling algorithm. The proposed approach make the brute force attack infeasible. Mean square error and relative error are the recital parameters to verify validity of proposed method.

A Baecklund transformation between two integrable discrete hungry systems

International Nuclear Information System (INIS)

Fukuda, Akiko; Yamamoto, Yusaku; Iwasaki, Masashi; Ishiwata, Emiko; Nakamura, Yoshimasa

2011-01-01

The discrete hungry Toda (dhToda) equation and the discrete hungry Lotka-Volterra (dhLV) system are known as integrable discrete hungry systems. In this Letter, through finding the LR transformations associated with the dhToda equation and the dhLV system, we present a Baecklund transformation between these integrable systems.

A Baecklund transformation between two integrable discrete hungry systems

Energy Technology Data Exchange (ETDEWEB)

Fukuda, Akiko, E-mail: j1409704@ed.kagu.tus.ac.j [Department of Mathematical Information Science, Graduate School of Science, Tokyo University of Science, 1-3 Kagurazaka, Shinjuku-ku, Tokyo 162-8601 (Japan); Yamamoto, Yusaku [Graduate School of System Informatics, Kobe University, 1-1 Rokkodai-cho, Nada-ku, Kobe 657-8501 (Japan); Iwasaki, Masashi [Department of Informatics and Environmental Science, Kyoto Prefectural University, 1-5, Nakaragi-cho, Shimogamo, Sakyo-ku, Kyoto 606-8522 (Japan); Ishiwata, Emiko [Department of Mathematical Information Science, Tokyo University of Science, 1-3 Kagurazaka, Shinjuku-ku, Tokyo 162-8601 (Japan); Nakamura, Yoshimasa [Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto 606-8501 (Japan)

2011-01-17

The discrete hungry Toda (dhToda) equation and the discrete hungry Lotka-Volterra (dhLV) system are known as integrable discrete hungry systems. In this Letter, through finding the LR transformations associated with the dhToda equation and the dhLV system, we present a Baecklund transformation between these integrable systems.

A NEW DISCRETE HARTLEY TRANSFORM PRECODING BASED INTERLEAVED-OFDMA UPLINK SYSTEM WITH REDUCED PAPR FOR 4G CELLULAR NETWORKS

Directory of Open Access Journals (Sweden)

VARUN JEOTI

2011-12-01

Full Text Available High peak-to-average power ratio (PAPR reduction is one of the major challenges in orthogonal frequency division multiple access (OFDMA systems since last decades. High PAPR increases the complexity of analogue-to-digital (A/D and digital-to-analogue (D/A convertors and also reduces the efficiency of RF high-power-amplifier (HPA. In this paper, we present a new Discrete- Hartley transform (DHT precoding based interleaved-OFDMA uplink system for PAPR reduction in the upcoming 4G cellular networks. Extensive computer simulations have been performed to analyze the PAPR of the proposed system with root-raised-cosine (RRC pulse shaping. We also compare simulation results of the proposed system with the conventional interleaved-OFDMA uplink systems and the Walsh-Hadamard transform (WHT precoding based interleaved-OFDMA uplink systems. It is concluded from the computer simulations that the proposed system has low PAPR as compared to the conventional interleaved-OFDMA uplink systems and the WHT precoded interleaved-OFDMA uplink systems.

The discrete Painleve II equations: Miura and auto-Baecklund transformations

International Nuclear Information System (INIS)

Carstea, A S; Ramani, A; Willox, R; Grammaticos, B

2003-01-01

We present Miura transformations for all discrete Painleve II equations known to date. We then use these Miuras to derive special solutions in terms of discrete Airy functions and to construct auto-Baecklund transformations for the discrete Painleve equations. These transformations are then used to generate rational solutions. Some new forms of d-P II and d-P 34 are obtained as well

Algorithms for Fast Computing of the 3D-DCT Transform

Directory of Open Access Journals (Sweden)

S. Hanus

2003-04-01

Full Text Available The algorithm for video compression based on the Three-DimensionalDiscrete Cosine Transform (3D-DCT is presented. The original algorithmof the 3D-DCT has high time complexity. We propose several enhancementsto the original algorithm and make the calculation of the DCT algorithmfeasible for future real-time video compression.

COMPARATIVE ANALYSIS OF APPLICATION EFFICIENCY OF ORTHOGONAL TRANSFORMATIONS IN FREQUENCY ALGORITHMS FOR DIGITAL IMAGE WATERMARKING

Directory of Open Access Journals (Sweden)

Vladimir A. Batura

2014-11-01

Full Text Available The efficiency of orthogonal transformations application in the frequency algorithms of the digital watermarking of still images is examined. Discrete Hadamard transform, discrete cosine transform and discrete Haar transform are selected. Their effectiveness is determined by the invisibility of embedded in digital image watermark and its resistance to the most common image processing operations: JPEG-compression, noising, changing of the brightness and image size, histogram equalization. The algorithm for digital watermarking and its embedding parameters remain unchanged at these orthogonal transformations. Imperceptibility of embedding is defined by the peak signal to noise ratio, watermark stability– by Pearson's correlation coefficient. Embedding is considered to be invisible, if the value of the peak signal to noise ratio is not less than 43 dB. Embedded watermark is considered to be resistant to a specific attack, if the Pearson’s correlation coefficient is not less than 0.5. Elham algorithm based on the image entropy is chosen for computing experiment. Computing experiment is carried out according to the following algorithm: embedding of a digital watermark in low-frequency area of the image (container by Elham algorithm, exposure to a harmful influence on the protected image (cover image, extraction of a digital watermark. These actions are followed by quality assessment of cover image and watermark on the basis of which efficiency of orthogonal transformation is defined. As a result of computing experiment it was determined that the choice of the specified orthogonal transformations at identical algorithm and parameters of embedding doesn't influence the degree of imperceptibility for a watermark. Efficiency of discrete Hadamard transform and discrete cosine transformation in relation to the attacks chosen for experiment was established based on the correlation indicators. Application of discrete Hadamard transform increases

Geometric Representations for Discrete Fourier Transforms

Science.gov (United States)

Cambell, C. W.

1986-01-01

Simple geometric representations show symmetry and periodicity of discrete Fourier transforms (DFT's). Help in visualizing requirements for storing and manipulating transform value in computations. Representations useful in any number of dimensions, but particularly in one-, two-, and three-dimensional cases often encountered in practice.

Darboux and binary Darboux transformations for discrete integrable systems I. Discrete potential KdV equation

International Nuclear Information System (INIS)

Shi, Ying; Zhang, Da-jun; Nimmo, Jonathan J C

2014-01-01

The Hirota–Miwa equation can be written in ‘nonlinear’ form in two ways: the discrete KP equation and, by using a compatible continuous variable, the discrete potential KP equation. For both systems, we consider the Darboux and binary Darboux transformations, expressed in terms of the continuous variable, and obtain exact solutions in Wronskian and Grammian form. We discuss reductions of both systems to the discrete KdV and discrete potential KdV equation, respectively, and exploit this connection to find the Darboux and binary Darboux transformations and exact solutions of these equations. (paper)

Approximating the Analytic Fourier Transform with the Discrete Fourier Transform

OpenAIRE

Axelrod, Jeremy

2015-01-01

The Fourier transform is approximated over a finite domain using a Riemann sum. This Riemann sum is then expressed in terms of the discrete Fourier transform, which allows the sum to be computed with a fast Fourier transform algorithm more rapidly than via a direct matrix multiplication. Advantages and limitations of using this method to approximate the Fourier transform are discussed, and prototypical MATLAB codes implementing the method are presented.

Discrete fourier transform (DFT) analysis for applications using iterative transform methods

Science.gov (United States)

Dean, Bruce H. (Inventor)

2012-01-01

According to various embodiments, a method is provided for determining aberration data for an optical system. The method comprises collecting a data signal, and generating a pre-transformation algorithm. The data is pre-transformed by multiplying the data with the pre-transformation algorithm. A discrete Fourier transform of the pre-transformed data is performed in an iterative loop. The method further comprises back-transforming the data to generate aberration data.

Discrete transforms

CERN Document Server

Firth, Jean M

1992-01-01

The analysis of signals and systems using transform methods is a very important aspect of the examination of processes and problems in an increasingly wide range of applications. Whereas the initial impetus in the development of methods appropriate for handling discrete sets of data occurred mainly in an electrical engineering context (for example in the design of digital filters), the same techniques are in use in such disciplines as cardiology, optics, speech analysis and management, as well as in other branches of science and engineering. This text is aimed at a readership whose mathematical background includes some acquaintance with complex numbers, linear differen­ tial equations, matrix algebra, and series. Specifically, a familiarity with Fourier series (in trigonometric and exponential forms) is assumed, and an exposure to the concept of a continuous integral transform is desirable. Such a background can be expected, for example, on completion of the first year of a science or engineering degree cour...

Alternating multivariate trigonometric functions and corresponding Fourier transforms

International Nuclear Information System (INIS)

Klimyk, A U; Patera, J

2008-01-01

We define and study multivariate sine and cosine functions, symmetric with respect to the alternating group A n , which is a subgroup of the permutation (symmetric) group S n . These functions are eigenfunctions of the Laplace operator. They determine Fourier-type transforms. There exist three types of such transforms: expansions into corresponding sine-Fourier and cosine-Fourier series, integral sine-Fourier and cosine-Fourier transforms, and multivariate finite sine and cosine transforms. In all these transforms, alternating multivariate sine and cosine functions are used as a kernel

Error analysis and new dual-cosine window for estimating the sensor frequency response function from the step response data

Science.gov (United States)

Yang, Shuang-Long; Liang, Li-Ping; Liu, Hou-De; Xu, Ke-Jun

2018-03-01

Aiming at reducing the estimation error of the sensor frequency response function (FRF) estimated by the commonly used window-based spectral estimation method, the error models of interpolation and transient errors are derived in the form of non-parameter models. Accordingly, window effects on the errors are analyzed and reveal that the commonly used hanning window leads to smaller interpolation error which can also be significantly eliminated by the cubic spline interpolation method when estimating the FRF from the step response data, and window with smaller front-end value can restrain more transient error. Thus, a new dual-cosine window with its non-zero discrete Fourier transform bins at -3, -1, 0, 1, and 3 is constructed for FRF estimation. Compared with the hanning window, the new dual-cosine window has the equivalent interpolation error suppression capability and better transient error suppression capability when estimating the FRF from the step response; specifically, it reduces the asymptotic property of the transient error from O(N-2) of the hanning window method to O(N-4) while only increases the uncertainty slightly (about 0.4 dB). Then, one direction of a wind tunnel strain gauge balance which is a high order, small damping, and non-minimum phase system is employed as the example for verifying the new dual-cosine window-based spectral estimation method. The model simulation result shows that the new dual-cosine window method is better than the hanning window method for FRF estimation, and compared with the Gans method and LPM method, it has the advantages of simple computation, less time consumption, and short data requirement; the actual data calculation result of the balance FRF is consistent to the simulation result. Thus, the new dual-cosine window is effective and practical for FRF estimation.

Discrete linear canonical transform computation by adaptive method.

Science.gov (United States)

Zhang, Feng; Tao, Ran; Wang, Yue

2013-07-29

The linear canonical transform (LCT) describes the effect of quadratic phase systems on a wavefield and generalizes many optical transforms. In this paper, the computation method for the discrete LCT using the adaptive least-mean-square (LMS) algorithm is presented. The computation approaches of the block-based discrete LCT and the stream-based discrete LCT using the LMS algorithm are derived, and the implementation structures of these approaches by the adaptive filter system are considered. The proposed computation approaches have the inherent parallel structures which make them suitable for efficient VLSI implementations, and are robust to the propagation of possible errors in the computation process.

Cosine-Modulated Multitone for Very-High-Speed Digital Subscriber Lines

Directory of Open Access Journals (Sweden)

Lin Lekun

2006-01-01

Full Text Available In this paper, the use of cosine-modulated filter banks (CMFBs for multicarrier modulation in the application of very-high-speed digital subscriber lines (VDSLs is studied. We refer to this modulation technique as cosine-modulated multitone (CMT. CMT has the same transmitter structure as discrete wavelet multitone (DWMT. However, the receiver structure in CMT is different from its DWMT counterpart. DWMT uses linear combiner equalizers, which typically have more than 20 taps per subcarrier. CMT, on the other hand, adopts a receiver structure that uses only two taps per subcarrier for equalization. This paper has the following contributions. (i A modification that reduces the computational complexity of the receiver structure of CMT is proposed. (ii Although traditionally CMFBs are designed to satisfy perfect-reconstruction (PR property, in transmultiplexing applications, the presence of channel destroys the PR property of the filter bank, and thus other criteria of filter design should be adopted. We propose one such method. (iii Through extensive computer simulations, we compare CMT with zipper discrete multitone (z-DMT and filtered multitone (FMT, the two modulation techniques that have been included in the VDSL draft standard. Comparisons are made in terms of computational complexity, transmission latency, achievable bit rate, and resistance to radio ingress noise.

Metric distances derived from cosine similarity and Pearson and Spearman correlations

OpenAIRE

van Dongen, Stijn; Enright, Anton J.

2012-01-01

We investigate two classes of transformations of cosine similarity and Pearson and Spearman correlations into metric distances, utilising the simple tool of metric-preserving functions. The first class puts anti-correlated objects maximally far apart. Previously known transforms fall within this class. The second class collates correlated and anti-correlated objects. An example of such a transformation that yields a metric distance is the sine function when applied to centered data.

Lax Pairs for Discrete Integrable Equations via Darboux Transformations

International Nuclear Information System (INIS)

Cao Ce-Wen; Zhang Guang-Yao

2012-01-01

A method is developed to construct discrete Lax pairs using Darboux transformations. More kinds of Lax pairs are found for some newly appeared discrete integrable equations, including the H1, the special H3 and the Q1 models in the Adler—Bobenko—Suris list and the closely related discrete and semi-discrete pKdV, pMKdV, SG and Liouville equations. (general)

Sines and Cosines. Part 1 of 3

Science.gov (United States)

Apostol, Tom M. (Editor)

1992-01-01

Applying the concept of similarities, the mathematical principles of circular motion and sine and cosine waves are presented utilizing both film footage and computer animation in this 'Project Mathematics' series video. Concepts presented include: the symmetry of sine waves; the cosine (complementary sine) and cosine waves; the use of sines and cosines on coordinate systems; the relationship they have to each other; the definitions and uses of periodic waves, square waves, sawtooth waves; the Gibbs phenomena; the use of sines and cosines as ratios; and the terminology related to sines and cosines (frequency, overtone, octave, intensity, and amplitude).

Properties of the Simpson discrete fourier transform | Singh ...

African Journals Online (AJOL)

The Simpson discrete Fourier transform (SDFT) and its inverse are transformations relating the time and frequency domains. In this paper we state and prove the important properties of shift, circular convolution, conjugation, time reversal and Plancherel's theorem. In addition, we provide an alternative representation of the ...

Efficient Pricing of European-Style Asian Options under Exponential Lévy Processes Based on Fourier Cosine Expansions

NARCIS (Netherlands)

Zhang, B.; Oosterlee, C.W.

2013-01-01

We propose an efficient pricing method for arithmetic and geometric Asian options under exponential Lévy processes based on Fourier cosine expansions and Clenshaw–Curtis quadrature. The pricing method is developed for both European style and American-style Asian options and for discretely and

Optical movie encryption based on a discrete multiple-parameter fractional Fourier transform

International Nuclear Information System (INIS)

Zhong, Zhi; Zhang, Yujie; Shan, Mingguang; Wang, Ying; Zhang, Yabin; Xie, Hong

2014-01-01

A movie encryption scheme is proposed using a discrete multiple-parameter fractional Fourier transform and theta modulation. After being modulated by sinusoidal amplitude grating, each frame of the movie is transformed by a filtering procedure and then multiplexed into a complex signal. The complex signal is multiplied by a pixel scrambling operation and random phase mask, and then encrypted by a discrete multiple-parameter fractional Fourier transform. The movie can be retrieved by using the correct keys, such as a random phase mask, a pixel scrambling operation, the parameters in a discrete multiple-parameter fractional Fourier transform and a time sequence. Numerical simulations have been performed to demonstrate the validity and the security of the proposed method. (paper)

A discrete Fourier transform for virtual memory machines

Science.gov (United States)

Galant, David C.

1992-01-01

An algebraic theory of the Discrete Fourier Transform is developed in great detail. Examination of the details of the theory leads to a computationally efficient fast Fourier transform for the use on computers with virtual memory. Such an algorithm is of great use on modern desktop machines. A FORTRAN coded version of the algorithm is given for the case when the sequence of numbers to be transformed is a power of two.

An analysis of the Simpson Discrete Hartley transform | Ramsunder ...

African Journals Online (AJOL)

The relatively new Simpson Discrete Hartley Transform (SDHT) has interesting mathematical properties, which are crucial for applications. These are developed and proved in this paper. This analysis gives one a comprehensive understanding of the transform. Mathematics Subject Classication (2010): 43A32. Key words: ...

Neutrosophic Refined Similarity Measure Based on Cosine Function

Directory of Open Access Journals (Sweden)

Said Broumi

2014-12-01

Full Text Available In this paper, the cosine similarity measure of neutrosophic refined (multi- sets is proposed and its properties are studied. The concept of this cosine similarity measure of neutrosophic refined sets is the extension of improved cosine similarity measure of single valued neutrosophic. Finally, using this cosine similarity measure of neutrosophic refined set, the application of medical diagnosis is presented.

Efficient pricing of Asian options under Lévy processes based on Fourier cosine expansions Part I : European-style products

NARCIS (Netherlands)

Zhang, B.; Oosterlee, C.W.

2011-01-01

We propose an efficient pricing method for arithmetic, and geometric, Asian options under Levy processes, based on Fourier cosine expansions and Clenshaw–Curtis quadrature. The pricing method is developed for both European–style and American–style Asian options, and for discretely and continuously

The su(2)α Hahn oscillator and a discrete Fourier-Hahn transform

International Nuclear Information System (INIS)

Jafarov, E I; Stoilova, N I; Van der Jeugt, J

2011-01-01

We define the quadratic algebra su(2) α which is a one-parameter deformation of the Lie algebra su(2) extended by a parity operator. The odd-dimensional representations of su(2) (with representation label j, a positive integer) can be extended to representations of su(2) α . We investigate a model of the finite one-dimensional harmonic oscillator based upon this algebra su(2) α . It turns out that in this model the spectrum of the position and momentum operator can be computed explicitly, and that the corresponding (discrete) wavefunctions can be determined in terms of Hahn polynomials. The operation mapping position wavefunctions into momentum wavefunctions is studied, and this so-called discrete Fourier-Hahn transform is computed explicitly. The matrix of this discrete Fourier-Hahn transform has many interesting properties, similar to those of the traditional discrete Fourier transform. (paper)

Discrete linear canonical transforms based on dilated Hermite functions.

Science.gov (United States)

Pei, Soo-Chang; Lai, Yun-Chiu

2011-08-01

Linear canonical transform (LCT) is very useful and powerful in signal processing and optics. In this paper, discrete LCT (DLCT) is proposed to approximate LCT by utilizing the discrete dilated Hermite functions. The Wigner distribution function is also used to investigate DLCT performances in the time-frequency domain. Compared with the existing digital computation of LCT, our proposed DLCT possess additivity and reversibility properties with no oversampling involved. In addition, the length of input/output signals will not be changed before and after the DLCT transformations, which is consistent with the time-frequency area-preserving nature of LCT; meanwhile, the proposed DLCT has very good approximation of continuous LCT.

Hyperbolic Cross Truncations for Stochastic Fourier Cosine Series

Science.gov (United States)

Zhang, Zhihua

2014-01-01

Based on our decomposition of stochastic processes and our asymptotic representations of Fourier cosine coefficients, we deduce an asymptotic formula of approximation errors of hyperbolic cross truncations for bivariate stochastic Fourier cosine series. Moreover we propose a kind of Fourier cosine expansions with polynomials factors such that the corresponding Fourier cosine coefficients decay very fast. Although our research is in the setting of stochastic processes, our results are also new for deterministic functions. PMID:25147842

Nuclear data compression and reconstruction via discrete wavelet transform

Energy Technology Data Exchange (ETDEWEB)

Park, Young Ryong; Cho, Nam Zin [Korea Advanced Institute of Science and Technology, Taejon (Korea, Republic of)

1998-12-31

Discrete Wavelet Transforms (DWTs) are recent mathematics, and begin to be used in various fields. The wavelet transform can be used to compress the signal and image due to its inherent properties. We applied the wavelet transform compression and reconstruction to the neutron cross section data. Numerical tests illustrate that the signal compression using wavelet is very effective to reduce the data saving spaces. 7 refs., 4 figs., 3 tabs. (Author)

Nuclear data compression and reconstruction via discrete wavelet transform

Energy Technology Data Exchange (ETDEWEB)

Park, Young Ryong; Cho, Nam Zin [Korea Advanced Institute of Science and Technology, Taejon (Korea, Republic of)

1997-12-31

Discrete Wavelet Transforms (DWTs) are recent mathematics, and begin to be used in various fields. The wavelet transform can be used to compress the signal and image due to its inherent properties. We applied the wavelet transform compression and reconstruction to the neutron cross section data. Numerical tests illustrate that the signal compression using wavelet is very effective to reduce the data saving spaces. 7 refs., 4 figs., 3 tabs. (Author)

On d -Dimensional Lattice (co)sine n -Algebra

International Nuclear Information System (INIS)

Yao Shao-Kui; Zhang Chun-Hong; Zhao Wei-Zhong; Ding Lu; Liu Peng

2016-01-01

We present the (co)sine n-algebra which is indexed by the d-dimensional integer lattice. Due to the associative operators, this generalized (co)sine n-algebra is the higher order Lie algebra for the n even case. The particular cases are the d-dimensional lattice sine 3 and cosine 5-algebras with the special parameter values. We find that the corresponding d-dimensional lattice sine 3 and cosine 5-algebras are the Nambu 3-algebra and higher order Lie algebra, respectively. The limiting case of the d-dimensional lattice (co)sine n-algebra is also discussed. Moreover we construct the super sine n-algebra, which is the super higher order Lie algebra for the n even case. (paper)

Discrete Fourier Transform in a Complex Vector Space

Science.gov (United States)

Dean, Bruce H. (Inventor)

2015-01-01

An image-based phase retrieval technique has been developed that can be used on board a space based iterative transformation system. Image-based wavefront sensing is computationally demanding due to the floating-point nature of the process. The discrete Fourier transform (DFT) calculation is presented in "diagonal" form. By diagonal we mean that a transformation of basis is introduced by an application of the similarity transform of linear algebra. The current method exploits the diagonal structure of the DFT in a special way, particularly when parts of the calculation do not have to be repeated at each iteration to converge to an acceptable solution in order to focus an image.

Analytic discrete cosine harmonic wavelet transform based OFDM ...

Indian Academy of Sciences (India)

in improving Bit Error Rate (BER) and Peak to Average Power Ratio (PAPR) per- ... as an alternative to Fourier basis has been suggested for multicarrier transmission ..... Ramjee Prasad 2004 OFDM for Wireless Communications Systems.

Improved cosine similarity measures of simplified neutrosophic sets for medical diagnoses.

Science.gov (United States)

Ye, Jun

2015-03-01

In pattern recognition and medical diagnosis, similarity measure is an important mathematical tool. To overcome some disadvantages of existing cosine similarity measures of simplified neutrosophic sets (SNSs) in vector space, this paper proposed improved cosine similarity measures of SNSs based on cosine function, including single valued neutrosophic cosine similarity measures and interval neutrosophic cosine similarity measures. Then, weighted cosine similarity measures of SNSs were introduced by taking into account the importance of each element. Further, a medical diagnosis method using the improved cosine similarity measures was proposed to solve medical diagnosis problems with simplified neutrosophic information. The improved cosine similarity measures between SNSs were introduced based on cosine function. Then, we compared the improved cosine similarity measures of SNSs with existing cosine similarity measures of SNSs by numerical examples to demonstrate their effectiveness and rationality for overcoming some shortcomings of existing cosine similarity measures of SNSs in some cases. In the medical diagnosis method, we can find a proper diagnosis by the cosine similarity measures between the symptoms and considered diseases which are represented by SNSs. Then, the medical diagnosis method based on the improved cosine similarity measures was applied to two medical diagnosis problems to show the applications and effectiveness of the proposed method. Two numerical examples all demonstrated that the improved cosine similarity measures of SNSs based on the cosine function can overcome the shortcomings of the existing cosine similarity measures between two vectors in some cases. By two medical diagnoses problems, the medical diagnoses using various similarity measures of SNSs indicated the identical diagnosis results and demonstrated the effectiveness and rationality of the diagnosis method proposed in this paper. The improved cosine measures of SNSs based on cosine

Improved cosine similarity measures of simplified neutrosophic setsfor medical diagnoses

OpenAIRE

Jun Ye

2014-01-01

In pattern recognition and medical diagnosis, similarity measure is an important mathematicaltool. To overcome some disadvantages of existing cosine similarity measures of simplified neutrosophicsets (SNSs) in vector space, this paper proposed improved cosine similarity measures of SNSs based oncosine function, including single valued neutrosophic cosine similarity measures and interval neutro-sophic cosine similarity measures. Then, weighted cosine similarity measures of SNSs were introduced...

Generating Solutions to Discrete sine-Gordon Equation from Modified Baecklund Transformation

International Nuclear Information System (INIS)

Kou Xin; Zhang Dajun; Shi Ying; Zhao Songlin

2011-01-01

We modify the bilinear Baecklund transformation for the discrete sine-Gordon equation and derive variety, of solutions by freely choosing parameters from the modified Baecklund transformation. Dynamics of solutions and continuum limits are also discussed. (general)

Discrete Orthogonal Transforms and Neural Networks for Image Interpolation

Directory of Open Access Journals (Sweden)

J. Polec

1999-09-01

Full Text Available In this contribution we present transform and neural network approaches to the interpolation of images. From transform point of view, the principles from [1] are modified for 1st and 2nd order interpolation. We present several new interpolation discrete orthogonal transforms. From neural network point of view, we present interpolation possibilities of multilayer perceptrons. We use various configurations of neural networks for 1st and 2nd order interpolation. The results are compared by means of tables.

Fast parallel approach for 2-D DHT-based real-valued discrete Gabor transform.

Science.gov (United States)

Tao, Liang; Kwan, Hon Keung

2009-12-01

Two-dimensional fast Gabor transform algorithms are useful for real-time applications due to the high computational complexity of the traditional 2-D complex-valued discrete Gabor transform (CDGT). This paper presents two block time-recursive algorithms for 2-D DHT-based real-valued discrete Gabor transform (RDGT) and its inverse transform and develops a fast parallel approach for the implementation of the two algorithms. The computational complexity of the proposed parallel approach is analyzed and compared with that of the existing 2-D CDGT algorithms. The results indicate that the proposed parallel approach is attractive for real time image processing.

On the physical relevance of the discrete Fourier transform

CSIR Research Space (South Africa)

Greben, JM

1991-11-01

Full Text Available This paper originated from the author's dissatisfaction with the way the discrete Fourier transform is usually presented in the literature. Although mathematically correct, the physical meaning of the common representation is unsatisfactory...

Development of sine/cosine coil based on cross-section modulation

International Nuclear Information System (INIS)

Harada, Takahiro; Kondoh, Junji; Tsuji-Iio, Shunji; Shimada, Ryuichi

1996-01-01

New type sine and cosine coils whose areas of cross sections vary as sine and cosine are proposed. The measurements of current position by the new coils showed their availability. Traditional sine or cosine coil is wound with a pitch which varies as sine or cosine. However these coils have a problem of manufacturing, i.e. it is not easy to wind wire exactly with a pitch of sine or cosine. This new modulation, i.e. varying cross section, provides handy and accurate measurements of the current position. (author)

A non-linear discrete transform for pattern recognition of discrete chaotic systems

International Nuclear Information System (INIS)

Karanikas, C.; Proios, G.

2003-01-01

It is shown, by an invertible non-linear discrete transform that any finite sequence or any collection of strings of any length can be presented as a random walk on trees. These transforms create the mathematical background for coding any information, for exploring its local variability and diversity. With the underlying computational algorithms, with several examples and applications we propose that these transforms can be used for pattern recognition of immune type. In other words we propose a mathematical platform for detecting self and non-self strings of any alphabet, based on a negative selection algorithms, for scouting data's periodicity and self-similarity and for measuring the diversity of chaotic strings with fractal dimension methods. In particular we estimate successfully the entropy and the ratio of chaotic data with self similarity. Moreover we give some applications of a non-linear denoising filter

A non-linear discrete transform for pattern recognition of discrete chaotic systems

CERN Document Server

Karanikas, C

2003-01-01

It is shown, by an invertible non-linear discrete transform that any finite sequence or any collection of strings of any length can be presented as a random walk on trees. These transforms create the mathematical background for coding any information, for exploring its local variability and diversity. With the underlying computational algorithms, with several examples and applications we propose that these transforms can be used for pattern recognition of immune type. In other words we propose a mathematical platform for detecting self and non-self strings of any alphabet, based on a negative selection algorithms, for scouting data's periodicity and self-similarity and for measuring the diversity of chaotic strings with fractal dimension methods. In particular we estimate successfully the entropy and the ratio of chaotic data with self similarity. Moreover we give some applications of a non-linear denoising filter.

Discrete Haar transform and protein structure.

Science.gov (United States)

Morosetti, S

1997-12-01

The discrete Haar transform of the sequence of the backbone dihedral angles (phi and psi) was performed over a set of X-ray protein structures of high resolution from the Brookhaven Protein Data Bank. Afterwards, the new dihedral angles were calculated by the inverse transform, using a growing number of Haar functions, from the lower to the higher degree. New structures were obtained using these dihedral angles, with standard values for bond lengths and angles, and with omega = 0 degree. The reconstructed structures were compared with the experimental ones, and analyzed by visual inspection and statistical analysis. When half of the Haar coefficients were used, all the reconstructed structures were not yet collapsed to a tertiary folding, but they showed yet realized most of the secondary motifs. These results indicate a substantial separation of structural information in the space of Haar transform, with the secondary structural information mainly present in the Haar coefficients of lower degrees, and the tertiary one present in the higher degree coefficients. Because of this separation, the representation of the folded structures in the space of Haar transform seems a promising candidate to encompass the problem of premature convergence in genetic algorithms.

A Fast, Simple, and Stable Chebyshev--Legendre Transform Using an Asymptotic Formula

KAUST Repository

Hale, Nicholas

2014-02-06

A fast, simple, and numerically stable transform for converting between Legendre and Chebyshev coefficients of a degree N polynomial in O(N(log N)2/ log log N) operations is derived. The fundamental idea of the algorithm is to rewrite a well-known asymptotic formula for Legendre polynomials of large degree as a weighted linear combination of Chebyshev polynomials, which can then be evaluated by using the discrete cosine transform. Numerical results are provided to demonstrate the efficiency and numerical stability. Since the algorithm evaluates a Legendre expansion at an N +1 Chebyshev grid as an intermediate step, it also provides a fast transform between Legendre coefficients and values on a Chebyshev grid. © 2014 Society for Industrial and Applied Mathematics.

Discrete Fourier and wavelet transforms an introduction through linear algebra with applications to signal processing

CERN Document Server

Goodman, Roe W

2016-01-01

This textbook for undergraduate mathematics, science, and engineering students introduces the theory and applications of discrete Fourier and wavelet transforms using elementary linear algebra, without assuming prior knowledge of signal processing or advanced analysis.It explains how to use the Fourier matrix to extract frequency information from a digital signal and how to use circulant matrices to emphasize selected frequency ranges. It introduces discrete wavelet transforms for digital signals through the lifting method and illustrates through examples and computer explorations how these transforms are used in signal and image processing. Then the general theory of discrete wavelet transforms is developed via the matrix algebra of two-channel filter banks. Finally, wavelet transforms for analog signals are constructed based on filter bank results already presented, and the mathematical framework of multiresolution analysis is examined.

Fast Algorithm for Computing the Discrete Hartley Transform of Type-II

Directory of Open Access Journals (Sweden)

Mounir Taha Hamood

2016-06-01

Full Text Available The generalized discrete Hartley transforms (GDHTs have proved to be an efficient alternative to the generalized discrete Fourier transforms (GDFTs for real-valued data applications. In this paper, the development of direct computation of radix-2 decimation-in-time (DIT algorithm for the fast calculation of the GDHT of type-II (DHT-II is presented. The mathematical analysis and the implementation of the developed algorithm are derived, showing that this algorithm possesses a regular structure and can be implemented in-place for efficient memory utilization.The performance of the proposed algorithm is analyzed and the computational complexity is calculated for different transform lengths. A comparison between this algorithm and existing DHT-II algorithms shows that it can be considered as a good compromise between the structural and computational complexities.

Invariant object recognition based on the generalized discrete radon transform

Science.gov (United States)

Easley, Glenn R.; Colonna, Flavia

2004-04-01

We introduce a method for classifying objects based on special cases of the generalized discrete Radon transform. We adjust the transform and the corresponding ridgelet transform by means of circular shifting and a singular value decomposition (SVD) to obtain a translation, rotation and scaling invariant set of feature vectors. We then use a back-propagation neural network to classify the input feature vectors. We conclude with experimental results and compare these with other invariant recognition methods.

Digital watermarking and steganography fundamentals and techniques

CERN Document Server

Shih, Frank Y

2007-01-01

Introduction Digital Watermarking Digital Steganography Differences between Watermarking and Steganography A Brief History Appendix: Selected List of Books on Watermarking and Steganography Classification in Digital Watermarking Classification Based on Characteristics Classification Based on Applications Mathematical Preliminaries  Least-Significant-Bit Substitution Discrete Fourier Transform (DFT) Discrete Cosine Transform Discrete Wavelet Transform Random Sequence Generation  The Chaotic M

Comparative Survey of Ultrasound Images Compression Methods Dedicated to a Tele-Echography Robotic System

National Research Council Canada - National Science Library

Delgorge, C

2001-01-01

.... For the purpose of this work, we selected seven compression methods : Fourier Transform, Discrete Cosine Transform, Wavelets, Quadtrees Transform, Fractals, Histogram Thresholding, and Run Length Coding...

Discrete-continuous bispectral operators and rational Darboux transformations

International Nuclear Information System (INIS)

Boyallian, Carina; Portillo, Sofia

2010-01-01

In this Letter we construct examples of discrete-continuous bispectral operators obtained by rational Darboux transformations applied to a regular pseudo-difference operator with constant coefficients. Moreover, we give an explicit procedure to write down the differential operators involved in the bispectral situation corresponding to the pseudo-difference operator obtained by the Darboux process.

Discrete Fourier transform in nanostructures using scattering

International Nuclear Information System (INIS)

Leuenberger, Michael N.; Flatte, Michael E.; Loss, Daniel; Awschalom, D.D.

2004-01-01

In this article, we show that the discrete Fourier transform (DFT) can be performed by scattering a coherent particle or laser beam off an electrically controllable two-dimensional (2D) potential that has the shape of rings or peaks. After encoding the initial vector into the two-dimensional potential by means of electric gates, the Fourier-transformed vector can be read out by detectors surrounding the potential. The wavelength of the laser beam determines the necessary accuracy of the 2D potential, which makes our method very fault-tolerant. Since the time to perform the DFT is much smaller than the clock cycle of today's computers, our proposed device performs DFTs at the frequency of the computer clock speed

Initial performance of the COSINE-100 experiment

Energy Technology Data Exchange (ETDEWEB)

Adhikari, G.; Adhikari, P. [Sejong University, Department of Physics, Seoul (Korea, Republic of); Souza, E.B. de; Jo, J.H.; Lim, K.E.; Maruyama, R.H.; Pierpoint, Z.P.; Thompson, W.G. [Yale University, Department of Physics, New Haven, CT (United States); Carlin, N. [University of Sao Paulo, Physics Institute, Sao Paulo (Brazil); Choi, S.; Joo, H.W.; Kim, S.K. [Seoul National University, Department of Physics and Astronomy, Seoul (Korea, Republic of); Choi, W.Q. [Korea Institute of Science and Technology Information, Daejeon (Korea, Republic of); Karlsruher Institut fuer Technologie (KIT), Institut fuer Experimentelle Kernphysik, Eggenstein-Leopoldshafen (Germany); Djamal, M.; Prihtiadi, H. [Bandung Institute of Technology, Department of Physics, Bandung (Indonesia); Ezeribe, A.C.; Kudryavtsev, V.A.; Lynch, W.A.; Mouton, F.; Spooner, N.J.C. [University of Sheffield, Department of Physics and Astronomy, Sheffield (United Kingdom); Ha, C.; Jeon, E.J.; Kang, W.G.; Kim, B.H.; Kim, H.; Kim, K.W.; Kim, N.Y.; Lee, H.S.; Lee, J.; Lee, M.H.; Leonard, D.S.; Olsen, S.L.; Park, H.K.; Park, K.S.; Ra, S.; Yong, S.H. [Institute for Basic Science (IBS), Center for Underground Physics, Daejeon (Korea, Republic of); Hahn, I.S. [Ewha Womans University, Department of Science Education, Seoul (Korea, Republic of); Hubbard, A.J.F. [Yale University, Department of Physics, New Haven, CT (United States); Northwestern University, Department of Physics and Astronomy, Evanston, IL (United States); Kang, W.; Rott, C. [Sungkyunkwan University, Department of Physics, Seoul (Korea, Republic of); Kauer, M. [University of Wisconsin-Madison, Department of Physics and Wisconsin IceCube Particle Astrophysics Center, Madison, WI (United States); Kim, H.J.; Lee, J.Y. [Kyungpook National University, Department of Physics, Daegu (Korea, Republic of); Kim, M.C. [Sungkyunkwan University, Department of Physics, Seoul (Korea, Republic of); Chiba University, Department of Physics, Chiba (Japan); Kim, Y.D. [Sejong University, Department of Physics, Seoul (Korea, Republic of); Institute for Basic Science (IBS), Center for Underground Physics, Daejeon (Korea, Republic of); Kim, Y.H. [Institute for Basic Science (IBS), Center for Underground Physics, Daejeon (Korea, Republic of); Korea Research Institute of Standards and Science, Daejeon (Korea, Republic of); Park, H.S. [Korea Research Institute of Standards and Science, Daejeon (Korea, Republic of); Park, J.S. [Institute for Basic Science (IBS), Center for Underground Physics, Daejeon (Korea, Republic of); High Energy Accelerator Research Organization (KEK), Ibaraki (Japan); Pettus, W. [Yale University, Department of Physics, New Haven, CT (United States); University of Washington, Department of Physics, Center for Experimental Nuclear Physics and Astrophysics, Seattle, WA (United States); Rogers, F.R. [Yale University, Department of Physics, New Haven, CT (United States); Massachusetts Institute of Technology, Department of Physics, Cambridge, MA (United States); Scarff, A. [University of Sheffield, Department of Physics and Astronomy, Sheffield (United Kingdom); University of British Columbia, Department of Physics and Astronomy, Vancouver, BC (Canada); Yang, L. [University of Illinois at Urbana-Champaign, Department of Physics, Urbana, IL (United States)

2018-02-15

COSINE is a dark matter search experiment based on an array of low background NaI(Tl) crystals located at the Yangyang underground laboratory. The assembly of COSINE-100 was completed in the summer of 2016 and the detector is currently collecting physics quality data aimed at reproducing the DAMA/LIBRA experiment that reported an annual modulation signal. Stable operation has been achieved and will continue for at least 2 years. Here, we describe the design of COSINE-100, including the shielding arrangement, the configuration of the NaI(Tl) crystal detection elements, the veto systems, and the associated operational systems, and we show the current performance of the experiment. (orig.)

The spectral transform as a tool for solving nonlinear discrete evolution equations

International Nuclear Information System (INIS)

Levi, D.

1979-01-01

In this contribution we study nonlinear differential difference equations which became important to the description of an increasing number of problems in natural science. Difference equations arise for instance in the study of electrical networks, in statistical problems, in queueing problems, in ecological problems, as computer models for differential equations and as models for wave excitation in plasma or vibrations of particles in an anharmonic lattice. We shall first review the passages necessary to solve linear discrete evolution equations by the discrete Fourier transfrom, then, starting from the Zakharov-Shabat discretized eigenvalue, problem, we shall introduce the spectral transform. In the following part we obtain the correlation between the evolution of the potentials and scattering data through the Wronskian technique, giving at the same time many other properties as, for example, the Baecklund transformations. Finally we recover some of the important equations belonging to this class of nonlinear discrete evolution equations and extend the method to equations with n-dependent coefficients. (HJ)

A Study of Frequency Mixing Approaches for Eddy Current Testing of Steam Generator Tubes

International Nuclear Information System (INIS)

Jung, Hee Jun; Song, Sung Jin; Kim, Chang Hwan; Kim, Dae Kwang

2009-01-01

The multifrequency eddy current testing(ECT) have been proposed various frequency mixing algorithms. In this study, we compare these approaches to frequency mixing of ECT signals from steam generator tubes; time-domain optimization, discrete cosine transform-domain optimization. Specifically, in this study, two different frequency mixing algorithms, a time-domain optimization method and a discrete cosine transform(DCT) optimization method, are investigated using the experimental signals captured from the ASME standard tube. The DCT domain optimization method is computationally fast but produces larger amount of residue.

Electro-mechanical sine/cosine generator

Science.gov (United States)

Flagge, B. (Inventor)

1972-01-01

An electromechanical device for generating both sine and cosine functions is described. A motor rotates a cylinder about an axis parallel to and a slight distance from the central axis of the cylinder. Two noncontacting displacement sensing devices are placed ninety degrees apart, equal distances from the axis of rotation of the cylinder and short distances above the surface of cylinder. Each of these sensing devices produces an electrical signal proportional to the distance that it is away from the cylinder. Consequently, as the cylinder is rotated the outputs from the two sensing devices are the sine and cosine functions.

Use of switched capacitor filters to implement the discrete wavelet transform

Science.gov (United States)

Kaiser, Kraig E.; Peterson, James N.

1993-01-01

This paper analyzes the use of IIR switched capacitor filters to implement the discrete wavelet transform and the inverse transform, using quadrature mirror filters (QMF) which have the necessary symmetry for reconstruction of the data. This is done by examining the sensitivity of the QMF transforms to the manufacturing variance in the desired capacitances. The performance is evaluated at the outputs of the separate filter stages and the error in the reconstruction of the inverse transform is compared with the desired results.

Discrete wavelet transform: a tool in smoothing kinematic data.

Science.gov (United States)

Ismail, A R; Asfour, S S

1999-03-01

Motion analysis systems typically introduce noise to the displacement data recorded. Butterworth digital filters have been used to smooth the displacement data in order to obtain smoothed velocities and accelerations. However, this technique does not yield satisfactory results, especially when dealing with complex kinematic motions that occupy the low- and high-frequency bands. The use of the discrete wavelet transform, as an alternative to digital filters, is presented in this paper. The transform passes the original signal through two complementary low- and high-pass FIR filters and decomposes the signal into an approximation function and a detail function. Further decomposition of the signal results in transforming the signal into a hierarchy set of orthogonal approximation and detail functions. A reverse process is employed to perfectly reconstruct the signal (inverse transform) back from its approximation and detail functions. The discrete wavelet transform was applied to the displacement data recorded by Pezzack et al., 1977. The smoothed displacement data were twice differentiated and compared to Pezzack et al.'s acceleration data in order to choose the most appropriate filter coefficients and decomposition level on the basis of maximizing the percentage of retained energy (PRE) and minimizing the root mean square error (RMSE). Daubechies wavelet of the fourth order (Db4) at the second decomposition level showed better results than both the biorthogonal and Coiflet wavelets (PRE = 97.5%, RMSE = 4.7 rad s-2). The Db4 wavelet was then used to compress complex displacement data obtained from a noisy mathematically generated function. Results clearly indicate superiority of this new smoothing approach over traditional filters.

Oblique projections and standard-form transformations for discrete inverse problems

DEFF Research Database (Denmark)

Hansen, Per Christian

2013-01-01

This tutorial paper considers a specific computational tool for the numerical solution of discrete inverse problems, known as the standard-form transformation, by which we can treat general Tikhonov regularization problems efficiently. In the tradition of B. N. Datta's expositions of numerical li...... linear algebra, we use the close relationship between oblique projections, pseudoinverses, and matrix computations to derive a simple geometric motivation and algebraic formulation of the standard-form transformation....

Integral transformations applied to image encryption

International Nuclear Information System (INIS)

Vilardy, Juan M.; Torres, Cesar O.; Perez, Ronal

2017-01-01

In this paper we consider the application of the integral transformations for image encryption through optical systems, a mathematical algorithm under Matlab platform using fractional Fourier transform (FrFT) and Random Phase Mask (RPM) for digital images encryption is implemented. The FrFT can be related to others integral transforms, such as: Fourier transform, Sine and Cosine transforms, Radial Hilbert transform, fractional Sine transform, fractional Cosine transform, fractional Hartley transform, fractional Wavelet transform and Gyrator transform, among other transforms. The encryption scheme is based on the use of the FrFT, the joint transform correlator and two RPMs, which provide security and robustness to the implemented security system. One of the RPMs used during encryption-decryption and the fractional order of the FrFT are the keys to improve security and make the system more resistant against security attacks. (paper)

Implementation of IMDCT Block of an MP3 Decoder through Optimization on the DCT Matrix

Directory of Open Access Journals (Sweden)

M. Galabov

2004-12-01

Full Text Available The paper describes an attempt to create an efficient dedicatedMP3-decoder, according to the MPEG-1 Layer III standard. A new methodof Inverse Modified Discrete Cosine Transform by optimization on theDiscrete Cosine Transform (DCT matrix is proposed and an assemblerprogram for Digital Signal Processor is developed. In addition, aprogram to calculate DCT using Lee's algorithm for any matrix of thesize 2M is created. The experimental results have proven that thedecoder is able to stream and decode MP3 in real time.

Discrete quantum Fourier transform in coupled semiconductor double quantum dot molecules

International Nuclear Information System (INIS)

Dong Ping; Yang Ming; Cao Zhuoliang

2008-01-01

In this Letter, we present a physical scheme for implementing the discrete quantum Fourier transform in a coupled semiconductor double quantum dot system. The main controlled-R gate operation can be decomposed into many simple and feasible unitary transformations. The current scheme would be a useful step towards the realization of complex quantum algorithms in the quantum dot system

Discrete Hadamard transformation algorithm's parallelism analysis and achievement

Science.gov (United States)

Hu, Hui

2009-07-01

With respect to Discrete Hadamard Transformation (DHT) wide application in real-time signal processing while limitation in operation speed of DSP. The article makes DHT parallel research and its parallel performance analysis. Based on multiprocessor platform-TMS320C80 programming structure, the research is carried out to achieve two kinds of parallel DHT algorithms. Several experiments demonstrated the effectiveness of the proposed algorithms.

Efficient Algorithms for the Discrete Gabor Transform with a Long Fir Window

DEFF Research Database (Denmark)

Søndergaard, Peter Lempel

2012-01-01

The Discrete Gabor Transform (DGT) is the most commonly used signal transform for signal analysis and synthesis using a linear frequency scale. The development of the Linear Time-Frequency Analysis Toolbox (LTFAT) has been based on a detailed study of many variants of the relevant algorithms. As ...

Discrete Fourier Transform Analysis in a Complex Vector Space

Science.gov (United States)

Dean, Bruce H.

2009-01-01

Alternative computational strategies for the Discrete Fourier Transform (DFT) have been developed using analysis of geometric manifolds. This approach provides a general framework for performing DFT calculations, and suggests a more efficient implementation of the DFT for applications using iterative transform methods, particularly phase retrieval. The DFT can thus be implemented using fewer operations when compared to the usual DFT counterpart. The software decreases the run time of the DFT in certain applications such as phase retrieval that iteratively call the DFT function. The algorithm exploits a special computational approach based on analysis of the DFT as a transformation in a complex vector space. As such, this approach has the potential to realize a DFT computation that approaches N operations versus Nlog(N) operations for the equivalent Fast Fourier Transform (FFT) calculation.

Performance Evaluation of Frequency Transform Based Block Classification of Compound Image Segmentation Techniques

Science.gov (United States)

Selwyn, Ebenezer Juliet; Florinabel, D. Jemi

2018-04-01

Compound image segmentation plays a vital role in the compression of computer screen images. Computer screen images are images which are mixed with textual, graphical, or pictorial contents. In this paper, we present a comparison of two transform based block classification of compound images based on metrics like speed of classification, precision and recall rate. Block based classification approaches normally divide the compound images into fixed size blocks of non-overlapping in nature. Then frequency transform like Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT) are applied over each block. Mean and standard deviation are computed for each 8 × 8 block and are used as features set to classify the compound images into text/graphics and picture/background block. The classification accuracy of block classification based segmentation techniques are measured by evaluation metrics like precision and recall rate. Compound images of smooth background and complex background images containing text of varying size, colour and orientation are considered for testing. Experimental evidence shows that the DWT based segmentation provides significant improvement in recall rate and precision rate approximately 2.3% than DCT based segmentation with an increase in block classification time for both smooth and complex background images.

Transformation Matrix for Time Discretization Based on Tustin’s Method

Directory of Open Access Journals (Sweden)

Yiming Jiang

2014-01-01

Full Text Available This paper studies rules in transformation of transfer function through time discretization. A method of using transformation matrix to realize bilinear transform (also known as Tustin’s method is presented. This method can be described as the conversion between the coefficients of transfer functions, which are expressed as transform by certain matrix. For a polynomial of degree n, the corresponding transformation matrix of order n exists and is unique. Furthermore, the transformation matrix can be decomposed into an upper triangular matrix multiplied with another lower triangular matrix. And both have obvious regularity. The proposed method can achieve rapid bilinear transform used in automatic design of digital filter. The result of numerical simulation verifies the correctness of the theoretical results. Moreover, it also can be extended to other similar problems. Example in the last throws light on this point.

Discrete Ramanujan transform for distinguishing the protein coding regions from other regions.

Science.gov (United States)

Hua, Wei; Wang, Jiasong; Zhao, Jian

2014-01-01

Based on the study of Ramanujan sum and Ramanujan coefficient, this paper suggests the concepts of discrete Ramanujan transform and spectrum. Using Voss numerical representation, one maps a symbolic DNA strand as a numerical DNA sequence, and deduces the discrete Ramanujan spectrum of the numerical DNA sequence. It is well known that of discrete Fourier power spectrum of protein coding sequence has an important feature of 3-base periodicity, which is widely used for DNA sequence analysis by the technique of discrete Fourier transform. It is performed by testing the signal-to-noise ratio at frequency N/3 as a criterion for the analysis, where N is the length of the sequence. The results presented in this paper show that the property of 3-base periodicity can be only identified as a prominent spike of the discrete Ramanujan spectrum at period 3 for the protein coding regions. The signal-to-noise ratio for discrete Ramanujan spectrum is defined for numerical measurement. Therefore, the discrete Ramanujan spectrum and the signal-to-noise ratio of a DNA sequence can be used for distinguishing the protein coding regions from the noncoding regions. All the exon and intron sequences in whole chromosomes 1, 2, 3 and 4 of Caenorhabditis elegans have been tested and the histograms and tables from the computational results illustrate the reliability of our method. In addition, we have analyzed theoretically and gotten the conclusion that the algorithm for calculating discrete Ramanujan spectrum owns the lower computational complexity and higher computational accuracy. The computational experiments show that the technique by using discrete Ramanujan spectrum for classifying different DNA sequences is a fast and effective method. Copyright © 2014 Elsevier Ltd. All rights reserved.

Towards discrete wavelet transform-based human activity recognition

Science.gov (United States)

Khare, Manish; Jeon, Moongu

2017-06-01

Providing accurate recognition of human activities is a challenging problem for visual surveillance applications. In this paper, we present a simple and efficient algorithm for human activity recognition based on a wavelet transform. We adopt discrete wavelet transform (DWT) coefficients as a feature of human objects to obtain advantages of its multiresolution approach. The proposed method is tested on multiple levels of DWT. Experiments are carried out on different standard action datasets including KTH and i3D Post. The proposed method is compared with other state-of-the-art methods in terms of different quantitative performance measures. The proposed method is found to have better recognition accuracy in comparison to the state-of-the-art methods.

On the discrete version of Gabor's signal expansion, the Gabor transform, and the Zak transform

NARCIS (Netherlands)

Bastiaans, M.J.; Veen, J.P.

1996-01-01

Gabors expansion of a discrete-time signal into a set of shifted and modulated versions of an elementary signal or synthesis window is introduced, along with the inverse operation, i.e., the Gabor transform, which uses an analysis window that is related to the synthesis window and with the help of

Designing for Compressive Sensing: Compressive Art, Camouflage, Fonts, and Quick Response Codes

Science.gov (United States)

2018-01-01

an example where the signal is non-sparse in the standard basis, but sparse in the discrete cosine basis . The top plot shows the signal from the...previous example, now used as sparse discrete cosine transform (DCT) coefficients . The next plot shows the non-sparse signal in the standard...Romberg JK, Tao T. Stable signal recovery from incomplete and inaccurate measurements. Commun Pure Appl Math . 2006;59(8):1207–1223. 3. Donoho DL

Multicriteria decision-making method based on a cosine similarity ...

African Journals Online (AJOL)

the cosine similarity measure is often used in information retrieval, citation analysis, and automatic classification. However, it scarcely deals with trapezoidal fuzzy information and multicriteria decision-making problems. For this purpose, a cosine similarity measure between trapezoidal fuzzy numbers is proposed based on ...

Surface Design Based on Discrete Conformal Transformations

Science.gov (United States)

Duque, Carlos; Santangelo, Christian; Vouga, Etienne

Conformal transformations are angle-preserving maps from one domain to another. Although angles are preserved, the lengths between arbitrary points are not generally conserved. As a consequence there is always a given amount of distortion associated to any conformal map. Different uses of such transformations can be found in various fields, but have been used by us to program non-uniformly swellable gel sheets to buckle into prescribed three dimensional shapes. In this work we apply circle packings as a kind of discrete conformal map in order to find conformal maps from the sphere to the plane that can be used as nearly uniform swelling patterns to program non-Euclidean sheets to buckle into spheres. We explore the possibility of tuning the area distortion to fit the experimental range of minimum and maximum swelling by modifying the boundary of the planar domain through the introduction of different cutting schemes.

A difference tracking algorithm based on discrete sine transform

Science.gov (United States)

Liu, HaoPeng; Yao, Yong; Lei, HeBing; Wu, HaoKun

2018-04-01

Target tracking is an important field of computer vision. The template matching tracking algorithm based on squared difference matching (SSD) and standard correlation coefficient (NCC) matching is very sensitive to the gray change of image. When the brightness or gray change, the tracking algorithm will be affected by high-frequency information. Tracking accuracy is reduced, resulting in loss of tracking target. In this paper, a differential tracking algorithm based on discrete sine transform is proposed to reduce the influence of image gray or brightness change. The algorithm that combines the discrete sine transform and the difference algorithm maps the target image into a image digital sequence. The Kalman filter predicts the target position. Using the Hamming distance determines the degree of similarity between the target and the template. The window closest to the template is determined the target to be tracked. The target to be tracked updates the template. Based on the above achieve target tracking. The algorithm is tested in this paper. Compared with SSD and NCC template matching algorithms, the algorithm tracks target stably when image gray or brightness change. And the tracking speed can meet the read-time requirement.

Multirate-based fast parallel algorithms for 2-D DHT-based real-valued discrete Gabor transform.

Science.gov (United States)

Tao, Liang; Kwan, Hon Keung

2012-07-01

Novel algorithms for the multirate and fast parallel implementation of the 2-D discrete Hartley transform (DHT)-based real-valued discrete Gabor transform (RDGT) and its inverse transform are presented in this paper. A 2-D multirate-based analysis convolver bank is designed for the 2-D RDGT, and a 2-D multirate-based synthesis convolver bank is designed for the 2-D inverse RDGT. The parallel channels in each of the two convolver banks have a unified structure and can apply the 2-D fast DHT algorithm to speed up their computations. The computational complexity of each parallel channel is low and is independent of the Gabor oversampling rate. All the 2-D RDGT coefficients of an image are computed in parallel during the analysis process and can be reconstructed in parallel during the synthesis process. The computational complexity and time of the proposed parallel algorithms are analyzed and compared with those of the existing fastest algorithms for 2-D discrete Gabor transforms. The results indicate that the proposed algorithms are the fastest, which make them attractive for real-time image processing.

Error Concealment for 3-D DWT Based Video Codec Using Iterative Thresholding

DEFF Research Database (Denmark)

Belyaev, Evgeny; Forchhammer, Søren; Codreanu, Marian

2017-01-01

Error concealment for video coding based on a 3-D discrete wavelet transform (DWT) is considered. We assume that the video sequence has a sparse representation in a known basis different from the DWT, e.g., in a 2-D discrete cosine transform basis. Then, we formulate the concealment problem as l1...

Discrete Multiwavelet Critical-Sampling Transform-Based OFDM System over Rayleigh Fading Channels

Directory of Open Access Journals (Sweden)

Sameer A. Dawood

2015-01-01

Full Text Available Discrete multiwavelet critical-sampling transform (DMWCST has been proposed instead of fast Fourier transform (FFT in the realization of the orthogonal frequency division multiplexing (OFDM system. The proposed structure further reduces the level of interference and improves the bandwidth efficiency through the elimination of the cyclic prefix due to the good orthogonality and time-frequency localization properties of the multiwavelet transform. The proposed system was simulated using MATLAB to allow various parameters of the system to be varied and tested. The performance of DMWCST-based OFDM (DMWCST-OFDM was compared with that of the discrete wavelet transform-based OFDM (DWT-OFDM and the traditional FFT-based OFDM (FFT-OFDM over flat fading and frequency-selective fading channels. Results obtained indicate that the performance of the proposed DMWCST-OFDM system achieves significant improvement compared to those of DWT-OFDM and FFT-OFDM systems. DMWCST improves the performance of the OFDM system by a factor of 1.5–2.5 dB and 13–15.5 dB compared with the DWT and FFT, respectively. Therefore the proposed system offers higher data rate in wireless mobile communications.

3-D discrete shearlet transform and video processing.

Science.gov (United States)

Negi, Pooran Singh; Labate, Demetrio

2012-06-01

In this paper, we introduce a digital implementation of the 3-D shearlet transform and illustrate its application to problems of video denoising and enhancement. The shearlet representation is a multiscale pyramid of well-localized waveforms defined at various locations and orientations, which was introduced to overcome the limitations of traditional multiscale systems in dealing with multidimensional data. While the shearlet approach shares the general philosophy of curvelets and surfacelets, it is based on a very different mathematical framework, which is derived from the theory of affine systems and uses shearing matrices rather than rotations. This allows a natural transition from the continuous setting to the digital setting and a more flexible mathematical structure. The 3-D digital shearlet transform algorithm presented in this paper consists in a cascade of a multiscale decomposition and a directional filtering stage. The filters employed in this decomposition are implemented as finite-length filters, and this ensures that the transform is local and numerically efficient. To illustrate its performance, the 3-D discrete shearlet transform is applied to problems of video denoising and enhancement, and compared against other state-of-the-art multiscale techniques, including curvelets and surfacelets.

Human Motion Capture Data Tailored Transform Coding.

Science.gov (United States)

Junhui Hou; Lap-Pui Chau; Magnenat-Thalmann, Nadia; Ying He

2015-07-01

Human motion capture (mocap) is a widely used technique for digitalizing human movements. With growing usage, compressing mocap data has received increasing attention, since compact data size enables efficient storage and transmission. Our analysis shows that mocap data have some unique characteristics that distinguish themselves from images and videos. Therefore, directly borrowing image or video compression techniques, such as discrete cosine transform, does not work well. In this paper, we propose a novel mocap-tailored transform coding algorithm that takes advantage of these features. Our algorithm segments the input mocap sequences into clips, which are represented in 2D matrices. Then it computes a set of data-dependent orthogonal bases to transform the matrices to frequency domain, in which the transform coefficients have significantly less dependency. Finally, the compression is obtained by entropy coding of the quantized coefficients and the bases. Our method has low computational cost and can be easily extended to compress mocap databases. It also requires neither training nor complicated parameter setting. Experimental results demonstrate that the proposed scheme significantly outperforms state-of-the-art algorithms in terms of compression performance and speed.

Moment-based method for computing the two-dimensional discrete Hartley transform

Science.gov (United States)

Dong, Zhifang; Wu, Jiasong; Shu, Huazhong

2009-10-01

In this paper, we present a fast algorithm for computing the two-dimensional (2-D) discrete Hartley transform (DHT). By using kernel transform and Taylor expansion, the 2-D DHT is approximated by a linear sum of 2-D geometric moments. This enables us to use the fast algorithms developed for computing the 2-D moments to efficiently calculate the 2-D DHT. The proposed method achieves a simple computational structure and is suitable to deal with any sequence lengths.

Soliton solutions of the mixed discrete modified Korteweg-de Vries hierarchy via the inverse scattering transform

International Nuclear Information System (INIS)

Li Qi; Duan Qiuyuan; Zhang Jianbing

2012-01-01

The mixed discrete modified Korteweg-de Vries (mKdV) hierarchy and the Lax pair are derived. The hierarchy related to the Ablowitz-Ladik spectral problem is reduced to the isospectral discrete mKdV hierarchy and to the non-isospectral discrete mKdV hierarchy. N-soliton solutions of the hierarchies are obtained through inverse scattering transform.

Transformation of nonlinear discrete-time system into the extended observer form

Science.gov (United States)

Kaparin, V.; Kotta, Ü.

2018-04-01

The paper addresses the problem of transforming discrete-time single-input single-output nonlinear state equations into the extended observer form, which, besides the input and output, also depends on a finite number of their past values. Necessary and sufficient conditions for the existence of both the extended coordinate and output transformations, solving the problem, are formulated in terms of differential one-forms, associated with the input-output equation, corresponding to the state equations. An algorithm for transformation of state equations into the extended observer form is proposed and illustrated by an example. Moreover, the considered approach is compared with the method of dynamic observer error linearisation, which likewise is intended to enlarge the class of systems transformable into an observer form.

Time dependent and asymptotic neutron number probability distribution calculation using discrete Fourier transform

International Nuclear Information System (INIS)

Humbert, Ph.

2005-01-01

In this paper we consider the probability distribution of neutrons in a multiplying assembly. The problem is studied using a space independent one group neutron point reactor model without delayed neutrons. We recall the generating function methodology and analytical results obtained by G.I. Bell when the c 2 approximation is used and we present numerical solutions in the general case, without this approximation. The neutron source induced distribution is calculated using the single initial neutron distribution which satisfies a master (Kolmogorov backward) equation. This equation is solved using the generating function method. The generating function satisfies a differential equation and the probability distribution is derived by inversion of the generating function. Numerical results are obtained using the same methodology where the generating function is the Fourier transform of the probability distribution. Discrete Fourier transforms are used to calculate the discrete time dependent distributions and continuous Fourier transforms are used to calculate the asymptotic continuous probability distributions. Numerical applications are presented to illustrate the method. (author)

Experimental demonstration of an OFDM receiver based on a silicon-nanophot onic discrete Fourier transform filter

DEFF Research Database (Denmark)

Da Ros, Francesco; Nolle, Markus; Meuer, C.

2014-01-01

We experimentally demonstrate the demultiplexing of 8×13.4 Gbaud OFDM-QPSK subcarriers using a silicon nanophotonic-based discrete Fourier transform (DFT) filter. All eight subcarriers showed less than 1.5 dB OSNR penalty compared to the theoretical limit.......We experimentally demonstrate the demultiplexing of 8×13.4 Gbaud OFDM-QPSK subcarriers using a silicon nanophotonic-based discrete Fourier transform (DFT) filter. All eight subcarriers showed less than 1.5 dB OSNR penalty compared to the theoretical limit....

The Pegg–Barnett phase operator and the discrete Fourier transform

International Nuclear Information System (INIS)

Perez-Leija, Armando; Szameit, Alexander; Andrade-Morales, Luis A; Soto-Eguibar, Francisco; Moya-Cessa, Héctor M

2016-01-01

In quantum mechanics the position and momentum operators are related to each other via the Fourier transform. In the same way, here we show that the so-called Pegg–Barnett phase operator can be obtained by the application of the discrete Fourier transform to the number operators defined in a finite-dimensional Hilbert space. Furthermore, we show that the structure of the London–Susskind–Glogower phase operator, whose natural logarithm gives rise to the Pegg–Barnett phase operator, is contained in the Hamiltonian of circular waveguide arrays. Our results may find applications in the development of new finite-dimensional photonic systems with interesting phase-dependent properties. (invited comment)

An Efficient Algorithm for the Discrete Gabor Transform using full length Windows

DEFF Research Database (Denmark)

Søndergaard, Peter Lempel

2007-01-01

This paper extends the efficient factorization of the Gabor frame operator developed by Strohmer in [1] to the Gabor analysis/synthesis operator. This provides a fast method for computing the discrete Gabor transform (DGT) and several algorithms associated with it. The algorithm is used...

Effective Approach to Calculate Analysis Window in Infinite Discrete Gabor Transform

Directory of Open Access Journals (Sweden)

Rui Li

2018-01-01

Full Text Available The long-periodic/infinite discrete Gabor transform (DGT is more effective than the periodic/finite one in many applications. In this paper, a fast and effective approach is presented to efficiently compute the Gabor analysis window for arbitrary given synthesis window in DGT of long-periodic/infinite sequences, in which the new orthogonality constraint between analysis window and synthesis window in DGT for long-periodic/infinite sequences is derived and proved to be equivalent to the completeness condition of the long-periodic/infinite DGT. By using the property of delta function, the original orthogonality can be expressed as a certain number of linear equation sets in both the critical sampling case and the oversampling case, which can be fast and efficiently calculated by fast discrete Fourier transform (FFT. The computational complexity of the proposed approach is analyzed and compared with that of the existing canonical algorithms. The numerical results indicate that the proposed approach is efficient and fast for computing Gabor analysis window in both the critical sampling case and the oversampling case in comparison to existing algorithms.

Development status of the lattice physics code in COSINE project

Energy Technology Data Exchange (ETDEWEB)

Chen, Y.; Yu, H.; Li, S.; Liu, Z.; Yan, Y. [State Nuclear Power Software Development Center, SNPTC, National Energy Key Laboratory of Nuclear Power Software NEKLS, North Third Ring Road, Beijing 100029 (China)

2013-07-01

LATC is an essential part of COSINE code package, which stands for Core and System Integrated Engine for design and analysis. LATC performs 2D multi-group assembly transport calculation and generates few group constants and the required cross-section data for CORE, the core simulator code. LATC is designed to have the capability of modeling the API 000 series assemblies. The development is a continuously improved process. Currently, LATC uses well-proven technology to achieve the key functions. In the next stage, more advanced methods and modules will be implemented. At present, WIMS and WIMS improved format library could be read in LATC code. For resonance calculation, equivalent relation with rational approximations is utilized. For transport calculation, two options are available. One choice is collision probability method in cell homogenization while discrete coordinate method in assembly homogenization, the other is method of characteristics in assembly homogenization directly. For depletion calculation, an improved linear rate 'constant power' depletion method has been developed. (authors)

Development status of the lattice physics code in COSINE project

International Nuclear Information System (INIS)

Chen, Y.; Yu, H.; Li, S.; Liu, Z.; Yan, Y.

2013-01-01

LATC is an essential part of COSINE code package, which stands for Core and System Integrated Engine for design and analysis. LATC performs 2D multi-group assembly transport calculation and generates few group constants and the required cross-section data for CORE, the core simulator code. LATC is designed to have the capability of modeling the API 000 series assemblies. The development is a continuously improved process. Currently, LATC uses well-proven technology to achieve the key functions. In the next stage, more advanced methods and modules will be implemented. At present, WIMS and WIMS improved format library could be read in LATC code. For resonance calculation, equivalent relation with rational approximations is utilized. For transport calculation, two options are available. One choice is collision probability method in cell homogenization while discrete coordinate method in assembly homogenization, the other is method of characteristics in assembly homogenization directly. For depletion calculation, an improved linear rate 'constant power' depletion method has been developed. (authors)

Implementation of 2D Discrete Wavelet Transform by Number Theoretic Transform and 2D Overlap-Save Method

Directory of Open Access Journals (Sweden)

Lina Yang

2014-01-01

Full Text Available To reduce the computation complexity of wavelet transform, this paper presents a novel approach to be implemented. It consists of two key techniques: (1 fast number theoretic transform(FNTT In the FNTT, linear convolution is replaced by the circular one. It can speed up the computation of 2D discrete wavelet transform. (2 In two-dimensional overlap-save method directly calculating the FNTT to the whole input sequence may meet two difficulties; namely, a big modulo obstructs the effective implementation of the FNTT and a long input sequence slows the computation of the FNTT down. To fight with such deficiencies, a new technique which is referred to as 2D overlap-save method is developed. Experiments have been conducted. The fast number theoretic transform and 2D overlap-method have been used to implement the dyadic wavelet transform and applied to contour extraction in pattern recognition.

Evaluation of the distortions of the digital chest image caused by the data compression

International Nuclear Information System (INIS)

Ando, Yutaka; Kunieda, Etsuo; Ogawa, Koichi; Tukamoto, Nobuhiro; Hashimoto, Shozo; Aoki, Makoto; Kurotani, Kenichi.

1988-01-01

The image data compression methods using orthogonal transforms (Discrete cosine transform, Discrete fourier transform, Hadamard transform, Haar transform, Slant transform) were analyzed. From the points of the error and the speed of the data conversion, the discrete cosine transform method (DCT) is superior to the other methods. The block quantization by the DCT for the digital chest image was used. The quality of data compressed and reconstructed images by the score analysis and the ROC curve analysis was examined. The chest image with the esophageal cancer and metastatic lung tumors was evaluated at the 17 checkpoints (the tumor, the vascular markings, the border of the heart and ribs, the mediastinal structures and et al). By our score analysis, the satisfactory ratio of the data compression is 1/5 and 1/10. The ROC analysis using normal chest images superimposed by the artificial coin lesions was made. The ROC curve of the 1/5 compressed ratio is almost as same as the original one. To summarize our study, the image data compression method using the DCT is thought to be useful for the clinical use and the 1/5 compression ratio is a tolerable ratio. (author)

Evaluation of the distortions of the digital chest image caused by the data compression

Energy Technology Data Exchange (ETDEWEB)

Ando, Yutaka; Kunieda, Etsuo; Ogawa, Koichi; Tukamoto, Nobuhiro; Hashimoto, Shozo; Aoki, Makoto; Kurotani, Kenichi

1988-08-01

The image data compression methods using orthogonal transforms (Discrete cosine transform, Discrete fourier transform, Hadamard transform, Haar transform, Slant transform) were analyzed. From the points of the error and the speed of the data conversion, the discrete cosine transform method (DCT) is superior to the other methods. The block quantization by the DCT for the digital chest image was used. The quality of data compressed and reconstructed images by the score analysis and the ROC curve analysis was examined. The chest image with the esophageal cancer and metastatic lung tumors was evaluated at the 17 checkpoints (the tumor, the vascular markings, the border of the heart and ribs, the mediastinal structures and et al). By our score analysis, the satisfactory ratio of the data compression is 1/5 and 1/10. The ROC analysis using normal chest images superimposed by the artificial coin lesions was made. The ROC curve of the 1/5 compressed ratio is almost as same as the original one. To summarize our study, the image data compression method using the DCT is thought to be useful for the clinical use and the 1/5 compression ratio is a tolerable ratio.

Information Hiding In Digital Video Using DCT, DWT and CvT

Science.gov (United States)

Abed Shukur, Wisam; Najah Abdullah, Wathiq; Kareem Qurban, Luheb

2018-05-01

The type of video that used in this proposed hiding a secret information technique is .AVI; the proposed technique of a data hiding to embed a secret information into video frames by using Discrete Cosine Transform (DCT), Discrete Wavelet Transform (DWT) and Curvelet Transform (CvT). An individual pixel consists of three color components (RGB), the secret information is embedded in Red (R) color channel. On the receiver side, the secret information is extracted from received video. After extracting secret information, robustness of proposed hiding a secret information technique is measured and obtained by computing the degradation of the extracted secret information by comparing it with the original secret information via calculating the Normalized cross Correlation (NC). The experiments shows the error ratio of the proposed technique is (8%) while accuracy ratio is (92%) when the Curvelet Transform (CvT) is used, but compared with Discrete Wavelet Transform (DWT) and Discrete Cosine Transform (DCT), the error rates are 11% and 14% respectively, while the accuracy ratios are (89%) and (86%) respectively. So, the experiments shows the Poisson noise gives better results than other types of noises, while the speckle noise gives worst results compared with other types of noises. The proposed technique has been established by using MATLAB R2016a programming language.

A Fast DCT Algorithm for Watermarking in Digital Signal Processor

Directory of Open Access Journals (Sweden)

S. E. Tsai

2017-01-01

Full Text Available Discrete cosine transform (DCT has been an international standard in Joint Photographic Experts Group (JPEG format to reduce the blocking effect in digital image compression. This paper proposes a fast discrete cosine transform (FDCT algorithm that utilizes the energy compactness and matrix sparseness properties in frequency domain to achieve higher computation performance. For a JPEG image of 8×8 block size in spatial domain, the algorithm decomposes the two-dimensional (2D DCT into one pair of one-dimensional (1D DCTs with transform computation in only 24 multiplications. The 2D spatial data is a linear combination of the base image obtained by the outer product of the column and row vectors of cosine functions so that inverse DCT is as efficient. Implementation of the FDCT algorithm shows that embedding a watermark image of 32 × 32 block pixel size in a 256 × 256 digital image can be completed in only 0.24 seconds and the extraction of watermark by inverse transform is within 0.21 seconds. The proposed FDCT algorithm is shown more efficient than many previous works in computation.

Image processing tensor transform and discrete tomography with Matlab

CERN Document Server

Grigoryan, Artyom M

2012-01-01

Focusing on mathematical methods in computer tomography, Image Processing: Tensor Transform and Discrete Tomography with MATLAB(R) introduces novel approaches to help in solving the problem of image reconstruction on the Cartesian lattice. Specifically, it discusses methods of image processing along parallel rays to more quickly and accurately reconstruct images from a finite number of projections, thereby avoiding overradiation of the body during a computed tomography (CT) scan. The book presents several new ideas, concepts, and methods, many of which have not been published elsewhere. New co

Discrete canonical transforms that are Hadamard matrices

International Nuclear Information System (INIS)

Healy, John J; Wolf, Kurt Bernardo

2011-01-01

The group Sp(2,R) of symplectic linear canonical transformations has an integral kernel which has quadratic and linear phases, and which is realized by the geometric paraxial optical model. The discrete counterpart of this model is a finite Hamiltonian system that acts on N-point signals through N x N matrices whose elements also have a constant absolute value, although they do not form a representation of that group. Those matrices that are also unitary are Hadamard matrices. We investigate the manifolds of these N x N matrices under the Sp(2,R) equivalence imposed by the model, and find them to be on two-sided cosets. By means of an algorithm we determine representatives that lead to collections of mutually unbiased bases.

A Parallel Framework with Block Matrices of a Discrete Fourier Transform for Vector-Valued Discrete-Time Signals

Directory of Open Access Journals (Sweden)

Pablo Soto-Quiros

2015-01-01

Full Text Available This paper presents a parallel implementation of a kind of discrete Fourier transform (DFT: the vector-valued DFT. The vector-valued DFT is a novel tool to analyze the spectra of vector-valued discrete-time signals. This parallel implementation is developed in terms of a mathematical framework with a set of block matrix operations. These block matrix operations contribute to analysis, design, and implementation of parallel algorithms in multicore processors. In this work, an implementation and experimental investigation of the mathematical framework are performed using MATLAB with the Parallel Computing Toolbox. We found that there is advantage to use multicore processors and a parallel computing environment to minimize the high execution time. Additionally, speedup increases when the number of logical processors and length of the signal increase.

A Novel Robust Audio Watermarking Algorithm by Modifying the Average Amplitude in Transform Domain

Directory of Open Access Journals (Sweden)

Qiuling Wu

2018-05-01

Full Text Available In order to improve the robustness and imperceptibility in practical application, a novel audio watermarking algorithm with strong robustness is proposed by exploring the multi-resolution characteristic of discrete wavelet transform (DWT and the energy compaction capability of discrete cosine transform (DCT. The human auditory system is insensitive to the minor changes in the frequency components of the audio signal, so the watermarks can be embedded by slightly modifying the frequency components of the audio signal. The audio fragments segmented from the cover audio signal are decomposed by DWT to obtain several groups of wavelet coefficients with different frequency bands, and then the fourth level detail coefficient is selected to be divided into the former packet and the latter packet, which are executed for DCT to get two sets of transform domain coefficients (TDC respectively. Finally, the average amplitudes of the two sets of TDC are modified to embed the binary image watermark according to the special embedding rule. The watermark extraction is blind without the carrier audio signal. Experimental results confirm that the proposed algorithm has good imperceptibility, large payload capacity and strong robustness when resisting against various attacks such as MP3 compression, low-pass filtering, re-sampling, re-quantization, amplitude scaling, echo addition and noise corruption.

Broadband time domain acoustic holography based on the discrete orthonormal S-transform

NARCIS (Netherlands)

Zhou, H.; Lopez Arteaga, I.; Nijmeijer, H.; Lim, Kian Meng

2015-01-01

The purpose of this paper is to deal with the problem of nonstationary broadband sound fields more efficiently. A basis function of the discrete orthonormal S-transform (DOST) is used to analyze the measured signal. With respect to the time domain signal in a certain band, DOST leads to a

Uniform sparse bounds for discrete quadratic phase Hilbert transforms

Science.gov (United States)

Kesler, Robert; Arias, Darío Mena

2017-09-01

For each α \\in T consider the discrete quadratic phase Hilbert transform acting on finitely supported functions f : Z → C according to H^{α }f(n):= \\sum _{m ≠ 0} e^{iα m^2} f(n - m)/m. We prove that, uniformly in α \\in T , there is a sparse bound for the bilinear form for every pair of finitely supported functions f,g : Z→ C . The sparse bound implies several mapping properties such as weighted inequalities in an intersection of Muckenhoupt and reverse Hölder classes.

Image Compression using Haar and Modified Haar Wavelet Transform

Directory of Open Access Journals (Sweden)

Mohannad Abid Shehab Ahmed

2013-04-01

Full Text Available Efficient image compression approaches can provide the best solutions to the recent growth of the data intensive and multimedia based applications. As presented in many papers the Haar matrix–based methods and wavelet analysis can be used in various areas of image processing such as edge detection, preserving, smoothing or filtering. In this paper, color image compression analysis and synthesis based on Haar and modified Haar is presented. The standard Haar wavelet transformation with N=2 is composed of a sequence of low-pass and high-pass filters, known as a filter bank, the vertical and horizontal Haar filters are composed to construct four 2-dimensional filters, such filters applied directly to the image to speed up the implementation of the Haar wavelet transform. Modified Haar technique is studied and implemented for odd based numbers i.e. (N=3 & N=5 to generate many solution sets, these sets are tested using the energy function or numerical method to get the optimum one.The Haar transform is simple, efficient in memory usage due to high zero value spread (it can use sparse principle, and exactly reversible without the edge effects as compared to DCT (Discrete Cosine Transform. The implemented Matlab simulation results prove the effectiveness of DWT (Discrete Wave Transform algorithms based on Haar and Modified Haar techniques in attaining an efficient compression ratio (C.R, achieving higher peak signal to noise ratio (PSNR, and the resulting images are of much smoother as compared to standard JPEG especially for high C.R. A comparison between standard JPEG, Haar, and Modified Haar techniques is done finally which approves the highest capability of Modified Haar between others.

Elementary Baecklund transformations for a discrete Ablowitz-Ladik eigenvalue problem

International Nuclear Information System (INIS)

Rourke, David E

2004-01-01

Elementary Baecklund transformations (BTs) are described for a discretization of the Zakharov-Shabat eigenvalue problem (a special case of the Ablowitz-Ladik eigenvalue problem). Elementary BTs allow the process of adding bound states to a system (i.e., the add-one-soliton BT) to be 'factorized' to solving two simpler sub-problems. They are used to determine the effect on the scattering data when bound states are added. They are shown to provide a method of calculating discrete solitons-this is achieved by constructing a lattice of intermediate potentials, with the parameters used in the calculation of the lattice simply related to the soliton scattering data. When the potentials, S n , T n , in the system are related by S n = -T n , they enable simple derivations to be obtained of the add-one-soliton BT and the nonlinear superposition formula

Improved FHT Algorithms for Fast Computation of the Discrete Hartley Transform

Directory of Open Access Journals (Sweden)

M. T. Hamood

2013-05-01

Full Text Available In this paper, by using the symmetrical properties of the discrete Hartley transform (DHT, an improved radix-2 fast Hartley transform (FHT algorithm with arithmetic complexity comparable to that of the real-valued fast Fourier transform (RFFT is developed. It has a simple and regular butterfly structure and possesses the in-place computation property. Furthermore, using the same principles, the development can be extended to more efficient radix-based FHT algorithms. An example for the improved radix-4 FHT algorithm is given to show the validity of the presented method. The arithmetic complexity for the new algorithms are computed and then compared with the existing FHT algorithms. The results of these comparisons have shown that the developed algorithms reduce the number of multiplications and additions considerably.

A novel method for computation of the discrete Fourier transform over characteristic two finite field of even extension degree

OpenAIRE

Fedorenko, Sergei V.

2011-01-01

A novel method for computation of the discrete Fourier transform over a finite field with reduced multiplicative complexity is described. If the number of multiplications is to be minimized, then the novel method for the finite field of even extension degree is the best known method of the discrete Fourier transform computation. A constructive method of constructing for a cyclic convolution over a finite field is introduced.

Factorizations of rational matrix functions with application to discrete isomonodromic transformations and difference Painleve equations

International Nuclear Information System (INIS)

Dzhamay, Anton

2009-01-01

We study factorizations of rational matrix functions with simple poles on the Riemann sphere. For the quadratic case (two poles) we show, using multiplicative representations of such matrix functions, that a good coordinate system on this space is given by a mix of residue eigenvectors of the matrix and its inverse. Our approach is motivated by the theory of discrete isomonodromic transformations and their relationship with difference Painleve equations. In particular, in these coordinates, basic isomonodromic transformations take the form of the discrete Euler-Lagrange equations. Secondly we show that dPV equations, previously obtained in this context by D Arinkin and A Borodin, can be understood as simple relationships between the residues of such matrices and their inverses.

The parallel algorithm for the 2D discrete wavelet transform

Science.gov (United States)

Barina, David; Najman, Pavel; Kleparnik, Petr; Kula, Michal; Zemcik, Pavel

2018-04-01

The discrete wavelet transform can be found at the heart of many image-processing algorithms. Until now, the transform on general-purpose processors (CPUs) was mostly computed using a separable lifting scheme. As the lifting scheme consists of a small number of operations, it is preferred for processing using single-core CPUs. However, considering a parallel processing using multi-core processors, this scheme is inappropriate due to a large number of steps. On such architectures, the number of steps corresponds to the number of points that represent the exchange of data. Consequently, these points often form a performance bottleneck. Our approach appropriately rearranges calculations inside the transform, and thereby reduces the number of steps. In other words, we propose a new scheme that is friendly to parallel environments. When evaluating on multi-core CPUs, we consistently overcome the original lifting scheme. The evaluation was performed on 61-core Intel Xeon Phi and 8-core Intel Xeon processors.

Generation of artificial accelerograms using neural networks for data of Iran

International Nuclear Information System (INIS)

Bargi, Kh.; Loux, C.; Rohani, H.

2002-01-01

A new method for generation of artificial earthquake accelerograms from response spectra is proposed by Ghaboussi and Lin in 1997 using neural networks. In this paper the methodology has been extended and enhanced for data of Iran. For this purpose, first 40 records of Iran acceleration is chosen, then an RBF neural network which called generalized regression neural network learn the inverse mapping directly from the response spectrum to the Discrete Cosine Transform of accelerograms. Discrete Cosine Transform has been used as an assisting device to extract the content of frequency domain. Learning of network is reasonable and a generalized regression neural network learns it in a few second. Outputs are presented to demonstrate the performance of this method and show its capabilities

RISC & DSP System Application Design using VHDL

OpenAIRE

Rachana Solanki; Vinay Gupta

2014-01-01

The Reduced Instruction Set Computer (RISC) processor use fewer instructions with simple constructs, therefore they can be executed much faster within the CPU without having to use memory as often. It reduce execution time by simplifying the instruction set of the computer. The DSP processors are perform the operation such as Discrete Cosine transform (DCT), Inverse DCT, Discrete Fourier Transform (DFT) and Fast Fourier Transform (FFT) are performed by DSP system. This paper represent the des...

Simulating first order optical systems—algorithms for and composition of discrete linear canonical transforms

Science.gov (United States)

Healy, John J.

2018-01-01

The linear canonical transforms (LCTs) are a parameterised group of linear integral transforms. The LCTs encompass a number of well-known transformations as special cases, including the Fourier transform, fractional Fourier transform, and the Fresnel integral. They relate the scalar wave fields at the input and output of systems composed of thin lenses and free space, along with other quadratic phase systems. In this paper, we perform a systematic search of all algorithms based on up to five stages of magnification, chirp multiplication and Fourier transforms. Based on that search, we propose a novel algorithm, for which we present numerical results. We compare the sampling requirements of three algorithms. Finally, we discuss some issues surrounding the composition of discrete LCTs.

Design of the Coordinate Transformation Function for Cylindrical Acoustic Cloaks with a Quantity of Discrete Layers

International Nuclear Information System (INIS)

Cai Li; Wen Ji-Hong; Yu Dian-Long; Lu Zhi-Miao; Wen Xi-Sen

2014-01-01

Acoustic cloak based on coordinate transformation is of great topical interest and has promise in potential applications such as sound transparency and insulation. The frequency response of acoustic cloaks with a quantity of discrete homogeneous layers is analyzed by the acoustic scattering theory. The effect of coordinate transformation function on the acoustic total scattering cross section is discussed to achieve low scattering with only a few layers of anisotropic metamaterials. Also, the physics of acoustic wave interaction with the interfaces between the discrete layers inside the cloak shell is discussed. These results provide a better way of designing a multilayered acoustic cloak with fewer layers. (fundamental areas of phenomenology(including applications))

Design of the Coordinate Transformation Function for Cylindrical Acoustic Cloaks with a Quantity of Discrete Layers

Science.gov (United States)

Cai, Li; Wen, Ji-Hong; Yu, Dian-Long; Lu, Zhi-Miao; Wen, Xi-Sen

2014-09-01

Acoustic cloak based on coordinate transformation is of great topical interest and has promise in potential applications such as sound transparency and insulation. The frequency response of acoustic cloaks with a quantity of discrete homogeneous layers is analyzed by the acoustic scattering theory. The effect of coordinate transformation function on the acoustic total scattering cross section is discussed to achieve low scattering with only a few layers of anisotropic metamaterials. Also, the physics of acoustic wave interaction with the interfaces between the discrete layers inside the cloak shell is discussed. These results provide a better way of designing a multilayered acoustic cloak with fewer layers.

A discrete spherical X-ray transform of orientation distribution functions using bounding cubes

DEFF Research Database (Denmark)

Kazantsev, Ivan G; Schmidt, Søren; Poulsen, Henning Friis

2009-01-01

We investigate a cubed sphere parametrization of orientation space with the aim of constructing a discrete voxelized version of the spherical x-ray transform. For tracing the propagation of a unit great circle through the partition subsets, the frustums of the cubed sphere, a fast procedure...

State transformations and Hamiltonian structures for optimal control in discrete systems

Science.gov (United States)

Sieniutycz, S.

2006-04-01

Preserving usual definition of Hamiltonian H as the scalar product of rates and generalized momenta we investigate two basic classes of discrete optimal control processes governed by the difference rather than differential equations for the state transformation. The first class, linear in the time interval θ, secures the constancy of optimal H and satisfies a discrete Hamilton-Jacobi equation. The second class, nonlinear in θ, does not assure the constancy of optimal H and satisfies only a relationship that may be regarded as an equation of Hamilton-Jacobi type. The basic question asked is if and when Hamilton's canonical structures emerge in optimal discrete systems. For a constrained discrete control, general optimization algorithms are derived that constitute powerful theoretical and computational tools when evaluating extremum properties of constrained physical systems. The mathematical basis is Bellman's method of dynamic programming (DP) and its extension in the form of the so-called Carathéodory-Boltyanski (CB) stage optimality criterion which allows a variation of the terminal state that is otherwise fixed in Bellman's method. For systems with unconstrained intervals of the holdup time θ two powerful optimization algorithms are obtained: an unconventional discrete algorithm with a constant H and its counterpart for models nonlinear in θ. We also present the time-interval-constrained extension of the second algorithm. The results are general; namely, one arrives at: discrete canonical equations of Hamilton, maximum principles, and (at the continuous limit of processes with free intervals of time) the classical Hamilton-Jacobi theory, along with basic results of variational calculus. A vast spectrum of applications and an example are briefly discussed with particular attention paid to models nonlinear in the time interval θ.

Design and application of discrete wavelet packet transform based multiresolution controller for liquid level system.

Science.gov (United States)

Paul, Rimi; Sengupta, Anindita

2017-11-01

A new controller based on discrete wavelet packet transform (DWPT) for liquid level system (LLS) has been presented here. This controller generates control signal using node coefficients of the error signal which interprets many implicit phenomena such as process dynamics, measurement noise and effect of external disturbances. Through simulation results on LLS problem, this controller is shown to perform faster than both the discrete wavelet transform based controller and conventional proportional integral controller. Also, it is more efficient in terms of its ability to provide better noise rejection. To overcome the wind up phenomenon by considering the saturation due to presence of actuator, anti-wind up technique is applied to the conventional PI controller and compared to the wavelet packet transform based controller. In this case also, packet controller is found better than the other ones. This similar work has been extended for analogous first order RC plant as well as second order plant also. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

Discrete Hilbert transformation and its application to estimate the wind speed in Hong Kong

Energy Technology Data Exchange (ETDEWEB)

Zhu, Zuojin [Department of Thermal Science and Energy Engineering, Institute of Engineering Science, University of Science and Technology of China, Hefei, Anhui (China); Yang, Hongxing [Department of Building Services Engineering, The Hong Kong Polytechnic University, Hong Kong (Hong Kong)

2002-01-01

Discrete Hilbert Transform (DHT) has been applied to estimate the wind speed with the sample data sequence selected from the data record observed by the observatory in Hong Kong in June 1989, during which the data pertain to deep valleys and sharp crests due to manifold weather conditions in this region. To confirm the performance of the discrete Hilbert transformer, two harmonic input sequences were used to inspect the output signals, whether good agreement with the theoretical results is obtained. It was found that the energy spectrum and the outputs for the two different harmonic discrete waves are certainly correct. After the inspection of the DHT filter, the sample data for wind speed in Hong Kong were used for wind speed forecasting. For zero mean input sequence, the variance of the output is the same as that of the input signals, and so is the energy spectrum. The DHT of an individual input sample can really reflect the local variation performance, since it is the convolution with the reciprocal of time and the input data sequence, but there exists phase shift. For harmonic signals, the output signal holds a 90 phase delay.

A progressive data compression scheme based upon adaptive transform coding: Mixture block coding of natural images

Science.gov (United States)

Rost, Martin C.; Sayood, Khalid

1991-01-01

A method for efficiently coding natural images using a vector-quantized variable-blocksized transform source coder is presented. The method, mixture block coding (MBC), incorporates variable-rate coding by using a mixture of discrete cosine transform (DCT) source coders. Which coders are selected to code any given image region is made through a threshold driven distortion criterion. In this paper, MBC is used in two different applications. The base method is concerned with single-pass low-rate image data compression. The second is a natural extension of the base method which allows for low-rate progressive transmission (PT). Since the base method adapts easily to progressive coding, it offers the aesthetic advantage of progressive coding without incorporating extensive channel overhead. Image compression rates of approximately 0.5 bit/pel are demonstrated for both monochrome and color images.

Cosine and sine operators related to orthogonal polynomial sets on the interval [-1, 1

International Nuclear Information System (INIS)

Appl, Thomas; Schiller, Diethard H

2005-01-01

The quantization of phase is still an open problem. In the approach of Susskind and Glogower, the so-called cosine and sine operators play a fundamental role. Their eigenstates in the Fock representation are related to the Chebyshev polynomials of the second kind. Here we introduce more general cosine and sine operators whose eigenfunctions in the Fock basis are related in a similar way to arbitrary orthogonal polynomial sets on the interval [-1, 1]. To each polynomial set defined in terms of a weight function there corresponds a pair of cosine and sine operators. Depending on the symmetry of the weight function, we distinguish generalized or extended operators. Their eigenstates are used to define cosine and sine representations and probability distributions. We also consider the arccosine and arcsine operators and use their eigenstates to define cosine-phase and sine-phase distributions, respectively. Specific, numerical and graphical results are given for the classical orthogonal polynomials and for particular Fock and coherent states

Designing garbage-free reversible implementations of the integer cosine transform

DEFF Research Database (Denmark)

De Vos, Alexis; Burignat, Stephane; Gluck, Robert

2014-01-01

reversible circuit is able to perform both the forward transform and the inverse transform. The detailed structure of such a reversible design strongly depends on the odd prime factors of the determinant of the transform: whether those are of the form 2k ± 1 or of the form 2k ± 2l ± 1 or neither...

Ambiguity attacks on robust blind image watermarking scheme based on redundant discrete wavelet transform and singular value decomposition

Directory of Open Access Journals (Sweden)

Khaled Loukhaoukha

2017-12-01

Full Text Available Among emergent applications of digital watermarking are copyright protection and proof of ownership. Recently, Makbol and Khoo (2013 have proposed for these applications a new robust blind image watermarking scheme based on the redundant discrete wavelet transform (RDWT and the singular value decomposition (SVD. In this paper, we present two ambiguity attacks on this algorithm that have shown that this algorithm fails when used to provide robustness applications like owner identification, proof of ownership, and transaction tracking. Keywords: Ambiguity attack, Image watermarking, Singular value decomposition, Redundant discrete wavelet transform

Implementation in an FPGA circuit of Edge detection algorithm based on the Discrete Wavelet Transforms

Science.gov (United States)

Bouganssa, Issam; Sbihi, Mohamed; Zaim, Mounia

2017-07-01

The 2D Discrete Wavelet Transform (DWT) is a computationally intensive task that is usually implemented on specific architectures in many imaging systems in real time. In this paper, a high throughput edge or contour detection algorithm is proposed based on the discrete wavelet transform. A technique for applying the filters on the three directions (Horizontal, Vertical and Diagonal) of the image is used to present the maximum of the existing contours. The proposed architectures were designed in VHDL and mapped to a Xilinx Sparten6 FPGA. The results of the synthesis show that the proposed architecture has a low area cost and can operate up to 100 MHz, which can perform 2D wavelet analysis for a sequence of images while maintaining the flexibility of the system to support an adaptive algorithm.

Direct linearizing transform for three-dimensional discrete integrable systems: the lattice AKP, BKP and CKP equations.

Science.gov (United States)

Fu, Wei; Nijhoff, Frank W

2017-07-01

A unified framework is presented for the solution structure of three-dimensional discrete integrable systems, including the lattice AKP, BKP and CKP equations. This is done through the so-called direct linearizing transform, which establishes a general class of integral transforms between solutions. As a particular application, novel soliton-type solutions for the lattice CKP equation are obtained.

Novel structures for Discrete Hartley Transform based on first-order moments

Science.gov (United States)

Xiong, Jun; Zheng, Wenjuan; Wang, Hao; Liu, Jianguo

2018-03-01

Discrete Hartley Transform (DHT) is an important tool in digital signal processing. In the present paper, the DHT is firstly transformed into the first-order moments-based form, then a new fast algorithm is proposed to calculate the first-order moments without multiplication. Based on the algorithm theory, the corresponding hardware architecture for DHT is proposed, which only contains shift operations and additions with no need for multipliers and large memory. To verify the availability and effectiveness, the proposed design is implemented with hardware description language and synthesized by Synopsys Design Compiler with 0.18-μm SMIC library. A series of experiments have proved that the proposed architecture has better performance in terms of the product of the hardware consumption and computation time.

Feature Extraction Using Discrete Wavelet Transform for Gear Fault Diagnosis of Wind Turbine Gearbox

DEFF Research Database (Denmark)

Bajric, Rusmir; Zuber, Ninoslav; Skrimpas, Georgios Alexandros

2016-01-01

, the vibration signals are decomposed into a series of subbands signals with the use of amultiresolution analytical property of the discrete wavelet transform.Then, 22 condition indicators are extracted fromthe TSA signal, residual signal, and difference signal.Through the case study analysis, a new approach...

Muon detector for the COSINE-100 experiment

Science.gov (United States)

Prihtiadi, H.; Adhikari, G.; Adhikari, P.; Barbosa de Souza, E.; Carlin, N.; Choi, S.; Choi, W. Q.; Djamal, M.; Ezeribe, A. C.; Ha, C.; Hahn, I. S.; Hubbard, A. J. F.; Jeon, E. J.; Jo, J. H.; Joo, H. W.; Kang, W.; Kang, W. G.; Kauer, M.; Kim, B. H.; Kim, H.; Kim, H. J.; Kim, K. W.; Kim, N. Y.; Kim, S. K.; Kim, Y. D.; Kim, Y. H.; Kudryavtsev, V. A.; Lee, H. S.; Lee, J.; Lee, J. Y.; Lee, M. H.; Leonard, D. S.; Lim, K. E.; Lynch, W. A.; Maruyama, R. H.; Mouton, F.; Olsen, S. L.; Park, H. K.; Park, H. S.; Park, J. S.; Park, K. S.; Pettus, W.; Pierpoint, Z. P.; Ra, S.; Rogers, F. R.; Rott, C.; Scarff, A.; Spooner, N. J. C.; Thompson, W. G.; Yang, L.; Yong, S. H.

2018-02-01

The COSINE-100 dark matter search experiment has started taking physics data with the goal of performing an independent measurement of the annual modulation signal observed by DAMA/LIBRA. A muon detector was constructed by using plastic scintillator panels in the outermost layer of the shield surrounding the COSINE-100 detector. It detects cosmic ray muons in order to understand the impact of the muon annual modulation on dark matter analysis. Assembly and initial performance tests of each module have been performed at a ground laboratory. The installation of the detector in the Yangyang Underground Laboratory (Y2L) was completed in the summer of 2016. Using three months of data, the muon underground flux was measured to be 328 ± 1(stat.)± 10(syst.) muons/m2/day. In this report, the assembly of the muon detector and the results from the analysis are presented.

On distributional assumptions and whitened cosine similarities

DEFF Research Database (Denmark)

Loog, Marco

2008-01-01

Recently, an interpretation of the whitened cosine similarity measure as a Bayes decision rule was proposed (C. Liu, "The Bayes Decision Rule Induced Similarity Measures,'' IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 29, no. 6, pp. 1086-1090, June 2007. This communication makes th...

A Classroom Note on Generating Examples for the Laws of Sines and Cosines from Pythagorean Triangles

Science.gov (United States)

Sher, Lawrence; Sher, David

2007-01-01

By selecting certain special triangles, students can learn about the laws of sines and cosines without wrestling with long decimal representations or irrational numbers. Since the law of cosines requires only one of the three angles of a triangle, there are many examples of triangles with integral sides and a cosine that can be represented exactly…

A novel algorithm for discrimination between inrush current and internal faults in power transformer differential protection based on discrete wavelet transform

Energy Technology Data Exchange (ETDEWEB)

Eldin, A.A. Hossam; Refaey, M.A. [Electrical Engineering Department, Alexandria University, Alexandria (Egypt)

2011-01-15

This paper proposes a novel methodology for transformer differential protection, based on wave shape recognition of the discriminating criterion extracted of the instantaneous differential currents. Discrete wavelet transform has been applied to the differential currents due to internal fault and inrush currents. The diagnosis criterion is based on median absolute deviation (MAD) of wavelet coefficients over a specified frequency band. The proposed algorithm is examined using various simulated inrush and internal fault current cases on a power transformer that has been modeled using electromagnetic transients program EMTDC software. Results of evaluation study show that, proposed wavelet based differential protection scheme can discriminate internal faults from inrush currents. (author)

Animation Strategies for Smooth Transformations Between Discrete Lods of 3d Building Models

Science.gov (United States)

Kada, Martin; Wichmann, Andreas; Filippovska, Yevgeniya; Hermes, Tobias

2016-06-01

The cartographic 3D visualization of urban areas has experienced tremendous progress over the last years. An increasing number of applications operate interactively in real-time and thus require advanced techniques to improve the quality and time response of dynamic scenes. The main focus of this article concentrates on the discussion of strategies for smooth transformation between two discrete levels of detail (LOD) of 3D building models that are represented as restricted triangle meshes. Because the operation order determines the geometrical and topological properties of the transformation process as well as its visual perception by a human viewer, three different strategies are proposed and subsequently analyzed. The simplest one orders transformation operations by the length of the edges to be collapsed, while the other two strategies introduce a general transformation direction in the form of a moving plane. This plane either pushes the nodes that need to be removed, e.g. during the transformation of a detailed LOD model to a coarser one, towards the main building body, or triggers the edge collapse operations used as transformation paths for the cartographic generalization.

Review of finite fields: Applications to discrete Fourier, transforms and Reed-Solomon coding

Science.gov (United States)

Wong, J. S. L.; Truong, T. K.; Benjauthrit, B.; Mulhall, B. D. L.; Reed, I. S.

1977-01-01

An attempt is made to provide a step-by-step approach to the subject of finite fields. Rigorous proofs and highly theoretical materials are avoided. The simple concepts of groups, rings, and fields are discussed and developed more or less heuristically. Examples are used liberally to illustrate the meaning of definitions and theories. Applications include discrete Fourier transforms and Reed-Solomon coding.

Near infrared face recognition by combining Zernike moments and undecimated discrete wavelet transform

Czech Academy of Sciences Publication Activity Database

Farokhi, Sajad; Shamsuddin, S.M.; Sheikh, U.U.; Flusser, Jan; Khansari, M.; Jafari-Khouzani, K.

2014-01-01

Roč. 31, č. 1 (2014), s. 13-27 ISSN 1051-2004 R&D Projects: GA ČR GAP103/11/1552 Institutional support: RVO:67985556 Keywords : Zernike moments * Undecimated discrete wavelet transform * Decision fusion * Near infrared * Face recognition Subject RIV: JD - Computer Applications, Robotics Impact factor: 1.256, year: 2014 http://library.utia.cas.cz/separaty/2014/ZOI/flusser-0428536.pdf

Video Coding Technique using MPEG Compression Standards

African Journals Online (AJOL)

Akorede

The two dimensional discrete cosine transform (2-D DCT) is an integral part of video and image compression ... solution for the optimum trade-off by applying rate-distortion theory has been ..... Int. J. the computer, the internet and management,.

An Efficient Digital Pulse Shape Discrimination Technique for Scintillation Detectors Based on FPGA

International Nuclear Information System (INIS)

Kamel, M.S.

2014-01-01

Different techniques for pulse discrimination (PSD) of the scintillation pulses have been developed. The PSD of scintillation pulese can been used in several applications as Positron Emission Topography (PET) system. Each technique analyzes the resulting pulses from the absorption of radiation in the scintillation pulses were filtered and digitized then it is captured using DAQ, and it sent to the host computer for processing. The spatial resolution of images that generated in PET system can be improved by applying the proposed PSD. In this thesis various digital PSD techniques are proposed to discriminate the scintillation pulses. These techniques are based on discrete sine transform (DST). discrete cosine transform (DCT). Discrete hartley transform (DHT), Discrete Goertzel transform (DGT),and principal component analysis (PCA). Then the output coefficients of the discrete transforms are classified using one of the following classifiers T-test,tuned, or support vector machine (SVM).

Estimation of Interchannel Time Difference in Frequency Subbands Based on Nonuniform Discrete Fourier Transform

Directory of Open Access Journals (Sweden)

Qiu Bo

2008-01-01

Full Text Available Binaural cue coding (BCC is an efficient technique for spatial audio rendering by using the side information such as interchannel level difference (ICLD, interchannel time difference (ICTD, and interchannel correlation (ICC. Of the side information, the ICTD plays an important role to the auditory spatial image. However, inaccurate estimation of the ICTD may lead to the audio quality degradation. In this paper, we develop a novel ICTD estimation algorithm based on the nonuniform discrete Fourier transform (NDFT and integrate it with the BCC approach to improve the decoded auditory image. Furthermore, a new subjective assessment method is proposed for the evaluation of auditory image widths of decoded signals. The test results demonstrate that the NDFT-based scheme can achieve much wider and more externalized auditory image than the existing BCC scheme based on the discrete Fourier transform (DFT. It is found that the present technique, regardless of the image width, does not deteriorate the sound quality at the decoder compared to the traditional scheme without ICTD estimation.

ANIMATION STRATEGIES FOR SMOOTH TRANSFORMATIONS BETWEEN DISCRETE LODS OF 3D BUILDING MODELS

Directory of Open Access Journals (Sweden)

M. Kada

2016-06-01

Full Text Available The cartographic 3D visualization of urban areas has experienced tremendous progress over the last years. An increasing number of applications operate interactively in real-time and thus require advanced techniques to improve the quality and time response of dynamic scenes. The main focus of this article concentrates on the discussion of strategies for smooth transformation between two discrete levels of detail (LOD of 3D building models that are represented as restricted triangle meshes. Because the operation order determines the geometrical and topological properties of the transformation process as well as its visual perception by a human viewer, three different strategies are proposed and subsequently analyzed. The simplest one orders transformation operations by the length of the edges to be collapsed, while the other two strategies introduce a general transformation direction in the form of a moving plane. This plane either pushes the nodes that need to be removed, e.g. during the transformation of a detailed LOD model to a coarser one, towards the main building body, or triggers the edge collapse operations used as transformation paths for the cartographic generalization.

Discrete Wavelet Transform for Fault Locations in Underground Distribution System

Science.gov (United States)

Apisit, C.; Ngaopitakkul, A.

2010-10-01

In this paper, a technique for detecting faults in underground distribution system is presented. Discrete Wavelet Transform (DWT) based on traveling wave is employed in order to detect the high frequency components and to identify fault locations in the underground distribution system. The first peak time obtained from the faulty bus is employed for calculating the distance of fault from sending end. The validity of the proposed technique is tested with various fault inception angles, fault locations and faulty phases. The result is found that the proposed technique provides satisfactory result and will be very useful in the development of power systems protection scheme.

Application of Discrete Fourier Transform in solving the inverse problem in gamma-ray logging

International Nuclear Information System (INIS)

Zorski, T.

1980-01-01

A new approach to the solution of inverse problem in gamma-ray logging is presented. The equation: I(z) = ∫sup(+infinite)sub(-infinite) phi (z-z')Isub(infinite)(z')dz', which relates the measured intensity I(z) with the intensity Isub(infinite)(z) not disturbed by finite thickness of an elementary layer, is solved for Isub(infinite)(z). Discrete Fourier Transform and convolution theorem are used. As a result of our solution discrete values of Isub(infinite)(z) given at a step of Δh are obtained. Examples of application of this method for Δh <= 4.5 cm and for the curves I(z) theoretically calculated are also discussed. (author)

FAST DISCRETE CURVELET TRANSFORM BASED ANISOTROPIC FEATURE EXTRACTION FOR IRIS RECOGNITION

Directory of Open Access Journals (Sweden)

Amol D. Rahulkar

2010-11-01

Full Text Available The feature extraction plays a very important role in iris recognition. Recent researches on multiscale analysis provide good opportunity to extract more accurate information for iris recognition. In this work, a new directional iris texture features based on 2-D Fast Discrete Curvelet Transform (FDCT is proposed. The proposed approach divides the normalized iris image into six sub-images and the curvelet transform is applied independently on each sub-image. The anisotropic feature vector for each sub-image is derived using the directional energies of the curvelet coefficients. These six feature vectors are combined to create the resultant feature vector. During recognition, the nearest neighbor classifier based on Euclidean distance has been used for authentication. The effectiveness of the proposed approach has been tested on two different databases namely UBIRIS and MMU1. Experimental results show the superiority of the proposed approach.

A Posteriori Restoration of Block Transform-Compressed Data

Science.gov (United States)

Brown, R.; Boden, A. F.

1995-01-01

The Galileo spacecraft will use lossy data compression for the transmission of its science imagery over the low-bandwidth communication system. The technique chosen for image compression is a block transform technique based on the Integer Cosine Transform, a derivative of the JPEG image compression standard. Considered here are two known a posteriori enhancement techniques, which are adapted.

A study of renal blood flow regulation using the discrete wavelet transform

Science.gov (United States)

Pavlov, Alexey N.; Pavlova, Olga N.; Mosekilde, Erik; Sosnovtseva, Olga V.

2010-02-01

In this paper we provide a way to distinguish features of renal blood flow autoregulation mechanisms in normotensive and hypertensive rats based on the discrete wavelet transform. Using the variability of the wavelet coefficients we show distinctions that occur between the normal and pathological states. A reduction of this variability in hypertension is observed on the microscopic level of the blood flow in efferent arteriole of single nephrons. This reduction is probably associated with higher flexibility of healthy cardiovascular system.

Data Compression with Linear Algebra

OpenAIRE

Etler, David

2015-01-01

A presentation on the applications of linear algebra to image compression. Covers entropy, the discrete cosine transform, thresholding, quantization, and examples of images compressed with DCT. Given in Spring 2015 at Ocean County College as part of the honors program.

Recognition of Activities of Daily Living Based on Environmental Analyses Using Audio Fingerprinting Techniques: A Systematic Review

Directory of Open Access Journals (Sweden)

Ivan Miguel Pires

2018-01-01

Full Text Available An increase in the accuracy of identification of Activities of Daily Living (ADL is very important for different goals of Enhanced Living Environments and for Ambient Assisted Living (AAL tasks. This increase may be achieved through identification of the surrounding environment. Although this is usually used to identify the location, ADL recognition can be improved with the identification of the sound in that particular environment. This paper reviews audio fingerprinting techniques that can be used with the acoustic data acquired from mobile devices. A comprehensive literature search was conducted in order to identify relevant English language works aimed at the identification of the environment of ADLs using data acquired with mobile devices, published between 2002 and 2017. In total, 40 studies were analyzed and selected from 115 citations. The results highlight several audio fingerprinting techniques, including Modified discrete cosine transform (MDCT, Mel-frequency cepstrum coefficients (MFCC, Principal Component Analysis (PCA, Fast Fourier Transform (FFT, Gaussian mixture models (GMM, likelihood estimation, logarithmic moduled complex lapped transform (LMCLT, support vector machine (SVM, constant Q transform (CQT, symmetric pairwise boosting (SPB, Philips robust hash (PRH, linear discriminant analysis (LDA and discrete cosine transform (DCT.

Sato's Baecklund transformations, additional symmetries and ASvM formula for the discrete KP hierarchy

International Nuclear Information System (INIS)

Liu Shaowei; Cheng Yi

2010-01-01

Two kinds of symmetries, Sato's Baecklund transformations and additional symmetries, for the discrete KP (dKP) hierarchy are introduced, and the ASvM formula which demonstrates the equivalence of these two kinds of symmetries is obtained. In this process the Fay identity and the difference Fay identity of the dKP hierarchy are introduced and the ASvM formula in the form of tau function is calculated.

Variable discrete ordinates method for radiation transfer in plane-parallel semi-transparent media with variable refractive index

Science.gov (United States)

Sarvari, S. M. Hosseini

2017-09-01

The traditional form of discrete ordinates method is applied to solve the radiative transfer equation in plane-parallel semi-transparent media with variable refractive index through using the variable discrete ordinate directions and the concept of refracted radiative intensity. The refractive index are taken as constant in each control volume, such that the direction cosines of radiative rays remain non-variant through each control volume, and then, the directions of discrete ordinates are changed locally by passing each control volume, according to the Snell's law of refraction. The results are compared by the previous studies in this field. Despite simplicity, the results show that the variable discrete ordinate method has a good accuracy in solving the radiative transfer equation in the semi-transparent media with arbitrary distribution of refractive index.

Transform Domain Robust Variable Step Size Griffiths' Adaptive Algorithm for Noise Cancellation in ECG

Science.gov (United States)

Hegde, Veena; Deekshit, Ravishankar; Satyanarayana, P. S.

2011-12-01

The electrocardiogram (ECG) is widely used for diagnosis of heart diseases. Good quality of ECG is utilized by physicians for interpretation and identification of physiological and pathological phenomena. However, in real situations, ECG recordings are often corrupted by artifacts or noise. Noise severely limits the utility of the recorded ECG and thus needs to be removed, for better clinical evaluation. In the present paper a new noise cancellation technique is proposed for removal of random noise like muscle artifact from ECG signal. A transform domain robust variable step size Griffiths' LMS algorithm (TVGLMS) is proposed for noise cancellation. For the TVGLMS, the robust variable step size has been achieved by using the Griffiths' gradient which uses cross-correlation between the desired signal contaminated with observation or random noise and the input. The algorithm is discrete cosine transform (DCT) based and uses symmetric property of the signal to represent the signal in frequency domain with lesser number of frequency coefficients when compared to that of discrete Fourier transform (DFT). The algorithm is implemented for adaptive line enhancer (ALE) filter which extracts the ECG signal in a noisy environment using LMS filter adaptation. The proposed algorithm is found to have better convergence error/misadjustment when compared to that of ordinary transform domain LMS (TLMS) algorithm, both in the presence of white/colored observation noise. The reduction in convergence error achieved by the new algorithm with desired signal decomposition is found to be lower than that obtained without decomposition. The experimental results indicate that the proposed method is better than traditional adaptive filter using LMS algorithm in the aspects of retaining geometrical characteristics of ECG signal.

Group-theoretical aspects of the discrete sine-Gordon equation

International Nuclear Information System (INIS)

Orfanidis, S.J.

1980-01-01

The group-theoretical interpretation of the sine-Gordon equation in terms of connection forms on fiber bundles is extended to the discrete case. Solutions of the discrete sine-Gordon equation induce surfaces on a lattice in the SU(2) group space. The inverse scattering representation, expressing the parallel transport of fibers, is implemented by means of finite rotations. Discrete Baecklund transformations are realized as gauge transformations. The three-dimensional inverse scattering representation is used to derive a discrete nonlinear sigma model, and the corresponding Baecklund transformation and Pohlmeyer's R transformation are constructed

Psychoacoustic Music Analysis Based on the Discrete Wavelet Packet Transform

Directory of Open Access Journals (Sweden)

Xing He

2008-01-01

Full Text Available Psychoacoustical computational models are necessary for the perceptual processing of acoustic signals and have contributed significantly in the development of highly efficient audio analysis and coding. In this paper, we present an approach for the psychoacoustic analysis of musical signals based on the discrete wavelet packet transform. The proposed method mimics the multiresolution properties of the human ear closer than other techniques and it includes simultaneous and temporal auditory masking. Experimental results show that this method provides better masking capabilities and it reduces the signal-to-masking ratio substantially more than other approaches, without introducing audible distortion. This model can lead to greater audio compression by permitting further bit rate reduction and more secure watermarking by providing greater signal space for information hiding.

Resolution enhancement of low quality videos using a high-resolution frame

NARCIS (Netherlands)

Pham, T.Q.; Van Vliet, L.J.; Schutte, K.

2006-01-01

This paper proposes an example-based Super-Resolution (SR) algorithm of compressed videos in the Discrete Cosine Transform (DCT) domain. Input to the system is a Low-Resolution (LR) compressed video together with a High-Resolution (HR) still image of similar content. Using a training set of

Cosine components in water levels at Yucca Mountain

International Nuclear Information System (INIS)

Rice, J.; Lehman, L.; Keen, K.

1990-01-01

Water-level records from wells at Yucca Mountain, Nevada are analyzed periodically to determine if they contain periodic (cosine) components. Water-level data from selected wells are input to an iterative numerical procedure that determines a best fitting cosine function. The available water-level data, with coverage of up to 5 years, appear to be representative of the natural water-level changes. From our analysis of 9 water-level records, it appears that there may be periodic components (periods of 2-3 years) in the groundwater-level fluctuations at Yucca Mountain, Nevada, although some records are fit better than others by cosine functions. It also appears that the periodic behavior has a spatial distribution. Wells west of Yucca Mountain have different periods and phase shifts from wells on and east of Yucca Mountain. Interestingly, a similar spatial distribution of groundwater chemistry at Yucca Mountain is reported by Matuska (1988). This suggests a physical cause may underlie the different physical and chemical groundwater conditions. Although a variety of natural processes could cause water-level fluctuations, hydrologic processes are the most likely, because the periodicities are only a few years. A possible cause could be periodic recharge related to a periodicity in precipitation. It is interesting that Cochran et al., (1988), show a crude two-year cycle of precipitation for 1961 to 1970 in southern Nevada. Why periods and phase shifts may differ across Yucca Mountain is unknown. Different phase shifts could indicate different lag times of response to hydrologic stimuli. Difference in periods could mean that the geologic media is heterogeneous and displays heterogeneous response to a single stimulus, or that stimuli differ in certain regions, or that a hydraulic barrier separates the groundwater system into two regions having different water chemistry and recharge areas. 13 refs., 5 figs., 1 tab

A Novel Design of Sparse Prototype Filter for Nearly Perfect Reconstruction Cosine-Modulated Filter Banks

Directory of Open Access Journals (Sweden)

Wei Xu

2018-05-01

Full Text Available Cosine-modulated filter banks play a major role in digital signal processing. Sparse FIR filter banks have lower implementation complexity than full filter banks, while keeping a good performance level. This paper presents a fast design paradigm for sparse nearly perfect-reconstruction (NPR cosine-modulated filter banks. First, an approximation function is introduced to reduce the non-convex quadratically constrained optimization problem to a linearly constrained optimization problem. Then, the desired sparse linear phase FIR prototype filter is derived through the orthogonal matching pursuit (OMP performed under the weighted l 2 norm. The simulation results demonstrate that the proposed scheme is an effective paradigm to design sparse NPR cosine-modulated filter banks.

Cuspidal discrete series for projective hyperbolic spaces

DEFF Research Database (Denmark)

Andersen, Nils Byrial; Flensted-Jensen, Mogens

2013-01-01

Abstract. We have in [1] proposed a definition of cusp forms on semisimple symmetric spaces G/H, involving the notion of a Radon transform and a related Abel transform. For the real non-Riemannian hyperbolic spaces, we showed that there exists an infinite number of cuspidal discrete series......, and at most finitely many non-cuspidal discrete series, including in particular the spherical discrete series. For the projective spaces, the spherical discrete series are the only non-cuspidal discrete series. Below, we extend these results to the other hyperbolic spaces, and we also study the question...

Spatio-temporal phase retrieval in speckle interferometry with Hilbert transform and two-dimensional phase unwrapping

Science.gov (United States)

Li, Xiangyu; Huang, Zhanhua; Zhu, Meng; He, Jin; Zhang, Hao

2014-12-01

Hilbert transform (HT) is widely used in temporal speckle pattern interferometry, but errors from low modulations might propagate and corrupt the calculated phase. A spatio-temporal method for phase retrieval using temporal HT and spatial phase unwrapping is presented. In time domain, the wrapped phase difference between the initial and current states is directly determined by using HT. To avoid the influence of the low modulation intensity, the phase information between the two states is ignored. As a result, the phase unwrapping is shifted from time domain to space domain. A phase unwrapping algorithm based on discrete cosine transform is adopted by taking advantage of the information in adjacent pixels. An experiment is carried out with a Michelson-type interferometer to study the out-of-plane deformation field. High quality whole-field phase distribution maps with different fringe densities are obtained. Under the experimental conditions, the maximum number of fringes resolvable in a 416×416 frame is 30, which indicates a 15λ deformation along the direction of loading.

Numerical computation of the discrete Fourier transform and its applications in the statistic processing of experimental data

International Nuclear Information System (INIS)

Marinescu, D.C.; Radulescu, T.G.

1977-06-01

The Integral Fourier Transform has a large range of applications in such areas as communication theory, circuit theory, physics, etc. In order to perform discrete Fourier Transform the Finite Fourier Transform is defined; it operates upon N samples of a uniformely sampled continuous function. All the properties known in the continuous case can be found in the discrete case also. The first part of the paper presents the relationship between the Finite Fourier Transform and the Integral one. The computing of a Finite Fourier Transform is a problem in itself since in order to transform a set of N data we have to perform N 2 ''operations'' if the transformation relations are used directly. An algorithm known as the Fast Fourier Transform (FFT) reduces this figure from N 2 to a more reasonable Nlog 2 N, when N is a power of two. The original Cooley and Tuckey algorithm for FFT can be further improved when higher basis are used. The price to be paid in this case is the increase in complexity of such algorithms. The recurrence relations and a comparation among such algorithms are presented. The key point in understanding the application of FFT resides in the convolution theorem which states that the convolution (an N 2 type procedure) of the primitive functions is equivalent to the ordinar multiplication of their transforms. Since filtering is actually a convolution process we present several procedures to perform digital filtering by means of FFT. The best is the one using the segmentation of records and the transformation of pairs of records. In the digital processing of signals, besides digital filtering a special attention is paid to the estimation of various statistical characteristics of a signal as: autocorrelation and correlation functions, periodiograms, density power sepctrum, etc. We give several algorithms for the consistent and unbiased estimation of such functions, by means of FFT. (author)

Spectro-Temporal Analysis of Speech for Spanish Phoneme Recognition

DEFF Research Database (Denmark)

Sharifzadeh, Sara; Serrano, Javier; Carrabina, Jordi

2012-01-01

are considered. This has improved the recognition performance especially in case of noisy situation and phonemes with time domain modulations such as stops. In this method, the 2D Discrete Cosine Transform (DCT) is applied on small overlapped 2D Hamming windowed patches of spectrogram of Spanish phonemes...

Traveling Wave Solutions of ZK-BBM Equation Sine-Cosine Method

Directory of Open Access Journals (Sweden)

Sadaf Bibi

2014-03-01

Full Text Available Travelling wave solutions are obtained by using a relatively new technique which is called sine-cosine method for ZK-BBM equations. Solution procedure and obtained results re-confirm the efficiency of the proposed scheme.

Long memory analysis by using maximal overlapping discrete wavelet transform

Science.gov (United States)

Shafie, Nur Amalina binti; Ismail, Mohd Tahir; Isa, Zaidi

2015-05-01

Long memory process is the asymptotic decay of the autocorrelation or spectral density around zero. The main objective of this paper is to do a long memory analysis by using the Maximal Overlapping Discrete Wavelet Transform (MODWT) based on wavelet variance. In doing so, stock market of Malaysia, China, Singapore, Japan and United States of America are used. The risk of long term and short term investment are also being looked into. MODWT can be analyzed with time domain and frequency domain simultaneously and decomposing wavelet variance to different scales without loss any information. All countries under studied show that they have long memory. Subprime mortgage crisis in 2007 is occurred in the United States of America are possible affect to the major trading countries. Short term investment is more risky than long term investment.

The Law of Cosines for an "n"-Dimensional Simplex

Science.gov (United States)

Ding, Yiren

2008-01-01

Using the divergence theorem technique of L. Eifler and N.H. Rhee, "The n-dimensional Pythagorean Theorem via the Divergence Theorem" (to appear: Amer. Math. Monthly), we extend the law of cosines for a triangle in a plane to an "n"-dimensional simplex in an "n"-dimensional space.

Closing Gaps in Geometrically Frustrated Symmetric Clusters: Local Equivalence between Discrete Curvature and Twist Transformations

Directory of Open Access Journals (Sweden)

Fang Fang

2018-05-01

Full Text Available In geometrically frustrated clusters of polyhedra, gaps between faces can be closed without distorting the polyhedra by the long established method of discrete curvature, which consists of curving the space into a fourth dimension, resulting in a dihedral angle at the joint between polyhedra in 4D. An alternative method—the twist method—has been recently suggested for a particular case, whereby the gaps are closed by twisting the cluster in 3D, resulting in an angular offset of the faces at the joint between adjacent polyhedral. In this paper, we show the general applicability of the twist method, for local clusters, and present the surprising result that both the required angle of the twist transformation and the consequent angle at the joint are the same, respectively, as the angle of bending to 4D in the discrete curvature and its resulting dihedral angle. The twist is therefore not only isomorphic, but isogonic (in terms of the rotation angles to discrete curvature. Our results apply to local clusters, but in the discussion we offer some justification for the conjecture that the isomorphism between twist and discrete curvature can be extended globally. Furthermore, we present examples for tetrahedral clusters with three-, four-, and fivefold symmetry.

SECURE VISUAL SECRET SHARING BASED ON DISCRETE WAVELET TRANSFORM

Directory of Open Access Journals (Sweden)

S. Jyothi Lekshmi

2015-08-01

Full Text Available Visual Cryptography Scheme (VCS is an encryption method to encode secret written materials. This method converts the secret written material into an image. Then encode this secret image into n shadow images called shares. For the recreation of the original secret, all or some selected subsets of shares are needed; individual shares are of no use on their own. The secret image can be recovered simply by selecting some subset of these n shares, makes transparencies of them and stacking on top of each other. Nowadays, the data security has an important role. The shares can be altered by an attacker. So providing security to the shares is important. This paper proposes a method of adding security to cryptographic shares. This method uses two dimensional discrete wavelet transform to hide visual secret shares. Then the hidden secrets are distributed among participants through the internet. All hidden shares are extracted to reconstruct the secret.

DCT-Based Characterization of Milk Products Using Diffuse Reflectance Images

DEFF Research Database (Denmark)

Sharifzadeh, Sara; Skytte, Jacob Lercke; Clemmensen, Line Katrine Harder

2013-01-01

We propose to use the two-dimensional Discrete Cosine Transform (DCT) for decomposition of diffuse reflectance images of laser illumination on milk products in different wavelengths. Based on the prior knowledge about the characteristics of the images, the initial feature vectors are formed at ea...... discriminate milk from yogurt products better....

Comparison of Methods for Sparse Representation of Musical Signals

DEFF Research Database (Denmark)

Endelt, Line Ørtoft; la Cour-Harbo, Anders

2005-01-01

by a number of sparseness measures and results are shown on the ℓ1 norm of the coefficients, using a dictionary containing a Dirac basis, a Discrete Cosine Transform, and a Wavelet Packet. Evaluated only on the sparseness Matching Pursuit is the best method, and it is also relatively fast....

Post-processing of EPR spectrum from dosimetric substances through filtering of Discrete Fourier Transform

International Nuclear Information System (INIS)

Vieira, Fabio P.B.; Bevilacqua, Joyce S.

2014-01-01

The use of electron paramagnetic resonance spectrometers - EPR - in radiation dosimetry is known for more than four decades. It is an important tool in the retrospective determination of doses absorbed. To estimate the dose absorbed by the sample, it is necessary to know the amplitude of the peak to peak signature of the substance in its EPR spectrum. This information can be compromised by the presence of spurious information: noise - of random and low intensity nature; and the behavior of the baseline - coming from the coupling between the resonator tube and the sample analyzed. Due to the intrinsic characteristics of the three main components of the signal, i.e. signature, noise, and baseline - the analysis in the frequency domain allows, through post-processing techniques to filter spurious information. In this work, an algorithm that retrieves the signature of a substance has been implemented. The Discrete Fourier Transform is applied to the signal and without user intervention, the noise is filtered. From the filtered signal, recovers the signature by Inverse Discrete Fourier Transform. The peak to peak amplitude, and the absorbed dose is calculated with an error of less than 1% for signals wherein the base line is linearized. Some more general cases are under investigation and with little user intervention, you can get the same error

An efficient algorithm for MR image reconstruction and compression

International Nuclear Information System (INIS)

Wang, Hang; Rosenfeld, D.; Braun, M.; Yan, Hong

1992-01-01

In magnetic resonance imaging (MRI), the original data are sampled in the spatial frequency domain. The sampled data thus constitute a set of discrete Fourier transform (DFT) coefficients. The image is usually reconstructed by taking inverse DFT. The image data may then be efficiently compressed using the discrete cosine transform (DCT). A method of using DCT to treat the sampled data is presented which combines two procedures, image reconstruction and data compression. This method may be particularly useful in medical picture archiving and communication systems where both image reconstruction and compression are important issues. 11 refs., 3 figs

Cosine bend-linear waveguide digital optical switch with parabolic heater

Science.gov (United States)

Yulianti, Ian; Supa'at, Abu Sahmah Mohd.; Idrus, Sevia M.; Al-hetar, Abdulaziz M.

2010-02-01

A new digital optical switch (DOS) with large branching angle and short device length that exhibits low crosstalk and low power consumption is demonstrated. The Y-branch shape was optimized by introducing constant effective refractive index difference between branches (Δ N eff) along the propagation direction through beam propagation method (BPM) scheme. To provide decreasing local branching angle that results in the improvement of the crosstalk, two modified cosine bend was introduced to form the Y-branch. The modified cosine branch was then connected to a linear branch. The heater electrode was optimized so that the temperature fields induce a constant Δ N eff to satisfy initial assumption in designing the Y-branch shape. With branching angle of 0.299° and device length of only 5 mm, the simulation shows that the device could exhibits crosstalk of -33 dB at calculated required power of only 26 mW.

Explicit solutions to the semi-discrete modified KdV equation and motion of discrete plane curves

International Nuclear Information System (INIS)

Inoguchi, Jun-ichi; Kajiwara, Kenji; Matsuura, Nozomu; Ohta, Yasuhiro

2012-01-01

We construct explicit solutions to continuous motion of discrete plane curves described by a semi-discrete potential modified KdV equation. Explicit formulas in terms of the τ function are presented. Bäcklund transformations of the discrete curves are also discussed. We finally consider the continuous limit of discrete motion of discrete plane curves described by the discrete potential modified KdV equation to motion of smooth plane curves characterized by the potential modified KdV equation. (paper)

An optimized cosine-modulated nonuniform filter bank design for subband coding of ECG signal

Directory of Open Access Journals (Sweden)

A. Kumar

2015-07-01

Full Text Available A simple iterative technique for the design of nonuniform cosine modulated filter banks (CMFBS is presented in this paper. The proposed technique employs a single parameter for optimization. The nonuniform cosine modulated filter banks are derived by merging the adjacent filters of uniform cosine modulated filter banks. The prototype filter is designed with the aid of different adjustable window functions such as Kaiser, Cosh and Exponential, and by using the constrained equiripple finite impulse response (FIR digital filter design technique. In this method, either cut off frequency or passband edge frequency is varied in order to adjust the filter coefficients so that reconstruction error could be optimized/minimized to zero. Performance and effectiveness of the proposed method in terms of peak reconstruction error (PRE, aliasing distortion (AD, computational (CPU time, and number of iteration (NOI have been shown through the numerical examples and comparative studies. Finally, the technique is exploited for the subband coding of electrocardiogram (ECG and speech signals.

A new stationary gridline artifact suppression method based on the 2D discrete wavelet transform

International Nuclear Information System (INIS)

Tang, Hui; Tong, Dan; Dong Bao, Xu; Dillenseger, Jean-Louis

2015-01-01

Purpose: In digital x-ray radiography, an antiscatter grid is inserted between the patient and the image receptor to reduce scattered radiation. If the antiscatter grid is used in a stationary way, gridline artifacts will appear in the final image. In most of the gridline removal image processing methods, the useful information with spatial frequencies close to that of the gridline is usually lost or degraded. In this study, a new stationary gridline suppression method is designed to preserve more of the useful information. Methods: The method is as follows. The input image is first recursively decomposed into several smaller subimages using a multiscale 2D discrete wavelet transform. The decomposition process stops when the gridline signal is found to be greater than a threshold in one or several of these subimages using a gridline detection module. An automatic Gaussian band-stop filter is then applied to the detected subimages to remove the gridline signal. Finally, the restored image is achieved using the corresponding 2D inverse discrete wavelet transform. Results: The processed images show that the proposed method can remove the gridline signal efficiently while maintaining the image details. The spectra of a 1D Fourier transform of the processed images demonstrate that, compared with some existing gridline removal methods, the proposed method has better information preservation after the removal of the gridline artifacts. Additionally, the performance speed is relatively high. Conclusions: The experimental results demonstrate the efficiency of the proposed method. Compared with some existing gridline removal methods, the proposed method can preserve more information within an acceptable execution time

A new stationary gridline artifact suppression method based on the 2D discrete wavelet transform

Energy Technology Data Exchange (ETDEWEB)

Tang, Hui, E-mail: corinna@seu.edu.cn [Laboratory of Image Science and Technology, School of Computer Science and Engineering, Southeast University, Nanjing 210096 (China); Key Laboratory of Computer Network and Information Integration (Southeast University), Ministry of Education, Nanjing 210000 (China); Centre de Recherche en Information Biomédicale sino-français, Laboratoire International Associé, Inserm, Université de Rennes 1, Rennes 35000 (France); Southeast University, Nanjing 210000 (China); Tong, Dan; Dong Bao, Xu [Laboratory of Image Science and Technology, School of Computer Science and Engineering, Southeast University, Nanjing 210096 (China); Dillenseger, Jean-Louis [INSERM, U1099, Rennes F-35000 (France); Université de Rennes 1, LTSI, Rennes F-35000 (France); Centre de Recherche en Information Biomédicale sino-français, Laboratoire International Associé, Inserm, Université de Rennes 1, Rennes 35000 (France); Southeast University, Nanjing 210000 (China)

2015-04-15

Purpose: In digital x-ray radiography, an antiscatter grid is inserted between the patient and the image receptor to reduce scattered radiation. If the antiscatter grid is used in a stationary way, gridline artifacts will appear in the final image. In most of the gridline removal image processing methods, the useful information with spatial frequencies close to that of the gridline is usually lost or degraded. In this study, a new stationary gridline suppression method is designed to preserve more of the useful information. Methods: The method is as follows. The input image is first recursively decomposed into several smaller subimages using a multiscale 2D discrete wavelet transform. The decomposition process stops when the gridline signal is found to be greater than a threshold in one or several of these subimages using a gridline detection module. An automatic Gaussian band-stop filter is then applied to the detected subimages to remove the gridline signal. Finally, the restored image is achieved using the corresponding 2D inverse discrete wavelet transform. Results: The processed images show that the proposed method can remove the gridline signal efficiently while maintaining the image details. The spectra of a 1D Fourier transform of the processed images demonstrate that, compared with some existing gridline removal methods, the proposed method has better information preservation after the removal of the gridline artifacts. Additionally, the performance speed is relatively high. Conclusions: The experimental results demonstrate the efficiency of the proposed method. Compared with some existing gridline removal methods, the proposed method can preserve more information within an acceptable execution time.

Analysis of Real Ship Rolling Dynamics under Wave Excitement Force Composed of Sums of Cosine Functions

International Nuclear Information System (INIS)

Zhang, Y. S.; Cai, F.; Xu, W. M.

2011-01-01

The ship motion equation with a cosine wave excitement force describes the slip moments in regular waves. A new kind of wave excitement force model, with the form as sums of cosine functions was proposed to describe ship rolling in irregular waves. Ship rolling time series were obtained by solving the ship motion equation with the fourth-order-Runger-Kutta method. These rolling time series were synthetically analyzed with methods of phase-space track, power spectrum, primary component analysis, and the largest Lyapunove exponent. Simulation results show that ship rolling presents some chaotic characteristic when the wave excitement force was applied by sums of cosine functions. The result well explains the course of ship rolling's chaotic mechanism and is useful for ship hydrodynamic study.

Research on V and V strategy of reactor physics code of COSINE

International Nuclear Information System (INIS)

Liu Zhanquan; Chen Yixue; Yang Chao; Dang Halei

2013-01-01

Verification and validation (V and V) is very important for the software quality assurance. Reasonable and efficient V and V strategy can achieve twice the result with half the effort. Core and system integrated engine for design and analysis (COSINE) software package contains three reactor physics codes, the lattice code (LATC), the core simulator (CORE) and the kinetics code (KIND), which is called the reactor physics subsystem. The V and V strategy for the physics subsystem was researched based on the foundation of scientific software's V and V method. The module based verification method and the function based validation method were proposed, composing the physical subsystem V and V strategy of COSINE software package. (authors)

Application of the numerical Laplace transform inversion to neutron transport theory

International Nuclear Information System (INIS)

Ganapol, B.D.

1989-01-01

A numerical Laplace transform inversion is developed using the Hurwitz-Zweifel method of evaluating the Fourier cosine integral coupled with an Euler-Knopp transformation. The numerical inversion is then applied to problems in linear transport theory concerning slowing down, time-dependence and featuring the determination of the interior scalar flux solution to the one-group stationary transport equation in half-space geometry

On organizing principles of discrete differential geometry. Geometry of spheres

International Nuclear Information System (INIS)

Bobenko, Alexander I; Suris, Yury B

2007-01-01

Discrete differential geometry aims to develop discrete equivalents of the geometric notions and methods of classical differential geometry. This survey contains a discussion of the following two fundamental discretization principles: the transformation group principle (smooth geometric objects and their discretizations are invariant with respect to the same transformation group) and the consistency principle (discretizations of smooth parametrized geometries can be extended to multidimensional consistent nets). The main concrete geometric problem treated here is discretization of curvature-line parametrized surfaces in Lie geometry. Systematic use of the discretization principles leads to a discretization of curvature-line parametrization which unifies circular and conical nets.

Sines and Cosines. Part 2 of 3

Science.gov (United States)

Apostol, Tom M. (Editor)

1993-01-01

The Law of Sines and the Law of Cosines are introduced and demonstrated in this 'Project Mathematics' series video using both film footage and computer animation. This video deals primarily with the mathematical field of Trigonometry and explains how these laws were developed and their applications. One significant use is geographical and geological surveying. This includes both the triangulation method and the spirit leveling method. With these methods, it is shown how the height of the tallest mountain in the world, Mt. Everest, was determined.

Sines and Cosines. Part 3 of 3

Science.gov (United States)

Apostol, Tom M. (Editor)

1994-01-01

In this 'Project Mathematics' series video, the addition formulas of sines and cosines are explained and their real life applications are demonstrated. Both film footage and computer animation is used. Several mathematical concepts are discussed and include: Ptolemy's theorem concerned with quadrilaterals; the difference between a central angle and an inscribed angle; sines and chord lengths; special angles; subtraction formulas; and a application to simple harmonic motion. A brief history of the city Alexandria, its mathematicians, and their contribution to the field of mathematics is shown.

Signals and systems laboratory with Matlab

CERN Document Server

Palamides, Alex

2010-01-01

Introduction to MATLAB®Working EnvironmentGetting StartedMemory ManagementVectorsMatricesPlotting with MATLABComplex NumbersM-FilesInput-Output CommandsFile ManagementLogical-Relational OperatorsControl FlowSymbolic VariablesPolynomials(Pseudo)Random NumbersSignalsCategorization by the Variable TypeBasic Continuous-Time SignalsDiscrete-Time SignalsProperties of SignalsTransformations of the Time Variable for Continuous-Time SignalsTransformations of the Time Variable for Discrete-Time SignalsSystemsSystems ClassificationProperties of SystemsTime Domain System AnalysisImpulse ResponseContinuous Time Convolution Convolution PropertiesInterconnections of SystemsStabilityDiscrete-Time ConvolutionSystems Described by Difference EquationsFiltersStability Criterion for Discrete-Time SystemsSystems Described by Differential EquationsStep Response of a SystemFourier SeriesOrthogonality of Complex Exponential SignalsComplex Exponential Fourier SeriesTrigonometric Fourier SeriesFourier Series in the Cosine with Phase F...

A Laplace transform method for energy multigroup hybrid discrete ordinates

International Nuclear Information System (INIS)

Segatto, C.F.; Vilhena, M.T.; Barros, R.C.

2010-01-01

In typical lattice cells where a highly absorbing, small fuel element is embedded in the moderator, a large weakly absorbing medium, high-order transport methods become unnecessary. In this work we describe a hybrid discrete ordinates (S N) method for energy multigroup slab lattice calculations. This hybrid S N method combines the convenience of a low-order S N method in the moderator with a high-order S N method in the fuel. The idea is based on the fact that in weakly absorbing media whose physical size is several neutron mean free paths in extent, even the S 2 method (P 1 approximation), leads to an accurate result. We use special fuel-moderator interface conditions and the Laplace transform (LTS N ) analytical numerical method to calculate the two-energy group neutron flux distributions and the thermal disadvantage factor. We present numerical results for a range of typical model problems.

Secure Image Steganography Algorithm Based on DCT with OTP Encryption

Directory of Open Access Journals (Sweden)

De Rosal Ignatius Moses Setiadi

2017-04-01

Full Text Available Rapid development of Internet makes transactions message even easier and faster. The main problem in the transactions message is security, especially if the message is private and secret. To secure these messages is usually done with steganography or cryptography. Steganography is a way to hide messages into other digital content such as images, video or audio so it does not seem nondescript from the outside. While cryptography is a technique to encrypt messages so that messages can not be read directly. In this paper have proposed combination of steganography using discrete cosine transform (DCT and cryptography using the one-time pad or vernam cipher implemented on a digital image. The measurement method used to determine the quality of stego image is the peak signal to noise ratio (PSNR and ormalize cross Correlation (NCC to measure the quality of the extraction of the decrypted message. Of steganography and encryption methods proposed obtained satisfactory results with PSNR and NCC high and resistant to JPEG compression and median filter. Keywords—Image Steganography, Discrete Cosine Transform (DCT, One Time Pad, Vernam, Chiper, Image Cryptography

An analogue of a theorem of Titchmarsh for Walsh-Fourier transformations

International Nuclear Information System (INIS)

Golubov, B I

1998-01-01

Let f-hat c be the Fourier cosine transform of f. Then, as proved for functions of class L p (R + ) in Titchmarsh's book 'Introduction to the theory of Fourier integrals' (1937), the Hardy operator and the Hardy-Littlewood operator can be defined. In the present paper similar equalities are proved for functions of class L p (R + ), 1< p≤2, and the Walsh-Fourier transformation

Expandable image compression system: A modular approach

International Nuclear Information System (INIS)

Ho, B.K.T.; Lo, S.C.; Huang, H.K.

1986-01-01

The full-frame bit-allocation algorithm for radiological image compression can achieve an acceptable compression ratio as high as 30:1. It involves two stages of operation: a two-dimensional discrete cosine transform and pixel quantization in the transformed space with pixel depth kept accountable by a bit-allocation table. The cosine transform hardware design took an expandable modular approach based on the VME bus system with a maximum data transfer rate of 48 Mbytes/sec and a microprocessor (Motorola 68000 family). The modules are cascadable and microprogrammable to perform 1,024-point butterfly operations. A total of 18 stages would be required for transforming a 1,000 x 1,000 image. Multiplicative constants and addressing sequences are to be software loaded into the parameter buffers of each stage prior to streaming data through the processor stages. The compression rate for 1K x 1K images is expected to be faster than one image per sec

Peringkasan Sentimen Esktraktif di Twitter Menggunakan Hybrid TF-IDF dan Cosine Similarity

Directory of Open Access Journals (Sweden)

Devid Haryalesmana Wahid

2016-07-01

Full Text Available The using of Twitter by selebrities has become a new trend of impression management strategy. Mining public reaction in social media is a good strategy to obtain feedbacks, but extracting it are not trivial matter. Reads hundred of tweets while determine their sentiment polarity are time consuming. Extractive sentiment summarization machine are needed to address this issue. Previous research generally do not include sentiment information contained in a tweet as weight factor, as a results only general topics of discussion are extracted. This research aimed to do an extractive sentiment summarization on both positive and negative sentiment mentioning Indonesian selebrity, Agnes Monica, by combining SentiStrength, Hybrid TF-IDF, and Cosine Similarity. SentiStrength is used to obtain sentiment strength score and classify tweet as a positive, negative or neutral. The summarization of posisitve and negative sentiment can be done by rank tweets using Hybrid TF-IDF summarization and sentiment strength score as additional weight then removing similar tweet by using Cosine Similarity. The test results showed that the combination of SentiStrength, Hybrid TF-IDF, and Cosine Similarity perform better than using Hybrid TF-IDF only, given an average 60% accuracy and 62% f-measure. This is due to the addition of sentiment score as a weight factor in sentiment summ­ari­zation.

Discrete symmetries for spinor field in de Sitter space

International Nuclear Information System (INIS)

Moradi, S.; Rouhani, S.; Takook, M.V.

2005-01-01

Discrete symmetries, parity, time reversal, antipodal, and charge conjugation transformations for spinor field in de Sitter space, are presented in the ambient space notation, i.e., in a coordinate independent way. The PT and PCT transformations are also discussed in this notation. The five-current density is studied and their transformation under the discrete symmetries is discussed

Damage Detection on Sudden Stiffness Reduction Based on Discrete Wavelet Transform

Directory of Open Access Journals (Sweden)

Bo Chen

2014-01-01

Full Text Available The sudden stiffness reduction in a structure may cause the signal discontinuity in the acceleration responses close to the damage location at the damage time instant. To this end, the damage detection on sudden stiffness reduction of building structures has been actively investigated in this study. The signal discontinuity of the structural acceleration responses of an example building is extracted based on the discrete wavelet transform. It is proved that the variation of the first level detail coefficients of the wavelet transform at damage instant is linearly proportional to the magnitude of the stiffness reduction. A new damage index is proposed and implemented to detect the damage time instant, location, and severity of a structure due to a sudden change of structural stiffness. Numerical simulation using a five-story shear building under different types of excitation is carried out to assess the effectiveness and reliability of the proposed damage index for the building at different damage levels. The sensitivity of the damage index to the intensity and frequency range of measurement noise is also investigated. The made observations demonstrate that the proposed damage index can accurately identify the sudden damage events if the noise intensity is limited.

Detection of short-term anomaly using parasitic discrete wavelet transform

International Nuclear Information System (INIS)

Nagamatsu, Takashi; Gofuku, Akio

2013-01-01

A parasitic discrete wavelet transform (P-DWT) that has a large flexibility in design of the mother wavelet (MW) and a high processing speed was applied for simulation and measured anomalies. First, we applied the P-DWT to detection of the short-term anomalies. Second, we applied the P-DWT to detection of the collision of pump using the pump diagnostic experiment equipment that was designed taking into consideration the structure of the pump used for the water-steam system of the fast breeder reactor 'Monju'. The vibration signals were measured by the vibration sensor attached to the pump when injecting four types of small objects (sphere, small sphere, cube, and rectangular parallelepiped). Anomaly detection was performed by calculating the fast wavelet instantaneous correlation using the parasitic filter that was constructed on the basis of the measured signals. The results suggested that the anomalies could be detected for all types of the supposed anomalies. (author)

A Transform-Based Feature Extraction Approach for Motor Imagery Tasks Classification

Science.gov (United States)

Khorshidtalab, Aida; Mesbah, Mostefa; Salami, Momoh J. E.

2015-01-01

In this paper, we present a new motor imagery classification method in the context of electroencephalography (EEG)-based brain–computer interface (BCI). This method uses a signal-dependent orthogonal transform, referred to as linear prediction singular value decomposition (LP-SVD), for feature extraction. The transform defines the mapping as the left singular vectors of the LP coefficient filter impulse response matrix. Using a logistic tree-based model classifier; the extracted features are classified into one of four motor imagery movements. The proposed approach was first benchmarked against two related state-of-the-art feature extraction approaches, namely, discrete cosine transform (DCT) and adaptive autoregressive (AAR)-based methods. By achieving an accuracy of 67.35%, the LP-SVD approach outperformed the other approaches by large margins (25% compared with DCT and 6 % compared with AAR-based methods). To further improve the discriminatory capability of the extracted features and reduce the computational complexity, we enlarged the extracted feature subset by incorporating two extra features, namely, Q- and the Hotelling’s \\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{upgreek} \\usepackage{mathrsfs} \\setlength{\\oddsidemargin}{-69pt} \\begin{document} }{}$T^{2}$ \\end{document} statistics of the transformed EEG and introduced a new EEG channel selection method. The performance of the EEG classification based on the expanded feature set and channel selection method was compared with that of a number of the state-of-the-art classification methods previously reported with the BCI IIIa competition data set. Our method came second with an average accuracy of 81.38%. PMID:27170898

Feature Extraction on Brain Computer Interfaces using Discrete Dyadic Wavelet Transform: Preliminary Results

International Nuclear Information System (INIS)

Gareis, I; Gentiletti, G; Acevedo, R; Rufiner, L

2011-01-01

The purpose of this work is to evaluate different feature extraction alternatives to detect the event related evoked potential signal on brain computer interfaces, trying to minimize the time employed and the classification error, in terms of sensibility and specificity of the method, looking for alternatives to coherent averaging. In this context the results obtained performing the feature extraction using discrete dyadic wavelet transform using different mother wavelets are presented. For the classification a single layer perceptron was used. The results obtained with and without the wavelet decomposition were compared; showing an improvement on the classification rate, the specificity and the sensibility for the feature vectors obtained using some mother wavelets.

Fusion of multispectral and panchromatic images using multirate filter banks

Institute of Scientific and Technical Information of China (English)

Wang Hong; Jing Zhongliang; Li Jianxun

2005-01-01

In this paper, an image fusion method based on the filter banks is proposed for merging a high-resolution panchromatic image and a low-resolution multispectral image. Firstly, the filter banks are designed to merge different signals with minimum distortion by using cosine modulation. Then, the filter banks-based image fusion is adopted to obtain a high-resolution multispectral image that combines the spectral characteristic of low-resolution data with the spatial resolution of the panchromatic image. Finally, two different experiments and corresponding performance analysis are presented. Experimental results indicate that the proposed approach outperforms the HIS transform, discrete wavelet transform and discrete wavelet frame.

A method for optimizing the cosine response of solar UV diffusers

Science.gov (United States)

Pulli, Tomi; Kärhä, Petri; Ikonen, Erkki

2013-07-01

Instruments measuring global solar ultraviolet (UV) irradiance at the surface of the Earth need to collect radiation from the entire hemisphere. Entrance optics with angular response as close as possible to the ideal cosine response are necessary to perform these measurements accurately. Typically, the cosine response is obtained using a transmitting diffuser. We have developed an efficient method based on a Monte Carlo algorithm to simulate radiation transport in the solar UV diffuser assembly. The algorithm takes into account propagation, absorption, and scattering of the radiation inside the diffuser material. The effects of the inner sidewalls of the diffuser housing, the shadow ring, and the protective weather dome are also accounted for. The software implementation of the algorithm is highly optimized: a simulation of 109 photons takes approximately 10 to 15 min to complete on a typical high-end PC. The results of the simulations agree well with the measured angular responses, indicating that the algorithm can be used to guide the diffuser design process. Cost savings can be obtained when simulations are carried out before diffuser fabrication as compared to a purely trial-and-error-based diffuser optimization. The algorithm was used to optimize two types of detectors, one with a planar diffuser and the other with a spherically shaped diffuser. The integrated cosine errors—which indicate the relative measurement error caused by the nonideal angular response under isotropic sky radiance—of these two detectors were calculated to be f2=1.4% and 0.66%, respectively.

Some Notes on the Use of theWindowed Fourier Transform for Spectral Analysis of Discretely Sampled Data

Directory of Open Access Journals (Sweden)

Robert W. Johnson

2013-06-01

Full Text Available The properties of the Gabor and Morlet transforms are examined with respect to the Fourier analysis of discretely sampled data. Forward and inverse transform pairs based on a fixed window with uniform sampling of the frequency axis can satisfy numerically the energy and reconstruction theorems; however, transform pairs based on a variable window or nonuniform frequency sampling in general do not. Instead of selecting the shape of the window as some function of the central frequency, we propose constructing a single window with unit energy from an arbitrary set of windows that is applied over the entire frequency axis. By virtue of using a fixed window with uniform frequency sampling, such a transform satisfies the energy and reconstruction theorems. The shape of the window can be tailored to meet the requirements of the investigator in terms of time/frequency resolution. The algorithm extends naturally to the case of nonuniform signal sampling without modification beyond identification of the Nyquist interval.

Chaotic properties between the nonintegrable discrete nonlinear Schroedinger equation and a nonintegrable discrete Heisenberg model

International Nuclear Information System (INIS)

Ding Qing

2007-01-01

We prove that the integrable-nonintegrable discrete nonlinear Schroedinger equation (AL-DNLS) introduced by Cai, Bishop and Gronbech-Jensen (Phys. Rev. Lett. 72 591(1994)) is the discrete gauge equivalent to an integrable-nonintegrable discrete Heisenberg model from the geometric point of view. Then we study whether the transmission and bifurcation properties of the AL-DNLS equation are preserved under the action of discrete gauge transformations. Our results reveal that the transmission property of the AL-DNLS equation is completely preserved and the bifurcation property is conditionally preserved to those of the integrable-nonintegrable discrete Heisenberg model

Cosine problem in EPRL/FK spinfoam model

Science.gov (United States)

Vojinović, Marko

2014-01-01

We calculate the classical limit effective action of the EPRL/FK spinfoam model of quantum gravity coupled to matter fields. By employing the standard QFT background field method adapted to the spinfoam setting, we find that the model has many different classical effective actions. Most notably, these include the ordinary Einstein-Hilbert action coupled to matter, but also an action which describes antigravity. All those multiple classical limits appear as a consequence of the fact that the EPRL/FK vertex amplitude has cosine-like large spin asymptotics. We discuss some possible ways to eliminate the unwanted classical limits.

An integrable semi-discretization of the Boussinesq equation

International Nuclear Information System (INIS)

Zhang, Yingnan; Tian, Lixin

2016-01-01

Highlights: • A new integrable semi-discretization of the Boussinesq equation is present. • A Bäcklund transformation and a Lax pair for the differential-difference system is derived by using Hirota's bilinear method. • The soliton solutions of 'good' Boussinesq equation and numerical algorithms are investigated. - Abstract: In this paper, we present an integrable semi-discretization of the Boussinesq equation. Different from other discrete analogues, we discretize the ‘time’ variable and get an integrable differential-difference system. Under a standard limitation, the differential-difference system converges to the continuous Boussinesq equation such that the discrete system can be used to design numerical algorithms. Using Hirota's bilinear method, we find a Bäcklund transformation and a Lax pair of the differential-difference system. For the case of ‘good’ Boussinesq equation, we investigate the soliton solutions of its discrete analogue and design numerical algorithms. We find an effective way to reduce the phase shift caused by the discretization. The numerical results coincide with our analysis.

Sparse dictionary for synthetic transmit aperture medical ultrasound imaging.

Science.gov (United States)

Wang, Ping; Jiang, Jin-Yang; Li, Na; Luo, Han-Wu; Li, Fang; Cui, Shi-Gang

2017-07-01

It is possible to recover a signal below the Nyquist sampling limit using a compressive sensing technique in ultrasound imaging. However, the reconstruction enabled by common sparse transform approaches does not achieve satisfactory results. Considering the ultrasound echo signal's features of attenuation, repetition, and superposition, a sparse dictionary with the emission pulse signal is proposed. Sparse coefficients in the proposed dictionary have high sparsity. Images reconstructed with this dictionary were compared with those obtained with the three other common transforms, namely, discrete Fourier transform, discrete cosine transform, and discrete wavelet transform. The performance of the proposed dictionary was analyzed via a simulation and experimental data. The mean absolute error (MAE) was used to quantify the quality of the reconstructions. Experimental results indicate that the MAE associated with the proposed dictionary was always the smallest, the reconstruction time required was the shortest, and the lateral resolution and contrast of the reconstructed images were also the closest to the original images. The proposed sparse dictionary performed better than the other three sparse transforms. With the same sampling rate, the proposed dictionary achieved excellent reconstruction quality.

Difference Discrete Variational Principles, Euler-Lagrange Cohomology and Symplectic, Multisymplectic Structures I: Difference Discrete Variational Principle

Institute of Scientific and Technical Information of China (English)

GUO Han-Ying,; LI Yu-Qi; WU Ke1; WANG Shi-Kun

2002-01-01

In this first paper of a series, we study the difference discrete variational principle in the framework of multi-parameter differential approach by regarding the forward difference as an entire geometric object in view of noncommutative differential geometry. Regarding the difference as an entire geometric object, the difference discrete version of Legendre transformation can be introduced. By virtue of this variational principle, we can discretely deal with the variation problems in both the Lagrangian and Hamiltonian formalisms to get difference discrete Euler-Lagrange equations and canonical ones for the difference discrete versions of the classical mechanics and classical field theory.

Fast Fourier and discrete wavelet transforms applied to sensorless vector control induction motor for rotor bar faults diagnosis.

Science.gov (United States)

Talhaoui, Hicham; Menacer, Arezki; Kessal, Abdelhalim; Kechida, Ridha

2014-09-01

This paper presents new techniques to evaluate faults in case of broken rotor bars of induction motors. Procedures are applied with closed-loop control. Electrical and mechanical variables are treated using fast Fourier transform (FFT), and discrete wavelet transform (DWT) at start-up and steady state. The wavelet transform has proven to be an excellent mathematical tool for the detection of the faults particularly broken rotor bars type. As a performance, DWT can provide a local representation of the non-stationary current signals for the healthy machine and with fault. For sensorless control, a Luenberger observer is applied; the estimation rotor speed is analyzed; the effect of the faults in the speed pulsation is compensated; a quadratic current appears and used for fault detection. Copyright © 2014 ISA. Published by Elsevier Ltd. All rights reserved.

AXIFLUX, Cosine Function Fit of Experimental Axial Flux in Cylindrical Reactor

International Nuclear Information System (INIS)

Holte, O.

1980-01-01

1 - Nature of physical problem solved: Calculates the parameters of the cosine function that will best fit data from axial flux distribution measurements in a cylindrical reactor. 2 - Method of solution: Steepest descent for the minimization. 3 - Restrictions on the complexity of the problem: Number of measured points less than 200

High Precision Renormalization Group Study of the Roughening Transition

CERN Document Server

Hasenbusch, M; Pinn, K

1994-01-01

We confirm the Kosterlitz-Thouless scenario of the roughening transition for three different Solid-On-Solid models: the Discrete Gaussian model, the Absolute-Value-Solid-On-Solid model and the dual transform of the XY model with standard (cosine) action. The method is based on a matching of the renormalization group flow of the candidate models with the flow of a bona fide KT model, the exactly solvable BCSOS model. The Monte Carlo simulations are performed using efficient cluster algorithms. We obtain high precision estimates for the critical couplings and other non-universal quantities. For the XY model with cosine action our critical coupling estimate is $\\beta_R^{XY}=1.1197(5)$. For the roughening coupling of the Discrete Gaussian and the Absolute-Value-Solid-On-Solid model we find $K_R^{DG}=0.6645(6)$ and $K_R^{ASOS}=0.8061(3)$, respectively.

Discrete wavelet transform-based denoising technique for advanced state-of-charge estimator of a lithium-ion battery in electric vehicles

International Nuclear Information System (INIS)

Lee, Seongjun; Kim, Jonghoon

2015-01-01

Sophisticated data of the experimental DCV (discharging/charging voltage) of a lithium-ion battery is required for high-accuracy SOC (state-of-charge) estimation algorithms based on the state-space ECM (electrical circuit model) in BMSs (battery management systems). However, when sensing noisy DCV signals, erroneous SOC estimation (which results in low BMS performance) is inevitable. Therefore, this manuscript describes the design and implementation of a DWT (discrete wavelet transform)-based denoising technique for DCV signals. The steps for denoising a noisy DCV measurement in the proposed approach are as follows. First, using MRA (multi-resolution analysis), the noise-riding DCV signal is decomposed into different frequency sub-bands (low- and high-frequency components, A n and D n ). Specifically, signal processing of the high frequency component D n that focuses on a short-time interval is necessary to reduce noise in the DCV measurement. Second, a hard-thresholding-based denoising rule is applied to adjust the wavelet coefficients of the DWT to achieve a clear separation between the signal and the noise. Third, the desired de-noised DCV signal is reconstructed by taking the IDWT (inverse discrete wavelet transform) of the filtered detailed coefficients. Finally, this signal is sent to the ECM-based SOC estimation algorithm using an EKF (extended Kalman filter). Experimental results indicate the robustness of the proposed approach for reliable SOC estimation. - Highlights: • Sophisticated data of the experimental DCV is required for high-accuracy SOC. • DWT (discrete wavelet transform)-based denoising technique is newly investigated. • Three steps for denoising a noisy DCV measurement in this work are implemented. • Experimental results indicate the robustness of the proposed work for reliable SOC

Shift-invariant discrete wavelet transform analysis for retinal image classification.

Science.gov (United States)

Khademi, April; Krishnan, Sridhar

2007-12-01

This work involves retinal image classification and a novel analysis system was developed. From the compressed domain, the proposed scheme extracts textural features from wavelet coefficients, which describe the relative homogeneity of localized areas of the retinal images. Since the discrete wavelet transform (DWT) is shift-variant, a shift-invariant DWT was explored to ensure that a robust feature set was extracted. To combat the small database size, linear discriminant analysis classification was used with the leave one out method. 38 normal and 48 abnormal (exudates, large drusens, fine drusens, choroidal neovascularization, central vein and artery occlusion, histoplasmosis, arteriosclerotic retinopathy, hemi-central retinal vein occlusion and more) were used and a specificity of 79% and sensitivity of 85.4% were achieved (the average classification rate is 82.2%). The success of the system can be accounted to the highly robust feature set which included translation, scale and semi-rotational, features. Additionally, this technique is database independent since the features were specifically tuned to the pathologies of the human eye.

A Fast Mellin and Scale Transform

Directory of Open Access Journals (Sweden)

Davide Rocchesso

2007-01-01

Full Text Available A fast algorithm for the discrete-scale (and β-Mellin transform is proposed. It performs a discrete-time discrete-scale approximation of the continuous-time transform, with subquadratic asymptotic complexity. The algorithm is based on a well-known relation between the Mellin and Fourier transforms, and it is practical and accurate. The paper gives some theoretical background on the Mellin, β-Mellin, and scale transforms. Then the algorithm is presented and analyzed in terms of computational complexity and precision. The effects of different interpolation procedures used in the algorithm are discussed.

A Fast Mellin and Scale Transform

Directory of Open Access Journals (Sweden)

Rocchesso Davide

2007-01-01

Full Text Available A fast algorithm for the discrete-scale (and -Mellin transform is proposed. It performs a discrete-time discrete-scale approximation of the continuous-time transform, with subquadratic asymptotic complexity. The algorithm is based on a well-known relation between the Mellin and Fourier transforms, and it is practical and accurate. The paper gives some theoretical background on the Mellin, -Mellin, and scale transforms. Then the algorithm is presented and analyzed in terms of computational complexity and precision. The effects of different interpolation procedures used in the algorithm are discussed.

Robust steganographic method utilizing properties of MJPEG compression standard

Directory of Open Access Journals (Sweden)

Jakub Oravec

2015-06-01

Full Text Available This article presents design of steganographic method, which uses video container as cover data. Video track was recorded by webcam and was further encoded by compression standard MJPEG. Proposed method also takes in account effects of lossy compression. The embedding process is realized by switching places of transform coefficients, which are computed by Discrete Cosine Transform. The article contains possibilities, used techniques, advantages and drawbacks of chosen solution. The results are presented at the end of the article.

Steganographic embedding in containers-images

Science.gov (United States)

Nikishova, A. V.; Omelchenko, T. A.; Makedonskij, S. A.

2018-05-01

Steganography is one of the approaches to ensuring the protection of information transmitted over the network. But a steganographic method should vary depending on a used container. According to statistics, the most widely used containers are images and the most common image format is JPEG. Authors propose a method of data embedding into a frequency area of images in format JPEG 2000. It is proposed to use the method of Benham-Memon- Yeo-Yeung, in which instead of discrete cosine transform, discrete wavelet transform is used. Two requirements for images are formulated. Structure similarity is chosen to obtain quality assessment of data embedding. Experiments confirm that requirements satisfaction allows achieving high quality assessment of data embedding.

An integrable semi-discretization of the Boussinesq equation

Energy Technology Data Exchange (ETDEWEB)

Zhang, Yingnan, E-mail: ynzhang@njnu.edu.cn [Jiangsu Key Laboratory for NSLSCS, School of Mathematical Sciences, Nanjing Normal University, Nanjing, Jiangsu (China); Tian, Lixin, E-mail: tianlixin@njnu.edu.cn [Jiangsu Key Laboratory for NSLSCS, School of Mathematical Sciences, Nanjing Normal University, Nanjing, Jiangsu (China); Nonlinear Scientific Research Center, Jiangsu University, Zhenjiang, Jiangsu (China)

2016-10-23

Highlights: • A new integrable semi-discretization of the Boussinesq equation is present. • A Bäcklund transformation and a Lax pair for the differential-difference system is derived by using Hirota's bilinear method. • The soliton solutions of 'good' Boussinesq equation and numerical algorithms are investigated. - Abstract: In this paper, we present an integrable semi-discretization of the Boussinesq equation. Different from other discrete analogues, we discretize the ‘time’ variable and get an integrable differential-difference system. Under a standard limitation, the differential-difference system converges to the continuous Boussinesq equation such that the discrete system can be used to design numerical algorithms. Using Hirota's bilinear method, we find a Bäcklund transformation and a Lax pair of the differential-difference system. For the case of ‘good’ Boussinesq equation, we investigate the soliton solutions of its discrete analogue and design numerical algorithms. We find an effective way to reduce the phase shift caused by the discretization. The numerical results coincide with our analysis.

Energy detection based on undecimated discrete wavelet transform and its application in magnetic anomaly detection.

Directory of Open Access Journals (Sweden)

Xinhua Nie

Full Text Available Magnetic anomaly detection (MAD is a passive approach for detection of a ferromagnetic target, and its performance is often limited by external noises. In consideration of one major noise source is the fractal noise (or called 1/f noise with a power spectral density of 1/fa (0discrete wavelet transform (UDWT is proposed in this paper. Firstly, the foundations of magnetic anomaly detection and UDWT are introduced in brief, while a possible detection system based on giant magneto-impedance (GMI magnetic sensor is also given out. Then our proposed energy detection based on UDWT is described in detail, and the probabilities of false alarm and detection for given the detection threshold in theory are presented. It is noticeable that no a priori assumptions regarding the ferromagnetic target or the magnetic noise probability are necessary for our method, and different from the discrete wavelet transform (DWT, the UDWT is shift invariant. Finally, some simulations are performed and the results show that the detection performance of our proposed detector is better than that of the conventional energy detector even utilized in the Gaussian white noise, especially when the spectral parameter α is less than 1.0. In addition, a real-world experiment was done to demonstrate the advantages of the proposed method.

A new time-adaptive discrete bionic wavelet transform for enhancing speech from adverse noise environment

Science.gov (United States)

Palaniswamy, Sumithra; Duraisamy, Prakash; Alam, Mohammad Showkat; Yuan, Xiaohui

2012-04-01

Automatic speech processing systems are widely used in everyday life such as mobile communication, speech and speaker recognition, and for assisting the hearing impaired. In speech communication systems, the quality and intelligibility of speech is of utmost importance for ease and accuracy of information exchange. To obtain an intelligible speech signal and one that is more pleasant to listen, noise reduction is essential. In this paper a new Time Adaptive Discrete Bionic Wavelet Thresholding (TADBWT) scheme is proposed. The proposed technique uses Daubechies mother wavelet to achieve better enhancement of speech from additive non- stationary noises which occur in real life such as street noise and factory noise. Due to the integration of human auditory system model into the wavelet transform, bionic wavelet transform (BWT) has great potential for speech enhancement which may lead to a new path in speech processing. In the proposed technique, at first, discrete BWT is applied to noisy speech to derive TADBWT coefficients. Then the adaptive nature of the BWT is captured by introducing a time varying linear factor which updates the coefficients at each scale over time. This approach has shown better performance than the existing algorithms at lower input SNR due to modified soft level dependent thresholding on time adaptive coefficients. The objective and subjective test results confirmed the competency of the TADBWT technique. The effectiveness of the proposed technique is also evaluated for speaker recognition task under noisy environment. The recognition results show that the TADWT technique yields better performance when compared to alternate methods specifically at lower input SNR.

Total number albedo and average cosine of the polar angle of low-energy photons reflected from water

Directory of Open Access Journals (Sweden)

Marković Srpko

2007-01-01

Full Text Available The total number albedo and average cosine of the polar angle for water and initial photon energy range from 20 keV to 100 keV are presented in this pa per. A water shield in the form of a thick, homogenous plate and per pendicular incidence of the monoenergetic photon beam are assumed. The results were obtained through Monte Carlo simulations of photon reflection by means of the MCNP computer code. Calculated values for the total number albedo were compared with data previously published and good agreement was confirmed. The dependence of the average cosine of the polar angle on energy is studied in detail. It has been found that the total average cosine of the polar angle has values in the narrow interval of 0.66-0.67, approximately corresponding to the reflection angle of 48°, and that it does not depend on the initial photon energy.

Manifestly gauge invariant discretizations of the Schrödinger equation

International Nuclear Information System (INIS)

Halvorsen, Tore Gunnar; Kvaal, Simen

2012-01-01

Grid-based discretizations of the time dependent Schrödinger equation coupled to an external magnetic field are converted to manifest gauge invariant discretizations. This is done using generalizations of ideas used in classical lattice gauge theory, and the process defined is applicable to a large class of discretized differential operators. In particular, popular discretizations such as pseudospectral discretizations using the fast Fourier transform can be transformed to gauge invariant schemes. Also generic gauge invariant versions of generic time integration methods are considered, enabling completely gauge invariant calculations of the time dependent Schrödinger equation. Numerical examples illuminating the differences between a gauge invariant discretization and conventional discretization procedures are also presented. -- Highlights: ► We investigate the Schrödinger equation coupled to an external magnetic field. ► Any grid-based discretization is made trivially gauge invariant. ► An extension of classical lattice gauge theory.

Noether symmetries of discrete mechanico–electrical systems

International Nuclear Information System (INIS)

Fu Jingli; Xie Fengping; Chen Benyong

2008-01-01

This paper focuses on studying Noether symmetries and conservation laws of the discrete mechanico-electrical systems with the nonconservative and the dissipative forces. Based on the invariance of discrete Hamilton action of the systems under the infinitesimal transformation with respect to the generalized coordinates, the generalized electrical quantities and time, it presents the discrete analogue of variational principle, the discrete analogue of Lagrange–Maxwell equations, the discrete analogue of Noether theorems for Lagrange–Maxwell and Lagrange mechanico-electrical systems. Also, the discrete Noether operator identity and the discrete Noether-type conservation laws are obtained for these systems. An actual example is given to illustrate these results. (general)

Revisiting the quantum harmonic oscillator via unilateral Fourier transforms

International Nuclear Information System (INIS)

Nogueira, Pedro H F; Castro, Antonio S de

2016-01-01

The literature on the exponential Fourier approach to the one-dimensional quantum harmonic oscillator problem is revised and criticized. It is shown that the solution of this problem has been built on faulty premises. The problem is revisited via the Fourier sine and cosine transform method and the stationary states are properly determined by requiring definite parity and square-integrable eigenfunctions. (paper)

Fourier transformation for engineering and natural science

International Nuclear Information System (INIS)

Klingen, B.

2001-01-01

The following topics are covered: functions, Dirac delta function, Fourier operators, Fourier integrals, Fourier transformation and periodic functions, discrete Fourier transformations and discrete filters, applications. (WL)

Expandable image compression system: A modular approach

International Nuclear Information System (INIS)

Ho, B.K.T.; Chan, K.K.; Ishimitsu, Y.; Lo, S.C.; Huang, H.K.

1987-01-01

The full-frame bit allocation algorithm for radiological image compression developed in the authors' laboratory can achieve compression ratios as high as 30:1. The software development and clinical evaluation of this algorithm has been completed. It involves two stages of operations: a two-dimensional discrete cosine transform and pixel quantization in the transform space with pixel depth kept accountable by a bit allocation table. Their design took an expandable modular approach based on the VME bus system which has a maximum data transfer rate of 48 Mbytes per second and a Motorola 68020 microprocessor as the master controller. The transform modules are based on advanced digital signal processor (DSP) chips microprogrammed to perform fast cosine transforms. Four DSP's built into a single-board transform module can process an 1K x 1K image in 1.7 seconds. Additional transform modules working in parallel can be added if even greater speeds are desired. The flexibility inherent in the microcode extends the capabilities of the system to incorporate images of variable sizes. Their design allows for a maximum image size of 2K x 2K

Statistical Characterization of MP3 Encoders for Steganalysis: ’CHAMP3’

Science.gov (United States)

2004-04-27

compression exceeds those of typical stegano- graphic tools (e. g., LSB image embedding), the availability of commented source codes for MP3 encoders...developed by testing the approach on known and unknown reference data. 15. SUBJECT TERMS EOARD, Steganography , Digital Watermarking...Pages kbps Kilobits per Second LGPL Lesser General Public License LSB Least Significant Bit MB Megabyte MDCT Modified Discrete Cosine Transformation MP3

Comments on `Area and power efficient DCT architecture for image compression' by Dhandapani and Ramachandran

Science.gov (United States)

Cintra, Renato J.; Bayer, Fábio M.

2017-12-01

In [Dhandapani and Ramachandran, "Area and power efficient DCT architecture for image compression", EURASIP Journal on Advances in Signal Processing 2014, 2014:180] the authors claim to have introduced an approximation for the discrete cosine transform capable of outperforming several well-known approximations in literature in terms of additive complexity. We could not verify the above results and we offer corrections for their work.

A New Minimum Trees-Based Approach for Shape Matching with Improved Time Computing: Application to Graphical Symbols Recognition

Science.gov (United States)

Franco, Patrick; Ogier, Jean-Marc; Loonis, Pierre; Mullot, Rémy

Recently we have developed a model for shape description and matching. Based on minimum spanning trees construction and specifics stages like the mixture, it seems to have many desirable properties. Recognition invariance in front shift, rotated and noisy shape was checked through median scale tests related to GREC symbol reference database. Even if extracting the topology of a shape by mapping the shortest path connecting all the pixels seems to be powerful, the construction of graph induces an expensive algorithmic cost. In this article we discuss on the ways to reduce time computing. An alternative solution based on image compression concepts is provided and evaluated. The model no longer operates in the image space but in a compact space, namely the Discrete Cosine space. The use of block discrete cosine transform is discussed and justified. The experimental results led on the GREC2003 database show that the proposed method is characterized by a good discrimination power, a real robustness to noise with an acceptable time computing.

Discrete Chebyshev nets and a universal permutability theorem

International Nuclear Information System (INIS)

Schief, W K

2007-01-01

The Pohlmeyer-Lund-Regge system which was set down independently in the contexts of Lagrangian field theories and the relativistic motion of a string and which played a key role in the development of a geometric interpretation of soliton theory is known to appear in a variety of important guises such as the vectorial Lund-Regge equation, the O(4) nonlinear σ-model and the SU(2) chiral model. Here, it is demonstrated that these avatars may be discretized in such a manner that both integrability and equivalence are preserved. The corresponding discretization procedure is geometric and algebraic in nature and based on discrete Chebyshev nets and generalized discrete Lelieuvre formulae. In connection with the derivation of associated Baecklund transformations, it is shown that a generalized discrete Lund-Regge equation may be interpreted as a universal permutability theorem for integrable equations which admit commuting matrix Darboux transformations acting on su(2) linear representations. Three-dimensional coordinate systems and lattices of 'Lund-Regge' type related to particular continuous and discrete Zakharov-Manakov systems are obtained as a by-product of this analysis

ISAR Imaging of Maneuvering Targets Based on the Modified Discrete Polynomial-Phase Transform

Directory of Open Access Journals (Sweden)

Yong Wang

2015-09-01

Full Text Available Inverse synthetic aperture radar (ISAR imaging of a maneuvering target is a challenging task in the field of radar signal processing. The azimuth echo can be characterized as a multi-component polynomial phase signal (PPS after the translational compensation, and the high quality ISAR images can be obtained by the parameters estimation of it combined with the Range-Instantaneous-Doppler (RID technique. In this paper, a novel parameters estimation algorithm of the multi-component PPS with order three (cubic phase signal-CPS based on the modified discrete polynomial-phase transform (MDPT is proposed, and the corresponding new ISAR imaging algorithm is presented consequently. This algorithm is efficient and accurate to generate a focused ISAR image, and the results of real data demonstrate the effectiveness of it.

Penyembunyian Data pada File Video Menggunakan Metode LSB dan DCT

Directory of Open Access Journals (Sweden)

Mahmuddin Yunus

2014-01-01

Full Text Available Abstrak Penyembunyian data pada file video dikenal dengan istilah steganografi video. Metode steganografi yang dikenal diantaranya metode Least Significant Bit (LSB dan Discrete Cosine Transform (DCT. Dalam penelitian ini dilakukan penyembunyian data pada file video dengan menggunakan metode LSB, metode DCT, dan gabungan metode LSB-DCT. Sedangkan kualitas file video yang dihasilkan setelah penyisipan dihitung dengan menggunakan Mean Square Error (MSE dan Peak Signal to Noise Ratio (PSNR.Uji eksperimen dilakukan berdasarkan ukuran file video, ukuran file berkas rahasia yang disisipkan, dan resolusi video. Hasil pengujian menunjukkan tingkat keberhasilan steganografi video dengan menggunakan metode LSB adalah 38%, metode DCT adalah 90%, dan gabungan metode LSB-DCT adalah 64%. Sedangkan hasil perhitungan MSE, nilai MSE metode DCT paling rendah dibandingkan metode LSB dan gabungan metode LSB-DCT. Sedangkan metode LSB-DCT mempunyai nilai yang lebih kecil dibandingkan metode LSB. Pada pengujian PSNR diperoleh databahwa nilai PSNR metode DCTlebih tinggi dibandingkan metode LSB dan gabungan metode LSB-DCT. Sedangkan nilai PSNR metode gabungan LSB-DCT lebih tinggi dibandingkan metode LSB.   Kata Kunci— Steganografi, Video, Least Significant Bit (LSB, Discrete Cosine Transform (DCT, Mean Square Error (MSE, Peak Signal to Noise Ratio (PSNR                             Abstract Hiding data in video files is known as video steganography. Some of the well known steganography methods areLeast Significant Bit (LSB and Discrete Cosine Transform (DCT method. In this research, data will be hidden on the video file with LSB method, DCT method, and the combined method of LSB-DCT. While the quality result of video file after insertion is calculated using the Mean Square Error (MSE and Peak Signal to Noise Ratio (PSNR. The experiments were conducted based on the size of the video file, the file size of the inserted secret files, and

Transforming between discrete and continuous angle distribution models: application to protein χ1 torsions

International Nuclear Information System (INIS)

Schmidt, Jürgen M.

2012-01-01

Two commonly employed angular-mobility models for describing amino-acid side-chain χ 1 torsion conformation, the staggered-rotamer jump and the normal probability density, are discussed and performance differences in applications to scalar-coupling data interpretation highlighted. Both models differ in their distinct statistical concepts, representing discrete and continuous angle distributions, respectively. Circular statistics, introduced for describing torsion-angle distributions by using a universal circular order parameter central to all models, suggest another distribution of the continuous class, here referred to as the elliptic model. Characteristic of the elliptic model is that order parameter and circular variance form complementary moduli. Transformations between the parameter sets that describe the probability density functions underlying the different models are provided. Numerical aspects of parameter optimization are considered. The issues are typified by using a set of χ 1 related 3 J coupling constants available for FK506-binding protein. The discrete staggered-rotamer model is found generally to produce lower order parameters, implying elevated rotatory variability in the amino-acid side chains, whereas continuous models tend to give higher order parameters that suggest comparatively less variation in angle conformations. The differences perceived regarding angular mobility are attributed to conceptually different features inherent to the models.

Integrable lattices and their sublattices: From the discrete Moutard (discrete Cauchy-Riemann) 4-point equation to the self-adjoint 5-point scheme

International Nuclear Information System (INIS)

Doliwa, A.; Grinevich, P.; Nieszporski, M.; Santini, P. M.

2007-01-01

We present the sublattice approach, a procedure to generate, from a given integrable lattice, a sublattice which inherits its integrability features. We consider, as illustrative example of this approach, the discrete Moutard 4-point equation and its sublattice, the self-adjoint 5-point scheme on the star of the square lattice, which are relevant in the theory of the integrable discrete geometries and in the theory of discrete holomorphic and harmonic functions (in this last context, the discrete Moutard equation is called discrete Cauchy-Riemann equation). Therefore an integrable, at one energy, discretization of elliptic two-dimensional operators is considered. We use the sublattice point of view to derive, from the Darboux transformations and superposition formulas of the discrete Moutard equation, the Darboux transformations and superposition formulas of the self-adjoint 5-point scheme. We also construct, from algebro-geometric solutions of the discrete Moutard equation, algebro-geometric solutions of the self-adjoint 5-point scheme. In particular, we show that the corresponding restrictions on the finite-gap data are of the same type as those for the fixed energy problem for the two-dimensional Schroedinger operator. We finally use these solutions to construct explicit examples of discrete holomorphic and harmonic functions, as well as examples of quadrilateral surfaces in R 3

Simulation study and experimental results for detection and classification of the transient capacitor inrush current using discrete wavelet transform and artificial intelligence

Directory of Open Access Journals (Sweden)

Patcharoen Theerasak

2018-04-01

Full Text Available This paper describes the combination of discrete wavelet transforms (DWT and artificial intelligence (AI, which are efficient techniques to identify the type of inrush current, analyze the origin and possible cause on the capacitor bank switching. The experiment setup used to verify the proposed techniques can be detected and classified the transient inrush current from normal capacitor rated current. The discrete wavelet transforms are used to detect and classify the inrush current. Then, output from wavelet is acted as input of fuzzy inference system for discriminating the type of switching transient inrush current. The proposed technique shows enhanced performance with a discrimination accuracy of 90.57%. Both simulation study and experimental results are quite satisfactory with providing the high accuracy and reliability which can be developed and implemented into a numerical overcurrent (50/51 and unbalanced current (60C protection relay for an application of shunt capacitor bank protection in the future.

Simulation study and experimental results for detection and classification of the transient capacitor inrush current using discrete wavelet transform and artificial intelligence

Science.gov (United States)

Patcharoen, Theerasak; Yoomak, Suntiti; Ngaopitakkul, Atthapol; Pothisarn, Chaichan

2018-04-01

This paper describes the combination of discrete wavelet transforms (DWT) and artificial intelligence (AI), which are efficient techniques to identify the type of inrush current, analyze the origin and possible cause on the capacitor bank switching. The experiment setup used to verify the proposed techniques can be detected and classified the transient inrush current from normal capacitor rated current. The discrete wavelet transforms are used to detect and classify the inrush current. Then, output from wavelet is acted as input of fuzzy inference system for discriminating the type of switching transient inrush current. The proposed technique shows enhanced performance with a discrimination accuracy of 90.57%. Both simulation study and experimental results are quite satisfactory with providing the high accuracy and reliability which can be developed and implemented into a numerical overcurrent (50/51) and unbalanced current (60C) protection relay for an application of shunt capacitor bank protection in the future.

Approximation for discrete Fourier transform and application in study of three-dimensional interacting electron gas.

Science.gov (United States)

Yan, Xin-Zhong

2011-07-01

The discrete Fourier transform is approximated by summing over part of the terms with corresponding weights. The approximation reduces significantly the requirement for computer memory storage and enhances the numerical computation efficiency with several orders without losing accuracy. As an example, we apply the algorithm to study the three-dimensional interacting electron gas under the renormalized-ring-diagram approximation where the Green's function needs to be self-consistently solved. We present the results for the chemical potential, compressibility, free energy, entropy, and specific heat of the system. The ground-state energy obtained by the present calculation is compared with the existing results of Monte Carlo simulation and random-phase approximation.

From the continuous PV to discrete Painleve equations

International Nuclear Information System (INIS)

Tokihiro, T.; Grammaticos, B.; Ramani, A.

2002-01-01

We study the discrete transformations that are associated with the auto-Baecklund of the (continuous) P V equation. We show that several two-parameter discrete Painleve equations can be obtained as contiguity relations of P V . Among them we find the asymmetric d-P II equation which is a well-known form of discrete P III . The relation between the ternary P I (previously obtained through the discrete dressing approach) and P V is also established. A new discrete Painleve equation is also derived. (author)

Painleve test and discrete Boltzmann equations

International Nuclear Information System (INIS)

Euler, N.; Steeb, W.H.

1989-01-01

The Painleve test for various discrete Boltzmann equations is performed. The connection with integrability is discussed. Furthermore the Lie symmetry vector fields are derived and group-theoretical reduction of the discrete Boltzmann equations to ordinary differentiable equations is performed. Lie Backlund transformations are gained by performing the Painleve analysis for the ordinary differential equations. 16 refs

Symmetries in discrete-time mechanics

International Nuclear Information System (INIS)

Khorrami, M.

1996-01-01

Based on a general formulation for discrete-time quantum mechanics, introduced by M. Khorrami (Annals Phys. 224 (1995), 101), symmetries in discrete-time quantum mechanics are investigated. It is shown that any classical continuous symmetry leads to a conserved quantity in classical mechanics, as well as quantum mechanics. The transformed wave function, however, has the correct evolution if and only if the symmetry is nonanomalous. Copyright copyright 1996 Academic Press, Inc

Efficiency optimization of a fast Poisson solver in beam dynamics simulation

Science.gov (United States)

Zheng, Dawei; Pöplau, Gisela; van Rienen, Ursula

2016-01-01

Calculating the solution of Poisson's equation relating to space charge force is still the major time consumption in beam dynamics simulations and calls for further improvement. In this paper, we summarize a classical fast Poisson solver in beam dynamics simulations: the integrated Green's function method. We introduce three optimization steps of the classical Poisson solver routine: using the reduced integrated Green's function instead of the integrated Green's function; using the discrete cosine transform instead of discrete Fourier transform for the Green's function; using a novel fast convolution routine instead of an explicitly zero-padded convolution. The new Poisson solver routine preserves the advantages of fast computation and high accuracy. This provides a fast routine for high performance calculation of the space charge effect in accelerators.

A quantum search algorithm of two entangled registers to realize quantum discrete Fourier transform of signal processing

International Nuclear Information System (INIS)

Pang Chaoyang; Hu Benqiong

2008-01-01

The discrete Fourier transform (DFT) is the base of modern signal processing. 1-dimensional fast Fourier transform (ID FFT) and 2D FFT have time complexity O (N log N) and O (N 2 log N) respectively. Since 1965, there has been no more essential breakthrough for the design of fast DFT algorithm. DFT has two properties. One property is that DFT is energy conservation transform. The other property is that many DFT coefficients are close to zero. The basic idea of this paper is that the generalized Grover's iteration can perform the computation of DFT which acts on the entangled states to search the big DFT coefficients until these big coefficients contain nearly all energy. One-dimensional quantum DFT (ID QDFT) and two-dimensional quantum DFT (2D QDFT) are presented in this paper. The quantum algorithm for convolution estimation is also presented in this paper. Compared with FFT, ID and 2D QDFT have time complexity O(√N) and O (N) respectively. QDFT and quantum convolution demonstrate that quantum computation to process classical signal is possible. (general)

Unitary embedding for data hiding with the SVD

Science.gov (United States)

Bergman, Clifford; Davidson, Jennifer

2005-03-01

Steganography is the study of data hiding for the purpose of covert communication. A secret message is inserted into a cover file so that the very existence of the message is not apparent. Most current steganography algorithms insert data in the spatial or transform domains; common transforms include the discrete cosine transform, the discrete Fourier transform, and discrete wavelet transform. In this paper, we present a data-hiding algorithm that exploits a decomposition representation of the data instead of a frequency-based transformation of the data. The decomposition transform used is the singular value decomposition (SVD). The SVD of a matrix A is a decomposition A= USV' in which S is a nonnegative diagonal matrix and U and V are orthogonal matrices. We show how to use the orthogonal matrices in the SVD as a vessel in which to embed information. Several challenges were presented in order to accomplish this, and we give effective information-hiding using the SVD can be just as effective as using transform-based techniques. Furthermore, different problems arise when using the SVD than using a transform-based technique. We have applied the SVD to image data, but the technique can be formulated for other data types such as audio and video.

DCTNet and PCANet for acoustic signal feature extraction

OpenAIRE

Xian, Yin; Thompson, Andrew; Sun, Xiaobai; Nowacek, Douglas; Nolte, Loren

2016-01-01

We introduce the use of DCTNet, an efficient approximation and alternative to PCANet, for acoustic signal classification. In PCANet, the eigenfunctions of the local sample covariance matrix (PCA) are used as filterbanks for convolution and feature extraction. When the eigenfunctions are well approximated by the Discrete Cosine Transform (DCT) functions, each layer of of PCANet and DCTNet is essentially a time-frequency representation. We relate DCTNet to spectral feature representation method...

Fault location in underground cables using ANFIS nets and discrete wavelet transform

Directory of Open Access Journals (Sweden)

Shimaa Barakat

2014-12-01

Full Text Available This paper presents an accurate algorithm for locating faults in a medium voltage underground power cable using a combination of Adaptive Network-Based Fuzzy Inference System (ANFIS and discrete wavelet transform (DWT. The proposed method uses five ANFIS networks and consists of 2 stages, including fault type classification and exact fault location. In the first part, an ANFIS is used to determine the fault type, applying four inputs, i.e., the maximum detailed energy of three phase and zero sequence currents. Other four ANFIS networks are utilized to pinpoint the faults (one for each fault type. Four inputs, i.e., the maximum detailed energy of three phase and zero sequence currents, are used to train the neuro-fuzzy inference systems in order to accurately locate the faults on the cable. The proposed method is evaluated under different fault conditions such as different fault locations, different fault inception angles and different fault resistances.

Iterative normalization technique for reference sequence generation for zero-tail discrete fourier transform spread orthogonal frequency division multiplexing

DEFF Research Database (Denmark)

2017-01-01

Systems, methods, apparatuses, and computer program products for generating sequences for zero-tail discrete fourier transform (DFT)-spread-orthogonal frequency division multiplexing (OFDM) (ZT DFT-s-OFDM) reference signals. One method includes adding a zero vector to an input sequence...... of each of the elements, converting the sequence to time domain, generating a zero-padded sequence by forcing a zero head and tail of the sequence, and repeating the steps until a final sequence with zero-tail and flat frequency response is obtained....

Digital double random amplitude image encryption method based on the symmetry property of the parametric discrete Fourier transform

Science.gov (United States)

Bekkouche, Toufik; Bouguezel, Saad

2018-03-01

We propose a real-to-real image encryption method. It is a double random amplitude encryption method based on the parametric discrete Fourier transform coupled with chaotic maps to perform the scrambling. The main idea behind this method is the introduction of a complex-to-real conversion by exploiting the inherent symmetry property of the transform in the case of real-valued sequences. This conversion allows the encrypted image to be real-valued instead of being a complex-valued image as in all existing double random phase encryption methods. The advantage is to store or transmit only one image instead of two images (real and imaginary parts). Computer simulation results and comparisons with the existing double random amplitude encryption methods are provided for peak signal-to-noise ratio, correlation coefficient, histogram analysis, and key sensitivity.

The relation between Pearson’s correlation coefficient r and Salton’s cosine measure

NARCIS (Netherlands)

Egghe, L.; Leydesdorff, L.

2009-01-01

The relation between Pearson's correlation coefficient and Salton's cosine measure is revealed based on the different possible values of the division of the L1-norm and the L2-norm of a vector. These different values yield a sheaf of increasingly straight lines which together form a cloud of points,

Laplacians on discrete and quantum geometries

International Nuclear Information System (INIS)

Calcagni, Gianluca; Oriti, Daniele; Thürigen, Johannes

2013-01-01

We extend discrete calculus for arbitrary (p-form) fields on embedded lattices to abstract discrete geometries based on combinatorial complexes. We then provide a general definition of discrete Laplacian using both the primal cellular complex and its combinatorial dual. The precise implementation of geometric volume factors is not unique and, comparing the definition with a circumcentric and a barycentric dual, we argue that the latter is, in general, more appropriate because it induces a Laplacian with more desirable properties. We give the expression of the discrete Laplacian in several different sets of geometric variables, suitable for computations in different quantum gravity formalisms. Furthermore, we investigate the possibility of transforming from position to momentum space for scalar fields, thus setting the stage for the calculation of heat kernel and spectral dimension in discrete quantum geometries. (paper)

Decompositions of bubbly flow PIV velocity fields using discrete wavelets multi-resolution and multi-section image method

International Nuclear Information System (INIS)

Choi, Je-Eun; Takei, Masahiro; Doh, Deog-Hee; Jo, Hyo-Jae; Hassan, Yassin A.; Ortiz-Villafuerte, Javier

2008-01-01

Currently, wavelet transforms are widely used for the analyses of particle image velocimetry (PIV) velocity vector fields. This is because the wavelet provides not only spatial information of the velocity vectors, but also of the time and frequency domains. In this study, a discrete wavelet transform is applied to real PIV images of bubbly flows. The vector fields obtained by a self-made cross-correlation PIV algorithm were used for the discrete wavelet transform. The performances of the discrete wavelet transforms were investigated by changing the level of power of discretization. The images decomposed by wavelet multi-resolution showed conspicuous characteristics of the bubbly flows for the different levels. A high spatial bubble concentrated area could be evaluated by the constructed discrete wavelet transform algorithm, in which high-leveled wavelets play dominant roles in revealing the flow characteristics

The Discrete Wavelet Transform and Its Application for Noise Removal in Localized Corrosion Measurements

Directory of Open Access Journals (Sweden)

Rogelio Ramos

2017-01-01

Full Text Available The present work discusses the problem of induced external electrical noise as well as its removal from the electrical potential obtained from Scanning Vibrating Electrode Technique (SVET in the pitting corrosion process of aluminum alloy A96061 in 3.5% NaCl. An accessible and efficient solution of this problem is presented with the use of virtual instrumentation (VI, embedded systems, and the discrete wavelet transform (DWT. The DWT is a computational algorithm for digital processing that allows obtaining electrical noise with Signal to Noise Ratio (SNR superior to those obtained with Lock-In Amplifier equipment. The results show that DWT and the threshold method are efficient and powerful alternatives to carry out electrical measurements of potential signals from localized corrosion processes measured by SVET.

Techniques for computing the discrete Fourier transform using the quadratic residue Fermat number systems

Science.gov (United States)

Truong, T. K.; Chang, J. J.; Hsu, I. S.; Pei, D. Y.; Reed, I. S.

1986-01-01

The complex integer multiplier and adder over the direct sum of two copies of finite field developed by Cozzens and Finkelstein (1985) is specialized to the direct sum of the rings of integers modulo Fermat numbers. Such multiplication over the rings of integers modulo Fermat numbers can be performed by means of two integer multiplications, whereas the complex integer multiplication requires three integer multiplications. Such multiplications and additions can be used in the implementation of a discrete Fourier transform (DFT) of a sequence of complex numbers. The advantage of the present approach is that the number of multiplications needed to compute a systolic array of the DFT can be reduced substantially. The architectural designs using this approach are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation.

Evaluation of cardiac signals using discrete wavelet transform with MATLAB graphical user interface.

Science.gov (United States)

John, Agnes Aruna; Subramanian, Aruna Priyadharshni; Jaganathan, Saravana Kumar; Sethuraman, Balasubramanian

2015-01-01

To process the electrocardiogram (ECG) signals using MATLAB-based graphical user interface (GUI) and to classify the signals based on heart rate. The subject condition was identified using R-peak detection based on discrete wavelet transform followed by a Bayes classifier that classifies the ECG signals. The GUI was designed to display the ECG signal plot. Obtained from MIT database 18 patients had normal heart rate and 9 patients had abnormal heart rate; 14.81% of the patients suffered from tachycardia and 18.52% of the patients have bradycardia. The proposed GUI display was found useful to analyze the digitized ECG signal by a non-technical user and may help in diagnostics. Further improvement can be done by employing field programmable gate array for the real time processing of cardiac signals. Copyright © 2015 Cardiological Society of India. Published by Elsevier B.V. All rights reserved.

A planar waveguide optical discrete Fourier transformer design for 160 Gb/s all-optical OFDM systems

Science.gov (United States)

Li, Wei; Liang, Xiaojun; Ma, Weidong; Zhou, Tianhong; Huang, Benxiong; Liu, Deming

2010-01-01

A cost-effective all-optical discrete Fourier transformer (ODFT) is designed based on a silicon planar lightwave circuit (PLC), which can be applied to all-optical orthogonal frequency division multiplexing (OFDM) transmission systems and can be achieved by current techniques. It consists of 2 × 2 directional couplers, phase shifters and optical delay lines. Metal-film heaters are used as phase shifters, according to the thermooptic effect of SiO 2. Based on the ODFT, a 160 Gb/s OFDM system is set up. Simulation results show excellent bit error rate (BER) and optical signal-to-noise ratio (OSNR) performances after 400 km transmission.

A semi-discrete integrable multi-component coherently coupled nonlinear Schrödinger system

International Nuclear Information System (INIS)

Zhao, Hai-qiong; Yuan, Jinyun

2016-01-01

A new integrable semi-discrete version is proposed for the multi-component coherently coupled nonlinear Schrödinger equation. The integrability of the semi-discrete system is confirmed by existence of Lax pair and infinite number of conservation laws. With the aid of gauge transformations, explicit formulas for N -fold Darboux transformations are derived whereby some physically important solutions of the system are presented. Furthermore, the theory of the semi-discrete system including Lax pair, Darboux transformations, exact solutions and infinite number of conservation laws are shown for their continuous counterparts in the continuous limit. (paper)

Advances in audio watermarking based on singular value decomposition

CERN Document Server

Dhar, Pranab Kumar

2015-01-01

This book introduces audio watermarking methods for copyright protection, which has drawn extensive attention for securing digital data from unauthorized copying. The book is divided into two parts. First, an audio watermarking method in discrete wavelet transform (DWT) and discrete cosine transform (DCT) domains using singular value decomposition (SVD) and quantization is introduced. This method is robust against various attacks and provides good imperceptible watermarked sounds. Then, an audio watermarking method in fast Fourier transform (FFT) domain using SVD and Cartesian-polar transformation (CPT) is presented. This method has high imperceptibility and high data payload and it provides good robustness against various attacks. These techniques allow media owners to protect copyright and to show authenticity and ownership of their material in a variety of applications.   ·         Features new methods of audio watermarking for copyright protection and ownership protection ·         Outl...

Discrimination Between Inrush and Short Circuit Currents in Differential Protection of Power Transformer Based on Correlation Method Using the Wavelet Transform

OpenAIRE

M. Rasoulpoor; M. Banejad; A. Ahmadyfard

2011-01-01

This paper presents a novel technique for transformer differential protection to prevent incorrect operation due to inrush current. The proposed method in this paper is based on time-frequency transform known as the Wavelet transform. The discrete Wavelet transform is used for analysis the differential current signals in time and frequency domains. The investigation on the energy distribution of the signal on the discrete Wavelet transform components shows the difference distribution between ...

Integrable discretizations of the (2+1)-dimensional sinh-Gordon equation

International Nuclear Information System (INIS)

Hu, Xing-Biao; Yu, Guo-Fu

2007-01-01

In this paper, we propose two semi-discrete equations and one fully discrete equation and study them by Hirota's bilinear method. These equations have continuum limits into a system which admits the (2+1)-dimensional generalization of the sinh-Gordon equation. As a result, two integrable semi-discrete versions and one fully discrete version for the sinh-Gordon equation are found. Baecklund transformations, nonlinear superposition formulae, determinant solution and Lax pairs for these discrete versions are presented

DCTNet : A Simple Learning-free Approach for Face Recognition

OpenAIRE

Ng, Cong Jie; Teoh, Andrew Beng Jin

2015-01-01

PCANet was proposed as a lightweight deep learning network that mainly leverages Principal Component Analysis (PCA) to learn multistage filter banks followed by binarization and block-wise histograming. PCANet was shown worked surprisingly well in various image classification tasks. However, PCANet is data-dependence hence inflexible. In this paper, we proposed a data-independence network, dubbed DCTNet for face recognition in which we adopt Discrete Cosine Transform (DCT) as filter banks in ...

GPU Performance and Power Consumption Analysis: A DCT based denoising application

OpenAIRE

Pi Puig, Martín; De Giusti, Laura Cristina; Naiouf, Marcelo; De Giusti, Armando Eduardo

2017-01-01

It is known that energy and power consumption are becoming serious metrics in the design of high performance workstations because of heat dissipation problems. In the last years, GPU accelerators have been integrating many of these expensive systems despite they are embedding more and more transistors on their chips producing a quick increase of power consumption requirements. This paper analyzes an image processing application, in particular a Discrete Cosine Transform denoising algorithm, i...

Decomposition of ECG by linear filtering.

Science.gov (United States)

Murthy, I S; Niranjan, U C

1992-01-01

A simple method is developed for the delineation of a given electrocardiogram (ECG) signal into its component waves. The properties of discrete cosine transform (DCT) are exploited for the purpose. The transformed signal is convolved with appropriate filters and the component waves are obtained by computing the inverse transform (IDCT) of the filtered signals. The filters are derived from the time signal itself. Analysis of continuous strips of ECG signals with various arrhythmias showed that the performance of the method is satisfactory both qualitatively and quantitatively. The small amplitude P wave usually had a high percentage rms difference (PRD) compared to the other large component waves.

Test of 10 GHz sin-cosin microwave reflectometer on CASTOR

International Nuclear Information System (INIS)

Zacek, F.; Kletecka, P.

1994-09-01

The first microwave reflectometric device is described used at the CASTOR tokamak to measure fast density fluctuations. The device operates at the frequency of 10.26 GHz which makes it possible to detect fluctuations near the plasma periphery. The device was proved to work properly during the whole tokamak discharge despite the fact that the reflected signal level varied strongly. The construction of the reflectometric device is described as is its use of the so-called sin-cosin detection system, and the results obtained are discussed. (Z.S.) 8 figs., 3 refs

Intrusion Detection in NEAR System by Anti-denoising Traffic Data Series using Discrete Wavelet Transform

Directory of Open Access Journals (Sweden)

VANCEA, F.

2014-11-01

Full Text Available The paper presents two methods for detecting anomalies in data series derived from network traffic. Intrusion detection systems based on network traffic analysis are able to respond to incidents never seen before by detecting anomalies in data series extracted from the traffic. Some anomalies manifest themselves as pulses of various sizes and shapes, superimposed on series corresponding to normal traffic. In order to detect those impulses we propose two methods based on discrete wavelet transformation. Their effectiveness expressed in relative thresholds on pulse amplitude for no false negatives and no false positives is then evaluated against pulse duration and Hurst characteristic of original series. Different base functions are also evaluated for efficiency in the context of the proposed methods.

Soliton solution for nonlinear partial differential equations by cosine-function method

International Nuclear Information System (INIS)

Ali, A.H.A.; Soliman, A.A.; Raslan, K.R.

2007-01-01

In this Letter, we established a traveling wave solution by using Cosine-function algorithm for nonlinear partial differential equations. The method is used to obtain the exact solutions for five different types of nonlinear partial differential equations such as, general equal width wave equation (GEWE), general regularized long wave equation (GRLW), general Korteweg-de Vries equation (GKdV), general improved Korteweg-de Vries equation (GIKdV), and Coupled equal width wave equations (CEWE), which are the important soliton equations

improvement of digital image watermarking techniques based on FPGA implementation

International Nuclear Information System (INIS)

EL-Hadedy, M.E

2006-01-01

digital watermarking provides the ownership of a piece of digital data by marking the considered data invisibly or visibly. this can be used to protect several types of multimedia objects such as audio, text, image and video. this thesis demonstrates the different types of watermarking techniques such as (discrete cosine transform (DCT) and discrete wavelet transform (DWT) and their characteristics. then, it classifies these techniques declaring their advantages and disadvantages. an improved technique with distinguished features, such as peak signal to noise ratio ( PSNR) and similarity ratio (SR) has been introduced. the modified technique has been compared with the other techniques by measuring heir robustness against differ attacks. finally, field programmable gate arrays (FPGA) based implementation and comparison, for the proposed watermarking technique have been presented and discussed

Phase noise estimation and mitigation for DCT-based coherent optical OFDM systems.

Science.gov (United States)

Yang, Chuanchuan; Yang, Feng; Wang, Ziyu

2009-09-14

In this paper, as an attractive alternative to the conventional discrete Fourier transform (DFT) based orthogonal frequency division multiplexing (OFDM), discrete cosine transform (DCT) based OFDM which has certain advantages over its counterpart is studied for optical fiber communications. As is known, laser phase noise is a major impairment to the performance of coherent optical OFDM (CO-OFDM) systems. However, to our knowledge, detailed analysis of phase noise and the corresponding mitigation methods for DCT-based CO-OFDM systems have not been reported yet. To address these issues, we analyze the laser phase noise in the DCT-based CO-OFDM systems, and propose phase noise estimation and mitigation schemes. Numerical results show that the proposal is very effective in suppressing phase noise and could significantly improve the performance of DCT-based CO-OFDM systems.

Designing an Algorithm for Cancerous Tissue Segmentation Using Adaptive K-means Cluttering and Discrete Wavelet Transform.

Science.gov (United States)

Rezaee, Kh; Haddadnia, J

2013-09-01

Breast cancer is currently one of the leading causes of death among women worldwide. The diagnosis and separation of cancerous tumors in mammographic images require accuracy, experience and time, and it has always posed itself as a major challenge to the radiologists and physicians. This paper proposes a new algorithm which draws on discrete wavelet transform and adaptive K-means techniques to transmute the medical images implement the tumor estimation and detect breast cancer tumors in mammograms in early stages. It also allows the rapid processing of the input data. In the first step, after designing a filter, the discrete wavelet transform is applied to the input images and the approximate coefficients of scaling components are constructed. Then, the different parts of image are classified in continuous spectrum. In the next step, by using adaptive K-means algorithm for initializing and smart choice of clusters' number, the appropriate threshold is selected. Finally, the suspicious cancerous mass is separated by implementing the image processing techniques. We Received 120 mammographic images in LJPEG format, which had been scanned in Gray-Scale with 50 microns size, 3% noise and 20% INU from clinical data taken from two medical databases (mini-MIAS and DDSM). The proposed algorithm detected tumors at an acceptable level with an average accuracy of 92.32% and sensitivity of 90.24%. Also, the Kappa coefficient was approximately 0.85, which proved the suitable reliability of the system performance. The exact positioning of the cancerous tumors allows the radiologist to determine the stage of disease progression and suggest an appropriate treatment in accordance with the tumor growth. The low PPV and high NPV of the system is a warranty of the system and both clinical specialists and patients can trust its output.

Status of reactor core design code system in COSINE code package

Energy Technology Data Exchange (ETDEWEB)

Chen, Y.; Yu, H.; Liu, Z., E-mail: yuhui@snptc.com.cn [State Nuclear Power Software Development Center, SNPTC, National Energy Key Laboratory of Nuclear Power Software (NEKLS), Beijiing (China)

2014-07-01

For self-reliance, COre and System INtegrated Engine for design and analysis (COSINE) code package is under development in China. In this paper, recent development status of the reactor core design code system (including the lattice physics code and the core simulator) is presented. The well-established theoretical models have been implemented. The preliminary verification results are illustrated. And some special efforts, such as updated theory models and direct data access application, are also made to achieve better software product. (author)

Status of reactor core design code system in COSINE code package

International Nuclear Information System (INIS)

Chen, Y.; Yu, H.; Liu, Z.

2014-01-01

For self-reliance, COre and System INtegrated Engine for design and analysis (COSINE) code package is under development in China. In this paper, recent development status of the reactor core design code system (including the lattice physics code and the core simulator) is presented. The well-established theoretical models have been implemented. The preliminary verification results are illustrated. And some special efforts, such as updated theory models and direct data access application, are also made to achieve better software product. (author)

Characterizing a discrete-to-discrete X-ray transform for iterative image reconstruction with limited angular-range scanning in CT

DEFF Research Database (Denmark)

Sidky, Emil; Jørgensen, Jakob Heide; Pan, Xiaochuan

2012-01-01

Iterative image reconstruction in computed tomography often employs a discrete-to-discrete (DD) linear data model, and many of the aspects of the image recovery relate directly to the properties of this linear model. While much is known about the properties of the continuous X-ray, the correspond...

Discrete systems and integrability

CERN Document Server

Hietarinta, J; Nijhoff, F W

2016-01-01

This first introductory text to discrete integrable systems introduces key notions of integrability from the vantage point of discrete systems, also making connections with the continuous theory where relevant. While treating the material at an elementary level, the book also highlights many recent developments. Topics include: Darboux and Bäcklund transformations; difference equations and special functions; multidimensional consistency of integrable lattice equations; associated linear problems (Lax pairs); connections with Padé approximants and convergence algorithms; singularities and geometry; Hirota's bilinear formalism for lattices; intriguing properties of discrete Painlevé equations; and the novel theory of Lagrangian multiforms. The book builds the material in an organic way, emphasizing interconnections between the various approaches, while the exposition is mostly done through explicit computations on key examples. Written by respected experts in the field, the numerous exercises and the thoroug...

Toward an enhanced Arabic text classification using cosine similarity and Latent Semantic

Directory of Open Access Journals (Sweden)

Fawaz S. Al-Anzi

2017-04-01

Full Text Available Cosine similarity is one of the most popular distance measures in text classification problems. In this paper, we used this important measure to investigate the performance of Arabic language text classification. For textual features, vector space model (VSM is generally used as a model to represent textual information as numerical vectors. However, Latent Semantic Indexing (LSI is a better textual representation technique as it maintains semantic information between the words. Hence, we used the singular value decomposition (SVD method to extract textual features based on LSI. In our experiments, we conducted comparison between some of the well-known classification methods such as Naïve Bayes, k-Nearest Neighbors, Neural Network, Random Forest, Support Vector Machine, and classification tree. We used a corpus that contains 4,000 documents of ten topics (400 document for each topic. The corpus contains 2,127,197 words with about 139,168 unique words. The testing set contains 400 documents, 40 documents for each topics. As a weighing scheme, we used Term Frequency.Inverse Document Frequency (TF.IDF. This study reveals that the classification methods that use LSI features significantly outperform the TF.IDF-based methods. It also reveals that k-Nearest Neighbors (based on cosine measure and support vector machine are the best performing classifiers.

Theoretical study of weakly bound vibrational states of the sodium trimer. Numerical methods; prospects for the formation of Na3 in an ultracold gas

International Nuclear Information System (INIS)

Willner, K.

2006-01-01

A Mapped Fourier Grid method for solving the radial Schroedinger equation is improved. It is observed that a discrete sine and cosine transform algorithm allows to compute a Hamiltonian matrix the spectrum of which is free of spurious eigenvalues. - The energies of the highest, least bound vibrational states of the Na - Na 2 van der Waals complex are computed using a hyperspherical diabatic-by-sector method. The computed levels are analyzed using quantum defect theory. (orig.)

Application of complex discrete wavelet transform in classification of Doppler signals using complex-valued artificial neural network.

Science.gov (United States)

Ceylan, Murat; Ceylan, Rahime; Ozbay, Yüksel; Kara, Sadik

2008-09-01

In biomedical signal classification, due to the huge amount of data, to compress the biomedical waveform data is vital. This paper presents two different structures formed using feature extraction algorithms to decrease size of feature set in training and test data. The proposed structures, named as wavelet transform-complex-valued artificial neural network (WT-CVANN) and complex wavelet transform-complex-valued artificial neural network (CWT-CVANN), use real and complex discrete wavelet transform for feature extraction. The aim of using wavelet transform is to compress data and to reduce training time of network without decreasing accuracy rate. In this study, the presented structures were applied to the problem of classification in carotid arterial Doppler ultrasound signals. Carotid arterial Doppler ultrasound signals were acquired from left carotid arteries of 38 patients and 40 healthy volunteers. The patient group included 22 males and 16 females with an established diagnosis of the early phase of atherosclerosis through coronary or aortofemoropopliteal (lower extremity) angiographies (mean age, 59 years; range, 48-72 years). Healthy volunteers were young non-smokers who seem to not bear any risk of atherosclerosis, including 28 males and 12 females (mean age, 23 years; range, 19-27 years). Sensitivity, specificity and average detection rate were calculated for comparison, after training and test phases of all structures finished. These parameters have demonstrated that training times of CVANN and real-valued artificial neural network (RVANN) were reduced using feature extraction algorithms without decreasing accuracy rate in accordance to our aim.

Lossy image compression for digital medical imaging systems

Science.gov (United States)

Wilhelm, Paul S.; Haynor, David R.; Kim, Yongmin; Nelson, Alan C.; Riskin, Eve A.

1990-07-01

Image compression at rates of 10:1 or greater could make PACS much more responsive and economically attractive. This paper describes a protocol for subjective and objective evaluation of the fidelity of compressed/decompressed images to the originals and presents the results ofits application to four representative and promising compression methods. The methods examined are predictive pruned tree-structured vector quantization, fractal compression, the discrete cosine transform with equal weighting of block bit allocation, and the discrete cosine transform with human visual system weighting of block bit allocation. Vector quantization is theoretically capable of producing the best compressed images, but has proven to be difficult to effectively implement. It has the advantage that it can reconstruct images quickly through a simple lookup table. Disadvantages are that codebook training is required, the method is computationally intensive, and achieving the optimum performance would require prohibitively long vector dimensions. Fractal compression is a relatively new compression technique, but has produced satisfactory results while being computationally simple. It is fast at both image compression and image reconstruction. Discrete cosine iransform techniques reproduce images well, but have traditionally been hampered by the need for intensive computing to compress and decompress images. A protocol was developed for side-by-side observer comparison of reconstructed images with originals. Three 1024 X 1024 CR (Computed Radiography) images and two 512 X 512 X-ray CT images were viewed at six bit rates (0.2, 0.4, 0.6, 0.9, 1.2, and 1.5 bpp for CR, and 1.0, 1.3, 1.6, 1.9, 2.2, 2.5 bpp for X-ray CT) by nine radiologists at the University of Washington Medical Center. The CR images were viewed on a Pixar II Megascan (2560 X 2048) monitor and the CT images on a Sony (1280 X 1024) monitor. The radiologists' subjective evaluations of image fidelity were compared to

Polyphase-discrete Fourier transform spectrum analysis for the Search for Extraterrestrial Intelligence sky survey

Science.gov (United States)

Zimmerman, G. A.; Gulkis, S.

1991-01-01

The sensitivity of a matched filter-detection system to a finite-duration continuous wave (CW) tone is compared with the sensitivities of a windowed discrete Fourier transform (DFT) system and an ideal bandpass filter-bank system. These comparisons are made in the context of the NASA Search for Extraterrestrial Intelligence (SETI) microwave observing project (MOP) sky survey. A review of the theory of polyphase-DFT filter banks and its relationship to the well-known windowed-DFT process is presented. The polyphase-DFT system approximates the ideal bandpass filter bank by using as few as eight filter taps per polyphase branch. An improvement in sensitivity of approx. 3 dB over a windowed-DFT system can be obtained by using the polyphase-DFT approach. Sidelobe rejection of the polyphase-DFT system is vastly superior to the windowed-DFT system, thereby improving its performance in the presence of radio frequency interference (RFI).

Exact discretization of Schrödinger equation

Energy Technology Data Exchange (ETDEWEB)

Tarasov, Vasily E., E-mail: tarasov@theory.sinp.msu.ru

2016-01-08

There are different approaches to discretization of the Schrödinger equation with some approximations. In this paper we derive a discrete equation that can be considered as exact discretization of the continuous Schrödinger equation. The proposed discrete equation is an equation with difference of integer order that is represented by infinite series. We suggest differences, which are characterized by power-law Fourier transforms. These differences can be considered as exact discrete analogs of derivatives of integer orders. Physically the suggested discrete equation describes a chain (or lattice) model with long-range interaction of power-law form. Mathematically it is a uniquely highlighted difference equation that exactly corresponds to the continuous Schrödinger equation. Using the Young's inequality for convolution, we prove that suggested differences are operators on the Hilbert space of square-summable sequences. We prove that the wave functions, which are exact discrete analogs of the free particle and harmonic oscillator solutions of the continuous Schrödinger equations, are solutions of the suggested discrete Schrödinger equations. - Highlights: • Exact discretization of the continuous Schrödinger equation is suggested. • New long-range interactions of power-law form are suggested. • Solutions of discrete Schrödinger equation are exact discrete analogs of continuous solutions.

Exact discretization of Schrödinger equation

International Nuclear Information System (INIS)

Tarasov, Vasily E.

2016-01-01

There are different approaches to discretization of the Schrödinger equation with some approximations. In this paper we derive a discrete equation that can be considered as exact discretization of the continuous Schrödinger equation. The proposed discrete equation is an equation with difference of integer order that is represented by infinite series. We suggest differences, which are characterized by power-law Fourier transforms. These differences can be considered as exact discrete analogs of derivatives of integer orders. Physically the suggested discrete equation describes a chain (or lattice) model with long-range interaction of power-law form. Mathematically it is a uniquely highlighted difference equation that exactly corresponds to the continuous Schrödinger equation. Using the Young's inequality for convolution, we prove that suggested differences are operators on the Hilbert space of square-summable sequences. We prove that the wave functions, which are exact discrete analogs of the free particle and harmonic oscillator solutions of the continuous Schrödinger equations, are solutions of the suggested discrete Schrödinger equations. - Highlights: • Exact discretization of the continuous Schrödinger equation is suggested. • New long-range interactions of power-law form are suggested. • Solutions of discrete Schrödinger equation are exact discrete analogs of continuous solutions.

Notes on discrete subgroups of Möbius transformations

Indian Academy of Sciences (India)

Abstract. Jørgensen's inequality gives a necessary condition for a nonelementary two generator subgroup of SL(2, C) to be discrete. By embedding SL(2, C) into. ˆU(1, 1; H), we obtain a new type of Jørgensen's inequality, which is in terms of the coefficients of involved isometries. We provide an example to show that this ...

Symmetries and conserved quantities of discrete wave equation associated with the Ablowitz—Ladik—Lattice system

International Nuclear Information System (INIS)

Fu Jing-Li; He Yu-Fang; Hong Fang-Yu; Song Duan; Fu Hao

2013-01-01

In this paper, we present a new method to obtain the Lie symmetries and conserved quantities of the discrete wave equation with the Ablowitz—Ladik—Lattice equations. Firstly, the wave equation is transformed into a simple difference equation with the Ablowitz—Ladik—Lattice method. Secondly, according to the invariance of the discrete wave equation and the Ablowitz—Ladik—Lattice equations under infinitesimal transformation of dependent and independent variables, we derive the discrete determining equation and the discrete restricted equations. Thirdly, a series of the discrete analogs of conserved quantities, the discrete analogs of Lie groups, and the characteristic equations are obtained for the wave equation. Finally, we study a model of a biological macromolecule chain of mechanical behaviors, the Lie symmetry theory of discrete wave equation with the Ablowitz—Ladik—Lattice method is verified. (general)

Integrable discretization s of derivative nonlinear Schroedinger equations

International Nuclear Information System (INIS)

Tsuchida, Takayuki

2002-01-01

We propose integrable discretizations of derivative nonlinear Schroedinger (DNLS) equations such as the Kaup-Newell equation, the Chen-Lee-Liu equation and the Gerdjikov-Ivanov equation by constructing Lax pairs. The discrete DNLS systems admit the reduction of complex conjugation between two dependent variables and possess bi-Hamiltonian structure. Through transformations of variables and reductions, we obtain novel integrable discretizations of the nonlinear Schroedinger (NLS), modified KdV (mKdV), mixed NLS, matrix NLS, matrix KdV, matrix mKdV, coupled NLS, coupled Hirota, coupled Sasa-Satsuma and Burgers equations. We also discuss integrable discretizations of the sine-Gordon equation, the massive Thirring model and their generalizations. (author)

Spatially localized, temporally quasiperiodic, discrete nonlinear excitations

International Nuclear Information System (INIS)

Cai, D.; Bishop, A.R.; Gronbech-Jensen, N.

1995-01-01

In contrast to the commonly discussed discrete breather, which is a spatially localized, time-periodic solution, we present an exact solution of a discrete nonlinear Schroedinger breather which is a spatially localized, temporally quasiperiodic nonlinear coherent excitation. This breather is a multiple-soliton solution in the sense of the inverse scattering transform. A discrete breather of multiple frequencies is conceptually important in studies of nonlinear lattice systems. We point out that, for this breather, the incommensurability of its frequencies is a discrete lattice effect and these frequencies become commensurate in the continuum limit. To understand the dynamical properties of the breather, we also discuss its stability and its behavior in the presence of an external potential. Finally, we indicate how to obtain an exact N-soliton breather as a discrete generalization of the continuum multiple-soliton solution

Discovering Trigonometric Relationships Implied by the Law of Sines and the Law of Cosines

Science.gov (United States)

Skurnick, Ronald; Javadi, Mohammad

2006-01-01

The Law of Sines and The Law of Cosines are of paramount importance in the field of trigonometry because these two theorems establish relationships satisfied by the three sides and the three angles of any triangle. In this article, the authors use these two laws to discover a host of other trigonometric relationships that exist within any…

The geometric phase analysis method based on the local high resolution discrete Fourier transform for deformation measurement

International Nuclear Information System (INIS)

Dai, Xianglu; Xie, Huimin; Wang, Huaixi; Li, Chuanwei; Wu, Lifu; Liu, Zhanwei

2014-01-01

The geometric phase analysis (GPA) method based on the local high resolution discrete Fourier transform (LHR-DFT) for deformation measurement, defined as LHR-DFT GPA, is proposed to improve the measurement accuracy. In the general GPA method, the fundamental frequency of the image plays a crucial role. However, the fast Fourier transform, which is generally employed in the general GPA method, could make it difficult to locate the fundamental frequency accurately when the fundamental frequency is not located at an integer pixel position in the Fourier spectrum. This study focuses on this issue and presents a LHR-DFT algorithm that can locate the fundamental frequency with sub-pixel precision in a specific frequency region for the GPA method. An error analysis is offered and simulation is conducted to verify the effectiveness of the proposed method; both results show that the LHR-DFT algorithm can accurately locate the fundamental frequency and improve the measurement accuracy of the GPA method. Furthermore, typical tensile and bending tests are carried out and the experimental results verify the effectiveness of the proposed method. (paper)

COSINE software development based on code generation technology

International Nuclear Information System (INIS)

Ren Hao; Mo Wentao; Liu Shuo; Zhao Guang

2013-01-01

The code generation technology can significantly improve the quality and productivity of software development and reduce software development risk. At present, the code generator is usually based on UML model-driven technology, which can not satisfy the development demand of nuclear power calculation software. The feature of scientific computing program was analyzed and the FORTRAN code generator (FCG) based on C# was developed in this paper. FCG can generate module variable definition FORTRAN code automatically according to input metadata. FCG also can generate memory allocation interface for dynamic variables as well as data access interface. FCG was applied to the core and system integrated engine for design and analysis (COSINE) software development. The result shows that FCG can greatly improve the development efficiency of nuclear power calculation software, and reduce the defect rate of software development. (authors)

Multiresolution analysis (discrete wavelet transform) through Daubechies family for emotion recognition in speech.

Science.gov (United States)

Campo, D.; Quintero, O. L.; Bastidas, M.

2016-04-01

We propose a study of the mathematical properties of voice as an audio signal. This work includes signals in which the channel conditions are not ideal for emotion recognition. Multiresolution analysis- discrete wavelet transform - was performed through the use of Daubechies Wavelet Family (Db1-Haar, Db6, Db8, Db10) allowing the decomposition of the initial audio signal into sets of coefficients on which a set of features was extracted and analyzed statistically in order to differentiate emotional states. ANNs proved to be a system that allows an appropriate classification of such states. This study shows that the extracted features using wavelet decomposition are enough to analyze and extract emotional content in audio signals presenting a high accuracy rate in classification of emotional states without the need to use other kinds of classical frequency-time features. Accordingly, this paper seeks to characterize mathematically the six basic emotions in humans: boredom, disgust, happiness, anxiety, anger and sadness, also included the neutrality, for a total of seven states to identify.

Discrete Symmetries Analysis and Exact Solutions of the Inviscid Burgers Equation

Directory of Open Access Journals (Sweden)

Hongwei Yang

2012-01-01

Full Text Available We discuss the Lie point symmetries and discrete symmetries of the inviscid Burgers equation. By employing the Lie group method of infinitesimal transformations, symmetry reductions and similarity solutions of the governing equation are given. Based on discrete symmetries analysis, two groups of discrete symmetries are obtained, which lead to new exact solutions of the inviscid Burgers equation.

Experimental Study of Concealment Data in Video Sequences MPEG-2

Directory of Open Access Journals (Sweden)

A. A. Alimov

2011-03-01

Full Text Available MPEG-2 uses video compression with loses based on the use of discrete cosine transformation (DCT to small blocks of encoded image. As a result, there is range of factors, each of which corresponds to a frequency index of the encoded block. The human eye, due to natural approximation, does not perceive the difference when the high-frequency DCT coefficients change. The investigated algorithm uses this feature of the human vision to embed required data in video stream invisibly.

Generalized reciprocity principle for discrete symplectic systems

Directory of Open Access Journals (Sweden)

Julia Elyseeva

2015-12-01

Full Text Available This paper studies transformations for conjoined bases of symplectic difference systems $Y_{i+1}=\\mathcal S_{i}Y_{i}$ with the symplectic coefficient matrices $\\mathcal S_i.$ For an arbitrary symplectic transformation matrix $P_{i}$ we formulate most general sufficient conditions for $\\mathcal S_{i},\\, P_{i}$ which guarantee that $P_{i}$ preserves oscillatory properties of conjoined bases $Y_{i}.$ We present examples which show that our new results extend the applicability of the discrete transformation theory.

Fast numerical algorithm for the linear canonical transform.

Science.gov (United States)

Hennelly, Bryan M; Sheridan, John T

2005-05-01

The linear canonical transform (LCT) describes the effect of any quadratic phase system (QPS) on an input optical wave field. Special cases of the LCT include the fractional Fourier transform (FRT), the Fourier transform (FT), and the Fresnel transform (FST) describing free-space propagation. Currently there are numerous efficient algorithms used (for purposes of numerical simulation in the area of optical signal processing) to calculate the discrete FT, FRT, and FST. All of these algorithms are based on the use of the fast Fourier transform (FFT). In this paper we develop theory for the discrete linear canonical transform (DLCT), which is to the LCT what the discrete Fourier transform (DFT) is to the FT. We then derive the fast linear canonical transform (FLCT), an N log N algorithm for its numerical implementation by an approach similar to that used in deriving the FFT from the DFT. Our algorithm is significantly different from the FFT, is based purely on the properties of the LCT, and can be used for FFT, FRT, and FST calculations and, in the most general case, for the rapid calculation of the effect of any QPS.

Application of DFT Filter Banks and Cosine Modulated Filter Banks in Filtering

Science.gov (United States)

Lin, Yuan-Pei; Vaidyanathan, P. P.

1994-01-01

None given. This is a proposal for a paper to be presented at APCCAS '94 in Taipei, Taiwan. (From outline): This work is organized as follows: Sec. II is devoted to the construction of the new 2m channel under-decimated DFT filter bank. Implementation and complexity of this DFT filter bank are discussed therein. IN a similar manner, the new 2m channel cosine modulated filter bank is discussed in Sec. III. Design examples are given in Sec. IV.

Transformation-based spherical cloaks designed by an implicit transformation-independent method: theory and optimization

International Nuclear Information System (INIS)

Novitsky, Andrey; Qiu, C-W; Zouhdi, Said

2009-01-01

Based on the concept of the cloak generating function, we propose an implicit transformation-independent method for the required parameters of spherical cloaks without knowing the needed coordinate transformation beforehand. A non-ideal discrete model is used to calculate and optimize the total scattering cross-sections of different profiles of the generating function. A bell-shaped quadratic spherical cloak is found to be the best candidate, which is further optimized by controlling the design parameters involved. Such improved invisibility is steady even when the model is highly discretized.

Rational solutions of the discrete time Toda lattice and the alternate discrete Painleve II equation

International Nuclear Information System (INIS)

Common, Alan K; Hone, Andrew N W

2008-01-01

The Yablonskii-Vorob'ev polynomials y n (t), which are defined by a second-order bilinear differential-difference equation, provide rational solutions of the Toda lattice. They are also polynomial tau-functions for the rational solutions of the second Painleve equation (P II ). Here we define two-variable polynomials Y n (t, h) on a lattice with spacing h, by considering rational solutions of the discrete time Toda lattice as introduced by Suris. These polynomials are shown to have many properties that are analogous to those of the Yablonskii-Vorob'ev polynomials, to which they reduce when h = 0. They also provide rational solutions for a particular discretization of P II , namely the so-called alternate discrete P II , and this connection leads to an expression in terms of the Umemura polynomials for the third Painleve equation (P III ). It is shown that the Baecklund transformation for the alternate discrete Painleve equation is a symplectic map, and the shift in time is also symplectic. Finally we present a Lax pair for the alternate discrete P II , which recovers Jimbo and Miwa's Lax pair for P II in the continuum limit h → 0

From ordinary to discrete quantum mechanics: The Charlier oscillator and its coalgebra symmetry

Energy Technology Data Exchange (ETDEWEB)

Latini, D., E-mail: latini@fis.uniroma3.it [Department of Mathematics and Physics and INFN, Roma Tre University, Via della Vasca Navale 84, I-00146 Rome (Italy); Riglioni, D. [Department of Mathematics and Physics, Roma Tre University, Via della Vasca Navale 84, I-00146 Rome (Italy)

2016-10-14

The coalgebraic structure of the harmonic oscillator is used to underline possible connections between continuous and discrete superintegrable models which can be described in terms of SUSY discrete quantum mechanics. A set of 1-parameter algebraic transformations is introduced in order to generate a discrete representation for the coalgebraic harmonic oscillator. This set of transformations is shown to play a role in the generalization of classical orthogonal polynomials to the realm of discrete orthogonal polynomials in the Askey scheme. As an explicit example the connection between Hermite and Charlier oscillators, that share the same coalgebraic structure, is presented and a two-dimensional maximally superintegrable version of the Charlier oscillator is constructed. - Highlights: • We construct a discrete quantum version of the harmonic oscillator. • We solve the spectral problem on the lattice. • We introduce the coalgebra symmetry in real discrete Quantum Mechanics (rdQM). • The coalgebra is used to extend the system to higher dimensions preserving its superintegrability. • We explicitly write down a discrete version of both the angular momentum and the Demkov–Fradkin Tensor.

Application of the Sumudu Transform to Discrete Dynamic Systems

Science.gov (United States)

Asiru, Muniru Aderemi

2003-01-01

The Sumudu transform is an integral transform introduced to solve differential equations and control engineering problems. The transform possesses many interesting properties that make visualization easier and application has been demonstrated in the solution of partial differential equations, integral equations, integro-differential equations and…

Antisymmetric Orbit Functions

Directory of Open Access Journals (Sweden)

Anatoliy Klimyk

2007-02-01

Full Text Available In the paper, properties of antisymmetric orbit functions are reviewed and further developed. Antisymmetric orbit functions on the Euclidean space $E_n$ are antisymmetrized exponential functions. Antisymmetrization is fulfilled by a Weyl group, corresponding to a Coxeter-Dynkin diagram. Properties of such functions are described. These functions are closely related to irreducible characters of a compact semisimple Lie group $G$ of rank $n$. Up to a sign, values of antisymmetric orbit functions are repeated on copies of the fundamental domain $F$ of the affine Weyl group (determined by the initial Weyl group in the entire Euclidean space $E_n$. Antisymmetric orbit functions are solutions of the corresponding Laplace equation in $E_n$, vanishing on the boundary of the fundamental domain $F$. Antisymmetric orbit functions determine a so-called antisymmetrized Fourier transform which is closely related to expansions of central functions in characters of irreducible representations of the group $G$. They also determine a transform on a finite set of points of $F$ (the discrete antisymmetric orbit function transform. Symmetric and antisymmetric multivariate exponential, sine and cosine discrete transforms are given.

A new discrete dipole kernel for quantitative susceptibility mapping.

Science.gov (United States)

Milovic, Carlos; Acosta-Cabronero, Julio; Pinto, José Miguel; Mattern, Hendrik; Andia, Marcelo; Uribe, Sergio; Tejos, Cristian

2018-09-01

Most approaches for quantitative susceptibility mapping (QSM) are based on a forward model approximation that employs a continuous Fourier transform operator to solve a differential equation system. Such formulation, however, is prone to high-frequency aliasing. The aim of this study was to reduce such errors using an alternative dipole kernel formulation based on the discrete Fourier transform and discrete operators. The impact of such an approach on forward model calculation and susceptibility inversion was evaluated in contrast to the continuous formulation both with synthetic phantoms and in vivo MRI data. The discrete kernel demonstrated systematically better fits to analytic field solutions, and showed less over-oscillations and aliasing artifacts while preserving low- and medium-frequency responses relative to those obtained with the continuous kernel. In the context of QSM estimation, the use of the proposed discrete kernel resulted in error reduction and increased sharpness. This proof-of-concept study demonstrated that discretizing the dipole kernel is advantageous for QSM. The impact on small or narrow structures such as the venous vasculature might by particularly relevant to high-resolution QSM applications with ultra-high field MRI - a topic for future investigations. The proposed dipole kernel has a straightforward implementation to existing QSM routines. Copyright © 2018 Elsevier Inc. All rights reserved.

Periodic and solitary wave solutions of Kawahara and modified Kawahara equations by using Sine-Cosine method

International Nuclear Information System (INIS)

Yusufoglu, E.; Bekir, A.; Alp, M.

2008-01-01

In this paper, we establish exact solutions for nonlinear evolution equations. The sine-cosine method is used to construct periodic and solitary wave solutions of the Kawahara and modified Kawahara equations. These solutions may be important of significance for the explanation of some practical physical problems

Geometric optimisation of an accurate cosine correcting optic fibre coupler for solar spectral measurement

Science.gov (United States)

Cahuantzi, Roberto; Buckley, Alastair

2017-09-01

Making accurate and reliable measurements of solar irradiance is important for understanding performance in the photovoltaic energy sector. In this paper, we present design details and performance of a number of fibre optic couplers for use in irradiance measurement systems employing remote light sensors applicable for either spectrally resolved or broadband measurement. The angular and spectral characteristics of different coupler designs are characterised and compared with existing state-of-the-art commercial technology. The new coupler designs are fabricated from polytetrafluorethylene (PTFE) rods and operate through forward scattering of incident sunlight on the front surfaces of the structure into an optic fibre located in a cavity to the rear of the structure. The PTFE couplers exhibit up to 4.8% variation in scattered transmission intensity between 425 nm and 700 nm and show minimal specular reflection, making the designs accurate and reliable over the visible region. Through careful geometric optimization near perfect cosine dependence on the angular response of the coupler can be achieved. The PTFE designs represent a significant improvement over the state of the art with less than 0.01% error compared with ideal cosine response for angles of incidence up to 50°.

EKF-GPR-Based Fingerprint Renovation for Subset-Based Indoor Localization with Adjusted Cosine Similarity.

Science.gov (United States)

Yang, Junhua; Li, Yong; Cheng, Wei; Liu, Yang; Liu, Chenxi

2018-01-22

Received Signal Strength Indicator (RSSI) localization using fingerprint has become a prevailing approach for indoor localization. However, the fingerprint-collecting work is repetitive and time-consuming. After the original fingerprint radio map is built, it is laborious to upgrade the radio map. In this paper, we describe a Fingerprint Renovation System (FRS) based on crowdsourcing, which avoids the use of manual labour to obtain the up-to-date fingerprint status. Extended Kalman Filter (EKF) and Gaussian Process Regression (GPR) in FRS are combined to calculate the current state based on the original fingerprinting radio map. In this system, a method of subset acquisition also makes an immediate impression to reduce the huge computation caused by too many reference points (RPs). Meanwhile, adjusted cosine similarity (ACS) is employed in the online phase to solve the issue of outliers produced by cosine similarity. Both experiments and analytical simulation in a real Wireless Fidelity (Wi-Fi) environment indicate the usefulness of our system to significant performance improvements. The results show that FRS improves the accuracy by 19.6% in the surveyed area compared to the radio map un-renovated. Moreover, the proposed subset algorithm can bring less computation.

EKF–GPR-Based Fingerprint Renovation for Subset-Based Indoor Localization with Adjusted Cosine Similarity

Science.gov (United States)

Yang, Junhua; Li, Yong; Cheng, Wei; Liu, Yang; Liu, Chenxi

2018-01-01

Received Signal Strength Indicator (RSSI) localization using fingerprint has become a prevailing approach for indoor localization. However, the fingerprint-collecting work is repetitive and time-consuming. After the original fingerprint radio map is built, it is laborious to upgrade the radio map. In this paper, we describe a Fingerprint Renovation System (FRS) based on crowdsourcing, which avoids the use of manual labour to obtain the up-to-date fingerprint status. Extended Kalman Filter (EKF) and Gaussian Process Regression (GPR) in FRS are combined to calculate the current state based on the original fingerprinting radio map. In this system, a method of subset acquisition also makes an immediate impression to reduce the huge computation caused by too many reference points (RPs). Meanwhile, adjusted cosine similarity (ACS) is employed in the online phase to solve the issue of outliers produced by cosine similarity. Both experiments and analytical simulation in a real Wireless Fidelity (Wi-Fi) environment indicate the usefulness of our system to significant performance improvements. The results show that FRS improves the accuracy by 19.6% in the surveyed area compared to the radio map un-renovated. Moreover, the proposed subset algorithm can bring less computation. PMID:29361805

Geometric optimisation of an accurate cosine correcting optic fibre coupler for solar spectral measurement.

Science.gov (United States)

Cahuantzi, Roberto; Buckley, Alastair

2017-09-01

Making accurate and reliable measurements of solar irradiance is important for understanding performance in the photovoltaic energy sector. In this paper, we present design details and performance of a number of fibre optic couplers for use in irradiance measurement systems employing remote light sensors applicable for either spectrally resolved or broadband measurement. The angular and spectral characteristics of different coupler designs are characterised and compared with existing state-of-the-art commercial technology. The new coupler designs are fabricated from polytetrafluorethylene (PTFE) rods and operate through forward scattering of incident sunlight on the front surfaces of the structure into an optic fibre located in a cavity to the rear of the structure. The PTFE couplers exhibit up to 4.8% variation in scattered transmission intensity between 425 nm and 700 nm and show minimal specular reflection, making the designs accurate and reliable over the visible region. Through careful geometric optimization near perfect cosine dependence on the angular response of the coupler can be achieved. The PTFE designs represent a significant improvement over the state of the art with less than 0.01% error compared with ideal cosine response for angles of incidence up to 50°.

Discrete variable representation for singular Hamiltonians

DEFF Research Database (Denmark)

Schneider, B. I.; Nygaard, Nicolai

2004-01-01

We discuss the application of the discrete variable representation (DVR) to Schrodinger problems which involve singular Hamiltonians. Unlike recent authors who invoke transformations to rid the eigenvalue equation of singularities at the cost of added complexity, we show that an approach based...

A new twist to fourier transforms

CERN Document Server

Meikle, Hamish D

2004-01-01

Making use of the inherent helix in the Fourier transform expression, this book illustrates both Fourier transforms and their properties in the round. The author draws on elementary complex algebra to manipulate the transforms, presenting the ideas in such a way as to avoid pages of complicated mathematics. Similarly, abbreviations are not used throughout and the language is kept deliberately clear so that the result is a text that is accessible to a much wider readership.The treatment is extended with the use of sampled data to finite and discrete transforms, the fast Fourier transform, or FFT, being a special case of a discrete transform. The application of Fourier transforms in statistics is illustrated for the first time using the examples operational research and later radar detection. In addition, a whole chapter on tapering or weighting functions is added for reference. The whole is rounded off by a glossary and examples of diagrams in three dimensions made possible by today's mathematics programs

Discrete Fourier transformation processor based on complex radix (−1 + j number system

Directory of Open Access Journals (Sweden)

Anidaphi Shadap

2017-02-01

Full Text Available Complex radix (−1 + j allows the arithmetic operations of complex numbers to be done without treating the divide and conquer rules, which offers the significant speed improvement of complex numbers computation circuitry. Design and hardware implementation of complex radix (−1 + j converter has been introduced in this paper. Extensive simulation results have been incorporated and an application of this converter towards the implementation of discrete Fourier transformation (DFT processor has been presented. The functionality of the DFT processor have been verified in Xilinx ISE design suite version 14.7 and performance parameters like propagation delay and dynamic switching power consumption have been calculated by Virtuoso platform in Cadence. The proposed DFT processor has been implemented through conversion, multiplication and addition. The performance parameter matrix in terms of delay and power consumption offered a significant improvement over other traditional implementation of DFT processor.

A Novel 2D Image Compression Algorithm Based on Two Levels DWT and DCT Transforms with Enhanced Minimize-Matrix-Size Algorithm for High Resolution Structured Light 3D Surface Reconstruction

Science.gov (United States)

Siddeq, M. M.; Rodrigues, M. A.

2015-09-01

Image compression techniques are widely used on 2D image 2D video 3D images and 3D video. There are many types of compression techniques and among the most popular are JPEG and JPEG2000. In this research, we introduce a new compression method based on applying a two level discrete cosine transform (DCT) and a two level discrete wavelet transform (DWT) in connection with novel compression steps for high-resolution images. The proposed image compression algorithm consists of four steps. (1) Transform an image by a two level DWT followed by a DCT to produce two matrices: DC- and AC-Matrix, or low and high frequency matrix, respectively, (2) apply a second level DCT on the DC-Matrix to generate two arrays, namely nonzero-array and zero-array, (3) apply the Minimize-Matrix-Size algorithm to the AC-Matrix and to the other high-frequencies generated by the second level DWT, (4) apply arithmetic coding to the output of previous steps. A novel decompression algorithm, Fast-Match-Search algorithm (FMS), is used to reconstruct all high-frequency matrices. The FMS-algorithm computes all compressed data probabilities by using a table of data, and then using a binary search algorithm for finding decompressed data inside the table. Thereafter, all decoded DC-values with the decoded AC-coefficients are combined in one matrix followed by inverse two levels DCT with two levels DWT. The technique is tested by compression and reconstruction of 3D surface patches. Additionally, this technique is compared with JPEG and JPEG2000 algorithm through 2D and 3D root-mean-square-error following reconstruction. The results demonstrate that the proposed compression method has better visual properties than JPEG and JPEG2000 and is able to more accurately reconstruct surface patches in 3D.

DOQDP ADOQ, Discrete Ordinate Quadrature Generator for Programs DOT and ANISN

International Nuclear Information System (INIS)

1978-01-01

1 - Description of problem or function: DOQDP is used to generate direction sets (quadratures used as input to ANISN, DOT, and other related codes). If a fully symmetric quadrature is desired, DOQDP can generate the direction cosines to be used. If other than a fully quadrature is to be generated, the user must supply the appropriate direction cosines. Once the direction cosines are specified, the code will generate the quadrature weights. 2 - Method of solution: To determine point weights, DOQDP solves a set of simultaneous linear equations by Gaussian elimination with error improvement iterations. 3 - Restrictions on the complexity of the problem: None noted

Wigner distribution function of Hermite-cosine-Gaussian beams through an apertured optical system.

Science.gov (United States)

Sun, Dong; Zhao, Daomu

2005-08-01

By introducing the hard-aperture function into a finite sum of complex Gaussian functions, the approximate analytical expressions of the Wigner distribution function for Hermite-cosine-Gaussian beams passing through an apertured paraxial ABCD optical system are obtained. The analytical results are compared with the numerically integrated ones, and the absolute errors are also given. It is shown that the analytical results are proper and that the calculation speed for them is much faster than for the numerical results.

The relation between Pearson’s correlation coefficient r and Salton’s cosine measure

OpenAIRE

EGGHE, Leo; Leydesdorff, L.

2009-01-01

The relation between Pearson’s correlation coefficient and Salton’s cosine measure is revealed based on the different possible values of the division of the -norm and the norm of a vector. These different values yield a sheaf of increasingly straight lines which form together a cloud of points, being the investigated relation. These theoretical results are tested against the author co-citation relations among 24 informetricians for who two matrices can be constructed, based on co-citations: t...

String constraints on discrete symmetries in MSSM type II quivers

Energy Technology Data Exchange (ETDEWEB)

Anastasopoulos, Pascal [Technische Univ. Wien (Austria). Inst. fur Theor. Phys.; Cvetic, Mirjam [Univ. of Pennsylvania, Philadelphia PA (United States). Dept. of Physics and Astronomy; Univ. of Maribor (Slovenia). Center for Applied Mathematics and Theoretical Physics; Richter, Robert [Hamburg Univ. (Germany). 2. Inst. fuer Theoretische Physik; Vaudrevange, Patrick K.S. [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany)

2012-11-15

We study the presence of discrete gauge symmetries in D-brane semirealistic compactifications. After establishing the constraints on the transformation behaviour of the chiral matter for the presence of a discrete gauge symmetry we perform a systematic search for discrete gauge symmetries within semi-realistic D-brane realizations, based on four D-brane stacks, of the MSSM and the MSSM with three right-handed neutrinos. The systematic search reveals that Proton hexality, a discrete symmetry which ensures the absence of R-parity violating terms as well as the absence of dangerous dimension 5 proton decay operators, is only rarely realized. Moreover, none of the semi-realistic local D-brane configurations exhibit any family dependent discrete gauge symmetry.

The radon transform. Theory and implementation

International Nuclear Information System (INIS)

Toft, P.

1996-01-01

The subject of this Ph.D. thesis is the mathematical Radon transform, which is well suited for curve detection in digital images, and for reconstruction of tomography images. The thesis is divided into two main parts. Part I describes the Radon- and the Hough-transform and especially their discrete approximations with respect to curve parameter detection in digital images. The sampling relationships of the Radon transform is reviewed from a digital signal processing point of view. The discrete Radon transform is investigated for detection of curves, and aspects regarding the performance of the Radon transform assuming various types of noise is covered. Furthermore, a new fast scheme for estimating curve parameters is presented. Part II of the thesis describes the inverse Radon transform in 2D and 3D with focus on reconstruction of tomography images. Some of the direct reconstruction schemes are analyzed, including their discrete implementation. Furthermore, several iterative reconstruction schemes based on linear algebra are reviewed and applied for reconstruction of Positron Emission Tomography (PET) images. A new and very fast implementation of 2D iterative reconstruction methods is devised. In a more practical oriented chapter, the noise in PET images is modelled from a very large number of measurements. Several packagers for Radon- and Hough-transform based curve detection and direct/iterative 2D and 3D reconstruction have been developed and provided for free. (au) 140 refs

Drunk identification using far infrared imagery based on DCT features in DWT domain

Science.gov (United States)

Xie, Zhihua; Jiang, Peng; Xiong, Ying; Li, Ke

2016-10-01

Drunk driving problem is a serious threat to traffic safety. Automatic drunk driver identification is vital to improve the traffic safety. This paper copes with automatic drunk driver detection using far infrared thermal images by the holistic features. To improve the robustness of drunk driver detection, instead of traditional local pixels, a holistic feature extraction method is proposed to attain compact and discriminative features for infrared face drunk identification. Discrete cosine transform (DCT) in discrete wavelet transform (DWT) domain is used to extract the useful features in infrared face images for its high speed. Then, the first six DCT coefficients are retained for drunk classification by means of "Z" scanning. Finally, SVM is applied to classify the drunk person. Experimental results illustrate that the accuracy rate of proposed infrared face drunk identification can reach 98.5% with high computation efficiency, which can be applied in real drunk driver detection system.

A parallel 3-D discrete wavelet transform architecture using pipelined lifting scheme approach for video coding

Science.gov (United States)

Hegde, Ganapathi; Vaya, Pukhraj

2013-10-01

This article presents a parallel architecture for 3-D discrete wavelet transform (3-DDWT). The proposed design is based on the 1-D pipelined lifting scheme. The architecture is fully scalable beyond the present coherent Daubechies filter bank (9, 7). This 3-DDWT architecture has advantages such as no group of pictures restriction and reduced memory referencing. It offers low power consumption, low latency and high throughput. The computing technique is based on the concept that lifting scheme minimises the storage requirement. The application specific integrated circuit implementation of the proposed architecture is done by synthesising it using 65 nm Taiwan Semiconductor Manufacturing Company standard cell library. It offers a speed of 486 MHz with a power consumption of 2.56 mW. This architecture is suitable for real-time video compression even with large frame dimensions.

A robust color image watermarking algorithm against rotation attacks

Science.gov (United States)

Han, Shao-cheng; Yang, Jin-feng; Wang, Rui; Jia, Gui-min

2018-01-01

A robust digital watermarking algorithm is proposed based on quaternion wavelet transform (QWT) and discrete cosine transform (DCT) for copyright protection of color images. The luminance component Y of a host color image in YIQ space is decomposed by QWT, and then the coefficients of four low-frequency subbands are transformed by DCT. An original binary watermark scrambled by Arnold map and iterated sine chaotic system is embedded into the mid-frequency DCT coefficients of the subbands. In order to improve the performance of the proposed algorithm against rotation attacks, a rotation detection scheme is implemented before watermark extracting. The experimental results demonstrate that the proposed watermarking scheme shows strong robustness not only against common image processing attacks but also against arbitrary rotation attacks.

Rigid Body Attitude Control Based on a Manifold Representation of Direction Cosine Matrices

International Nuclear Information System (INIS)

Nakath, David; Clemens, Joachim; Rachuy, Carsten

2017-01-01

Autonomous systems typically actively observe certain aspects of their surroundings, which makes them dependent on a suitable controller. However, building an attitude controller for three degrees of freedom is a challenging task, mainly due to singularities in the different parametrizations of the three dimensional rotation group SO (3). Thus, we propose an attitude controller based on a manifold representation of direction cosine matrices: In state space, the attitude is globally and uniquely represented as a direction cosine matrix R ∈ SO (3). However, differences in the state space, i.e., the attitude errors, are exposed to the controller in the vector space ℝ 3 . This is achieved by an operator, which integrates the matrix logarithm mapping from SO (3) to so(3) and the map from so(3) to ℝ 3 . Based on this representation, we derive a proportional and derivative feedback controller, whose output has an upper bound to prevent actuator saturation. Additionally, the feedback is preprocessed by a particle filter to account for measurement and state transition noise. We evaluate our approach in a simulator in three different spacecraft maneuver scenarios: (i) stabilizing, (ii) rest-to-rest, and (iii) nadir-pointing. The controller exhibits stable behavior from initial attitudes near and far from the setpoint. Furthermore, it is able to stabilize a spacecraft and can be used for nadir-pointing maneuvers. (paper)

The Roadmaker's algorithm for the discrete pulse transform.

Science.gov (United States)

Laurie, Dirk P

2011-02-01

The discrete pulse transform (DPT) is a decomposition of an observed signal into a sum of pulses, i.e., signals that are constant on a connected set and zero elsewhere. Originally developed for 1-D signal processing, the DPT has recently been generalized to more dimensions. Applications in image processing are currently being investigated. The time required to compute the DPT as originally defined via the successive application of LULU operators (members of a class of minimax filters studied by Rohwer) has been a severe drawback to its applicability. This paper introduces a fast method for obtaining such a decomposition, called the Roadmaker's algorithm because it involves filling pits and razing bumps. It acts selectively only on those features actually present in the signal, flattening them in order of increasing size by subtracing an appropriate positive or negative pulse, which is then appended to the decomposition. The implementation described here covers 1-D signal as well as two and 3-D image processing in a single framework. This is achieved by considering the signal or image as a function defined on a graph, with the geometry specified by the edges of the graph. Whenever a feature is flattened, nodes in the graph are merged, until eventually only one node remains. At that stage, a new set of edges for the same nodes as the graph, forming a tree structure, defines the obtained decomposition. The Roadmaker's algorithm is shown to be equivalent to the DPT in the sense of obtaining the same decomposition. However, its simpler operators are not in general equivalent to the LULU operators in situations where those operators are not applied successively. A by-product of the Roadmaker's algorithm is that it yields a proof of the so-called Highlight Conjecture, stated as an open problem in 2006. We pay particular attention to algorithmic details and complexity, including a demonstration that in the 1-D case, and also in the case of a complete graph, the Roadmaker

A high-throughput two channel discrete wavelet transform architecture for the JPEG2000 standard

Science.gov (United States)

Badakhshannoory, Hossein; Hashemi, Mahmoud R.; Aminlou, Alireza; Fatemi, Omid

2005-07-01

The Discrete Wavelet Transform (DWT) is increasingly recognized in image and video compression standards, as indicated by its use in JPEG2000. The lifting scheme algorithm is an alternative DWT implementation that has a lower computational complexity and reduced resource requirement. In the JPEG2000 standard two lifting scheme based filter banks are introduced: the 5/3 and 9/7. In this paper a high throughput, two channel DWT architecture for both of the JPEG2000 DWT filters is presented. The proposed pipelined architecture has two separate input channels that process the incoming samples simultaneously with minimum memory requirement for each channel. The architecture had been implemented in VHDL and synthesized on a Xilinx Virtex2 XCV1000. The proposed architecture applies DWT on a 2K by 1K image at 33 fps with a 75 MHZ clock frequency. This performance is achieved with 70% less resources than two independent single channel modules. The high throughput and reduced resource requirement has made this architecture the proper choice for real time applications such as Digital Cinema.

Discrete Fourier Transform-Based Multivariate Image Analysis: Application to Modeling of Aromatase Inhibitory Activity.

Science.gov (United States)

Barigye, Stephen J; Freitas, Matheus P; Ausina, Priscila; Zancan, Patricia; Sola-Penna, Mauro; Castillo-Garit, Juan A

2018-02-12

We recently generalized the formerly alignment-dependent multivariate image analysis applied to quantitative structure-activity relationships (MIA-QSAR) method through the application of the discrete Fourier transform (DFT), allowing for its application to noncongruent and structurally diverse chemical compound data sets. Here we report the first practical application of this method in the screening of molecular entities of therapeutic interest, with human aromatase inhibitory activity as the case study. We developed an ensemble classification model based on the two-dimensional (2D) DFT MIA-QSAR descriptors, with which we screened the NCI Diversity Set V (1593 compounds) and obtained 34 chemical compounds with possible aromatase inhibitory activity. These compounds were docked into the aromatase active site, and the 10 most promising compounds were selected for in vitro experimental validation. Of these compounds, 7419 (nonsteroidal) and 89 201 (steroidal) demonstrated satisfactory antiproliferative and aromatase inhibitory activities. The obtained results suggest that the 2D-DFT MIA-QSAR method may be useful in ligand-based virtual screening of new molecular entities of therapeutic utility.

Methods for performing fast discrete curvelet transforms of data

Science.gov (United States)

Candes, Emmanuel; Donoho, David; Demanet, Laurent

2010-11-23

Fast digital implementations of the second generation curvelet transform for use in data processing are disclosed. One such digital transformation is based on unequally-spaced fast Fourier transforms (USFFT) while another is based on the wrapping of specially selected Fourier samples. Both digital transformations return a table of digital curvelet coefficients indexed by a scale parameter, an orientation parameter, and a spatial location parameter. Both implementations are fast in the sense that they run in about O(n.sup.2 log n) flops for n by n Cartesian arrays or about O(N log N) flops for Cartesian arrays of size N=n.sup.3; in addition, they are also invertible, with rapid inversion algorithms of about the same complexity.

Properties of wavelet discretization of Black-Scholes equation

Science.gov (United States)

Finěk, Václav

2017-07-01

Using wavelet methods, the continuous problem is transformed into a well-conditioned discrete problem. And once a non-symmetric problem is given, squaring yields a symmetric positive definite formulation. However squaring usually makes the condition number of discrete problems substantially worse. This note is concerned with a wavelet based numerical solution of the Black-Scholes equation for pricing European options. We show here that in wavelet coordinates a symmetric part of the discretized equation dominates over an unsymmetric part in the standard economic environment with low interest rates. It provides some justification for using a fractional step method with implicit treatment of the symmetric part of the weak form of the Black-Scholes operator and with explicit treatment of its unsymmetric part. Then a well-conditioned discrete problem is obtained.

a pyramid algorithm for the haar discrete wavelet packet transform

African Journals Online (AJOL)

PROF EKWUEME

computer-aided signal processing of non-stationary signals, this paper develops a pyramid algorithm for the discrete wavelet packet ... Edith T. Luhanga, School of Computational and Communication Sciences and Engineering, Nelson Mandela African. Institute of ..... Mathematics, Washington University. 134. EDITH T.

Hopf Bifurcation Analysis for a Stochastic Discrete-Time Hyperchaotic System

Directory of Open Access Journals (Sweden)

Jie Ran

2015-01-01

Full Text Available The dynamics of a discrete-time hyperchaotic system and the amplitude control of Hopf bifurcation for a stochastic discrete-time hyperchaotic system are investigated in this paper. Numerical simulations are presented to exhibit the complex dynamical behaviors in the discrete-time hyperchaotic system. Furthermore, the stochastic discrete-time hyperchaotic system with random parameters is transformed into its equivalent deterministic system with the orthogonal polynomial theory of discrete random function. In addition, the dynamical features of the discrete-time hyperchaotic system with random disturbances are obtained through its equivalent deterministic system. By using the Hopf bifurcation conditions of the deterministic discrete-time system, the specific conditions for the existence of Hopf bifurcation in the equivalent deterministic system are derived. And the amplitude control with random intensity is discussed in detail. Finally, the feasibility of the control method is demonstrated by numerical simulations.

A two-component generalization of the reduced Ostrovsky equation and its integrable semi-discrete analogue

International Nuclear Information System (INIS)

Feng, Bao-Feng; Maruno, Ken-ichi; Ohta, Yasuhiro

2017-01-01

In the present paper, we propose a two-component generalization of the reduced Ostrovsky (Vakhnenko) equation, whose differential form can be viewed as the short-wave limit of a two-component Degasperis–Procesi (DP) equation. They are integrable due to the existence of Lax pairs. Moreover, we have shown that the two-component reduced Ostrovsky equation can be reduced from an extended BKP hierarchy with negative flow through a pseudo 3-reduction and a hodograph (reciprocal) transform. As a by-product, its bilinear form and N -soliton solution in terms of pfaffians are presented. One- and two-soliton solutions are provided and analyzed. In the second part of the paper, we start with a modified BKP hierarchy, which is a Bäcklund transformation of the above extended BKP hierarchy, an integrable semi-discrete analogue of the two-component reduced Ostrovsky equation is constructed by defining an appropriate discrete hodograph transform and dependent variable transformations. In particular, the backward difference form of above semi-discrete two-component reduced Ostrovsky equation gives rise to the integrable semi-discretization of the short wave limit of a two-component DP equation. Their N -soliton solutions in terms of pffafians are also provided. (paper)

Representations of classical groups on the lattice and its application to the field theory on discrete space-time

OpenAIRE

Lorente, M.

2003-01-01

We explore the mathematical consequences of the assumption of a discrete space-time. The fundamental laws of physics have to be translated into the language of discrete mathematics. We find integral transformations that leave the lattice of any dimension invariant and apply these transformations to field equations.

DOMINO, Coupling of Discrete Ordinate Program DOT with Monte-Carlo Program MORSE

International Nuclear Information System (INIS)

1974-01-01

1 - Nature of physical problem solved: DOMINO is a general purpose code for coupling discrete ordinates and Monte Carlo radiation transport calculations. 2 - Method of solution: DOMINO transforms the angular flux as a function of energy group, mesh interval and discrete angle into current and subsequently into normalized probability distributions. 3 - Restrictions on the complexity of the problem: The discrete ordinates calculation is limited to an r-z geometry

An optical Fourier transform coprocessor with direct phase determination.

Science.gov (United States)

Macfaden, Alexander J; Gordon, George S D; Wilkinson, Timothy D

2017-10-20

The Fourier transform is a ubiquitous mathematical operation which arises naturally in optics. We propose and demonstrate a practical method to optically evaluate a complex-to-complex discrete Fourier transform. By implementing the Fourier transform optically we can overcome the limiting O(nlogn) complexity of fast Fourier transform algorithms. Efficiently extracting the phase from the well-known optical Fourier transform is challenging. By appropriately decomposing the input and exploiting symmetries of the Fourier transform we are able to determine the phase directly from straightforward intensity measurements, creating an optical Fourier transform with O(n) apparent complexity. Performing larger optical Fourier transforms requires higher resolution spatial light modulators, but the execution time remains unchanged. This method could unlock the potential of the optical Fourier transform to permit 2D complex-to-complex discrete Fourier transforms with a performance that is currently untenable, with applications across information processing and computational physics.

Fourier transforms principles and applications

CERN Document Server

Hansen, Eric W

2014-01-01

Fourier Transforms: Principles and Applications explains transform methods and their applications to electrical systems from circuits, antennas, and signal processors-ably guiding readers from vector space concepts through the Discrete Fourier Transform (DFT), Fourier series, and Fourier transform to other related transform methods.  Featuring chapter end summaries of key results, over two hundred examples and four hundred homework problems, and a Solutions Manual this book is perfect for graduate students in signal processing and communications as well as practicing engineers.

Foundations of a discrete physics

International Nuclear Information System (INIS)

McGoveran, D.; Noyes, P.

1988-01-01

Starting from the principles of finiteness, discreteness, finite computability and absolute nonuniqueness, we develop the ordering operator calculus, a strictly constructive mathematical system having the empirical properties required by quantum mechanical and special relativistic phenomena. We show how to construct discrete distance functions, and both rectangular and spherical coordinate systems(with a discrete version of ''π''). The richest discrete space constructible without a preferred axis and preserving translational and rotational invariance is shown to be a discrete 3-space with the usual symmetries. We introduce a local ordering parameter with local (proper) time-like properties and universal ordering parameters with global (cosmological) time-like properties. Constructed ''attribute velocities'' connect ensembles with attributes that are invariant as the appropriate time-like parameter increases. For each such attribute, we show how to construct attribute velocities which must satisfy the '' relativistic Doppler shift'' and the ''relativistic velocity composition law,'' as well as the Lorentz transformations. By construction, these velocities have finite maximum and minimum values. In the space of all attributes, the minimum of these maximum velocities will predominate in all multiple attribute computations, and hence can be identified as a fundamental limiting velocity, General commutation relations are constructed which under the physical interpretation are shown to reduce to the usual quantum mechanical commutation relations. 50 refs., 18 figs

Discretization and Numerical Solution of a Plane Problem in the Mechanics of Interfacial Cracks

Science.gov (United States)

Khoroshun, L. P.

2017-01-01

The Fourier transform is used to reduce the linear plane problem of the tension of a body with an interfacial crack to a system of dual equations for the transformed stresses and, then, to a system of integro-differential equations for the difference of displacements of the crack faces. After discretization, this latter system transforms into a system of algebraic equations for displacements of the crack faces. The effect of the bielastic constant and the number of discretization points on the half-length of the crack faces and the distribution of stresses at the interface is studied

Discrete SLn-connections and self-adjoint difference operators on 2-dimensional manifolds

International Nuclear Information System (INIS)

Grinevich, P G; Novikov, S P

2013-01-01

The programme of discretization of famous completely integrable systems and associated linear operators was launched in the 1990s. In particular, the properties of second-order difference operators on triangulated manifolds and equilateral triangular lattices have been studied by Novikov and Dynnikov since 1996. This study included Laplace transformations, new discretizations of complex analysis, and new discretizations of GL n -connections on triangulated n-dimensional manifolds. A general theory of discrete GL n -connections 'of rank one' has been developed (see the Introduction for definitions). The problem of distinguishing the subclass of SL n -connections (and unimodular SL n ± -connections, which satisfy detA = ±1) has not been solved. In the present paper it is shown that these connections play an important role (which is similar to the role of magnetic fields in the continuous case) in the theory of self-adjoint Schrödinger difference operators on equilateral triangular lattices in ℝ 2 . In Appendix 1 a complete characterization is given of unimodular SL n ± -connections of rank 1 for all n > 1, thus correcting a mistake (it was wrongly claimed that they reduce to a canonical connection for n > 2). With the help of a communication from Korepanov, a complete clarification is provided of how the classical theory of electrical circuits and star-triangle transformations is connected with the discrete Laplace transformations on triangular lattices. Bibliography: 29 titles

Effect of cosine current approximation in lattice cell calculations in cylindrical geometry

International Nuclear Information System (INIS)

Mohanakrishnan, P.

1978-01-01

It is found that one-dimensional cylindrical geometry reactor lattice cell calculations using cosine angular current approximation at spatial mesh interfaces give results surprisingly close to the results of accurate neutron transport calculations as well as experimental measurements. This is especially true for tight light water moderated lattices. Reasons for this close agreement are investigated here. By re-examining the effects of reflective and white cell boundary conditions in these calculations it is concluded that one major reason is the use of white boundary condition necessitated by the approximation of the two-dimensional reactor lattice cell by a one-dimensional one. (orig.) [de

Analysis on Behaviour of Wavelet Coefficient during Fault Occurrence in Transformer

Science.gov (United States)

Sreewirote, Bancha; Ngaopitakkul, Atthapol

2018-03-01

The protection system for transformer has play significant role in avoiding severe damage to equipment when disturbance occur and ensure overall system reliability. One of the methodology that widely used in protection scheme and algorithm is discrete wavelet transform. However, characteristic of coefficient under fault condition must be analyzed to ensure its effectiveness. So, this paper proposed study and analysis on wavelet coefficient characteristic when fault occur in transformer in both high- and low-frequency component from discrete wavelet transform. The effect of internal and external fault on wavelet coefficient of both fault and normal phase has been taken into consideration. The fault signal has been simulate using transmission connected to transformer experimental setup on laboratory level that modelled after actual system. The result in term of wavelet coefficient shown a clearly differentiate between wavelet characteristic in both high and low frequency component that can be used to further design and improve detection and classification algorithm that based on discrete wavelet transform methodology in the future.

Data Compression by Shape Compensation for Mobile Video Sensors

Directory of Open Access Journals (Sweden)

Ben-Shung Chow

2009-04-01

Full Text Available Most security systems, with their transmission bandwidth and computing power both being sufficient, emphasize their automatic recognition techniques. However, in some situations such as baby monitors and intruder avoidance by mobile sensors, the decision function sometimes can be shifted to the concerned human to reduce the transmission and computation cost. We therefore propose a binary video compression method in low resolution to achieve a low cost mobile video communication for inexpensive camera sensors. Shape compensation as proposed in this communication successfully replaces the standard Discrete Cosine Transformation (DCT after motion compensation.

Radial artery pulse waveform analysis based on curve fitting using discrete Fourier series.

Science.gov (United States)

Jiang, Zhixing; Zhang, David; Lu, Guangming

2018-04-19

Radial artery pulse diagnosis has been playing an important role in traditional Chinese medicine (TCM). For its non-invasion and convenience, the pulse diagnosis has great significance in diseases analysis of modern medicine. The practitioners sense the pulse waveforms in patients' wrist to make diagnoses based on their non-objective personal experience. With the researches of pulse acquisition platforms and computerized analysis methods, the objective study on pulse diagnosis can help the TCM to keep up with the development of modern medicine. In this paper, we propose a new method to extract feature from pulse waveform based on discrete Fourier series (DFS). It regards the waveform as one kind of signal that consists of a series of sub-components represented by sine and cosine (SC) signals with different frequencies and amplitudes. After the pulse signals are collected and preprocessed, we fit the average waveform for each sample using discrete Fourier series by least squares. The feature vector is comprised by the coefficients of discrete Fourier series function. Compared with the fitting method using Gaussian mixture function, the fitting errors of proposed method are smaller, which indicate that our method can represent the original signal better. The classification performance of proposed feature is superior to the other features extracted from waveform, liking auto-regression model and Gaussian mixture model. The coefficients of optimized DFS function, who is used to fit the arterial pressure waveforms, can obtain better performance in modeling the waveforms and holds more potential information for distinguishing different psychological states. Copyright © 2018 Elsevier B.V. All rights reserved.

The continous Legendre transform, its inverse transform, and applications

Directory of Open Access Journals (Sweden)

P. L. Butzer

1980-01-01

Full Text Available This paper is concerned with the continuous Legendre transform, derived from the classical discrete Legendre transform by replacing the Legendre polynomial Pk(x by the function Pλ(x with λ real. Another approach to T.M. MacRobert's inversion formula is found; for this purpose an inverse Legendre transform, mapping L1(ℝ+ into L2(−1,1, is defined. Its inversion in turn is naturally achieved by the continuous Legendre transform. One application is devoted to the Shannon sampling theorem in the Legendre frame together with a new type of error estimate. The other deals with a new representation of Legendre functions giving information about their behaviour near the point x=−1.

Wavelet transforms as solutions of partial differential equations

Energy Technology Data Exchange (ETDEWEB)

Zweig, G.

1997-10-01

This is the final report of a three-year, Laboratory Directed Research and Development (LDRD) project at Los Alamos National Laboratory (LANL). Wavelet transforms are useful in representing transients whose time and frequency structure reflect the dynamics of an underlying physical system. Speech sound, pressure in turbulent fluid flow, or engine sound in automobiles are excellent candidates for wavelet analysis. This project focused on (1) methods for choosing the parent wavelet for a continuous wavelet transform in pattern recognition applications and (2) the more efficient computation of continuous wavelet transforms by understanding the relationship between discrete wavelet transforms and discretized continuous wavelet transforms. The most interesting result of this research is the finding that the generalized wave equation, on which the continuous wavelet transform is based, can be used to understand phenomena that relate to the process of hearing.

Comparison of Video Steganography Methods for Watermark Embedding

Directory of Open Access Journals (Sweden)

Griberman David

2016-05-01

Full Text Available The paper focuses on the comparison of video steganography methods for the purpose of digital watermarking in the context of copyright protection. Four embedding methods that use Discrete Cosine and Discrete Wavelet Transforms have been researched and compared based on their embedding efficiency and fidelity. A video steganography program has been developed in the Java programming language with all of the researched methods implemented for experiments. The experiments used 3 video containers with different amounts of movement. The impact of the movement has been addressed in the paper as well as the ways of potential improvement of embedding efficiency using adaptive embedding based on the movement amount. Results of the research have been verified using a survey with 17 participants.

Deviation from an inverse cosine dependence of kinetic secondary electron emission for angle of incidence at keV energy

International Nuclear Information System (INIS)

Ohya, Kaoru; Kawata, Jun; Mori, Ichiro

1989-01-01

Incident angle dependence of kinetic secondary electron emission from metals resulting from incidence of keV ions is investigated by computer simulation with the TRIM Monte Carlo program of ion scattering in matter. The results show large deviations from the inverse cosine dependence, which derives from high-energy approximation, because of a series of elastic collisions of incident ions with metal atoms. In the keV energy region, the elastic collisions have two different effects on the angular dependence for relatively high-energy light ions and for low-energy heavy ions: they result in over- and under-inverse-cosine dependences, respectively. The properties are observed even with an experiment of the keV-neutral incidence on a contaminated surface. In addition, the effects of the thin oxide layer and roughness on the surface are examined with simplified models. (author)

A novel JPEG steganography method based on modulus function with histogram analysis

Directory of Open Access Journals (Sweden)

V. Banoci

2012-06-01

Full Text Available In this paper, we present a novel steganographic method for embedding of secret data in still grayscale JPEG image. In order to provide large capacity of the proposed method while maintaining good visual quality of stego-image, the embedding process is performed in quantized transform coefficients of Discrete Cosine transform (DCT by modifying coefficients according to modulo function, what gives to the steganography system blind extraction predisposition. After-embedding histogram of proposed Modulo Histogram Fitting (MHF method is analyzed to secure steganography system against steganalysis attacks. In addition, AES ciphering was implemented to increase security and improve histogram after-embedding characteristics of proposed steganography system as experimental results show.

Empirical algorithm to estimate the average cosine of underwater light field at 490 nm

Digital Repository Service at National Institute of Oceanography (India)

Talaulikar, M.; Suresh, T.; Desa, E.; Matondkar, S.G.P.; Kumar, T.S.; Lotliker, A.; Inamdar, A.

optical properties from water color, a multi-band quasi-analytical algorithm for optically deep waters. Applied Optic, 41, pp. 5755– 5772. MCCORMIC, N. J., 1995, Mathematical models for the mean cosine of irradiance and the diffuse attenuation... parameter to determine μ(490) from the measured data and from the ocean color satellite data is discussed. Absorption coefficients of water derived using μ(490) were also evaluated comparing with the synthetic data and in-situ measured data from other...

Generation of heat on fuel rod in cosine pattern by using induction heating

International Nuclear Information System (INIS)

Keettikkal, Felix; Sajeesh, Divya; Rao, Poornima; Hande, Shashank; Dakave, Ganesh; Kute, Tushar; Mahajan, Akshay; Kulkarni, R.D.

2017-01-01

Fuel rods are used in a nuclear reactor for fission process. When these rods are cooled by water during the heat transfer, the temperature stress causes undesirable defects in the fuel rod. Studying these defects occurring in the fuel rod in the nuclear cluster during nuclear reaction is a difficult task because fission reaction makes it difficult to analyse the changes in the rod. Hence there is a need to use a replica of the rod with similar thermal stress to study and analyse the rod for the defects. Normally the heat generated on the fuel rod follows a cosine pattern which is an inherent characteristic inside a nuclear reactor. In view of this, in this paper induction heating method is used on a rod to create an exact replica of the cosine pattern of heat by varying the pitch of the coil. First, a MATLAB simulation is done using simulink. Then a prototype of the model has been developed comprising of carbon steel pipe, with length and outside diameter of 1 meter and 48.2 mm, respectively. Instead of using water as coolant, rod is simulated in air. Therefore, the heat generated is lost by normal convection and radiation. Non-nuclear testing can be a valuable tool in the development or in some kind of experiment using nuclear reactor. Induction heating becomes an alternative to classical heating technologies because of its advantages such as efficiency, quickness, safety, clean heating and accurate power control. (author)

An Efficient Method for Image and Audio Steganography using Least Significant Bit (LSB) Substitution

Science.gov (United States)

Chadha, Ankit; Satam, Neha; Sood, Rakshak; Bade, Dattatray

2013-09-01

In order to improve the data hiding in all types of multimedia data formats such as image and audio and to make hidden message imperceptible, a novel method for steganography is introduced in this paper. It is based on Least Significant Bit (LSB) manipulation and inclusion of redundant noise as secret key in the message. This method is applied to data hiding in images. For data hiding in audio, Discrete Cosine Transform (DCT) and Discrete Wavelet Transform (DWT) both are used. All the results displayed prove to be time-efficient and effective. Also the algorithm is tested for various numbers of bits. For those values of bits, Mean Square Error (MSE) and Peak-Signal-to-Noise-Ratio (PSNR) are calculated and plotted. Experimental results show that the stego-image is visually indistinguishable from the original cover-image when nsteganography process does not reveal presence of any hidden message, thus qualifying the criteria of imperceptible message.

Exploiting of the Compression Methods for Reconstruction of the Antenna Far-Field Using Only Amplitude Near-Field Measurements

Directory of Open Access Journals (Sweden)

J. Puskely

2010-06-01

Full Text Available The novel approach exploits the principle of the conventional two-plane amplitude measurements for the reconstruction of the unknown electric field distribution on the antenna aperture. The method combines a global optimization with a compression method. The global optimization method (GO is used to minimize the functional, and the compression method is used to reduce the number of unknown variables. The algorithm employs the Real Coded Genetic Algorithm (RCGA as the global optimization approach. The Discrete Cosine Transform (DCT and the Discrete Wavelet Transform (DWT are applied to reduce the number of unknown variables. Pros and cons of methods are investigated and reported for the solution of the problem. In order to make the algorithm faster, exploitation of amplitudes from a single scanning plane is also discussed. First, the algorithm is used to obtain an initial estimate. Subsequently, the common Fourier iterative algorithm is used to reach global minima with sufficient accuracy. The method is examined measuring the dish antenna.

Using the generalized Radon transform for detection of curves in noisy images

DEFF Research Database (Denmark)

Toft, Peter Aundal

1996-01-01

In this paper the discrete generalized Radon transform will be investigated as a tool for detection of curves in noisy digital images. The discrete generalized Radon transform maps an image into a parameter domain, where curves following a specific parameterized curve form will correspond to a peak...

On Fourier re-expansions

OpenAIRE

Liflyand, E.

2012-01-01

We study an extension to Fourier transforms of the old problem on absolute convergence of the re-expansion in the sine (cosine) Fourier series of an absolutely convergent cosine (sine) Fourier series. The results are obtained by revealing certain relations between the Fourier transforms and their Hilbert transforms.

High-order modulation on a single discrete eigenvalue for optical communications based on nonlinear Fourier transform.

Science.gov (United States)

Gui, Tao; Lu, Chao; Lau, Alan Pak Tao; Wai, P K A

2017-08-21

In this paper, we experimentally investigate high-order modulation over a single discrete eigenvalue under the nonlinear Fourier transform (NFT) framework and exploit all degrees of freedom for encoding information. For a fixed eigenvalue, we compare different 4 bit/symbol modulation formats on the spectral amplitude and show that a 2-ring 16-APSK constellation achieves optimal performance. We then study joint spectral phase, spectral magnitude and eigenvalue modulation and found that while modulation on the real part of the eigenvalue induces pulse timing drift and leads to neighboring pulse interactions and nonlinear inter-symbol interference (ISI), it is more bandwidth efficient than modulation on the imaginary part of the eigenvalue in practical settings. We propose a spectral amplitude scaling method to mitigate such nonlinear ISI and demonstrate a record 4 GBaud 16-APSK on the spectral amplitude plus 2-bit eigenvalue modulation (total 6 bit/symbol at 24 Gb/s) transmission over 1000 km.

Simultaneous storage of medical images in the spatial and frequency domain: A comparative study

Directory of Open Access Journals (Sweden)

Acharya U Rajendra

2004-06-01

Full Text Available Abstract Background Digital watermarking is a technique of hiding specific identification data for copyright authentication. This technique is adapted here for interleaving patient information with medical images, to reduce storage and transmission overheads. Methods The patient information is encrypted before interleaving with images to ensure greater security. The bio-signals are compressed and subsequently interleaved with the image. This interleaving is carried out in the spatial domain and Frequency domain. The performance of interleaving in the spatial, Discrete Fourier Transform (DFT, Discrete Cosine Transform (DCT and Discrete Wavelet Transform (DWT coefficients is studied. Differential pulse code modulation (DPCM is employed for data compression as well as encryption and results are tabulated for a specific example. Results It can be seen from results, the process does not affect the picture quality. This is attributed to the fact that the change in LSB of a pixel changes its brightness by 1 part in 256. Spatial and DFT domain interleaving gave very less %NRMSE as compared to DCT and DWT domain. Conclusion The Results show that spatial domain the interleaving, the %NRMSE was less than 0.25% for 8-bit encoded pixel intensity. Among the frequency domain interleaving methods, DFT was found to be very efficient.

The transformation techniques in path integration

International Nuclear Information System (INIS)

Inomata, A.

1989-01-01

In this paper general remarks are made concerning the time transformation techniques in path integration and their implementations. Time transformations may be divided into two classes: global (integrable) time transformations and local (nonintegrable) time transformations. Although a brief account of global time transformations is given, attention is focused on local transformations. First, time transformations in the classical Kepler problem are reviewed. Then, problems encountered in implementing a local time transformation in quantum mechanics are analyzed. A several propositions pertinent to the implementation of local time transformations, particularly basic to the local time rescaling trick in a discretized path integral, are presented

Hyperbolic Cosines and Sines Theorems for the Triangle Formed by Arcs of Intersecting Semicircles on Euclidean Plane

Directory of Open Access Journals (Sweden)

Robert M. Yamaleev

2013-01-01

Full Text Available The hyperbolic cosines and sines theorems for the curvilinear triangle bounded by circular arcs of three intersecting circles are formulated and proved by using the general complex calculus. The method is based on a key formula establishing a relationship between exponential function and the cross-ratio. The proofs are carried out on Euclidean plane.

Secure Hashing of Dynamic Hand Signatures Using Wavelet-Fourier Compression with BioPhasor Mixing and Discretization

Directory of Open Access Journals (Sweden)

Wai Kuan Yip

2007-01-01

Full Text Available We introduce a novel method for secure computation of biometric hash on dynamic hand signatures using BioPhasor mixing and discretization. The use of BioPhasor as the mixing process provides a one-way transformation that precludes exact recovery of the biometric vector from compromised hashes and stolen tokens. In addition, our user-specific discretization acts both as an error correction step as well as a real-to-binary space converter. We also propose a new method of extracting compressed representation of dynamic hand signatures using discrete wavelet transform (DWT and discrete fourier transform (DFT. Without the conventional use of dynamic time warping, the proposed method avoids storage of user's hand signature template. This is an important consideration for protecting the privacy of the biometric owner. Our results show that the proposed method could produce stable and distinguishable bit strings with equal error rates (EERs of and for random and skilled forgeries for stolen token (worst case scenario, and for both forgeries in the genuine token (optimal scenario.

Discrete Routh reduction

International Nuclear Information System (INIS)

Jalnapurkar, Sameer M; Leok, Melvin; Marsden, Jerrold E; West, Matthew

2006-01-01

This paper develops the theory of Abelian Routh reduction for discrete mechanical systems and applies it to the variational integration of mechanical systems with Abelian symmetry. The reduction of variational Runge-Kutta discretizations is considered, as well as the extent to which symmetry reduction and discretization commute. These reduced methods allow the direct simulation of dynamical features such as relative equilibria and relative periodic orbits that can be obscured or difficult to identify in the unreduced dynamics. The methods are demonstrated for the dynamics of an Earth orbiting satellite with a non-spherical J 2 correction, as well as the double spherical pendulum. The J 2 problem is interesting because in the unreduced picture, geometric phases inherent in the model and those due to numerical discretization can be hard to distinguish, but this issue does not appear in the reduced algorithm, where one can directly observe interesting dynamical structures in the reduced phase space (the cotangent bundle of shape space), in which the geometric phases have been removed. The main feature of the double spherical pendulum example is that it has a non-trivial magnetic term in its reduced symplectic form. Our method is still efficient as it can directly handle the essential non-canonical nature of the symplectic structure. In contrast, a traditional symplectic method for canonical systems could require repeated coordinate changes if one is evoking Darboux' theorem to transform the symplectic structure into canonical form, thereby incurring additional computational cost. Our method allows one to design reduced symplectic integrators in a natural way, despite the non-canonical nature of the symplectic structure

Darboux–Bäcklund transformations, dressing & impurities in multi-component NLS

Energy Technology Data Exchange (ETDEWEB)

Adamopoulou, Panagiota, E-mail: p.adamopoulou@hw.ac.uk [Department of Mathematics, Heriot-Watt University, Edinburgh EH14 4AS (United Kingdom); Doikou, Anastasia, E-mail: a.doikou@hw.ac.uk [Department of Mathematics, Heriot-Watt University, Edinburgh EH14 4AS (United Kingdom); Papamikos, Georgios, E-mail: g.papamikos@reading.ac.uk [Department of Mathematics and Statistics, University of Reading, Reading RG6 6AX (United Kingdom)

2017-05-15

We consider the discrete and continuous vector non-linear Schrödinger (NLS) model. We focus on the case where space-like local discontinuities are present, and we are primarily interested in the time evolution on the defect point. This in turn yields the time part of a typical Darboux–Bäcklund transformation. Within this spirit we then explicitly work out the generic Bäcklund transformation and the dressing associated to both discrete and continuous spectrum, i.e. the Darboux transformation is expressed in the matrix and integral representation respectively.

Darboux–Bäcklund transformations, dressing & impurities in multi-component NLS

International Nuclear Information System (INIS)

Adamopoulou, Panagiota; Doikou, Anastasia; Papamikos, Georgios

2017-01-01

We consider the discrete and continuous vector non-linear Schrödinger (NLS) model. We focus on the case where space-like local discontinuities are present, and we are primarily interested in the time evolution on the defect point. This in turn yields the time part of a typical Darboux–Bäcklund transformation. Within this spirit we then explicitly work out the generic Bäcklund transformation and the dressing associated to both discrete and continuous spectrum, i.e. the Darboux transformation is expressed in the matrix and integral representation respectively.

Nonautonomous discrete bright soliton solutions and interaction management for the Ablowitz-Ladik equation.

Science.gov (United States)

Yu, Fajun

2015-03-01

We present the nonautonomous discrete bright soliton solutions and their interactions in the discrete Ablowitz-Ladik (DAL) equation with variable coefficients, which possesses complicated wave propagation in time and differs from the usual bright soliton waves. The differential-difference similarity transformation allows us to relate the discrete bright soliton solutions of the inhomogeneous DAL equation to the solutions of the homogeneous DAL equation. Propagation and interaction behaviors of the nonautonomous discrete solitons are analyzed through the one- and two-soliton solutions. We study the discrete snaking behaviors, parabolic behaviors, and interaction behaviors of the discrete solitons. In addition, the interaction management with free functions and dynamic behaviors of these solutions is investigated analytically, which have certain applications in electrical and optical systems.

A Fourier transform method for Vsin i estimations under nonlinear Limb-Darkening laws

Energy Technology Data Exchange (ETDEWEB)

Levenhagen, R. S., E-mail: ronaldo.levenhagen@gmail.com [Universidade Federal de São Paulo, Depto. Ciências Exatas e da Terra, Rua Prof. Arthur Riedel, 275, Jd. Eldorado, CEP 09972-270 Diadema, SP (Brazil)

2014-12-10

Star rotation offers us a large horizon for the study of many important physical issues pertaining to stellar evolution. Currently, four methods are widely used to infer rotation velocities, namely those related to line width calibrations, on the fitting of synthetic spectra, interferometry, and on Fourier transforms (FTs) of line profiles. Almost all of the estimations of stellar projected rotation velocities using the Fourier method in the literature have been addressed with the use of linear limb-darkening (LD) approximations during the evaluation of rotation profiles and their cosine FTs, which in certain cases, lead to discrepant velocity estimates. In this work, we introduce new mathematical expressions of rotation profiles and their Fourier cosine transforms assuming three nonlinear LD laws—quadratic, square-root, and logarithmic—and study their applications with and without gravity-darkening (GD) and geometrical flattening (GF) effects. Through an analysis of He I models in the visible range accounting for both limb and GD, we find out that, for classical models without rotationally driven effects, all the Vsin i values are too close to each other. On the other hand, taking into account GD and GF, the Vsin i obtained with the linear law result in Vsin i values that are systematically smaller than those obtained with the other laws. As a rule of thumb, we apply these expressions to the FT method to evaluate the projected rotation velocity of the emission B-type star Achernar (α Eri).

Discrete gradients in discrete classical mechanics

International Nuclear Information System (INIS)

Renna, L.

1987-01-01

A simple model of discrete classical mechanics is given where, starting from the continuous Hamilton equations, discrete equations of motion are established together with a proper discrete gradient definition. The conservation laws of the total discrete momentum, angular momentum, and energy are demonstrated

Second rank direction cosine spherical tensor operators and the nuclear electric quadrupole hyperfine structure Hamiltonian of rotating molecules

Science.gov (United States)

di Lauro, C.

2018-03-01

Transformations of vector or tensor properties from a space-fixed to a molecule-fixed axis system are often required in the study of rotating molecules. Spherical components λμ,ν of a first rank irreducible tensor can be obtained from the direction cosines between the two axis systems, and a second rank tensor with spherical components λμ,ν(2) can be built from the direct product λ × λ. It is shown that the treatment of the interaction between molecular rotation and the electric quadrupole of a nucleus is greatly simplified, if the coefficients in the axis-system transformation of the gradient of the electric field of the outer charges at the coupled nucleus are arranged as spherical components λμ,ν(2). Then the reduced matrix elements of the field gradient operators in a symmetric top eigenfunction basis, including their dependence on the molecule-fixed z-angular momentum component k, can be determined from the knowledge of those of λ(2) . The hyperfine structure Hamiltonian Hq is expressed as the sum of terms characterized each by a value of the molecule-fixed index ν, whose matrix elements obey the rule Δk = ν. Some of these terms may vanish because of molecular symmetry, and the specific cases of linear and symmetric top molecules, orthorhombic molecules, and molecules with symmetry lower than orthorhombic are considered. Each ν-term consists of a contraction of the rotational tensor λ(2) and the nuclear quadrupole tensor in the space-fixed frame, and its matrix elements in the rotation-nuclear spin coupled representation can be determined by the standard spherical tensor methods.

Family of columns isospectral to gravity-loaded columns with tip force: A discrete approach

Science.gov (United States)

Ramachandran, Nirmal; Ganguli, Ranjan

2018-06-01

A discrete model is introduced to analyze transverse vibration of straight, clamped-free (CF) columns of variable cross-sectional geometry under the influence of gravity and a constant axial force at the tip. The discrete model is used to determine critical combinations of loading parameters - a gravity parameter and a tip force parameter - that cause onset of dynamic instability in the CF column. A methodology, based on matrix-factorization, is described to transform the discrete model into a family of models corresponding to weightless and unloaded clamped-free (WUCF) columns, each with a transverse vibration spectrum isospectral to the original model. Characteristics of models in this isospectral family are dependent on three transformation parameters. A procedure is discussed to convert the isospectral discrete model description into geometric description of realistic columns i.e. from the discrete model, we construct isospectral WUCF columns with rectangular cross-sections varying in width and depth. As part of numerical studies to demonstrate efficacy of techniques presented, frequency parameters of a uniform column and three types of tapered CF columns under different combinations of loading parameters are obtained from the discrete model. Critical combinations of these parameters for a typical tapered column are derived. These results match with published results. Example CF columns, under arbitrarily-chosen combinations of loading parameters are considered and for each combination, isospectral WUCF columns are constructed. Role of transformation parameters in determining characteristics of isospectral columns is discussed and optimum values are deduced. Natural frequencies of these WUCF columns computed using Finite Element Method (FEM) match well with those of the given gravity-loaded CF column with tip force, hence confirming isospectrality.

Recursive Pyramid Algorithm-Based Discrete Wavelet Transform for Reactive Power Measurement in Smart Meters

Directory of Open Access Journals (Sweden)

Mahin K. Atiq

2013-09-01

Full Text Available Measurement of the active, reactive, and apparent power is one of the most fundamental tasks of smart meters in energy systems. Recently, a number of studies have employed the discrete wavelet transform (DWT for power measurement in smart meters. The most common way to implement DWT is the pyramid algorithm; however, this is not feasible for practical DWT computation because it requires either a log N cascaded filter or O (N word size memory storage for an input signal of the N-point. Both solutions are too expensive for practical applications of smart meters. It is proposed that the recursive pyramid algorithm is more suitable for smart meter implementation because it requires only word size storage of L × Log (N-L, where L is the length of filter. We also investigated the effect of varying different system parameters, such as the sampling rate, dc offset, phase offset, linearity error in current and voltage sensors, analog to digital converter resolution, and number of harmonics in a non-sinusoidal system, on the reactive energy measurement using DWT. The error analysis is depicted in the form of the absolute difference between the measured and the true value of the reactive energy.

A Framework of Secured Embedding Scheme Using Vector Discrete Wavelet Transformation and Lagrange Interpolation

Directory of Open Access Journals (Sweden)

Maheswari Subramanian

2018-01-01

Full Text Available Information hiding techniques have a significant role in recent application areas. Steganography is the embedding of information within an innocent cover work in a way which cannot be detected by any person without accessing the steganographic key. The proposed work uses a steganographic scheme for useful information with the help of human skin tone regions as cover image. The proposed algorithm has undergone Lagrange interpolation encryption for enhancement of the security of the hidden information. First, the skin tone regions are identified by using YCbCr color space which can be used as a cover image. Image pixels which belong to the skin regions are used to carry more secret bits, and the secret information is hidden in both horizontal and vertical sequences of the skin areas of the cover image. The secret information will hide behind the human skin regions rather than other objects in the same image because the skin pixels have high intensity value. The performance of embedding is done and is quite invisible by the vector discrete wavelet transformation (VDWT technique. A new Lagrange interpolation-based encryption method is introduced to achieve high security of the hidden information with higher payload and better visual quality.

Generalized differential transform method to differential-difference equation

International Nuclear Information System (INIS)

Zou Li; Wang Zhen; Zong Zhi

2009-01-01

In this Letter, we generalize the differential transform method to solve differential-difference equation for the first time. Two simple but typical examples are applied to illustrate the validity and the great potential of the generalized differential transform method in solving differential-difference equation. A Pade technique is also introduced and combined with GDTM in aim of extending the convergence area of presented series solutions. Comparisons are made between the results of the proposed method and exact solutions. Then we apply the differential transform method to the discrete KdV equation and the discrete mKdV equation, and successfully obtain solitary wave solutions. The results reveal that the proposed method is very effective and simple. We should point out that generalized differential transform method is also easy to be applied to other nonlinear differential-difference equation.

Data compression with applications to digital radiology

International Nuclear Information System (INIS)

Elnahas, S.E.

1985-01-01

The structure of arithmetic codes is defined in terms of source parsing trees. The theoretical derivations of algorithms for the construction of optimal and sub-optimal structures are presented. The software simulation results demonstrate how arithmetic coding out performs variable-length to variable-length coding. Linear predictive coding is presented for the compression of digital diagnostic images from several imaging modalities including computed tomography, nuclear medicine, ultrasound, and magnetic resonance imaging. The problem of designing optimal predictors is formulated and alternative solutions are discussed. The results indicate that noiseless compression factors between 1.7 and 7.4 can be achieved. With nonlinear predictive coding, noisy and noiseless compression techniques are combined in a novel way that may have a potential impact on picture archiving and communication systems in radiology. Adaptive fast discrete cosine transform coding systems are used as nonlinear block predictors, and optimal delta modulation systems are used as nonlinear sequential predictors. The off-line storage requirements for archiving diagnostic images are reasonably reduced by the nonlinear block predictive coding. The online performance, however, seems to be bounded by that of the linear systems. The subjective quality of image imperfect reproductions from the cosine transform coding is promising and prompts future research on the compression of diagnostic images by transform coding systems and the clinical evaluation of these systems

An compression algorithm for medical images and a display with the decoding function

International Nuclear Information System (INIS)

Gotoh, Toshiyuki; Nakagawa, Yukihiro; Shiohara, Morito; Yoshida, Masumi

1990-01-01

This paper describes and efficient image compression method for medical images, a high-speed display with the decoding function. In our method, an input image is divided into blocks, and either of Discrete Cosine Transform coding (DCT) or Block Truncation Coding (BTC) is adaptively applied on each block to improve image quality. The display, we developed, receives the compressed data from the host computer and reconstruct images of good quality at high speed using four decoding microprocessors on which our algorithm is implemented in pipeline. By the experiments, our method and display were verified to be effective. (author)

Convergence of discrete Aubry–Mather model in the continuous limit

Science.gov (United States)

Su, Xifeng; Thieullen, Philippe

2018-05-01

We develop two approximation schemes for solving the cell equation and the discounted cell equation using Aubry–Mather–Fathi theory. The Hamiltonian is supposed to be Tonelli, time-independent and periodic in space. By Legendre transform it is equivalent to find a fixed point of some nonlinear operator, called Lax-Oleinik operator, which may be discounted or not. By discretizing in time, we are led to solve an additive eigenvalue problem involving a discrete Lax–Oleinik operator. We show how to approximate the effective Hamiltonian and some weak KAM solutions by letting the time step in the discrete model tend to zero. We also obtain a selected discrete weak KAM solution as in Davini et al (2016 Invent. Math. 206 29–55), and show that it converges to a particular solution of the cell equation. In order to unify the two settings, continuous and discrete, we develop a more general formalism of the short-range interactions.

Accurate artificial boundary conditions for the semi-discretized linear Schrödinger and heat equations on rectangular domains

Science.gov (United States)

Ji, Songsong; Yang, Yibo; Pang, Gang; Antoine, Xavier

2018-01-01

The aim of this paper is to design some accurate artificial boundary conditions for the semi-discretized linear Schrödinger and heat equations in rectangular domains. The Laplace transform in time and discrete Fourier transform in space are applied to get Green's functions of the semi-discretized equations in unbounded domains with single-source. An algorithm is given to compute these Green's functions accurately through some recurrence relations. Furthermore, the finite-difference method is used to discretize the reduced problem with accurate boundary conditions. Numerical simulations are presented to illustrate the accuracy of our method in the case of the linear Schrödinger and heat equations. It is shown that the reflection at the corners is correctly eliminated.

Discrete mKdV and discrete sine-Gordon flows on discrete space curves

International Nuclear Information System (INIS)

Inoguchi, Jun-ichi; Kajiwara, Kenji; Matsuura, Nozomu; Ohta, Yasuhiro

2014-01-01

In this paper, we consider the discrete deformation of the discrete space curves with constant torsion described by the discrete mKdV or the discrete sine-Gordon equations, and show that it is formulated as the torsion-preserving equidistant deformation on the osculating plane which satisfies the isoperimetric condition. The curve is reconstructed from the deformation data by using the Sym–Tafel formula. The isoperimetric equidistant deformation of the space curves does not preserve the torsion in general. However, it is possible to construct the torsion-preserving deformation by tuning the deformation parameters. Further, it is also possible to make an arbitrary choice of the deformation described by the discrete mKdV equation or by the discrete sine-Gordon equation at each step. We finally show that the discrete deformation of discrete space curves yields the discrete K-surfaces. (paper)

Exact Solution of Gas Dynamics Equations Through Reduced Differential Transform and Sumudu Transform Linked with Pades Approximants

Science.gov (United States)

Rao, T. R. Ramesh

2018-04-01

In this paper, we study the analytical method based on reduced differential transform method coupled with sumudu transform through Pades approximants. The proposed method may be considered as alternative approach for finding exact solution of Gas dynamics equation in an effective manner. This method does not require any discretization, linearization and perturbation.

Discrete Curvatures and Discrete Minimal Surfaces

KAUST Repository

Sun, Xiang

2012-06-01

This thesis presents an overview of some approaches to compute Gaussian and mean curvature on discrete surfaces and discusses discrete minimal surfaces. The variety of applications of differential geometry in visualization and shape design leads to great interest in studying discrete surfaces. With the rich smooth surface theory in hand, one would hope that this elegant theory can still be applied to the discrete counter part. Such a generalization, however, is not always successful. While discrete surfaces have the advantage of being finite dimensional, thus easier to treat, their geometric properties such as curvatures are not well defined in the classical sense. Furthermore, the powerful calculus tool can hardly be applied. The methods in this thesis, including angular defect formula, cotangent formula, parallel meshes, relative geometry etc. are approaches based on offset meshes or generalized offset meshes. As an important application, we discuss discrete minimal surfaces and discrete Koenigs meshes.

Study and application of microscopic depletion model in core simulator of COSINE project

International Nuclear Information System (INIS)

Hu Xiaoyu; Wang Su; Yan Yuhang; Liu Zhanquan; Chen Yixue; Huang Kai

2013-01-01

Microscopic depletion correction is one of the commonly used techniques that could improve the historical effect and attain higher precision of diffusion calculation and alleviate the inaccuracy caused by historical effect. Core simulator of COSINE project (core and system integrated engine for design and analysis) has developed a hybrid macroscopic-microscopic depletion model to track important isotopes during each depletion history and correct the macro cross sections. The basic theory was discussed in this paper. The effect and results of microscopic depletion correction were also analyzed. The preliminary test results demonstrate that the microscopic depletion model is effective and practicable for improving the precision of core calculation. (authors)

Discrete symmetries and the complex structure of Calabi-Yau manifolds

International Nuclear Information System (INIS)

Ross, G.G.

1988-01-01

We show how the discrete symmetries, which may be present after Calabi-Yau compactification for specific choices of the complex structure, extend to the h 2,1 moduli - the scalar fields whose vacuum expectation values determine the complex structure. This allows us to determine much about the coupling of the moduli and hence the energetically favoured complex structure. The discrete symmetry transformation properties of the moduli are worked out in detail for a three-generation Calabi-Yau model and it is shown how minimization of the effective potential involving these fields selects the complex structure which leaves unbroken a set of discrete symmetries. The phenomenological implications of the symmetries are briefly discussed. (orig.)

Auto-Bäcklund transformations for a differential-delay equation

Science.gov (United States)

Gordoa, Pilar R.; Pickering, Andrew

2013-03-01

Discrete Painlevé equations have, over recent years, generated much interest. One property of such equations that is considered to be particularly important is the existence of auto-Bäcklund transformations, that is, mappings between solutions of the equation in question, usually involving changes in the values of parameters appearing as coefficients. We have recently presented extensions of discrete Painlevé equations to equations involving derivatives as well as shifts in the independent variable. Here we show how auto-Bäcklund transformations can also be constructed for such differential-delay equations. We emphasise that this is the first time that an auto-Bäcklund transformation has been given for a differential-delay equation.

Data-Driven Process Discovery: A Discrete Time Algebra for Relational Signal Analysis

National Research Council Canada - National Science Library

Conrad, David

1996-01-01

.... Proposed is a time series transformation that encodes and compresses real-valued data into a well defined, discrete-space of 13 primitive elements where comparative evaluation between variables...

Parallel Fast Legendre Transform

NARCIS (Netherlands)

Alves de Inda, M.; Bisseling, R.H.; Maslen, D.K.

1998-01-01

We discuss a parallel implementation of a fast algorithm for the discrete polynomial Legendre transform We give an introduction to the DriscollHealy algorithm using polynomial arithmetic and present experimental results on the eciency and accuracy of our implementation The algorithms were

The De-Noising of Sonic Echo Test Data through Wavelet Transform Reconstruction

Directory of Open Access Journals (Sweden)

J.N. Watson

1999-01-01

Full Text Available This paper presents the results of feasibility study into the application of the wavelet transform signal processing method to sonic based non-destructive testing techniques. Finite element generated data from cast in situ foundation piles were collated and processed using both continuous and discrete wavelet transform techniques. Results were compared with conventional Fourier based methods. The discrete Daubechies wavelets and the continuous Mexican hat wavelet were used and their relative merits investigated. It was found that both the continuous Mexican hat and discrete Daubechies D8 wavelets were significantly better at locating the pile toe compared than the Fourier filtered case. The wavelet transform method was then applied to field test data and found to be successful in facilitating the detection of the pile toe.

Fast and Scalable Computation of the Forward and Inverse Discrete Periodic Radon Transform.

Science.gov (United States)

Carranza, Cesar; Llamocca, Daniel; Pattichis, Marios

2016-01-01

The discrete periodic radon transform (DPRT) has extensively been used in applications that involve image reconstructions from projections. Beyond classic applications, the DPRT can also be used to compute fast convolutions that avoids the use of floating-point arithmetic associated with the use of the fast Fourier transform. Unfortunately, the use of the DPRT has been limited by the need to compute a large number of additions and the need for a large number of memory accesses. This paper introduces a fast and scalable approach for computing the forward and inverse DPRT that is based on the use of: a parallel array of fixed-point adder trees; circular shift registers to remove the need for accessing external memory components when selecting the input data for the adder trees; an image block-based approach to DPRT computation that can fit the proposed architecture to available resources; and fast transpositions that are computed in one or a few clock cycles that do not depend on the size of the input image. As a result, for an N × N image (N prime), the proposed approach can compute up to N(2) additions per clock cycle. Compared with the previous approaches, the scalable approach provides the fastest known implementations for different amounts of computational resources. For example, for a 251×251 image, for approximately 25% fewer flip-flops than required for a systolic implementation, we have that the scalable DPRT is computed 36 times faster. For the fastest case, we introduce optimized just 2N + ⌈log(2) N⌉ + 1 and 2N + 3 ⌈log(2) N⌉ + B + 2 cycles, architectures that can compute the DPRT and its inverse in respectively, where B is the number of bits used to represent each input pixel. On the other hand, the scalable DPRT approach requires more 1-b additions than for the systolic implementation and provides a tradeoff between speed and additional 1-b additions. All of the proposed DPRT architectures were implemented in VHSIC Hardware Description Language

Quasicanonical structure of optimal control in constrained discrete systems

Science.gov (United States)

Sieniutycz, S.

2003-06-01

This paper considers discrete processes governed by difference rather than differential equations for the state transformation. The basic question asked is if and when Hamiltonian canonical structures are possible in optimal discrete systems. Considering constrained discrete control, general optimization algorithms are derived that constitute suitable theoretical and computational tools when evaluating extremum properties of constrained physical models. The mathematical basis of the general theory is the Bellman method of dynamic programming (DP) and its extension in the form of the so-called Carathéodory-Boltyanski (CB) stage criterion which allows a variation of the terminal state that is otherwise fixed in the Bellman's method. Two relatively unknown, powerful optimization algorithms are obtained: an unconventional discrete formalism of optimization based on a Hamiltonian for multistage systems with unconstrained intervals of holdup time, and the time interval constrained extension of the formalism. These results are general; namely, one arrives at: the discrete canonical Hamilton equations, maximum principles, and (at the continuous limit of processes with free intervals of time) the classical Hamilton-Jacobi theory along with all basic results of variational calculus. Vast spectrum of applications of the theory is briefly discussed.

A reversible transform for seismic data processing

International Nuclear Information System (INIS)

Burnett, William A; Ferguson, Robert J

2011-01-01

We use the nonstationary equivalent of the Fourier shift theorem to derive a general one-dimensional integral transform for the application and removal of certain seismic data processing steps. This transform comes from the observation that many seismic data processing steps can be viewed as nonstationary shifts. The continuous form of the transform is exactly reversible, and the discrete form provides a general framework for unitary and pseudounitary imaging operators. Any processing step which can be viewed as a nonstationary shift in any domain is a special case of this transform. Nonstationary shifts generally produce coordinate distortions between input and output domains, and those that preserve amplitudes do not conserve the energy of the input signal. The nonstationary frequency distortions, time distortions and nonphysical energy changes inherent to such operations are predicted and quantified by this transform. Processing steps of this type are conventionally implemented using interpolation operators to map discrete data values between input and output coordinate frames. Although not explicitly derived to perform interpolation, the transform here assumes the Fourier basis to predict values of the input signal between sampling locations. We demonstrate how interpolants commonly used in seismic data processing and imaging approximate the proposed method. We find that our transform is equivalent to the conventional sinc interpolant with no truncation. Once the transform is developed, we demonstrate its numerical implementation by matrix–vector multiplication. As an example, we use our transform to apply and remove normal moveout

Optical chirp z-transform processor with a simplified architecture.

Science.gov (United States)

Ngo, Nam Quoc

2014-12-29

Using a simplified chirp z-transform (CZT) algorithm based on the discrete-time convolution method, this paper presents the synthesis of a simplified architecture of a reconfigurable optical chirp z-transform (OCZT) processor based on the silica-based planar lightwave circuit (PLC) technology. In the simplified architecture of the reconfigurable OCZT, the required number of optical components is small and there are no waveguide crossings which make fabrication easy. The design of a novel type of optical discrete Fourier transform (ODFT) processor as a special case of the synthesized OCZT is then presented to demonstrate its effectiveness. The designed ODFT can be potentially used as an optical demultiplexer at the receiver of an optical fiber orthogonal frequency division multiplexing (OFDM) transmission system.

Special relativity with a discrete spectrum of singular velocities

International Nuclear Information System (INIS)

Gonzales Gascon, F.

1977-01-01

The introduction of real transformation formulae containing a whole discrete spectrum of singularities is suggested. Some phenomenological hypotheses are introduced and the group property is substituted by weaker conditions. The first singular speed (c 1 =c) is invariant with respect to the measures of it from subluminal frames, but the remaining speeds are not invariant. The proposed transformations do not form a closed set (for the superluminal speeds) and, therefore, the problem of having (within this framework) a principle of relativity valid for any velocity remains open

Study on time-varying velocity measurement with self-mixing laser diode based on Discrete Chirp-Fourier Transform

International Nuclear Information System (INIS)

Zhang Zhaoyun; Gao Yang; Zhao Xinghai; Zhao Xiang

2011-01-01

Laser's optical output power and frequency are modulated when the optical beam is back-scattered into the active cavity of the laser. By signal processing, the Doppler frequency can be acquired, and the target's velocity can be calculated. Based on these properties, an interferometry velocity sensor can be designed. When target move in time-varying velocity mode, it is difficult to extract the target's velocity. Time-varying velocity measurement by self-mixing laser diode is explored. A mathematics model was proposed for the time-varying velocity (invariable acceleration) measurement by self-mixing laser diode. Based on this model, a Discrete Chirp-Fourier Transform (DCFT) method was applied, DCFT is analogous to DFT. We show that when the signal length N is prime, the magnitudes of all the side lobes are 1, whereas the magnitudes of the main lobe is √N, And the coordinates of the main lobe shows the target's velocity and acceleration information. The simulation results prove the validity of the algorithm even in the situation of low SNR when N is prime.

The Implementation of Cosine Similarity to Calculate Text Relevance between Two Documents

Science.gov (United States)

Gunawan, D.; Sembiring, C. A.; Budiman, M. A.

2018-03-01

Rapidly increasing number of web pages or documents leads to topic specific filtering in order to find web pages or documents efficiently. This is a preliminary research that uses cosine similarity to implement text relevance in order to find topic specific document. This research is divided into three parts. The first part is text-preprocessing. In this part, the punctuation in a document will be removed, then convert the document to lower case, implement stop word removal and then extracting the root word by using Porter Stemming algorithm. The second part is keywords weighting. Keyword weighting will be used by the next part, the text relevance calculation. Text relevance calculation will result the value between 0 and 1. The closer value to 1, then both documents are more related, vice versa.

Classical integrable defects as quasi Bäcklund transformations

Energy Technology Data Exchange (ETDEWEB)

Doikou, Anastasia, E-mail: a.doikou@hw.ac.uk

2016-10-15

We consider the algebraic setting of classical defects in discrete and continuous integrable theories. We derive the “equations of motion” on the defect point via the space-like and time-like description. We then exploit the structural similarity of these equations with the discrete and continuous Bäcklund transformations. And although these equations are similar they are not exactly the same to the Bäcklund transformations. We also consider specific examples of integrable models to demonstrate our construction, i.e. the Toda chain and the sine-Gordon model. The equations of the time (space) evolution of the defect (discontinuity) degrees of freedom for these models are explicitly derived.

Pipeline Analyzer using the Fractional Fourier Transform for Engine Control and Satellites Data

Directory of Open Access Journals (Sweden)

Darian M. Onchiș

2011-09-01

Full Text Available The aim of this paper is to present an algorithm for computing the fractional Fourier transform integrated into the pipeline of processing multi-variate and distributed data recorded by the engine control unit (ECU of a car and its satellites. The role of this transform is vital in establishing a time-variant filter and therefore it must be computed in a fast way. But for large scale time series, the application of the discrete fractional Fourier transform involves the computations of a large number of Hermite polynomials of increasingly order. The parallel algorithm presented will optimally compute the discrete Fourier-type transform for any given angle.

Single-crossover recombination in discrete time.

Science.gov (United States)

von Wangenheim, Ute; Baake, Ellen; Baake, Michael

2010-05-01

Modelling the process of recombination leads to a large coupled nonlinear dynamical system. Here, we consider a particular case of recombination in discrete time, allowing only for single crossovers. While the analogous dynamics in continuous time admits a closed solution (Baake and Baake in Can J Math 55:3-41, 2003), this no longer works for discrete time. A more general model (i.e. without the restriction to single crossovers) has been studied before (Bennett in Ann Hum Genet 18:311-317, 1954; Dawson in Theor Popul Biol 58:1-20, 2000; Linear Algebra Appl 348:115-137, 2002) and was solved algorithmically by means of Haldane linearisation. Using the special formalism introduced by Baake and Baake (Can J Math 55:3-41, 2003), we obtain further insight into the single-crossover dynamics and the particular difficulties that arise in discrete time. We then transform the equations to a solvable system in a two-step procedure: linearisation followed by diagonalisation. Still, the coefficients of the second step must be determined in a recursive manner, but once this is done for a given system, they allow for an explicit solution valid for all times.

Applying advanced digital signal processing techniques in industrial radioisotopes applications

International Nuclear Information System (INIS)

Mahmoud, H.K.A.E.

2012-01-01

Radioisotopes can be used to obtain signals or images in order to recognize the information inside the industrial systems. The main problems of using these techniques are the difficulty of identification of the obtained signals or images and the requirement of skilled experts for the interpretation process of the output data of these applications. Now, the interpretation of the output data from these applications is performed mainly manually, depending heavily on the skills and the experience of trained operators. This process is time consuming and the results typically suffer from inconsistency and errors. The objective of the thesis is to apply the advanced digital signal processing techniques for improving the treatment and the interpretation of the output data from the different Industrial Radioisotopes Applications (IRA). This thesis focuses on two IRA; the Residence Time Distribution (RTD) measurement and the defect inspection of welded pipes using a gamma source (gamma radiography). In RTD measurement application, this thesis presents methods for signal pre-processing and modeling of the RTD signals. Simulation results have been presented for two case studies. The first case study is a laboratory experiment for measuring the RTD in a water flow rig. The second case study is an experiment for measuring the RTD in a phosphate production unit. The thesis proposes an approach for RTD signal identification in the presence of noise. In this approach, after signal processing, the Mel Frequency Cepstral Coefficients (MFCCs) and polynomial coefficients are extracted from the processed signal or from one of its transforms. The Discrete Wavelet Transform (DWT), Discrete Cosine Transform (DCT), and Discrete Sine Transform (DST) have been tested and compared for efficient feature extraction. Neural networks have been used for matching of the extracted features. Furthermore, the Power Density Spectrum (PDS) of the RTD signal has been also used instead of the discrete

A Novel Intelligent Method for the State of Charge Estimation of Lithium-Ion Batteries Using a Discrete Wavelet Transform-Based Wavelet Neural Network

Directory of Open Access Journals (Sweden)

Deyu Cui

2018-04-01

Full Text Available State of charge (SOC estimation is becoming increasingly important, along with electric vehicle (EV rapid development, while SOC is one of the most significant parameters for the battery management system, indicating remaining energy and ensuring the safety and reliability of EV. In this paper, a hybrid wavelet neural network (WNN model combining the discrete wavelet transform (DWT method and adaptive WNN is proposed to estimate the SOC of lithium-ion batteries. The WNN model is trained by Levenberg-Marquardt (L-M algorithm, whose inputs are processed by discrete wavelet decomposition and reconstitution. Compared with back-propagation neural network (BPNN, L-M based BPNN (LMBPNN, L-M based WNN (LMWNN, DWT with L-M based BPNN (DWTLMBPNN and extend Kalman filter (EKF, the proposed intelligent SOC estimation method is validated and proved to be effective. Under the New European Driving Cycle (NEDC, the mean absolute error and maximum error can be reduced to 0.59% and 3.13%, respectively. The characteristics of high accuracy and strong robustness of the proposed method are verified by comparison study and robustness evaluation results (e.g., measurement noise test and untrained driving cycle test.

Scaling behaviour of Fisher and Shannon entropies for the exponential-cosine screened coulomb potential

Science.gov (United States)

Abdelmonem, M. S.; Abdel-Hady, Afaf; Nasser, I.

2017-07-01

The scaling laws are given for the entropies in the information theory, including the Shannon's entropy, its power, the Fisher's information and the Fisher-Shannon product, using the exponential-cosine screened Coulomb potential. The scaling laws are specified, in the r-space, as a function of |μ - μc, nℓ|, where μ is the screening parameter and μc, nℓ its critical value for the specific quantum numbers n and ℓ. Scaling laws for other physical quantities, such as energy eigenvalues, the moments, static polarisability, transition probabilities, etc. are also given. Some of these are reported for the first time. The outcome is compared with the available literatures' results.

Formal degrees of unipotent discrete series representations and the exotic Fourier transform

NARCIS (Netherlands)

Ciubotaru, D.; Opdam, E.

2015-01-01

We introduce a notion of elliptic fake degrees for unipotent elliptic representations of a semisimple p-adic group. We conjecture, and verify in some cases, that the relation between the formal degrees of unipotent discrete series representations of a semisimple p-adic group and the elliptic fake

The problem with time in mixed continuous/discrete time modelling

NARCIS (Netherlands)

Rovers, K.C.; Kuper, Jan; Smit, Gerardus Johannes Maria

The design of cyber-physical systems requires the use of mixed continuous time and discrete time models. Current modelling tools have problems with time transformations (such as a time delay) or multi-rate systems. We will present a novel approach that implements signals as functions of time,

Hardware Design and Implementation of Fixed-Width Standard and Truncated 4×4, 6×6, 8×8 and 12×12-BIT Multipliers Using Fpga

Science.gov (United States)

Rais, Muhammad H.

2010-06-01

This paper presents Field Programmable Gate Array (FPGA) implementation of standard and truncated multipliers using Very High Speed Integrated Circuit Hardware Description Language (VHDL). Truncated multiplier is a good candidate for digital signal processing (DSP) applications such as finite impulse response (FIR) and discrete cosine transform (DCT). Remarkable reduction in FPGA resources, delay, and power can be achieved using truncated multipliers instead of standard parallel multipliers when the full precision of the standard multiplier is not required. The truncated multipliers show significant improvement as compared to standard multipliers. Results show that the anomaly in Spartan-3 AN average connection and maximum pin delay have been efficiently reduced in Virtex-4 device.

DESIGN AND IMPLEMENTATION OF A VHDL PROCESSOR FOR DCT BASED IMAGE COMPRESSION

Directory of Open Access Journals (Sweden)

Md. Shabiul Islam

2017-11-01

Full Text Available This paper describes the design and implementation of a VHDL processor meant for performing 2D-Discrete Cosine Transform (DCT to use in image compression applications. The design flow starts from the system specification to implementation on silicon and the entire process is carried out using an advanced workstation based design environment for digital signal processing. The software allows the bit-true analysis to ensure that the designed VLSI processor satisfies the required specifications. The bit-true analysis is performed on all levels of abstraction (behavior, VHDL etc.. The motivation behind the work is smaller size chip area, faster processing, reducing the cost of the chip

Pipeline Defects Detection Using MFL Signals and Self Quotient Image

International Nuclear Information System (INIS)

Kim, Min Ho; Choi, Doo Hyun; Rho, Yong Woo

2010-01-01

Defects positioning of underground gas pipelines using MFL(magnetic flux leakage) inspection which is one of non-destructive evaluation techniques is proposed in this paper. MFL signals acquired from MFL PIG(pipeline inspection gauge) have nonlinearity and distortion caused by various extemal disturbances. SQI(self quotient image), a compensation technique for nonlinearity and distortion of MFL signal, is used to correct positioning of pipeline defects. Through the experiments using artificial defects carved in the KOGAS pipeline simulation facility, it is found that the performance of proposed defect detection is greatly improved compared to that of the conventional DCT(discrete cosine transform) coefficients based detection

Discrete breathers dynamic in a model for DNA chain with a finite stacking enthalpy

Science.gov (United States)

Gninzanlong, Carlos Lawrence; Ndjomatchoua, Frank Thomas; Tchawoua, Clément

2018-04-01

The nonlinear dynamics of a homogeneous DNA chain based on site-dependent finite stacking and pairing enthalpies is studied. A new variant of extended discrete nonlinear Schrödinger equation describing the dynamics of modulated wave is derived. The regions of discrete modulational instability of plane carrier waves are studied, and it appears that these zones depend strongly on the phonon frequency of Fourier's mode. The staggered/unstaggered discrete breather (SDB/USDB) is obtained straightforwardly without the staggering transformation, and it is demonstrated that SDBs are less unstable than USDB. The instability of discrete multi-humped SDB/USDB solution does not depend on the number of peaks of the discrete breather (DB). By using the concept of Peierls-Nabarro energy barrier, it appears that the low-frequency DBs are more mobile.

Conservative adaptivity and two-way self-nesting using discrete wavelets

Science.gov (United States)

Dubos, Thomas

2010-05-01

In simulating atmosphere and oceans, multiscale modelling is desirable to track high-intensity weather patterns, to investigate the interactions between the various spatio-temporal scales of the climate system, and to perform assessments of climate change at scales small enough to derive impacts on society and ecosystems. The mainstream approach to multiscale modelling is to nest a fine, limited-area model into a coarse, global model. These models are then coupled, either one-way or two-way, in order to combine the global coverage of the global model and the fine details of the fine model. In the long simulations typical of climate studies, initial conditions are unimportant, except for the few quantities like mass that are exactly conserved. In this context it is crucial that numerical models conserve at least mass exactly at the discrete level. However even with elaborate strategies like adaptive mesh refinement (AMR) conservation is not straightforwardly achieved. Although the continuous wavelet transform has become a standard tool of geophysical data analysis, it is less known that discrete wavelets and the associated transforms provide the basis for spatially adaptive numerical methods. Such methods are now well-developed in the fluid dynamics community. Since they allow spatial adaptivity, they can also be seen as two-way self-nesting methods. However since they are not specifically designed for geophysical purposes they are usually not exactly conservative. I present a fairly general framework in which a wavelet-based layer is added to an existing conservative scheme (finite-volume or finite-difference) to make it spatially adaptive without breaking the exact conservation of linear invariants. Discrete wavelet transforms involve an upscaling operation by which fields are transferred from a fine grid to a coarser grid with half the resolution. The method requires that mass fluxes be upscaled in a way that is consistent with the upscaling of mass. This

Large-scale chromosome folding versus genomic DNA sequences: A discrete double Fourier transform technique.

Science.gov (United States)

Chechetkin, V R; Lobzin, V V

2017-08-07

Using state-of-the-art techniques combining imaging methods and high-throughput genomic mapping tools leaded to the significant progress in detailing chromosome architecture of various organisms. However, a gap still remains between the rapidly growing structural data on the chromosome folding and the large-scale genome organization. Could a part of information on the chromosome folding be obtained directly from underlying genomic DNA sequences abundantly stored in the databanks? To answer this question, we developed an original discrete double Fourier transform (DDFT). DDFT serves for the detection of large-scale genome regularities associated with domains/units at the different levels of hierarchical chromosome folding. The method is versatile and can be applied to both genomic DNA sequences and corresponding physico-chemical parameters such as base-pairing free energy. The latter characteristic is closely related to the replication and transcription and can also be used for the assessment of temperature or supercoiling effects on the chromosome folding. We tested the method on the genome of E. coli K-12 and found good correspondence with the annotated domains/units established experimentally. As a brief illustration of further abilities of DDFT, the study of large-scale genome organization for bacteriophage PHIX174 and bacterium Caulobacter crescentus was also added. The combined experimental, modeling, and bioinformatic DDFT analysis should yield more complete knowledge on the chromosome architecture and genome organization. Copyright © 2017 Elsevier Ltd. All rights reserved.

An integrable (2+1)-dimensional Toda equation with two discrete variables

International Nuclear Information System (INIS)

Cao Cewen; Cao Jianli

2007-01-01

An integrable (2+1)-dimensional Toda equation with two discrete variables is presented from the compatible condition of a Lax triad composed of the ZS-AKNS (Zakharov, Shabat; Ablowitz, Kaup, Newell, Segur) eigenvalue problem and two discrete spectral problems. Through the nonlinearization technique, the Lax triad is transformed into a Hamiltonian system and two symplectic maps, respectively, which are integrable in the Liouville sense, sharing the same set of integrals, functionally independent and involutive with each other. In the Jacobi variety of the associated algebraic curve, both the continuous and the discrete flows are straightened out by the Abel-Jacobi coordinates, and are integrated by quadratures. An explicit algebraic-geometric solution in the original variable is obtained by the Riemann-Jacobi inversion

On discrete 2D integrable equations of higher order

International Nuclear Information System (INIS)

Adler, V E; Postnikov, V V

2014-01-01

We study two-dimensional discrete integrable equations of order 1 with respect to one independent variable and m with respect to another one. A generalization of the multidimensional consistency property is proposed for this type of equations. The examples are related to the Bäcklund–Darboux transformations for the lattice equations of Bogoyavlensky type. (paper)

Integrable relativistic Toda type lattice hierarchies, associated coupling systems and the Darboux transformation

International Nuclear Information System (INIS)

Yang Hongxiang; Xu Xixiang; Sun Yepeng; Ding Haiyong

2006-01-01

Starting from a discrete isospectral problem, integrable positive and negative relativistic Toda type lattice hierarchies are derived. The two lattice hierarchies are proven to have discrete zero-curvature representations associated with a discrete spectral problem, and the positive and negative lattice hierarchies correspond to positive and negative power expansions of Lax operators with respect to the spectral parameter, respectively. The integrable positive and negative coupling systems of the resulting hierarchies are constructed through enlarging Lax pairs. In addition, with the help of gauge transformations of spectral problems, a Darboux transformation is established for the relativistic Toda type lattice. As an application, an exact solution is explicitly presented

Discretization analysis of bifurcation based nonlinear amplifiers

Science.gov (United States)

Feldkord, Sven; Reit, Marco; Mathis, Wolfgang

2017-09-01

Recently, for modeling biological amplification processes, nonlinear amplifiers based on the supercritical Andronov-Hopf bifurcation have been widely analyzed analytically. For technical realizations, digital systems have become the most relevant systems in signal processing applications. The underlying continuous-time systems are transferred to the discrete-time domain using numerical integration methods. Within this contribution, effects on the qualitative behavior of the Andronov-Hopf bifurcation based systems concerning numerical integration methods are analyzed. It is shown exemplarily that explicit Runge-Kutta methods transform the truncated normalform equation of the Andronov-Hopf bifurcation into the normalform equation of the Neimark-Sacker bifurcation. Dependent on the order of the integration method, higher order terms are added during this transformation.A rescaled normalform equation of the Neimark-Sacker bifurcation is introduced that allows a parametric design of a discrete-time system which corresponds to the rescaled Andronov-Hopf system. This system approximates the characteristics of the rescaled Hopf-type amplifier for a large range of parameters. The natural frequency and the peak amplitude are preserved for every set of parameters. The Neimark-Sacker bifurcation based systems avoid large computational effort that would be caused by applying higher order integration methods to the continuous-time normalform equations.

MPEG-compliant joint source/channel coding using discrete cosine transform and substream scheduling for visual communication over packet networks

Science.gov (United States)

Kim, Seong-Whan; Suthaharan, Shan; Lee, Heung-Kyu; Rao, K. R.

2001-01-01

Quality of Service (QoS)-guarantee in real-time communication for multimedia applications is significantly important. An architectural framework for multimedia networks based on substreams or flows is effectively exploited for combining source and channel coding for multimedia data. But the existing frame by frame approach which includes Moving Pictures Expert Group (MPEG) cannot be neglected because it is a standard. In this paper, first, we designed an MPEG transcoder which converts an MPEG coded stream into variable rate packet sequences to be used for our joint source/channel coding (JSCC) scheme. Second, we designed a classification scheme to partition the packet stream into multiple substreams which have their own QoS requirements. Finally, we designed a management (reservation and scheduling) scheme for substreams to support better perceptual video quality such as the bound of end-to-end jitter. We have shown that our JSCC scheme is better than two other two popular techniques by simulation and real video experiments on the TCP/IP environment.

Discrete Mathematics

DEFF Research Database (Denmark)

Sørensen, John Aasted

2011-01-01

The objectives of Discrete Mathematics (IDISM2) are: The introduction of the mathematics needed for analysis, design and verification of discrete systems, including the application within programming languages for computer systems. Having passed the IDISM2 course, the student will be able...... to accomplish the following: -Understand and apply formal representations in discrete mathematics. -Understand and apply formal representations in problems within discrete mathematics. -Understand methods for solving problems in discrete mathematics. -Apply methods for solving problems in discrete mathematics......; construct a finite state machine for a given application. Apply these concepts to new problems. The teaching in Discrete Mathematics is a combination of sessions with lectures and students solving problems, either manually or by using Matlab. Furthermore a selection of projects must be solved and handed...

Discrete systems related to the sixth Painleve equation

International Nuclear Information System (INIS)

Ramani, A; Ohta, Y; Grammaticos, B

2006-01-01

We present discrete Painleve equations which can be obtained as contiguity relations of the solutions of the continuous Painleve VI. The derivation is based on the geometry of the affine Weyl group D (1) 4 associated with the bilinear formalism. As an offshoot we also present the contiguity relations of the solutions of the Bureau-Ablowitz-Fokas equation, which is a Miura transformed, 'modified', P VI

Introduction to the discrete Fourier series considering both mathematical and engineering aspects - A linear-algebra approach

Directory of Open Access Journals (Sweden)

Ludwig Kohaupt

2015-12-01

Full Text Available The discrete Fourier series is a valuable tool developed and used by mathematicians and engineers alike. One of the most prominent applications is signal processing. Usually, it is important that the signals be transmitted fast, for example, when transmitting images over large distances such as between the moon and the earth or when generating images in computer tomography. In order to achieve this, appropriate algorithms are necessary. In this context, the fast Fourier transform (FFT plays a key role which is an algorithm for calculating the discrete Fourier transform (DFT; this, in turn, is tightly connected with the discrete Fourier series. The last one itself is the discrete analog of the common (continuous-time Fourier series and is usually learned by mathematics students from a theoretical point of view. The aim of this expository/pedagogical paper is to give an introduction to the discrete Fourier series for both mathematics and engineering students. It is intended to expand the purely mathematical view; the engineering aspect is taken into account by applying the FFT to an example from signal processing that is small enough to be used in class-room teaching and elementary enough to be understood also by mathematics students. The MATLAB program is employed to do the computations.

Electromyography (EMG) signal recognition using combined discrete wavelet transform based adaptive neuro-fuzzy inference systems (ANFIS)

Science.gov (United States)

Arozi, Moh; Putri, Farika T.; Ariyanto, Mochammad; Khusnul Ari, M.; Munadi, Setiawan, Joga D.

2017-01-01

People with disabilities are increasing from year to year either due to congenital factors, sickness, accident factors and war. One form of disability is the case of interruptions of hand function. The condition requires and encourages the search for solutions in the form of creating an artificial hand with the ability as a human hand. The development of science in the field of neuroscience currently allows the use of electromyography (EMG) to control the motion of artificial prosthetic hand into the necessary use of EMG as an input signal to control artificial prosthetic hand. This study is the beginning of a significant research planned in the development of artificial prosthetic hand with EMG signal input. This initial research focused on the study of EMG signal recognition. Preliminary results show that the EMG signal recognition using combined discrete wavelet transform and Adaptive Neuro-Fuzzy Inference System (ANFIS) produces accuracy 98.3 % for training and 98.51% for testing. Thus the results can be used as an input signal for Simulink block diagram of a prosthetic hand that will be developed on next study. The research will proceed with the construction of artificial prosthetic hand along with Simulink program controlling and integrating everything into one system.

Rolling Bearing Fault Diagnosis Using Modified Neighborhood Preserving Embedding and Maximal Overlap Discrete Wavelet Packet Transform with Sensitive Features Selection

Directory of Open Access Journals (Sweden)

Fei Dong

2018-01-01

Full Text Available In order to enhance the performance of bearing fault diagnosis and classification, features extraction and features dimensionality reduction have become more important. The original statistical feature set was calculated from single branch reconstruction vibration signals obtained by using maximal overlap discrete wavelet packet transform (MODWPT. In order to reduce redundancy information of original statistical feature set, features selection by adjusted rand index and sum of within-class mean deviations (FSASD was proposed to select fault sensitive features. Furthermore, a modified features dimensionality reduction method, supervised neighborhood preserving embedding with label information (SNPEL, was proposed to realize low-dimensional representations for high-dimensional feature space. Finally, vibration signals collected from two experimental test rigs were employed to evaluate the performance of the proposed procedure. The results show that the effectiveness, adaptability, and superiority of the proposed procedure can serve as an intelligent bearing fault diagnosis system.

Simplification of gamma-ray spectral data by using Fourier transform

International Nuclear Information System (INIS)

Tominaga, Shoji; Nagata, Shojiro; Nayatani, Yoshinobu; Ueda, Isamu; Sasaki, Satoshi.

1977-01-01

A method is proposed to represent γ-ray response spectra by Fourier series for the purpose of compressing spectral data. The usefulness of the method was confirmed by applying it to a spectral library of a NaI detector. In the method, a response spectrum as a wave is described by superposition of sine (cosine) waves with low frequencies, whose coefficient parameters can be obtained by a Fast Fourier Transform program. The relation between the number of parameters and the fitting error is discussed, and as the result, it is shown that the number of parameters can be reduced to about a half. The merits and features are presented in practical application of the method to the analysis of γ-ray spectra. (auth.)

The fractional Fourier transform and applications

Science.gov (United States)

Bailey, David H.; Swarztrauber, Paul N.

1991-01-01

This paper describes the 'fractional Fourier transform', which admits computation by an algorithm that has complexity proportional to the fast Fourier transform algorithm. Whereas the discrete Fourier transform (DFT) is based on integral roots of unity e exp -2(pi)i/n, the fractional Fourier transform is based on fractional roots of unity e exp -2(pi)i(alpha), where alpha is arbitrary. The fractional Fourier transform and the corresponding fast algorithm are useful for such applications as computing DFTs of sequences with prime lengths, computing DFTs of sparse sequences, analyzing sequences with noninteger periodicities, performing high-resolution trigonometric interpolation, detecting lines in noisy images, and detecting signals with linearly drifting frequencies. In many cases, the resulting algorithms are faster by arbitrarily large factors than conventional techniques.

Precise and fast spatial-frequency analysis using the iterative local Fourier transform.

Science.gov (United States)

Lee, Sukmock; Choi, Heejoo; Kim, Dae Wook

2016-09-19

The use of the discrete Fourier transform has decreased since the introduction of the fast Fourier transform (fFT), which is a numerically efficient computing process. This paper presents the iterative local Fourier transform (ilFT), a set of new processing algorithms that iteratively apply the discrete Fourier transform within a local and optimal frequency domain. The new technique achieves 210 times higher frequency resolution than the fFT within a comparable computation time. The method's superb computing efficiency, high resolution, spectrum zoom-in capability, and overall performance are evaluated and compared to other advanced high-resolution Fourier transform techniques, such as the fFT combined with several fitting methods. The effectiveness of the ilFT is demonstrated through the data analysis of a set of Talbot self-images (1280 × 1024 pixels) obtained with an experimental setup using grating in a diverging beam produced by a coherent point source.

Fourier transformations for difference analogs of the harmonic oscillator

International Nuclear Information System (INIS)

Askey, R.; Atakishiyev, N.M.

1995-01-01

The relation between the Mehler bilinear generating function for the Hermite polynomials and the kernel of the Fourier transformation that connect the spaces of coordinate and momentum is discussed. On the base of the relation the discrete analogs of the Fourier transformation for the Kravchuk and Charlier functions are considered. 6 refs

Region-based Image Segmentation by Watershed Partition and DCT Energy Compaction

Directory of Open Access Journals (Sweden)

Chi-Man Pun

2012-02-01

Full Text Available An image segmentation approach by improved watershed partition and DCT energy compaction has been proposed in this paper. The proposed energy compaction, which expresses the local texture of an image area, is derived by exploiting the discrete cosine transform. The algorithm is a hybrid segmentation technique which is composed of three stages. First, the watershed transform is utilized by preprocessing techniques: edge detection and marker in order to partition the image in to several small disjoint patches, while the region size, mean and variance features are used to calculate region cost for combination. Then in the second merging stage the DCT transform is used for energy compaction which is a criterion for texture comparison and region merging. Finally the image can be segmented into several partitions. The experimental results show that the proposed approach achieved very good segmentation robustness and efficiency, when compared to other state of the art image segmentation algorithms and human segmentation results.

The inverse of winnowing: a FORTRAN subroutine and discussion of unwinnowing discrete data

Science.gov (United States)

Bracken, Robert E.

2004-01-01

This report describes an unwinnowing algorithm that utilizes a discrete Fourier transform, and a resulting Fortran subroutine that winnows or unwinnows a 1-dimensional stream of discrete data; the source code is included. The unwinnowing algorithm effectively increases (by integral factors) the number of available data points while maintaining the original frequency spectrum of a data stream. This has utility when an increased data density is required together with an availability of higher order derivatives that honor the original data.

Discrete Curvatures and Discrete Minimal Surfaces

KAUST Repository

Sun, Xiang

2012-01-01

This thesis presents an overview of some approaches to compute Gaussian and mean curvature on discrete surfaces and discusses discrete minimal surfaces. The variety of applications of differential geometry in visualization and shape design leads

Discrete transparent boundary conditions for Schroedinger-type equations

International Nuclear Information System (INIS)

Schmidt, F.; Yevick, D.

1997-01-01

We present a general technique for constructing nonlocal transparent boundary conditions for one-dimensional Schroedinger-type equations. Our method supplies boundary conditions for the θ-family of implicit one-step discretizations of Schroedinger's equation in time. The use of Mikusinski's operator approach in time avoids direct and inverse transforms between time and frequency domains and thus implements the boundary conditions in a direct manner. 14 refs., 9 figs

Similarity analysis between chromosomes of Homo sapiens and monkeys with correlation coefficient, rank correlation coefficient and cosine similarity measures

OpenAIRE

Someswara Rao, Chinta; Viswanadha Raju, S.

2016-01-01

In this paper, we consider correlation coefficient, rank correlation coefficient and cosine similarity measures for evaluating similarity between Homo sapiens and monkeys. We used DNA chromosomes of genome wide genes to determine the correlation between the chromosomal content and evolutionary relationship. The similarity among the H. sapiens and monkeys is measured for a total of 210 chromosomes related to 10 species. The similarity measures of these different species show the relationship b...

Unfolding and effective bandstructure calculations as discrete real- and reciprocal-space operations

Energy Technology Data Exchange (ETDEWEB)

Boykin, Timothy B., E-mail: boykin@ece.uah.edu [Department of Electrical and Computer Engineering, The University of Alabama in Huntsville, Huntsville, AL 35899 (United States); Ajoy, Arvind [School of Electrical and Computer Engineering, Cornell University, Ithaca, NY 14853 (United States); Ilatikhameneh, Hesameddin; Povolotskyi, Michael; Klimeck, Gerhard [Network for Computational Nanotechnology, School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN 47907 (United States)

2016-06-15

In recent years, alloy electronic structure calculations based on supercell Brillouin zone unfolding have become popular. There are a number of formulations of the method which on the surface might appear different. Here we show that a discrete real-space description, based on discrete Fourier transforms, is fully general. Furthermore, such an approach can more easily show the effects of alloy scattering. We present such a method for treating the random alloy problem. This treatment features straightforward mathematics and a transparent physical interpretation of the calculated effective (i.e., approximate) energy bands.

Discrete population balance models of random agglomeration and cleavage in polymer pyrolysis

Directory of Open Access Journals (Sweden)

John E. J. Staggs

2017-05-01

Full Text Available The processes of random agglomeration and cleavage (both of which are important for the development of new models of polymer combustion, but are also applicable in a wide range of fields including atmospheric physics, radiation modelling and astrophysics are analysed using population balance methods. The evolution of a discrete distribution of particles is considered within this framework, resulting in a set of ordinary differential equations for the individual particle concentrations. Exact solutions for these equations are derived, together with moment generating functions. Application of the discrete Laplace transform (analogous to the Z-transform is found to be effective in these problems, providing both exact solutions for particle concentrations and moment generating functions. The combined agglomeration-cleavage problem is also considered. Unfortunately, it has been impossible to find an exact solution for the full problem, but a stable steady state has been identified and computed.

The discrete symmetry of the N=2 supersymmetric modified NLS hierarchy

International Nuclear Information System (INIS)

Sorin, A.

1996-01-01

A few new N=2 superintegrable mappings in the (1|2) superspace are proposed and their origin is analyzed. Using one of them, acting like the discrete symmetry transformation of the N=2 supersymmetric modified NLS hierarchy, the recursion operator and Hamiltonian structures of the hierarchy are constructed

Discrete variable representation for singular Hamiltonians

DEFF Research Database (Denmark)

Schneider, B. I.; Nygaard, Nicolai

2004-01-01

We discuss the application of the discrete variable representation (DVR) to Schrodinger problems which involve singular Hamiltonians. Unlike recent authors who invoke transformations to rid the eigenvalue equation of singularities at the cost of added complexity, we show that an approach based...... solely on an orthogonal polynomial basis is adequate, provided the Gauss-Lobatto or Gauss-Radau quadrature rule is used. This ensures that the mesh contains the singular points and by simply discarding the DVR functions corresponding to those points, all matrix elements become well behaved. the boundary...

IDENTIFIKASI DISTORSI BLUR PADA GAMBAR DIGITAL

Directory of Open Access Journals (Sweden)

Irwan Prasetya Gunawan

2012-05-01

Full Text Available Salah satu masalah yang sering muncul dalam dunia fotografi adalah efek blur yang dapat diakibatkan baik oleh objek yang bergerak maupun gerakan kamera yang berhubungan dengan kecepatan rana (shutter speed ketika gambar akan diambil. Paper ini menyajikan sebuah metode baru yang sederhana untuk mendeteksi kemunculan distorsi blur yang tidak diinginkan pada gambar digital. Metode yang diusulkan menggunakan transformasi discrete cosine transform (DCT pada gambar yang telah mengalami distorsi dengan ukuran blok DCT yang bervariasi. Hasil dari pendeteksian ini kemudian digunakan untuk meningkatkan kualitas gambar melalui metode debluring berdasarkan korelasi pixel yang diterapkan pada area tertentu pada gambar yang mengandung distorsi blur ini. Hasil eksperimen menunjukkan bahwa kualitas gambar yang disempurnakan dihasilkan oleh metode debluring secara selektif menggunakan deteksi distorsi blur lokal akan lebih baik daripada yang tidak melalui proses seleksi. Dari berbagai ukuran blok yang digunakan dalam percobaan, blok berukuran 32×32 piksel menghasilkan kualitas gambar yang secara umum lebih baik. One of the problems that often arise in photography is a blurring effect that can be caused either by a moving object or camera movements that associated with the shutter speed when the picture is taken. This paper presents a simple new method for detecting the appearance of unwanted blur distortion in digital images. The proposed method uses the transformation of Discrete Cosine Transform (DCT on the image that has been distorted with varying DCT block size. The results of the detection used to improve image quality through debluring method based on pixel correlation that applied to certain areas of the image that contains this blur distortion. The experimental results show that the enhanced picture quality produced by the method of selectively debluring using a local blur distortion detection is better than not through the selection process

Research of generalized wavelet transformations of Haar correctness in remote sensing of the Earth

Science.gov (United States)

Kazaryan, Maretta; Shakhramanyan, Mihail; Nedkov, Roumen; Richter, Andrey; Borisova, Denitsa; Stankova, Nataliya; Ivanova, Iva; Zaharinova, Mariana

2017-10-01

In this paper, Haar's generalized wavelet functions are applied to the problem of ecological monitoring by the method of remote sensing of the Earth. We study generalized Haar wavelet series and suggest the use of Tikhonov's regularization method for investigating them for correctness. In the solution of this problem, an important role is played by classes of functions that were introduced and described in detail by I.M. Sobol for studying multidimensional quadrature formulas and it contains functions with rapidly convergent series of wavelet Haar. A theorem on the stability and uniform convergence of the regularized summation function of the generalized wavelet-Haar series of a function from this class with approximate coefficients is proved. The article also examines the problem of using orthogonal transformations in Earth remote sensing technologies for environmental monitoring. Remote sensing of the Earth allows to receive from spacecrafts information of medium, high spatial resolution and to conduct hyperspectral measurements. Spacecrafts have tens or hundreds of spectral channels. To process the images, the device of discrete orthogonal transforms, and namely, wavelet transforms, was used. The aim of the work is to apply the regularization method in one of the problems associated with remote sensing of the Earth and subsequently to process the satellite images through discrete orthogonal transformations, in particular, generalized Haar wavelet transforms. General methods of research. In this paper, Tikhonov's regularization method, the elements of mathematical analysis, the theory of discrete orthogonal transformations, and methods for decoding of satellite images are used. Scientific novelty. The task of processing of archival satellite snapshots (images), in particular, signal filtering, was investigated from the point of view of an incorrectly posed problem. The regularization parameters for discrete orthogonal transformations were determined.

Hybrid fast Hankel transform implementation for optics simulation

Science.gov (United States)

Davis, Paul K.

2013-09-01

The most compute intensive part of a full optics simulation, especially including diffraction effects, is the Fourier transform between pupil and image spaces. This is typically performed as a two dimensional fast discrete transform. For a nearly radially symmetric system there are advantages to using polar coordinates, in which case the radial transform becomes a Hankel transform, using Bessel functions instead of circular functions. However, there are special difficulties in calculating and handling Bessel functions. Several solutions have been proposed. We present a hybrid Hankel transform which divides the domain, calculating a portion using Bessel function approximations but converting most of the domain into a one dimensional Fourier transform which can be handled by standard methods.

Comparison of DCT, SVD and BFOA based multimodal biometric watermarking system

Directory of Open Access Journals (Sweden)

S. Anu H. Nair

2015-12-01

Full Text Available Digital image watermarking is a major domain for hiding the biometric information, in which the watermark data are made to be concealed inside a host image imposing imperceptible change in the picture. Due to the advance in digital image watermarking, the majority of research aims to make a reliable improvement in robustness to prevent the attack. The reversible invisible watermarking scheme is used for fingerprint and iris multimodal biometric system. A novel approach is used for fusing different biometric modalities. Individual unique modalities of fingerprint and iris biometric are extracted and fused using different fusion techniques. The performance of different fusion techniques is evaluated and the Discrete Wavelet Transform fusion method is identified as the best. Then the best fused biometric template is watermarked into a cover image. The various watermarking techniques such as the Discrete Cosine Transform (DCT, Singular Value Decomposition (SVD and Bacterial Foraging Optimization Algorithm (BFOA are implemented to the fused biometric feature image. Performance of watermarking systems is compared using different metrics. It is found that the watermarked images are found robust over different attacks and they are able to reverse the biometric template for Bacterial Foraging Optimization Algorithm (BFOA watermarking technique.

The comparison between SVD-DCT and SVD-DWT digital image watermarking

Science.gov (United States)

Wira Handito, Kurniawan; Fauzi, Zulfikar; Aminy Ma’ruf, Firda; Widyaningrum, Tanti; Muslim Lhaksmana, Kemas

2018-03-01

With internet, anyone can publish their creation into digital data simply, inexpensively, and absolutely easy to be accessed by everyone. However, the problem appears when anyone else claims that the creation is their property or modifies some part of that creation. It causes necessary protection of copyrights; one of the examples is with watermarking method in digital image. The application of watermarking technique on digital data, especially on image, enables total invisibility if inserted in carrier image. Carrier image will not undergo any decrease of quality and also the inserted image will not be affected by attack. In this paper, watermarking will be implemented on digital image using Singular Value Decomposition based on Discrete Wavelet Transform (DWT) and Discrete Cosine Transform (DCT) by expectation in good performance of watermarking result. In this case, trade-off happen between invisibility and robustness of image watermarking. In embedding process, image watermarking has a good quality for scaling factor < 0.1. The quality of image watermarking in decomposition level 3 is better than level 2 and level 1. Embedding watermark in low-frequency is robust to Gaussian blur attack, rescale, and JPEG compression, but in high-frequency is robust to Gaussian noise.

Discrete coherent and squeezed states of many-qudit systems

International Nuclear Information System (INIS)

Klimov, Andrei B.; Munoz, Carlos; Sanchez-Soto, Luis L.

2009-01-01

We consider the phase space for n identical qudits (each one of dimension d, with d a primer number) as a grid of d n xd n points and use the finite Galois field GF(d n ) to label the corresponding axes. The associated displacement operators permit to define s-parametrized quasidistributions on this grid, with properties analogous to their continuous counterparts. These displacements allow also for the construction of finite coherent states, once a fiducial state is fixed. We take this reference as one eigenstate of the discrete Fourier transform and study the factorization properties of the resulting coherent states. We extend these ideas to include discrete squeezed states, and show their intriguing relation with entangled states of different qudits.

Hermite-cosine-Gaussian laser beam and its propagation characteristics in turbulent atmosphere.

Science.gov (United States)

Eyyuboğlu, Halil Tanyer

2005-08-01

Hermite-cosine-Gaussian (HcosG) laser beams are studied. The source plane intensity of the HcosG beam is introduced and its dependence on the source parameters is examined. By application of the Fresnel diffraction integral, the average receiver intensity of HcosG beam is formulated for the case of propagation in turbulent atmosphere. The average receiver intensity is seen to reduce appropriately to various special cases. When traveling in turbulence, the HcosG beam initially experiences the merging of neighboring beam lobes, and then a TEM-type cosh-Gaussian beam is formed, temporarily leading to a plain cosh-Gaussian beam. Eventually a pure Gaussian beam results. The numerical evaluation of the normalized beam size along the propagation axis at selected mode indices indicates that relative spreading of higher-order HcosG beam modes is less than that of the lower-order counterparts. Consequently, it is possible at some propagation distances to capture more power by using higher-mode-indexed HcosG beams.

Low Loss 1×2 Optical Coupler Based on Cosine S-bend with Segmented Waveguides

Science.gov (United States)