Research on SINS Alignment Algorithm Based on FIR Filters
Institute of Scientific and Technical Information of China (English)
LIAN Jun-xiang; HU De-wen; WU Yuan-xin; HU Xiao-ping
2007-01-01
An inertial frame based alignment (IFBA) method is presented, especially for the applications on a rocking platform, e.g., marine applications. Defining the initial body frame as the inertial frame, the IFBA method achieves the alignment by virtue of a cascade of low-pass FIR filters, which attenuate the disturbing acceleration and maintain the gravity vector. The aligning time rests with the orders of the FIR filter group, and the method is suitable for large initial misali gnment case. An alignment scheme comprising a coarse phase by the IFBA method an d a fine phase by a Kalman filter is presented. Both vehicle-based and ship-based alignment experiments were carried out. The results show that the proposed scheme converges much faster than the traditional method at no cost of precision and also works well under any large initial misalignment.
Optimal Nonlinear Filter for INS Alignment
Institute of Scientific and Technical Information of China (English)
赵瑞; 顾启泰
2002-01-01
All the methods to handle the inertial navigation system (INS) alignment were sub-optimal in the past. In this paper, particle filtering (PF) as an optimal method is used for solving the problem of INS alignment. A sub-optimal two-step filtering algorithm is presented to improve the real-time performance of PF. The approach combines particle filtering with Kalman filtering (KF). Simulation results illustrate the superior performance of these approaches when compared with extended Kalman filtering (EKF).
RAPID TRANSFER ALIGNMENT USING FEDERATED KALMAN FILTER
Institute of Scientific and Technical Information of China (English)
GUDong-qing; QINYong-yuan; PENGRong; LIXin
2005-01-01
The dimension number of the centralized Kalman filter (CKF) for the rapid transfer alignment (TA) is as high as 21 if the aircraft wing flexure motion is considered in the rapid TA. The 21-dimensional CKF brings the calculation burden on the computer and the difficulty to meet a high filtering updating rate desired by rapid TA. The federated Kalman filter (FKF) for the rapid TA is proposed to solve the dilemma. The structure and the algorithm of the FKF, which can perform parallel computation and has less calculation burden, are designed.The wing flexure motion is modeled, and then the 12-order velocity matching local filter and the 15-order attitud ematching local filter are devised. Simulation results show that the proposed EKE for the rapid TA almost has the same performance as the CKF. Thus the calculation burden of the proposed FKF for the rapid TA is markedly decreased.
Randomized Filtering Algorithms
DEFF Research Database (Denmark)
Katriel, Irit; Van Hentenryck, Pascal
2008-01-01
of AllDifferent and is generalization, the Global Cardinality Constraint. The first delayed filtering scheme is a Monte Carlo algorithm: its running time is superior, in the worst case, to that of enforcing are consistency after every domain event, while its filtering effectiveness is analyzed...... in the expected sense. The second scheme is a Las Vegas algorithm using filtering triggers: Its effectiveness is the same as enforcing are consistency after every domain event, while in the expected case it is faster by a factor of m/n, where n and m are, respectively, the number of nodes and edges...
Unscented Kalman filter for SINS alignment
Institute of Scientific and Technical Information of China (English)
Zhou Zhanxin; Gao Yanan; Chen Jiabin
2007-01-01
In order to improve the filter accuracy for the nonlinear error model of strapdown inertial navigation system (SINS) alignment, Unscented Kalman Filter (UKF) is presented for simulation with stationary base and moving base of SINS alignment.Simulation results show the superior performance of this approach when compared with classical suboptimal techniques such as extended Kalman filter in cases of large initial misalignment.The UKF has good performance in case of small initial misalignment.
Institute of Scientific and Technical Information of China (English)
赵剡; 王纪南; 解春明
2012-01-01
针对空中环境各种干扰因素对空空导弹传递对准(TA)滤波的影响,提出一种基于联邦网络的补偿算法.将干扰误差考虑为量测输入纳入滤波系统,改进标准Kalman滤波结构.将补偿神经网络设计成联邦结构,两个子系统分别用于训练量测输入估计误差、输出层权值误差和隐层权值误差.推导了联邦网络的训练算法并对算法进行了稳定性证明,保证了网络在结构上计算量小,系统反馈能力强,能够对干扰误差进行有效在线预测,辅助改进Kalman滤波器对失准角进行精确估计.仿真比较实验验证了该算法能够在不需任何先验信息的条件下,及时适应对准环境,预测校正干扰误差,滤波收敛快、精度高,适合空空导弹在具体设备和环境条件下的快速精确传递对准.%Focusing on the influence of various disturbing sources under air environment on transfer alignment (TA), a compensating algorithm based on federal neural network was put forward. Firstly, standard Kalman filtering structure was improved by regarding disturbing errors as measurement input. Then, the neural network was designed to form federal structure with two subsystems, which were used to train measurement input estimating error, output layer weight error and hidden layer weight error. Further, the training algorithm of the federal neural network was deduced and its stability was proved, which ensured low computing load and strong feedback capability. The online disturbing errors were efficiently predicted and aided to modified Kalman filter for accurate estimation of misalignment. Results of simulation experiments validate that, without knowing any priori information, the proposed algorithm could timely adapt to TA environment, predict and rectify disturbing errors, achieve fast convergence and high accuracy. It is feasible for air-to-air missile to implement rapid and high accuracy TA under hard air environment with different apparatus.
Multiple Fading Factors Kalman Filter for SINS Static Alignment Application
Institute of Scientific and Technical Information of China (English)
GAO Weixi; MIAO Lingjuan; NI Maolin
2011-01-01
To solve the problem that the standard Kalman filter cannot give the optimal solution when the system model and stochastic information are unknown accurately,single fading factor Kalman filter is suitable for simple systems.But for complex systems with multi-variable,it may not be sufficient to use single fading factor as a multiplier for the covariance matrices.In this paper,a new multiple fading factors Kalman filtering algorithm is presented.By calculating the unbiased estimate of the innovation sequence covariance using fenestration,the fading factor matrix is obtained.Adjusting the covariance matrix of prediction error Pk|k-1 using fading factor matrix,the algorithm provides different rates of fading for different filter channels.The proposed algorithm is applied to strapdown inertial navigation system(SINS) initial alignment,and simulation and experimental results demonstrate that,the alignment accuracy can be upgraded dramatically when the actual system noise characteristics are different from the pre-set values.The new algorithm is less sensitive to uncertainty noise and has better estimation effect of the parameters.Therefore,it is of significant value in practical applications.
Cactus: Algorithms for genome multiple sequence alignment
Paten, Benedict; Earl, Dent; Nguyen, Ngan; Diekhans, Mark; Zerbino, Daniel; Haussler, David
2011-01-01
Much attention has been given to the problem of creating reliable multiple sequence alignments in a model incorporating substitutions, insertions, and deletions. Far less attention has been paid to the problem of optimizing alignments in the presence of more general rearrangement and copy number variation. Using Cactus graphs, recently introduced for representing sequence alignments, we describe two complementary algorithms for creating genomic alignments. We have implemented these algorithms...
Software alignment of the BESⅢ main drift chamber using the Kalman Filter method
Institute of Scientific and Technical Information of China (English)
WANG Ji-Ke; MAO Ze-Pu; BIAN Jian-Ming; CAO Guo-Fu; CAO Xue-Xiang; CHEN Shen-Jian; DENG Zi-Yan; FU Cheng-Dong; GAO Yuan-Ning; HE Kang-Lin; HE Miao; HUA Chun-Fei; HUANG Bin; HUANG Xing-Tao; JI Xiao-Bin; LI Fei; LI Hai-Bo; LI Wei-Dong; LIANG Yu-Tie; LIU Chun-Xiu; LIU Huai-Min; LIU Suo; LIU Ying-Jie; MA Qiu-Mei; MA Xiang; MAO Ya-Jun; MO Xiao-Hu; PAN Ming-Hua; PANG Cai-Ying; PING Rong-Gang; QIN Ya-Hong; QIU Jin-Fa; SUN Sheng-Sen; SUN Yong-Zhao; WANG Liang-Liang; WEN Shuo-Pin; WU Ling-Hui; XIE Yu-Guang; XU Min; YAN Liang; YOU Zheng-Yun; YUAN Chang-Zheng; YUAN Ye; ZHANG Bing-Yun; ZHANG Chang-Chun; ZHANG Jian-Yong; ZHANG Xue-Yao; ZHANG Yao; ZHENG Yang-Heng; ZHU Ke-Jun; ZHU Yong-Sheng; ZHU Zhi-Li; ZOU Jia-Heng
2009-01-01
Software alignment is quite important for a tracking detector to reach its ultimate position accuracy and momentum resolution. We developed a new alignment algorithm for the BESⅢ Main Drift Chamber using the Kalman Filter method. Two different types of data which are helix tracks and straight tracks are used to test this algorithm, and the results show that the design and implementation is successful.
Institute of Scientific and Technical Information of China (English)
杨晔; 毋兴涛; 杨建林; 高巍; 裴志
2014-01-01
为充分利用分布式架构重力仪各处理器并行计算的能力，解决单个处理器运行整体式 Kalman滤波所遇到的非实时性问题，设计了一种分布式 Kalman 滤波对准算法。首先，给出了方位捷联平台重力仪的误差方程，建立了系统的状态方程和观测方程。然后，用协方差分析法对系统初始对准滤波方程进行处理，将原系统分解成维数相同的两个子系统，得到由两个子滤波器构成的初始对准滤波器。最后，利用Matlab建立了方位捷联平台惯导模型，分别应用整体式滤波和分布式滤波进行静基座初始对准。仿真结果表明，分布式滤波算法与整体式滤波算法具有相同的滤波精度，并且分布式滤波用时只有整体式滤波的60%，更有利于保证滤波算法的实时性。%A distributed Kalman filter alignment algorithm is developed in order to use the parallel computing ability of the distributed architecture gravimeter to solve the non real-time implementation of filtering based on one single processor. Firstly, the error equations of the azimuth strapdown platform gravimeter are deduced, and the state equations and observation equations are built. Secondly, an error covariance analytical method is applied to the filtering equations, and the system is decentralised into two subsystems with the same dimension. In this way we get the initial alignment filter formed by the two subfilters. Finally, the azimuth strapdown platform model is built by using Matlab, and stationary base alignment is implemented by using global Kalman filter and distributed Kalman filter separately. The simulation results show that the distributed filter has the same filtering accuracy and costs only 60%of time compared with the global one, which is favorable to ensure the real-time performance of the algorithm.
Filter selection using genetic algorithms
Patel, Devesh
1996-03-01
Convolution operators act as matched filters for certain types of variations found in images and have been extensively used in the analysis of images. However, filtering through a bank of N filters generates N filtered images, consequently increasing the amount of data considerably. Moreover, not all these filters have the same discriminatory capabilities for the individual images, thus making the task of any classifier difficult. In this paper, we use genetic algorithms to select a subset of relevant filters. Genetic algorithms represent a class of adaptive search techniques where the processes are similar to natural selection of biological evolution. The steady state model (GENITOR) has been used in this paper. The reduction of filters improves the performance of the classifier (which in this paper is the multi-layer perceptron neural network) and furthermore reduces the computational requirement. In this study we use the Laws filters which were proposed for the analysis of texture images. Our aim is to recognize the different textures on the images using the reduced filter set.
FOGSAA: Fast Optimal Global Sequence Alignment Algorithm
Chakraborty, Angana; Bandyopadhyay, Sanghamitra
2013-04-01
In this article we propose a Fast Optimal Global Sequence Alignment Algorithm, FOGSAA, which aligns a pair of nucleotide/protein sequences faster than any optimal global alignment method including the widely used Needleman-Wunsch (NW) algorithm. FOGSAA is applicable for all types of sequences, with any scoring scheme, and with or without affine gap penalty. Compared to NW, FOGSAA achieves a time gain of (70-90)% for highly similar nucleotide sequences (> 80% similarity), and (54-70)% for sequences having (30-80)% similarity. For other sequences, it terminates with an approximate score. For protein sequences, the average time gain is between (25-40)%. Compared to three heuristic global alignment methods, the quality of alignment is improved by about 23%-53%. FOGSAA is, in general, suitable for aligning any two sequences defined over a finite alphabet set, where the quality of the global alignment is of supreme importance.
Jordan, Gregory; Goldman, Nick
2012-04-01
When detecting positive selection in proteins, the prevalence of errors resulting from misalignment and the ability of alignment filters to mitigate such errors are not well understood, but filters are commonly applied to try to avoid false positive results. Focusing on the sitewise detection of positive selection across a wide range of divergence levels and indel rates, we performed simulation experiments to quantify the false positives and false negatives introduced by alignment error and the ability of alignment filters to improve performance. We found that some aligners led to many false positives, whereas others resulted in very few. False negatives were a problem for all aligners, increasing with sequence divergence. Of the aligners tested, PRANK's codon-based alignments consistently performed the best and ClustalW performed the worst. Of the filters tested, GUIDANCE performed the best and Gblocks performed the worst. Although some filters showed good ability to reduce the error rates from ClustalW and MAFFT alignments, none were found to substantially improve the performance of PRANK alignments under most conditions. Our results revealed distinct trends in error rates and power levels for aligners and filters within a biologically plausible parameter space. With the best aligner, a low false positive rate was maintained even with extremely divergent indel-prone sequences. Controls using the true alignment and an optimal filtering method suggested that performance improvements could be gained by improving aligners or filters to reduce the prevalence of false negatives, especially at higher divergence levels and indel rates.
Filtering algorithms using shiftable kernels
Chaudhury, Kunal Narayan
2011-01-01
It was recently demonstrated in [4][arxiv:1105.4204] that the non-linear bilateral filter \\cite{Tomasi} can be efficiently implemented using an O(1) or constant-time algorithm. At the heart of this algorithm was the idea of approximating the Gaussian range kernel of the bilateral filter using trigonometric functions. In this letter, we explain how the idea in [4] can be extended to few other linear and non-linear filters [18,21,2]. While some of these filters have received a lot of attention in recent years, they are known to be computationally intensive. To extend the idea in \\cite{Chaudhury2011}, we identify a central property of trigonometric functions, called shiftability, that allows us to exploit the redundancy inherent in the filtering operations. In particular, using shiftable kernels, we show how certain complex filtering can be reduced to simply that of computing the moving sum of a stack of images. Each image in the stack is obtained through an elementary pointwise transform of the input image. Thi...
A Vondrak low pass filter for IMU sensor initial alignment on a disturbed base.
Li, Zengke; Wang, Jian; Gao, Jingxiang; Li, Binghao; Zhou, Feng
2014-12-10
The initial alignment of the Inertial Measurement Unit (IMU) is an important process of INS to determine the coordinate transformation matrix which is used in the integration of Global Positioning Systems (GPS) with Inertial Navigation Systems (INS). In this paper a novel alignment method for a disturbed base, such as a vehicle disturbed by wind outdoors, implemented with the aid of a Vondrak low pass filter, is proposed. The basic principle of initial alignment including coarse alignment and fine alignment is introduced first. The spectral analysis is processed to compare the differences between the characteristic error of INS force observation on a stationary base and on disturbed bases. In order to reduce the high frequency noise in the force observation more accurately and more easily, a Vondrak low pass filter is constructed based on the spectral analysis result. The genetic algorithms method is introduced to choose the smoothing factor in the Vondrak filter and the corresponding objective condition is built. The architecture of the proposed alignment method with the Vondrak low pass filter is shown. Furthermore, simulated experiments and actual experiments were performed to validate the new algorithm. The results indicate that, compared with the conventional alignment method, the Vondrak filter could eliminate the high frequency noise in the force observation and the proposed alignment method could improve the attitude accuracy. At the same time, only one parameter needs to be set, which makes the proposed method easier to implement than other low-pass filter methods.
A Vondrak Low Pass Filter for IMU Sensor Initial Alignment on a Disturbed Base
Directory of Open Access Journals (Sweden)
Zengke Li
2014-12-01
Full Text Available The initial alignment of the Inertial Measurement Unit (IMU is an important process of INS to determine the coordinate transformation matrix which is used in the integration of Global Positioning Systems (GPS with Inertial Navigation Systems (INS. In this paper a novel alignment method for a disturbed base, such as a vehicle disturbed by wind outdoors, implemented with the aid of a Vondrak low pass filter, is proposed. The basic principle of initial alignment including coarse alignment and fine alignment is introduced first. The spectral analysis is processed to compare the differences between the characteristic error of INS force observation on a stationary base and on disturbed bases. In order to reduce the high frequency noise in the force observation more accurately and more easily, a Vondrak low pass filter is constructed based on the spectral analysis result. The genetic algorithms method is introduced to choose the smoothing factor in the Vondrak filter and the corresponding objective condition is built. The architecture of the proposed alignment method with the Vondrak low pass filter is shown. Furthermore, simulated experiments and actual experiments were performed to validate the new algorithm. The results indicate that, compared with the conventional alignment method, the Vondrak filter could eliminate the high frequency noise in the force observation and the proposed alignment method could improve the attitude accuracy. At the same time, only one parameter needs to be set, which makes the proposed method easier to implement than other low-pass filter methods.
Utilizing Time Redundancy for Particle Filter-Based Transfer Alignment
Chattaraj, Suvendu; Mukherjee, Abhik
2016-07-01
Signal detection in the presence of high noise is a challenge in natural sciences. From understanding signals emanating out of deep space probes to signals in protein interactions for systems biology, domain specific innovations are needed. The present work is in the domain of transfer alignment (TA), which deals with estimation of the misalignment of deliverable daughter munitions with respect to that of the delivering mother platform. In this domain, the design of noise filtering scheme has to consider a time varying and nonlinear system dynamics at play. The accuracy of conventional particle filter formulation suffers due to deviations from modeled system dynamics. An evolutionary particle filter can overcome this problem by evolving multiple system models through few support points per particle. However, this variant has even higher time complexity for real-time execution. As a result, measurement update gets deferred and the estimation accuracy is compromised. By running these filter algorithms on multiple processors, the execution time can be reduced, to allow frequent measurement updates. Such scheme ensures better system identification so that performance improves in case of simultaneous ejection of multiple daughters and also results in better convergence of TA algorithms for single daughter.
New Attitude Sensor Alignment Calibration Algorithms
Hashmall, Joseph A.; Sedlak, Joseph E.; Harman, Richard (Technical Monitor)
2002-01-01
Accurate spacecraft attitudes may only be obtained if the primary attitude sensors are well calibrated. Launch shock, relaxation of gravitational stresses and similar effects often produce large enough alignment shifts so that on-orbit alignment calibration is necessary if attitude accuracy requirements are to be met. A variety of attitude sensor alignment algorithms have been developed to meet the need for on-orbit calibration. Two new algorithms are presented here: ALICAL and ALIQUEST. Each of these has advantages in particular circumstances. ALICAL is an attitude independent algorithm that uses near simultaneous measurements from two or more sensors to produce accurate sensor alignments. For each set of simultaneous observations the attitude is overdetermined. The information content of the extra degrees of freedom can be combined over numerous sets to provide the sensor alignments. ALIQUEST is an attitude dependent algorithm that combines sensor and attitude data into a loss function that has the same mathematical form as the Wahba problem. Alignments can then be determined using any of the algorithms (such as the QUEST quaternion estimator) that have been developed to solve the Wahba problem for attitude. Results from the use of these methods on active missions are presented.
Fast Implementation of Matched Filter Based Automatic Alignment Image Processing
Energy Technology Data Exchange (ETDEWEB)
Awwal, A S; Rice, K; Taha, T
2008-04-02
Video images of laser beams imprinted with distinguishable features are used for alignment of 192 laser beams at the National Ignition Facility (NIF). Algorithms designed to determine the position of these beams enable the control system to perform the task of alignment. Centroiding is a common approach used for determining the position of beams. However, real world beam images suffer from intensity fluctuation or other distortions which make such an approach susceptible to higher position measurement variability. Matched filtering used for identifying the beam position results in greater stability of position measurement compared to that obtained using the centroiding technique. However, this gain is achieved at the expense of extra processing time required for each beam image. In this work we explore the possibility of using a field programmable logic array (FPGA) to speed up these computations. The results indicate a performance improvement of 20 using the FPGA relative to a 3 GHz Pentium 4 processor.
A Clustal Alignment Improver Using Evolutionary Algorithms
DEFF Research Database (Denmark)
Thomsen, Rene; Fogel, Gary B.; Krink, Thimo
2002-01-01
Multiple sequence alignment (MSA) is a crucial task in bioinformatics. In this paper we extended previous work with evolutionary algorithms (EA) by using MSA solutions obtained from the wellknown Clustal V algorithm as a candidate solution seed of the initial EA population. Our results clearly show...
Algorithms for Automatic Alignment of Arrays
Chatterjee, Siddhartha; Gilbert, John R.; Oliker, Leonid; Schreiber, Robert; Sheffler, Thomas J.
1996-01-01
Aggregate data objects (such as arrays) are distributed across the processor memories when compiling a data-parallel language for a distributed-memory machine. The mapping determines the amount of communication needed to bring operands of parallel operations into alignment with each other. A common approach is to break the mapping into two stages: an alignment that maps all the objects to an abstract template, followed by a distribution that maps the template to the processors. This paper describes algorithms for solving the various facets of the alignment problem: axis and stride alignment, static and mobile offset alignment, and replication labeling. We show that optimal axis and stride alignment is NP-complete for general program graphs, and give a heuristic method that can explore the space of possible solutions in a number of ways. We show that some of these strategies can give better solutions than a simple greedy approach proposed earlier. We also show how local graph contractions can reduce the size of the problem significantly without changing the best solution. This allows more complex and effective heuristics to be used. We show how to model the static offset alignment problem using linear programming, and we show that loop-dependent mobile offset alignment is sometimes necessary for optimum performance. We describe an algorithm with for determining mobile alignments for objects within do loops. We also identify situations in which replicated alignment is either required by the program itself or can be used to improve performance. We describe an algorithm based on network flow that replicates objects so as to minimize the total amount of broadcast communication in replication.
Filtering algorithm for dotted interferences
Energy Technology Data Exchange (ETDEWEB)
Osterloh, K., E-mail: kurt.osterloh@bam.de [Federal Institute for Materials Research and Testing (BAM), Division VIII.3, Radiological Methods, Unter den Eichen 87, 12205 Berlin (Germany); Buecherl, T.; Lierse von Gostomski, Ch. [Technische Universitaet Muenchen, Lehrstuhl fuer Radiochemie, Walther-Meissner-Str. 3, 85748 Garching (Germany); Zscherpel, U.; Ewert, U. [Federal Institute for Materials Research and Testing (BAM), Division VIII.3, Radiological Methods, Unter den Eichen 87, 12205 Berlin (Germany); Bock, S. [Technische Universitaet Muenchen, Lehrstuhl fuer Radiochemie, Walther-Meissner-Str. 3, 85748 Garching (Germany)
2011-09-21
An algorithm has been developed to remove reliably dotted interferences impairing the perceptibility of objects within a radiographic image. This particularly is a major challenge encountered with neutron radiographs collected at the NECTAR facility, Forschungs-Neutronenquelle Heinz Maier-Leibnitz (FRM II): the resulting images are dominated by features resembling a snow flurry. These artefacts are caused by scattered neutrons, gamma radiation, cosmic radiation, etc. all hitting the detector CCD directly in spite of a sophisticated shielding. This makes such images rather useless for further direct evaluations. One approach to resolve this problem of these random effects would be to collect a vast number of single images, to combine them appropriately and to process them with common image filtering procedures. However, it has been shown that, e.g. median filtering, depending on the kernel size in the plane and/or the number of single shots to be combined, is either insufficient or tends to blur sharp lined structures. This inevitably makes a visually controlled processing image by image unavoidable. Particularly in tomographic studies, it would be by far too tedious to treat each single projection by this way. Alternatively, it would be not only more comfortable but also in many cases the only reasonable approach to filter a stack of images in a batch procedure to get rid of the disturbing interferences. The algorithm presented here meets all these requirements. It reliably frees the images from the snowy pattern described above without the loss of fine structures and without a general blurring of the image. It consists of an iterative, within a batch procedure parameter free filtering algorithm aiming to eliminate the often complex interfering artefacts while leaving the original information untouched as far as possible.
Convergent algorithms for protein structural alignment
Directory of Open Access Journals (Sweden)
Martínez José
2007-08-01
Full Text Available Abstract Background Many algorithms exist for protein structural alignment, based on internal protein coordinates or on explicit superposition of the structures. These methods are usually successful for detecting structural similarities. However, current practical methods are seldom supported by convergence theories. In particular, although the goal of each algorithm is to maximize some scoring function, there is no practical method that theoretically guarantees score maximization. A practical algorithm with solid convergence properties would be useful for the refinement of protein folding maps, and for the development of new scores designed to be correlated with functional similarity. Results In this work, the maximization of scoring functions in protein alignment is interpreted as a Low Order Value Optimization (LOVO problem. The new interpretation provides a framework for the development of algorithms based on well established methods of continuous optimization. The resulting algorithms are convergent and increase the scoring functions at every iteration. The solutions obtained are critical points of the scoring functions. Two algorithms are introduced: One is based on the maximization of the scoring function with Dynamic Programming followed by the continuous maximization of the same score, with respect to the protein position, using a smooth Newtonian method. The second algorithm replaces the Dynamic Programming step by a fast procedure for computing the correspondence between Cα atoms. The algorithms are shown to be very effective for the maximization of the STRUCTAL score. Conclusion The interpretation of protein alignment as a LOVO problem provides a new theoretical framework for the development of convergent protein alignment algorithms. These algorithms are shown to be very reliable for the maximization of the STRUCTAL score, and other distance-dependent scores may be optimized with same strategy. The improved score optimization
Rapid Transfer Alignment of MEMS SINS Based on Adaptive Incremental Kalman Filter
Directory of Open Access Journals (Sweden)
Hairong Chu
2017-01-01
Full Text Available In airborne MEMS SINS transfer alignment, the error of MEMS IMU is highly environment-dependent and the parameters of the system model are also uncertain, which may lead to large error and bad convergence of the Kalman filter. In order to solve this problem, an improved adaptive incremental Kalman filter (AIKF algorithm is proposed. First, the model of SINS transfer alignment is defined based on the “Velocity and Attitude” matching method. Then the detailed algorithm progress of AIKF and its recurrence formulas are presented. The performance and calculation amount of AKF and AIKF are also compared. Finally, a simulation test is designed to verify the accuracy and the rapidity of the AIKF algorithm by comparing it with KF and AKF. The results show that the AIKF algorithm has better estimation accuracy and shorter convergence time, especially for the bias of the gyroscope and the accelerometer, which can meet the accuracy and rapidity requirement of transfer alignment.
Rapid Transfer Alignment of MEMS SINS Based on Adaptive Incremental Kalman Filter.
Chu, Hairong; Sun, Tingting; Zhang, Baiqiang; Zhang, Hongwei; Chen, Yang
2017-01-14
In airborne MEMS SINS transfer alignment, the error of MEMS IMU is highly environment-dependent and the parameters of the system model are also uncertain, which may lead to large error and bad convergence of the Kalman filter. In order to solve this problem, an improved adaptive incremental Kalman filter (AIKF) algorithm is proposed. First, the model of SINS transfer alignment is defined based on the "Velocity and Attitude" matching method. Then the detailed algorithm progress of AIKF and its recurrence formulas are presented. The performance and calculation amount of AKF and AIKF are also compared. Finally, a simulation test is designed to verify the accuracy and the rapidity of the AIKF algorithm by comparing it with KF and AKF. The results show that the AIKF algorithm has better estimation accuracy and shorter convergence time, especially for the bias of the gyroscope and the accelerometer, which can meet the accuracy and rapidity requirement of transfer alignment.
Enhanced Dynamic Algorithm of Genome Sequence Alignments
Directory of Open Access Journals (Sweden)
Arabi E. keshk
2014-05-01
Full Text Available The merging of biology and computer science has created a new field called computational biology that explore the capacities of computers to gain knowledge from biological data, bioinformatics. Computational biology is rooted in life sciences as well as computers, information sciences, and technologies. The main problem in computational biology is sequence alignment that is a way of arranging the sequences of DNA, RNA or protein to identify the region of similarity and relationship between sequences. This paper introduces an enhancement of dynamic algorithm of genome sequence alignment, which called EDAGSA. It is filling the three main diagonals without filling the entire matrix by the unused data. It gets the optimal solution with decreasing the execution time and therefore the performance is increased. To illustrate the effectiveness of optimizing the performance of the proposed algorithm, it is compared with the traditional methods such as Needleman-Wunsch, Smith-Waterman and longest common subsequence algorithms. Also, database is implemented for using the algorithm in multi-sequence alignments for searching the optimal sequence that matches the given sequence.
Adaptive Filtering Algorithms and Practical Implementation
Diniz, Paulo S R
2013-01-01
In the fourth edition of Adaptive Filtering: Algorithms and Practical Implementation, author Paulo S.R. Diniz presents the basic concepts of adaptive signal processing and adaptive filtering in a concise and straightforward manner. The main classes of adaptive filtering algorithms are presented in a unified framework, using clear notations that facilitate actual implementation. The main algorithms are described in tables, which are detailed enough to allow the reader to verify the covered concepts. Many examples address problems drawn from actual applications. New material to this edition includes: Analytical and simulation examples in Chapters 4, 5, 6 and 10 Appendix E, which summarizes the analysis of set-membership algorithm Updated problems and references Providing a concise background on adaptive filtering, this book covers the family of LMS, affine projection, RLS and data-selective set-membership algorithms as well as nonlinear, sub-band, blind, IIR adaptive filtering, and more. Several problems are...
LHCb: Alignment of the LHCb Detector with Kalman Filter Fitted Tracks
Amoraal, J; Hulsbergen, W; Needham, M; Nicolas, L; Pozzi, S; Raven, G; Vecchi, S
2009-01-01
We report on an implementation of a global chisquare algorithm for the simultaneous alignment of all tracking systems in the LHCb detector. Our algorithm uses hit residuals from the standard LHCb track fit which is based on a Kalman filter. The algorithm is implemented in the LHCb reconstruction framework and exploits the fact that all sensitive detector elements have the same geometry interface. A vertex constraint is implemented by fitting tracks to a common point and propagating the change in track parameters to the hit residuals. To remove unconstrained or poorly constrained degrees of freedom (so-called weak modes) the average movements of (subsets of) alignable detector elements can be fixed with Lagrange constraints. Alternatively, weak modes can be removed with a cutoff in the eigenvalue spectrum of the second derivative of the chisquare. As for all LHCb reconstruction and analysis software the configuration of the algorithm is done in python and gives detailed control over the selection of alignable ...
Comparison of robust H∞ filter and Kalman filter for initial alignment of inertial navigation system
Institute of Scientific and Technical Information of China (English)
HAO Yan-ling; CHEN Ming-hui; LI Liang-jun; XU Bo
2008-01-01
There are many filtering methods that can be used for the initial alignment of an integrated inertial navigation system.This paper discussed the use of GPS,but focused on two kinds of filters for the initial alignment of an integrated strapdown inertial navigation system (SINS).One method is based on the Kalman filter (KF),and the other is based on the robust filter.Simulation results showed that the filter provides a quick transient response and a little more accurate estimate than KF,given substantial process noise or unknown noise statistics.So the robust filter is an effective and useful method for initial alignment of SINS.This research should make the use of SINS more popular,and is also a step for further research.
Alignment of the LHCb detector with Kalman filter fitted tracks
Amoraal, J M
2009-01-01
The LHCb detector, operating at the Large Hadron Collider at CERN, is a single arm spectrometer optimised for the detection of forward b and anti-b production for b physics studies. The reconstruction of vertices and tracks is done by silicon micro-strip and gaseous straw-tube based detectors. To obtain excellent momentum, mass and vertex resolutions, the detectors need to be aligned well within the hit resolution for a given detector. We present a general and easy to configure alignment framework which uses the closed from method of alignment with Kalman filter fitted tracks to determine the alignment parameters. This allows us to use the standard LHCb track model and fit, and correctly take complexities such as multiple scattering and energy loss corrections into account. With this framework it is possible to align any detector for any degree of freedom.
SPA: a probabilistic algorithm for spliced alignment.
Directory of Open Access Journals (Sweden)
Erik van Nimwegen
2006-04-01
Full Text Available Recent large-scale cDNA sequencing efforts show that elaborate patterns of splice variation are responsible for much of the proteome diversity in higher eukaryotes. To obtain an accurate account of the repertoire of splice variants, and to gain insight into the mechanisms of alternative splicing, it is essential that cDNAs are very accurately mapped to their respective genomes. Currently available algorithms for cDNA-to-genome alignment do not reach the necessary level of accuracy because they use ad hoc scoring models that cannot correctly trade off the likelihoods of various sequencing errors against the probabilities of different gene structures. Here we develop a Bayesian probabilistic approach to cDNA-to-genome alignment. Gene structures are assigned prior probabilities based on the lengths of their introns and exons, and based on the sequences at their splice boundaries. A likelihood model for sequencing errors takes into account the rates at which misincorporation, as well as insertions and deletions of different lengths, occurs during sequencing. The parameters of both the prior and likelihood model can be automatically estimated from a set of cDNAs, thus enabling our method to adapt itself to different organisms and experimental procedures. We implemented our method in a fast cDNA-to-genome alignment program, SPA, and applied it to the FANTOM3 dataset of over 100,000 full-length mouse cDNAs and a dataset of over 20,000 full-length human cDNAs. Comparison with the results of four other mapping programs shows that SPA produces alignments of significantly higher quality. In particular, the quality of the SPA alignments near splice boundaries and SPA's mapping of the 5' and 3' ends of the cDNAs are highly improved, allowing for more accurate identification of transcript starts and ends, and accurate identification of subtle splice variations. Finally, our splice boundary analysis on the human dataset suggests the existence of a novel non
IMM Iterated Extended Particle Filter Algorithm
Yang Wan; Shouyong Wang; Xing Qin
2013-01-01
In order to solve the tracking problem of radar maneuvering target in nonlinear system model and non-Gaussian noise background, this paper puts forward one interacting multiple model (IMM) iterated extended particle filter algorithm (IMM-IEHPF). The algorithm makes use of multiple modes to model the target motion form to track any maneuvering target and each mode uses iterated extended particle filter (IEHPF) to deal with the state estimation problem of nonlinear non-Gaussian system. IEH...
Cover song identification by sequence alignment algorithms
Wang, Chih-Li; Zhong, Qian; Wang, Szu-Ying; Roychowdhury, Vwani
2011-10-01
Content-based music analysis has drawn much attention due to the rapidly growing digital music market. This paper describes a method that can be used to effectively identify cover songs. A cover song is a song that preserves only the crucial melody of its reference song but different in some other acoustic properties. Hence, the beat/chroma-synchronous chromagram, which is insensitive to the variation of the timber or rhythm of songs but sensitive to the melody, is chosen. The key transposition is achieved by cyclically shifting the chromatic domain of the chromagram. By using the Hidden Markov Model (HMM) to obtain the time sequences of songs, the system is made even more robust. Similar structure or length between the cover songs and its reference are not necessary by the Smith-Waterman Alignment Algorithm.
Implementation of Accelerated Beam-Specific Matched-Filter-Based Optical Alignment
Energy Technology Data Exchange (ETDEWEB)
Awwal, A S; Rice, K L; Taha, T M
2009-01-29
Accurate automated alignment of laser beams in the National Ignition Facility (NIF) is essential for achieving extreme temperature and pressure required for inertial confinement fusion. The alignment achieved by the integrated control systems relies on algorithms processing video images to determine the position of the laser beam images in real-time. Alignment images that exhibit wide variations in beam quality require a matched-filter algorithm for position detection. One challenge in designing a matched-filter based algorithm is to construct a filter template that is resilient to variations in imaging conditions while guaranteeing accurate position determination. A second challenge is to process the image as fast as possible. This paper describes the development of a new analytical template that captures key recurring features present in the beam image to accurately estimate the beam position under good image quality conditions. Depending on the features present in a particular beam, the analytical template allows us to create a highly tailored template containing only those selected features. The second objective is achieved by exploiting the parallelism inherent in the algorithm to accelerate processing using parallel hardware that provides significant performance improvement over conventional processors. In particular, a Xilinx Virtex II Pro FPGA hardware implementation processing 32 templates provided a speed increase of about 253 times over an optimized software implementation running on a 2.0 GHz AMD Opteron core.
Novel hybrid genetic algorithm for progressive multiple sequence alignment.
Afridi, Muhammad Ishaq
2013-01-01
The family of evolutionary or genetic algorithms is used in various fields of bioinformatics. Genetic algorithms (GAs) can be used for simultaneous comparison of a large pool of DNA or protein sequences. This article explains how the GA is used in combination with other methods like the progressive multiple sequence alignment strategy to get an optimal multiple sequence alignment (MSA). Optimal MSA get much importance in the field of bioinformatics and some other related disciplines. Evolutionary algorithms evolve and improve their performance. In this optimisation, the initial pair-wise alignment is achieved through a progressive method and then a good objective function is used to select and align more alignments and profiles. Child and subpopulation initialisation is based upon changes in the probability of similarity or the distance matrix of the alignment population. In this genetic algorithm, optimisation of mutation, crossover and migration in the population of candidate solution reflect events of natural organic evolution.
CSA: An efficient algorithm to improve circular DNA multiple alignment
Directory of Open Access Journals (Sweden)
Pereira Luísa
2009-07-01
Full Text Available Abstract Background The comparison of homologous sequences from different species is an essential approach to reconstruct the evolutionary history of species and of the genes they harbour in their genomes. Several complete mitochondrial and nuclear genomes are now available, increasing the importance of using multiple sequence alignment algorithms in comparative genomics. MtDNA has long been used in phylogenetic analysis and errors in the alignments can lead to errors in the interpretation of evolutionary information. Although a large number of multiple sequence alignment algorithms have been proposed to date, they all deal with linear DNA and cannot handle directly circular DNA. Researchers interested in aligning circular DNA sequences must first rotate them to the "right" place using an essentially manual process, before they can use multiple sequence alignment tools. Results In this paper we propose an efficient algorithm that identifies the most interesting region to cut circular genomes in order to improve phylogenetic analysis when using standard multiple sequence alignment algorithms. This algorithm identifies the largest chain of non-repeated longest subsequences common to a set of circular mitochondrial DNA sequences. All the sequences are then rotated and made linear for multiple alignment purposes. To evaluate the effectiveness of this new tool, three different sets of mitochondrial DNA sequences were considered. Other tests considering randomly rotated sequences were also performed. The software package Arlequin was used to evaluate the standard genetic measures of the alignments obtained with and without the use of the CSA algorithm with two well known multiple alignment algorithms, the CLUSTALW and the MAVID tools, and also the visualization tool SinicView. Conclusion The results show that a circularization and rotation pre-processing step significantly improves the efficiency of public available multiple sequence alignment
Genomic multiple sequence alignments: refinement using a genetic algorithm
Directory of Open Access Journals (Sweden)
Lefkowitz Elliot J
2005-08-01
Full Text Available Abstract Background Genomic sequence data cannot be fully appreciated in isolation. Comparative genomics – the practice of comparing genomic sequences from different species – plays an increasingly important role in understanding the genotypic differences between species that result in phenotypic differences as well as in revealing patterns of evolutionary relationships. One of the major challenges in comparative genomics is producing a high-quality alignment between two or more related genomic sequences. In recent years, a number of tools have been developed for aligning large genomic sequences. Most utilize heuristic strategies to identify a series of strong sequence similarities, which are then used as anchors to align the regions between the anchor points. The resulting alignment is globally correct, but in many cases is suboptimal locally. We describe a new program, GenAlignRefine, which improves the overall quality of global multiple alignments by using a genetic algorithm to improve local regions of alignment. Regions of low quality are identified, realigned using the program T-Coffee, and then refined using a genetic algorithm. Because a better COFFEE (Consistency based Objective Function For alignmEnt Evaluation score generally reflects greater alignment quality, the algorithm searches for an alignment that yields a better COFFEE score. To improve the intrinsic slowness of the genetic algorithm, GenAlignRefine was implemented as a parallel, cluster-based program. Results We tested the GenAlignRefine algorithm by running it on a Linux cluster to refine sequences from a simulation, as well as refine a multiple alignment of 15 Orthopoxvirus genomic sequences approximately 260,000 nucleotides in length that initially had been aligned by Multi-LAGAN. It took approximately 150 minutes for a 40-processor Linux cluster to optimize some 200 fuzzy (poorly aligned regions of the orthopoxvirus alignment. Overall sequence identity increased only
General space-efficient sampling algorithm for suboptimal alignment
Institute of Scientific and Technical Information of China (English)
CHEN; Yi; BAI; Yan-qin
2009-01-01
Suboptimal alignments always reveal additional interesting biological features and have been successfully used to informally estimate the significance of an optimal alignment. Besides, traditional dynamic programming algorithms for sequence comparison require quadratic space, and hence are infeasible for long protein or DNA sequences. In this paper, a space-efficient sampling algorithm for computing suboptimal alignments is described. The algorithm uses a general gap model, where the cost associated with gaps is given by an affine score, and randomly selects an alignment according to the distribution of weights of all potential alignments. If x and y are two sequences with lengths n and m, respectively, then the space requirement of this algorithm is linear to the sum of n and m. Finally, an example illustrates the utility of the algorithm.
A Kalman Filter for SINS Self-Alignment Based on Vector Observation.
Xu, Xiang; Xu, Xiaosu; Zhang, Tao; Li, Yao; Tong, Jinwu
2017-01-29
In this paper, a self-alignment method for strapdown inertial navigation systems based on the q-method is studied. In addition, an improved method based on integrating gravitational apparent motion to form apparent velocity is designed, which can reduce the random noises of the observation vectors. For further analysis, a novel self-alignment method using a Kalman filter based on adaptive filter technology is proposed, which transforms the self-alignment procedure into an attitude estimation using the observation vectors. In the proposed method, a linear psuedo-measurement equation is adopted by employing the transfer method between the quaternion and the observation vectors. Analysis and simulation indicate that the accuracy of the self-alignment is improved. Meanwhile, to improve the convergence rate of the proposed method, a new method based on parameter recognition and a reconstruction algorithm for apparent gravitation is devised, which can reduce the influence of the random noises of the observation vectors. Simulations and turntable tests are carried out, and the results indicate that the proposed method can acquire sound alignment results with lower standard variances, and can obtain higher alignment accuracy and a faster convergence rate.
A new adaptive filtering algorithm for systems with multiplicative noise
Institute of Scientific and Technical Information of China (English)
WANG Hui-li; CHEN Xi-xin; LU Qian-hao
2005-01-01
Presented here is a new adaptive state filtering algorithm for systems with multiplicative noise. This algorithm estimates the vector state of the system and the statistics of noise when all the statistics of noise are unknown. This filtering algorithm is a simple recursive structure. A simulation example is presented which demonstrates the effectiveness of this filtering algorithm.
Quality measures for HRR alignment based ISAR imaging algorithms
CSIR Research Space (South Africa)
Janse van Rensburg, V
2013-05-01
Full Text Available Some Inverse Synthetic Aperture Radar (ISAR) algorithms form the image in a two-step process of range alignment and phase conjugation. This paper discusses a comprehensive set of measures used to quantify the quality of range alignment, with the aim...
Splign: algorithms for computing spliced alignments with identification of paralogs
Directory of Open Access Journals (Sweden)
Tatusova Tatiana
2008-05-01
Full Text Available Abstract Background The computation of accurate alignments of cDNA sequences against a genome is at the foundation of modern genome annotation pipelines. Several factors such as presence of paralogs, small exons, non-consensus splice signals, sequencing errors and polymorphic sites pose recognized difficulties to existing spliced alignment algorithms. Results We describe a set of algorithms behind a tool called Splign for computing cDNA-to-Genome alignments. The algorithms include a high-performance preliminary alignment, a compartment identification based on a formally defined model of adjacent duplicated regions, and a refined sequence alignment. In a series of tests, Splign has produced more accurate results than other tools commonly used to compute spliced alignments, in a reasonable amount of time. Conclusion Splign's ability to deal with various issues complicating the spliced alignment problem makes it a helpful tool in eukaryotic genome annotation processes and alternative splicing studies. Its performance is enough to align the largest currently available pools of cDNA data such as the human EST set on a moderate-sized computing cluster in a matter of hours. The duplications identification (compartmentization algorithm can be used independently in other areas such as the study of pseudogenes. Reviewers This article was reviewed by: Steven Salzberg, Arcady Mushegian and Andrey Mironov (nominated by Mikhail Gelfand.
A New Filtering Algorithm Utilizing Radial Velocity Measurement
Institute of Scientific and Technical Information of China (English)
LIU Yan-feng; DU Zi-cheng; PAN Quan
2005-01-01
Pulse Doppler radar measurements consist of range, azimuth, elevation and radial velocity. Most of the radar tracking algorithms in engineering only utilize position measurement. The extended Kalman filter with radial velocity measureneut is presented, then a new filtering algorithm utilizing radial velocity measurement is proposed to improve tracking results and the theoretical analysis is also given. Simulation results of the new algorithm, converted measurement Kalman filter, extended Kalman filter are compared. The effectiveness of the new algorithm is verified by simulation results.
Explicit filtering of building blocks for genetic algorithms
Kemenade, C.H.M. van
1996-01-01
Genetic algorithms are often applied to building block problems. We have developed a simple filtering algorithm that can locate building blocks within a bit-string, and does not make assumptions regarding the linkage of the bits. A comparison between the filtering algorithm and genetic algorithms re
Genetic algorithms with permutation coding for multiple sequence alignment.
Ben Othman, Mohamed Tahar; Abdel-Azim, Gamil
2013-08-01
Multiple sequence alignment (MSA) is one of the topics of bio informatics that has seriously been researched. It is known as NP-complete problem. It is also considered as one of the most important and daunting tasks in computational biology. Concerning this a wide number of heuristic algorithms have been proposed to find optimal alignment. Among these heuristic algorithms are genetic algorithms (GA). The GA has mainly two major weaknesses: it is time consuming and can cause local minima. One of the significant aspects in the GA process in MSA is to maximize the similarities between sequences by adding and shuffling the gaps of Solution Coding (SC). Several ways for SC have been introduced. One of them is the Permutation Coding (PC). We propose a hybrid algorithm based on genetic algorithms (GAs) with a PC and 2-opt algorithm. The PC helps to code the MSA solution which maximizes the gain of resources, reliability and diversity of GA. The use of the PC opens the area by applying all functions over permutations for MSA. Thus, we suggest an algorithm to calculate the scoring function for multiple alignments based on PC, which is used as fitness function. The time complexity of the GA is reduced by using this algorithm. Our GA is implemented with different selections strategies and different crossovers. The probability of crossover and mutation is set as one strategy. Relevant patents have been probed in the topic.
Alignment of Custom Standards by Machine Learning Algorithms
Directory of Open Access Journals (Sweden)
Adela Sirbu
2010-09-01
Full Text Available Building an efficient model for automatic alignment of terminologies would bring a significant improvement to the information retrieval process. We have developed and compared two machine learning based algorithms whose aim is to align 2 custom standards built on a 3 level taxonomy, using kNN and SVM classifiers that work on a vector representation consisting of several similarity measures. The weights utilized by the kNN were optimized with an evolutionary algorithm, while the SVM classifier's hyper-parameters were optimized with a grid search algorithm. The database used for train was semi automatically obtained by using the Coma++ tool. The performance of our aligners is shown by the results obtained on the test set.
A filtered backprojection algorithm with characteristics of the iterative landweber algorithm
L. Zeng, Gengsheng
2012-01-01
Purpose: In order to eventually develop an analytical algorithm with noise characteristics of an iterative algorithm, this technical note develops a window function for the filtered backprojection (FBP) algorithm in tomography that behaves as an iterative Landweber algorithm.
Explicit filtering of building blocks for genetic algorithms
C.H.M. van Kemenade
1996-01-01
textabstractGenetic algorithms are often applied to building block problems. We have developed a simple filtering algorithm that can locate building blocks within a bit-string, and does not make assumptions regarding the linkage of the bits. A comparison between the filtering algorithm and genetic
Interpolating and filtering decoding algorithm for convolution codes
Directory of Open Access Journals (Sweden)
O. O. Shpylka
2010-01-01
Full Text Available There has been synthesized interpolating and filtering decoding algorithm for convolution codes on maximum of a posteriori probability criterion, in which combined filtering coder state and interpolation of information signs on sliding interval are processed
Trigger Algorithms for Alignment and Calibration at the CMS Experiment
Fernandez Perez Tomei, Thiago Rafael
2017-01-01
The data needs of the Alignment and Calibration group at the CMS experiment are reasonably different from those of the physics studies groups. Data are taken at CMS through the online event selection system, which is implemented in two steps. The Level-1 Trigger is implemented on custom-made electronics and dedicated to analyse the detector information at a coarse-grained scale, while the High Level Trigger (HLT) is implemented as a series of software algorithms, running in a computing farm, that have access to the full detector information. In this paper we describe the set of trigger algorithms that is deployed to address the needs of the Alignment and Calibration group, how it fits in the general infrastructure of the HLT, and how it feeds the Prompt Calibration Loop (PCL), allowing for a fast turnaround for the alignment and calibration constants.
LASAGNA: A novel algorithm for transcription factor binding site alignment
2013-01-01
Background Scientists routinely scan DNA sequences for transcription factor (TF) binding sites (TFBSs). Most of the available tools rely on position-specific scoring matrices (PSSMs) constructed from aligned binding sites. Because of the resolutions of assays used to obtain TFBSs, databases such as TRANSFAC, ORegAnno and PAZAR store unaligned variable-length DNA segments containing binding sites of a TF. These DNA segments need to be aligned to build a PSSM. While the TRANSFAC database provides scoring matrices for TFs, nearly 78% of the TFs in the public release do not have matrices available. As work on TFBS alignment algorithms has been limited, it is highly desirable to have an alignment algorithm tailored to TFBSs. Results We designed a novel algorithm named LASAGNA, which is aware of the lengths of input TFBSs and utilizes position dependence. Results on 189 TFs of 5 species in the TRANSFAC database showed that our method significantly outperformed ClustalW2 and MEME. We further compared a PSSM method dependent on LASAGNA to an alignment-free TFBS search method. Results on 89 TFs whose binding sites can be located in genomes showed that our method is significantly more precise at fixed recall rates. Finally, we described LASAGNA-ChIP, a more sophisticated version for ChIP (Chromatin immunoprecipitation) experiments. Under the one-per-sequence model, it showed comparable performance with MEME in discovering motifs in ChIP-seq peak sequences. Conclusions We conclude that the LASAGNA algorithm is simple and effective in aligning variable-length binding sites. It has been integrated into a user-friendly webtool for TFBS search and visualization called LASAGNA-Search. The tool currently stores precomputed PSSM models for 189 TFs and 133 TFs built from TFBSs in the TRANSFAC Public database (release 7.0) and the ORegAnno database (08Nov10 dump), respectively. The webtool is available at http://biogrid.engr.uconn.edu/lasagna_search/. PMID:23522376
National Research Council Canada - National Science Library
Sayed Mohammad Ebrahim Sahraeian; Byung-Jun Yoon
2013-01-01
.... We demonstrate that the proposed algorithm, called SMETANA, outperforms many state-of-the-art network alignment techniques, in terms of computational efficiency, alignment accuracy, and scalability...
National Research Council Canada - National Science Library
Sahraeian, Sayed Mohammad Ebrahim; Yoon, Byung-Jun
2013-01-01
.... We demonstrate that the proposed algorithm, called SMETANA, outperforms many state-of-the-art network alignment techniques, in terms of computational efficiency, alignment accuracy, and scalability...
Application of H∞ filtering in the initial alignment of strapdown inertial navigation system
Institute of Scientific and Technical Information of China (English)
YU Fei; SUN Feng
2005-01-01
In this paper , the principle of H∞ filtering is discussed and H∞ filter is constructed, which is used in the initial alignment of the strapdown inertial navigation systems(SINS). The error model of SINS is derived. By utilizing constructed H∞ filter, the filtering calculation to that system has been conducted. The simulation results of the misalignment angle are given under the condition of unknown noises. The results show that the process of alignment with H∞ filter is much faster and with excellent robustness.
Aligning multiple protein sequences by parallel hybrid genetic algorithm.
Nguyen, Hung Dinh; Yoshihara, Ikuo; Yamamori, Kunihito; Yasunaga, Moritoshi
2002-01-01
This paper presents a parallel hybrid genetic algorithm (GA) for solving the sum-of-pairs multiple protein sequence alignment. A new chromosome representation and its corresponding genetic operators are proposed. A multi-population GENITOR-type GA is combined with local search heuristics. It is then extended to run in parallel on a multiprocessor system for speeding up. Experimental results of benchmarks from the BAliBASE show that the proposed method is superior to MSA, OMA, and SAGA methods with regard to quality of solution and running time. It can be used for finding multiple sequence alignment as well as testing cost functions.
Directory of Open Access Journals (Sweden)
Yun Li
2016-12-01
Full Text Available Based on stochastic modeling of Coriolis vibration gyros by the Allan variance technique, this paper discusses Angle Random Walk (ARW, Rate Random Walk (RRW and Markov process gyroscope noises which have significant impacts on the North-finding accuracy. A new continuous rotation alignment algorithm for a Coriolis vibration gyroscope Inertial Measurement Unit (IMU is proposed in this paper, in which the extended observation equations are used for the Kalman filter to enhance the estimation of gyro drift errors, thus improving the north-finding accuracy. Theoretical and numerical comparisons between the proposed algorithm and the traditional ones are presented. The experimental results show that the new continuous rotation alignment algorithm using the extended observation equations in the Kalman filter is more efficient than the traditional two-position alignment method. Using Coriolis vibration gyros with bias instability of 0.1°/h, a north-finding accuracy of 0.1° (1σ is achieved by the new continuous rotation alignment algorithm, compared with 0.6° (1σ north-finding accuracy for the two-position alignment and 1° (1σ for the fixed-position alignment.
Li, Yun; Wu, Wenqi; Jiang, Qingan; Wang, Jinling
2016-01-01
Based on stochastic modeling of Coriolis vibration gyros by the Allan variance technique, this paper discusses Angle Random Walk (ARW), Rate Random Walk (RRW) and Markov process gyroscope noises which have significant impacts on the North-finding accuracy. A new continuous rotation alignment algorithm for a Coriolis vibration gyroscope Inertial Measurement Unit (IMU) is proposed in this paper, in which the extended observation equations are used for the Kalman filter to enhance the estimation of gyro drift errors, thus improving the north-finding accuracy. Theoretical and numerical comparisons between the proposed algorithm and the traditional ones are presented. The experimental results show that the new continuous rotation alignment algorithm using the extended observation equations in the Kalman filter is more efficient than the traditional two-position alignment method. Using Coriolis vibration gyros with bias instability of 0.1°/h, a north-finding accuracy of 0.1° (1σ) is achieved by the new continuous rotation alignment algorithm, compared with 0.6° (1σ) north-finding accuracy for the two-position alignment and 1° (1σ) for the fixed-position alignment. PMID:27983585
An adaptive phase alignment algorithm for cartesian feedback loops
Gimeno-Martin, A.; Pardo-Martin, J.; Ortega-Gonzalez, F.
2010-01-01
An adaptive algorithm to correct phase misalignments in Cartesian feedback linearization loops for power amplifiers has been presented. It yields an error smaller than 0.035 rad between forward and feedback loop signals once convergence is reached. Because this algorithm enables a feedback system to process forward and feedback samples belonging to almost the same algorithm iteration, it is suitable to improve the performance not only of power amplifiers but also any other digital feedback system for communications systems and circuits such as all digital phase locked loops. Synchronizing forward and feedback paths of Cartesian feedback loops takes a small period of time after the system starts up. The phase alignment algorithm needs to converge before the feedback Cartesian loop can start its ideal behavior. However, once the steady state is reached, both paths can be considered synchronized, and the Cartesian feedback loop will only depend on the loop parameters (open-loop gain, loop bandwidth, etc.). It means that the linearization process will also depend only on these parameters since the misalignment effect disappears. Therefore, this algorithm relieves the power amplifier linearizer circuit design of any task required for solving phase misalignment effects inherent to Cartesian feedback systems. Furthermore, when a feedback Cartesian loop has to be designed, the designer can consider that forward and feedback paths are synchronized, since the phase alignment algorithm will do this task. This will reduce the simulation complexity. Then, all efforts are applied to determining the suitable loop parameters that will make the linearization process more efficient.
A Genetic Algorithm on Multiple Sequences Alignment Problems in Biology
Institute of Scientific and Technical Information of China (English)
无
2002-01-01
The study and comparison of sequences of characters from a finite alphabet is relevant to various areas of science, notably molecular biology. The measurement of sequence similarity involves the consideration of the possible sequence alignments in order to find an optimal one for which the "distance" between sequences is minimum. In biology informatics area, it is a more important and difficult problem due to the long length (100 at least) of sequence, this cause the compute complexity and large memory require. By associating a path in a lattice to each alignment, a geometric insight can be brought into the problem of finding an optimal alignment, this give an obvious encoding of each path. This problem can be solved by applying genetic algorithm, which is more efficient than dynamic programming and hidden Markov model using commomly now.
A Simple and Fast Spline Filtering Algorithm for Surface Metrology.
Zhang, Hao; Ott, Daniel; Song, John; Tong, Mingsi; Chu, Wei
2015-01-01
Spline filters and their corresponding robust filters are commonly used filters recommended in ISO (the International Organization for Standardization) standards for surface evaluation. Generally, these linear and non-linear spline filters, composed of symmetric, positive-definite matrices, are solved in an iterative fashion based on a Cholesky decomposition. They have been demonstrated to be relatively efficient, but complicated and inconvenient to implement. A new spline-filter algorithm is proposed by means of the discrete cosine transform or the discrete Fourier transform. The algorithm is conceptually simple and very convenient to implement.
Interference Alignment and Fairness Algorithms for MIMO Cognitive Radio Systems
Directory of Open Access Journals (Sweden)
Feng Zhao
2015-01-01
Full Text Available Interference alignment (IA is an effective technique to eliminate the interference among wireless nodes. In a multiinput multi-output (MIMO cognitive radio system, multiple secondary users can coexist with the primary user without generating any interference by using the IA technology. However, few works have considered the fairness of secondary users. In this paper, not only is the interference eliminated by IA, but also the fairness of secondary users is considered by two kinds of algorithms. Without losing generality, one primary user and K secondary users are considered in the network. Assuming perfect channel knowledge at the primary user, the interference from secondary users to the primary user is aligned into the unused spatial dimension which is obtained by water-filling among primary user. Also, the interference between secondary users can be eliminated by a modified maximum signal-to-interference-plus-noise algorithm using channel reciprocity. In addition, two kinds of fairness algorithms, max-min fairness and proportional fairness, among secondary users are proposed. Simulation results show the effectiveness of the proposed algorithms in terms of suppressed interference and fairness of secondary nodes. What is more, the performances of the two fairness algorithms are compared.
Distortion Parameters Analysis Method Based on Improved Filtering Algorithm
Directory of Open Access Journals (Sweden)
ZHANG Shutuan
2013-10-01
Full Text Available In order to realize the accurate distortion parameters test of aircraft power supply system, and satisfy the requirement of corresponding equipment in the aircraft, the novel power parameters test system based on improved filtering algorithm is introduced in this paper. The hardware of the test system has the characters of s portable and high-speed data acquisition and processing, and the software parts utilize the software Labwindows/CVI as exploitation software, and adopt the pre-processing technique and adding filtering algorithm. Compare with the traditional filtering algorithm, the test system adopted improved filtering algorithm can help to increase the test accuracy. The application shows that the test system with improved filtering algorithm can realize the accurate test results, and reach to the design requirements.
Directory of Open Access Journals (Sweden)
Siddhartha Mukherjee
2014-04-01
Full Text Available This paper gives a detailed study on the performance of image filter algorithm with various parameters applied on an image of RGB model. There are various popular image filters, which consumes large amount of computing resources for processing. Oil paint image filter is one of the very interesting filters, which is very performance hungry. Current research tries to find improvement in oil paint image filter algorithm by using parallel pattern library. With increasing kernel-size, the processing time of oil paint image filter algorithm increases exponentially. I have also observed in various blogs and forums, the questions for faster oil paint have been asked repeatedly.
Minami, Shintaro; Sawada, Kengo; Chikenji, George
2013-01-18
Protein pairs that have the same secondary structure packing arrangement but have different topologies have attracted much attention in terms of both evolution and physical chemistry of protein structures. Further investigation of such protein relationships would give us a hint as to how proteins can change their fold in the course of evolution, as well as a insight into physico-chemical properties of secondary structure packing. For this purpose, highly accurate sequence order independent structure comparison methods are needed. We have developed a novel protein structure alignment algorithm, MICAN (a structure alignment algorithm that can handle Multiple-chain complexes, Inverse direction of secondary structures, Cα only models, Alternative alignments, and Non-sequential alignments). The algorithm was designed so as to identify the best structural alignment between protein pairs by disregarding the connectivity between secondary structure elements (SSE). One of the key feature of the algorithm is utilizing the multiple vector representation for each SSE, which enables us to correctly treat bent or twisted nature of long SSE. We compared MICAN with other 9 publicly available structure alignment programs, using both reference-dependent and reference-independent evaluation methods on a variety of benchmark test sets which include both sequential and non-sequential alignments. We show that MICAN outperforms the other existing methods for reproducing reference alignments of non-sequential test sets. Further, although MICAN does not specialize in sequential structure alignment, it showed the top level performance on the sequential test sets. We also show that MICAN program is the fastest non-sequential structure alignment program among all the programs we examined here. MICAN is the fastest and the most accurate program among non-sequential alignment programs we examined here. These results suggest that MICAN is a highly effective tool for automatically detecting non
2013-01-01
Background Protein pairs that have the same secondary structure packing arrangement but have different topologies have attracted much attention in terms of both evolution and physical chemistry of protein structures. Further investigation of such protein relationships would give us a hint as to how proteins can change their fold in the course of evolution, as well as a insight into physico-chemical properties of secondary structure packing. For this purpose, highly accurate sequence order independent structure comparison methods are needed. Results We have developed a novel protein structure alignment algorithm, MICAN (a structure alignment algorithm that can handle Multiple-chain complexes, Inverse direction of secondary structures, Cα only models, Alternative alignments, and Non-sequential alignments). The algorithm was designed so as to identify the best structural alignment between protein pairs by disregarding the connectivity between secondary structure elements (SSE). One of the key feature of the algorithm is utilizing the multiple vector representation for each SSE, which enables us to correctly treat bent or twisted nature of long SSE. We compared MICAN with other 9 publicly available structure alignment programs, using both reference-dependent and reference-independent evaluation methods on a variety of benchmark test sets which include both sequential and non-sequential alignments. We show that MICAN outperforms the other existing methods for reproducing reference alignments of non-sequential test sets. Further, although MICAN does not specialize in sequential structure alignment, it showed the top level performance on the sequential test sets. We also show that MICAN program is the fastest non-sequential structure alignment program among all the programs we examined here. Conclusions MICAN is the fastest and the most accurate program among non-sequential alignment programs we examined here. These results suggest that MICAN is a highly effective tool
A backtracking algorithm that deals with particle filter degeneracy
Baarsma, Rein; Schmitz, Oliver; Karssenberg, Derek
2016-04-01
Particle filters are an excellent way to deal with stochastic models incorporating Bayesian data assimilation. While they are computationally demanding, the particle filter has no problem with nonlinearity and it accepts non-Gaussian observational data. In the geoscientific field it is this computational demand that creates a problem, since dynamic grid-based models are often already quite computationally demanding. As such it is of the utmost importance to keep the amount of samples in the filter as small as possible. Small sample populations often lead to filter degeneracy however, especially in models with high stochastic forcing. Filter degeneracy renders the sample population useless, as the population is no longer statistically informative. We have created an algorithm in an existing data assimilation framework that reacts to and deals with filter degeneracy based on Spiller et al. [2008]. During the Bayesian updating step of the standard particle filter, the algorithm tests the sample population for filter degeneracy. If filter degeneracy has occurred, the algorithm resets to the last time the filter did work correctly and recalculates the failed timespan of the filter with an increased sample population. The sample population is then reduced to its original size and the particle filter continues as normal. This algorithm was created in the PCRaster Python framework, an open source tool that enables spatio-temporal forward modelling in Python [Karssenberg et al., 2010] . The framework already contains several data assimilation algorithms, including a standard particle filter and a Kalman filter. The backtracking particle filter algorithm has been added to the framework, which will make it easy to implement in other research. The performance of the backtracking particle filter is tested against a standard particle filter using two models. The first is a simple nonlinear point model, and the second is a more complex geophysical model. The main testing
EMMA: An Efficient Massive Mapping Algorithm Using Improved Approximate Mapping Filtering
Institute of Scientific and Technical Information of China (English)
Xin ZHANG; Zhi-Wei CAO; Zhi-Xin LIN; Qing-Kang WANG; Yi-Xue LI
2006-01-01
Efficient massive mapping algorithm (EMMA), an algorithm on efficiently mapping massive cDNAs onto genomic sequences, has recently been developed. The process of mapping massive cDNAs onto genomic sequences has been improved using more approximate mapping filtering based on an enhanced suffix array coupled with a pruned fast hash table, algorithms of block alignment extensions, and k-longest paths. When compared with the classical BLAT software in this field, the computing of EMMA ranges from two to forty-one times faster under similar prediction precisions.
A Point Cloud Alignment Algorithm Based on Stereo Vision Using Random Pattern Projection
Directory of Open Access Journals (Sweden)
Chen-Sheng Chen
2016-03-01
Full Text Available This paper proposes a point cloud alignment algorithm based on stereo vision using Random Pattern Projection (RPP. In the application of stereo vision, it is rather difficult to find correspondences between stereo images of texture-less objects. To overcome this issue, RPP is used to enhance the object’s features, thus increasing the accuracy of the identified correspondences of the stereo images. In the 3D alignment algorithm, the down sample technique is used to filter out the outliers of the point cloud data to improve system efficiency. Furthermore, the extracted features of the down sample point cloud data were applied in the matching process. Finally, the object’s pose was estimated by the alignment algorithm based on object features. In experiments, the maximum error and standard deviation of rotation are respectively about 0.031°and 0.199°, while the maximum error and standard deviation of translation are respectively about 0.565 mm and 0.902 mm . The execution time for pose estimation is about 230ms.
Resampling Algorithms for Particle Filters: A Computational Complexity Perspective
Directory of Open Access Journals (Sweden)
Miodrag Bolić
2004-11-01
Full Text Available Newly developed resampling algorithms for particle filters suitable for real-time implementation are described and their analysis is presented. The new algorithms reduce the complexity of both hardware and DSP realization through addressing common issues such as decreasing the number of operations and memory access. Moreover, the algorithms allow for use of higher sampling frequencies by overlapping in time the resampling step with the other particle filtering steps. Since resampling is not dependent on any particular application, the analysis is appropriate for all types of particle filters that use resampling. The performance of the algorithms is evaluated on particle filters applied to bearings-only tracking and joint detection and estimation in wireless communications. We have demonstrated that the proposed algorithms reduce the complexity without performance degradation.
Performance analysis of Non Linear Filtering Algorithms for underwater images
Padmavathi, Dr G; Kumar, Mr M Muthu; Thakur, Suresh Kumar
2009-01-01
Image filtering algorithms are applied on images to remove the different types of noise that are either present in the image during capturing or injected in to the image during transmission. Underwater images when captured usually have Gaussian noise, speckle noise and salt and pepper noise. In this work, five different image filtering algorithms are compared for the three different noise types. The performances of the filters are compared using the Peak Signal to Noise Ratio (PSNR) and Mean Square Error (MSE). The modified spatial median filter gives desirable results in terms of the above two parameters for the three different noise. Forty underwater images are taken for study.
An Adaptive Filtering Algorithm using Mean Field Annealing Techniques
Persson, Per; Nordebo, Sven; Claesson, Ingvar
2002-01-01
We present a new approach to discrete adaptive filtering based on the mean field annealing algorithm. The main idea is to find the discrete filter vector that minimizes the matrix form of the Wiener-Hopf equations in a least-squares sense by a generalized mean field annealing algorithm. It is indicated by simulations that this approach, with complexity O(M^2) where M is the filter length, finds a solution comparable to the one obtained by the recursive least squares (RLS) algorithm but withou...
New control algorithm for shunt active filters, based on self-tuned vector filter
Perales Esteve, Manuel Ángel; Mora Jiménez, José Luis; Carrasco Solís, Juan Manuel; García Franquelo, Leopoldo
2001-01-01
A new, improved, method for calculating the reference of a shunt active filter is presented. This method lays on a filter, which is able to extract the main component of a vector signal. This filter acts as a Phase-Locked Loop, capturing a particular frequency. The output of this filter is in phase with the frequency isolated, and has its amplitude. Simulation and experimental results confirms the validity of the proposed algorithm.
Application of H∞ Filter on the Angular Rate Matching in the Transfer Alignment
Directory of Open Access Journals (Sweden)
Lijun Song
2016-01-01
Full Text Available The transfer alignment (TA scheme is used for the initial alignment of Inertial Navigation System (INS on dynamical base. The Kalman filter is often used in TA to improve the precision of TA. And the statistical characteristics of interference signal which is difficult to get must be known before the Kalman filter is used in the TA, because the interference signal is a random signal and there are some changes on the dynamic model of system. In this paper, the H∞ filter is adopted in the TA scheme of the angular rate matching when the various stages of disturbance in measurement are unknown. And it is compared with the Kalman filter in the same environment of simulation and evaluation. The result of simulation shows that the H∞ filter and the Kalman filter are both effective. The Kalman filter is more accurate than the H∞ filter when system noise and measurement noise are white noise, but the H∞ filter is more accurate and quicker than the Kalman filter when system noise and measurement noise are color noise. In the engineering practice, system noise and measurement noise are always color noise, so the H∞ filter is more suitable for engineering practice than the Kalman filter.
Research of Collaborative Filtering Recommendation Algorithm based on Network Structure
Directory of Open Access Journals (Sweden)
Hui PENG
2013-10-01
Full Text Available This paper combines the classic collaborative filtering algorithm with personalized recommendation algorithm based on network structure. For the data sparsity and malicious behavior problems of traditional collaborative filtering algorithm, the paper introduces a new kind of social network-based collaborative filtering algorithm. In order to improve the accuracy of the personalized recommendation technology, we first define empty state in the state space of multi-dimensional semi-Markov processes and obtain extended multi-dimensional semi-Markov processes which are combined with social network analysis theory, and then we get social network information flow model. The model describes the flow of information between the members of the social network. So, we propose collaborative filtering algorithm based on social network information flow model. The algorithm uses social network information and combines user trust with user interest and find nearest neighbors of the target user and then forms a project recommended to improve the accuracy of recommended. Compared with the traditional collaborative filtering algorithm, the algorithm can effectively alleviate the sparsity and malicious behavior problem, and significantly improve the quality of the recommendation system recommended.
Li, Jing; Song, Ningfang; Yang, Gongliu; Jiang, Rui
2016-07-01
In the initial alignment process of strapdown inertial navigation system (SINS), large misalignment angles always bring nonlinear problem, which can usually be processed using the scaled unscented Kalman filter (SUKF). In this paper, the problem of large misalignment angles in SINS alignment is further investigated, and the strong tracking scaled unscented Kalman filter (STSUKF) is proposed with fixed parameters to improve convergence speed, while these parameters are artificially constructed and uncertain in real application. To further improve the alignment stability and reduce the parameters selection, this paper proposes a fuzzy adaptive strategy combined with STSUKF (FUZZY-STSUKF). As a result, initial alignment scheme of large misalignment angles based on FUZZY-STSUKF is designed and verified by simulations and turntable experiment. The results show that the scheme improves the accuracy and convergence speed of SINS initial alignment compared with those based on SUKF and STSUKF.
Li, Jing; Song, Ningfang; Yang, Gongliu; Jiang, Rui
2016-07-01
In the initial alignment process of strapdown inertial navigation system (SINS), large misalignment angles always bring nonlinear problem, which can usually be processed using the scaled unscented Kalman filter (SUKF). In this paper, the problem of large misalignment angles in SINS alignment is further investigated, and the strong tracking scaled unscented Kalman filter (STSUKF) is proposed with fixed parameters to improve convergence speed, while these parameters are artificially constructed and uncertain in real application. To further improve the alignment stability and reduce the parameters selection, this paper proposes a fuzzy adaptive strategy combined with STSUKF (FUZZY-STSUKF). As a result, initial alignment scheme of large misalignment angles based on FUZZY-STSUKF is designed and verified by simulations and turntable experiment. The results show that the scheme improves the accuracy and convergence speed of SINS initial alignment compared with those based on SUKF and STSUKF.
An enhancement algorithm for low quality fingerprint image based on edge filter and Gabor filter
Xue, Jun-tao; Liu, Jie; Liu, Zheng-guang
2009-07-01
On account of restriction of man-made and collection environment, the fingerprint image generally has low quality, especially a contaminated background. In this paper, an enhancement algorithm based on edge filter and Gabor filter is proposed to solve this kind of fingerprint image. Firstly, a gray-based algorithm is used to enhance the edge and segment the image. Then, a multilevel block size method is used to extract the orientation field from segmented fingerprint image. Finally, Gabor filter is used to fulfill the enhancement of the fingerprint image. The experiment results show that the proposed enhancement algorithm is effective than the normal Gabor filter algorithm. The fingerprint image enhance by our algorithm has better enhancement effect, so it is helpful for the subsequent research, such as classification, feature exaction and identification.
Practice Utilization of Algorithms for Analog Filter Group Delay Optimization
Directory of Open Access Journals (Sweden)
K. Hajek
2007-04-01
Full Text Available This contribution deals with an application of three different algorithms which optimize a group delay of analog filters. One of them is a part of the professional circuit simulator Micro Cap 7 and the others two original algorithms are developed in the MATLAB environment. An all-pass network is used to optimize the group delay of an arbitrary analog filter. Introduced algorithms look for an optimal order and optimal coefficients of an all-pass network transfer function. Theoretical foundations are introduced and all algorithms are tested using the optimization of testing analog filter. The optimization is always run three times because the second, third and fourth-order all-pass network is used. An equalization of the original group delay is a main objective of these optimizations. All outputs of all algorithms are critically evaluated and also described.
3D head pose estimation and tracking using particle filtering and ICP algorithm
Ben Ghorbel, Mahdi
2010-01-01
This paper addresses the issue of 3D head pose estimation and tracking. Existing approaches generally need huge database, training procedure, manual initialization or use face feature extraction manually extracted. We propose a framework for estimating the 3D head pose in its fine level and tracking it continuously across multiple Degrees of Freedom (DOF) based on ICP and particle filtering. We propose to approach the problem, using 3D computational techniques, by aligning a face model to the 3D dense estimation computed by a stereo vision method, and propose a particle filter algorithm to refine and track the posteriori estimate of the position of the face. This work comes with two contributions: the first concerns the alignment part where we propose an extended ICP algorithm using an anisotropic scale transformation. The second contribution concerns the tracking part. We propose the use of the particle filtering algorithm and propose to constrain the search space using ICP algorithm in the propagation step. The results show that the system is able to fit and track the head properly, and keeps accurate the results on new individuals without a manual adaptation or training. © Springer-Verlag Berlin Heidelberg 2010.
Acceleration of Directional Medain Filter Based Deinterlacing Algorithm (DMFD
Directory of Open Access Journals (Sweden)
Addanki Purna Ramesh
2011-12-01
Full Text Available This paper presents a novel directional median filter based deinterlacing algorithm (DMFD. DMFD is a content adaptive spatial deinterlacing algorithm that finds the direction of the edge and applies the median filtering along the edge to interpolate the odd pixels from the 5 pixels from the upper and 5 pixels from the lower even lines of the field. The proposed algorithm gives a significance improvement of 3db for baboon standard test image that has high textured content compared to CADEM, DOI, and MELA and also gives improved average PSNR compared previous algorithms. The algorithm written and tested in C and ported onto Altera’s NIOS II embedded soft processor and configured in CYCLONE-II FPGA. The ISA of Nios-II processor has extended with two additional instructions for calculation of absolute difference and minimum of four numbers to accelerate the FPGA implementation of the algorithms by 3.2 times
An Improved Search Algorithm for Optimal Multiple-Sequence Alignment
Schroedl, S
2011-01-01
Multiple sequence alignment (MSA) is a ubiquitous problem in computational biology. Although it is NP-hard to find an optimal solution for an arbitrary number of sequences, due to the importance of this problem researchers are trying to push the limits of exact algorithms further. Since MSA can be cast as a classical path finding problem, it is attracting a growing number of AI researchers interested in heuristic search algorithms as a challenge with actual practical relevance. In this paper, we first review two previous, complementary lines of research. Based on Hirschbergs algorithm, Dynamic Programming needs O(kN^(k-1)) space to store both the search frontier and the nodes needed to reconstruct the solution path, for k sequences of length N. Best first search, on the other hand, has the advantage of bounding the search space that has to be explored using a heuristic. However, it is necessary to maintain all explored nodes up to the final solution in order to prevent the search from re-expanding them at hig...
Information filtering via weighted heat conduction algorithm
Liu, Jian-Guo; Guo, Qiang; Zhang, Yi-Cheng
2011-06-01
In this paper, by taking into account effects of the user and object correlations on a heat conduction (HC) algorithm, a weighted heat conduction (WHC) algorithm is presented. We argue that the edge weight of the user-object bipartite network should be embedded into the HC algorithm to measure the object similarity. The numerical results indicate that both the accuracy and diversity could be improved greatly compared with the standard HC algorithm and the optimal values reached simultaneously. On the Movielens and Netflix datasets, the algorithmic accuracy, measured by the average ranking score, can be improved by 39.7% and 56.1% in the optimal case, respectively, and the diversity could reach 0.9587 and 0.9317 when the recommendation list equals to 5. Further statistical analysis indicates that, in the optimal case, the distributions of the edge weight are changed to the Poisson form, which may be the reason why HC algorithm performance could be improved. This work highlights the effect of edge weight on a personalized recommendation study, which maybe an important factor affecting personalized recommendation performance.
An Efficient Conflict Detection Algorithm for Packet Filters
Lee, Chun-Liang; Lin, Guan-Yu; Chen, Yaw-Chung
Packet classification is essential for supporting advanced network services such as firewalls, quality-of-service (QoS), virtual private networks (VPN), and policy-based routing. The rules that routers use to classify packets are called packet filters. If two or more filters overlap, a conflict occurs and leads to ambiguity in packet classification. This study proposes an algorithm that can efficiently detect and resolve filter conflicts using tuple based search. The time complexity of the proposed algorithm is O(nW+s), and the space complexity is O(nW), where n is the number of filters, W is the number of bits in a header field, and s is the number of conflicts. This study uses the synthetic filter databases generated by ClassBench to evaluate the proposed algorithm. Simulation results show that the proposed algorithm can achieve better performance than existing conflict detection algorithms both in time and space, particularly for databases with large numbers of conflicts.
Power system static state estimation using Kalman filter algorithm
Directory of Open Access Journals (Sweden)
Saikia Anupam
2016-01-01
Full Text Available State estimation of power system is an important tool for operation, analysis and forecasting of electric power system. In this paper, a Kalman filter algorithm is presented for static estimation of power system state variables. IEEE 14 bus system is employed to check the accuracy of this method. Newton Raphson load flow study is first carried out on our test system and a set of data from the output of load flow program is taken as measurement input. Measurement inputs are simulated by adding Gaussian noise of zero mean. The results of Kalman estimation are compared with traditional Weight Least Square (WLS method and it is observed that Kalman filter algorithm is numerically more efficient than traditional WLS method. Estimation accuracy is also tested for presence of parametric error in the system. In addition, numerical stability of Kalman filter algorithm is tested by considering inclusion of zero mean errors in the initial estimates.
Filtered refocusing: a volumetric reconstruction algorithm for plenoptic-PIV
Fahringer, Timothy W.; Thurow, Brian S.
2016-09-01
A new algorithm for reconstruction of 3D particle fields from plenoptic image data is presented. The algorithm is based on the technique of computational refocusing with the addition of a post reconstruction filter to remove the out of focus particles. This new algorithm is tested in terms of reconstruction quality on synthetic particle fields as well as a synthetically generated 3D Gaussian ring vortex. Preliminary results indicate that the new algorithm performs as well as the MART algorithm (used in previous work) in terms of the reconstructed particle position accuracy, but produces more elongated particles. The major advantage to the new algorithm is the dramatic reduction in the computational cost required to reconstruct a volume. It is shown that the new algorithm takes 1/9th the time to reconstruct the same volume as MART while using minimal resources. Experimental results are presented in the form of the wake behind a cylinder at a Reynolds number of 185.
CSIR Research Space (South Africa)
Mlambo, CS
2015-01-01
Full Text Available In this paper, implementations of three Hough Transform based fingerprint alignment algorithms are analyzed with respect to time complexity on Java Card environment. Three algorithms are: Local Match Based Approach (LMBA), Discretized Rotation Based...
Filtered gradient reconstruction algorithm for compressive spectral imaging
Mejia, Yuri; Arguello, Henry
2017-04-01
Compressive sensing matrices are traditionally based on random Gaussian and Bernoulli entries. Nevertheless, they are subject to physical constraints, and their structure unusually follows a dense matrix distribution, such as the case of the matrix related to compressive spectral imaging (CSI). The CSI matrix represents the integration of coded and shifted versions of the spectral bands. A spectral image can be recovered from CSI measurements by using iterative algorithms for linear inverse problems that minimize an objective function including a quadratic error term combined with a sparsity regularization term. However, current algorithms are slow because they do not exploit the structure and sparse characteristics of the CSI matrices. A gradient-based CSI reconstruction algorithm, which introduces a filtering step in each iteration of a conventional CSI reconstruction algorithm that yields improved image quality, is proposed. Motivated by the structure of the CSI matrix, Φ, this algorithm modifies the iterative solution such that it is forced to converge to a filtered version of the residual ΦTy, where y is the compressive measurement vector. We show that the filtered-based algorithm converges to better quality performance results than the unfiltered version. Simulation results highlight the relative performance gain over the existing iterative algorithms.
Variable Step Size Maximum Correntropy Criteria Based Adaptive Filtering Algorithm
Directory of Open Access Journals (Sweden)
S. Radhika
2016-04-01
Full Text Available Maximum correntropy criterion (MCC based adaptive filters are found to be robust against impulsive interference. This paper proposes a novel MCC based adaptive filter with variable step size in order to obtain improved performance in terms of both convergence rate and steady state error with robustness against impulsive interference. The optimal variable step size is obtained by minimizing the Mean Square Deviation (MSD error from one iteration to the other. Simulation results in the context of a highly impulsive system identification scenario show that the proposed algorithm has faster convergence and lesser steady state error than the conventional MCC based adaptive filters.
An Adaptive Filtering Algorithm Based on Genetic Algorithm-Backpropagation Network
Directory of Open Access Journals (Sweden)
Kai Hu
2013-01-01
Full Text Available A new image filtering algorithm is proposed. GA-BPN algorithm uses genetic algorithm (GA to decide weights in a back propagation neural network (BPN. It has better global optimal characteristics than traditional optimal algorithm. In this paper, we used GA-BPN to do image noise filter researching work. Firstly, this paper uses training samples to train GA-BPN as the noise detector. Then, we utilize the well-trained GA-BPN to recognize noise pixels in target image. And at last, an adaptive weighted average algorithm is used to recover noise pixels recognized by GA-BPN. Experiment data shows that this algorithm has better performance than other filters.
Filtered-X Affine Projection Algorithms for Active Noise Control Using Volterra Filters
Directory of Open Access Journals (Sweden)
Sicuranza Giovanni L
2004-01-01
Full Text Available We consider the use of adaptive Volterra filters, implemented in the form of multichannel filter banks, as nonlinear active noise controllers. In particular, we discuss the derivation of filtered-X affine projection algorithms for homogeneous quadratic filters. According to the multichannel approach, it is then easy to pass from these algorithms to those of a generic Volterra filter. It is shown in the paper that the AP technique offers better convergence and tracking capabilities than the classical LMS and NLMS algorithms usually applied in nonlinear active noise controllers, with a limited complexity increase. This paper extends in two ways the content of a previous contribution published in Proc. IEEE-EURASIP Workshop on Nonlinear Signal and Image Processing (NSIP '03, Grado, Italy, June 2003. First of all, a general adaptation algorithm valid for any order of affine projections is presented. Secondly, a more complete set of experiments is reported. In particular, the effects of using multichannel filter banks with a reduced number of channels are investigated and relevant results are shown.
Institute of Scientific and Technical Information of China (English)
ZHENG Yu; CHEN Zhuang-zhuang; LI Ya-juan; DUAN Jian
2009-01-01
A novel automatic alignment algorithm of single mode fiber-waveguide based on improved genetic algorithm is proposed. The genetic searching is based on the dynamic crossover operator and the adaptive mutation operator to solve the premature convergence of simple genetic algorithm The improved genetic algorithm combines with hill-climbing method and pattern searching algorithm, to solve low precision of simple genetic algorithm in later searching. The simulation results indicate that the improved genetic algorithm can rise the alignment precision and reach the coupling loss of 0.01 dB when platform moves near 207 space points averagely.
A novel iris localization algorithm using correlation filtering
Pohit, Mausumi; Sharma, Jitu
2015-06-01
Fast and efficient segmentation of iris from the eye images is a primary requirement for robust database independent iris recognition. In this paper we have presented a new algorithm for computing the inner and outer boundaries of the iris and locating the pupil centre. Pupil-iris boundary computation is based on correlation filtering approach, whereas iris-sclera boundary is determined through one dimensional intensity mapping. The proposed approach is computationally less extensive when compared with the existing algorithms like Hough transform.
A survey of sequence alignment algorithms for next-generation sequencing.
Li, Heng; Homer, Nils
2010-09-01
Rapidly evolving sequencing technologies produce data on an unparalleled scale. A central challenge to the analysis of this data is sequence alignment, whereby sequence reads must be compared to a reference. A wide variety of alignment algorithms and software have been subsequently developed over the past two years. In this article, we will systematically review the current development of these algorithms and introduce their practical applications on different types of experimental data. We come to the conclusion that short-read alignment is no longer the bottleneck of data analyses. We also consider future development of alignment algorithms with respect to emerging long sequence reads and the prospect of cloud computing.
Robust precision alignment algorithm for micro tube laser forming
Folkersma, K.G.P.; Brouwer, D.M.; Römer, G.R.B.E.; Herder, J.L.
2016-01-01
Tube laser forming on a small diameter tube can be used as a high precision actuator to permanently align small (optical)components. Applications, such as the alignment of optical fibers to photonic integrated circuits, often require sub-micron alignment accuracy. Although the process causes signifi
Algorithm Engineering for Optimal Alignment of Protein Structure Distance Matrices
Wohlers, I.; Andonov, R.; Klau, G.W.
2011-01-01
Protein structural alignment is an important problem in computational biology. In this paper, we present first successes on provably optimal pairwise alignment of protein inter-residue distance matrices, using the popular DALI scoring function. We introduce the structural alignment problem formally,
Robust precision alignment algorithm for micro tube laser forming
Folkersma, Ger; Brouwer, Dannis Michel; Römer, Gerardus Richardus, Bernardus, Engelina; Herder, Justus Laurens
2016-01-01
Tube laser forming on a small diameter tube can be used as a high precision actuator to permanently align small (optical)components. Applications, such as the alignment of optical fibers to photonic integrated circuits, often require sub-micron alignment accuracy. Although the process causes
DEFF Research Database (Denmark)
Nielsen, Morten; Lund, Ole
2009-01-01
through presentation of extracellularly derived peptides to helper T cells. Identification of which peptides will bind a given MHC molecule is thus of great importance for the understanding of host-pathogen interactions, and large efforts have been placed in developing algorithms capable of predicting...... this binding event. RESULTS: Here, we present a novel artificial neural network-based method, NN-align that allows for simultaneous identification of the MHC class II binding core and binding affinity. NN-align is trained using a novel training algorithm that allows for correction of bias in the training data...... class II alleles, and is demonstrated to outperform other state-of-the-art MHC class II prediction methods. CONCLUSION: The NN-align method is competitive with the state-of-the-art MHC class II peptide binding prediction algorithms. The method is publicly available at http...
Filter algorithm for airborne LIDAR data
Li, Qi; Ma, Hongchao; Wu, Jianwei; Tian, Liqiao; Qiu, Feng
2007-11-01
Airborne laser scanning data has become an accepted data source for highly automated acquisition of digital surface models(DSM) as well as for the generation of digital terrain models(DTM). To generate a high quality DTM using LIDAR data, 3D off-terrain points have to be separated from terrain points. Even though most LIDAR system can measure "last-return" data points, these "last-return" point often measure ground clutter like shrubbery, cars, buildings, and the canopy of dense foliage. Consequently, raw LIDAR points must be post-processed to remove these undesirable returns. The degree to which this post processing is successful is critical in determining whether LIDAR is cost effective for large-scale mapping application. Various techniques have been proposed to extract the ground surface from airborne LIDAR data. The basic problem is the separation of terrain points from off-terrain points which are both recorded by the LIDAR sensor. In this paper a new method, combination of morphological filtering and TIN densification, is proposed to separate 3D off-terrain points.
Fang, Joyce
2016-01-01
Automation of alignment tasks can provide improved efficiency and greatly increase the flexibility of an optical system. Current optical systems with automated alignment capabilities are typically designed to include a dedicated wavefront sensor. Here, we demonstrate a self-aligning method for a reconfigurable system using only focal plane images. We define a two lens optical system with eight degrees of freedom. Images are simulated given misalignment parameters using ZEMAX software. We perform a principal component analysis (PCA) on the simulated dataset to obtain Karhunen-Lo\\`eve (KL) modes, which form the basis set whose weights are the system measurements. A model function which maps the state to the measurement is learned using nonlinear least squares fitting and serves as the measurement function for the nonlinear estimator (Extended and Unscented Kalman filters) used to calculate control inputs to align the system. We present and discuss both simulated and experimental results of the full system in op...
Fang, Joyce; Savransky, Dmitry
2016-08-01
Automation of alignment tasks can provide improved efficiency and greatly increase the flexibility of an optical system. Current optical systems with automated alignment capabilities are typically designed to include a dedicated wavefront sensor. Here, we demonstrate a self-aligning method for a reconfigurable system using only focal plane images. We define a two lens optical system with eight degrees of freedom. Images are simulated given misalignment parameters using ZEMAX software. We perform a principal component analysis (PCA) on the simulated dataset to obtain Karhunen-Lo\\`eve (KL) modes, which form the basis set whose weights are the system measurements. A model function which maps the state to the measurement is learned using nonlinear least squares fitting and serves as the measurement function for the nonlinear estimator (Extended and Unscented Kalman filters) used to calculate control inputs to align the system. We present and discuss both simulated and experimental results of the full system in operation.
Fixed Scan Area Tracking with Track Splitting Filtering Algorithm
DEFF Research Database (Denmark)
Hussain, Dil Muhammad Akbar; Ahmed, Zaki
2006-01-01
to develop procedures that would enable a more general performance assessment. Therefore, a non-deterministic scenario is adopted, which basically provide a more appropriate approach for the evaluation of a tracking system based on track splitting filter algorithm. The objects are generated within a fixed...
IIR Filter Modeling Using an Algorithm Inspired on Electromagnetism
Directory of Open Access Journals (Sweden)
Cuevas-Jiménez E.
2013-01-01
Full Text Available Infinite-impulse-response (IIR filtering provides a powerful approach for solving a variety of problems. However, its design represents a very complicated task, since the error surface of IIR filters is generally multimodal, global optimization techniques are required in order to avoid local minima. In this paper, a new method based on the Electromagnetism-Like Optimization Algorithm (EMO is proposed for IIR filter modeling. EMO originates from the electro-magnetism theory of physics by assuming potential solutions as electrically charged particles which spread around the solution space. The charge of each particle depends on its objective function value. This algorithm employs a collective attraction-repulsion mechanism to move the particles towards optimality. The experimental results confirm the high performance of the proposed method in solving various benchmark identification problems.
Collaborative Filtering Algorithms Based on Kendall Correlation in Recommender Systems
Institute of Scientific and Technical Information of China (English)
YAO Yu; ZHU Shanfeng; CHEN Xinmeng
2006-01-01
In this work, Kendall correlation based collaborative filtering algorithms for the recommender systems are proposed. The Kendall correlation method is used to measure the correlation amongst users by means of considering the relative order of the users' ratings. Kendall based algorithm is based upon a more general model and thus could be more widely applied in e-commerce. Another discovery of this work is that the consideration of only positive correlated neighbors in prediction, in both Pearson and Kendall algorithms, achieves higher accuracy than the consideration of all neighbors, with only a small loss of coverage.
Relevance Feedback Algorithm Based on Collaborative Filtering in Image Retrieval
Directory of Open Access Journals (Sweden)
Yan Sun
2010-12-01
Full Text Available Content-based image retrieval is a very dynamic study field, and in this field, how to improve retrieval speed and retrieval accuracy is a hot issue. The retrieval performance can be improved when applying relevance feedback to image retrieval and introducing the participation of people to the retrieval process. However, as for many existing image retrieval methods, there are disadvantages of relevance feedback with information not being fully saved and used, and their accuracy and flexibility are relatively poor. Based on this, the collaborative filtering technology was combined with relevance feedback in this study, and an improved relevance feedback algorithm based on collaborative filtering was proposed. In the method, the collaborative filtering technology was used not only to predict the semantic relevance between images in database and the retrieval samples, but to analyze feedback log files in image retrieval, which can make the historical data of relevance feedback be fully used by image retrieval system, and further to improve the efficiency of feedback. The improved algorithm presented has been tested on the content-based image retrieval database, and the performance of the algorithm has been analyzed and compared with the existing algorithms. The experimental results showed that, compared with the traditional feedback algorithms, this method can obviously improve the efficiency of relevance feedback, and effectively promote the recall and precision of image retrieval.
Study of a new fast adaptive filtering algorithm
Institute of Scientific and Technical Information of China (English)
WANG Zhen-li; ZHANG Xiong-wei; YANG Ji-bin; CHEN Gong
2006-01-01
A new fast adaptive filtering algorithm was presented by using the correlations between the signal's former and latter sampling times.The proof of the new algorithm was also presented,which showed that its optimal weight vector was the solution of generalized Wiener equation.The new algorithm was of simple structure,fast convergence,and less stable maladjustment.It can handle many signals including both uncorrelated signal and strong correlation signal.However,its computational complexity was comparable to that of the normalized least-mean-square (NLMS) algorithm.Simulation results show that for uncorrelated signals,the stable maladjustment of the proposed algorithm is less than that of the VS-NLMS algorithm,and its convergence is comparable to that of the algorithm proposed in references but faster than that of L.E-LMS algorithm.For strong correlation signal,its performance is superior to those of the NLMS algorithm and DCR-LMS algorithm.
A comprehensive evaluation of alignment algorithms in the context of RNA-seq.
Lindner, Robert; Friedel, Caroline C
2012-01-01
Transcriptome sequencing (RNA-Seq) overcomes limitations of previously used RNA quantification methods and provides one experimental framework for both high-throughput characterization and quantification of transcripts at the nucleotide level. The first step and a major challenge in the analysis of such experiments is the mapping of sequencing reads to a transcriptomic origin including the identification of splicing events. In recent years, a large number of such mapping algorithms have been developed, all of which have in common that they require algorithms for aligning a vast number of reads to genomic or transcriptomic sequences. Although the FM-index based aligner Bowtie has become a de facto standard within mapping pipelines, a much larger number of possible alignment algorithms have been developed also including other variants of FM-index based aligners. Accordingly, developers and users of RNA-seq mapping pipelines have the choice among a large number of available alignment algorithms. To provide guidance in the choice of alignment algorithms for these purposes, we evaluated the performance of 14 widely used alignment programs from three different algorithmic classes: algorithms using either hashing of the reference transcriptome, hashing of reads, or a compressed FM-index representation of the genome. Here, special emphasis was placed on both precision and recall and the performance for different read lengths and numbers of mismatches and indels in a read. Our results clearly showed the significant reduction in memory footprint and runtime provided by FM-index based aligners at a precision and recall comparable to the best hash table based aligners. Furthermore, the recently developed Bowtie 2 alignment algorithm shows a remarkable tolerance to both sequencing errors and indels, thus, essentially making hash-based aligners obsolete.
A comprehensive evaluation of alignment algorithms in the context of RNA-seq.
Directory of Open Access Journals (Sweden)
Robert Lindner
Full Text Available Transcriptome sequencing (RNA-Seq overcomes limitations of previously used RNA quantification methods and provides one experimental framework for both high-throughput characterization and quantification of transcripts at the nucleotide level. The first step and a major challenge in the analysis of such experiments is the mapping of sequencing reads to a transcriptomic origin including the identification of splicing events. In recent years, a large number of such mapping algorithms have been developed, all of which have in common that they require algorithms for aligning a vast number of reads to genomic or transcriptomic sequences. Although the FM-index based aligner Bowtie has become a de facto standard within mapping pipelines, a much larger number of possible alignment algorithms have been developed also including other variants of FM-index based aligners. Accordingly, developers and users of RNA-seq mapping pipelines have the choice among a large number of available alignment algorithms. To provide guidance in the choice of alignment algorithms for these purposes, we evaluated the performance of 14 widely used alignment programs from three different algorithmic classes: algorithms using either hashing of the reference transcriptome, hashing of reads, or a compressed FM-index representation of the genome. Here, special emphasis was placed on both precision and recall and the performance for different read lengths and numbers of mismatches and indels in a read. Our results clearly showed the significant reduction in memory footprint and runtime provided by FM-index based aligners at a precision and recall comparable to the best hash table based aligners. Furthermore, the recently developed Bowtie 2 alignment algorithm shows a remarkable tolerance to both sequencing errors and indels, thus, essentially making hash-based aligners obsolete.
Adaptive Kalman Filter of Transfer Alignment with Un-modeled Wing Flexure of Aircraft
Institute of Scientific and Technical Information of China (English)
无
2008-01-01
The alignment accuracy of the strap-down inertial navigation system (SINS) of airborne weapon is greatly degraded by the dynamic wing flexure of the aircraft. An adaptive Kalman filter uses innovation sequences based on the maximum likelihood estimated criterion to adapt the system noise covariance matrix and the measurement noise covariance matrix on line, which is used to estimate the misalignment if the model of wing flexure of the aircraft is unknown. From a number of simulations, it is shown that the accuracy of the adaptive Kalman filter is better than the conventional Kalman filter, and the erroneous misalignment models of the wing flexure of aircraft will cause bad estimation results of Kalman filter using attitude match method.
Park, Kihong
2013-02-01
In this paper, we study a two-hop relaying network consisting of one source, one destination, and three amplify-and-forward (AF) relays with multiple antennas. To compensate for the capacity prelog factor loss of 1/2$ due to the half-duplex relaying, alternate transmission is performed among three relays, and the inter-relay interference due to the alternate relaying is aligned to make additional degrees of freedom. In addition, suboptimal linear filter designs at the nodes are proposed to maximize the achievable sum rate for different fading scenarios when the destination utilizes a minimum mean-square error filter. © 1967-2012 IEEE.
Automatic Data Filter Customization Using a Genetic Algorithm
Mandrake, Lukas
2013-01-01
This work predicts whether a retrieval algorithm will usefully determine CO2 concentration from an input spectrum of GOSAT (Greenhouse Gases Observing Satellite). This was done to eliminate needless runtime on atmospheric soundings that would never yield useful results. A space of 50 dimensions was examined for predictive power on the final CO2 results. Retrieval algorithms are frequently expensive to run, and wasted effort defeats requirements and expends needless resources. This algorithm could be used to help predict and filter unneeded runs in any computationally expensive regime. Traditional methods such as the Fischer discriminant analysis and decision trees can attempt to predict whether a sounding will be properly processed. However, this work sought to detect a subsection of the dimensional space that can be simply filtered out to eliminate unwanted runs. LDAs (linear discriminant analyses) and other systems examine the entire data and judge a "best fit," giving equal weight to complex and problematic regions as well as simple, clear-cut regions. In this implementation, a genetic space of "left" and "right" thresholds outside of which all data are rejected was defined. These left/right pairs are created for each of the 50 input dimensions. A genetic algorithm then runs through countless potential filter settings using a JPL computer cluster, optimizing the tossed-out data s yield (proper vs. improper run removal) and number of points tossed. This solution is robust to an arbitrary decision boundary within the data and avoids the global optimization problem of whole-dataset fitting using LDA or decision trees. It filters out runs that would not have produced useful CO2 values to save needless computation. This would be an algorithmic preprocessing improvement to any computationally expensive system.
Centroid stabilization in alignment of FOA corner cube: designing of a matched filter
Awwal, Abdul; Wilhelmsen, Karl; Roberts, Randy; Leach, Richard; Miller Kamm, Victoria; Ngo, Tony; Lowe-Webb, Roger
2015-02-01
The current automation of image-based alignment of NIF high energy laser beams is providing the capability of executing multiple target shots per day. An important aspect of performing multiple shots in a day is to reduce additional time spent aligning specific beams due to perturbations in those beam images. One such alignment is beam centration through the second and third harmonic generating crystals in the final optics assembly (FOA), which employs two retro-reflecting corner cubes to represent the beam center. The FOA houses the frequency conversion crystals for third harmonic generation as the beams enters the target chamber. Beam-to-beam variations and systematic beam changes over time in the FOA corner-cube images can lead to a reduction in accuracy as well as increased convergence durations for the template based centroid detector. This work presents a systematic approach of maintaining FOA corner cube centroid templates so that stable position estimation is applied thereby leading to fast convergence of alignment control loops. In the matched filtering approach, a template is designed based on most recent images taken in the last 60 days. The results show that new filter reduces the divergence of the position estimation of FOA images.
A DNA sequence alignment algorithm using quality information and a fuzzy inference method
Institute of Scientific and Technical Information of China (English)
Kwangbaek Kim; Minhwan Kim; Youngwoon Woo
2008-01-01
DNA sequence alignment algorithms in computational molecular biology have been improved by diverse methods.In this paper.We propose a DNA sequence alignment that Uses quality information and a fuzzy inference method developed based on the characteristics of DNA fragments and a fuzzy logic system in order to improve conventional DNA sequence alignment methods that uses DNA sequence quality information.In conventional algorithms.DNA sequence alignment scores are calculated by the global sequence alignment algorithm proposed by Needleman-Wunsch,which is established by using quality information of each DNA fragment.However,there may be errors in the process of calculating DNA sequence alignment scores when the quality of DNA fragment tips is low.because only the overall DNA sequence quality information are used.In our proposed method.an exact DNA sequence alignment can be achieved in spite of the low quality of DNA fragment tips by improvement of conventional algorithms using quality information.Mapping score parameters used to calculate DNA sequence alignment scores are dynamically adjusted by the fuzzy logic system utilizing lengths of DNA fragments and frequencies of low quality DNA bases in the fragments.From the experiments by applying real genome data of National Center for Bioteclmology Information,we could see that the proposed method is more efficient than conventional algorithms.
An Ant Colony Optimization Algorithm for Microwave Corrugated Filters Design
Directory of Open Access Journals (Sweden)
Ivan A. Mantilla-Gaviria
2013-01-01
Full Text Available A practical and useful application of the Ant Colony Optimization (ACO method for microwave corrugated filter design is shown. The classical, general purpose ACO method is adapted to deal with the microwave filter design problem. The design strategy used in this paper is an iterative procedure based on the use of an optimization method along with an electromagnetic simulator. The designs of high-pass and band-pass microwave rectangular waveguide filters working in the C-band and X-band, respectively, for communication applications, are shown. The average convergence performance of the ACO method is characterized by means of Monte Carlo simulations and compared with that obtained with the well-known Genetic Algorithm (GA. The overall performance, for the simulations presented herein, of the ACO is found to be better than that of the GA.
E-mail Spam Filtering Using Adaptive Genetic Algorithm
Directory of Open Access Journals (Sweden)
Jitendra Nath Shrivastava
2014-01-01
Full Text Available Now a day’s everybody email inbox is full with spam mails. The problem with spam mails is that they are not malicious in nature so generally don’t get blocked with firewall or filters etc., however, they are unwanted mails received by any internet users. In 2012, more that 50% emails of the total emails were spam emails. In this paper, a genetic algorithm based method for spam email filtering is discussed with its advantages and dis-advantages. The results presented in the paper are promising and suggested that GA can be a good option in conjunction with other e-mail filtering techniques can provide more robust solution.
Gravitation search algorithm: Application to the optimal IIR filter design
Directory of Open Access Journals (Sweden)
Suman Kumar Saha
2014-01-01
Full Text Available This paper presents a global heuristic search optimization technique known as Gravitation Search Algorithm (GSA for the design of 8th order Infinite Impulse Response (IIR, low pass (LP, high pass (HP, band pass (BP and band stop (BS filters considering various non-linear characteristics of the filter design problems. This paper also adopts a novel fitness function in order to improve the stop band attenuation to a great extent. In GSA, law of gravity and mass interactions among different particles are adopted for handling the non-linear IIR filter design optimization problem. In this optimization technique, searcher agents are the collection of masses and interactions among them are governed by the Newtonian gravity and the laws of motion. The performances of the GSA based IIR filter designs have proven to be superior as compared to those obtained by real coded genetic algorithm (RGA and standard Particle Swarm Optimization (PSO. Extensive simulation results affirm that the proposed approach using GSA outperforms over its counterparts not only in terms of quality output, i.e., sharpness at cut-off, smaller pass band ripple, higher stop band attenuation, but also the fastest convergence speed with assured stability.
Directory of Open Access Journals (Sweden)
Xixiang Liu
2014-01-01
Full Text Available In the initial alignment process of strapdown inertial navigation system (SINS, large initial misalignment angles always bring nonlinear problem, which causes alignment failure when the classical linear error model and standard Kalman filter are used. In this paper, the problem of large misalignment angles in SINS initial alignment is investigated, and the key reason for alignment failure is given as the state covariance from Kalman filter cannot represent the true one during the steady filtering process. According to the analysis, an alignment method for SINS based on multiresetting the state covariance matrix of Kalman filter is designed to deal with large initial misalignment angles, in which classical linear error model and standard Kalman filter are used, but the state covariance matrix should be multireset before the steady process until large misalignment angles are decreased to small ones. The performance of the proposed method is evaluated by simulation and car test, and the results indicate that the proposed method can fulfill initial alignment with large misalignment angles effectively and the alignment accuracy of the proposed method is as precise as that of alignment with small misalignment angles.
Chimeric alignment by dynamic programming: Algorithm and biological uses
Energy Technology Data Exchange (ETDEWEB)
Komatsoulis, G.A.; Waterman, M.S. [Univ. of Southern California, Los Angeles, CA (United States)
1997-12-01
A new nearest-neighbor method for detecting chimeric 16S rRNA artifacts generated during PCR amplification from mixed populations has been developed. The method uses dynamic programming to generate an optimal chimeric alignment, defined as the highest scoring alignment between a query and a concatenation of a 5{prime} and a 3{prime} segment from two separate entries from a database of related sequences. Chimeras are detected by studying the scores and form of the chimeric and global sequence alignments. The chimeric alignment method was found to be marginally more effective than k-tuple based nearest-neighbor methods in simulation studies, but its most effective use is in concert with k-tuple methods. 15 refs., 3 figs., 1 tab.
SkyAlign: a portable, work-efficient skyline algorithm for multicore and GPU architectures
DEFF Research Database (Denmark)
Bøgh, Kenneth Sejdenfaden; Chester, Sean; Assent, Ira
2016-01-01
The skyline operator determines points in a multidimensional dataset that offer some optimal trade-off. State-of-the-art CPU skyline algorithms exploit quad-tree partitioning with complex branching to minimise the number of point-to-point comparisons. Branch-phobic GPU skyline algorithms rely...... on compute throughput rather than partitioning, but fail to match the performance of sequential algorithms. In this paper, we introduce a new skyline algorithm, SkyAlign, that is designed for the GPU, and a GPU-friendly, grid-based tree structure upon which the algorithm relies. The search tree allows us...... to dramatically reduce the amount of work done by the GPU algorithm by avoiding most point-to-point comparisons at the cost of some compute throughput. This trade-off allows SkyAlign to achieve orders of magnitude faster performance than its predecessors. Moreover, a NUMA-oblivious port of SkyAlign outperforms...
Development of adaptive IIR filtered-e LMS algorithm for active noise control
Institute of Scientific and Technical Information of China (English)
SUN Xu; MENG Guang; TENG Pengxiao; CHEN Duanshi
2003-01-01
Compared to finite impulse response (FIR) filters, infinite impulse response (IIR)filters can match the system better with much fewer coefficients, and hence the computationload is saved and the performance improves. Therefore, it is attractive to use IIR filters insteadof FIR filters in active noise control (ANC). However, filtered-U LMS (FULMS) algorithm, theIIR filter-based algorithm commonly used so far cannot ensure global convergence. A new IIRfilter based adaptive algorithm, which can ensure global convergence with computation loadonly slightly increasing, is proposed in this paper. The new algorithm is called as filtered-eLMS algorithm since the error signal of which need to be filtered. Simulation results show thatthe FELMS algorithm presents better performance than the FULMS algorithm.
Multiple sequence alignment using multi-objective based bacterial foraging optimization algorithm.
Rani, R Ranjani; Ramyachitra, D
2016-12-01
Multiple sequence alignment (MSA) is a widespread approach in computational biology and bioinformatics. MSA deals with how the sequences of nucleotides and amino acids are sequenced with possible alignment and minimum number of gaps between them, which directs to the functional, evolutionary and structural relationships among the sequences. Still the computation of MSA is a challenging task to provide an efficient accuracy and statistically significant results of alignments. In this work, the Bacterial Foraging Optimization Algorithm was employed to align the biological sequences which resulted in a non-dominated optimal solution. It employs Multi-objective, such as: Maximization of Similarity, Non-gap percentage, Conserved blocks and Minimization of gap penalty. BAliBASE 3.0 benchmark database was utilized to examine the proposed algorithm against other methods In this paper, two algorithms have been proposed: Hybrid Genetic Algorithm with Artificial Bee Colony (GA-ABC) and Bacterial Foraging Optimization Algorithm. It was found that Hybrid Genetic Algorithm with Artificial Bee Colony performed better than the existing optimization algorithms. But still the conserved blocks were not obtained using GA-ABC. Then BFO was used for the alignment and the conserved blocks were obtained. The proposed Multi-Objective Bacterial Foraging Optimization Algorithm (MO-BFO) was compared with widely used MSA methods Clustal Omega, Kalign, MUSCLE, MAFFT, Genetic Algorithm (GA), Ant Colony Optimization (ACO), Artificial Bee Colony (ABC), Particle Swarm Optimization (PSO) and Hybrid Genetic Algorithm with Artificial Bee Colony (GA-ABC). The final results show that the proposed MO-BFO algorithm yields better alignment than most widely used methods.
Theory of affine projection algorithms for adaptive filtering
Ozeki, Kazuhiko
2016-01-01
This book focuses on theoretical aspects of the affine projection algorithm (APA) for adaptive filtering. The APA is a natural generalization of the classical, normalized least-mean-squares (NLMS) algorithm. The book first explains how the APA evolved from the NLMS algorithm, where an affine projection view is emphasized. By looking at those adaptation algorithms from such a geometrical point of view, we can find many of the important properties of the APA, e.g., the improvement of the convergence rate over the NLMS algorithm especially for correlated input signals. After the birth of the APA in the mid-1980s, similar algorithms were put forward by other researchers independently from different perspectives. This book shows that they are variants of the APA, forming a family of APAs. Then it surveys research on the convergence behavior of the APA, where statistical analyses play important roles. It also reviews developments of techniques to reduce the computational complexity of the APA, which are important f...
Kalman filter based algorithms for PANDA rate at FAIR
Energy Technology Data Exchange (ETDEWEB)
Prencipe, Elisabetta; Ritman, James [IKP, Forschungszentrum Juelich (Germany); Rauch, Johannes [E18, Technische Universitaet Muenchen (Germany); Collaboration: PANDA-Collaboration
2015-07-01
PANDA at the future FAIR facility in Darmstadt is an experiment with a cooled antiproton beam in a range between 1.5 and 15 GeV/c, allowing a wide physics program in nuclear and particle physics. High average reaction rates up to 2.10{sup 7} interactions/s are expected. PANDA is the only experiment worldwide, which combines a solenoid field and a dipole field in an experiment with a fixed target topology. The tracking system must be able to reconstruct high momenta in the laboratory frame. The tracking system of PANDA involves the presence of a high performance silicon vertex detector, a GEM detector, a Straw-Tubes central tracker, a forward tracking system, and a luminosity monitor. The first three of those, are inserted in a solenoid homogeneous magnetic field (B=2 T), the latter two are inside a dipole magnetic field (B=2 Tm), The offline tracking algorithm is developed within the PandaRoot framework, which is a part of the FAIRRoot project. The algorithm is based on a tool containing the Kalman Filter equations and a deterministic annealing filter (GENFIT). The Kalman-Filter-based routines can perform extrapolations of track parameters and covariance matrices. In GENFIT2, the Runge-Kutta track representation is available. First results of an implementation of GENFIT2 in PandaRoot are presented. Resolutions and efficiencies for different beam momenta and different track hypotheses are shown.
Singh, R.; Verma, H. K.
2013-12-01
This paper presents a teaching-learning-based optimization (TLBO) algorithm to solve parameter identification problems in the designing of digital infinite impulse response (IIR) filter. TLBO based filter modelling is applied to calculate the parameters of unknown plant in simulations. Unlike other heuristic search algorithms, TLBO algorithm is an algorithm-specific parameter-less algorithm. In this paper big bang-big crunch (BB-BC) optimization and PSO algorithms are also applied to filter design for comparison. Unknown filter parameters are considered as a vector to be optimized by these algorithms. MATLAB programming is used for implementation of proposed algorithms. Experimental results show that the TLBO is more accurate to estimate the filter parameters than the BB-BC optimization algorithm and has faster convergence rate when compared to PSO algorithm. TLBO is used where accuracy is more essential than the convergence speed.
Directory of Open Access Journals (Sweden)
Lund Ole
2009-09-01
Full Text Available Abstract Background The major histocompatibility complex (MHC molecule plays a central role in controlling the adaptive immune response to infections. MHC class I molecules present peptides derived from intracellular proteins to cytotoxic T cells, whereas MHC class II molecules stimulate cellular and humoral immunity through presentation of extracellularly derived peptides to helper T cells. Identification of which peptides will bind a given MHC molecule is thus of great importance for the understanding of host-pathogen interactions, and large efforts have been placed in developing algorithms capable of predicting this binding event. Results Here, we present a novel artificial neural network-based method, NN-align that allows for simultaneous identification of the MHC class II binding core and binding affinity. NN-align is trained using a novel training algorithm that allows for correction of bias in the training data due to redundant binding core representation. Incorporation of information about the residues flanking the peptide-binding core is shown to significantly improve the prediction accuracy. The method is evaluated on a large-scale benchmark consisting of six independent data sets covering 14 human MHC class II alleles, and is demonstrated to outperform other state-of-the-art MHC class II prediction methods. Conclusion The NN-align method is competitive with the state-of-the-art MHC class II peptide binding prediction algorithms. The method is publicly available at http://www.cbs.dtu.dk/services/NetMHCII-2.0.
Genetic Algorithm Applied to the Eigenvalue Equalization Filtered-x LMS Algorithm (EE-FXLMS
Directory of Open Access Journals (Sweden)
Stephan P. Lovstedt
2008-01-01
Full Text Available The FXLMS algorithm, used extensively in active noise control (ANC, exhibits frequency-dependent convergence behavior. This leads to degraded performance for time-varying tonal noise and noise with multiple stationary tones. Previous work by the authors proposed the eigenvalue equalization filtered-x least mean squares (EE-FXLMS algorithm. For that algorithm, magnitude coefficients of the secondary path transfer function are modified to decrease variation in the eigenvalues of the filtered-x autocorrelation matrix, while preserving the phase, giving faster convergence and increasing overall attenuation. This paper revisits the EE-FXLMS algorithm, using a genetic algorithm to find magnitude coefficients that give the least variation in eigenvalues. This method overcomes some of the problems with implementing the EE-FXLMS algorithm arising from finite resolution of sampled systems. Experimental control results using the original secondary path model, and a modified secondary path model for both the previous implementation of EE-FXLMS and the genetic algorithm implementation are compared.
Improvement of S/N ratio of seismic data by hyperbolic filter algorithm
Institute of Scientific and Technical Information of China (English)
Xue Hao; Yue Li; Baojun Yang
2006-01-01
This paper deals with the implementation of the hyperbolic filter algorithm for noise suppression of seismic data. Known the velocity of reflection event, utilizes the resemblance of reflection signal in each seismic trace, the hyperbolic filter algorithm is effective in enhance reflection event and suppress the random noise. This algorithm is used to CDP gathers also is compared with the algorithm of τ-p transform. Simulation shows the hyperbolic filter is effective and better than τ-p transform.
Self-alignment of full skewed RSINS:observability analysis and full-observable Kalman filter
Institute of Scientific and Technical Information of China (English)
Lailiang Song; Chunxi Zhang; Jiazhen Lu
2014-01-01
Traditional orthogonal strapdown inertial navigation sys-tem (SINS) cannot achieve satisfactory self-alignment accuracy in the stationary base: taking more than 5 minutes and al the iner-tial sensors biases cannot get ful observability except the up-axis accelerometer. However, the ful skewed redundant SINS (RSINS) can not only enhance the reliability of the system, but also improve the accuracy of the system, such as the initial alignment. Firstly, the observability of the system state includes attitude errors and al the inertial sensors biases are analyzed with the global perspective method: any three gyroscopes and three accelerometers can be assembled into an independent subordinate SINS (sub-SINS);the system state can be uniquely confirmed by the coupling connec-tions of al the sub-SINSs;the attitude errors and random constant biases of al the inertial sensors are observable. However, the ran-dom noises of the inertial sensors are not taken into account in the above analyzing process. Secondly, the ful-observable Kalman filter which can be applied to the actual RSINS containing random noises is established; the system state includes the position, ve-locity, attitude errors of al the sub-SINSs and the random constant biases of the redundant inertial sensors. At last, the initial self-alignment process of a typical four-redundancy ful skewed RSINS is simulated: the horizontal attitudes (pitch, rol ) errors and yaw error can be exactly evaluated within 80 s and 100 s respectively, while the random constant biases of gyroscopes and accelero-meters can be precisely evaluated within 120 s. For the ful skewed RSINS, the self-alignment accuracy is greatly improved, mean-while the self-alignment time is widely shortened.
Protein alignment algorithms with an efficient backtracking routine on multiple GPUs
Directory of Open Access Journals (Sweden)
Kierzynka Michal
2011-05-01
Full Text Available Abstract Background Pairwise sequence alignment methods are widely used in biological research. The increasing number of sequences is perceived as one of the upcoming challenges for sequence alignment methods in the nearest future. To overcome this challenge several GPU (Graphics Processing Unit computing approaches have been proposed lately. These solutions show a great potential of a GPU platform but in most cases address the problem of sequence database scanning and computing only the alignment score whereas the alignment itself is omitted. Thus, the need arose to implement the global and semiglobal Needleman-Wunsch, and Smith-Waterman algorithms with a backtracking procedure which is needed to construct the alignment. Results In this paper we present the solution that performs the alignment of every given sequence pair, which is a required step for progressive multiple sequence alignment methods, as well as for DNA recognition at the DNA assembly stage. Performed tests show that the implementation, with performance up to 6.3 GCUPS on a single GPU for affine gap penalties, is very efficient in comparison to other CPU and GPU-based solutions. Moreover, multiple GPUs support with load balancing makes the application very scalable. Conclusions The article shows that the backtracking procedure of the sequence alignment algorithms may be designed to fit in with the GPU architecture. Therefore, our algorithm, apart from scores, is able to compute pairwise alignments. This opens a wide range of new possibilities, allowing other methods from the area of molecular biology to take advantage of the new computational architecture. Performed tests show that the efficiency of the implementation is excellent. Moreover, the speed of our GPU-based algorithms can be almost linearly increased when using more than one graphics card.
Application of particle filtering algorithm in image reconstruction of EMT
Wang, Jingwen; Wang, Xu
2015-07-01
To improve the image quality of electromagnetic tomography (EMT), a new image reconstruction method of EMT based on a particle filtering algorithm is presented. Firstly, the principle of image reconstruction of EMT is analyzed. Then the search process for the optimal solution for image reconstruction of EMT is described as a system state estimation process, and the state space model is established. Secondly, to obtain the minimum variance estimation of image reconstruction, the optimal weights of random samples obtained from the state space are calculated from the measured information. Finally, simulation experiments with five different flow regimes are performed. The experimental results have shown that the average image error of reconstruction results obtained by the method mentioned in this paper is 42.61%, and the average correlation coefficient with the original image is 0.8706, which are much better than corresponding indicators obtained by LBP, Landweber and Kalman Filter algorithms. So, this EMT image reconstruction method has high efficiency and accuracy, and provides a new method and means for EMT research.
Design and fabrication of microlens and spatial filter array by self-alignment
Yang, Ren; Chan, Kin Foong; Feng, Zhiqiang; Mei, Wenhui
2003-01-01
For typically small volume production of MEMS, MOEMS, fine feature PCB, high density chip packaging and display panels, especially for lab tests, low cost and the capability to change the original design easily and quickly are very important for customers and researchers. BALL Semiconductor Inc.'s Maskless Lithography Systems (MLS) feature the Digital Mirror Device (DMD) as the pattern generator to replace photo-masks. This can remove masks from UV lithography, and dramatically reduce the running cost and save time for lab tests and small volume production. At Ball Semiconductor Inc, 1.5μm line/space, 10μm line/space, and 20μm line/space Maskless Lithography Systems were developed. In our MLS, an 848×600 microlens and spatial filter array (MLSFA) was used to focus the light and to filter the noise. In order to produce smaller line-space than 16μm the MLSFA was used to get smaller UV light pad (compared with the SVGA DMD"s micro-mirror: 17μm×17μm) and to filter the noise produced from the DMD, optical lens system, and micro lens array. This MLSFA is one of the key devices for our Maskless Lithography System, and determines the resolution and quality of maskless lithography. A novel design and fabrication process of a single-package MLSFA for our Maskless Lithography System will be introduced. To avoid problems produced by misalignment between a two-piece spatial filter and microlens array, MEMS processing is used to integrate the microlens array with the spatial filter array. In this paper, the self-alignment method used to fabricate exactly matched MLSFA will be presented.
Wesselink, J.M.; Berkhoff, A.P.
2008-01-01
In this paper, real-time results are given for broadband multichannel active noise control using the regularized modified filtered-error algorithm. As compared to the standard filtered-error algorithm, the improved convergence rate and stability of the algorithm are obtained by using an inner-outer
Design of multiple sequence alignment algorithms on parallel, distributed memory supercomputers.
Church, Philip C; Goscinski, Andrzej; Holt, Kathryn; Inouye, Michael; Ghoting, Amol; Makarychev, Konstantin; Reumann, Matthias
2011-01-01
The challenge of comparing two or more genomes that have undergone recombination and substantial amounts of segmental loss and gain has recently been addressed for small numbers of genomes. However, datasets of hundreds of genomes are now common and their sizes will only increase in the future. Multiple sequence alignment of hundreds of genomes remains an intractable problem due to quadratic increases in compute time and memory footprint. To date, most alignment algorithms are designed for commodity clusters without parallelism. Hence, we propose the design of a multiple sequence alignment algorithm on massively parallel, distributed memory supercomputers to enable research into comparative genomics on large data sets. Following the methodology of the sequential progressiveMauve algorithm, we design data structures including sequences and sorted k-mer lists on the IBM Blue Gene/P supercomputer (BG/P). Preliminary results show that we can reduce the memory footprint so that we can potentially align over 250 bacterial genomes on a single BG/P compute node. We verify our results on a dataset of E.coli, Shigella and S.pneumoniae genomes. Our implementation returns results matching those of the original algorithm but in 1/2 the time and with 1/4 the memory footprint for scaffold building. In this study, we have laid the basis for multiple sequence alignment of large-scale datasets on a massively parallel, distributed memory supercomputer, thus enabling comparison of hundreds instead of a few genome sequences within reasonable time.
Directory of Open Access Journals (Sweden)
Wei Zhu
2016-06-01
Full Text Available In order to improve the tracking accuracy, model estimation accuracy and quick response of multiple model maneuvering target tracking, the interacting multiple models five degree cubature Kalman filter (IMM5CKF is proposed in this paper. In the proposed algorithm, the interacting multiple models (IMM algorithm processes all the models through a Markov Chain to simultaneously enhance the model tracking accuracy of target tracking. Then a five degree cubature Kalman filter (5CKF evaluates the surface integral by a higher but deterministic odd ordered spherical cubature rule to improve the tracking accuracy and the model switch sensitivity of the IMM algorithm. Finally, the simulation results demonstrate that the proposed algorithm exhibits quick and smooth switching when disposing different maneuver models, and it also performs better than the interacting multiple models cubature Kalman filter (IMMCKF, interacting multiple models unscented Kalman filter (IMMUKF, 5CKF and the optimal mode transition matrix IMM (OMTM-IMM.
Zhu, Wei; Wang, Wei; Yuan, Gannan
2016-06-01
In order to improve the tracking accuracy, model estimation accuracy and quick response of multiple model maneuvering target tracking, the interacting multiple models five degree cubature Kalman filter (IMM5CKF) is proposed in this paper. In the proposed algorithm, the interacting multiple models (IMM) algorithm processes all the models through a Markov Chain to simultaneously enhance the model tracking accuracy of target tracking. Then a five degree cubature Kalman filter (5CKF) evaluates the surface integral by a higher but deterministic odd ordered spherical cubature rule to improve the tracking accuracy and the model switch sensitivity of the IMM algorithm. Finally, the simulation results demonstrate that the proposed algorithm exhibits quick and smooth switching when disposing different maneuver models, and it also performs better than the interacting multiple models cubature Kalman filter (IMMCKF), interacting multiple models unscented Kalman filter (IMMUKF), 5CKF and the optimal mode transition matrix IMM (OMTM-IMM).
Registration algorithm for sensor alignment based on stochastic fuzzy neural network
Institute of Scientific and Technical Information of China (English)
Li Jiao; Jing Zhongliang; He Jiaona; Wang An
2005-01-01
Multiple sensor registration is an important link in multi-sensors data fusion. The existed algorithm is all based on the assumption that system errors come from a fixed deviation set. But there are many other factors, which can result system errors. So traditional registration algorithms have limitation. This paper presents a registration algorithm for sensor alignment based on stochastic fuzzy neural network (SNFF), and utilized fuzzy clustering algorithm obtaining the number of fuzzy rules. Finally, the simulative result illuminate that this way could gain a satisfing result.
A global optimization algorithm for protein surface alignment
Directory of Open Access Journals (Sweden)
Guerra Concettina
2010-09-01
Full Text Available Abstract Background A relevant problem in drug design is the comparison and recognition of protein binding sites. Binding sites recognition is generally based on geometry often combined with physico-chemical properties of the site since the conformation, size and chemical composition of the protein surface are all relevant for the interaction with a specific ligand. Several matching strategies have been designed for the recognition of protein-ligand binding sites and of protein-protein interfaces but the problem cannot be considered solved. Results In this paper we propose a new method for local structural alignment of protein surfaces based on continuous global optimization techniques. Given the three-dimensional structures of two proteins, the method finds the isometric transformation (rotation plus translation that best superimposes active regions of two structures. We draw our inspiration from the well-known Iterative Closest Point (ICP method for three-dimensional (3D shapes registration. Our main contribution is in the adoption of a controlled random search as a more efficient global optimization approach along with a new dissimilarity measure. The reported computational experience and comparison show viability of the proposed approach. Conclusions Our method performs well to detect similarity in binding sites when this in fact exists. In the future we plan to do a more comprehensive evaluation of the method by considering large datasets of non-redundant proteins and applying a clustering technique to the results of all comparisons to classify binding sites.
Design of Low Pass Digital FIR Filter Using Cuckoo Search Algorithm
Taranjit Singh; Harvinder Singh Josan
2014-01-01
This paper presents a novel approach of designing linear phase FIR low pass filter using cuckoo Search Algorithm (CSA). FIR filter design is a multi-modal optimization problem. The conventional optimization techniques are not efficient for digital filter design. An iterative method is introduced to find the best solution of FIR filter design problem.Flat passband and high stopband attenuation are the major characteristics required in FIR filter design. To achieve these charact...
Toh, H
1997-08-01
Two approximations were introduced into the double dynamic programming algorithm, in order to reduce the computational time for structural alignment. One of them was the so-called distance cut-off, which approximately describes the structural environment of each residue by its local environment. In the approximation, a sphere with a given radius is placed at the center of the side chain of each residue. The local environment of a residue is constituted only by the residues with side chain centers that are present within the sphere, which is expressed by a set of center-to-center distances from the side chain of the residue to those of all the other constituent residues. The residues outside the sphere are neglected from the local environment. Another approximation is associated with the distance cut-off, which is referred to here as the delta N cut-off. If two local environments are similar to each other, the numbers of residues constituting the environments are expected to be similar. The delta N cut-off was introduced based on the idea. If the difference between the numbers of the constituent residues of two local environments is greater than a given threshold value, delta N, the evaluation of the similarity between the local environments is skipped. The introduction of the two approximations dramatically reduced the computational time for structural alignment by the double dynamic programming algorithm. However, the approximations also decreased the accuracy of the alignment. To improve the accuracy with the approximations, a program with a two-step alignment algorithm was constructed. At first, an alignment was roughly constructed with the approximations. Then, the epsilon-suboptimal region for the alignment was determined. Finally, the double dynamic programming algorithm with full structural environments was applied to the residue pairs within the epsilon-suboptimal region to produce an improved alignment.
New Collaborative Filtering Algorithms Based on SVD++ and Differential Privacy
Directory of Open Access Journals (Sweden)
Zhengzheng Xian
2017-01-01
Full Text Available Collaborative filtering technology has been widely used in the recommender system, and its implementation is supported by the large amount of real and reliable user data from the big-data era. However, with the increase of the users’ information-security awareness, these data are reduced or the quality of the data becomes worse. Singular Value Decomposition (SVD is one of the common matrix factorization methods used in collaborative filtering, which introduces the bias information of users and items and is realized by using algebraic feature extraction. The derivative model SVD++ of SVD achieves better predictive accuracy due to the addition of implicit feedback information. Differential privacy is defined very strictly and can be proved, which has become an effective measure to solve the problem of attackers indirectly deducing the personal privacy information by using background knowledge. In this paper, differential privacy is applied to the SVD++ model through three approaches: gradient perturbation, objective-function perturbation, and output perturbation. Through theoretical derivation and experimental verification, the new algorithms proposed can better protect the privacy of the original data on the basis of ensuring the predictive accuracy. In addition, an effective scheme is given that can measure the privacy protection strength and predictive accuracy, and a reasonable range for selection of the differential privacy parameter is provided.
A Novel Robust Interval Kalman Filter Algorithm for GPS/INS Integrated Navigation
Directory of Open Access Journals (Sweden)
Chen Jiang
2016-01-01
Full Text Available Kalman filter is widely applied in data fusion of dynamic systems under the assumption that the system and measurement noises are Gaussian distributed. In literature, the interval Kalman filter was proposed aiming at controlling the influences of the system model uncertainties. The robust Kalman filter has also been proposed to control the effects of outliers. In this paper, a new interval Kalman filter algorithm is proposed by integrating the robust estimation and the interval Kalman filter in which the system noise and the observation noise terms are considered simultaneously. The noise data reduction and the robust estimation methods are both introduced into the proposed interval Kalman filter algorithm. The new algorithm is equal to the standard Kalman filter in terms of computation, but superior for managing with outliers. The advantage of the proposed algorithm is demonstrated experimentally using the integrated navigation of Global Positioning System (GPS and the Inertial Navigation System (INS.
Denoising of Noisy Pixels in Video by Neighborhood Correlation Filtering Algorithm
Directory of Open Access Journals (Sweden)
P.Karunakaran
2012-07-01
Full Text Available A fast filtering algorithm for color video based on Neighborhood Correlation Filtering is presented. By utilizing a 3 × 3 pixel template, the algorithm can discriminate and filter various patterns of noise spots or blocks. In contrast with many kinds of median filtering algorithm, which may cause image blurring, it has much higher edge preserving ability. Furthermore, this algorithm is able to synchronously reflect image quality via amount, location and density statistics. Filtering of detected pixels is done by NCF algorithm based on a noise adaptive mean absolute difference. The experiments show that the proposed method outperforms other state-of-the-art filters both visually and in terms of objective quality measures such as the mean absolute error (MAE, the peak-signal-to-noise ratio (PSNR and the normalized color difference (NCD.
A Novel Approach to Fast Image Filtering Algorithm of Infrared Images based on Intro Sort Algorithm
Gupta, Kapil Kumar; Niranjan, Jitendra Kumar
2012-01-01
In this study we investigate the fast image filtering algorithm based on Intro sort algorithm and fast noise reduction of infrared images. Main feature of the proposed approach is that no prior knowledge of noise required. It is developed based on Stefan- Boltzmann law and the Fourier law. We also investigate the fast noise reduction approach that has advantage of less computation load. In addition, it can retain edges, details, text information even if the size of the window increases. Intro sort algorithm begins with Quick sort and switches to heap sort when the recursion depth exceeds a level based on the number of elements being sorted. This approach has the advantage of fast noise reduction by reducing the comparison time. It also significantly speed up the noise reduction process and can apply to real-time image processing. This approach will extend the Infrared images applications for medicine and video conferencing.
Wang, Zhenwu; Hut, Rolf; van de Giesen, Nick
2017-04-01
Particle filtering is a nonlinear and non-Gaussian dynamical filtering system. It has found widespread applications in hydrological data assimilation. In order to solve the loss of particle diversity exiting in resampling process of particle filter, this research proposes an improved particle filter algorithm using genetic algorithm optimization and Gamma test. This method combines the genetic algorithm and Gamma test into the resampling procedure of particle filter to improve the adaptability and performance of particle filter in data assimilation. First, the particles are classified to three different groups based on resampling method. The particles with high weight values remain unchanged. Then genetic algorithm is used to cross and variate the rest of the particles. In the process of the optimization, the Gamma test method is applied for monitoring the quality of the new generated particles. When the gamma statistic stays stable, the algorithm will end the optimization and continue to perturb next observations in particle algorithm. The algorithm is illustrated for the three-dimensional Lorenz model and the much more complex 40-dimensional Lorenz model. The results demonstrate this method can keep the diversity of the particles and enhance the performance of the particle filter, leading to the promising conjecture that the method is applicable to realistic hydrological problems.
Wang, Youhua; Nakayama, Kenji
1995-01-01
In this letter, we introduce a predictor based least square (PLS) algorithm. By involving both order- and time-update recursions, the PLS algorithm is found to have a more stable performance compared with the stable version (Version II) of the RLS algorithm shown in Ref. [1]. Nevertheless, the computational requirement is about 50% of that of the RLS algorithm. As an application, the PLS algorithm can be applied to the fast newton transversal filters (FNTF) [2]. The FNTF algorithms suffer fro...
Study on Performance Improvement of Oil Paint Image Filter Algorithm Using Parallel Pattern Library
Directory of Open Access Journals (Sweden)
Siddhartha Mukherjee
2014-03-01
Full Text Available This paper gives a detailed study on the performanc e of oil paint image filter algorithm with various parameters applied on an image of RGB model . Oil Paint image processing, being very performance hungry, current research tries to find improvement using parallel pattern library. With increasing kernel-size, the processing time of oil paint image filter algorithm increases exponentially.
A Fuzzy Logic Based Controller for the Automated Alignment of a Laser-beam-smoothing Spatial Filter
Krasowski, M. J.; Dickens, D. E.
1992-01-01
A fuzzy logic based controller for a laser-beam-smoothing spatial filter is described. It is demonstrated that a human operator's alignment actions can easily be described by a system of fuzzy rules of inference. The final configuration uses inexpensive, off-the-shelf hardware and allows for a compact, readily implemented embedded control system.
Implementation of FFT Algorithm using DSP TMS320F28335 for Shunt Active Power Filter
Patel, Pinkal Jashvantbhai; Patel, Rajesh M.; Patel, Vinod
2016-07-01
This work presents simulation, analysis and experimental verification of Fast Fourier Transform (FFT) algorithm for shunt active power filter based on three-level inverter. Different types of filters can be used for elimination of harmonics in the power system. In this work, FFT algorithm for reference current generation is discussed. FFT control algorithm is verified using PSIM simulation results with DLL block and C-code. Simulation results are compared with experimental results for FFT algorithm using DSP TMS320F28335 for shunt active power filter application.
Implementation of FFT Algorithm using DSP TMS320F28335 for Shunt Active Power Filter
Patel, Pinkal Jashvantbhai; Patel, Rajesh M.; Patel, Vinod
2017-06-01
This work presents simulation, analysis and experimental verification of Fast Fourier Transform (FFT) algorithm for shunt active power filter based on three-level inverter. Different types of filters can be used for elimination of harmonics in the power system. In this work, FFT algorithm for reference current generation is discussed. FFT control algorithm is verified using PSIM simulation results with DLL block and C-code. Simulation results are compared with experimental results for FFT algorithm using DSP TMS320F28335 for shunt active power filter application.
Review of alignment and SNP calling algorithms for next-generation sequencing data.
Mielczarek, M; Szyda, J
2016-02-01
Application of the massive parallel sequencing technology has become one of the most important issues in life sciences. Therefore, it was crucial to develop bioinformatics tools for next-generation sequencing (NGS) data processing. Currently, two of the most significant tasks include alignment to a reference genome and detection of single nucleotide polymorphisms (SNPs). In many types of genomic analyses, great numbers of reads need to be mapped to the reference genome; therefore, selection of the aligner is an essential step in NGS pipelines. Two main algorithms-suffix tries and hash tables-have been introduced for this purpose. Suffix array-based aligners are memory-efficient and work faster than hash-based aligners, but they are less accurate. In contrast, hash table algorithms tend to be slower, but more sensitive. SNP and genotype callers may also be divided into two main different approaches: heuristic and probabilistic methods. A variety of software has been subsequently developed over the past several years. In this paper, we briefly review the current development of NGS data processing algorithms and present the available software.
Sadygov, Rovshan G; Maroto, Fernando Martin; Hühmer, Andreas F R
2006-12-15
We present an algorithmic approach to align three-dimensional chromatographic surfaces of LC-MS data of complex mixture samples. The approach consists of two steps. In the first step, we prealign chromatographic profiles: two-dimensional projections of chromatographic surfaces. This is accomplished by correlation analysis using fast Fourier transforms. In this step, a temporal offset that maximizes the overlap and dot product between two chromatographic profiles is determined. In the second step, the algorithm generates correlation matrix elements between full mass scans of the reference and sample chromatographic surfaces. The temporal offset from the first step indicates a range of the mass scans that are possibly correlated, then the correlation matrix is calculated only for these mass scans. The correlation matrix carries information on highly correlated scans, but it does not itself determine the scan or time alignment. Alignment is determined as a path in the correlation matrix that maximizes the sum of the correlation matrix elements. The computational complexity of the optimal path generation problem is reduced by the use of dynamic programming. The program produces time-aligned surfaces. The use of the temporal offset from the first step in the second step reduces the computation time for generating the correlation matrix and speeds up the process. The algorithm has been implemented in a program, ChromAlign, developed in C++ language for the .NET2 environment in WINDOWS XP. In this work, we demonstrate the applications of ChromAlign to alignment of LC-MS surfaces of several datasets: a mixture of known proteins, samples from digests of surface proteins of T-cells, and samples prepared from digests of cerebrospinal fluid. ChromAlign accurately aligns the LC-MS surfaces we studied. In these examples, we discuss various aspects of the alignment by ChromAlign, such as constant time axis shifts and warping of chromatographic surfaces.
Directory of Open Access Journals (Sweden)
Qiguang Zhu
2014-05-01
Full Text Available To resolve the difficulty in establishing accurate priori noise model for the extended Kalman filtering algorithm, propose the fractional-order Darwinian particle swarm optimization (PSO algorithm has been proposed and introduced into the fuzzy adaptive extended Kalman filtering algorithm. The natural selection method has been adopted to improve the standard particle swarm optimization algorithm, which enhanced the diversity of particles and avoided the premature. In addition, the fractional calculus has been used to improve the evolution speed of particles. The PSO algorithm after improved has been applied to train fuzzy adaptive extended Kalman filter and achieve the simultaneous localization and mapping. The simulation results have shown that compared with the geese particle swarm optimization training of fuzzy adaptive extended Kalman filter localization and mapping algorithm, has been greatly improved in terms of localization and mapping.
Algorithm for Design of Digital Notch Filter Using Simulation
Directory of Open Access Journals (Sweden)
Amit Verma
2013-08-01
Full Text Available A smooth waveform is generated of low frequency signal can be achieved through the Digital Notch Filter. Noise can be easily eliminated from a speech signal by using a Notch filter. In this paper the design of notch filter using MATLAB has been designed and implemented. The performance and characteristics of the filter has been shown in the waveform in the conclusion part of the paper.
Institute of Scientific and Technical Information of China (English)
YANGGuo-Sheng; WENCheng-Lin; TANMin
2004-01-01
A new multisensor distributed track fusion algorithm is put forward based on combiningthe feedback integration with the strong tracking Kalman filter. Firstly, an effective tracking gateis constructed by taking the intersection of the tracking gates formed before and after feedback.Secondly, on the basis of the constructed effective tracking gate, probabilistic data association andstrong tracking Kalman filter are combined to form the new multisensor distributed track fusionalgorithm. At last, simulation is performed on the original algorithm and the algorithm presented.
Evaluation of Laser Based Alignment Algorithms Under Additive Random and Diffraction Noise
Energy Technology Data Exchange (ETDEWEB)
McClay, W A; Awwal, A; Wilhelmsen, K; Ferguson, W; McGee, M; Miller, M
2004-09-30
The purpose of the automatic alignment algorithm at the National Ignition Facility (NIF) is to determine the position of a laser beam based on the position of beam features from video images. The position information obtained is used to command motors and attenuators to adjust the beam lines to the desired position, which facilitates the alignment of all 192 beams. One of the goals of the algorithm development effort is to ascertain the performance, reliability, and uncertainty of the position measurement. This paper describes a method of evaluating the performance of algorithms using Monte Carlo simulation. In particular we show the application of this technique to the LM1{_}LM3 algorithm, which determines the position of a series of two beam light sources. The performance of the algorithm was evaluated for an ensemble of over 900 simulated images with varying image intensities and noise counts, as well as varying diffraction noise amplitude and frequency. The performance of the algorithm on the image data set had a tolerance well beneath the 0.5-pixel system requirement.
DIALIGN-T: An improved algorithm for segment-based multiple sequence alignment
Directory of Open Access Journals (Sweden)
Kaufmann Michael
2005-03-01
Full Text Available Abstract Background We present a complete re-implementation of the segment-based approach to multiple protein alignment that contains a number of improvements compared to the previous version 2.2 of DIALIGN. This previous version is superior to Needleman-Wunsch-based multi-alignment programs on locally related sequence sets. However, it is often outperformed by these methods on data sets with global but weak similarity at the primary-sequence level. Results In the present paper, we discuss strengths and weaknesses of DIALIGN in view of the underlying objective function. Based on these results, we propose several heuristics to improve the segment-based alignment approach. For pairwise alignment, we implemented a fragment-chaining algorithm that favours chains of low-scoring local alignments over isolated high-scoring fragments. For multiple alignment, we use an improved greedy procedure that is less sensitive to spurious local sequence similarities. To evaluate our method on globally related protein families, we used the well-known database BAliBASE. For benchmarking tests on locally related sequences, we created a new reference database called IRMBASE which consists of simulated conserved motifs implanted into non-related random sequences. Conclusion On BAliBASE, our new program performs significantly better than the previous version of DIALIGN and is comparable to the standard global aligner CLUSTAL W, though it is outperformed by some newly developed programs that focus on global alignment. On the locally related test sets in IRMBASE, our method outperforms all other programs that we evaluated.
RSTFC: A Novel Algorithm for Spatio-Temporal Filtering and Classification of Single-Trial EEG.
Qi, Feifei; Li, Yuanqing; Wu, Wei
2015-12-01
Learning optimal spatio-temporal filters is a key to feature extraction for single-trial electroencephalogram (EEG) classification. The challenges are controlling the complexity of the learning algorithm so as to alleviate the curse of dimensionality and attaining computational efficiency to facilitate online applications, e.g., brain-computer interfaces (BCIs). To tackle these barriers, this paper presents a novel algorithm, termed regularized spatio-temporal filtering and classification (RSTFC), for single-trial EEG classification. RSTFC consists of two modules. In the feature extraction module, an l2 -regularized algorithm is developed for supervised spatio-temporal filtering of the EEG signals. Unlike the existing supervised spatio-temporal filter optimization algorithms, the developed algorithm can simultaneously optimize spatial and high-order temporal filters in an eigenvalue decomposition framework and thus be implemented highly efficiently. In the classification module, a convex optimization algorithm for sparse Fisher linear discriminant analysis is proposed for simultaneous feature selection and classification of the typically high-dimensional spatio-temporally filtered signals. The effectiveness of RSTFC is demonstrated by comparing it with several state-of-the-arts methods on three brain-computer interface (BCI) competition data sets collected from 17 subjects. Results indicate that RSTFC yields significantly higher classification accuracies than the competing methods. This paper also discusses the advantage of optimizing channel-specific temporal filters over optimizing a temporal filter common to all channels.
PSO Algorithm based Adaptive Median Filter for Noise Removal in Image Processing Application
Directory of Open Access Journals (Sweden)
Ruby Verma
2016-07-01
Full Text Available A adaptive Switching median filter for salt and pepper noise removal based on genetic algorithm is presented. Proposed filter consist of two stages, a noise detector stage and a noise filtering stage. Particle swarm optimization seems to be effective for single objective problem. Noise Dictation stage works on it. In contrast to the standard median filter, the proposed algorithm generates the noise map of corrupted Image. Noise map gives information about the corrupted and non-corrupted pixels of Image. In filtering, filter calculates the median of uncorrupted neighbouring pixels and replaces the corrupted pixels. Extensive simulations are performed to validate the proposed filter. Simulated results show refinement both in Peak signal to noise ratio (PSNR and Image Quality Index value (IQI. Experimental results shown that proposed method is more effective than existing methods.
Design of Low Pass Digital FIR Filter Using Cuckoo Search Algorithm
Directory of Open Access Journals (Sweden)
Taranjit Singh
2014-08-01
Full Text Available This paper presents a novel approach of designing linear phase FIR low pass filter using cuckoo Search Algorithm (CSA. FIR filter design is a multi-modal optimization problem. The conventional optimization techniques are not efficient for digital filter design. An iterative method is introduced to find the best solution of FIR filter design problem.Flat passband and high stopband attenuation are the major characteristics required in FIR filter design. To achieve these characteristics, a Cuckoo Search algorithm (CSA is proposed in this paper. CSA have been used here for the design of linear phase finite impulse response (FIR filters. Results are presented in this paper that seems to be promising tool for FIR filter design
Multiple sequence alignment based on combining genetic algorithm with chaotic sequences.
Gao, C; Wang, B; Zhou, C J; Zhang, Q
2016-06-24
In bioinformatics, sequence alignment is one of the most common problems. Multiple sequence alignment is an NP (nondeterministic polynomial time) problem, which requires further study and exploration. The chaos optimization algorithm is a type of chaos theory, and a procedure for combining the genetic algorithm (GA), which uses ergodicity, and inherent randomness of chaotic iteration. It is an efficient method to solve the basic premature phenomenon of the GA. Applying the Logistic map to the GA and using chaotic sequences to carry out the chaotic perturbation can improve the convergence of the basic GA. In addition, the random tournament selection and optimal preservation strategy are used in the GA. Experimental evidence indicates good results for this process.
A gradient-constrained morphological filtering algorithm for airborne LiDAR
Li, Yong; Wu, Huayi; Xu, Hanwei; An, Ru; Xu, Jia; He, Qisheng
2013-12-01
This paper presents a novel gradient-constrained morphological filtering algorithm for bare-earth extraction from light detection and ranging (LiDAR) data. Based on the gradient feature points determined by morphological half-gradients, the potential object points are located prior to filtering. Innovative gradient-constrained morphological operations are created, which are executed only for the potential object points. Compared with the traditional morphological operations, the new operations reduce many meaningless operations for object removal and consequently decrease the possibility of losing terrain to a great extent. The applicability and reliability of this algorithm are demonstrated by evaluating the filtering performance for fifteen sample datasets in various complex scenes. The proposed algorithm is found to achieve a high level of accuracy compared with eight other filtering algorithms tested by the International Society for Photogrammetry and Remote Sensing. Moreover, the proposed algorithm has minimal error oscillation for different landscapes, which is important for quality control of digital terrain model generation.
A probabilistic coding based quantum genetic algorithm for multiple sequence alignment.
Huo, Hongwei; Xie, Qiaoluan; Shen, Xubang; Stojkovic, Vojislav
2008-01-01
This paper presents an original Quantum Genetic algorithm for Multiple sequence ALIGNment (QGMALIGN) that combines a genetic algorithm and a quantum algorithm. A quantum probabilistic coding is designed for representing the multiple sequence alignment. A quantum rotation gate as a mutation operator is used to guide the quantum state evolution. Six genetic operators are designed on the coding basis to improve the solution during the evolutionary process. The features of implicit parallelism and state superposition in quantum mechanics and the global search capability of the genetic algorithm are exploited to get efficient computation. A set of well known test cases from BAliBASE2.0 is used as reference to evaluate the efficiency of the QGMALIGN optimization. The QGMALIGN results have been compared with the most popular methods (CLUSTALX, SAGA, DIALIGN, SB_PIMA, and QGMALIGN) results. The QGMALIGN results show that QGMALIGN performs well on the presenting biological data. The addition of genetic operators to the quantum algorithm lowers the cost of overall running time.
Huang, Quanzhen; Luo, Jun; Li, Hengyu; Wang, Xiaohua
2013-08-01
With the wide application of large-scale flexible structures in spacecraft, vibration control problems in these structures have become important design issues. The filtered-X least mean square (FXLMS) algorithm is the most popular one in current active vibration control using adaptive filtering. It assumes that the source of interference can be measured and the interference source is considered as the reference signal input to the controller. However, in the actual control system, this assumption is not accurate, because it does not consider the impact of the reference signal on the output feedback signal. In this paper, an adaptive vibration active control algorithm based on an infinite impulse response (IIR) filter structure (FULMS, filtered-U least mean square) is proposed. The algorithm is based on an FXLMS algorithm framework, which replaces the finite impulse response (FIR) filter with an IIR filter. This paper focuses on the structural design of the controller, the process of the FULMS filtering control method, the design of the experimental model object, and the experimental platform construction for the entire control system. The comparison of the FXLMS algorithm with FULMS is theoretically analyzed and experimentally validated. The results show that the FULMS algorithm converges faster and controls better. The design of the FULMS controller is feasible and effective and has greater value in practical applications of aerospace engineering.
A quantum-inspired genetic algorithm based on probabilistic coding for multiple sequence alignment.
Huo, Hong-Wei; Stojkovic, Vojislav; Xie, Qiao-Luan
2010-02-01
Quantum parallelism arises from the ability of a quantum memory register to exist in a superposition of base states. Since the number of possible base states is 2(n), where n is the number of qubits in the quantum memory register, one operation on a quantum computer performs what an exponential number of operations on a classical computer performs. The power of quantum algorithms comes from taking advantages of quantum parallelism. Quantum algorithms are exponentially faster than classical algorithms. Genetic optimization algorithms are stochastic search algorithms which are used to search large, nonlinear spaces where expert knowledge is lacking or difficult to encode. QGMALIGN--a probabilistic coding based quantum-inspired genetic algorithm for multiple sequence alignment is presented. A quantum rotation gate as a mutation operator is used to guide the quantum state evolution. Six genetic operators are designed on the coding basis to improve the solution during the evolutionary process. The experimental results show that QGMALIGN can compete with the popular methods, such as CLUSTALX and SAGA, and performs well on the presenting biological data. Moreover, the addition of genetic operators to the quantum-inspired algorithm lowers the cost of overall running time.
A curvature filter and PDE based non-uniformity correction algorithm
Cheng, Kuanhong; Zhou, Huixin; Qin, Hanlin; Zhao, Dong; Qian, Kun; Rong, Shenghui; Yin, Shimin
2016-10-01
In this paper, a curvature filter and PDE based non-uniformity correction algorithm is proposed, the key point of this algorithm is the way to estimate FPN. We use anisotropic diffusion to smooth noise and Gaussian curvature filter to extract the details of original image. Then combine these two parts together by guided image filter and subtract the result from original image to get the crude approximation of FPN. After that, a Temporal Low Pass Filter (TLPF) is utilized to filter out random noise and get the accurate FPN. Finally, subtract the FPN from original image to achieve non-uniformity correction. The performance of this algorithm is tested with two infrared image sequences, and the experimental results show that the proposed method achieves a better non-uniformity correction performance.
AN ITERATIVE ALGORITHM FOR OPTIMAL DESIGN OF NON-FREQUENCY-SELECTIVE FIR DIGITAL FILTERS
Institute of Scientific and Technical Information of China (English)
Duan Miyi; Sun Chunlai; Liu Xin; Tian Xinguang
2008-01-01
This paper proposes a novel iterative algorithm for optimal design of non-frequency-se-lective Finite Impulse Response (FIR) digital filters based on the windowing method. Different from the traditional optimization concept of adjusting the window or the filter order in the windowing design of an FIR digital filter,the key idea of the algorithm is minimizing the approximation error by succes-sively modifying the design result through an iterative procedure under the condition of a fixed window length. In the iterative procedure,the known deviation of the designed frequency response in each iteration from the ideal frequency response is used as a reference for the next iteration. Because the approximation error can be specified variably,the algorithm is applicable for the design of FIR digital filters with different technical requirements in the frequency domain. A design example is employed to illustrate the efficiency of the algorithm.
NONLINEAR FILTER METHOD OF GPS DYNAMIC POSITIONING BASED ON BANCROFT ALGORITHM
Institute of Scientific and Technical Information of China (English)
ZHANGQin; TAOBen-zao; ZHAOChao-ying; WANGLi
2005-01-01
Because of the ignored items after linearization, the extended Kalman filter (EKF) becomes a form of suboptimal gradient descent algorithm. The emanative tendency exists in GPS solution when the filter equations are ill-posed. The deviation in the estimation cannot be avoided. Furthermore, the true solution may be lost in pseudorange positioning because the linearized pseudorange equations are partial solutions. To solve the above problems in GPS dynamic positioning by using EKF, a closed-form Kalman filter method called the two-stage algorithm is presented for the nonlinear algebraic solution of GPS dynamic positioning based on the global nonlinear least squares closed algorithm--Bancroft numerical algorithm of American. The method separates the spatial parts from temporal parts during processing the GPS filter problems, and solves the nonlinear GPS dynamic positioning, thus getting stable and reliable dynamic positioning solutions.
Evaluation of GMI and PMI diffeomorphic-based demons algorithms for aligning PET and CT Images.
Yang, Juan; Wang, Hongjun; Zhang, You; Yin, Yong
2015-07-08
Fusion of anatomic information in computed tomography (CT) and functional information in 18F-FDG positron emission tomography (PET) is crucial for accurate differentiation of tumor from benign masses, designing radiotherapy treatment plan and staging of cancer. Although current PET and CT images can be acquired from combined 18F-FDG PET/CT scanner, the two acquisitions are scanned separately and take a long time, which may induce potential positional errors in global and local caused by respiratory motion or organ peristalsis. So registration (alignment) of whole-body PET and CT images is a prerequisite for their meaningful fusion. The purpose of this study was to assess the performance of two multimodal registration algorithms for aligning PET and CT images. The proposed gradient of mutual information (GMI)-based demons algorithm, which incorporated the GMI between two images as an external force to facilitate the alignment, was compared with the point-wise mutual information (PMI) diffeomorphic-based demons algorithm whose external force was modified by replacing the image intensity difference in diffeomorphic demons algorithm with the PMI to make it appropriate for multimodal image registration. Eight patients with esophageal cancer(s) were enrolled in this IRB-approved study. Whole-body PET and CT images were acquired from a combined 18F-FDG PET/CT scanner for each patient. The modified Hausdorff distance (d(MH)) was used to evaluate the registration accuracy of the two algorithms. Of all patients, the mean values and standard deviations (SDs) of d(MH) were 6.65 (± 1.90) voxels and 6.01 (± 1.90) after the GMI-based demons and the PMI diffeomorphic-based demons registration algorithms respectively. Preliminary results on oncological patients showed that the respiratory motion and organ peristalsis in PET/CT esophageal images could not be neglected, although a combined 18F-FDG PET/CT scanner was used for image acquisition. The PMI diffeomorphic-based demons
Genetic algorithms and smoothing filters in solving the geophysical inversion problem
Directory of Open Access Journals (Sweden)
Šešum Vesna
2002-01-01
Full Text Available The combination of genetic algorithms, smoothing filters and geophysical tomography is used in solving the geophysical inversion problem. This hybrid technique is developed to improve the results obtained by using genetic algorithm sonly. The application of smoothing filters can improve the performance of GA implementation for solving the geophysical inversion problem. Some test-examples and the obtained comparative results are presented.
Institute of Scientific and Technical Information of China (English)
Li Zhuo; Chen Geng-Hua; Zhang Li-Hua; Yang Qian-Sheng; Feng Ji
2005-01-01
We present acomplementary least-mean-square algorithm of adaptive filtering for SQUID-based magnetocardiography, in which both rapid convergence and fine tracking are realized by switching the weight parameters back and forth between two filters according to the least mean square principle.
Glentis, George-Othon; Slump, Cornelis H.; Hermann, Otto E.
2000-01-01
In this paper a novel algorithm is presented for the efficient two-dimensional (2-D), mean squared error (MSE), FIR filtering and system identification. Filter masks of general boundaries are allowed. Efficient order updating recursions are developed by exploiting the spatial shift invariance
Federated unscented particle filtering algorithm for SINS/CNS/GPS system
Institute of Scientific and Technical Information of China (English)
HU Hai-dong; HUANG Xian-lin; LI Ming-ming; SONG Zhuo-yue
2010-01-01
To solve the problem of information fusion in the strapdown inertial navigation system(SINS)/celestial navigation system(CNS)/global positioning system(GPS)integrated navigation system described by the nonlinear/non-Gaussian error models,a new algorithm called the federated unscented particle filtering(FUPF)algorithm was introduced.In this algorithm,the unscented particle filter(UPF)served as the local filter,the federated filter was used to fuse outputs of all local filters,and the global filter result was obtained.Because the algorithm was not confined to the assumption of Gaussian noise,it was of great significance to integrated navigation systems described by the non-Gaussian noise.The proposed algorithm was tested in a vehicle's maneuvering trajectory,which included six flight phases: climbing,level flight,left turning,level flight,right turning and level flight.Simulation results are presented to demonstrate the improved performance of the FUPF over conventional federated unscented Kalman filter(FUKF).For instance,the mean of position-error decreases from(0.640×10 6 rad,0.667×10 6 rad,4.25 m)of FUKF to(0.403×10-6 rad,0.251 × 10 6 rad,1.36 m)of FUPF.In comparison of the FUKF,the FUPF performs more accurate in the SINS/CNS/GPS system described by the nonlinear/non-Gaussian error models.
A gate size estimation algorithm for data association filters
Institute of Scientific and Technical Information of China (English)
WANG MingHui; WAN Qun; YOU ZhiSheng
2008-01-01
The problem of forming validation regions or gates for new sensor measurements obtained when tracking targets in clutter is considered. Since the gate size is an integral part of the data association filter, this paper is intended to describe a way of estimating the gate size via the performance of the data association filter. That is, the gate size can be estimated by looking for the optimal performance of the data association filter. Simulations show that this estimation method of the gate size offers advantages over the common and classical estimation methods of the gate size, especially in a heavy clutter and/or false alarm environment.
FPGA-Based Architecture for a Generalized Parallel 2-D MRI Filtering Algorithm
Directory of Open Access Journals (Sweden)
Sami Hasan
2011-01-01
Full Text Available Problem statement: Current Neuroimaging developments, in biological research and diagnostics, demand an edge-defined and noise-free MRI scans. Thus, this study presents a generalized parallel 2-D MRI filtering algorithm with their FPGA-based implementation in a single unified architecture. The parallel 2-D MRI filtering algorithms are Edge, Sobel X, Sobel Y, Sobel X-Y, Blur, Smooth, Sharpen, Gaussian and Beta (HYB. Then, the nine MRI image filtering algorithm, has empirically improved to generate enhanced MRI scans filtering results without significantly affecting the developed performance indices of high throughput and low power consumption at maximum operating frequency. Approach: The parallel 2-d MRI filtering algorithms are developed and FPGA implemented using Xilinx System Generator tool within the ISE 12.3 development suite. Two unified architectures are behaviorally developed, depending on the abstraction level of implementation. For performance indices comparison, two Virtex-6 FPGA boards, namely, xc6vlX240Tl-1lff1759 and xc6vlX130Tl-1lff1156 are behaviorally targeted. Results: The improved parallel 2-D filtering algorithms enhanced the filtered MRI scans to be edge-defined and noise free grayscale imaging. The single architecture is efficiently prototyped to achieve: high filtering performance of (11230 frames/second throughput for 64*64 MRI grayscale scan, minimum power consumption of 0.86 Watt with a junction temperature of 52°C and a maximum frequency of up to (230 MHz. Conclusion: The improved parallel MRI filtering algorithms which are developed as a single unified architecture provide visibility enhancement within the filtered MRI scan to aid the physician in detecting brain diseases, e.g., trauma or intracranial haemorrhage. The high filtering throughput is feasibly nominee the nine parallel MRI filtering algorithms for applications such as real-time MRI potential future applications. Future Work: a set of parallel 3-D f
FPGA Implementation of Optimal Filtering Algorithm for TileCal ROD System
Torres, J; Castillo, V; Cuenca, C; Ferrer, A; Fullana, E; González, V; Higón, E; Poveda, J; Ruiz-Martinez, A; Salvachúa, B; Sanchis, E; Solans, C; Valero, A; Valls, J A
2008-01-01
Traditionally, Optimal Filtering Algorithm has been implemented using general purpose programmable DSP chips. Alternatively, new FPGAs provide a highly adaptable and flexible system to develop this algorithm. TileCal ROD is a multi-channel system, where similar data arrives at very high sampling rates and is subject to simultaneous tasks. It include different FPGAs with high I/O and with parallel structures that provide a benefit at a data analysis. The Optical Multiplexer Board is one of the elements presents in TileCal ROD System. It has FPGAs devices that present an ideal platform for implementing Optimal Filtering Algorithm. Actually this algorithm is performing in the DSPs included at ROD Motherboard. This work presents an alternative to implement Optimal Filtering Algorithm.
New Approach for IIR Adaptive Lattice Filter Structure Using Simultaneous Perturbation Algorithm
Martinez, Jorge Ivan Medina; Nakano, Kazushi; Higuchi, Kohji
Adaptive infinite impulse response (IIR), or recursive, filters are less attractive mainly because of the stability and the difficulties associated with their adaptive algorithms. Therefore, in this paper the adaptive IIR lattice filters are studied in order to devise algorithms that preserve the stability of the corresponding direct-form schemes. We analyze the local properties of stationary points, a transformation achieving this goal is suggested, which gives algorithms that can be efficiently implemented. Application to the Steiglitz-McBride (SM) and Simple Hyperstable Adaptive Recursive Filter (SHARF) algorithms is presented. Also a modified version of Simultaneous Perturbation Stochastic Approximation (SPSA) is presented in order to get the coefficients in a lattice form more efficiently and with a lower computational cost and complexity. The results are compared with previous lattice versions of these algorithms. These previous lattice versions may fail to preserve the stability of stationary points.
Weng, Jing-Feng; Lo, Yu-Lung
2012-05-07
For 3D objects with height discontinuities, the image reconstruction performance of interferometric systems is adversely affected by the presence of noise in the wrapped phase map. Various schemes have been proposed for detecting residual noise, speckle noise and noise at the lateral surfaces of the discontinuities. However, in most schemes, some noisy pixels are missed and noise detection errors occur. Accordingly, this paper proposes two robust filters (designated as Filters A and B, respectively) for improving the performance of the phase unwrapping process for objects with height discontinuities. Filter A comprises a noise and phase jump detection scheme and an adaptive median filter, while Filter B replaces the detected noise with the median phase value of an N × N mask centered on the noisy pixel. Filter A enables most of the noise and detection errors in the wrapped phase map to be removed. Filter B then detects and corrects any remaining noise or detection errors during the phase unwrapping process. Three reconstruction paths are proposed, Path I, Path II and Path III. Path I combines the path-dependent MACY algorithm with Filters A and B, while Paths II and III combine the path-independent cellular automata (CA) algorithm with Filters A and B. In Path II, the CA algorithm operates on the whole wrapped phase map, while in Path III, the CA algorithm operates on multiple sub-maps of the wrapped phase map. The simulation and experimental results confirm that the three reconstruction paths provide a robust and precise reconstruction performance given appropriate values of the parameters used in the detection scheme and filters, respectively. However, the CA algorithm used in Paths II and III is relatively inefficient in identifying the most suitable unwrapping paths. Thus, of the three paths, Path I yields the lowest runtime.
Spatial mask filtering algorithm for partial discharge pulse extraction of large generators
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
A spatial mask filter algorithm (SMF) for partial discharge (PD) pulse extraction is proposed in this then direct multiplication of coefficients at two adjacent scales is used to detect singularity points of the signal tain the last spatial mask filter. By multiplication of wavelet coefficients with the final mask filter and wavelet reconstruction process, partial discharge pulses are extracted. The results of digital simulation and practical experiment show that this method is superior to traditional wavelet shrinkage method (TWS). This algorithm not only can increase the signal to noise ratio (SNR), but also can preserve the energy and pulse amplitude.
A SLAM Algorithm Based on Adaptive Cubature Kalman Filter
Directory of Open Access Journals (Sweden)
Fei Yu
2014-01-01
CKF-SLAM and the adaptive estimator, the new ACKF-SLAM algorithm can reduce the state estimated error significantly and improve the navigation accuracy of the SLAM system effectively. The performance of this new algorithm has been examined through numerical simulations in different scenarios. The results have shown that the position error can be effectively reduced with the new adaptive CKF-SLAM algorithm. Compared with other traditional SLAM methods, the accuracy of the nonlinear SLAM system is significantly improved. It verifies that the proposed ACKF-SLAM algorithm is valid and feasible.
Development of a noise reduction filter algorithm for pediatric body images in multidetector CT.
Nishimaru, Eiji; Ichikawa, Katsuhiro; Okita, Izumi; Tomoshige, Yukihiro; Kurokawa, Takehiro; Nakamura, Yuko; Suzuki, Masayuki
2010-12-01
Recently, several types of post-processing image filter which was designed to reduce noise allowing a corresponding dose reduction in CT images have been proposed and these were reported to be useful for noise reduction of CT images of adult patients. However, these have not been reported on adaptation for pediatric patients. Because they are not very effective with small (<20 cm) display fields of view, they could not be used for pediatric (e.g., premature babies and infants) body CT images. In order to solve this restriction, we have developed a new noise reduction filter algorithm which can be applicable for pediatric body CT images. This algorithm is based on a three-dimensional post processing, in which output pixel values are calculated by multi-directional, one-dimensional median filters on original volumetric datasets. The processed directions were selected except in in-plane (axial plane) direction, and consequently the in-plane spatial resolution was not affected by the filter. Also, in other directions, the spatial resolutions including slice thickness were almost maintained due to a characteristic of non-linear filtering of the median filter. From the results of phantom studies, the proposed algorithm could reduce standard deviation values as a noise index by up to 30% without affecting the spatial resolution of all directions, and therefore, contrast-to-noise ratio was improved by up to 30%. This newly developed filter algorithm will be useful for the diagnosis and radiation dose reduction of pediatric body CT images.
Seismic data filtering using non-local means algorithm based on structure tensor
Yang, Shuai; Chen, Anqing; Chen, Hongde
2017-05-01
Non-Local means algorithm is a new and effective filtering method. It calculates weights of all similar neighborhoods' center points relative to filtering point within searching range by Gaussian weighted Euclidean distance between neighborhoods, then gets filtering point's value by weighted average to complete the filtering operation. In this paper, geometric distance of neighborhood's center point is taken into account in the distance measure calculation, making the non-local means algorithm more reasonable. Furthermore, in order to better protect the geometry structure information of seismic data, we introduce structure tensor that can depict the local geometrical features of seismic data. The coherence measure, which reflects image local contrast, is extracted from the structure tensor, is integrated into the non-local means algorithm to participate in the weight calculation, the control factor of geometry structure similarity is added to form a non-local means filtering algorithm based on structure tensor. The experimental results prove that the algorithm can effectively restrain noise, with strong anti-noise and amplitude preservation effect, improving PSNR and protecting structure information of seismic image. The method has been successfully applied in seismic data processing, indicating that it is a new and effective technique to conduct the structure-preserved filtering of seismic data.
图像去噪算法的研究%Research on Image Filtering Algorithm
Institute of Scientific and Technical Information of China (English)
穆远彪; 于亚龙
2014-01-01
Analyzes the denoising algorithm based on salt, pepper noise and gaussian noise. These algorithms have median filtering, average filter and Wiener filter. The experimental results show that the median filtering has better effect for salt and pepper noise. Compared with medi-an filtering and average filter, the Wiener filter has the better effect for the Gaussian noising. However, the Wiener filter algorithm is easy to loss of edge information and almost invalidly to salt and pepper noise.%主要针对图像的高斯噪声和椒盐噪声的去噪算法进行研究，分别使用到中值滤波、均值滤波和维纳滤波三种滤波算法。实验结果表明中值滤波对于椒盐噪声有更好的去噪效果；维纳滤波对高斯噪声有明显的作用，相比中值滤波和均值滤波，维纳滤波对高斯噪声有很好的抑制效果，与此同时，维纳滤波却容易丢失边缘信息且对椒盐噪声几乎没有去噪作用。
A filter algorithm for multi-measurement nonlinear system with parameter perturbation
Institute of Scientific and Technical Information of China (English)
GUO Yun-fei; WEI Wei; XUE An-ke; MAO Dong-cai
2006-01-01
An improved interacting multiple models particle filter (IMM-PF) algorithm is proposed for multi-measurement nonlinear system with parameter perturbation. It divides the perturbation region into sub-regions and assigns each of them a particle filter. Hence the perturbation problem is converted into a multi-model filters problem. It combines the multiple measurements into a fusion value according to their likelihood function. In the simulation study, we compared it with the IMM-KF and the H-infinite filter; the results testify to its advantage over the other two methods.
Big Bang–Big Crunch Optimization Algorithm for Linear Phase Fir Digital Filter Design
Directory of Open Access Journals (Sweden)
Ms. Rashmi Singh Dr. H. K. Verma
2012-02-01
Full Text Available The Big Bang–Big Crunch (BB–BC optimization algorithm is a new optimization method that relies on the Big Bang and Big Crunch theory, one of the theories of the evolution of the universe. In this paper, a Big Bang–Big Crunch algorithm has been used here for the design of linear phase finite impulse response (FIR filters. Here the experimented fitness function based on the mean squared error between the actual and the ideal filter response. This paper presents the plot of magnitude response of FIR filters and error graph. The BB-BC seems to be promising tool for FIR filter design especially in a dynamic environment where filter coefficients have to be adapted and fast convergence is of importance.
PERFORMANCE EVALUATION OF DIFFERENT GROUND FILTERING ALGORITHMS FOR UAV-BASED POINT CLOUDS
Directory of Open Access Journals (Sweden)
C. Serifoglu
2016-06-01
Full Text Available Digital Elevation Model (DEM generation is one of the leading application areas in geomatics. Since a DEM represents the bare earth surface, the very first step of generating a DEM is to separate the ground and non-ground points, which is called ground filtering. Once the point cloud is filtered, the ground points are interpolated to generate the DEM. LiDAR (Light Detection and Ranging point clouds have been used in many applications thanks to their success in representing the objects they belong to. Hence, in the literature, various ground filtering algorithms have been reported to filter the LiDAR data. Since the LiDAR data acquisition is still a costly process, using point clouds generated from the UAV images to produce DEMs is a reasonable alternative. In this study, point clouds with three different densities were generated from the aerial photos taken from a UAV (Unmanned Aerial Vehicle to examine the effect of point density on filtering performance. The point clouds were then filtered by means of five different ground filtering algorithms as Progressive Morphological 1D (PM1D, Progressive Morphological 2D (PM2D, Maximum Local Slope (MLS, Elevation Threshold with Expand Window (ETEW and Adaptive TIN (ATIN. The filtering performance of each algorithm was investigated qualitatively and quantitatively. The results indicated that the ATIN and PM2D algorithms showed the best overall ground filtering performances. The MLS and ETEW algorithms were found as the least successful ones. It was concluded that the point clouds generated from the UAVs can be a good alternative for LiDAR data.
RB Particle Filter Time Synchronization Algorithm Based on the DPM Model
Directory of Open Access Journals (Sweden)
Chunsheng Guo
2015-09-01
Full Text Available Time synchronization is essential for node localization, target tracking, data fusion, and various other Wireless Sensor Network (WSN applications. To improve the estimation accuracy of continuous clock offset and skew of mobile nodes in WSNs, we propose a novel time synchronization algorithm, the Rao-Blackwellised (RB particle filter time synchronization algorithm based on the Dirichlet process mixture (DPM model. In a state-space equation with a linear substructure, state variables are divided into linear and non-linear variables by the RB particle filter algorithm. These two variables can be estimated using Kalman filter and particle filter, respectively, which improves the computational efficiency more so than if only the particle filter was used. In addition, the DPM model is used to describe the distribution of non-deterministic delays and to automatically adjust the number of Gaussian mixture model components based on the observational data. This improves the estimation accuracy of clock offset and skew, which allows achieving the time synchronization. The time synchronization performance of this algorithm is also validated by computer simulations and experimental measurements. The results show that the proposed algorithm has a higher time synchronization precision than traditional time synchronization algorithms.
Leroux, C; Dainty, C
2010-01-18
Most Shack-Hartmann based aberrometers use infrared light, for the comfort of the patients. A large amount of the light that is scattered from the retinal layers is recorded by the detector as background, from which it is not trivial to estimate the centroid of the Shack-Hartmann spot. For a centroiding algorithm, background light can lead to a systematic bias of the centroid positions towards the centre of the software window. We implement a matched filter algorithm for the estimation of the centroid positions of the Shack-Hartmann spots recorded by our aberrometer. We briefly present the performance of our algorithm, and recall the well-known robustness of the matched filter algorithm to background light. Using data collected on 5 human eyes, we parameterise a simple and fast centroiding algorithm and reduce the difference between the two algorithms down to a mean residual wavefront of 0.02 microm rms.
Optimal Filtering Algorithm for Stochastic 2-D FMM Ⅱ with Multiplicative Noise
Institute of Scientific and Technical Information of China (English)
CHU Dongsheng; LIANG Meng; SHI Xin; ZHANG Ling
2004-01-01
A stochastic two-dimensional Fornasini-Marchesini's Model Ⅱ (2-D FMM Ⅱ) with multiplicative noise is given,and a filtering algorithm for this model, which is optimal in the sense of linear minimum-variance, is developed. The stochastic 2-D FMM Ⅱ with multiplicative noise can be reduced to a 1-D model, and the proposed optimal filtering algorithm for the stochastic 2-D FMM Ⅱ with multiplicative noise is obtained by using the state estimation theory of 1-D systems. An example is given to illustrate the validity of this algorithm.
Directory of Open Access Journals (Sweden)
M. Komperød
2011-01-01
Full Text Available The Czochralski (CZ crystallization process is used to produce monocrystalline silicon for solar cell wafers and electronics. Tight temperature control of the molten silicon is most important for achieving high crystal quality. SINTEF Materials and Chemistry operates a CZ process. During one CZ batch, two pyrometers were used for temperature measurement. The silicon pyrometer measures the temperature of the molten silicon. This pyrometer is assumed to be accurate, but has much high-frequency measurement noise. The graphite pyrometer measures the temperature of a graphite material. This pyrometer has little measurement noise. There is quite a good correlation between the two pyrometer measurements. This paper presents a sensor fusion algorithm that merges the two pyrometer signals for producing a temperature estimate with little measurement noise, while having significantly less phase lag than traditional lowpass- filtering of the silicon pyrometer. The algorithm consists of two sub-algorithms: (i A dynamic model is used to estimate the silicon temperature based on the graphite pyrometer, and (ii a lowpass filter and a highpass filter designed as complementary filters. The complementary filters are used to lowpass-filter the silicon pyrometer, highpass-filter the dynamic model output, and merge these filtered signals. Hence, the lowpass filter attenuates noise from the silicon pyrometer, while the graphite pyrometer and the dynamic model estimate those frequency components of the silicon temperature that are lost when lowpass-filtering the silicon pyrometer. The algorithm works well within a limited temperature range. To handle a larger temperature range, more research must be done to understand the process' nonlinear dynamics, and build this into the dynamic model.
Valentino, G; Gasior, M; Mirarchi, D; Nosych, A A; Redaelli, S; Salvachua, B; Assmann, R W; Sammut, N
2013-01-01
Collimators with embedded Beam Position Monitor (BPM) buttons will be installed in the LHC during the upcoming long shutdown period. During the subsequent operation, the BPMs will allow the collimator jaws to be kept centered around the beam trajectory. In this manner, the best possible beam cleaning efficiency and machine protection can be provided at unprecedented higher beam energies and intensities. A collimator alignment algorithm is proposed to center the jaws automatically around the beam. The algorithm is based on successive approximation, as the BPM measurements are affected by non-linearities, which vary with the distance between opposite buttons, as well as the difference between the beam and the jaw centers. The successful test results, as well as some considerations for eventual operation in the LHC are also presented.
Successive approximation algorithm for beam-position-monitor-based LHC collimator alignment
Valentino, Gianluca; Nosych, Andriy A.; Bruce, Roderik; Gasior, Marek; Mirarchi, Daniele; Redaelli, Stefano; Salvachua, Belen; Wollmann, Daniel
2014-02-01
Collimators with embedded beam position monitor (BPM) button electrodes will be installed in the Large Hadron Collider (LHC) during the current long shutdown period. For the subsequent operation, BPMs will allow the collimator jaws to be kept centered around the beam orbit. In this manner, a better beam cleaning efficiency and machine protection can be provided at unprecedented higher beam energies and intensities. A collimator alignment algorithm is proposed to center the jaws automatically around the beam. The algorithm is based on successive approximation and takes into account a correction of the nonlinear BPM sensitivity to beam displacement and an asymmetry of the electronic channels processing the BPM electrode signals. A software implementation was tested with a prototype collimator in the Super Proton Synchrotron. This paper presents results of the tests along with some considerations for eventual operation in the LHC.
Improvement of Performance of MegaBlast Algorithm for DNA Sequence Alignment
Institute of Scientific and Technical Information of China (English)
Guang-Ming Tan; Lin Xu; Dong-Bo Bu; Sheng-Zhong Feng; Ning-Hui Sun
2006-01-01
MegaBlast is one of the most important programs in NCBI BLAST (Basic Local Alignment Search Tool)toolkits. However, MegaBlast is computation and I/O intensive. It consumes a great deal of memory which is proportional to the size of the query sequences set and subject (database) sequences set of product. This paper proposes a new strategy for optimizing MegaBlast. The new strategy exchanges the query and subject sequences sets, and builds a hash table based on new subject sequences. It overlaps I/O with computation, shortens the overall time and reduces the cost of memory,since the memory here is only proportional to the size of subject sequences set. The optimized algorithm is suitable to be parallelized in cluster systems. The parallel algorithm uses query segmentation method. As our experiments shown, the parallel program which is implemented with MPI has fine scalability.
Image Recommendation Algorithm Using Feature-Based Collaborative Filtering
Kim, Deok-Hwan
As the multimedia contents market continues its rapid expansion, the amount of image contents used in mobile phone services, digital libraries, and catalog service is increasing remarkably. In spite of this rapid growth, users experience high levels of frustration when searching for the desired image. Even though new images are profitable to the service providers, traditional collaborative filtering methods cannot recommend them. To solve this problem, in this paper, we propose feature-based collaborative filtering (FBCF) method to reflect the user's most recent preference by representing his purchase sequence in the visual feature space. The proposed approach represents the images that have been purchased in the past as the feature clusters in the multi-dimensional feature space and then selects neighbors by using an inter-cluster distance function between their feature clusters. Various experiments using real image data demonstrate that the proposed approach provides a higher quality recommendation and better performance than do typical collaborative filtering and content-based filtering techniques.
Khalil, Hossam; Kim, Dongkyu; Jo, Youngjoon; Park, Kyihwan
2017-06-01
An optical component called a Dove prism is used to rotate the laser beam of a laser-scanning vibrometer (LSV). This is called a derotator and is used for measuring the vibration of rotating objects. The main advantage of a derotator is that it works independently from an LSV. However, this device requires very specific alignment, in which the axis of the Dove prism must coincide with the rotational axis of the object. If the derotator is misaligned with the rotating object, the results of the vibration measurement are imprecise, owing to the alteration of the laser beam on the surface of the rotating object. In this study, a method is proposed for aligning a derotator with a rotating object through an image-processing algorithm that obtains the trajectory of a landmark attached to the object. After the trajectory of the landmark is mathematically modeled, the amount of derotator misalignment with respect to the object is calculated. The accuracy of the proposed method for aligning the derotator with the rotating object is experimentally tested.
QuickProbs--a fast multiple sequence alignment algorithm designed for graphics processors.
Gudyś, Adam; Deorowicz, Sebastian
2014-01-01
Multiple sequence alignment is a crucial task in a number of biological analyses like secondary structure prediction, domain searching, phylogeny, etc. MSAProbs is currently the most accurate alignment algorithm, but its effectiveness is obtained at the expense of computational time. In the paper we present QuickProbs, the variant of MSAProbs customised for graphics processors. We selected the two most time consuming stages of MSAProbs to be redesigned for GPU execution: the posterior matrices calculation and the consistency transformation. Experiments on three popular benchmarks (BAliBASE, PREFAB, OXBench-X) on quad-core PC equipped with high-end graphics card show QuickProbs to be 5.7 to 9.7 times faster than original CPU-parallel MSAProbs. Additional tests performed on several protein families from Pfam database give overall speed-up of 6.7. Compared to other algorithms like MAFFT, MUSCLE, or ClustalW, QuickProbs proved to be much more accurate at similar speed. Additionally we introduce a tuned variant of QuickProbs which is significantly more accurate on sets of distantly related sequences than MSAProbs without exceeding its computation time. The GPU part of QuickProbs was implemented in OpenCL, thus the package is suitable for graphics processors produced by all major vendors.
QuickProbs—A Fast Multiple Sequence Alignment Algorithm Designed for Graphics Processors
Gudyś, Adam; Deorowicz, Sebastian
2014-01-01
Multiple sequence alignment is a crucial task in a number of biological analyses like secondary structure prediction, domain searching, phylogeny, etc. MSAProbs is currently the most accurate alignment algorithm, but its effectiveness is obtained at the expense of computational time. In the paper we present QuickProbs, the variant of MSAProbs customised for graphics processors. We selected the two most time consuming stages of MSAProbs to be redesigned for GPU execution: the posterior matrices calculation and the consistency transformation. Experiments on three popular benchmarks (BAliBASE, PREFAB, OXBench-X) on quad-core PC equipped with high-end graphics card show QuickProbs to be 5.7 to 9.7 times faster than original CPU-parallel MSAProbs. Additional tests performed on several protein families from Pfam database give overall speed-up of 6.7. Compared to other algorithms like MAFFT, MUSCLE, or ClustalW, QuickProbs proved to be much more accurate at similar speed. Additionally we introduce a tuned variant of QuickProbs which is significantly more accurate on sets of distantly related sequences than MSAProbs without exceeding its computation time. The GPU part of QuickProbs was implemented in OpenCL, thus the package is suitable for graphics processors produced by all major vendors. PMID:24586435
QuickProbs--a fast multiple sequence alignment algorithm designed for graphics processors.
Directory of Open Access Journals (Sweden)
Adam Gudyś
Full Text Available Multiple sequence alignment is a crucial task in a number of biological analyses like secondary structure prediction, domain searching, phylogeny, etc. MSAProbs is currently the most accurate alignment algorithm, but its effectiveness is obtained at the expense of computational time. In the paper we present QuickProbs, the variant of MSAProbs customised for graphics processors. We selected the two most time consuming stages of MSAProbs to be redesigned for GPU execution: the posterior matrices calculation and the consistency transformation. Experiments on three popular benchmarks (BAliBASE, PREFAB, OXBench-X on quad-core PC equipped with high-end graphics card show QuickProbs to be 5.7 to 9.7 times faster than original CPU-parallel MSAProbs. Additional tests performed on several protein families from Pfam database give overall speed-up of 6.7. Compared to other algorithms like MAFFT, MUSCLE, or ClustalW, QuickProbs proved to be much more accurate at similar speed. Additionally we introduce a tuned variant of QuickProbs which is significantly more accurate on sets of distantly related sequences than MSAProbs without exceeding its computation time. The GPU part of QuickProbs was implemented in OpenCL, thus the package is suitable for graphics processors produced by all major vendors.
Stochastic error whitening algorithm for linear filter estimation with noisy data.
Rao, Yadunandana N; Erdogmus, Deniz; Rao, Geetha Y; Principe, Jose C
2003-01-01
Mean squared error (MSE) has been the most widely used tool to solve the linear filter estimation or system identification problem. However, MSE gives biased results when the input signals are noisy. This paper presents a novel stochastic gradient algorithm based on the recently proposed error whitening criterion (EWC) to tackle the problem of linear filter estimation in the presence of additive white disturbances. We will briefly motivate the theory behind the new criterion and derive an online stochastic gradient algorithm. Convergence proof of the stochastic gradient algorithm is derived making mild assumptions. Further, we will propose some extensions to the stochastic gradient algorithm to ensure faster, step-size independent convergence. We will perform extensive simulations and compare the results with MSE as well as total-least squares in a parameter estimation problem. The stochastic EWC algorithm has many potential applications. We will use this in designing robust inverse controllers with noisy data.
A Simple, Fast, Filter-Based Algorithm for Approximate Circular Pattern Matching.
Azim, Md Aashikur Rahman; Iliopoulos, Costas S; Rahman, M Sohel; Samiruzzaman, M
2016-03-01
This paper deals with the approximate version of the circular pattern matching (ACPM) problem, which appears as an interesting problem in many biological contexts. The circular pattern matching problem consists in finding all occurrences of the rotations of a pattern P of length m in a text T of length n. In ACPM, we consider occurrences with k -mismatches under the Hamming distance model. In this paper, we present a simple and fast filter-based algorithm to solve the ACPM problem. We compare our algorithm with the state of the art algorithms and the results are found to be excellent. In particular, our algorithm runs almost twice as fast than the state of the art. Much of the efficiency of our algorithm can be attributed to its filters that are effective but extremely simple and lightweight.
Silva, Felipe O; Hemerly, Elder M; Leite Filho, Waldemar C
2017-02-23
This paper presents the second part of a study aiming at the error state selection in Kalman filters applied to the stationary self-alignment and calibration (SSAC) problem of strapdown inertial navigation systems (SINS). The observability properties of the system are systematically investigated, and the number of unobservable modes is established. Through the analytical manipulation of the full SINS error model, the unobservable modes of the system are determined, and the SSAC error states (except the velocity errors) are proven to be individually unobservable. The estimability of the system is determined through the examination of the major diagonal terms of the covariance matrix and their eigenvalues/eigenvectors. Filter order reduction based on observability analysis is shown to be inadequate, and several misconceptions regarding SSAC observability and estimability deficiencies are removed. As the main contributions of this paper, we demonstrate that, except for the position errors, all error states can be minimally estimated in the SSAC problem and, hence, should not be removed from the filter. Corroborating the conclusions of the first part of this study, a 12-state Kalman filter is found to be the optimal error state selection for SSAC purposes. Results from simulated and experimental tests support the outlined conclusions.
Application of the Trend Filtering Algorithm for Photometric Time Series Data
Gopalan, Giri; van Eyken, Julian; Ciardi, David; von Braun, Kaspar; Kane, Stephen R
2016-01-01
Detecting transient light curves (e.g., transiting planets) requires high precision data, and thus it is important to effectively filter systematic trends affecting ground based wide field surveys. We apply an implementation of the Trend Filtering Algorithm (TFA) (Kovacs et al. 2005) to the 2MASS calibration catalog and select Palomar Transient Factory (PTF) photometric time series data. TFA is successful at reducing the overall dispersion of light curves, however it may over filter intrinsic variables and increase "instantaneous" dispersion when a template set is not judiciously chosen. In an attempt to rectify these issues we modify the original literature TFA by including measurement uncertainties in its computation, including ancillary data correlated with noise, and algorithmically selecting a template set using clustering algorithms as suggested by various authors. This approach may be particularly useful for appropriately accounting for variable photometric precision surveys and/or combined data-sets. ...
Directory of Open Access Journals (Sweden)
M. Mohammadi
2015-01-01
Full Text Available This paper presents the optimal planning of harmonic passive filters in distribution system using three intelligent methods including genetic algorithm (GA, particle swarm optimization (PSO, artificial bee colony (ABC and as a new research is compared with biogeography based optimization (BBO algorithm. In this work, the considered objective function is to minimize the value of investment cost of filters and total harmonic distortion of three-phase current. It is shown that through an economical placement and sizing of LC passive filters the total voltage harmonic distortion and cost could be minimized simultaneously. BBO is a novel evolutionary algorithm that is based on the mathematics of biogeography. In the BBO model, problem solutions are represented as islands, and the sharing of features between solutions is represented as immigration and emigration between the islands. The simulation results show that the proposed method is efficient for solving the presented problem.
Gaussian Sum PHD Filtering Algorithm for Nonlinear Non-Gaussian Models
Institute of Scientific and Technical Information of China (English)
Yin Jianjun; Zhang Jianqiu; Zhuang Zesen
2008-01-01
A new multi-target filtering algorithm, termed as the Gaussian sum probability hypothesis density (GSPHD) filter, is proposed for nonlinear non-Gaussian tracking models. Provided that the initial prior intensity of the states is Gaussian or can be identified as a Gaussiaa sum, the analytical results of the algorithm show that the posterior intensity at any subsequent time step remains a Gaussian sum under the assumption that the state noise, the measurement noise, target spawn intensity, new target birth intensity, target survival probability, and detection probability are all Gaussian sums. The analysis also shows that the existing Gaassian mixture probability hypothesis density (GMPHD) filter, which is unsuitable for handling the non-Gaussian noise cases, is no more than a special ease of the proposed algorithm, which fills the shortage of incapability of treating non-Gaussian noise. The multi-target tracking simulation results verify the effectiveness of the proposed GSPHD.
A hand tracking algorithm with particle filter and improved GVF snake model
Sun, Yi-qi; Wu, Ai-guo; Dong, Na; Shao, Yi-zhe
2017-07-01
To solve the problem that the accurate information of hand cannot be obtained by particle filter, a hand tracking algorithm based on particle filter combined with skin-color adaptive gradient vector flow (GVF) snake model is proposed. Adaptive GVF and skin color adaptive external guidance force are introduced to the traditional GVF snake model, guiding the curve to quickly converge to the deep concave region of hand contour and obtaining the complex hand contour accurately. This algorithm realizes a real-time correction of the particle filter parameters, avoiding the particle drift phenomenon. Experimental results show that the proposed algorithm can reduce the root mean square error of the hand tracking by 53%, and improve the accuracy of hand tracking in the case of complex and moving background, even with a large range of occlusion.
Institute of Scientific and Technical Information of China (English)
L(U) Wei-cai; XU Shao-quan
2004-01-01
Using similar single-difference methodology(SSDM) to solve the deformation values of the monitoring points, there is unstability of the deformation information series, at sometimes.In order to overcome this shortcoming, Kalman filtering algorithm for this series is established,and its correctness and validity are verified with the test data obtained on the movable platform in plane. The results show that Kalman filtering can improve the correctness, reliability and stability of the deformation information series.
2011-01-01
Modeling phase is fundamental both in the analysis process of a dynamic system and the design of a control system. If this phase is in-line is even more critical and the only information of the system comes from input/output data. Some adaptation algorithms for fuzzy system based on extended Kalman filter are presented in this paper, which allows obtaining accurate models without renounce the computational efficiency that characterizes the Kalman filter, and allows ...
Directory of Open Access Journals (Sweden)
Zhenyang Hui
2016-01-01
Full Text Available Filtering is one of the core post-processing steps for airborne LiDAR point cloud. In recent years, the morphology-based filtering algorithms have proven to be a powerful and efficient tool for filtering airborne LiDAR point cloud. However, most traditional morphology-based algorithms have difficulties in preserving abrupt terrain features, especially when using larger filtering windows. In order to suppress the omission error caused by protruding terrain features, this paper proposes an improved morphological algorithm based on multi-level kriging interpolation. This algorithm is essentially a combination of progressive morphological filtering algorithm and multi-level interpolation filtering algorithm. The morphological opening operation is performed with filtering window gradually downsizing, while kriging interpolation is conducted at different levels according to the different filtering windows. This process is iterative in a top to down fashion until the filtering window is no longer greater than the preset minimum filtering window. Fifteen samples provided by the ISPRS commission were chosen to test the performance of the proposed algorithm. Experimental results show that the proposed method can achieve promising results not only in flat urban areas but also in rural areas. Comparing with other eight classical filtering methods, the proposed method obtained the lowest omission error, and preserved protruding terrain features better.
An improved particle filtering algorithm for aircraft engine gas-path fault diagnosis
Directory of Open Access Journals (Sweden)
Qihang Wang
2016-07-01
Full Text Available In this article, an improved particle filter with electromagnetism-like mechanism algorithm is proposed for aircraft engine gas-path component abrupt fault diagnosis. In order to avoid the particle degeneracy and sample impoverishment of normal particle filter, the electromagnetism-like mechanism optimization algorithm is introduced into resampling procedure, which adjusts the position of the particles through simulating attraction–repulsion mechanism between charged particles of the electromagnetism theory. The improved particle filter can solve the particle degradation problem and ensure the diversity of the particle set. Meanwhile, it enhances the ability of tracking abrupt fault due to considering the latest measurement information. Comparison of the proposed method with three different filter algorithms is carried out on a univariate nonstationary growth model. Simulations on a turbofan engine model indicate that compared to the normal particle filter, the improved particle filter can ensure the completion of the fault diagnosis within less sampling period and the root mean square error of parameters estimation is reduced.
Improving the Prediction Accuracy of Multicriteria Collaborative Filtering by Combination Algorithms
Directory of Open Access Journals (Sweden)
Wiranto
2014-05-01
Full Text Available This study focuses on developing the multicriteria collaborative filtering algorithmfor improving the prediction accuracy. The approaches applied were user-item multirating matrix decomposition, the measurement of user similarity using cosine formula and multidimensional distance, individual criteria weight calculation, and rating prediction for the overall criteria by a combination approach. Results of the study show variation in multicriteria collaborative filtering algorithm, which was used for improving the document recommender system with the two following characteristics. First, the rating prediction for four individual criteria using collaborative filtering algorithm by a cosine-based user similarity and a multidimensional distance-based user similarity. Second, the rating prediction for the overall criteria using a combination algorithms. Based on the results of testing, it can be concluded that a variety of models developed for the multicriteria collaborative filtering systems had much better prediction accuracy than for the classic collaborative filtering, which was characterized by the increasingly smaller values of Mean Absolute Error. The best accuracy was achieved by the multicriteria collaborative filtering system with multidimensional distance-based similarity.
Zhu, Wu; Fang, Jian-an; Tang, Yang; Zhang, Wenbing; Du, Wei
2012-01-01
Design of a digital infinite-impulse-response (IIR) filter is the process of synthesizing and implementing a recursive filter network so that a set of prescribed excitations results a set of desired responses. However, the error surface of IIR filters is usually non-linear and multi-modal. In order to find the global minimum indeed, an improved differential evolution (DE) is proposed for digital IIR filter design in this paper. The suggested algorithm is a kind of DE variants with a controllable probabilistic (CPDE) population size. It considers the convergence speed and the computational cost simultaneously by nonperiodic partial increasing or declining individuals according to fitness diversities. In addition, we discuss as well some important aspects for IIR filter design, such as the cost function value, the influence of (noise) perturbations, the convergence rate and successful percentage, the parameter measurement, etc. As to the simulation result, it shows that the presented algorithm is viable and comparable. Compared with six existing State-of-the-Art algorithms-based digital IIR filter design methods obtained by numerical experiments, CPDE is relatively more promising and competitive.
Institute of Scientific and Technical Information of China (English)
黄湘远; 汤霞清; 武萌; 高军强
2015-01-01
为了降低非线性对准的计算量而不损失对准精度，针对容积卡尔曼滤波( CKF)采样点数与状态维数成正比、计算量较大的问题，提出了基于简化CKF/降维CKF混合滤波的非线性对准方法。利用大失准角模型和基于线性观测方程的简化CKF算法进行水平对准；使用大方位失准角模型和降维CKF完成精对准。仿真结果表明，该方法摆脱了CKF算法的“维数灾难”和降维CKF对准应用条件限制，能够完成任意失准角下的初始对准并获得较高对准精度，具有重要的工程应用价值。%In order to reduce calculation amount and keep alignment precision of nonlinear alignment, the problems that the sample points are directly proportional to state dimension and the calculation amount is large in cubature Kalman filter ( CKF) , a new alignment algorithm with mixed filter based on simplified CKF(SCKF) and reduced dimension CKF(RDCKF) proposed. The level alignment finished by a large misalignment angle model and SCKF without coarse alignment; the fine alignment fulfilled by a large azimuth misalignment angle model and RDCKF based on the level alignment. The simulation result shows that this way two disadvantages that CKF’ s“dimension prob-lem” and RDCKF’ s application limitation. It is available on any misalignment angle and has higher precision, and with important engi-neering application value.
New hybrid genetic particle swarm optimization algorithm to design multi-zone binary filter.
Lin, Jie; Zhao, Hongyang; Ma, Yuan; Tan, Jiubin; Jin, Peng
2016-05-16
The binary phase filters have been used to achieve an optical needle with small lateral size. Designing a binary phase filter is still a scientific challenge in such fields. In this paper, a hybrid genetic particle swarm optimization (HGPSO) algorithm is proposed to design the binary phase filter. The HGPSO algorithm includes self-adaptive parameters, recombination and mutation operations that originated from the genetic algorithm. Based on the benchmark test, the HGPSO algorithm has achieved global optimization and fast convergence. In an easy-to-perform optimizing procedure, the iteration number of HGPSO is decreased to about a quarter of the original particle swarm optimization process. A multi-zone binary phase filter is designed by using the HGPSO. The long depth of focus and high resolution are achieved simultaneously, where the depth of focus and focal spot transverse size are 6.05λ and 0.41λ, respectively. Therefore, the proposed HGPSO can be applied to the optimization of filter with multiple parameters.
Directory of Open Access Journals (Sweden)
V. Elamaran
2012-12-01
Full Text Available In this study, we present Embedded Zerotree Wavelet (EZW algorithm to compress the image using different wavelet filters such as Biorthogonal, Coiflets, Daubechies, Symlets and Reverse Biorthogonal and to remove noise by setting appropriate threshold value while decoding. Compression methods are important in telemedicine applications by reducing number of bits per pixel to adequately represent the image. Data storage requirements are reduced and transmission efficiency is improved because of compressing the image. The EZW algorithm is an effective and computationally efficient technique in image coding. Obtaining the best image quality for a given bit rate and accomplishing this task in an embedded fashion are the two problems addressed by the EZW algorithm. A technique to decompose the image using wavelets has gained a great deal of popularity in recent years. Apart from very good compression performance, EZW algorithm has the property that the bitstream can be truncated at any point and still be decoded with a good quality image. All the standard wavelet filters are used and the results are compared with different thresholds in the encoding section. Bit rate versus PSNR simulation results are obtained for the image 256x256 barbara with different wavelet filters. It shows that the computational overhead involved with Daubechies wavelet filters but are produced better results. Like even missing details i.e., higher frequency components are picked by them which are missed by other family of wavelet filters.
A nonlinear filtering algorithm for denoising HR(S)TEM micrographs
Energy Technology Data Exchange (ETDEWEB)
Du, Hongchu, E-mail: h.du@fz-juelich.de [Ernst Ruska-Centre for Microscopy and Spectroscopy with Electrons, Jülich Research Centre, Jülich, 52425 (Germany); Central Facility for Electron Microscopy (GFE), RWTH Aachen University, Aachen 52074 (Germany); Peter Grünberg Institute, Jülich Research Centre, Jülich 52425 (Germany)
2015-04-15
Noise reduction of micrographs is often an essential task in high resolution (scanning) transmission electron microscopy (HR(S)TEM) either for a higher visual quality or for a more accurate quantification. Since HR(S)TEM studies are often aimed at resolving periodic atomistic columns and their non-periodic deviation at defects, it is important to develop a noise reduction algorithm that can simultaneously handle both periodic and non-periodic features properly. In this work, a nonlinear filtering algorithm is developed based on widely used techniques of low-pass filter and Wiener filter, which can efficiently reduce noise without noticeable artifacts even in HR(S)TEM micrographs with contrast of variation of background and defects. The developed nonlinear filtering algorithm is particularly suitable for quantitative electron microscopy, and is also of great interest for beam sensitive samples, in situ analyses, and atomic resolution EFTEM. - Highlights: • A nonlinear filtering algorithm for denoising HR(S)TEM images is developed. • It can simultaneously handle both periodic and non-periodic features properly. • It is particularly suitable for quantitative electron microscopy. • It is of great interest for beam sensitive samples, in situ analyses, and atomic resolution EFTEM.
Alignment of LHCb tracking stations with tracks fitted with a Kalman filter
Nicolas, L; Hicheur, A; Hulsbergen, W; Needham, M; Raven, G
2008-01-01
The LHCb detector, operating at the Large Hadron Collider at CERN, is a single arm spectrometer optimized for the detection of the forward b anti-b production for b physics studies. The reconstruction of vertices and tracks is done by silicon micro-strips and gaseous straw-tube based detectors. In order to achieve good mass resolution for resonances the tracking detectors should be aligned to a precision of the order of ten microns. A software framework has been developed to achieve these goals and has been tested in various configurations. After a description of the software, we present alignment results and show in particular for the first time that a global $\\chi^2$ solving for alignment using a locally parameterized track trajectory can be achieved.
Design of the annular binary filters with super-resolution based on the genetic algorithm
Institute of Scientific and Technical Information of China (English)
YU Qi-lei; LE Zi-chun; ZHU Hong-ying
2006-01-01
To improve the density of information storage,this paper introduces a kind of annular binary filters with super-resolution,Several of these filters have been designed based on the genetic algorithm,the simulations demonstrate that the transverse gain of the filters can reach the value of 1.37.Thus they can remarkably decrease the recording spot size,which is helpful to improve the density of information storage and to make the depth of focus longer,and therefore they can avoid the mistake caused by the small undulation of the optical disk in the process of recording/reading the information.
Centroid stabilization for laser alignment to corner cubes: designing a matched filter
Energy Technology Data Exchange (ETDEWEB)
Awwal, Abdul A. S.; Bliss, Erlan; Brunton, Gordon; Kamm, Victoria Miller; Leach, Richard R.; Lowe-Webb, Roger; Roberts, Randy; Wilhelmsen, Karl
2016-11-08
Automation of image-based alignment of National Ignition Facility high energy laser beams is providing the capability of executing multiple target shots per day. One important alignment is beam centration through the second and third harmonic generating crystals in the final optics assembly (FOA), which employs two retroreflecting corner cubes as centering references for each beam. Beam-to-beam variations and systematic beam changes over time in the FOA corner cube images can lead to a reduction in accuracy as well as increased convergence durations for the template-based position detector. A systematic approach is described that maintains FOA corner cube templates and guarantees stable position estimation.
Directory of Open Access Journals (Sweden)
Done Stojanov
2016-03-01
Full Text Available In this study, time and memory optimized (TMO algorithm is presented. Compared with Smith–Waterman's algorithm, TMO is applicable for a more accurate detection of continuous insertion/deletions (indels in genes’ fragments, associated with disorders caused by over-repetition of a certain codon. The improvement comes from the tendency to pinpoint indels in the least preserved nucleotide pairs. All nucleotide pairs that occur less frequently are classified as less preserved and they are considered as mutated codons whose mid-nucleotides were deleted. Other benefit of the proposed algorithm is its general tendency to maximize the number of matching nucleotides included per alignment, regardless of any specific alignment metrics. Since the structure of the solution, when applying Smith–Waterman, depends on the adjustment of the alignment parameters and, therefore, an incomplete (shortened solution may be derived, our algorithm does not reject any of the consistent matching nucleotides that can be included in the final solution. In terms of computational aspects, our algorithm runs faster than Smith–Waterman for very similar DNA and requires less memory than the most memory efficient dynamic programming algorithms. The speed up comes from the reduced number of nucleotide comparisons that have to be performed, without having to imperil the completeness of the solution. Due to the fact that four integers (16 Bytes are required for tracking matching fragment, regardless its length, our algorithm requires less memory than Huang's algorithm.
A novel gradient adaptive step size LMS algorithm with dual adaptive filters.
Jiao, Yuzhong; Cheung, Rex Y P; Chow, Winnie W Y; Mok, Mark P C
2013-01-01
Least mean square (LMS) adaptive filter has been used to extract life signals from serious ambient noises and interferences in biomedical applications. However, a LMS adaptive filter with a fixed step size always suffers from slow convergence rate or large signal distortion due to the diversity of the application environments. An ideal adaptive filtering system should be able to adapt different environments and obtain the useful signals with low distortion. Adaptive filter with gradient adaptive step size is therefore more desirable in order to meet the demands of adaptation and convergence rate, which adjusts the step-size parameter automatically by using gradient descent technique. In this paper, a novel gradient adaptive step size LMS adaptive filter is presented. The proposed algorithm utilizes two adaptive filters to estimate gradients accurately, thus achieves good adaptation and performance. Though it uses two LMS adaptive filters, it has a low computational complexity. An active noise cancellation (ANC) system with two applications for extracting heartbeat and lung sound signals from noises is used to simulate the performance of the proposed algorithm.
Digital Signal Processing Filtering Algorithm : Audio Equalization Using Matlab
Chaguaro Aldaz, Daniel
2015-01-01
The contemporary domain of Digital Signal Processing is in constant influx and trying to find new applications that will benefit the everyday life of ordinary people. In modern technology, most of the electronic processes use DSP algorithms in order to collect analogue information that is continually present all around us and convert it into a digital form. The need of understanding the basics of how these processes occur, has inspired to implement a DSP application for educational and testin...
Genetic Algorithm Phase Retrieval for the Systematic Image-Based Optical Alignment Testbed
Taylor, Jaime; Rakoczy, John; Steincamp, James
2003-01-01
Phase retrieval requires calculation of the real-valued phase of the pupil fimction from the image intensity distribution and characteristics of an optical system. Genetic 'algorithms were used to solve two one-dimensional phase retrieval problem. A GA successfully estimated the coefficients of a polynomial expansion of the phase when the number of coefficients was correctly specified. A GA also successfully estimated the multiple p h e s of a segmented optical system analogous to the seven-mirror Systematic Image-Based Optical Alignment (SIBOA) testbed located at NASA s Marshall Space Flight Center. The SIBOA testbed was developed to investigate phase retrieval techniques. Tiphilt and piston motions of the mirrors accomplish phase corrections. A constant phase over each mirror can be achieved by an independent tip/tilt correction: the phase Conection term can then be factored out of the Discrete Fourier Tranform (DFT), greatly reducing computations.
Ren, Hongwu; Dekany, Richard; Britton, Matthew
2005-05-01
We propose a new recursive filtering algorithm for wave-front reconstruction in a large-scale adaptive optics system. An embedding step is used in this recursive filtering algorithm to permit fast methods to be used for wave-front reconstruction on an annular aperture. This embedding step can be used alone with a direct residual error updating procedure or used with the preconditioned conjugate-gradient method as a preconditioning step. We derive the Hudgin and Fried filters for spectral-domain filtering, using the eigenvalue decomposition method. Using Monte Carlo simulations, we compare the performance of discrete Fourier transform domain filtering, discrete cosine transform domain filtering, multigrid, and alternative-direction-implicit methods in the embedding step of the recursive filtering algorithm. We also simulate the performance of this recursive filtering in a closed-loop adaptive optics system.
1981-07-01
1p^^i-J\\\\^3^\\\\^. TECHNICAL LIBRARY AD^y^.q ijg. TECHNICAL REPORT ARBRL-TR-02346 COMPUTER ALGORITHMS FOR THE DESIGN AND IMPLEMENTATION OF LINEAR...INSTRUCTIONS BEFORE COMPLETI?>G FORM 1. REPORT NUMBER TECHNICAL REPORT ARBRL-TR-n2.^46 i. GOVT ACCESSION NO. *. TITLE fand Sijfam;»; COMPUTER ... ALGORITHMS FOR THE DESIGN AND IMPLEMENTATION OF LINEAR PHASE FINPTE IMPULSE RESPONSE DIGITAL FILTERS 7. AUTHORf*; James N. Walbert 9
Accurate frequency alignment in fabrication of high-order microring-resonator filters.
Sun, Jie; Holzwarth, Charles W; Dahlem, Marcus; Hastings, Jeffrey T; Smith, Henry I
2008-09-29
Frequency mismatch in high-order microring-resonator filters is investigated. We demonstrate that this frequency mismatch is caused mainly by the intrafield distortion of scanning-electron-beam-lithography (SEBL) used in fabrication. The intrafield distortion of an SEBL system is measured, and a simple method is also proposed to correct this distortion. By applying this correction method, the average frequency mismatch in second-order microring-resonator filters was reduced from -8.6 GHz to 0.28 GHz.
Institute of Scientific and Technical Information of China (English)
高社生; 姜微微; 宋飞彪
2011-01-01
捷联惯导( SINS)合成孔径雷达(SAR)组合导航系统中,SINS与SAR天线附加的惯性测量元件(IMU)之间的抗干扰、动态快速传递对准是一个研究难题.为了既不增加滤波器阶数,减小计算量,又能提高传递对准的速度和精度.在吸收现有滤波算法优点的基础上,提出了一种新的奇异值分解H∞联邦滤波算法.首先,建立了“速度+姿态+位置”匹配更新的传递对准模型,利用基于奇异值分解的H∞子滤波器进行滤波,得到系统状态的局部最优估计值；然后,通过联邦滤波器对局部最优估计值进行融合得到全局最优估计值.仿真结果表明,提出的滤波算法得到的失准角估计值能在200S内收敛,且分别稳定在3′、-5′和20′,性能明显优于H∞滤波和联邦滤波.新的滤波算法不但速度快,精度高,而且计算量小,抗干扰性好,为提高传递对准的精度提供了一种新方法和新途径.%In strapdown inertial navigation system(SINS)/synthetic aperture radar(SAR) integrated navigation systems, the anti-interference and dynamic rapid transfer alignment between SINS and the additional inertial measurement unit (IMU) of the antenna for S AR is a difficult problem. In order improve the speed and precision of transfer alignment without increasing the order of filter, and reduce the amount of calculation, the paper presents a new singular value decomposition H∞ federal filtering algorithm by absorbing the advantages of existed filtering methods. First, the model of transfer alignment for "velocity + attitude + position" matching update is established, and the robust filtering is carried on by the slave filter for H∞ filtering which is based on singular value decomposition to obtain the local optimum estimation of system states. Then, the global optimum estimation is derived based on the local optimum estimation fused by the federal filter. The simulation results demonstrate that the misalignment angles
An improved filter-u least mean square vibration control algorithm for aircraft framework.
Huang, Quanzhen; Luo, Jun; Gao, Zhiyuan; Zhu, Xiaojin; Li, Hengyu
2014-09-01
Active vibration control of aerospace vehicle structures is very a hot spot and in which filter-u least mean square (FULMS) algorithm is one of the key methods. But for practical reasons and technical limitations, vibration reference signal extraction is always a difficult problem for FULMS algorithm. To solve the vibration reference signal extraction problem, an improved FULMS vibration control algorithm is proposed in this paper. Reference signal is constructed based on the controller structure and the data in the algorithm process, using a vibration response residual signal extracted directly from the vibration structure. To test the proposed algorithm, an aircraft frame model is built and an experimental platform is constructed. The simulation and experimental results show that the proposed algorithm is more practical with a good vibration suppression performance.
An improved filter-u least mean square vibration control algorithm for aircraft framework
Huang, Quanzhen; Luo, Jun; Gao, Zhiyuan; Zhu, Xiaojin; Li, Hengyu
2014-09-01
Active vibration control of aerospace vehicle structures is very a hot spot and in which filter-u least mean square (FULMS) algorithm is one of the key methods. But for practical reasons and technical limitations, vibration reference signal extraction is always a difficult problem for FULMS algorithm. To solve the vibration reference signal extraction problem, an improved FULMS vibration control algorithm is proposed in this paper. Reference signal is constructed based on the controller structure and the data in the algorithm process, using a vibration response residual signal extracted directly from the vibration structure. To test the proposed algorithm, an aircraft frame model is built and an experimental platform is constructed. The simulation and experimental results show that the proposed algorithm is more practical with a good vibration suppression performance.
An Approximate Cone Beam Reconstruction Algorithm for Gantry-Tilted CT Using Tangential Filtering
Directory of Open Access Journals (Sweden)
Ming Yan
2006-01-01
Full Text Available FDK algorithm is a well-known 3D (three-dimensional approximate algorithm for CT (computed tomography image reconstruction and is also known to suffer from considerable artifacts when the scanning cone angle is large. Recently, it has been improved by performing the ramp filtering along the tangential direction of the X-ray source helix for dealing with the large cone angle problem. In this paper, we present an FDK-type approximate reconstruction algorithm for gantry-tilted CT imaging. The proposed method improves the image reconstruction by filtering the projection data along a proper direction which is determined by CT parameters and gantry-tilted angle. As a result, the proposed algorithm for gantry-tilted CT reconstruction can provide more scanning flexibilities in clinical CT scanning and is efficient in computation. The performance of the proposed algorithm is evaluated with turbell clock phantom and thorax phantom and compared with FDK algorithm and a popular 2D (two-dimensional approximate algorithm. The results show that the proposed algorithm can achieve better image quality for gantry-tilted CT image reconstruction.
Design of Digital IIR Filter with Conflicting Objectives Using Hybrid Gravitational Search Algorithm
Directory of Open Access Journals (Sweden)
D. S. Sidhu
2015-01-01
Full Text Available In the recent years, the digital IIR filter design as a single objective optimization problem using evolutionary algorithms has gained much attention. In this paper, the digital IIR filter design is treated as a multiobjective problem by minimizing the magnitude response error, linear phase response error and optimal order simultaneously along with meeting the stability criterion. Hybrid gravitational search algorithm (HGSA has been applied to design the digital IIR filter. GSA technique is hybridized with binary successive approximation (BSA based evolutionary search method for exploring the search space locally. The relative performance of GSA and hybrid GSA has been evaluated by applying these techniques to standard mathematical test functions. The above proposed hybrid search techniques have been applied effectively to solve the multiparameter and multiobjective optimization problem of low-pass (LP, high-pass (HP, band-pass (BP, and band-stop (BS digital IIR filter design. The obtained results reveal that the proposed technique performs better than other algorithms applied by other researchers for the design of digital IIR filter with conflicting objectives.
Neumann, M; Cuvillon, L; Breton, E; de Matheli, M
2013-01-01
Recently, a workflow for magnetic resonance (MR) image plane alignment based on tracking in real-time MR images was introduced. The workflow is based on a tracking device composed of 2 resonant micro-coils and a passive marker, and allows for tracking of the passive marker in clinical real-time images and automatic (re-)initialization using the microcoils. As the Kalman filter has proven its benefit as an estimator and predictor, it is well suited for use in tracking applications. In this paper, a Kalman filter is integrated in the previously developed workflow in order to predict position and orientation of the tracking device. Measurement noise covariances of the Kalman filter are dynamically changed in order to take into account that, according to the image plane orientation, only a subset of the 3D pose components is available. The improved tracking performance of the Kalman extended workflow could be quantified in simulation results. Also, a first experiment in the MRI scanner was performed but without quantitative results yet.
Novel algorithm by low complexity filter on retinal vessel segmentation
Rostampour, Samad
2011-10-01
This article shows a new method to detect blood vessels in the retina by digital images. Retinal vessel segmentation is important for detection of side effect of diabetic disease, because diabetes can form new capillaries which are very brittle. The research has been done in two phases: preprocessing and processing. Preprocessing phase consists to apply a new filter that produces a suitable output. It shows vessels in dark color on white background and make a good difference between vessels and background. The complexity is very low and extra images are eliminated. The second phase is processing and used the method is called Bayesian. It is a built-in in supervision classification method. This method uses of mean and variance of intensity of pixels for calculate of probability. Finally Pixels of image are divided into two classes: vessels and background. Used images are related to the DRIVE database. After performing this operation, the calculation gives 95 percent of efficiency average. The method also was performed from an external sample DRIVE database which has retinopathy, and perfect result was obtained
Optimal design study of high order FIR digital filters based on neural network algorithm
Institute of Scientific and Technical Information of China (English)
王小华; 何怡刚
2004-01-01
An optimal design approach of high order FIR digital filter is developed based on the algorithm of neural networks with cosine basis function . The main idea is to minimize the sum of the square errors between the amplitude response of the desired FIR filter and that of the designed by training the weights of neural networks, then obtains the impulse response of FIR digital filter . The convergence theorem of the neural networks algorithm is presented and proved,and the optimal design method is introduced by designing four kinds of FIR digital filters , i.e., low-pass, high-pass,bandpass , and band-stop FIR digital filter. The results of the amplitude responses show that attenuation in stop-bands is more than 60 dB with no ripple and pulse existing in pass-bands, and cutoff frequency of passband and stop-band is easily controlled precisely . The presented optimal design approach of high order FIR digital filter is significantly effective.
有效的图像滤波算法%Effective noise image filter algorithm
Institute of Scientific and Technical Information of China (English)
黄春艳; 张云鹏
2012-01-01
Owing to the characteristics of the gray relation analysis and the advantage of the alpha-trimmed mean filter, an efficient algorithm for noisy images removal based on the gray relational analysis and the alpha-trimmed mean filter is proposed. This algorithm uses the gray relation analysis to adjust the filter window's coefficients adap-tively, and it can improve the validity of the algorithms. Experimental results show that the proposed algorithm not only has better filtering effect for noisy image which corrupted by Gaussian noise or mixed noise, but also can preserve the integrity of edge and keep the details of the original image.%利用灰色关联度的特性和阿尔法均值滤波算法的优点,提出一种基于改进灰色关联度和阿尔法Alpha 均值滤波的噪声图像的自适应滤波算法.该算法采用灰色关联度自适应地确定滤波窗口的加权系数值,改善算法的滤波性能.实验结果表明算法对受到高斯噪声和混合噪声干扰的图像进行去噪能取得较好的滤波效果,同时还保护了原始图像的细节信息.
A parallel implementation of the dual-input Max-Tree algorithm for attribute filtering
Ouzounis, Georgios K.; Wilkinson, Michael H.F.
2007-01-01
This paper presents a concurrent implementation of a previously developed Dual-Input Max-Tree algorithm that implements anti-extensive attribute filters based on second-generation connectivity. The paralellization strategy has been recently introduced for ordinary Max-Trees and involves the concurre
Directory of Open Access Journals (Sweden)
Shaoxing Hu
2015-11-01
Full Text Available Aiming at addressing the problem of high computational cost of the traditional Kalman filter in SINS/GPS, a practical optimization algorithm with offline-derivation and parallel processing methods based on the numerical characteristics of the system is presented in this paper. The algorithm exploits the sparseness and/or symmetry of matrices to simplify the computational procedure. Thus plenty of invalid operations can be avoided by offline derivation using a block matrix technique. For enhanced efficiency, a new parallel computational mechanism is established by subdividing and restructuring calculation processes after analyzing the extracted “useful” data. As a result, the algorithm saves about 90% of the CPU processing time and 66% of the memory usage needed in a classical Kalman filter. Meanwhile, the method as a numerical approach needs no precise-loss transformation/approximation of system modules and the accuracy suffers little in comparison with the filter before computational optimization. Furthermore, since no complicated matrix theories are needed, the algorithm can be easily transplanted into other modified filters as a secondary optimization method to achieve further efficiency.
Combination of Kalman Filtering Algorithm%一种组合式的Kalman滤波算法
Institute of Scientific and Technical Information of China (English)
余翔; 冯璐; 漆晶
2013-01-01
Because the noise impact and process signals in Kalman filtering can't be directly observed,a kind of combination of Kalman filtering algorithm is proposed.Firstly,the observation data is adaptively weighted fused.Secondly,the fusion results as a priori estimated value of the second step Kalman filtering is filtered.The adaptive algorithm combined with the Kalman algorithm improves the accuracy and precision.Finally,simulations confirme the effectiveness of the algorithm.%针对Kalman滤波算法在估计过程中存在噪声影响和过程信号无法直接观测等问题,提出一种组合式的Kalman滤波算法.首先对观测的数据进行自适应加权融合,然后将融合的结果作为第二级Kalman滤波的先验估计值,进行Kalman滤波.通过自适应算法与Kalman算法的组合算法进行数据融合,可以提高融合的准确度和精度.最后通过仿真证实算法的有效性.
A parallel implementation of the dual-input Max-Tree algorithm for attribute filtering
Ouzounis, Georgios K.; Wilkinson, Michael H.F.
2007-01-01
This paper presents a concurrent implementation of a previously developed Dual-Input Max-Tree algorithm that implements anti-extensive attribute filters based on second-generation connectivity. The paralellization strategy has been recently introduced for ordinary Max-Trees and involves the
Hu, Shaoxing; Xu, Shike; Wang, Duhu; Zhang, Aiwu
2015-11-11
Aiming at addressing the problem of high computational cost of the traditional Kalman filter in SINS/GPS, a practical optimization algorithm with offline-derivation and parallel processing methods based on the numerical characteristics of the system is presented in this paper. The algorithm exploits the sparseness and/or symmetry of matrices to simplify the computational procedure. Thus plenty of invalid operations can be avoided by offline derivation using a block matrix technique. For enhanced efficiency, a new parallel computational mechanism is established by subdividing and restructuring calculation processes after analyzing the extracted "useful" data. As a result, the algorithm saves about 90% of the CPU processing time and 66% of the memory usage needed in a classical Kalman filter. Meanwhile, the method as a numerical approach needs no precise-loss transformation/approximation of system modules and the accuracy suffers little in comparison with the filter before computational optimization. Furthermore, since no complicated matrix theories are needed, the algorithm can be easily transplanted into other modified filters as a secondary optimization method to achieve further efficiency.
Spectral measurement with a linear variable filter using a LMS algorithm
Emadi, A.; Grabarnik, S.; Wu, H.; De Graaf, R.F.; Wolffenbuttel, R.F.
2010-01-01
This paper presents spectral measurements using a linear variable optical filter. A LVOF has been developed for operation in the 530 nm–720 nm spectral band and has been fabricated in an IC-compatible process. The LVOF has been mounted on a CMOS camera. A Least Mean Square algorithm has been
Increasing the robustness of a preconditioned filtered-X LMS algorithm
Fraanje, P.R.; Verhaegen, M.; Doelman, N.J.
2004-01-01
This letter presents a robustification of the preconditioned Filtered-X LMS algorithm proposed by Elliott et al.. The method optimizes the average performance for probabilistic uncertainty in the secondary path and relaxes the SPR condition for global convergence. It also prevents large amplificatio
DEFF Research Database (Denmark)
Cappellin, C.; Pivnenko, Sergey; Jørgensen, E.
2013-01-01
This paper focuses on three important features of the 3D reconstruction algorithm of DIATOOL: the identification of array elements improper functioning and failure, the obtainable spatial resolution of the reconstructed fields and currents, and the filtering of undesired radiation and scattering...
Mejia, Yuri H.; Arguello, Henry
2016-05-01
Compressive sensing state-of-the-art proposes random Gaussian and Bernoulli as measurement matrices. Nev- ertheless, often the design of the measurement matrix is subject to physical constraints, and therefore it is frequently not possible that the matrix follows a Gaussian or Bernoulli distribution. Examples of these lim- itations are the structured and sparse matrices of the compressive X-Ray, and compressive spectral imaging systems. A standard algorithm for recovering sparse signals consists in minimizing an objective function that includes a quadratic error term combined with a sparsity-inducing regularization term. This problem can be solved using the iterative algorithms for solving linear inverse problems. This class of methods, which can be viewed as an extension of the classical gradient algorithm, is attractive due to its simplicity. However, current algorithms are slow for getting a high quality image reconstruction because they do not exploit the structured and sparsity characteristics of the compressive measurement matrices. This paper proposes the development of a gradient-based algorithm for compressive sensing reconstruction by including a filtering step that yields improved quality using less iterations. This algorithm modifies the iterative solution such that it forces to converge to a filtered version of the residual AT y, where y is the measurement vector and A is the compressive measurement matrix. We show that the algorithm including the filtering step converges faster than the unfiltered version. We design various filters that are motivated by the structure of AT y. Extensive simulation results using various sparse and structured matrices highlight the relative performance gain over the existing iterative process.
Khan, Mohammad Ibrahim; Kamal, Md Sarwar
2015-03-01
Markov Chain is very effective in prediction basically in long data set. In DNA sequencing it is always very important to find the existence of certain nucleotides based on the previous history of the data set. We imposed the Chapman Kolmogorov equation to accomplish the task of Markov Chain. Chapman Kolmogorov equation is the key to help the address the proper places of the DNA chain and this is very powerful tools in mathematics as well as in any other prediction based research. It incorporates the score of DNA sequences calculated by various techniques. Our research utilize the fundamentals of Warshall Algorithm (WA) and Dynamic Programming (DP) to measures the score of DNA segments. The outcomes of the experiment are that Warshall Algorithm is good for small DNA sequences on the other hand Dynamic Programming are good for long DNA sequences. On the top of above findings, it is very important to measure the risk factors of local sequencing during the matching of local sequence alignments whatever the length.
Neural Network Algorithm for Designing FIR Filters Utilizing Frequency-Response Masking Technique
Institute of Scientific and Technical Information of China (English)
Xiao-Hua Wang; Yi-Gang He; Tian-Zan Li
2009-01-01
This paper presents a new joint optimization method for the design of sharp linear-phase finite-impulse response (FIR) digital filters which are synthesized by using basic and multistage frequency-response-masking (FRM) techniques. The method is based on a batch back-propagation neural network algorithm with a variable learning rate mode. We propose the following two-step optimization technique in order to reduce the complexity. At the first step, an initial FRM filter is designed by alternately optimizing the subfilters. At the second step, this solution is then used as a start-up solution to further optimization. The further optimization problem is highly nonlinear with respect to the coefficients of all the subfilters. Therefore, it is decomposed into several linear neural network optimization problems. Some examples from the literature are given, and the results show that the proposed algorithm can design better FRM filters than several existing methods.
Multidimensional Systolic Arrays of LMS AlgorithmAdaptive (FIR Digital Filters
Directory of Open Access Journals (Sweden)
Bakir A. R. Al-Hashemy
2009-01-01
Full Text Available A multidimensional systolic arrays realization of LMS algorithm by a method of mapping regular algorithm onto processor array, are designed. They are based on appropriately selected 1-D systolic array filter that depends on the inner product sum systolic implementation. Various arrays may be derived that exhibit a regular arrangement of the cells (processors and local interconnection pattern, which are important for VLSI implementation. It reduces latency time and increases the throughput rate in comparison to classical 1-D systolic arrays. The 3-D multilayered array consists of 2-D layers, which are connected with each other only by edges. Such arrays for LMS-based adaptive (FIR filter may be opposed the fundamental requirements of fast convergence rate in most adaptive filter applications.
Research on Improved Collaborative Filtering Recommendation Algorithm on MapReduce
Directory of Open Access Journals (Sweden)
Dong Jie
2016-01-01
Full Text Available Information overload is one of the most serious problems in big data environment, recommendation systems is a way to effectively mitigate the problem. In order to make use of rich user feedback and social networks information and to further improve the performance of the recommendation system ,This thesis makes a improvement on the user-based collaborative filtering algorithm by normalization method, Meanwhile the algorithm could be run on the MapReduce in the Hadoop platform. The experimental results show that the algorithm on Hadoop platform can effectively improve the accuracy of the data to recommend and computational efficiency, so as to improve the satisfaction of users.
Zielinski, B.; Patorski, K.
2008-12-01
The aim of this paper is to analyze the accuracy of 2D fringe pattern denoising performed by two chosen methods using quasi-1D two-arm spin filter and 2D Discrete Wavelet Transform (DWT) signal decomposition and thresholding. The ultimate aim of this comparison is to estimate which algorithm is better suited for high-accuracy interferometric measurements. In spite of the fact that both algorithms are designed to minimize possible fringe blur and distortion, the evaluation of errors introduced by each algorithm is essential for proper estimation of their performance.
Optimal fractional delay-IIR filter design using cuckoo search algorithm.
Kumar, Manjeet; Rawat, Tarun Kumar
2015-11-01
This paper applied a novel global meta-heuristic optimization algorithm, cuckoo search algorithm (CSA) to determine optimal coefficients of a fractional delay-infinite impulse response (FD-IIR) filter and trying to meet the ideal frequency response characteristics. Since fractional delay-IIR filter design is a multi-modal optimization problem, it cannot be computed efficiently using conventional gradient based optimization techniques. A weighted least square (WLS) based fitness function is used to improve the performance to a great extent. FD-IIR filters of different orders have been designed using the CSA. The simulation results of the proposed CSA based approach have been compared to those of well accepted evolutionary algorithms like Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). The performance of the CSA based FD-IIR filter is superior to those obtained by GA and PSO. The simulation and statistical results affirm that the proposed approach using CSA outperforms GA and PSO, not only in the convergence rate but also in optimal performance of the designed FD-IIR filter (i.e., smaller magnitude error, smaller phase error, higher percentage improvement in magnitude and phase error, fast convergence rate). The absolute magnitude and phase error obtained for the designed 5th order FD-IIR filter are as low as 0.0037 and 0.0046, respectively. The percentage improvement in magnitude error for CSA based 5th order FD-IIR design with respect to GA and PSO are 80.93% and 74.83% respectively, and phase error are 76.04% and 71.25%, respectively.
Mass Conservation and Positivity Preservation with Ensemble-type Kalman Filter Algorithms
Janjic, Tijana; McLaughlin, Dennis B.; Cohn, Stephen E.; Verlaan, Martin
2013-01-01
Maintaining conservative physical laws numerically has long been recognized as being important in the development of numerical weather prediction (NWP) models. In the broader context of data assimilation, concerted efforts to maintain conservation laws numerically and to understand the significance of doing so have begun only recently. In order to enforce physically based conservation laws of total mass and positivity in the ensemble Kalman filter, we incorporate constraints to ensure that the filter ensemble members and the ensemble mean conserve mass and remain nonnegative through measurement updates. We show that the analysis steps of ensemble transform Kalman filter (ETKF) algorithm and ensemble Kalman filter algorithm (EnKF) can conserve the mass integral, but do not preserve positivity. Further, if localization is applied or if negative values are simply set to zero, then the total mass is not conserved either. In order to ensure mass conservation, a projection matrix that corrects for localization effects is constructed. In order to maintain both mass conservation and positivity preservation through the analysis step, we construct a data assimilation algorithms based on quadratic programming and ensemble Kalman filtering. Mass and positivity are both preserved by formulating the filter update as a set of quadratic programming problems that incorporate constraints. Some simple numerical experiments indicate that this approach can have a significant positive impact on the posterior ensemble distribution, giving results that are more physically plausible both for individual ensemble members and for the ensemble mean. The results show clear improvements in both analyses and forecasts, particularly in the presence of localized features. Behavior of the algorithm is also tested in presence of model error.
iDensity: an automatic Gabor filter-based algorithm for breast density assessment
Gamdonkar, Ziba; Tay, Kevin; Ryder, Will; Brennan, Patrick C.; Mello-Thoms, Claudia
2015-03-01
Abstract Although many semi-automated and automated algorithms for breast density assessment have been recently proposed, none of these have been widely accepted. In this study a novel automated algorithm, named iDensity, inspired by the human visual system is proposed for classifying mammograms into four breast density categories corresponding to the Breast Imaging Reporting and Data System (BI-RADS). For each BI-RADS category 80 cases were taken from the normal volumes of the Digital Database for Screening Mammography (DDSM). For each case only the left medio-lateral oblique was utilized. After image calibration using the provided tables of each scanner in the DDSM, the pectoral muscle and background were removed. Images were filtered by a median filter and down sampled. Images were then filtered by a filter bank consisting of Gabor filters in six orientations and 3 scales, as well as a Gaussian filter. Three gray level histogram-based features and three second order statistics features were extracted from each filtered image. Using the extracted features, mammograms were separated initially separated into two groups, low or high density, then in a second stage, the low density group was subdivided into BI-RADS I or II, and the high density group into BI-RADS III or IV. The algorithm achieved a sensitivity of 95% and specificity of 94% in the first stage, sensitivity of 89% and specificity of 95% when classifying BIRADS I and II cases, and a sensitivity of 88% and 91% specificity when classifying BI-RADS III and IV.
Fraanje, P.R.; Verhaegen, M.; Doelman, N.J.
2003-01-01
The Filtered-U LMS algorithm, proposed by Eriksson for active noise control applications, adapts the coefficients of an infinite-impulse response controller. Conditions for global convergence of the Filtered-U LMS algorithm were presented by Wang and Ren (Signal Processing, 73 (1999) 3) and Mosquera
A Review of the Performance of Artifact Filtering Algorithms for Cardiopulmonary Resuscitation
Directory of Open Access Journals (Sweden)
Yushun Gong
2013-01-01
Full Text Available Various filtering strategies have been adopted and investigated to suppress the cardiopulmonary resuscitation (CPR artifact. In this article, two types of artifact removal methods are reviewed: one is the method that removes CPR artifact using only ECG signals, and the other is the method with additional reference signals, such as acceleration, compression depth and transthoracic impedance. After filtering, the signal-to-noise ratio is improved from 0 dB to greater than 2.8 dB, the sensitivity is increased to > 90% as recommended by the American Heart Association, whereas the specificity was far from the recommended 95%, which is considered to be the major drawback of the available artifact removal methods. The overall performance of the adaptive filtering methods with additional reference signal outperforms the methods using only ECG signals. Further research should focus on the refinement of artifact filtering methods and the improvement of shock advice algorithms with the presence of CPR.
Optimality analysis of one-step OOSM filtering algorithms in target tracking
Institute of Scientific and Technical Information of China (English)
ZHOU WenHui; LI Lin; CHEN GuoHai; YU AnXi
2007-01-01
In centralized multisensor tracking systems, there are out-of-sequence measurements (OOSMs) frequently arising due to different time delays in communication links and varying pre-processing times at the sensor. Such OOSM arrival can induce the "negative-time measurement update" problem, which is quite common in real multisensor tracking systems. The A1 optimal update algorithm with OOSM is presented by Bar-Shalom for one-step case. However, this paper proves that the optimality of A1 algorithm is lost in direct discrete-time model (DDM) of the process noise, it holds true only in discretized continuous-time model (DCM). One better OOSM filtering algorithm for DDM case is presented. Also, another new optimal OOSM filtering algorithm, which is independent of the discrete time model of the process noise, is presented here. The performance of the two new algorithms is compared with that of A1 algorithm by Monte Carlo simulations. The effectiveness and correctness of the two proposed algorithms are validated by analysis and simulation results.
Directory of Open Access Journals (Sweden)
Hoffmann Nils
2012-08-01
Full Text Available Abstract Background Modern analytical methods in biology and chemistry use separation techniques coupled to sensitive detectors, such as gas chromatography-mass spectrometry (GC-MS and liquid chromatography-mass spectrometry (LC-MS. These hyphenated methods provide high-dimensional data. Comparing such data manually to find corresponding signals is a laborious task, as each experiment usually consists of thousands of individual scans, each containing hundreds or even thousands of distinct signals. In order to allow for successful identification of metabolites or proteins within such data, especially in the context of metabolomics and proteomics, an accurate alignment and matching of corresponding features between two or more experiments is required. Such a matching algorithm should capture fluctuations in the chromatographic system which lead to non-linear distortions on the time axis, as well as systematic changes in recorded intensities. Many different algorithms for the retention time alignment of GC-MS and LC-MS data have been proposed and published, but all of them focus either on aligning previously extracted peak features or on aligning and comparing the complete raw data containing all available features. Results In this paper we introduce two algorithms for retention time alignment of multiple GC-MS datasets: multiple alignment by bidirectional best hits peak assignment and cluster extension (BIPACE and center-star multiple alignment by pairwise partitioned dynamic time warping (CeMAPP-DTW. We show how the similarity-based peak group matching method BIPACE may be used for multiple alignment calculation individually and how it can be used as a preprocessing step for the pairwise alignments performed by CeMAPP-DTW. We evaluate the algorithms individually and in combination on a previously published small GC-MS dataset studying the Leishmania parasite and on a larger GC-MS dataset studying grains of wheat (Triticum aestivum. Conclusions We
An Image Filter Based on Multiobjective Genetic Algorithm and Shearlet Transformation
Directory of Open Access Journals (Sweden)
Zhi-yong Fan
2013-01-01
Full Text Available Rician noise pollutes magnetic resonance imaging (MRI data, making data’s postprocessing difficult. In order to remove this noise and avoid loss of details as much as possible, we proposed a filter algorithm using both multiobjective genetic algorithm (MOGA and Shearlet transformation. Firstly, the multiscale wavelet decomposition is applied to the target image. Secondly, the MOGA target function is constructed by evaluation methods, such as signal-to-noise ratio (SNR and mean square error (MSE. Thirdly, MOGA is used with optimal coefficients of Shearlet wavelet threshold value in a different scale and a different orientation. Finally, the noise-free image could be obtained through inverse wavelet transform. At the end of the paper, experimental results show that this proposed algorithm eliminates Rician noise more effectively and yields better peak signal-to-noise ratio (PSNR gains compared with other traditional filters.
Collaborative filtering algorithm based on Forgetting Curve and Long Tail theory
Qi, Shen; Li, Shiwei; Zhou, Hao
2017-03-01
The traditional collaborative filtering algorithm only pays attention to the rating by users. In reality, however, user and item information is always changing with time flying. Therefore, recommendation systems need to take time-varying changes into consideration. The collaborative filtering algorithm which is based on Forgetting Curve and Long Tail theory (FCLT) is introduced for the above problems. The following two points are discussed depending on the problem: First, the user-item rating matrix can update in real time by forgetting curve; secondly, according to the Long Tail theory and item popularity, a further similarity calculation method is obtained. The experimental results demonstrated that the proposed algorithm can effectively improve the recommendation accuracy and alleviate the Long Tail effect.
Directory of Open Access Journals (Sweden)
E. L. Dmitrieva
2016-05-01
Full Text Available Basic peculiarities of nonlinear Kalman filtering algorithm applied to processing of interferometric signals are considered. Analytical estimates determining statistical characteristics of signal values prediction errors were obtained and analysis of errors histograms taking into account variations of different parameters of interferometric signal was carried out. Modeling of the signal prediction procedure with known fixed parameters and variable parameters of signal in the algorithm of nonlinear Kalman filtering was performed. Numerical estimates of prediction errors for interferometric signal values were obtained by formation and analysis of the errors histograms under the influence of additive noise and random variations of amplitude and frequency of interferometric signal. Nonlinear Kalman filter is shown to provide processing of signals with randomly variable parameters, however, it does not take into account directly the linearization error of harmonic function representing interferometric signal that is a filtering error source. The main drawback of the linear prediction consists in non-Gaussian statistics of prediction errors including cases of random deviations of signal amplitude and/or frequency. When implementing stochastic filtering of interferometric signals, it is reasonable to use prediction procedures based on local statistics of a signal and its parameters taken into account.
Directory of Open Access Journals (Sweden)
Taneda Akito
2008-12-01
Full Text Available Abstract Background Aligning RNA sequences with low sequence identity has been a challenging problem since such a computation essentially needs an algorithm with high complexities for taking structural conservation into account. Although many sophisticated algorithms for the purpose have been proposed to date, further improvement in efficiency is necessary to accelerate its large-scale applications including non-coding RNA (ncRNA discovery. Results We developed a new genetic algorithm, Cofolga2, for simultaneously computing pairwise RNA sequence alignment and consensus folding, and benchmarked it using BRAliBase 2.1. The benchmark results showed that our new algorithm is accurate and efficient in both time and memory usage. Then, combining with the originally trained SVM, we applied the new algorithm to novel ncRNA discovery where we compared S. cerevisiae genome with six related genomes in a pairwise manner. By focusing our search to the relatively short regions (50 bp to 2,000 bp sandwiched by conserved sequences, we successfully predict 714 intergenic and 1,311 sense or antisense ncRNA candidates, which were found in the pairwise alignments with stable consensus secondary structure and low sequence identity (≤ 50%. By comparing with the previous predictions, we found that > 92% of the candidates is novel candidates. The estimated rate of false positives in the predicted candidates is 51%. Twenty-five percent of the intergenic candidates has supports for expression in cell, i.e. their genomic positions overlap those of the experimentally determined transcripts in literature. By manual inspection of the results, moreover, we obtained four multiple alignments with low sequence identity which reveal consensus structures shared by three species/sequences. Conclusion The present method gives an efficient tool complementary to sequence-alignment-based ncRNA finders.
Directory of Open Access Journals (Sweden)
P.Nirmala
2014-08-01
Full Text Available In this paper, an optimal design of FIR filter is carried out using a “Dynamic Regional Harmony Search algorithm (DRHS with Opposition and Local Learning”. The Harmony Search (HS is a robust optimization algorithm which mimics the musician’s improvisation method and has been used by many researchers for solving and optimizing various real-world optimization problems and numerical solutions. For optimizing the functionality of the FIR filter, DRHS algorithm which is an enhanced variant of the HS algorithm is adopted to avoid pre-mature convergence and stagnation. BY adopting DRHS algorithm the low pass, high pass, band pass and band stop FIR filters are constructed and their performances are evaluated and compared with the other existing optimization techniques. A comparison of the DRHS with other optimization algorithms for constructing FIR filter clearly shows the DRHS finds the optimal solution and the convergence is clearly guaranteed.
Multichannel Filtered-X Error Coded Affine Projection-Like Algorithm with Evolving Order
Directory of Open Access Journals (Sweden)
J. G. Avalos
2017-01-01
Full Text Available Affine projection (AP algorithms are commonly used to implement active noise control (ANC systems because they provide fast convergence. However, their high computational complexity can restrict their use in certain practical applications. The Error Coded Affine Projection-Like (ECAP-L algorithm has been proposed to reduce the computational burden while maintaining the speed of AP, but no version of this algorithm has been derived for active noise control, for which the adaptive structures are very different from those of other configurations. In this paper, we introduce a version of the ECAP-L for single-channel and multichannel ANC systems. The proposed algorithm is implemented using the conventional filtered-x scheme, which incurs a lower computational cost than the modified filtered-x structure, especially for multichannel systems. Furthermore, we present an evolutionary method that dynamically decreases the projection order in order to reduce the dimensions of the matrix used in the algorithm’s computations. Experimental results demonstrate that the proposed algorithm yields a convergence speed and a final residual error similar to those of AP algorithms. Moreover, it achieves meaningful computational savings, leading to simpler hardware implementation of real-time ANC applications.
Modification of double vector control algorithm to filter out grid harmonics
DEFF Research Database (Denmark)
Awad, Hilmy; Blaabjerg, Frede
2005-01-01
filter (MAF) to detect the fundamental component of the measured voltages and currents (needed to control the SSC) while using a double vector control algorithm (DVC) to improve the transient performance of the SSC. This is made to accurately control the fundamental voltage component at the load...... terminals in the case of distorted grid voltage. Furthermore, a selective harmonic compensation strategy is applied to filter out the grid harmonics. The operation of the SSC under distorted utility conditions and voltage dips is discussed. The validity of the proposed controller is verified by experiments...
Study of data filtering algorithms for the KM3NeT neutrino telescope
Energy Technology Data Exchange (ETDEWEB)
Herold, B., E-mail: Bjoern.Herold@physik.uni-erlangen.d [Erlangen Centre for Astroparticle Physics, Erwin-Rommel-Str. 1, 91058 Erlangen (Germany); Seitz, T., E-mail: Thomas.Seitz@physik.uni-erlangen.d [Erlangen Centre for Astroparticle Physics, Erwin-Rommel-Str. 1, 91058 Erlangen (Germany); Shanidze, R., E-mail: shanidze@physik.uni-erlangen.d [Erlangen Centre for Astroparticle Physics, Erwin-Rommel-Str. 1, 91058 Erlangen (Germany)
2011-01-21
The photomultiplier signals above a defined threshold (hits) are the main data collected from the KM3NeT neutrino telescope. The neutrino and muon events will be reconstructed from these signals. However, in the deep sea the dominant source of hits are the decays of {sup 40}K isotope and marine fauna bioluminescence. The selection of neutrino and muon events requires the implementation of fast and efficient data filtering algorithms for the reduction of accidental background event rates. A possible data filtering scheme for the KM3NeT neutrino telescope is discussed in the paper.
A Filter-Based Uniform Algorithm for Optimizing Top-k Query in Distributed Networks
Institute of Scientific and Technical Information of China (English)
ZHAO Zhibin; YAO Lan; YANG Xiaochun; LI Binyang; YU Ge
2006-01-01
In this paper we propose a Filter-based Uniform Algorithm (FbUA) for optimizing top-k query in distributed networks, which has been a topic of much recent interest.The basic idea of FbUA is to set a filter at each node to prevent it from sending out the data with little chance to contribute to the top-k result.FbUA can gain exact answers to top-k query through two phrases of round-trip communications between query station and participant nodes.The experiment results show that FbUA reduces network bandwidth consumption dramatically.
Composite cone-beam filtered backprojection algorithm based on nutating line
Institute of Scientific and Technical Information of China (English)
WANG Yu; OU Zong-ying; SU Tie-ming; WANG Feng
2006-01-01
The FDK algorithm is the most popular cone beam algorithm in the medical and industrial imaging field.Due to data insufficiency acquired from a circular trajectory,the images reconstructed by the FDK algorithm suffer from the intensity droping with increasing cone angle.To overcome the drawback,a modified FDK algorithm is presented by convert the 1D ramp filtering direction from along the horizontal lines to along the nutating lines based on the result of Turbell.Unlike Turbell's method,there is no need for our algorithm to rebin the cone-beam data into 3D parallel-beam data before reconstructing.Moreover pre-weighting of the projection data is corrected by compensating for the cone angle effect.In addition,another correction term derived from the result of Hu is also induced into our algorithm.The simulation experiments demonstrate that the final algorithm can suppress the intensity drop associated with the FDK algorithm.
Inpatient studies of a Kalman-filter-based predictive pump shutoff algorithm.
Cameron, Fraser; Wilson, Darrell M; Buckingham, Bruce A; Arzumanyan, Hasmik; Clinton, Paula; Chase, H Peter; Lum, John; Maahs, David M; Calhoun, Peter M; Bequette, B Wayne
2012-09-01
An insulin pump shutoff system can prevent nocturnal hypoglycemia and is a first step on the pathway toward a closed-loop artificial pancreas. In previous pump shutoff studies using a voting algorithm and a 1 min continuous glucose monitor (CGM), 80% of induced hypoglycemic events were prevented. The pump shutoff algorithm used in previous studies was revised to a single Kalman filter to reduce complexity, incorporate CGMs with different sample times, handle sensor signal dropouts, and enforce safety constraints on the allowable pump shutoff time. Retrospective testing of the new algorithm on previous clinical data sets indicated that, for the four cases where the previous algorithm failed (minimum reference glucose less than 60 mg/dl), the mean suspension start time was 30 min earlier than the previous algorithm. Inpatient studies of the new algorithm have been conducted on 16 subjects. The algorithm prevented hypoglycemia in 73% of subjects. Suspension-induced hyperglycemia is not assessed, because this study forced excessive basal insulin infusion rates. The new algorithm functioned well and is flexible enough to handle variable sensor sample times and sensor dropouts. It also provides a framework for handling sensor signal attenuations, which can be challenging, particularly when they occur overnight. © 2012 Diabetes Technology Society.
Directory of Open Access Journals (Sweden)
Jian Yi
2016-04-01
Full Text Available In view of the existing user similarity calculation principle of recommendation algorithm is single, and recommender system accuracy is not well, we propose a novel social multi-attribute collaborative filtering algorithm (SoMu. We first define the user attraction similarity by users’ historical rated behaviors using graph theory, and secondly, define the user interaction similarity by users’ social friendship which is based on the social relationship of being followed and following. Then, we combine the user attraction similarity and the user interaction similarity to obtain a multi-attribute comprehensive user similarity model. Finally, realize personalized recommendation according to the comprehensive similarity model. Experimental results on Douban and MovieLens show that the proposed algorithm successfully incorporates multiple attributes in social networks to recommendation algorithm, and improves the accuracy of recommender system with the improved comprehensive similarity computing model.
Duplication-remove algorithm of image based on EZW-based matrix bloom filter
Che, Yujing; Fei, Xiangdong; Hu, Bo
2011-10-01
Transmission efficiency is seriously hindered by a huge amount of data which is largely redundant during the image transmission on the network. To solver this problem, a new algorithm is put forward here. It firstly uses EZW coding algorithm to compress, code and transform data and then uses Matrix Bloom filter on account of the characters of EZW to remove the redundant data according to the strictly defined ranks. This new algorithm attains its goal of reducing the data being transmitted on the network and improving the transmission efficiency by making real-time judgment that whether the data should be transmitted again in order to cease redundant data transmission as early as possible. Finally, the effectiveness and practicability of this new algorithm has been demonstrated by the simulation experiments.
Convergence analysis of filtered-X LMS algorithm with secondary path modeling error
Institute of Scientific and Technical Information of China (English)
SUN Xu; CHEN Duanshi
2003-01-01
A more relaxed sufficient condition for the convergence of filtered-X LMS (FXLMS)algorithm is presented. It is pointed out that if some positive real condition for secondary pathtransfer function and its estimates is satisfied within all the frequency bands, FXLMS algorithmconverges whatever the reference signal is like. But if the above positive real condition is satisfiedonly within some frequency bands, the convergence of FXLMS algorithm is dependent on thedistribution of power spectral density of the reference signal, and the convergence step size isdetermined by the distribution of some specific correlation matrix eigenvalues.Applying the conclusion above to the Delayed LMS (DLMS) algorithm, it is shown thatDLMS algorithm with some error of time delay estimation converges in certain discrete fre-quency bands, and the width of which are determined only by the "time-delay estimation errorfrequency" which is equal to one fourth of the inverse of estimated error of the time delay.
The particle filter algorithm of SLAM%粒子滤波的SLAM算法
Institute of Scientific and Technical Information of China (English)
唐羽; 马小平
2011-01-01
In this paper,the mobile robot and simultaneous localization and mapping problem is discussed first in this paper,then discussed the mobile robot in indoor unknown environment of SLAM problem, based on the analysis of the particle filter algorithm, Put forward the particle filter of mobile robot synchronous simultaneous localization and mapping (SLAM) method, And gives the corresponding matlab of particle filter.The particle filter is a kind of more mature filtering technology in foreign countries, and is currently also has a lot of colleges are studying in the home.This paper introduces the principle of the particle filter and research progress of the particle filter, Looking to the future development of particle filter.%本文首先对移动机器人的同时定位与地图创建问题进行了阐述，继而讨论了移动机器人在室内未知环境下的SLAM问题，在分析粒子滤波算法的基础上，提出了以下方法：基于粒子滤波的移动机器人同时定位与地图创建方法，并给出了粒子滤波的相应的matlab实现。粒子滤波在国外已经是一种较成熟的滤波技术，目前在国内也有很多高校正在研究，本文对粒子滤波的原理和研究进展进行了详细的介绍同时对粒子滤波的未来发展进行了展望。
A Correlation Based Strategy for the Acceleration of Nonlocal Means Filtering Algorithm
Directory of Open Access Journals (Sweden)
Junfeng Zhang
2016-01-01
Full Text Available Although the nonlocal means (NLM algorithm takes a significant step forward in image filtering field, it suffers from a high computational complexity. To deal with this drawback, this paper proposes an acceleration strategy based on a correlation operation. Instead of per-pixel processing, this approach performs a simultaneous calculation of all the image pixels with the help of correlation operators. Complexity analysis and experimental results are reported and show the advantage of the proposed algorithm in terms of computation and time cost.
Czaplewski, Raymond L
2015-09-17
Wall-to-wall remotely sensed data are increasingly available to monitor landscape dynamics over large geographic areas. However, statistical monitoring programs that use post-stratification cannot fully utilize those sensor data. The Kalman filter (KF) is an alternative statistical estimator. I develop a new KF algorithm that is numerically robust with large numbers of study variables and auxiliary sensor variables. A National Forest Inventory (NFI) illustrates application within an official statistics program. Practical recommendations regarding remote sensing and statistical issues are offered. This algorithm has the potential to increase the value of synoptic sensor data for statistical monitoring of large geographic areas.
Islanding Detection for Microgrid Based on Frequency Tracking Using Extended Kalman Filter Algorithm
Directory of Open Access Journals (Sweden)
Bin Li
2014-01-01
Full Text Available Islanding detection is essential for secure and reliable operation of microgrids. Considering the relationship between the power generation and the load in microgrids, frequency may vary with time when islanding occurs. As a common approach, frequency measurement is widely used to detect islanding condition. In this paper, a novel frequency calculation algorithm based on extended Kalman filter was proposed to track dynamic frequency of the microgrid. Taylor series expansion was introduced to solve nonlinear state equations. In addition, a typical microgrid model was built using MATLAB/SIMULINK. Simulation results demonstrated that the proposed algorithm achieved great stability and strong robustness in of tracking dynamic frequency.
Improved Computing-Efficiency Least-Squares Algorithm with Application to All-Pass Filter Design
Directory of Open Access Journals (Sweden)
Lo-Chyuan Su
2013-01-01
Full Text Available All-pass filter design can be generally achieved by solving a system of linear equations. The associated matrices involved in the set of linear equations can be further formulated as a Toeplitz-plus-Hankel form such that a matrix inversion is avoided. Consequently, the optimal filter coefficients can be solved by using computationally efficient Levinson algorithms or Cholesky decomposition technique. In this paper, based on trigonometric identities and sampling the frequency band of interest uniformly, the authors proposed closed-form expressions to compute the elements of the Toeplitz-plus-Hankel matrix required in the least-squares design of IIR all-pass filters. Simulation results confirm that the proposed method achieves good performance as well as effectiveness.
Wang, Tianyang; Chu, Fulei; Han, Qinkai
2017-03-01
Identifying the differences between the spectra or envelope spectra of a faulty signal and a healthy baseline signal is an efficient planetary gearbox local fault detection strategy. However, causes other than local faults can also generate the characteristic frequency of a ring gear fault; this may further affect the detection of a local fault. To address this issue, a new filtering algorithm based on the meshing resonance phenomenon is proposed. In detail, the raw signal is first decomposed into different frequency bands and levels. Then, a new meshing index and an MRgram are constructed to determine which bands belong to the meshing resonance frequency band. Furthermore, an optimal filter band is selected from this MRgram. Finally, the ring gear fault can be detected according to the envelope spectrum of the band-pass filtering result.
New algorithm for robust H2/H∞ filtering with error variance assignment
Institute of Scientific and Technical Information of China (English)
刘立恒; 邓正隆; 王广雄
2004-01-01
We consider the robust H2/H∞ filtering problem for linear perturbed systems with steady-state error variance assignment. The generalized inverse technique of matrix is introduced, and a new algorithm is developed. After two Riccati equations are solved, the filter can be obtained directly, and the following three performance requirements are simultaneously satisfied: The filtering process is asymptotically stable; the steady-state variance of the estimation error of each state is not more than the individual prespecified upper bound; the transfer function from exogenous noise inputs to error state outputs meets the prespecified H∞ norm upper bound constraint. A numerical example is provided to demonstrate the flexibility of the proposed design approach.
Zero-crossing detection algorithm for arrays of optical spatial filtering velocimetry sensors
DEFF Research Database (Denmark)
Jakobsen, Michael Linde; Pedersen, Finn; Hanson, Steen Grüner
2008-01-01
This paper presents a zero-crossing detection algorithm for arrays of compact low-cost optical sensors based on spatial filtering for measuring fluctuations in angular velocity of rotating solid structures. The algorithm is applicable for signals with moderate signal-to-noise ratios, and delivers...... a "real-time" output (0-1 kHz). The sensors use optical spatial-filtering velocimetry on the dynamical speckles arising from scattering off a rotating solid object with a non-specular surface. The technology measures the instantaneous angular velocity of a target, without being biased by any linear...... factor is directly related to the thermal expansion and refractive-index coefficients of the optics (> 10(-5) K-1 for glass). By cascade-coupling an array of sensors, the ensemble-averaged angular velocity is measured in "real-time". This will reduce the influence of pseudo-vibrations arising from...
Olivares, Alberto; Górriz, J M; Ramírez, J; Olivares, G
2016-05-01
With the advent of miniaturized inertial sensors many systems have been developed within the last decade to study and analyze human motion and posture, specially in the medical field. Data measured by the sensors are usually processed by algorithms based on Kalman Filters in order to estimate the orientation of the body parts under study. These filters traditionally include fixed parameters, such as the process and observation noise variances, whose value has large influence in the overall performance. It has been demonstrated that the optimal value of these parameters differs considerably for different motion intensities. Therefore, in this work, we show that, by applying frequency analysis to determine motion intensity, and varying the formerly fixed parameters accordingly, the overall precision of orientation estimation algorithms can be improved, therefore providing physicians with reliable objective data they can use in their daily practice.
Optimization of Filter by using Support Vector Regression Machine with Cuckoo Search Algorithm
Directory of Open Access Journals (Sweden)
M. İlarslan
2014-09-01
Full Text Available Herein, a new methodology using a 3D Electromagnetic (EM simulator-based Support Vector Regression Machine (SVRM models of base elements is presented for band-pass filter (BPF design. SVRM models of elements, which are as fast as analytical equations and as accurate as a 3D EM simulator, are employed in a simple and efficient Cuckoo Search Algorithm (CSA to optimize an ultra-wideband (UWB microstrip BPF. CSA performance is verified by comparing it with other Meta-Heuristics such as Genetic Algorithm (GA and Particle Swarm Optimization (PSO. As an example of the proposed design methodology, an UWB BPF that operates between the frequencies of 3.1 GHz and 10.6 GHz is designed, fabricated and measured. The simulation and measurement results indicate in conclusion the superior performance of this optimization methodology in terms of improved filter response characteristics like return loss, insertion loss, harmonic suppression and group delay.
Zielinski, B.; Patorski, K.
2010-06-01
The aim of this paper is to analyze 2D fringe pattern denoising performed by two chosen methods based on quasi-1D two-arm spin filter and 2D discrete wavelet transform (DWT) signal decomposition and thresholding. The ultimate aim of this comparison is to estimate which algorithm is better suited for high-accuracy measurements by phase shifting interferometry (PSI) with the phase step evaluation using the lattice site approach. The spin filtering method proposed by Yu et al. (1994) was designed to minimize possible fringe blur and distortion. The 2D DWT also presents such features due to a lossless nature of the signal wavelet decomposition. To compare both methods, a special 2D histogram introduced by Gutman and Weber (1998) is used to evaluate intensity errors introduced by each of the presented algorithms.
Infomax Algorithm for Filtering Airwaves in the Field of Seabed Logging
Directory of Open Access Journals (Sweden)
Adeel Ansari
2014-04-01
Full Text Available This research focuses on applying Independent Component Analysis (ICA in the field of Seabed Logging (SBL. ICA is a statistical method for transforming an observed multidimensional or multivariate dataset into its constituent components (sources that are statistically as independent from each other as possible. ICA-type de-convolution algorithm, Infomax is suitable for mixed signals de-convolution, is proposed and considered convenient depending upon the nature of the source and noise model, in the application of seabed logging. Infomax is applied in the domain of marine Controlled Source Electro Magnetic (CSEM sensing method used for the detection of hydrocarbons based reservoirs in seabed logging application. The task is to identify the air waves and to filter them out. The infomax algorithm of ICA is considered for filtering the airwaves.
Lim, Wei Jer; Neoh, Siew Chin; Norizan, Mohd Natashah; Mohamad, Ili Salwani
2015-05-01
Optimization for complex circuit design often requires large amount of manpower and computational resources. In order to optimize circuit performance, it is critical not only for circuit designers to adjust the component value but also to fulfill objectives such as gain, cutoff frequency, ripple and etc. This paper proposes Non-dominated Sorting Genetic Algorithm II (NSGA-II) to optimize a ninth order multiple feedback Chebyshev low pass filter. Multi-objective Pareto-Based optimization is involved whereby the research aims to obtain the best trade-off for minimizing the pass-band ripple, maximizing the output gain and achieving the targeted cut-off frequency. The developed NSGA-II algorithm is executed on the NGSPICE circuit simulator to assess the filter performance. Overall results show satisfactory in the achievements of the required design specifications.
Emulation of an ensemble Kalman filter algorithm on a flood wave propagation model
Barthélémy, S.; Ricci, S.; Pannekoucke, O.; Thual, O.; Malaterre, P.O.
2013-01-01
This study describes the emulation of an Ensemble Kalman Filter (EnKF) algorithm on a 1-D flood wave propagation model. This model is forced at the upstream boundary with a random variable with gaussian statistics and a correlation function in time with gaussian shape. This allows for, in the case without assimilation, the analytical study of the covariance functions of the propagated signal anomaly. This study is validated numerically wit...
Transfer alignment of shipborne inertial-guided weapon systems
Institute of Scientific and Technical Information of China (English)
Sun Changyue; Deng Zhenglong
2009-01-01
The transfer alignment problem of the shipborne weapon inertial navigation system (INS) is addressed. Specifically, two transfer alignment algorithms subjected to the ship motions induced by the waves are discussed. To consider the limited maneuver level performed by the ship, a new filter algorithm for transfer alignment methods using velocity and angular rate matching is first derived. And then an improved method using integrated velocity and integrated angular rate matching is introduced to reduce the effect of the ship body flexure. The simulation results show the feasibility and validity of the proposed transfer alignment algorithms.
Adaptive filter design based on the LMS algorithm for delay elimination in TCR/FC compensators.
Hooshmand, Rahmat Allah; Torabian Esfahani, Mahdi
2011-04-01
Thyristor controlled reactor with fixed capacitor (TCR/FC) compensators have the capability of compensating reactive power and improving power quality phenomena. Delay in the response of such compensators degrades their performance. In this paper, a new method based on adaptive filters (AF) is proposed in order to eliminate delay and increase the response of the TCR compensator. The algorithm designed for the adaptive filters is performed based on the least mean square (LMS) algorithm. In this design, instead of fixed capacitors, band-pass LC filters are used. To evaluate the filter, a TCR/FC compensator was used for nonlinear and time varying loads of electric arc furnaces (EAFs). These loads caused occurrence of power quality phenomena in the supplying system, such as voltage fluctuation and flicker, odd and even harmonics and unbalancing in voltage and current. The above design was implemented in a realistic system model of a steel complex. The simulation results show that applying the proposed control in the TCR/FC compensator efficiently eliminated delay in the response and improved the performance of the compensator in the power system.
[Research of adaptive notch filter based on QRD-LS algorithm for power line interference in ECG].
Wang, Shuyan; Dong, Jian; Guan, Xin
2008-10-01
In this paper, an adaptive notch filter based on QRD-LS algorithm for power line interference in ECG is researched. It can automatically eliminate the power line interference in order to improve the signal-to-interference ratio. Furthermore, QLD-LS algorithm, which is recursive least-squares minimization using systolic arrays, is employed to adjust the weight vector. Compared with the adaptive notch filter based on LMS (least mean square) algorithm, it has good robustness. Simulation examples confirm the results. QRD-LS adaptive notch filter has better performance in comparison with LMS method.
Application of the Trend Filtering Algorithm for Photometric Time Series Data
Gopalan, Giri; Plavchan, Peter; van Eyken, Julian; Ciardi, David; von Braun, Kaspar; Kane, Stephen R.
2016-08-01
Detecting transient light curves (e.g., transiting planets) requires high-precision data, and thus it is important to effectively filter systematic trends affecting ground-based wide-field surveys. We apply an implementation of the Trend Filtering Algorithm (TFA) to the 2MASS calibration catalog and select Palomar Transient Factory (PTF) photometric time series data. TFA is successful at reducing the overall dispersion of light curves, however, it may over-filter intrinsic variables and increase “instantaneous” dispersion when a template set is not judiciously chosen. In an attempt to rectify these issues we modify the original TFA from the literature by including measurement uncertainties in its computation, including ancillary data correlated with noise, and algorithmically selecting a template set using clustering algorithms as suggested by various authors. This approach may be particularly useful for appropriately accounting for variable photometric precision surveys and/or combined data sets. In summary, our contributions are to provide a MATLAB software implementation of TFA and a number of modifications tested on synthetics and real data, summarize the performance of TFA and various modifications on real ground-based data sets (2MASS and PTF), and assess the efficacy of TFA and modifications using synthetic light curve tests consisting of transiting and sinusoidal variables. While the transiting variables test indicates that these modifications confer no advantage to transit detection, the sinusoidal variables test indicates potential improvements in detection accuracy.
Near-lossless compression algorithm for Bayer pattern color filter arrays
Bazhyna, Andriy; Gotchev, Atanas; Egiazarian, Karen
2005-02-01
In this contribution, we propose a near-lossless compression algorithm for Color Filter Arrays (CFA) images. It allows higher compression ratio than any strictly lossless algorithm for the price of some small and controllable error. In our approach a structural transformation is applied first in order to pack the pixels of the same color in a structure appropriate for the subsequent compression algorithm. The transformed data is compressed by a modified version of the JPEG-LS algorithm. A nonlinear and adaptive error quantization function is embedded in the JPEG-LS algorithm after the fixed and context adaptive predictors. It is step-like and adapts to the base signal level in such a manner that higher error values are allowed for lighter parts with no visual quality loss. These higher error values are then suppressed by gamma correction applied during the image reconstruction stage. The algorithm can be adjusted for arbitrary pixel resolution, gamma value and allowable error range. The compression performance of the proposed algorithm has been tested for real CFA raw data. The results are presented in terms of compression ratio versus reconstruction error and the visual quality of the reconstructed images is demonstrated as well.
Ensemble-Type Kalman Filter Algorithm conserving mass, total energy and enstrophy
Zeng, Yuefei; Janjic, Tijana; Ruckstuhl, Yvonne; Verlaan, Martin
2017-04-01
In a recent study (Zeng and Janjic 2016), we explored the effect on conservation properties of data assimilation using perfect model experiments with a 2D shallow water model preserving important properties of the true nonlinear flow. It was found that during the assimilation with the ensemble Kalman filter algorithm, the total energy of the analysis ensemble mean converges towards the nature run value with time. However, the enstrophy, divergence and energy spectra were strongly affected by the data assimilation settings. We tested the effects on the prediction depending on the type of error in the initial condition and showed that the accumulated noise during assimilation and the error of analysis are good indicators of the quality of the prediction. Having in mind that the conservation of both the kinetic energy and enstrophy by momentum advection schemes in the case of non-divergent flow prevents a systematic and unrealistic energy cascade towards the high wave numbers, we constructed the ensemble data assimilation algorithm that conserves both energy and enstrophy. This is done by extending QPEns (Janjic et al. 2014) to allow for nonlinear constraints using, instead of quadratic programming, the sequential quadratic programming algorithm. Experiments with the 2D shallow water model show similar RMSEs of the algorithm without constraints and the algorithm with only the total energy constrained. The algorithm which constraints enstrophy as well as energy and enstrophy during data assimilation showed smaller RMSE to the one without the constraint on enstrophy. Similar behavior can be seen in the energy spectrum where algorithms which include the constraint on enstrophy are closer to the true spectrum, in particular for wavelengths between 200 km and 1000 km. The enstrophy constraint resulted in a reduction of noise during data assimilation. Finally, the algorithm, with both energy and enstrophy constraint showed the smallest error growth during the two weeks
Conservation of Mass and Preservation of Positivity with Ensemble-Type Kalman Filter Algorithms
Janjic, Tijana; Mclaughlin, Dennis; Cohn, Stephen E.; Verlaan, Martin
2014-01-01
This paper considers the incorporation of constraints to enforce physically based conservation laws in the ensemble Kalman filter. In particular, constraints are used to ensure that the ensemble members and the ensemble mean conserve mass and remain nonnegative through measurement updates. In certain situations filtering algorithms such as the ensemble Kalman filter (EnKF) and ensemble transform Kalman filter (ETKF) yield updated ensembles that conserve mass but are negative, even though the actual states must be nonnegative. In such situations if negative values are set to zero, or a log transform is introduced, the total mass will not be conserved. In this study, mass and positivity are both preserved by formulating the filter update as a set of quadratic programming problems that incorporate non-negativity constraints. Simple numerical experiments indicate that this approach can have a significant positive impact on the posterior ensemble distribution, giving results that are more physically plausible both for individual ensemble members and for the ensemble mean. In two examples, an update that includes a non-negativity constraint is able to properly describe the transport of a sharp feature (e.g., a triangle or cone). A number of implementation questions still need to be addressed, particularly the need to develop a computationally efficient quadratic programming update for large ensemble.
Low-cost attitude determination system using an extended Kalman filter (EKF) algorithm
Esteves, Fernando M.; Nehmetallah, Georges; Abot, Jandro L.
2016-05-01
Attitude determination is one of the most important subsystems in spacecraft, satellite, or scientific balloon mission s, since it can be combined with actuators to provide rate stabilization and pointing accuracy for payloads. In this paper, a low-cost attitude determination system with a precision in the order of arc-seconds that uses low-cost commercial sensors is presented including a set of uncorrelated MEMS gyroscopes, two clinometers, and a magnetometer in a hierarchical manner. The faster and less precise sensors are updated by the slower, but more precise ones through an Extended Kalman Filter (EKF)-based data fusion algorithm. A revision of the EKF algorithm fundamentals and its implementation to the current application, are presented along with an analysis of sensors noise. Finally, the results from the data fusion algorithm implementation are discussed in detail.
An Image Filter Based on Shearlet Transformation and Particle Swarm Optimization Algorithm
Directory of Open Access Journals (Sweden)
Kai Hu
2015-01-01
Full Text Available Digital image is always polluted by noise and made data postprocessing difficult. To remove noise and preserve detail of image as much as possible, this paper proposed image filter algorithm which combined the merits of Shearlet transformation and particle swarm optimization (PSO algorithm. Firstly, we use classical Shearlet transform to decompose noised image into many subwavelets under multiscale and multiorientation. Secondly, we gave weighted factor to those subwavelets obtained. Then, using classical Shearlet inverse transform, we obtained a composite image which is composed of those weighted subwavelets. After that, we designed fast and rough evaluation method to evaluate noise level of the new image; by using this method as fitness, we adopted PSO to find the optimal weighted factor we added; after lots of iterations, by the optimal factors and Shearlet inverse transform, we got the best denoised image. Experimental results have shown that proposed algorithm eliminates noise effectively and yields good peak signal noise ratio (PSNR.
An optimal algorithm based on extended kalman filter and the data fusion for infrared touch overlay
Zhou, AiGuo; Cheng, ShuYi; Pan, Qiang Biao; Sun, Dong Yu
2016-01-01
Current infrared touch overlay has problems on the touch point recognition which bring some burrs on the touch trajectory. This paper uses the target tracking algorithm to improve the recognition and smoothness of infrared touch overlay. In order to deal with the nonlinear state estimate problem for touch point tracking, we use the extended Kalman filter in the target tracking algorithm. And we also use the data fusion algorithm to match the estimate value with the original target trajectory. The experimental results of the infrared touch overlay demonstrate that the proposed target tracking approach can improve the touch point recognition of the infrared touch overlay and achieve much smoother tracking trajectory than the existing tracking approach.
Novel Algorithm for Active Noise Control Systems Based on Frequency Selective Filters
Institute of Scientific and Technical Information of China (English)
Hong-liang ZHAO
2010-01-01
A novel algorithm for active noise control systems based on frequency selective filters (FSFANC)is presented in the paper.The FSFANC aims at the m lti-tonal noise attenuation problem.One FSFANC system copes with one of the tonal components,and several FSFANC systems can nun independently in parallel to cancel the selected multiple tones.The proposed algorithm adopts a simple structrue with only two coefficients that can be explained as the real and imaginary parts of the structure to modelthesecondary path,and estimates the secondary path by injecting sinusoidal identification signals.Theoretical analysis and laboratory experiments show that the proposed algorithm possesses some advantages,such as simpler stricture,less computational burden,greater stability,and fast canverging speed.
Directory of Open Access Journals (Sweden)
Chonghuan Xu
2013-01-01
Full Text Available With the rapid development of customer relationship management, more and more user recommendation technologies are used to enhance the customer satisfaction. Although there are many good recommendation algorithms, it is still a challenge to increase the accuracy and diversity of these algorithms to fulfill users’ preferences. In this paper, we construct a user recommendation model containing a new method to compute the similarities among users on bipartite networks. Different from other standard similarities, we consider the influence of each object node including popular degree, preference degree, and trust relationship. Substituting these new definitions of similarity for the standard cosine similarity, we propose a modified collaborative filtering algorithm based on multifactors (CF-M. Detailed experimental analysis on two benchmark datasets shows that the CF-M is of high accuracy and also generates more diversity.
SimpLiFiCPM: A Simple and Lightweight Filter-Based Algorithm for Circular Pattern Matching.
Azim, Md Aashikur Rahman; Iliopoulos, Costas S; Rahman, M Sohel; Samiruzzaman, M
2015-01-01
This paper deals with the circular pattern matching (CPM) problem, which appears as an interesting problem in many biological contexts. CPM consists in finding all occurrences of the rotations of a pattern of length m in a text of length n. In this paper, we present SimpLiFiCPM (pronounced "Simplify CPM"), a simple and lightweight filter-based algorithm to solve the problem. We compare our algorithm with the state-of-the-art algorithms and the results are found to be excellent. Much of the speed of our algorithm comes from the fact that our filters are effective but extremely simple and lightweight.
Peña, M.
2016-10-01
Achieving acceptable signal-to-noise ratio (SNR) can be difficult when working in sparsely populated waters and/or when species have low scattering such as fluid filled animals. The increasing use of higher frequencies and the study of deeper depths in fisheries acoustics, as well as the use of commercial vessels, is raising the need to employ good denoising algorithms. The use of a lower Sv threshold to remove noise or unwanted targets is not suitable in many cases and increases the relative background noise component in the echogram, demanding more effectiveness from denoising algorithms. The Adaptive Wiener Filter (AWF) denoising algorithm is presented in this study. The technique is based on the AWF commonly used in digital photography and video enhancement. The algorithm firstly increments the quality of the data with a variance-dependent smoothing, before estimating the noise level as the envelope of the Sv minima. The AWF denoising algorithm outperforms existing algorithms in the presence of gaussian, speckle and salt & pepper noise, although impulse noise needs to be previously removed. Cleaned echograms present homogenous echotraces with outlined edges.
Harmonic regression based multi-temporal cloud filtering algorithm for Landsat 8
Joshi, P.
2015-12-01
Landsat data archive though rich is seen to have missing dates and periods owing to the weather irregularities and inconsistent coverage. The satellite images are further subject to cloud cover effects resulting in erroneous analysis and observations of ground features. In earlier studies the change detection algorithm using statistical control charts on harmonic residuals of multi-temporal Landsat 5 data have been shown to detect few prominent remnant clouds [Brooks, Evan B., et al, 2014]. So, in this work we build on this harmonic regression approach to detect and filter clouds using a multi-temporal series of Landsat 8 images. Firstly, we compute the harmonic coefficients using the fitting models on annual training data. This time series of residuals is further subjected to Shewhart X-bar control charts which signal the deviations of cloud points from the fitted multi-temporal fourier curve. For the process with standard deviation σ we found the second and third order harmonic regression with a x-bar chart control limit [Lσ] ranging between [0.5σ HOT), and utilizing the seasonal physical properties of these parameters, we have designed a novel multi-temporal algorithm for filtering clouds from Landsat 8 images. The method is applied to Virginia and Alabama in Landsat8 UTM zones 17 and 16 respectively. Our algorithm efficiently filters all types of cloud cover with an overall accuracy greater than 90%. As a result of the multi-temporal operation and the ability to recreate the multi-temporal database of images using only the coefficients of the fourier regression, our algorithm is largely storage and time efficient. The results show a good potential for this multi-temporal approach for cloud detection as a timely and targeted solution for the Landsat 8 research community, catering to the need for innovative processing solutions in the infant stage of the satellite.
Genetic Algorithm-Based Design of the Active Damping for an LCL-Filter Three-Phase Active Rectifier
DEFF Research Database (Denmark)
Liserre, Marco; Aquila, Antonio Dell; Blaabjerg, Frede
2004-01-01
of this filter is easily done, for a wide range of sampling frequencies, with the use of genetic algorithms. This method is used only for the optimum choice of the parameters in the filter, and an on-line implementation is not needed. Thus the resulting active damping solution does not need new sensors...
Quaternion-Based Kalman Filter for AHRS Using an Adaptive-Step Gradient Descent Algorithm
Directory of Open Access Journals (Sweden)
Li Wang
2015-09-01
Full Text Available This paper presents a quaternion-based Kalman filter for real-time estimation of the orientation of a quadrotor. Quaternions are used to represent rotation relationship between navigation frame and body frame. Processing of a 3-axis accelerometer using Adaptive-Step Gradient Descent (ASGD produces a computed quaternion input to the Kalman filter. The step-size in GD is set in direct proportion to the physical orientation rate. Kalman filter combines 3-axis gyroscope and computed quaternion to determine pitch and roll angles. This combination overcomes linearization error of the measurement equations and reduces the calculation cost. 3-axis magnetometer is separated from ASGD to independently calculate yaw angle for Attitude Heading Reference System (AHRS. This AHRS algorithm is able to remove the magnetic distortion impact. Experiments are carried out in the small-size flight controller and the real world flying test shows the proposed AHRS algorithm is adequate for the real-time estimation of the orientation of a quadrotor.
A Novel Image Segmentation Algorithm Based on Neutrosophic Filtering and Level Set
Directory of Open Access Journals (Sweden)
Yanhui Guo
2016-03-01
Full Text Available Image segmentation is an important step in image processing and analysis, pattern recognition, and machine vision. A few of algorithms based on level set have been proposed for image segmentation in the last twenty years. However, these methods are time consuming, and sometime fail to extract the correct regions especially for noisy images. Recently, neutrosophic set (NS theory has been applied to image processing for noisy images with indeterminant information. In this paper, a novel image segmentation approach is proposed based on the filter in NS and level set theory. At first, the image is transformed into NS domain, which is described by three membership sets (T, I and F. Then, a filter is newly defined and employed to reduce the indeterminacy of the image. Finally, a level set algorithm is used in the image after filtering operation for image segmentation. Experiments have been conducted using different images. The results demonstrate that the proposed method can segment the images effectively and accurately. It is especially able to remove the noise effect and extract the correct regions on both the noise-free images and the images with different levels of noise.
Analysis of Naïve Bayes Algorithm for Email Spam Filtering across Multiple Datasets
Fitriah Rusland, Nurul; Wahid, Norfaradilla; Kasim, Shahreen; Hafit, Hanayanti
2017-08-01
E-mail spam continues to become a problem on the Internet. Spammed e-mail may contain many copies of the same message, commercial advertisement or other irrelevant posts like pornographic content. In previous research, different filtering techniques are used to detect these e-mails such as using Random Forest, Naïve Bayesian, Support Vector Machine (SVM) and Neutral Network. In this research, we test Naïve Bayes algorithm for e-mail spam filtering on two datasets and test its performance, i.e., Spam Data and SPAMBASE datasets [8]. The performance of the datasets is evaluated based on their accuracy, recall, precision and F-measure. Our research use WEKA tool for the evaluation of Naïve Bayes algorithm for e-mail spam filtering on both datasets. The result shows that the type of email and the number of instances of the dataset has an influence towards the performance of Naïve Bayes.
Ge, Shuang-Chao; Deng, Ming; Chen, Kai; Li, Bin; Li, Yuan
2016-12-01
Time-domain induced polarization (TDIP) measurement is seriously affected by power line interference and other field noise. Moreover, existing TDIP instruments generally output only the apparent chargeability, without providing complete secondary field information. To increase the robustness of TDIP method against interference and obtain more detailed secondary field information, an improved dataprocessing algorithm is proposed here. This method includes an efficient digital notch filter which can effectively eliminate all the main components of the power line interference. Hardware model of this filter was constructed and Vhsic Hardware Description Language code for it was generated using Digital Signal Processor Builder. In addition, a time-location method was proposed to extract secondary field information in case of unexpected data loss or failure of the synchronous technologies. Finally, the validity and accuracy of the method and the notch filter were verified by using the Cole-Cole model implemented by SIMULINK software. Moreover, indoor and field tests confirmed the application effect of the algorithm in the fieldwork.
Adaptive system noise covariance for performance enhancement of Kalman filter-based algorithms
Lee, Vika; Chan, Keith C. C.; Leung, Henry
1996-06-01
Several designs of Kalman filters and the interacting multiple models algorithm were used in real tracking tasks involving high dynamic targets. The data were obtained through the joint effort of the defense departments of Canada and the US. Their performance, measured in terms of positional deviation and the number of track losses, are rather unsatisfactory even though they perform particularly well when using simulated data. To identify the reasons behind, we compared and analyzed the differences between the model assumptions behind the design of these Kalman filters and the model required for accurate tracking of these targets. In this paper, we discussed our findings. Moreover, based on the characteristics of real tracking data, we present an alternative methodology for measuring the effectiveness of various Kalman filter based trackers in stressful environmental. It can also be used to explain the well known characteristics of Kalman filter. A lower bound for the deviation, obtained from this equation, shows that deviation could be too large to manage if noise bandwidth is as high as the real data instead of a pre-assumed magnitude. Instead of having to redesign many existing Kalman filters to suit for stressful environment, we developed a design-independent module that can be added to different types of Kalman filters based trackers to enhance their performance in the tracking high dynamic targets. The module is called adaptive systems noise covariance estimation. It is not only safe (i.e. almost no negative effect) but it can sometimes even double the performance of trackers in stressful environment.
Liu, Qianshun; Liu, Yan; Yu, Feihong
2013-08-01
As a kind of film device, band-pass filter is widely used in pattern recognition, infrared detection, optical fiber communication, etc. In this paper, an algorithm for automatic measurement of band-pass filter quality criterion is proposed based on the proven theory calculation of derivate spectral transmittance of filter formula. Firstly, wavelet transform to reduce spectrum data noises is used. Secondly, combining with the Gaussian curve fitting and least squares method, the algorithm fits spectrum curve and searches the peak. Finally, some parameters for judging band-pass filter quality are figure out. Based on the algorithm, a pipeline for band-pass filters automatic measurement system has been designed that can scan the filter array automatically and display spectral transmittance of each filter. At the same time, the system compares the measuring result with the user defined standards to determine if the filter is qualified or not. The qualified product will be market with green color, and the unqualified product will be marked with red color. With the experiments verification, the automatic measurement system basically realized comprehensive, accurate and rapid measurement of band-pass filter quality and achieved the expected results.
A robust SEM auto-focus algorithm using multiple band-pass filters
Harada, Minoru; Obara, Kenji; Nakamae, Koji
2017-01-01
An auto-focus algorithm using multiple band-pass filters for a scanning electron microscope (SEM) is proposed. To acquire sharp images of various kinds of defects by SEM defect observation in semiconductor manufacturing, the auto-focus process must be robust. A method for designing a band-pass filter for calculating the ‘focus measure’ (a key parameter of the auto-focus process) is proposed. To achieve an optimal specific frequency response for various images, multiple band-pass filters are introduced. As for the proposed method, two series of focus measures are calculated by using multiple band-pass filters independently, and it is selected according to reliability of the series of focus measures. The signal-to-noise ratio of an image for acceptable auto-focus precision is determined by simulation using pseudo images. In an experiment using the proposed method with real images, the success rate of auto focus is improved from 79.4% to 95.6%.
An Efficient Data Fingerprint Query Algorithm Based on Two-Leveled Bloom Filter
Directory of Open Access Journals (Sweden)
Bin Zhou
2013-04-01
Full Text Available The function of the comparing fingerprints algorithm was to judge whether a new partitioned data chunk was in a storage system a decade ago. At present, in the most de-duplication backup system the fingerprints of the big data chunks are huge and cannot be stored in the memory completely. The performance of the system is unavoidably retarded by data chunks accessing the storage system at the querying stage. Accordingly, a new query mechanism namely Two-stage Bloom Filter (TBF mechanism is proposed. Firstly, as a representation of the entirety for the first grade bloom filter, each bit of the second grade bloom filter in the TBF represents the chunks having the identical fingerprints reducing the rate of false positives. Secondly, a two-dimensional list is built corresponding to the two grade bloom filter for the absolute addresses of the data chunks with the identical fingerprints. Finally, a new hash function class with the strong global random characteristic is set up according to the data fingerprints’ random characteristics. To reduce the comparing data greatly, TBF decreases the number of accessing disks, improves the speed of detecting the redundant data chunks, and reduces the rate of false positives which helps the improvement of the overall performance of system.
A Fault-Tolerant Filtering Algorithm for SINS/DVL/MCP Integrated Navigation System
Directory of Open Access Journals (Sweden)
Xiaosu Xu
2015-01-01
Full Text Available The Kalman filter (KF, which recursively generates a relatively optimal estimate of underlying system state based upon a series of observed measurements, has been widely used in integrated navigation system. Due to its dependence on the accuracy of system model and reliability of observation data, the precision of KF will degrade or even diverge, when using inaccurate model or trustless data set. In this paper, a fault-tolerant adaptive Kalman filter (FTAKF algorithm for the integrated navigation system composed of a strapdown inertial navigation system (SINS, a Doppler velocity log (DVL, and a magnetic compass (MCP is proposed. The evolutionary artificial neural networks (EANN are used in self-learning and training of the intelligent data fusion algorithm. The proposed algorithm can significantly outperform the traditional KF in providing estimation continuously with higher accuracy and smoothing the KF outputs when observation data are inaccurate or unavailable for a short period. The experiments of the prototype verify the effectiveness of the proposed method.
Directory of Open Access Journals (Sweden)
Wentao Yu
2013-01-01
high. In order to reduce the computation cost of UPF and meanwhile maintain the accuracy, we propose an adaptive unscented particle filter (AUPF algorithm through relative entropy. AUPF can adaptively adjust the number of particles during filtering to reduce the necessary computation and hence improve the real-time capability of UPF. In AUPF, the relative entropy is used to measure the distance between the empirical distribution and the true posterior distribution. The least number of particles for the next step is then decided according to the relative entropy. In order to offset the difference between the proposal distribution, and the true distribution the least number is adjusted thereafter. The ideal performance of AUPF in real robot self-localization is demonstrated.
Research on the filtering algorithm in speed and position detection of maglev trains.
Dai, Chunhui; Long, Zhiqiang; Xie, Yunde; Xue, Song
2011-01-01
This paper introduces in brief the traction system of a permanent magnet electrodynamic suspension (EDS) train. The synchronous traction mode based on long stators and track cable is described. A speed and position detection system is recommended. It is installed on board and is used as the feedback end. Restricted by the maglev train's structure, the permanent magnet electrodynamic suspension (EDS) train uses the non-contact method to detect its position. Because of the shake and the track joints, the position signal sent by the position sensor is always aberrant and noisy. To solve this problem, a linear discrete track-differentiator filtering algorithm is proposed. The filtering characters of the track-differentiator (TD) and track-differentiator group are analyzed. The four series of TD are used in the signal processing unit. The result shows that the track-differentiator could have a good effect and make the traction system run normally.
Research on the Filtering Algorithm in Speed and Position Detection of Maglev Trains
Directory of Open Access Journals (Sweden)
Chunhui Dai
2011-07-01
Full Text Available This paper introduces in brief the traction system of a permanent magnet electrodynamic suspension (EDS train. The synchronous traction mode based on long stators and track cable is described. A speed and position detection system is recommended. It is installed on board and is used as the feedback end. Restricted by the maglev train’s structure, the permanent magnet electrodynamic suspension (EDS train uses the non-contact method to detect its position. Because of the shake and the track joints, the position signal sent by the position sensor is always aberrant and noisy. To solve this problem, a linear discrete track-differentiator filtering algorithm is proposed. The filtering characters of the track-differentiator (TD and track-differentiator group are analyzed. The four series of TD are used in the signal processing unit. The result shows that the track-differentiator could have a good effect and make the traction system run normally.
Katyal, Vini
2012-01-01
This paper focuses on fruit defect detection and glare removal using morphological operations, Glare removal can be considered as an important preprocessing step as uneven lighting may introduce it in images, which hamper the results produced through segmentation by Gabor filters .The problem of glare in images is very pronounced sometimes due to the unusual reflectance from the camera sensor or stray light entering, this method counteracts this problem and makes the defect detection much more pronounced. Anisotropic diffusion is used for further smoothening of the images and removing the high energy regions in an image for better defect detection and makes the defects more retrievable. Our algorithm is robust and scalable the employability of a particular mask for glare removal has been checked and proved useful for counteracting.this problem, anisotropic diffusion further enhances the defects with its use further Optimal Gabor filter at various orientations is used for defect detection.
Optimal Filtering Algorithm-Based Multiuser Detector for Fast Fading CDMA Systems
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
A multiuser detector was developed for fast fading code-division multiple-access systems by representing the channels as a system with the multiplicative noise (SMN) model and then using the known optimal filtering algorithm for the SMN for multiuser detection (MUD). This multiuser detector allows the channel response to be stochastic in one symbol duration, which can be regarded as an effective method of MUD for fast fading CDMA systems. Performance analyses show that the multiuser detector is theoretically valid for CDMA systems over fast fading channels. Simulations show that the multiuser detector performs better than the Kalman filter-based multiuser detector with a faster convergence rate and lower bit error rate.
一种新的局部空间排列算法%A New Local Space Alignment Algorithm
Institute of Scientific and Technical Information of China (English)
刘胜蓝; 冯林; 金博; 吴振宇
2013-01-01
Recently,manifold learning has been widely exploited in pattern recognition and data mining.Local tangent space alignment (LTSA) is a classical non-linear manifold learning method,which is efficient for non-linear dimensionality reduction.However,it fails to learn locally high curvature dataset.To address this problem,this paper describes the data set of the locally curvature by the given parameter and presents a new algorithm called locally minimal deviation space alignment (LMDSA).Considering the low-robust deficiencies in local tangent space,LMDSA can find the locally high curvature while computing locally minimal deviation spaces.The algorithm also reduces the probability of locally high curvature space with parameter control and the joint information between neighborhood information.Then the algorithm applies space alignment technique to reduce dimensionality.Besides the advantages above,LMDSA has the ability to learn sparse dataset.Extensive experiments on both synthetic manifold and real-world images indicate the efficiency of our algorithm.In synthetic manifold,LMDSA is compared with LTSA in two local high curvature datasets and one dataset with a hole.The experimental results show our algorithm learns correct manifold structure in low-dimension space.In sparse real-world datasets,LMDSA outperforms other algorithms in this paper.%局部切空间排列算法(local tangent space alignment,LTSA)是一种经典的非线性流形学习方法,能够有效地对非线性分布数据进行降维,但它无法学习局部高曲率数据集.针对此问题,给出了描述数据集局部曲率的参数,并提出一种局部最小偏差空间排列(locally minimal deviation spacealignment,LMDSA)算法.该算法考虑到局部切空间低鲁棒性的缺陷,在计算局部最小偏差空间的同时,能够发现数据的局部高曲率现象,通过参数控制及邻域间的连接信息,减少计算局部高曲率空间的可能,进而利用空间排列技术进行降
Filter Bank Common Spatial Pattern algorithm on BCI Competition IV Datasets 2a and 2b
Directory of Open Access Journals (Sweden)
Kai Keng eAng
2012-03-01
Full Text Available The Common Spatial Pattern (CSP algorithm is an effective and popular method for classifying 2-class motor imagery electroencephalogram (EEG data, but its effectiveness depends on the subject-specific frequency band. This paper presents the Filter Bank Common Spatial Pattern (FBCSP algorithm to optimize the subject-specific frequency band for CSP on Datasets 2a and 2b of the Brain-Computer Interface (BCI Competition IV. Dataset 2a comprised 4 classes of 22 channels EEG data from 9 subjects, and Dataset 2b comprised 2 classes of 3 bipolar channels EEG data from 9 subjects. Multi-class extensions to FBCSP are also presented to handle the 4-class EEG data in Dataset 2a, namely, Divide-and-Conquer (DC, Pair-Wise (PW, and One-Versus-Rest (OVR approaches. Two feature selection algorithms are also presented to select discriminative CSP features on Dataset 2b, namely, the Mutual Information-based Best Individual Feature (MIBIF algorithm, and the Mutual Information-based Rough Set Reduction (MIRSR algorithm. The single-trial classification accuracies were presented using 10x10-fold cross-validations on the training data and session-to-session transfer on the evaluation data from both datasets. Disclosure of the test data labels after the BCI Competition IV showed that the FBCSP algorithm performed relatively the best among the other submitted algorithms and yielded a mean kappa value of 0.569 and 0.600 across all subjects in Datasets 2a and 2b respectively.
Filter Bank Common Spatial Pattern Algorithm on BCI Competition IV Datasets 2a and 2b.
Ang, Kai Keng; Chin, Zheng Yang; Wang, Chuanchu; Guan, Cuntai; Zhang, Haihong
2012-01-01
The Common Spatial Pattern (CSP) algorithm is an effective and popular method for classifying 2-class motor imagery electroencephalogram (EEG) data, but its effectiveness depends on the subject-specific frequency band. This paper presents the Filter Bank Common Spatial Pattern (FBCSP) algorithm to optimize the subject-specific frequency band for CSP on Datasets 2a and 2b of the Brain-Computer Interface (BCI) Competition IV. Dataset 2a comprised 4 classes of 22 channels EEG data from 9 subjects, and Dataset 2b comprised 2 classes of 3 bipolar channels EEG data from 9 subjects. Multi-class extensions to FBCSP are also presented to handle the 4-class EEG data in Dataset 2a, namely, Divide-and-Conquer (DC), Pair-Wise (PW), and One-Versus-Rest (OVR) approaches. Two feature selection algorithms are also presented to select discriminative CSP features on Dataset 2b, namely, the Mutual Information-based Best Individual Feature (MIBIF) algorithm, and the Mutual Information-based Rough Set Reduction (MIRSR) algorithm. The single-trial classification accuracies were presented using 10 × 10-fold cross-validations on the training data and session-to-session transfer on the evaluation data from both datasets. Disclosure of the test data labels after the BCI Competition IV showed that the FBCSP algorithm performed relatively the best among the other submitted algorithms and yielded a mean kappa value of 0.569 and 0.600 across all subjects in Datasets 2a and 2b respectively.
Kim, Ho-Wuk; Park, Hong-Sug; Lee, Sang-Kwon; Shin, Kihong
2011-01-01
This paper presents a new adaptive algorithm for active noise control (ANC) that can be effectively applicable to a short acoustic duct, such as the intake system of an automobile engine, where the stability and fast convergence of the ANC system is particularly important. The new algorithm, called the modified-filtered-u LMS algorithm (MFU-LMS), is developed based on the recursive filtered-u LMS algorithm (FU-LMS) incorporating the simple hyper-stable adaptive recursive filter (SHARF) to ensure the control stability and the variable step size to enhance the convergence rate. The MFU-LMS algorithm is implemented by purely experimental ways, and is applied to active control of noise in a short acoustic duct, and is validated using two experimental cases of which the primary noise sources are a sinusoidal signal embedded in white noise and a chirp signal. The experimental results demonstrate that the proposed MFU-LMS algorithm gives a considerably better performance than other conventional algorithms, such as the filtered-x LMS (FX-LMS) and the FU-LMS algorithms.
DEFF Research Database (Denmark)
Nadernejad, Ehsan; Sharifzadeh, Sara
2013-01-01
In this paper, a new pixon-based method is presented for image segmentation. In the proposed algorithm, bilateral filtering is used as a kernel function to form a pixonal image. Using this filter reduces the noise and smoothes the image slightly. By using this pixon-based method, the image over s...... the hierarchical clustering method (Fuzzy C-means algorithm). The experimental results show that the proposed pixon-based approach has a reduced computational load and a better accuracy compared to the other existing pixon-based image segmentation techniques.......In this paper, a new pixon-based method is presented for image segmentation. In the proposed algorithm, bilateral filtering is used as a kernel function to form a pixonal image. Using this filter reduces the noise and smoothes the image slightly. By using this pixon-based method, the image over...
Directory of Open Access Journals (Sweden)
Apoorva Aggarwal
2015-12-01
Full Text Available In this paper, an optimal design of linear phase digital finite impulse response (FIR highpass (HP filter using the L1-norm based real-coded genetic algorithm (RCGA is investigated. A novel fitness function based on L1 norm is adopted to enhance the design accuracy. Optimized filter coefficients are obtained by defining the filter objective function in L1 sense using RCGA. Simulation analysis unveils that the performance of the RCGA adopting this fitness function is better in terms of signal attenuation ability of the filter, flatter passband and the convergence rate. Observations are made on the percentage improvement of this algorithm over the gradient-based L1 optimization approach on various factors by a large amount. It is concluded that RCGA leads to the best solution under specified parameters for the FIR filter design on account of slight unnoticeable higher transition width.
Artificial Fish Swarm Algorithm-Based Particle Filter for Li-Ion Battery Life Prediction
Directory of Open Access Journals (Sweden)
Ye Tian
2014-01-01
Full Text Available An intelligent online prognostic approach is proposed for predicting the remaining useful life (RUL of lithium-ion (Li-ion batteries based on artificial fish swarm algorithm (AFSA and particle filter (PF, which is an integrated approach combining model-based method with data-driven method. The parameters, used in the empirical model which is based on the capacity fade trends of Li-ion batteries, are identified dependent on the tracking ability of PF. AFSA-PF aims to improve the performance of the basic PF. By driving the prior particles to the domain with high likelihood, AFSA-PF allows global optimization, prevents particle degeneracy, thereby improving particle distribution and increasing prediction accuracy and algorithm convergence. Data provided by NASA are used to verify this approach and compare it with basic PF and regularized PF. AFSA-PF is shown to be more accurate and precise.
Analysis of Process Mining Model Using Frequentgroup Based Noise Filtering Algorithm
Directory of Open Access Journals (Sweden)
V. Priyadharshini
2014-02-01
Full Text Available Process mining is a process management system used to analyze business processes based on event logs. The knowledge is extracted from event logs by using knowledge retrieval techniques. The process mining algorithms are capable of automatically discover models to give details of all the events registered in some log traces provided as input. The theory of regions is a valuable tool in process discovery: it aims at learning a formal model (Petri nets from a set of traces. The main objective of this paper is to propose new concept Frequentgroup based noise filtering algorithm. The experiment is done based on standard bench mark dataset HELIX and RALIC datasets. The performance of the proposed system is better than existing method. Keywords:
Luo, Shouhua; Wu, Huazhen; Sun, Yi; Li, Jing; Li, Guang; Gu, Ning
2017-03-01
The beam hardening effect can induce strong artifacts in CT images, which result in severely deteriorated image quality with incorrect intensities (CT numbers). This paper develops an effective and efficient beam hardening correction algorithm incorporated in a filtered back-projection based maximum a posteriori (BHC-FMAP). In the proposed algorithm, the beam hardening effect is modeled and incorporated into the forward-projection of the MAP to suppress beam hardening induced artifacts, and the image update process is performed by Feldkamp–Davis–Kress method based back-projection to speed up the convergence. The proposed BHC-FMAP approach does not require information about the beam spectrum or the material properties, or any additional segmentation operation. The proposed method was qualitatively and quantitatively evaluated using both phantom and animal projection data. The experimental results demonstrate that the BHC-FMAP method can efficiently provide a good correction of beam hardening induced artefacts.
Institute of Scientific and Technical Information of China (English)
陈鸿跃; 孙谦; 刘宇航
2013-01-01
提出一种车载捷联惯导行进间对准方法。以里程计信息为辅助，将行进间对准过程分为粗对准和精对准，以惯性坐标系作为捷联惯导解算的参考基准并借助里程计信息进行粗对准，采用10状态Kalman滤波器进行精对准，观测量采用捷联惯导解算的速度与里程计解算得到的速度之差。进行仿真试验和实车试验，试验结果表明：该方法实现了行进间初始对准，兼容静基座及晃动基座初始对准，对行车路线及行进方式不做要求，捷联惯导在25 min内实现了和静基座对准相同的精度，对准精度与对准的时间正相关，对准时间越长对准精度越高。%A SINS alignment algorithm for marching vehicles was presented. Alignment process was parted into coarse alignment and precise alignment. Coarse alignment was achieved in the inertial coordinate system with the aid of distance-transfer-unit. Precise alignment was achieved through Kalman filter with ten states. Then the difference between the velocities obtained respectively from the inertial coordinate system and the DTU was observed. By simulation experiments and real vehicle tests, alignment for marching vehicles was realized both in the static and swaying base conditions. When driving route or mode is not limited, SINS achieved an alignment precision same as static base alignment in twenty-five minutes. Precision of alignment was positively relevant to the time of alignment. The longer the alignment took, the higher the precision was.
A Novel Pixon-Based Image Segmentation Process Using Fuzzy Filtering and Fuzzy C-mean Algorithm
DEFF Research Database (Denmark)
Nadernejad, Ehsan; Barari, Amin
2011-01-01
for image segmentation. The key idea is to create a pixon model by combining fuzzy filtering as a kernel function and a fuzzy c-means clustering algorithm for image segmentation. Use of fuzzy filters reduces noise and slightly smoothes the image. Use of the proposed pixon model prevented image over......Image segmentation, which is an important stage of many image processing algorithms, is the process of partitioning an image into nonintersecting regions, such that each region is homogeneous and the union of no two adjacent regions is homogeneous. This paper presents a novel pixon-based algorithm...
Xie, XianMing; Li, YingHui
2014-06-20
This paper presents an enhanced phase unwrapping algorithm by combining an unscented Kalman filter, an enhanced local phase gradient estimator based on an amended matrix pencil model, and a path-following strategy. This technology is able to accurately unwrap seriously noisy wrapped phase images by applying the unscented Kalman filter to simultaneously perform noise suppression and phase unwrapping along the path from the high-quality region to the low-quality region of the wrapped phase images. Results obtained with synthetic data and real data validate the effectiveness of the proposed method and show improved performance of this new algorithm with respect to some of the most used algorithms.
H-- Filtering Algorithms Case Study GPS-Based Satellite Orbit Determination
Kuang, Jinlu; Tan, Soonhie
In this paper the new Hfiltering algorithms for the design of navigation systems for autonomous LEO satellite is introduced. The nominal orbit (i.e., position and velocity) is computed by integrating the classical orbital differential equations of the LEO satellite by using the 7th-8th order Runge- Kutta algorithms. The perturbations due to the atmospheric drag force, the lunar-solar attraction and the solar radiation pressure are included together with the Earth gravity model (EGM-96). The spherical harmonic coefficients of the EGM-96 are considered up to 72 for the order and degree. By way of the MATLAB GPSoft software, the simulated pseudo ranges between the user LEO satellite and the visible GPS satellites are generated when given the appropriate angle of mask. The effects of the thermal noises, tropospheric refraction, ionospheric refraction, and multipath of the antenna are also compensated numerically in the simulated pseudo ranges. The dynamic Position-Velocity (PV) model is obtained by modeling the velocity as nearly constant being the white noise process. To further accommodate acceleration in the process model, the Position-Velocity-Acceleration (PVA) model is investigated by assuming the acceleration to be the Gaussian- Markov process. The state vector for the PV model becomes 8-dimensional (3-states for positions, 3-states for velocities, 1-state for range (clock) bias error, 1-state for range (clock) drift error). The state vector for the PV model becomes 11-dimensional with the addition of three more acceleration states. Three filtering approaches are used to smooth the orbit solution based upon the GPS pseudo range observables. The numerical simulation shows that the observed orbit root-mean-square errors of 60 meters by using the least squares adjustment method are improved to be less than 5 meters within 16 hours of tracking time by using the Hfiltering algorithms. The results are compared with the ones obtained by using the Extended Kalman
Directory of Open Access Journals (Sweden)
Chin-Sheng Chen
2016-05-01
Full Text Available This paper proposes a novel image alignment algorithm based on rotation-discriminating ring-shifted projection for automatic optical inspection. This new algorithm not only identifies the location of the template image within an inspection image but also provides precise rotation information during the template-matching process by using a novel rotation estimation scheme, the so-called ring-shifted technique. We use a two stage framework with an image pyramid searching technique for realizing the proposed image alignment algorithm; in the first stage, the similarity based on hybrid projection transformation with the image pyramid searching technique is employed for quick selection and location of the candidates in the inspection image. In the second stage, the rotation angle of the object is estimated by a novel ring-shifted technique. The estimation is performed only for the most likely candidate which is the one having the highest similarity in the first stage. The experimental results show that the proposed method provides accurate estimation for template matching with arbitrary rotations and is applicable in various environmental conditions.
一种流形仿射对齐算法%An algorithm for affine alignment of manifolds
Institute of Scientific and Technical Information of China (English)
徐雪; 周荷琴
2009-01-01
For the problem of finding and aligning the shared hidden structure of high-dimensional data sets,a semi-supervised algorithm for affine alignment of manifolds was presented.Un-matching points were used to improve the learning effect when the proportion of matching points was small.The extended spectral regression technique was applied,which made it possible for linear aligning algorithm to preserve the local geometry information of high-dimensional data.The experiments showed that the embedded manifolds could be successfully found and aligned when the proportion of matching points was small,and less cost was needed to project a new point.%研究了高维数据集中共享隐空间的寻找和对齐问题,提出了半监督的流形仿射对齐算法.未匹配点的局部分布信息被有效地利用起来,以改善在匹配点比例较低情况下的学习效果;扩展的谱回归技术的应用,使得线性对齐也能较好地保持高维数据的局部几何信息.实验表明该算法能够找出高维数据的相关性方向,并将其内部隐空间较好地对齐在一起,映射新点的开销也很小.
MRI Mammogram Image Segmentation using NCut method and Genetic Algorithm with partial filters
Directory of Open Access Journals (Sweden)
Pitchumani Angayarkanni
2011-01-01
Full Text Available Cancer is one of the most common leading deadly diseases which affect men and women around the world. Among the cancer diseases, breast cancer is especially a concern in women. It has become a major health problem in developed and developing countries over the past 50 years and the incidence has increased in recent years. Recent trends in digital image processing are CAD systems, which are computerized tools designed to assist radiologists. Most of these systems are used for automatic detection of abnormalities. However, recent studies have shown that their sensitivity is significantly decreased as the density of breast increases. In this paper , the proposed algorithm uses partial filters to enhance the images and the Ncut method is applied to segment the malignant and benign regions , further genetic algorithm is applied to identify the nipple position followed by bilateral subtraction of the left and the right breast image to cluster the cancerous and non cancerous regions. The system is trained using Back Propagation Neural Network algorithm. Computational efficiency and accuracy of the proposed system are evaluated based on the Frequency Receiver Operating Characteristic curve(FROC. The algorithm are tested on 161 pairs of digitized mammograms from MIAS database. The Receiver Operating Characteristic curve leads to 99.987% accuracy in detection of cancerous masses.
Simplified inverse filter tracking algorithm for estimating the mean trabecular bone spacing.
Huang, Kai; Ta, Dean; Wang, Weiqi; Le, L H
2008-07-01
Ultrasonic backscatter signals provide useful information relevant to bone tissue characterization. Trabecular bone microstructures have been considered as quasi-periodic tissues with a collection of regular and diffuse scatterers. This paper investigates the potential of a novel technique using a simplified inverse filter tracking (SIFT) algorithm to estimate mean trabecular bone spacing (MTBS) from ultrasonic backscatter signals. In contrast to other frequency-based methods, the SIFT algorithm is a time-based method and utilizes the amplitude and phase information of backscatter echoes, thus retaining the advantages of both the autocorrelation and the cepstral analysis techniques. The SIFT algorithm was applied to backscatter signals from simulations, phantoms, and bovine trabeculae in vitro. The estimated MTBS results were compared with those of the autoregressive (AR) cepstrum and quadratic transformation (QT) . The SIFT estimates are better than the AR cepstrum estimates and are comparable with the QT values. The study demonstrates that the SIFT algorithm has the potential to be a reliable and robust method for the estimation of MTBS in the presence of a small signal-to-noise ratio, a large spacing variation between regular scatterers, and a large scattering strength ratio of diffuse scatterers to regular ones.
SEGMENTATION OF CT SCAN LUMBAR SPINE IMAGE USING MEDIAN FILTER AND CANNY EDGE DETECTION ALGORITHM
Directory of Open Access Journals (Sweden)
E.Punarselvam
2013-09-01
Full Text Available The lumbar vertebrae are the largest segments of the movable part of the vertebral column, they are elected L1 to L5, starting at the top. The spinal column, more commonly called the backbone, is made up primarily of vertebrae discs, and the spinal cord. Acting as a communication conduit for the brain, signals are transmitted and received through the spinal cord. It is otherwise known as vertebralcolumn consists of 24 separate bony vertebrae together with 5 fused vertebrae, it is the unique interaction between the solid and fluid components that provides the disc strength and flexibility required to bear loading of the lumbar spine. In this work the Segmentation of Spine Image using Median Filter and Canny Edge Detection Algorithm between lumbar spine CT scan spine disc image. The result shows thatthe canny edge detection algorithm produced better result when compared other edge detection algorithm. Finding the correct boundary in a noisy image of spine disc is still a difficult one. To find outabsolute edges from noisy images, the comparative result can be verified and validated with the standard medical values. The result shows that the canny edge detection algorithm performs well and produced a solution very nearer to the optimal solution. This method is vigorous for all kinds of noisy images.
A fast image super-resolution algorithm using an adaptive Wiener filter.
Hardie, Russell
2007-12-01
A computationally simple super-resolution algorithm using a type of adaptive Wiener filter is proposed. The algorithm produces an improved resolution image from a sequence of low-resolution (LR) video frames with overlapping field of view. The algorithm uses subpixel registration to position each LR pixel value on a common spatial grid that is referenced to the average position of the input frames. The positions of the LR pixels are not quantized to a finite grid as with some previous techniques. The output high-resolution (HR) pixels are obtained using a weighted sum of LR pixels in a local moving window. Using a statistical model, the weights for each HR pixel are designed to minimize the mean squared error and they depend on the relative positions of the surrounding LR pixels. Thus, these weights adapt spatially and temporally to changing distributions of LR pixels due to varying motion. Both a global and spatially varying statistical model are considered here. Since the weights adapt with distribution of LR pixels, it is quite robust and will not become unstable when an unfavorable distribution of LR pixels is observed. For translational motion, the algorithm has a low computational complexity and may be readily suitable for real-time and/or near real-time processing applications. With other motion models, the computational complexity goes up significantly. However, regardless of the motion model, the algorithm lends itself to parallel implementation. The efficacy of the proposed algorithm is demonstrated here in a number of experimental results using simulated and real video sequences. A computational analysis is also presented.
Finding conserved and non-conserved reactions using a metabolic pathway alignment algorithm.
Clemente, José C; Satou, Kenji; Valiente, Gabriel
2006-01-01
Using a metabolic pathway alignment method we developed, we studied highly conserved reactions in different groups of organisms and found out that biological functions vital for each of the groups are effectively expressed in the set of conserved reactions. We also studied the metabolic alignment of different strains of three bacteria and found out several non-conserved reactions. We suggest that these reactions could be either misannotations or reactions with a relevant but yet to be specified biological role, and should therefore be further investigated.
Cervantes-Sanchez, Fernando; Hernandez-Aguirre, Arturo; Solorio-Meza, Sergio; Ornelas-Rodriguez, Manuel; Torres-Cisneros, Miguel
2016-01-01
This paper presents a novel method for improving the training step of the single-scale Gabor filters by using the Boltzmann univariate marginal distribution algorithm (BUMDA) in X-ray angiograms. Since the single-scale Gabor filters (SSG) are governed by three parameters, the optimal selection of the SSG parameters is highly desirable in order to maximize the detection performance of coronary arteries while reducing the computational time. To obtain the best set of parameters for the SSG, the area (Az) under the receiver operating characteristic curve is used as fitness function. Moreover, to classify vessel and nonvessel pixels from the Gabor filter response, the interclass variance thresholding method has been adopted. The experimental results using the proposed method obtained the highest detection rate with Az = 0.9502 over a training set of 40 images and Az = 0.9583 with a test set of 40 images. In addition, the experimental results of vessel segmentation provided an accuracy of 0.944 with the test set of angiograms. PMID:27738422
Directory of Open Access Journals (Sweden)
Fernando Cervantes-Sanchez
2016-01-01
Full Text Available This paper presents a novel method for improving the training step of the single-scale Gabor filters by using the Boltzmann univariate marginal distribution algorithm (BUMDA in X-ray angiograms. Since the single-scale Gabor filters (SSG are governed by three parameters, the optimal selection of the SSG parameters is highly desirable in order to maximize the detection performance of coronary arteries while reducing the computational time. To obtain the best set of parameters for the SSG, the area (Az under the receiver operating characteristic curve is used as fitness function. Moreover, to classify vessel and nonvessel pixels from the Gabor filter response, the interclass variance thresholding method has been adopted. The experimental results using the proposed method obtained the highest detection rate with Az=0.9502 over a training set of 40 images and Az=0.9583 with a test set of 40 images. In addition, the experimental results of vessel segmentation provided an accuracy of 0.944 with the test set of angiograms.
Kostencka, J.; Kozacki, T.
2016-04-01
Filtered back propagation (FBPP) is a well-established reconstruction technique that is used in diffractive holographic tomography. The great advantage of the algorithm is the space-domain implementation, which enables avoiding the error-prone interpolation in the spectral domain that is an inherent part of the main counterpart of FBPP - the direct inversion tomographic reconstruction method. However, the fundamental flaw of FBPP is lack of generality, i.e. the method can be applied solely for the classical tomographic systems, where alternation of the measurement views is achieved by rotating a sample. At the same time, majority of the nowadays tomographic setups apply an alternative measurement concept, which is based on scanning of an illumination beam. The aim of this paper is to remove the mentioned limitation of the FBPP and enable its application in the systems utilizing scanning of illumination. This is achieved by introducing a new method of accounting for uneven cover of the sampled object frequencies, which applies normalization of the object spectrum with coherent transfer function of a considered tomographic system. The feasibility of the proposed, modified filtered back propagation algorithm is demonstrated with numerical simulations, which mimic tomographic measurement of a complex sample, i.e. the Shepp-Logan phantom.
Inter Channel Correlation based Demosaicking Algorithm for Enhanced Bayer Color Filter Array
Directory of Open Access Journals (Sweden)
K. John Peter
2014-04-01
Full Text Available Demosaicking is a process of obtaining a full color image by interpolating the missing colors of an image captured from a digital still and video cameras that use a single-sensor array. In this study a new Color Filter Array (CFA is proposed. Which is based on the actual weight of the Human Visual System. It is developed based on the sensitivity level of the human eye to red as 29.9%, green as 58.7% and blue as 11.4%. This study also provides an effective iterative demosaicing algorithm applying a weighted-edge interpolation to handle green pixels followed by a series of color difference interpolation to update red, blue and green pixels. Before applying demosaicking algorithm Gaussian filter is applied to remove noise of the sensor applied image and also enhance the image quality. Experimental results show that the proposed method performs much better than other latest demosaicing techniques in terms of image quality and PSNR value.
Directory of Open Access Journals (Sweden)
G.Mallikarjuna Rao
2014-09-01
Full Text Available In the present day real time applications of visual object tracking in surveillance, it has become extremely complex, time consuming and tricky to do the tracking when there are occlusions are present for small duration or for longer time and also when it is done in outdoor environments. In these conditions, the target to be tracked can be lost for few seconds and that should be tracked as soon as possible. As from the literature it is observed that particle filter can be able to track the target robustly in different kinds of background conditions, and it’s robust to partial occlusion. However, this tracking cannot recover from large proportion of occlusion and complete occlusion, to avoid this condition, we proposed two new algorithms (modified kalman and modified particle filter for fast tracking of objects in the presence of occlusions. We considered the complete occlusion of tracking object and the main objective is how fast the system is able to track the object after the occlusion is crossed. From the experimental results, it is observed that the proposed algorithms have shown good improvement in results compared to the traditional methods.
Optimal IIR filter design using Gravitational Search Algorithm with Wavelet Mutation
Directory of Open Access Journals (Sweden)
S.K. Saha
2015-01-01
Full Text Available This paper presents a global heuristic search optimization technique, which is a hybridized version of the Gravitational Search Algorithm (GSA and Wavelet Mutation (WM strategy. Thus, the Gravitational Search Algorithm with Wavelet Mutation (GSAWM was adopted for the design of an 8th-order infinite impulse response (IIR filter. GSA is based on the interaction of masses situated in a small isolated world guided by the approximation of Newtonian’s laws of gravity and motion. Each mass is represented by four parameters, namely, position, active, passive and inertia mass. The position of the heaviest mass gives the near optimal solution. For better exploitation in multidimensional search spaces, the WM strategy is applied to randomly selected particles that enhance the capability of GSA for finding better near optimal solutions. An extensive simulation study of low-pass (LP, high-pass (HP, band-pass (BP and band-stop (BS IIR filters unleashes the potential of GSAWM in achieving better cut-off frequency sharpness, smaller pass band and stop band ripples, smaller transition width and higher stop band attenuation with assured stability.
Simulation Research on a SVPWM Control Algorithm for a Four-Leg Active Power Filter
Institute of Scientific and Technical Information of China (English)
无
2007-01-01
In this paper the topology of a four-leg shunt active-power filter (APF) is given.The APF compensates harmonic and reactive power in a three-phase four-wire system.The scheme adopted for control of the four-leg active power filter, a 3-Dimensional Pulse Width Modulation (PWM) technique, is presented.The theoretical deduction of a space vector PWM (SVPWM) algorithm is given in this paper.The paper also analyzes the distribution of the voltage-space vector of the four-leg converter in αβγ coordinates and describes methods to determine the location of the voltage-space vector and to calculate duration time.Finally, the algorithm is implemented in simulation; the results show that the total harmonic distortion (THD) of the three phase-current waveforms is reduced.The neutral wire current, after compensation, is about 0 A showing that the topology of the four-leg shunt APF is feasible and the proposed scheme is effective.
Niederhauser, Thomas; Wyss-Balmer, Thomas; Haeberlin, Andreas; Marisa, Thanks; Wildhaber, Reto A; Goette, Josef; Jacomet, Marcel; Vogel, Rolf
2015-06-01
Long-term electrocardiogram (ECG) often suffers from relevant noise. Baseline wander in particular is pronounced in ECG recordings using dry or esophageal electrodes, which are dedicated for prolonged registration. While analog high-pass filters introduce phase distortions, reliable offline filtering of the baseline wander implies a computational burden that has to be put in relation to the increase in signal-to-baseline ratio (SBR). Here, we present a graphics processor unit (GPU)-based parallelization method to speed up offline baseline wander filter algorithms, namely the wavelet, finite, and infinite impulse response, moving mean, and moving median filter. Individual filter parameters were optimized with respect to the SBR increase based on ECGs from the Physionet database superimposed to autoregressive modeled, real baseline wander. A Monte-Carlo simulation showed that for low input SBR the moving median filter outperforms any other method but negatively affects ECG wave detection. In contrast, the infinite impulse response filter is preferred in case of high input SBR. However, the parallelized wavelet filter is processed 500 and four times faster than these two algorithms on the GPU, respectively, and offers superior baseline wander suppression in low SBR situations. Using a signal segment of 64 mega samples that is filtered as entire unit, wavelet filtering of a seven-day high-resolution ECG is computed within less than 3 s. Taking the high filtering speed into account, the GPU wavelet filter is the most efficient method to remove baseline wander present in long-term ECGs, with which computational burden can be strongly reduced.
SkyAlign: a portable, work-efficient skyline algorithm for multicore and GPU architectures
DEFF Research Database (Denmark)
Bøgh, Kenneth Sejdenfaden; Chester, Sean; Assent, Ira
2016-01-01
The skyline operator determines points in a multidimensional dataset that offer some optimal trade-off. State-of-the-art CPU skyline algorithms exploit quad-tree partitioning with complex branching to minimise the number of point-to-point comparisons. Branch-phobic GPU skyline algorithms rely on ...
SINS anti-interference self-alignment algorithm for the swaying base%晃动基座下捷联惯导的抗干扰自对准算法
Institute of Scientific and Technical Information of China (English)
王跃钢; 杨家胜
2014-01-01
针对捷联惯导(SINS)晃动基座下， SINS难以快速实现自对准的问题，提出SINS的抗干扰自对准算法。该算法通过将初始对准问题转化为Wahba求解问题来消除角运动干扰的影响；利用惯性坐标系重力矢量和晃动干扰加速度的频率特点，通过设计低通滤波器对比力在惯性坐标下的投影进行滤波来消除线振动干扰的影响。仿真结果表明，该算法不需要进行粗对准，能够在角运动干扰和线振动干扰同时存在的情况下快速实现自对准。%The conventional methods are difficult to achieve alignment rapidly when the strapdown inertial navigation system(SINS) under swaying base. Therefore, an anti-interference self-alignment algorithm for the swaying base is presented, which transforms the alignment problem into the Wahba problem to remove the angular interrupting, and uses the low-pass filter to filter the special force in inertial reference frame to remove the linear vibration interrupting according to the different frequency characteristics of gravity vector in inertial reference frame and the disturbance. The simulation results show that the presented method can accomplish alignment quickly even in the presence of angular motion and linear vibration interference without the coarse alignment process.
舰载捷联惯导动基座 F-QUEST 初始对准方法%Shipborne SINS in-movement F-QUEST initial alignment algorithm
Institute of Scientific and Technical Information of China (English)
李杨; 高敬东; 胡柏青; 李开龙
2014-01-01
Aiming at the problems of low information availability and the decline of alignment accuracy due to an uncertain selection of vector observations as far as the strapdown inertial navigation system (SINS)in-movement alignment method based on the inertial frames,this paper proposes a new ship-borne SINS in-movement filter quaternion estimation (F-QUEST)alignment algorithm and offeres an in-movement initial alignment model of SINS.The chain rule of the attitude matrix is used to lead the initial alignment of SINS to the attitude determination.Then the F-QUEST algorithm is used to cal-culate the attitude matrix so as to acquire the in-movement alignment of SINS.The vehicle test results show that the proposed method is of higher alignment accuracy and faster convergence than the tradi-tional method,especially with the horizontal posture angle error being able to converge to 0.01°in 3 s.%针对目前基于惯性系的捷联惯导动基座对准方法信息利用率不高及矢量观测选取不确定性导致对准精度下降的问题，提出了一种新的舰载捷联惯导动基座滤波四元数估计（filter quaternion estimation，F-QUEST）对准方法。构建了捷联惯导动基座初始对准模型，并利用姿态矩阵链式法则将惯导初始对准转化为姿态确定问题，进而采用 F-QUEST 算法求取姿态矩阵以实现捷联惯导动基座对准。车载试验结果表明：相比传统方法，新方法具有更高的对准精度和更快的收敛速度，水平姿态角误差只需3 s 即可收敛到0．01°。
改进的自适应汉维句子对齐%Improved adaptive algorithm for Chinese-Uyghur sentence alignment
Institute of Scientific and Technical Information of China (English)
田生伟; 禹龙; 杨飞宇
2011-01-01
This paper proposes an improved adaptive algorithm for Chinese-Uyghur sentence alignment.Traditional alignment methods can not well adapt to change in types of corpus,the algorithm makes ues of current Chinese-Uyghur text length ratio of bytes and historical matching model, modifies the alignment model parameters dynamically to meet the changes in types of corpus and improves sentence alignment algorithm performance.Compared with alignment algorithm based on length, alignment improves alignment accuarcy 3.5 percentage and recall 2.7 percentage, compared with mixed-aligned model .alignment improves 1.9 percentage and 1.8 percentage.Experimental results show that the algorithm can adapt to change in types of corpus well.%提出了改进的自适应汉维句子对齐算法对齐汉维语句子.针对传统对齐方法不能较好地适应语料类型的变化,算法利用当前待对齐汉维文本的字节长度比和历史匹配模式数据,动态修正对齐模型的参数,使其适应语料类型的变化,提高了汉维句子对齐算法的性能,对齐的正确率和召回率较长度对齐模型分别提高了3.5个百分点和2.7个百分点,较混合对齐提高了1.9个百分点和1.8个百分点.实验结果验证了该算法能够有效地适应语料类型的变化.
Directory of Open Access Journals (Sweden)
Xin Yi Ng
2015-01-01
Full Text Available This study concerns an attempt to establish a new method for predicting antimicrobial peptides (AMPs which are important to the immune system. Recently, researchers are interested in designing alternative drugs based on AMPs because they have found that a large number of bacterial strains have become resistant to available antibiotics. However, researchers have encountered obstacles in the AMPs designing process as experiments to extract AMPs from protein sequences are costly and require a long set-up time. Therefore, a computational tool for AMPs prediction is needed to resolve this problem. In this study, an integrated algorithm is newly introduced to predict AMPs by integrating sequence alignment and support vector machine- (SVM- LZ complexity pairwise algorithm. It was observed that, when all sequences in the training set are used, the sensitivity of the proposed algorithm is 95.28% in jackknife test and 87.59% in independent test, while the sensitivity obtained for jackknife test and independent test is 88.74% and 78.70%, respectively, when only the sequences that has less than 70% similarity are used. Applying the proposed algorithm may allow researchers to effectively predict AMPs from unknown protein peptide sequences with higher sensitivity.
Institute of Scientific and Technical Information of China (English)
无
2006-01-01
In this article we introduce an exact backprojecfion filtered (BPF) type reconstruction algorithm for cone-beam scans based on Zou and Pan's work. The algorithm can reconstruct images using only the projection data passing through the parallel PI-line segments in reduced scans. Computer simulations and practical experiments are carried out to evaluate this algorithm. The BPF algorithm has a higher computational efficiency than the famous FDK algorithm. The BPF algorithm is evaluated using the practical CT projection data on a 450 keV X-ray CT system with a flat-panel detector (FPD). From the practical experiments, we get the spatial resolution of this CT system. The algorithm could achieve the spatial resolution of 2.4 lp/mm and satisfies the practical applications in industrial CT inspection.
Directory of Open Access Journals (Sweden)
V. Sakthivel
2015-12-01
Full Text Available The design of low complexity sharp transition width Modified Discrete Fourier Transform (MDFT filter bank with perfect reconstruction (PR is proposed in this work. The current trends in technology require high data rates and speedy processing along with reduced power consumption, implementation complexity and chip area. Filters with sharp transition width are required for various applications in wireless communication. Frequency response masking (FRM technique is used to reduce the implementation complexity of sharp MDFT filter banks with PR. Further, to reduce the implementation complexity, the continuous coefficients of the filters in the MDFT filter banks are represented in discrete space using canonic signed digit (CSD. The multipliers in the filters are replaced by shifters and adders. The number of non-zero bits is reduced in the conversion process to minimize the number of adders and shifters required for the filter implementation. Hence the performances of the MDFT filter bank with PR may degrade. In this work, the performances of the MDFT filter banks with PR are improved using a hybrid Harmony-Gravitational search algorithm.
Directory of Open Access Journals (Sweden)
Sicuranza Giovanni L
2007-01-01
Full Text Available The paper provides an analysis of the transient and the steady-state behavior of a filtered-x partial-error affine projection algorithm suitable for multichannel active noise control. The analysis relies on energy conservation arguments, it does not apply the independence theory nor does it impose any restriction to the signal distributions. The paper shows that the partial-error filtered-x affine projection algorithm in presence of stationary input signals converges to a cyclostationary process, that is, the mean value of the coefficient vector, the mean-square error and the mean-square deviation tend to periodic functions of the sample time.
Directory of Open Access Journals (Sweden)
N. F. Liu
2013-06-01
Full Text Available Land-surface albedo plays a critical role in the earth's radiant energy budget studies. Satellite remote sensing provides an effective approach to acquire regional and global albedo observations. Owing to cloud coverage, seasonal snow and sensor malfunctions, spatiotemporally continuous albedo datasets are often inaccessible. The Global LAnd Surface Satellite (GLASS project aims at providing a suite of key land surface parameter datasets with high temporal resolution and high accuracy for a global change study. The GLASS preliminary albedo datasets are global daily land-surface albedo generated by an angular bin algorithm (Qu et al., 2013. Like other products, the GLASS preliminary albedo datasets are affected by large areas of missing data; beside, sharp fluctuations exist in the time series of the GLASS preliminary albedo due to data noise and algorithm uncertainties. Based on the Bayesian theory, a statistics-based temporal filter (STF algorithm is proposed in this paper to fill data gaps, smooth albedo time series, and generate the GLASS final albedo product. The results of the STF algorithm are smooth and gapless albedo time series, with uncertainty estimations. The performance of the STF method was tested on one tile (H25V05 and three ground stations. Results show that the STF method has greatly improved the integrity and smoothness of the GLASS final albedo product. Seasonal trends in albedo are well depicted by the GLASS final albedo product. Compared with MODerate resolution Imaging Spectroradiometer (MODIS product, the GLASS final albedo product has a higher temporal resolution and more competence in capturing the surface albedo variations. It is recommended that the quality flag should be always checked before using the GLASS final albedo product.
Optimization of interference filters with genetic algorithms applied to silver-based heat mirrors.
Eisenhammer, T; Lazarov, M; Leutbecher, M; Schöffel, U; Sizmann, R
1993-11-01
In the optimization of multilayer stacks for various optical filtering purposes not only the thicknesses of the thin films are to be optimized, but also the sequence of materials. Materials with very different optical properties, such as metals and dielectrics, may be combined. A genetic algorithm is introduced to search for the optimal sequence of materials along with their optical thicknesses. This procedure is applied to a heat mirror in combination with a blackbody absorber for thermal solar energy applications at elevated temperatures (250 °C). The heat mirror is based on silver films with antireflective dielectric layers. Seven dielectrics have been considered. For a five-layer stack the sequence (TiO(2)/Ag/TiO(2)/Ag/Y(2)O(3)) is found to be optimal.
Directory of Open Access Journals (Sweden)
Deguang Wang
2011-02-01
Full Text Available Intrusion detection is a computer network system that collects information on several key points. and it gets these information from the security audit, monitoring, attack recognition and response aspects, check if there are some the behavior and signs against the network security policy. The classification of data acquisition is a key part of intrusion detection. In this article, we use the data cloud model to classify the invasion, effectively maintaining a continuous data on the qualitative ambiguity of the concept and evaluation phase of the invasion against the use of the coordination level filtering recommendation algorithm greatly improves the intrusion detection system in the face of massive data processing efficiency suspicious intrusion.
An inertia-free filter line-search algorithm for large-scale nonlinear programming
Energy Technology Data Exchange (ETDEWEB)
Chiang, Nai-Yuan; Zavala, Victor M.
2016-02-15
We present a filter line-search algorithm that does not require inertia information of the linear system. This feature enables the use of a wide range of linear algebra strategies and libraries, which is essential to tackle large-scale problems on modern computing architectures. The proposed approach performs curvature tests along the search step to detect negative curvature and to trigger convexification. We prove that the approach is globally convergent and we implement the approach within a parallel interior-point framework to solve large-scale and highly nonlinear problems. Our numerical tests demonstrate that the inertia-free approach is as efficient as inertia detection via symmetric indefinite factorizations. We also demonstrate that the inertia-free approach can lead to reductions in solution time because it reduces the amount of convexification needed.
Different View on PQ Theory Used in the Control Algorithm of Active Power Filters
Directory of Open Access Journals (Sweden)
Rastislav Pavlanin
2006-01-01
Full Text Available The improvement of power quality is a frequently discussed issue, which still requires a considerable research effort to be devoted to the study of the problem. The aim of this paper is to describe some problems related to the control of switching compensators, commonly known as active power filters. It also includes some shortcomings of pq theory regarded as three phase instantaneous power theory. The term “shortcomings” means that the pq theory does not provide a proper description of power properties. Moreover the control algorithm based on this theory only achieves satisfactory results for sinusoidal balanced voltage system. Nevertheless it can still be considered a helpful approach to the problem under study. The simulation results presented in this paper illustrate the weaknesses of the pq theory.
Battery State-of-Charge and Parameter Estimation Algorithm Based on Kalman Filter
DEFF Research Database (Denmark)
Dragicevic, Tomislav; Sucic, Stjepan; Guerrero, Josep M.
2013-01-01
Electrochemical battery is the most widely used energy storage technology, finding its application in various devices ranging from low power consumer electronics to utility back-up power. All types of batteries show highly non-linear behaviour in terms of dependence of internal parameters...... on operating conditions, momentary replenishment and a number of past charge/discharge cycles. A good indicator for the quality of overall customer service in any battery based application is the availability and reliability of these informations, as they point out important runtime variables...... such as the actual state of charge (SOC) and state of health (SOH). Therefore, a modern battery management systems (BMSs) should incorporate functions that accommodate real time tracking of these nonlinearities. For that purpose, Kalman filter based algorithms emerged as a convenient solution due to their ability...
协同过滤推荐算法专利综述%Patent Review of Collaborative Filtering Recommendation Algorithm
Institute of Scientific and Technical Information of China (English)
张博; 周瑞瑞; 鱼冰
2015-01-01
在信息化爆炸的时代,面对海量信息人们往往无法快速确定自己真正需求的信息,推荐系统及其相应的推荐算法应运而生,协同过滤推荐算法的出现标志着推荐系统的产生.协同过滤算法包含基于用户的协同过滤算法和基于物品的协同过滤算法,能够实现个性化推荐、处理复杂的非结构对象、新异兴趣的发现,且随着时间推移性能提高、自动化程度高.%In the era of information explosion, facing the vast amounts of information, people are often unable to quickly determine their real demand information, recommendation system and its corresponding recommendation algorithm have come into being, collaborative filtering recommendation algorithm marks the generation of recommendation system. Collaborative filtering algorithm contains collaborative filtering algorithm based on user and collaborative filtering algorithm based on item to achieve personalized recommendation, dealing with complex non-structure object, and novelty interest, and with the improvement of time performance, high degree of automation is obtained.
Xiang, Shiming; Zhang, Haijiang
2016-11-01
It is known full-waveform inversion (FWI) is generally ill-conditioned and various strategies including pre-conditioning and regularizing the inversion system have been proposed to obtain a reliable estimation of the velocity model. Here, we propose a new edge-guided strategy for FWI in frequency domain to efficiently and reliably estimate velocity models with structures of the size similar to the seismic wavelength. The edges of the velocity model at the current iteration are first detected by the Canny edge detection algorithm that is widely used in image processing. Then, the detected edges are used for guiding the calculation of FWI gradient as well as enforcing edge-preserving total variation (TV) regularization for next iteration of FWI. Bilateral filtering is further applied to remove noise but keep edges of the FWI gradient. The proposed edge-guided FWI in the frequency domain with edge-guided TV regularization and bilateral filtering is designed to preserve model edges that are recovered from previous iterations as well as from lower frequency waveforms when FWI is conducted from lower to higher frequencies. The new FWI method is validated using the complex Marmousi model that contains several steeply dipping fault zones and hundreds of horizons. Compared to FWI without edge guidance, our proposed edge-guided FWI recovers velocity model anomalies and edges much better. Unlike previous image-guided FWI or edge-guided TV regularization strategies, our method does not require migrating seismic data, thus is more efficient for real applications.
Adaptive Controller for Vehicle Active Suspension Generated Through LMS Filter Algorithms
Institute of Scientific and Technical Information of China (English)
SUN Jianmin; SHU Gequn
2006-01-01
The least means squares (LMS) adaptive filter algorithm was used in active suspension system.By adjusting the weight of adaptive filter, the minimum quadratic performance index was obtained.For two-degree-of-freedom vehicle suspension model, LMS adaptive controller was designed.The acceleration of the sprung mass,the dynamic tyre load between wheels and road,and the dynamic deflection between sprung mass and unsprung mass were determined as the evaluation targets of suspension performance.For LMS adaptive control suspension, compared with passive suspension, acceleration power spectral density of sprung mass acceleration under the road input model decreased 8-10 times in high frequency resonance band or low frequency resonance band.The simulation results show that LMS adaptive control is simple and remarkably effective.It further proves that the active control suspension system can improve both the riding comfort and handling safety in various operation conditions, and the method is fit for the active control of the suspension system.
Chen, Jing; Liu, Tundong; Jiang, Hao
2016-01-01
A Pareto-based multi-objective optimization approach is proposed to design multichannel FBG filters. Instead of defining a single optimal objective, the proposed method establishes the multi-objective model by taking two design objectives into account, which are minimizing the maximum index modulation and minimizing the mean dispersion error. To address this optimization problem, we develop a two-stage evolutionary computation approach integrating an elitist non-dominated sorting genetic algorithm (NSGA-II) and technique for order preference by similarity to ideal solution (TOPSIS). NSGA-II is utilized to search for the candidate solutions in terms of both objectives. The obtained results are provided as Pareto front. Subsequently, the best compromise solution is determined by the TOPSIS method from the Pareto front according to the decision maker's preference. The design results show that the proposed approach yields a remarkable reduction of the maximum index modulation and the performance of dispersion spectra of the designed filter can be optimized simultaneously.
Directory of Open Access Journals (Sweden)
Wang Wei
2016-01-01
Full Text Available The related theory and algorithm of adaptive inverse control were presented through the research which pointed out the adaptive inverse control strategy could effectively eliminate the noise influence on the system control. Proposed using a frequency domain filter-X LMS adaptive inverse control algorithm, and the control algorithm was applied to the two-exciter hydraulic vibration test system of random shock vibration control process and summarized the process of the adaptive inverse control strategies in the realization of the random shock vibration test. The self-closed-loop and field test show that using the frequency-domain filter-X LMS adaptive inverse control algorithm can realize high precision control of random shock vibration test.
Institute of Scientific and Technical Information of China (English)
1998-01-01
Vibration suppression is one of the most important tasks for helicopter research. ACSR (Active Control of Structural Response) in time domain has turned out to be an effective technique to deal with this issue. In this paper, based on Least Square Principle and ACSR Principle, a multichannel delayed filtered-x FTF (Fast Transversal Filter) algorithm is developed for suppressing helicopter vibration. In order to keep the algorithm running in a stable and efficient state, DRR (Desired Response Reconstruction) technique is developed and a Constraint Stabilization Technique is firstly presented for the developed algorithm. Computer simulations are conducted on attenuating helicopter vibration and remarkable vibration reductions are achieved. The results demonstrate good properties of the obtained FTF algorithm in stability, robustness, convergence speed, tracking capability, etc.. They also show that time delay and DRR technique play important and effective roles in keeping ACSR system working efficiently.
A Novel Pixon-Based Image Segmentation Process Using Fuzzy Filtering and Fuzzy C-mean Algorithm
DEFF Research Database (Denmark)
Nadernejad, E; Barari, Amin
2011-01-01
for image segmentation. The key idea is to create a pixon model by combining fuzzy filtering as a kernel function and a fuzzy c-means clustering algorithm for image segmentation. Use of fuzzy filters reduces noise and slightly smoothes the image. Use of the proposed pixon model prevented image over......Image segmentation, which is an important stage of many image processing algorithms, is the process of partitioning an image into nonintersecting regions, such that each region is homogeneous and the union of no two adjacent regions is homogeneous. This paper presents a novel pixon-based algorithm......-segmentation and produced better experimental results than those obtained with other pixon-based algorithms....
Dong, Feng; Gunn, James E; Wechsler, Risa H
2007-01-01
We present a modified adaptive matched filter algorithm designed to identify clusters of galaxies in wide-field imaging surveys such as the Sloan Digital Sky Survey. The cluster-finding technique is fully adaptive to imaging surveys with spectroscopic coverage, multicolor photometric redshifts, no redshift information at all, and any combination of these within one survey. It works with high efficiency in multi-band imaging surveys where photometric redshifts can be estimated with well-understood error distributions. Tests of the algorithm on realistic mock SDSS catalogs suggest that the detected sample is ~85% complete and over 90% pure for clusters with masses above 1.0*10^{14} h^{-1} M_solar and redshifts up to z=0.45. The errors of estimated cluster redshifts from maximum likelihood method are shown to be small (typically less that 0.01) over the whole redshift range with photometric redshift errors typical of those found in the Sloan survey. Inside the spherical radius corresponding to a galaxy overdensi...
Energy Technology Data Exchange (ETDEWEB)
Dong, Feng; Pierpaoli, Elena; Gunn, James E.; Wechsler, Risa H.
2007-10-29
We present a modified adaptive matched filter algorithm designed to identify clusters of galaxies in wide-field imaging surveys such as the Sloan Digital Sky Survey. The cluster-finding technique is fully adaptive to imaging surveys with spectroscopic coverage, multicolor photometric redshifts, no redshift information at all, and any combination of these within one survey. It works with high efficiency in multi-band imaging surveys where photometric redshifts can be estimated with well-understood error distributions. Tests of the algorithm on realistic mock SDSS catalogs suggest that the detected sample is {approx} 85% complete and over 90% pure for clusters with masses above 1.0 x 10{sup 14}h{sup -1} M and redshifts up to z = 0.45. The errors of estimated cluster redshifts from maximum likelihood method are shown to be small (typically less that 0.01) over the whole redshift range with photometric redshift errors typical of those found in the Sloan survey. Inside the spherical radius corresponding to a galaxy overdensity of {Delta} = 200, we find the derived cluster richness {Lambda}{sub 200} a roughly linear indicator of its virial mass M{sub 200}, which well recovers the relation between total luminosity and cluster mass of the input simulation.
Efficient Rectangular Maximal-Volume Algorithm for Rating Elicitation in Collaborative Filtering
Fonarev, Alexander
2017-02-07
Cold start problem in Collaborative Filtering can be solved by asking new users to rate a small seed set of representative items or by asking representative users to rate a new item. The question is how to build a seed set that can give enough preference information for making good recommendations. One of the most successful approaches, called Representative Based Matrix Factorization, is based on Maxvol algorithm. Unfortunately, this approach has one important limitation - a seed set of a particular size requires a rating matrix factorization of fixed rank that should coincide with that size. This is not necessarily optimal in the general case. In the current paper, we introduce a fast algorithm for an analytical generalization of this approach that we call Rectangular Maxvol. It allows the rank of factorization to be lower than the required size of the seed set. Moreover, the paper includes the theoretical analysis of the method\\'s error, the complexity analysis of the existing methods and the comparison to the state-of-the-art approaches.
Unscented Kalman Filter Algorithm for WiFi-PDR Integrated Indoor Positioning
Directory of Open Access Journals (Sweden)
CHEN GuoLiang
2015-12-01
Full Text Available Indoor positioning still faces lots of fundamental technical problems although it has been widely applied. A novel indoor positioning technology by using the smart phone with the assisting of the widely available and economically signals of WiFi is proposed. It also includes the principles and characteristics in indoor positioning. Firstly, improve the system's accuracy by fusing the WiFi fingerprinting positioning and PDR (ped estrian dead reckoning positioning with UKF (unscented Kalman filter. Secondly, improve the real-time performance by clustering the WiFi fingerprinting with k-means clustering algorithm. An investigation test was conducted at the indoor environment to learn about its performance on a HUAWEI P6-U06 smart phone. The result shows that compared to the pattern-matching system without clustering, an average reduction of 51% in the time cost can be obtained without degrading the positioning accuracy. When the state of personnel is walking, the average positioning error of WiFi is 7.76 m, the average positioning error of PDR is 4.57 m. After UKF fusing, the system's average positioning error is down to 1.24 m. It shows that the algorithm greatly improves the system's real-time and positioning accuracy.
Emulation of an ensemble Kalman filter algorithm on a flood wave propagation model
Barthélémy, S.; Ricci, S.; Pannekoucke, O.; Thual, O.; Malaterre, P. O.
2013-06-01
This study describes the emulation of an Ensemble Kalman Filter (EnKF) algorithm on a 1-D flood wave propagation model. This model is forced at the upstream boundary with a random variable with gaussian statistics and a correlation function in time with gaussian shape. This allows for, in the case without assimilation, the analytical study of the covariance functions of the propagated signal anomaly. This study is validated numerically with an ensemble method. In the case with assimilation with one observation point, where synthetical observations are generated by adding an error to a true state, the dynamic of the background error covariance functions is not straightforward and a numerical approach using an EnKF algorithm is prefered. First, those numerical experiments show that both background error variance and correlation length scale are reduced at the observation point. This reduction of variance and correlation length scale is propagated downstream by the dynamics of the model. Then, it is shown that the application of a Best Linear Unbiased Estimator (BLUE) algorithm using the background error covariance matrix converged from the EnKF algorithm, provides the same results as the EnKF but with a cheaper computational cost, thus allowing for the use of data assimilation in the context of real time flood forecasting. Moreover it was demonstrated that the reduction of background error correlation length scale and variance at the observation point depends on the error observation statistics. This feature is quantified by abacus built from linear regressions over a limited set of EnKF experiments. These abacus that describe the background error variance and the correlation length scale in the neighboring of the observation point combined with analytical expressions that describe the background error variance and the correlation length scale away from the observation point provide parametrized models for the variance and the correlation length scale. Using this
Emulation of an ensemble Kalman filter algorithm on a flood wave propagation model
Directory of Open Access Journals (Sweden)
S. Barthélémy
2013-06-01
Full Text Available This study describes the emulation of an Ensemble Kalman Filter (EnKF algorithm on a 1-D flood wave propagation model. This model is forced at the upstream boundary with a random variable with gaussian statistics and a correlation function in time with gaussian shape. This allows for, in the case without assimilation, the analytical study of the covariance functions of the propagated signal anomaly. This study is validated numerically with an ensemble method. In the case with assimilation with one observation point, where synthetical observations are generated by adding an error to a true state, the dynamic of the background error covariance functions is not straightforward and a numerical approach using an EnKF algorithm is prefered. First, those numerical experiments show that both background error variance and correlation length scale are reduced at the observation point. This reduction of variance and correlation length scale is propagated downstream by the dynamics of the model. Then, it is shown that the application of a Best Linear Unbiased Estimator (BLUE algorithm using the background error covariance matrix converged from the EnKF algorithm, provides the same results as the EnKF but with a cheaper computational cost, thus allowing for the use of data assimilation in the context of real time flood forecasting. Moreover it was demonstrated that the reduction of background error correlation length scale and variance at the observation point depends on the error observation statistics. This feature is quantified by abacus built from linear regressions over a limited set of EnKF experiments. These abacus that describe the background error variance and the correlation length scale in the neighboring of the observation point combined with analytical expressions that describe the background error variance and the correlation length scale away from the observation point provide parametrized models for the variance and the correlation length
复杂网络结构比对算法研究进展%Advances in algorithms for construction alignment of complex networks research
Institute of Scientific and Technical Information of China (English)
刘富; 姜奕含; 邹青宇
2015-01-01
The construction alignment of complex networks problems in biological science、computer science、social science and other fields have practical signification.In recent years, different types of construction alignment of complex networks have been sprung up.In this paper, we mainly analysed the construction alignment algorithms based on graph and construction alignment algorithms and mathematical framework.Illustrating the key problem in the study of the networks alignment algorithm is analyzed and compared the algorithms of construction alignment. We explained their advantages and disadvantages,at last we forecast the future progress of algorithms for construc-tion alignment of complex networks.%复杂网络的结构比对问题在生物科学、计算机科学和社会科学等多个领域都具有很重要的现实意义。近年来涌现出了很多针对不同类型复杂网络的结构对比算法，对现有的网络结构比对算法进行梳理，重点分析了基于图的网络结构比对方法和基于数学框架网络结构比对方法。对这2种方法的特点进行了总结与比较，重点阐述了网络结构比对研究中的关键问题，分析和总结了现有的网络结构比对算法，阐述了网络结构比对中优势和不足。以此为基础提出了复杂网络结构比对问题未来的研究方向。
一种卡尔曼滤波自适应算法%An adaptive Algorithm on Kalman Filtering
Institute of Scientific and Technical Information of China (English)
黄波; 郑新星; 刘凤伟
2012-01-01
自适应滤波是指随着外部信号的变化,滤波器能够自我调节滤波参数,使得滤波器的某一性能指标达到最优。文章以卡尔曼滤波理论为基础,给出一种新的自适应卡尔曼滤波算法。%Adaptive-filtering means the filter could adjust filtration parameters by itself and make some performance index optimal when the external signals vary.This paper will give a new Kalman filter algorithm whose base is Kalman filter theory.
Directory of Open Access Journals (Sweden)
Patrick D Schloss
Full Text Available Pyrosequencing of PCR-amplified fragments that target variable regions within the 16S rRNA gene has quickly become a powerful method for analyzing the membership and structure of microbial communities. This approach has revealed and introduced questions that were not fully appreciated by those carrying out traditional Sanger sequencing-based methods. These include the effects of alignment quality, the best method of calculating pairwise genetic distances for 16S rRNA genes, whether it is appropriate to filter variable regions, and how the choice of variable region relates to the genetic diversity observed in full-length sequences. I used a diverse collection of 13,501 high-quality full-length sequences to assess each of these questions. First, alignment quality had a significant impact on distance values and downstream analyses. Specifically, the greengenes alignment, which does a poor job of aligning variable regions, predicted higher genetic diversity, richness, and phylogenetic diversity than the SILVA and RDP-based alignments. Second, the effect of different gap treatments in determining pairwise genetic distances was strongly affected by the variation in sequence length for a region; however, the effect of different calculation methods was subtle when determining the sample's richness or phylogenetic diversity for a region. Third, applying a sequence mask to remove variable positions had a profound impact on genetic distances by muting the observed richness and phylogenetic diversity. Finally, the genetic distances calculated for each of the variable regions did a poor job of correlating with the full-length gene. Thus, while it is tempting to apply traditional cutoff levels derived for full-length sequences to these shorter sequences, it is not advisable. Analysis of beta-diversity metrics showed that each of these factors can have a significant impact on the comparison of community membership and structure. Taken together, these results
Institute of Scientific and Technical Information of China (English)
LI; Zicheng; SUN; Yukun
2006-01-01
Considering the detection principle that "when load current is periodic current, the integral in a cycle for absolute value of load current subtracting fundamental active current is the least", harmonic current real-time detection methods for power active filter are proposed based on direct computation, simple iterative algorithm and optimal iterative algorithm. According to the direct computation method, the amplitude of the fundamental active current can be accurately calculated when load current is placed in stable state. The simple iterative algorithm and the optimal iterative algorithm provide an idea about judging the state of load current. On the basis of the direct computation method, the simple iterative algorithm, the optimal iterative algorithm and precise definition of the basic concepts such as the true amplitude of the fundamental active current when load current is placed in varying state, etc., the double linear construction idea is proposed in which the amplitude of the fundamental active current at the moment of the sample is accurately calculated by using the first linear construction and the condition which disposes the next sample is created by using the second linear construction. On the basis of the double linear construction idea, a harmonic current real-time detection method for power active filter is proposed based on the double linear construction algorithm. This method has the characteristics of small computing quantity, fine real-time performance, being capable of accurately calculating the amplitude of the fundamental active current and so on.
Maes, K.; Iliopoulos, A.; Weijtjens, W.; Devriendt, C.; Lombaert, G.
2016-08-01
Offshore wind turbines are exposed to continuous wind and wave excitation. The monitoring of high periodic strains at critical locations is important to assess the remaining lifetime of the structure. At some critical locations below the water level, direct measurements of the strains are not feasible. Response estimation techniques can then be used to estimate the strains from a limited set of response measurements and a system model. This paper compares a Kalman filtering algorithm, a joint input-state estimation algorithm, and a modal expansion algorithm, for the estimation of dynamic strains in the tower of an offshore monopile wind turbine. The algorithms make use of a model of the structure and a limited number of response measurements for the prediction of the strain responses. The strain signals obtained from the response estimation algorithms are compared to the actual measured strains in the tower.
STELLAR: fast and exact local alignments
Directory of Open Access Journals (Sweden)
Weese David
2011-10-01
Full Text Available Abstract Background Large-scale comparison of genomic sequences requires reliable tools for the search of local alignments. Practical local aligners are in general fast, but heuristic, and hence sometimes miss significant matches. Results We present here the local pairwise aligner STELLAR that has full sensitivity for ε-alignments, i.e. guarantees to report all local alignments of a given minimal length and maximal error rate. The aligner is composed of two steps, filtering and verification. We apply the SWIFT algorithm for lossless filtering, and have developed a new verification strategy that we prove to be exact. Our results on simulated and real genomic data confirm and quantify the conjecture that heuristic tools like BLAST or BLAT miss a large percentage of significant local alignments. Conclusions STELLAR is very practical and fast on very long sequences which makes it a suitable new tool for finding local alignments between genomic sequences under the edit distance model. Binaries are freely available for Linux, Windows, and Mac OS X at http://www.seqan.de/projects/stellar. The source code is freely distributed with the SeqAn C++ library version 1.3 and later at http://www.seqan.de.
Institute of Scientific and Technical Information of China (English)
FENG Bo; MA Hong-Bin; FU Meng-Yin; WANG Shun-Ting
2013-01-01
Kalman filtering techniques have been widely used in many applications,however,standard Kalman filters for linear Gaussian systems usually cannot work well or even diverge in the presence of large model uncertainty.In practical applications,it is expensive to have large number of high-cost experiments or even impossible to obtain an exact system model.Motivated by our previous pioneering work on finite-model adaptive control,a framework of finite-model Kalman filtering is introduced in this paper.This framework presumes that large model uncertainty may be restricted by a finite set of known models which can be very different from each other.Moreover,the number of known models in the set can be flexibly chosen so that the uncertain model may always be approximated by one of the known models,in other words,the large model uncertainty is "covered" by the "convex hull" of the known models.Within the presented framework according to the idea of adaptive switching via the minimizing vector distance principle,a simple finite-model Kalman filter,MVDP-FMKF,is mathematically formulated and illustrated by extensive simulations.An experiment of MEMS gyroscope drift has verified the effectiveness of the proposed algorithm,indicating that the mechanism of finite-model Kalman filter is useful and efficient in practical applications of Kalman filters,especially in inertial navigation systems.
Latifoğlu, Fatma
2013-09-01
In this study a novel approach based on 2D FIR filters is presented for denoising digital images. In this approach the filter coefficients of 2D FIR filters were optimized using the Artificial Bee Colony (ABC) algorithm. To obtain the best filter design, the filter coefficients were tested with different numbers (3×3, 5×5, 7×7, 11×11) and connection types (cascade and parallel) during optimization. First, the speckle noise with variances of 1, 0.6, 0.8 and 0.2 respectively was added to the synthetic test image. Later, these noisy images were denoised with both the proposed approach and other well-known filter types such as Gaussian, mean and average filters. For image quality determination metrics such as mean square error (MSE), peak signal-to-noise ratio (PSNR) and signal-to-noise ratio (SNR) were used. Even in the case of noise having maximum variance (the most noisy), the proposed approach performed better than other filtering methods did on the noisy test images. In addition to test images, speckle noise with a variance of 1 was added to a fetal ultrasound image, and this noisy image was denoised with very high PSNR and SNR values. The performance of the proposed approach was also tested on several clinical ultrasound images such as those obtained from ovarian, abdomen and liver tissues. The results of this study showed that the 2D FIR filters designed based on ABC optimization can eliminate speckle noise quite well on noise added test images and intrinsically noisy ultrasound images. Copyright © 2013 Elsevier Ireland Ltd. All rights reserved.
Directory of Open Access Journals (Sweden)
S. El-Ouafi Bahlous
2013-01-01
Full Text Available The authors recently developed a damage identification method which combines ambient vibration measurements and a Statistical Modal Filtering approach to predict the location and degree of damage. The method was then validated experimentally via ambient vibration tests conducted on full-scale reinforced concrete laboratory specimens. The main purpose of this paper is to demonstrate the feasibility of the identification method for a real bridge. An important challenge in this case is to overcome the absence of vibration measurements for the structure in its undamaged state which corresponds ideally to the reference state of the structure. The damage identification method is, therefore, modified to adapt it to the present situation where the intact state was not subjected to measurements. An additional refinement of the method consists of using a genetic algorithm to improve the computational efficiency of the damage localization method. This is particularly suited for a real case study where the number of damage parameters becomes significant. The damage diagnosis predictions suggest that the diagnosed bridge is damaged in four elements among a total of 168 elements with degrees of damage varying from 6% to 18%.
An algorithm to filter out packing arrangements based on steric clashes.
Koudelka, Bohdan; Capkova, Pavla
2003-12-01
This document outlines the use of an algorithm to filter out impossible crystal-packing arrangements based on steric considerations. Within an exhaustive grid search frame, the space sample is reduced by analysis of spherical areas where atom pairs from different rigid units might clash. This technique finds areas in the state space where the global energy minimum might lie. The minimum can then be found by the usual methods of molecular modeling restricted to these particular areas. Only a tiny fraction of atom pair distances need to be tested; usually a single quantity on average per one state of model space! For example, a crystal of three rigid molecules, each containing 12 atoms, has 3x12x12=432 atom pairs just in one unit cell but our method needs to test on average 1 to 4 atom pairs per state. Using modern computers, about 10(12-15) models can be tested within several hours or days. For example, a crystal model with six rotational degrees of freedom (two rigid molecules in the unit cell) each with step 3 degrees can be tested in a few hours on a 1-GHz x86 processor-based machine. The method presented here has been implemented in the SUPRAMOL program.
ABS: Sequence alignment by scanning
Bonny, Mohamed Talal
2011-08-01
Sequence alignment is an essential tool in almost any computational biology research. It processes large database sequences and considered to be high consumers of computation time. Heuristic algorithms are used to get approximate but fast results. We introduce fast alignment algorithm, called Alignment By Scanning (ABS), to provide an approximate alignment of two DNA sequences. We compare our algorithm with the well-known alignment algorithms, the FASTA (which is heuristic) and the \\'Needleman-Wunsch\\' (which is optimal). The proposed algorithm achieves up to 76% enhancement in alignment score when it is compared with the FASTA Algorithm. The evaluations are conducted using different lengths of DNA sequences. © 2011 IEEE.
Wang, Bin; Dong, Lili; Zhao, Ming; Xu, Wenhai
2015-12-01
In order to realize accurate detection for small dim infrared maritime target, this paper proposes a target detection algorithm based on local peak detection and pipeline-filtering. This method firstly extracts some suspected targets through local peak detection and removes most of non-target peaks with self-adaptive threshold process. And then pipeline-filtering is used to eliminate residual interferences so that only real target can be retained. The experiment results prove that this method has high performance on target detection, and its missing alarm rate and false alarm rate can basically meet practical requirements.
Directory of Open Access Journals (Sweden)
P. Li
2017-06-01
Full Text Available Use of the Gaussian inverse Wishart probability hypothesis density (GIW-PHD filter has demonstrated promise as an approach to track an unknown number of extended targets. However, when targets of various sizes are spaced closely together and performing maneuvers, estimation errors will occur because measurement partitioning algorithms fail to provide the correct partitions. Specifically, the sub-partitioning algorithm fails to handle cases in which targets are of different sizes, while other partitioning approaches are sensitive to target maneuvers. This paper presents an improved partitioning algorithm for a GIW-PHD filter in order to solve the above problems. The sub-partitioning algorithm is improved by considering target extension information and by employing Mahalanobis distances to distinguish among measurement cells of different sizes. Thus, the improved approach is not sensitive to either differences in target sizes or target maneuvering. Simulation results show that the use of the proposed partitioning approach can improve the tracking performance of a GIW-PHD filter when target are spaced closely together.
基于布尔逻辑的双序列搜索比对算法%Pairwise Sequences Search and Alignment Algorithm Based on Boolean Logic
Institute of Scientific and Technical Information of China (English)
郭宁; 冯萍; 康继昌
2011-01-01
Traditional pairwise sequences alignment algorithms are mostly based on dynamic programming, there are some problems when using dynamic programming to align for its slow speed and low accuracy. Pairwise sequences search and alignment algorithm based on Boolean logic is proposed in this paper. The algorithm searches homologous regions in the pairwise sequence using a fixed-length base fragment in one sequence, and performs the alignment between the homologous regions at once, including the alignment of the bases in the homologous regions and the alignment between the subsequence and the other sequence. It also makes use of concurrent execution mechanism to realize the parallel speed up. Simulation experimental results show that the algorithm has higer real-time and accuracy.%传统双序列比对算法使用动态规划进行序列比对的速度慢,且准确性不高.为解决该问题,提出一种基于布尔逻辑的双序列搜索比对算法.根据一条序列中定长的碱基片段搜索2条序列的相似区,对相似区进行比对,包括相似区中碱基的比对以及子序列与另一条序列的比对,并通过并行执行机制实现加速比对.仿真实验结果表明,该算法具有较高的准确性和较好的实时性.
Vullings, R; Mischi, M
2013-01-01
Reduced fetal movement is an important parameter to assess fetal distress. Currently, no suitable methods are available that can objectively assess fetal movement during pregnancy. Fetal vectorcardiographic (VCG) loop alignment could be such a method. In general, the goal of VCG loop alignment is to correct for motion-induced changes in the VCGs of (multiple) consecutive heartbeats. However, the parameters used for loop alignment also provide information to assess fetal movement. Unfortunately, current methods for VCG loop alignment are not robust against low-quality VCG signals. In this paper, a more robust method for VCG loop alignment is developed that includes a priori information on the loop alignment, yielding a maximum a posteriori loop alignment. Classification, based on movement parameters extracted from the alignment, is subsequently performed using support vector machines, resulting in correct classification of (absence of) fetal movement in about 75% of cases. After additional validation and optimization, this method can possibly be employed for continuous fetal movement monitoring.
Sheng-Hui, Rong; Hui-Xin, Zhou; Han-Lin, Qin; Rui, Lai; Kun, Qian
2016-05-01
Imaging non-uniformity of infrared focal plane array (IRFPA) behaves as fixed-pattern noise superimposed on the image, which affects the imaging quality of infrared system seriously. In scene-based non-uniformity correction methods, the drawbacks of ghosting artifacts and image blurring affect the sensitivity of the IRFPA imaging system seriously and decrease the image quality visibly. This paper proposes an improved neural network non-uniformity correction method with adaptive learning rate. On the one hand, using guided filter, the proposed algorithm decreases the effect of ghosting artifacts. On the other hand, due to the inappropriate learning rate is the main reason of image blurring, the proposed algorithm utilizes an adaptive learning rate with a temporal domain factor to eliminate the effect of image blurring. In short, the proposed algorithm combines the merits of the guided filter and the adaptive learning rate. Several real and simulated infrared image sequences are utilized to verify the performance of the proposed algorithm. The experiment results indicate that the proposed algorithm can not only reduce the non-uniformity with less ghosting artifacts but also overcome the problems of image blurring in static areas.
Pham, Mai Quyen; Chaux, Caroline; Pesquet, Jean-Christophe
2014-01-01
Unveiling meaningful geophysical information from seismic data requires to deal with both random and structured "noises". As their amplitude may be greater than signals of interest (primaries), additional prior information is especially important in performing efficient signal separation. We address here the problem of multiple reflections, caused by wave-field bouncing between layers. Since only approximate models of these phenomena are available, we propose a flexible framework for time-varying adaptive filtering of seismic signals, using sparse representations, based on inaccurate templates. We recast the joint estimation of adaptive filters and primaries in a new convex variational formulation. This approach allows us to incorporate plausible knowledge about noise statistics, data sparsity and slow filter variation in parsimony-promoting wavelet frames. The designed primal-dual algorithm solves a constrained minimization problem that alleviates standard regularization issues in finding hyperparameters. Th...
Directory of Open Access Journals (Sweden)
Šaponjić Đorđe
2009-01-01
Full Text Available By applying the well known dualism: mean count rate - mean time between successive pulses - the equivalence between an IIR digital filter and a preset count digital rate meter has been demonstrated. By using a bank of four second order IIR filters and an optimized automated algorithm for filter selection, a practical realization of a preset count rate meter giving good tradeoff between statistical fluctuations and speed of response, particularly at low count rates such as background monitoring, is presented. The presented solution is suitable for designing portable count rate meters. The designed prototype is capable of operating up to 3600 pulses per second with an accuracy of over 4% in steady-state and response times of 1 second for the rising edge and 2 seconds for the falling edge of the mean count rate step-change.
CSIR Research Space (South Africa)
Salmon, BP
2012-07-01
Full Text Available In this paper the Bias Variance Search Algorithm is proposed as an algorithm to optimize a candidate set of initial parameters for an Extended Kalman filter (EKF). The search algorithm operates on a Bias Variance Equilibrium Point criterion...
Directory of Open Access Journals (Sweden)
Xiang Gao
2012-05-01
Full Text Available In order to process target tracking approximation with unknown motion state models beforehand in a two-dimensional field of binary proximity sensors, the algorithms based on cost functions of particle filters and near-linear curve simple optimization are proposed in this paper. Through moving target across detecting intersecting fields of sensor nodes sequentially, cost functions are introduced to solve target tracking approximation and velocity estimation which is not similar to traditional particle filters that rely on probabilistic assumptions about the motion states. Then a near-linear curve geometric approach is used to simplify and easily describe target trajectories that are below a certain error measure. Because there maybe some sensor nodes invalid in practice, so a fault-tolerant detection is applied to avoid the nodes’ reporting fault and also improve accuracy of tracking at the same time. The validity of our algorithms is demonstrated through simulation results.
Fereydooni, H.; Mojeddifar, S.
2017-09-01
This study introduced a different procedure to implement matched filtering algorithm (MF) on the ASTER images to obtain the distribution map of alteration minerals in the northwestern part of the Kerman Cenozoic Magmatic Arc (KCMA). This region contains many areas with porphyry copper mineralization such as Meiduk, Abdar, Kader, Godekolvari, Iju, Serenu, Chahfiroozeh and Parkam. Also argillization, sericitization and propylitization are the most common types of hydrothermal alteration in the area. Matched filtering results were provided for alteration minerals with a matched filtering score, called MF image. To identify the pixels which contain only one material (endmember), an appropriate threshold value should be used to the MF image. The chosen threshold classifies a MF image into background and target pixels. This article argues that the current thresholding process (the choice of a threshold) shows misclassification for MF image. To address the issue, this paper introduced the directed matched filtering (DMF) algorithm in which a spectral signature-based filter (SSF) was used instead of the thresholding process. SSF is a user-defined rule package which contains numeral descriptions about the spectral reflectance of alteration minerals. On the other hand, the spectral bands are defined by an upper and lower limit in SSF filter for each alteration minerals. SSF was developed for chlorite, kaolinite, alunite, and muscovite minerals to map alteration zones. The validation proved that, at first: selecting a contiguous range of MF values could not identify desirable results, second: unexpectedly, considerable frequency of pure pixels was observed in the MF scores less than threshold value. Also, the comparison between DMF results and field studies showed an accuracy of 88.51%.
Detection and analysis of microseismic events using a Matched Filtering Algorithm (MFA)
Caffagni, Enrico; Eaton, David W.; Jones, Joshua P.; van der Baan, Mirko
2016-07-01
A new Matched Filtering Algorithm (MFA) is proposed for detecting and analysing microseismic events recorded by downhole monitoring of hydraulic fracturing. This method requires a set of well-located template (`parent') events, which are obtained using conventional microseismic processing and selected on the basis of high signal-to-noise (S/N) ratio and representative spatial distribution of the recorded microseismicity. Detection and extraction of `child' events are based on stacked, multichannel cross-correlation of the continuous waveform data, using the parent events as reference signals. The location of a child event relative to its parent is determined using an automated process, by rotation of the multicomponent waveforms into the ray-centred co-ordinates of the parent and maximizing the energy of the stacked amplitude envelope within a search volume around the parent's hypocentre. After correction for geometrical spreading and attenuation, the relative magnitude of the child event is obtained automatically using the ratio of stacked envelope peak with respect to its parent. Since only a small number of parent events require interactive analysis such as picking P- and S-wave arrivals, the MFA approach offers the potential for significant reduction in effort for downhole microseismic processing. Our algorithm also facilitates the analysis of single-phase child events, that is, microseismic events for which only one of the S- or P-wave arrivals is evident due to unfavourable S/N conditions. A real-data example using microseismic monitoring data from four stages of an open-hole slickwater hydraulic fracture treatment in western Canada demonstrates that a sparse set of parents (in this case, 4.6 per cent of the originally located events) yields a significant (more than fourfold increase) in the number of located events compared with the original catalogue. Moreover, analysis of the new MFA catalogue suggests that this approach leads to more robust interpretation
一种改进的均值滤波算法%A MODIFIED AVERAGE FILTERING ALGORITHM
Institute of Scientific and Technical Information of China (English)
朱士虎; 游春霞
2013-01-01
针对均值滤波在抑制噪声的过程中会损失图像的边缘等细节信息从而导致整幅图像模糊的问题，提出一种均值滤波改进算法。算法中局部窗口内中心像素灰度均值的计算既考虑了窗口内各像素与中心像素间的灰度值差异，又顾及了窗口内各像素与中心像素间的距离。实验结果表明，该算法能有效去除噪声，较好地保留图像边缘细节，相比传统均值滤波和自适应均值滤波算法有更好的去噪能力。%Details of image are broken by mean filter in image processing , and consequently the image turns out to be blurry .In light of this, we propose a modified average filtering algorithm .In the algorithm, the computation of gray averaging value of central pixel in local window considers both the gray value difference and the spatial distance between the central pixel and other neighbouring pixels in current local window.Experimental results show that the presented algorithm can effectively remove Gaussian noise as well as preserving the edge details of the image well .It is superior to tradition mean filter and adaptive averaging filter algorithms in de-noise capability .
Directory of Open Access Journals (Sweden)
Hao Ye
2015-11-01
Full Text Available Precision medicine or personalized medicine has been proposed as a modernized and promising medical strategy. Genetic variants of patients are the key information for implementation of precision medicine. Next-generation sequencing (NGS is an emerging technology for deciphering genetic variants. Alignment of raw reads to a reference genome is one of the key steps in NGS data analysis. Many algorithms have been developed for alignment of short read sequences since 2008. Users have to make a decision on which alignment algorithm to use in their studies. Selection of the right alignment algorithm determines not only the alignment algorithm but also the set of suitable parameters to be used by the algorithm. Understanding these algorithms helps in selecting the appropriate alignment algorithm for different applications in precision medicine. Here, we review current available algorithms and their major strategies such as seed-and-extend and q-gram filter. We also discuss the challenges in current alignment algorithms, including alignment in multiple repeated regions, long reads alignment and alignment facilitated with known genetic variants.
协同过滤推荐算法综述%Survey of Collaborative Filtering Recommedation Algorithm
Institute of Scientific and Technical Information of China (English)
黄正
2012-01-01
Recommendation system is one of the most important technologies in E-commerce. Collaborative filtering is the most widely used and the most successful recommendation technology. This paper first introduces the basic concept and principle of collaborative filtering. And then, this paper summarizes the key problems and related solutions of the collaborative filtering recommendation algorithm. Finally, this paper introduces the collaborative filtering recommendation algorithm need to be further solved problems and possible development direction.%推荐系统是电子商务系统中最重要的技术之一,协同过滤推荐技术是目前应用最广泛和最成功的推荐技术.本文首先介绍了协同过滤的基本概念和原理,然后总结了协同过滤推荐算法中的关键问题和相关解决方案,最后介绍了协同过滤推荐算法需要进一步解决的问题和可能的发展方向.
Ilyas, Muhammad; Hong, Beomjin; Cho, Kuk; Baeg, Seung-Ho; Park, Sangdeok
2016-05-23
This paper provides algorithms to fuse relative and absolute microelectromechanical systems (MEMS) navigation sensors, suitable for micro planetary rovers, to provide a more accurate estimation of navigation information, specifically, attitude and position. Planetary rovers have extremely slow speed (~1 cm/s) and lack conventional navigation sensors/systems, hence the general methods of terrestrial navigation may not be applicable to these applications. While relative attitude and position can be tracked in a way similar to those for ground robots, absolute navigation information is hard to achieve on a remote celestial body, like Moon or Mars, in contrast to terrestrial applications. In this study, two absolute attitude estimation algorithms were developed and compared for accuracy and robustness. The estimated absolute attitude was fused with the relative attitude sensors in a framework of nonlinear filters. The nonlinear Extended Kalman filter (EKF) and Unscented Kalman filter (UKF) were compared in pursuit of better accuracy and reliability in this nonlinear estimation problem, using only on-board low cost MEMS sensors. Experimental results confirmed the viability of the proposed algorithms and the sensor suite, for low cost and low weight micro planetary rovers. It is demonstrated that integrating the relative and absolute navigation MEMS sensors reduces the navigation errors to the desired level.
Directory of Open Access Journals (Sweden)
Muhammad Ilyas
2016-05-01
Full Text Available This paper provides algorithms to fuse relative and absolute microelectromechanical systems (MEMS navigation sensors, suitable for micro planetary rovers, to provide a more accurate estimation of navigation information, specifically, attitude and position. Planetary rovers have extremely slow speed (~1 cm/s and lack conventional navigation sensors/systems, hence the general methods of terrestrial navigation may not be applicable to these applications. While relative attitude and position can be tracked in a way similar to those for ground robots, absolute navigation information is hard to achieve on a remote celestial body, like Moon or Mars, in contrast to terrestrial applications. In this study, two absolute attitude estimation algorithms were developed and compared for accuracy and robustness. The estimated absolute attitude was fused with the relative attitude sensors in a framework of nonlinear filters. The nonlinear Extended Kalman filter (EKF and Unscented Kalman filter (UKF were compared in pursuit of better accuracy and reliability in this nonlinear estimation problem, using only on-board low cost MEMS sensors. Experimental results confirmed the viability of the proposed algorithms and the sensor suite, for low cost and low weight micro planetary rovers. It is demonstrated that integrating the relative and absolute navigation MEMS sensors reduces the navigation errors to the desired level.
Ilyas, Muhammad; Hong, Beomjin; Cho, Kuk; Baeg, Seung-Ho; Park, Sangdeok
2016-01-01
This paper provides algorithms to fuse relative and absolute microelectromechanical systems (MEMS) navigation sensors, suitable for micro planetary rovers, to provide a more accurate estimation of navigation information, specifically, attitude and position. Planetary rovers have extremely slow speed (~1 cm/s) and lack conventional navigation sensors/systems, hence the general methods of terrestrial navigation may not be applicable to these applications. While relative attitude and position can be tracked in a way similar to those for ground robots, absolute navigation information is hard to achieve on a remote celestial body, like Moon or Mars, in contrast to terrestrial applications. In this study, two absolute attitude estimation algorithms were developed and compared for accuracy and robustness. The estimated absolute attitude was fused with the relative attitude sensors in a framework of nonlinear filters. The nonlinear Extended Kalman filter (EKF) and Unscented Kalman filter (UKF) were compared in pursuit of better accuracy and reliability in this nonlinear estimation problem, using only on-board low cost MEMS sensors. Experimental results confirmed the viability of the proposed algorithms and the sensor suite, for low cost and low weight micro planetary rovers. It is demonstrated that integrating the relative and absolute navigation MEMS sensors reduces the navigation errors to the desired level. PMID:27223293
基于SWGPSO算法的多序列比对%Multiple Sequence Alignment Based on SWGPSO Algorithm
Institute of Scientific and Technical Information of China (English)
徐小俊; 雷秀娟; 郭玲
2011-01-01
In this paper, a new method of getting inertia weight, Subsection Weight(SW) is proposed in order to solve the Particle Swarm Optimization(PSO) disadvantages which are likely to fall into local optimum and slow converge. The diversity of swarm increases at the prophase and the convergence is accelerated in the later period. Meanwhile, the combination of SW and GB can improve the evolutionary equation of PSO and makes it perform better. Experimental result shows that the algorithm can effectively avoid converging too early and increase the precision in solving multiple sequence alignment.%针对粒子群优化(PSO)易陷入局部最优、收敛速度慢的现象,提出一种新的惯性权重取值方法--分段取值惯性权重(SW)方法.该方法在算法前期增加粒子多样性,后期加速算法收敛.针对PSO仅使用2个最优值寻优的问题,引入第3个最优值GB,将SW与GB结合,改进PSO的进化方程.实验结果表明,该算法解决多序列比对问题时,可以有效地避免算法早熟,并提高解的精度.
Two algorithms for auto alignment in rocking base of SINS%捷联惯导晃动基座自对准算法比较
Institute of Scientific and Technical Information of China (English)
黄春梅; 孙晓慧; 许永龙; 于硕
2013-01-01
为了提高晃动载体的初始对准精度，分别采用了卡尔曼滤波法和 H∞滤波法。高斯白噪声和随机晃动的条件下进行两种算法的仿真研究，结果表明，高斯白噪声条件下，两者的滤波效果都很好，但在加入基座周期性晃动时，卡尔曼滤波出现了明显的发散现象，H∞滤波表现出了更好的稳定性。%Both Kalman Filter and H ∞ Filter are applied to improve the initial alignment accuracy .The two filters are simulated under conditions of white Gaussian noise and periodic rocking base respectively .The results show that both filters work well under white Gaussian noise but there is a obvious divergence phenomenon in Kalman Filter w hile H ∞ Filter remains stable w hen periodic rocking base noise is added .
Fast global sequence alignment technique
Bonny, Mohamed Talal
2011-11-01
Bioinformatics database is growing exponentially in size. Processing these large amount of data may take hours of time even if super computers are used. One of the most important processing tool in Bioinformatics is sequence alignment. We introduce fast alignment algorithm, called \\'Alignment By Scanning\\' (ABS), to provide an approximate alignment of two DNA sequences. We compare our algorithm with the wellknown sequence alignment algorithms, the \\'GAP\\' (which is heuristic) and the \\'Needleman-Wunsch\\' (which is optimal). The proposed algorithm achieves up to 51% enhancement in alignment score when it is compared with the GAP Algorithm. The evaluations are conducted using different lengths of DNA sequences. © 2011 IEEE.
Energy Technology Data Exchange (ETDEWEB)
Chatziioannou, A.; Qi, J.; Moore, A.; Annala, A.; Nguyen, K.; Leahy, R.M.; Cherry, S.R.
2000-01-01
We have evaluated the performance of two three dimensional reconstruction algorithms with data acquired from microPET, a high resolution tomograph dedicated to small animal imaging. The first was a linear filtered-backprojection algorithm (FBP) with reprojection of the missing data and the second was a statistical maximum-aposteriori probability algorithm (MAP). The two algorithms were evaluated in terms of their resolution performance, both in phantoms and in vivo. Sixty independent realizations of a phantom simulating the brain of a baby monkey were acquired, each containing 3 million counts. Each of these realizations was reconstructed independently with both algorithms. The ensemble of the sixty reconstructed realizations was used to estimate the standard deviation as a measure of the noise for each reconstruction algorithm. More detail was recovered in the MAP reconstruction without an increase in noise relative to FBP. Studies in a simple cylindrical compartment phantom demonstrated improved recovery of known activity ratios with MAP. Finally in vivo studies also demonstrated a clear improvement in spatial resolution using the MAP algorithm. The quantitative accuracy of the MAP reconstruction was also evaluated by comparison with autoradiography and direct well counting of tissue samples and was shown to be superior.
A New Gaussian Noise Filtering Algorithm%一种新型高斯噪声滤波算法
Institute of Scientific and Technical Information of China (English)
王小兵; 孙久运
2011-01-01
In order to filter the Gaussian noise of digital image more effectively,a new filtering algorithm was proposed.Firstly,the image which contains Gaussian noise was decomposed two-dimensional wavelet,obtaining high frequency and low frequency wavelet coefficient.Secondly,retain the low-frequency wavelet coefficient unchanged,at the same time the high-frequency wavelet coefficient was conducted wiener filtering,the wavelet coefficients were reconstructed.Thirdly,the reconstruction image was implemented multi-scale wavelet decomposition,setting new threshold discriminant function so as to weaken unimportant decomposition coefficients.Finally,wavelet decomposition coefficients were reconstructed.By using this filtering algorithm,wiener filtering,wavelet threshold value method and average filtering on Gaussian noise denoising processing.The experiments show that PSNR value of the filtering algorithm is much higher than the other three methods.%为了更有效滤除数字图像中的高斯噪声,提出了一种新型滤波算法.该算法首先将含有高斯噪声的图像进行二维小波分解,得到高频和低频小波分解系数;然后保留低频小波系数不变,对高频小波系数通过维纳滤波器进行滤波,并进行小波系数重构;最后将重构图像进行多尺度小波分解,通过设定新的阈值和判别函数,弱化不重要的小波分解系数,并进行小波分解系数重构.分别采用该滤波算法、维纳滤波、小波阈值法以及均值滤波进行高斯噪声滤除处理,试验证明该滤波算法去噪后图像的PSNR值明显高于其他三种方法.
Institute of Scientific and Technical Information of China (English)
Han Wenhua; Que Peiwen
2006-01-01
With the widespread application and fast development of gas and oil pipeline network in China, the pipeline inspection technology has been used more extensively. The magnetic flux leakage (MFL) method has established itself as the most widely used in-line inspection technique for the evaluation of gas and oil pipelines. The MFL data obtained from seamless pipeline inspection is usually contaminated by the seamless pipe noise (SPN). SPN can in some cases completely mask MFL signals from certain type of defects,and therefore considerably reduces the detectability of the defect signals. In this paper, a new de-noising algorithm called wavelet domain adaptive filtering is proposed for removing the SPN contained in the MFL data. The new algorithm results from combining the wavelet transform with the adaptive filtering technique. Results from application of the proposed algorithm to the MFL data from field tests show that the proposed algorithm has good performance and considerably improves the detectability of the defect signals in the MFL data.
Optimal design and performance verification of a broadband waveguide filter using ANN-GA algorithm
Directory of Open Access Journals (Sweden)
Manidipa Nath
2013-09-01
Full Text Available In this work design and optimization of EBGstructure having multiple dielectric posts uniformly placed insidea rectangular waveguide is done to extract filter responses.Frequency response of BPF configuration using trained ANNmodel of multipost rectangular waveguide are studied andoptimized using GA. The geometrical and positional dimensionof post parameters are varied in accordance to the requirementof reflectance and transmittance of the filter.
粒子群优化算法在传递对准中的应用%Application of particle swarm optimization algorithm in transfer alignment
Institute of Scientific and Technical Information of China (English)
夏家和; 秦永元; 贾继超
2009-01-01
A PSO(particle swarm optimization) algorithm-based transfer alignment method is presented. The transfer alignment requirement and the relation between the master inertial sensors and slave inertial sensors are analyzed. The transfer alignment problem is treated as a parameter optimization problem, and the PSO algorithm-based alignment mathematics model is given. The transfer alignment optimization function is defined, and the PSO algorithm is introduced. The PSO algorithm is employed to search the global minima, then the misalignment can be estimated. The algorithm is validated by simulation. The heading error can be <0.1° under the simulation condition that the gyro's accuracy is 0.1 (°)/h. The algorithm is greatly affected by the maneuver as other alignment methods. Attitude maneuver is usually needed to increase the gyro's signal-to-noise rate.%给出了一种基于粒子群优化算法的捷联惯导传递对准算法.简单分析了传递对准任务要求和主子惯导惯性器件输出之间的关系,将传递对准问题作为参数优化问题进行求解,给出了基于粒子群优化算法进行传递对准的数学模型.定义了传递对准的优化目标函数,介绍了粒子群优化算法及其应用于传递对准的具体算法设置.用粒子群优化算法求解目标函数的最小值,可获得主子惯导之间的失准角,进行一次校正即可完成传递对准过程.通过计算机仿真对算法进行了验证分析,在仿真条件下(陀螺精度为0.1°/h),能达到方位0.1°的精度.与其他对准算法一样,算法受载体机动条件的影响较大,一般需要姿态机动来提高陀螺的信噪比.
Fast alignment algorithm of inertial fixed frame in quasi-static environment%伪静态环境凝固惯性系快速对准算法
Institute of Scientific and Technical Information of China (English)
刘学俊; 李永涛
2014-01-01
惯性导航系统在开始工作时需要进行初始对准从而确定初始姿态。提出了一种与经典的对准算法如陀螺罗经或卡尔曼滤波技术不同的凝固惯性系快速（IF3）对准算法。可在任意初始误差条件下进行对准，且能适应高频扰动环境。将姿态矩阵分解成地球自转、惯性速率和对准矩阵三个部分。对准矩阵依靠两组分别处于不同惯性系里的观测向量确定。通过采用前置平滑滤波、层叠采样和二重积分技术，对准精度显著改善。在载车发动机怠速运行和人员上下车扰动条件下，60 s对准误差优于1 mil (1)，180 s对准误差优于0.6 mil(1)，300 s对准误差优于0.4 mil(1)。实验结果证明了IF3对准算法的快速性、准确性和鲁棒性。%An initial alignment is needed to determine the initial attitude when inertial navigation system(INS) start to work. In this paper, an inertial fixed frame fast(IF3) alignment algorithm is devised, in contrast to the classic alignment algorithms, such as gyrocompassing and Kalman filtering techniques. Unlike classic techniques, the IF3 alignment is effective with any initial attitude error, as well as high frequency vibrations. The estimator is based on decomposing the attitude matrix into separate earth motion, inertial rate, and alignment matrix. And the alignment matrix is determined by two sets of observation vectors in different inertial fixed frames. By smooth pre-filtering, interleaved sampling and double integrating the observation vectors, it is shown that the precision of attitude estimates is improved. The IF3 alignment heading error is less than 1 mil(1) within 60 s, 0.6 mil(1) within 180 s, and 0.4 mil(1) within 300 s under the condition that the vehicle engine is running at idle and intended introducing the perturbation caused by a person’s getting on and off the vehicle. Experiment tests favorably demonstrate its rapidness, accuracy and
REALIZATION OF GPS／SST／SINS INTEGRATED NAVIGATION FILTER ALGORITHM FOR BALLISTIC MISSILE
Institute of Scientific and Technical Information of China (English)
KANGGuo-hua; LIUJian-ye; ZHUYan-hua; XIONGZhi
2005-01-01
Considering the domestic single navigation system of the ballistic missile, a new filter method is presented. The method integrates the information of the strapdown star tracker (SST) attitude, the position and the velocity of a high speed GPS with a strapdown inertial navigation system (SINS) information into one filter, thus improving the precision of the attitude, the velocity, and the position. Finally, the GPS/SST/SINS simulation platfornt is designed. Simulation results demonstrate that the filter is robust and reliable, and the precision rises to the comparative level abroad.
Offline Performance of the Filter Bank EEW Algorithm in the 2014 M6.0 South Napa Earthquake
Meier, M. A.; Heaton, T. H.; Clinton, J. F.
2014-12-01
Medium size events like the M6.0 South Napa earthquake are very challenging for EEW: the damage such events produce can be severe, but it is generally confined to relatively small zones around the epicenter and the shaking duration is short. This leaves a very short window for timely EEW alerts. Algorithms that wait for several stations to trigger before sending out EEW alerts are typically not fast enough for these kind of events because their blind zone (the zone where strong ground motions start before the warnings arrive) typically covers all or most of the area that experiences strong ground motions. At the same time, single station algorithms are often too unreliable to provide useful alerts. The filter bank EEW algorithm is a new algorithm that is designed to provide maximally accurate and precise earthquake parameter estimates with minimum data input, with the goal of producing reliable EEW alerts when only a very small number of stations have been reached by the p-wave. It combines the strengths of single station and network based algorithms in that it starts parameter estimates as soon as 0.5 seconds of data are available from the first station, but then perpetually incorporates additional data from the same or from any number of other stations. The algorithm analyzes the time dependent frequency content of real time waveforms with a filter bank. It then uses an extensive training data set to find earthquake records from the past that have had similar frequency content at a given time since the p-wave onset. The source parameters of the most similar events are used to parameterize a likelihood function for the source parameters of the ongoing event, which can then be maximized to find the most likely parameter estimates. Our preliminary results show that the filter bank EEW algorithm correctly estimated the magnitude of the South Napa earthquake to be ~M6 with only 1 second worth of data at the nearest station to the epicenter. This estimate is then
Model-based x-ray energy spectrum estimation algorithm from CT scanning data with spectrum filter
Li, Lei; Wang, Lin-Yuan; Yan, Bin
2016-10-01
With the development of technology, the traditional X-ray CT can't meet the modern medical and industry needs for component distinguish and identification. This is due to the inconsistency of X-ray imaging system and reconstruction algorithm. In the current CT systems, X-ray spectrum produced by X-ray source is continuous in energy range determined by tube voltage and energy filter, and the attenuation coefficient of object is varied with the X-ray energy. So the distribution of X-ray energy spectrum plays an important role for beam-hardening correction, dual energy CT image reconstruction or dose calculation. However, due to high ill-condition and ill-posed feature of system equations of transmission measurement data, statistical fluctuations of X ray quantum and noise pollution, it is very hard to get stable and accurate spectrum estimation using existing methods. In this paper, a model-based X-ray energy spectrum estimation method from CT scanning data with energy spectrum filter is proposed. First, transmission measurement data were accurately acquired by CT scan and measurement using phantoms with different energy spectrum filter. Second, a physical meaningful X-ray tube spectrum model was established with weighted gaussian functions and priori information such as continuity of bremsstrahlung and specificity of characteristic emission and estimation information of average attenuation coefficient. The parameter in model was optimized to get the best estimation result for filtered spectrum. Finally, the original energy spectrum was reconstructed from filtered spectrum estimation with filter priori information. Experimental results demonstrate that the stability and accuracy of X ray energy spectrum estimation using the proposed method are improved significantly.
Tang, Shaojie; Tang, Xiangyang
2016-03-01
Axial cone beam (CB) computed tomography (CT) reconstruction is still the most desirable in clinical applications. As the potential candidates with analytic form for the task, the back projection-filtration (BPF) and the derivative backprojection filtered (DBPF) algorithms, in which Hilbert filtering is the common algorithmic feature, are originally derived for exact helical and axial reconstruction from CB and fan beam projection data, respectively. These two algorithms have been heuristically extended for axial CB reconstruction via adoption of virtual PI-line segments. Unfortunately, however, streak artifacts are induced along the Hilbert filtering direction, since these algorithms are no longer accurate on the virtual PI-line segments. We have proposed to cascade the extended BPF/DBPF algorithm with orthogonal butterfly filtering for image reconstruction (namely axial CB-BPP/DBPF cascaded with orthogonal butterfly filtering), in which the orientation-specific artifacts caused by post-BP Hilbert transform can be eliminated, at a possible expense of losing the BPF/DBPF's capability of dealing with projection data truncation. Our preliminary results have shown that this is not the case in practice. Hence, in this work, we carry out an algorithmic analysis and experimental study to investigate the performance of the axial CB-BPP/DBPF cascaded with adequately oriented orthogonal butterfly filtering for three-dimensional (3D) reconstruction in region of interest (ROI).
National Research Council Canada - National Science Library
Zheng, Jian; Lu, Pei-Rong; Xiang, Dehui; Dai, Ya-Kang; Liu, Zhao-Bang; Kuai, Duo-Jie; Xue, Hui; Yang, Yue-Tao
2013-01-01
.... By this step, blood vessels of different widths are significantly enhanced. Then, we adopt a nonlocal mean filter to suppress the noise of enhanced image and maintain the vessel information at the same time...
National Research Council Canada - National Science Library
Zheng, Jian; Lu, Pei-Rong; Xiang, Dehui; Dai, Ya-Kang; Liu, Zhao-Bang; Kuai, Duo-Jie; Xue, Hui; Yang, Yue-Tao
2013-01-01
.... By this step, blood vessels of different widths are significantly enhanced. Then, we adopt a nonlocal mean filter to suppress the noise of enhanced image and maintain the vessel information at the same time...
Jian Zheng; Pei-Rong Lu; Dehui Xiang; Ya-Kang Dai; Zhao-Bang Liu; Duo-Jie Kuai; Hui Xue; Yue-Tao Yang
2013-01-01
We propose a new method to enhance and extract the retinal vessels. First, we employ a multiscale Hessian-based filter to compute the maximum response of vessel likeness function for each pixel. By this step, blood vessels of different widths are significantly enhanced. Then, we adopt a nonlocal mean filter to suppress the noise of enhanced image and maintain the vessel information at the same time. After that, a radial gradient symmetry transformation is adopted to suppress the nonvessel str...
Directory of Open Access Journals (Sweden)
Abhijit Chandra
2012-10-01
Full Text Available In recent times, system designers are becoming very much apprehensive in reducing the structural complexity of digital systems with which they deal in practice. However, the uncontrolled minimization of any digital hardware always leads to significant deterioration of system performance making it incompatible for use in any practical system. As proper trade-off is inevitably essential between achievable performance and required hardware, researchers have sought a number of artificially intelligent optimization techniques to solve it out. Since such a technique generally involves variety of constructional alternatives, appropriate use of correct option demands justified attention. Numerous evolutionary computation techniques, being a branch of biologically inspired optimization process, are being increasingly used for a number of signal processing applications of late. This paper throws enough light to select the most suitable mutation strategy of Differential Evolution (DE algorithm for efficient design of multiplier-less low-pass finite duration impulse response (FIR filter. Computationally efficient mutation scheme has been identified by observing convergence behavior and error histogram plot for different alternatives. Performance of the designed filter has been compared in terms of its magnitude response and the requirement of various hardware blocks for four different lengths of the filter. Consequently the name of the most favorable mutation rule has been suggested upon analyzing all the factors. Finally the supremacy of our proposed design has been established by comparing its performance with that of other state-of-the-art multiplier-less low-pass FIR filters.
Acceleration of the shiftable O(1) algorithm for bilateral filtering and non-local means
Chaudhury, Kunal N
2012-01-01
A direct implementation of the bilateral filter [1] requires O(\\sigma_s^2) operations per pixel, where \\sigma_s is the (effective) width of the spatial kernel. A fast implementation of the bilateral filter was recently proposed in [2] that required O(1) operations per pixel with respect to \\sigma_s. This was done by using trigonometric functions for the range kernel of the bilateral filter, and by exploiting their so-called shiftability property. In particular, a fast implementation of the Gaussian bilateral filter was realized by approximating the Gaussian range kernel using raised cosines. Later, it was demonstrated in [3] that this idea could be extended to a larger class of filters, including the popular non-local means filter [4]. As already observed in [2], a flip side of this approach was that the run time depended on the width \\sigma_r of the range kernel. For an image with (local) intensity variations in the range [0,T], the run time scaled as O(T^2/\\sigma^2_r) with \\sigma_r. This made it difficult t...
FANUC CNC automatic alignment algorithm%FANUC 加工中心五点碰数自动找正算法的研究
Institute of Scientific and Technical Information of China (English)
钟如全
2014-01-01
针对传统定位加工技术存在的问题，提出了五点碰数自动找正的方法。研究五点碰数自动找正方法的算法，从而实现工件角度和位置的找正，省去了人工找正和设计精密夹具。此方法保证了产品对刀及找正的准确性、可靠性和高效性，具有良好的应用前景。%Processing technology for the traditional positioning problems ,put forward the “five-point touch a few”automatic align-ment method .Study the“five-point touch a few” automatic alignment method algorithm ,the angle and position of the workpiece in order to achieve the alignment ,eliminating the need for manual alignment and design of precision fixtures .This method ensures that the product is on the knife and look for the accuracy ,reliability,efficiency.Have a good prospect.
Research of Dijkstra algorithm in protein sequence alignment%Dijkstra算法在蛋白质序列比对中的研究
Institute of Scientific and Technical Information of China (English)
祁长红; 郁芸; 韩新焕
2012-01-01
A sequence alignment algorithm based on Dijkstra algorithm is put forward, which is mainly used to seek the shortest path while the problem of sequence alignment can be transformed into a problem to look for the shortest path in directed acyclic graph. For a small amount of sequences, Dijkstra algorithm is easier to seek the optimal solution. For multiple sequences alignment, the shortest path seeked in the Af-dimensional space can be obtained in the two-dimensional space. It can be proved that the problem is greatly simplified and the sub-optimal solution can be obtained.%提出一种基于Dijkstra算法的序列比对方法,该算法主要用于求最短路径,而序列比对可以转化为在有向无环图中寻找最短路径问题.对于少量序列比对,使用该算法可以求出最优解.对于多序列比对,可将在N维空间求解最短路径问题转化为在二维空间求解最短路径.该算法可以简化问题复杂度,能求得相对最优解.
Zeng, Bangze; Zhu, Youpan; Li, Zemin; Hu, Dechao; Luo, Lin; Zhao, Deli; Huang, Juan
2014-11-01
Duo to infrared image with low contrast, big noise and unclear visual effect, target is very difficult to observed and identified. This paper presents an improved infrared image detail enhancement algorithm based on adaptive histogram statistical stretching and gradient filtering (AHSS-GF). Based on the fact that the human eyes are very sensitive to the edges and lines, the author proposed to extract the details and textures by using the gradient filtering. New histogram could be acquired by calculating the sum of original histogram based on fixed window. With the minimum value for cut-off point, author carried on histogram statistical stretching. After the proper weights given to the details and background, the detail-enhanced results could be acquired finally. The results indicate image contrast could be improved and the details and textures could be enhanced effectively as well.
A Kalman filter-based short baseline RTK algorithm for single-frequency combination of GPS and BDS.
Zhao, Sihao; Cui, Xiaowei; Guan, Feng; Lu, Mingquan
2014-08-20
The emerging Global Navigation Satellite Systems (GNSS) including the BeiDou Navigation Satellite System (BDS) offer more visible satellites for positioning users. To employ those new satellites in a real-time kinematic (RTK) algorithm to enhance positioning precision and availability, a data processing model for the dual constellation of GPS and BDS is proposed and analyzed. A Kalman filter-based algorithm is developed to estimate the float ambiguities for short baseline scenarios. The entire work process of the high-precision algorithm based on the proposed model is deeply investigated in detail. The model is validated with real GPS and BDS data recorded from one zero and two short baseline experiments. Results show that the proposed algorithm can generate fixed baseline output with the same precision level as that of either a single GPS or BDS RTK algorithm. The significantly improved fixed rate and time to first fix of the proposed method demonstrates a better availability and effectiveness on processing multi-GNSSs.
A Kalman Filter-Based Short Baseline RTK Algorithm for Single-Frequency Combination of GPS and BDS
Directory of Open Access Journals (Sweden)
Sihao Zhao
2014-08-01
Full Text Available The emerging Global Navigation Satellite Systems (GNSS including the BeiDou Navigation Satellite System (BDS offer more visible satellites for positioning users. To employ those new satellites in a real-time kinematic (RTK algorithm to enhance positioning precision and availability, a data processing model for the dual constellation of GPS and BDS is proposed and analyzed. A Kalman filter-based algorithm is developed to estimate the float ambiguities for short baseline scenarios. The entire work process of the high-precision algorithm based on the proposed model is deeply investigated in detail. The model is validated with real GPS and BDS data recorded from one zero and two short baseline experiments. Results show that the proposed algorithm can generate fixed baseline output with the same precision level as that of either a single GPS or BDS RTK algorithm. The significantly improved fixed rate and time to first fix of the proposed method demonstrates a better availability and effectiveness on processing multi-GNSSs.
基于Hadoop平台协同过滤推荐算法①%Hadoop-Based Collaborative Filtering Recommendation Algorithm
Institute of Scientific and Technical Information of China (English)
杨志文; 刘波
2013-01-01
In order to solve data sparsity and scalability of the Collaborative Filtering (CF) recommendation algorithm when the volume of the dataset is very large. After deeply analyzing the Hadoop distributed computing platform and the characteristic of Collaborative Filtering recommendation algorithm, the paper propose a optimization scheme on Hadoop platform. The experimental results show that it can effectively improve the execution efficiency of Collaborative Filtering recommendation algorithm in large data size, when it is realized by MapReduce with Hbase database on the Hadoop platform.And then, it contribute to build one recommendation system which is low cost, high-performance and dynamic scalability.% 针对协同过滤推荐算法在数据稀疏性及在大数据规模下系统可扩展性的两个问题，在分析研究 Hadoop分布式平台与协同过滤推荐算法后，提出了一种基于Hadoop平台实现协同过滤推荐算法的优化方案。实验证明，在Hadoop平台上通过MapReduce结合Hbase数据库实现算法，能够有效地提高协同过滤推荐算法在大数据规模下的执行效率，从而能够进一步地搭建低成本高性能、动态扩展的分布式推荐引擎。
Directory of Open Access Journals (Sweden)
T.S. Udhaya Suriya
2014-03-01
Full Text Available The MAC architecture is used in real time digital s ignal processing and multimedia information processing which requires high throughput. A novel method to estimate the transition activity at the nodes of a multiplier accumulator architecture based on modified booth algorithm implementing finite impulse response filter is prop osed in this paper. The input signals are described by a stationary Gaussian process and the transition activity per bit of a signal word is modeled according to the dual bit type (DBT model. This estimation is based on the mathematical formulation by multiplexing mechanism on the breakpoints of the DBT model.
Image denoising algorithm of refuge chamber by combining wavelet transform and bilateral filtering
Institute of Scientific and Technical Information of China (English)
Zhang Weipeng
2013-01-01
In order to preferably identify infrared image of refuge chamber,reduce image noises of refuge chamber and retain more image details,we propose the method of combining two-dimensional discrete wavelet transform and bilateral denoising.First,the wavelet transform is adopted to decompose the image of refuge chamber,of which low frequency component remains unchanged.Then,three high-frequency components are treated by bilateral filtering,and the image is reconstructed.The result shows that the combination of bilateral filtering and wavelet transform for image denoising can better retain the details which are included in the image,while providing better visual effect.This is superior to using either bilateral filtering or wavelet transform alone.It is useful for perfecting emergency refuge system of coal.
Ranwez, Vincent
2016-01-01
Background Multiple sequence alignment (MSA) is a crucial step in many molecular analyses and many MSA tools have been developed. Most of them use a greedy approach to construct a first alignment that is then refined by optimizing the sum of pair score (SP-score). The SP-score estimation is thus a bottleneck for most MSA tools since it is repeatedly required and is time consuming. Results Given an alignment of n sequences and L sites, I introduce here optimized solutions reaching O(nL) time complexity for affine gap cost, instead of O(n2L), which are easy to implement. PMID:27505054
A digital algorithm for spectral deconvolution with noise filtering and peak picking: NOFIPP-DECON
Edwards, T. R.; Settle, G. L.; Knight, R. D.
1975-01-01
Noise-filtering, peak-picking deconvolution software incorporates multiple convoluted convolute integers and multiparameter optimization pattern search. The two theories are described and three aspects of the software package are discussed in detail. Noise-filtering deconvolution was applied to a number of experimental cases ranging from noisy, nondispersive X-ray analyzer data to very noisy photoelectric polarimeter data. Comparisons were made with published infrared data, and a man-machine interactive language has evolved for assisting in very difficult cases. A modified version of the program is being used for routine preprocessing of mass spectral and gas chromatographic data.
Institute of Scientific and Technical Information of China (English)
WANG Ke; HUANG Zhi; ZHONG Zhihua
2014-01-01
Due to the large variations of environment with ever-changing background and vehicles with different shapes, colors and appearances, to implement a real-time on-board vehicle recognition system with high adaptability, efficiency and robustness in complicated environments, remains challenging. This paper introduces a simultaneous detection and tracking framework for robust on-board vehicle recognition based on monocular vision technology. The framework utilizes a novel layered machine learning and particle filter to build a multi-vehicle detection and tracking system. In the vehicle detection stage, a layered machine learning method is presented, which combines coarse-search and fine-search to obtain the target using the AdaBoost-based training algorithm. The pavement segmentation method based on characteristic similarity is proposed to estimate the most likely pavement area. Efficiency and accuracy are enhanced by restricting vehicle detection within the downsized area of pavement. In vehicle tracking stage, a multi-objective tracking algorithm based on target state management and particle filter is proposed. The proposed system is evaluated by roadway video captured in a variety of traffics, illumination, and weather conditions. The evaluating results show that, under conditions of proper illumination and clear vehicle appearance, the proposed system achieves 91.2% detection rate and 2.6% false detection rate. Experiments compared to typical algorithms show that, the presented algorithm reduces the false detection rate nearly by half at the cost of decreasing 2.7%–8.6% detection rate. This paper proposes a multi-vehicle detection and tracking system, which is promising for implementation in an on-board vehicle recognition system with high precision, strong robustness and low computational cost.
数字全息技术中散斑噪声滤波算法比较%Comparison of algorithms for filtering speckle noise in digital holography
Institute of Scientific and Technical Information of China (English)
潘云; 潘卫清; 晁明举
2011-01-01
In the recording process of digital holographic measurement, the hologram is easily polluted by speckle noise, which may decrease the resolution of the hologram. In addition, the reconstructed effect is seriously affected by speckle noise in digital reconstruction. Thus it is important to study the filtering speckle algorithms for digital hologram. The median filtering algorithm, Lee filtering algorithm, Kuan filtering algorithm and SUSAN filtering algorithm were introduced to filter the speckle noise in hologram and reconstructed image. Then these algorithms were compared. The results showed that the SUSAN filtering algorithm was better in digital holographic technology. The speckle noises were suppressed significantly and the information of reconstructed images were well maintained.%在数字全息测量记录过程中,其所记录的全息图易受到散斑噪声的污染造成分辨率下降,同时也严重影响数字全息再现的效果,因此研究适用于数字全息技术中散斑滤波的算法具有重要的实用价值.介绍了中值滤波、Lee滤波、Kuan滤波和SUSAN滤波这四种常用的散斑滤波算法,并将它们运用于数字全息实验所记录图像和数字再现图像的散斑噪声滤波处理中,然后对这四种算法的处理结果进行评价.结果表明,在数字全息技术中使用SUSAN滤波算法进行处理,既明显抑制了散斑噪声,又有效保证了再现图像信息的完整性.
Delay Estimator and Improved Proportionate Multi-Delay Adaptive Filtering Algorithm
Directory of Open Access Journals (Sweden)
E. Verteletskaya
2012-04-01
Full Text Available This paper pertains to speech and acoustic signal processing, and particularly to a determination of echo path delay and operation of echo cancellers. To cancel long echoes, the number of weights in a conventional adaptive filter must be large. The length of the adaptive filter will directly affect both the degree of accuracy and the convergence speed of the adaptation process. We present a new adaptive structure which is capable to deal with multiple dispersive echo paths. An adaptive filter according to the present invention includes means for storing an impulse response in a memory, the impulse response being indicative of the characteristics of a transmission line. It also includes a delay estimator for detecting ranges of samples within the impulse response having relatively large distribution of echo energy. These ranges of samples are being indicative of echoes on the transmission line. An adaptive filter has a plurality of weighted taps, each of the weighted taps having an associated tap weight value. A tap allocation/control circuit establishes the tap weight values in response to said detecting means so that only taps within the regions of relatively large distributions of echo energy are turned on. Thus, the convergence speed and the degree of estimation in the adaptation process can be improved.
Zhang, De-Jia
2009-07-01
With the fast development of Internet, many systems have emerged in e-commerce applications to support the product recommendation. Collaborative filtering is one of the most promising techniques in recommender systems, providing personalized recommendations to users based on their previously expressed preferences in the form of ratings and those of other similar users. In practice, with the adding of user and item scales, user-item ratings are becoming extremely sparsity and recommender systems utilizing traditional collaborative filtering are facing serious challenges. To address the issue, this paper presents an approach to compute item genre similarity, through mapping each item with a corresponding descriptive genre, and computing similarity between genres as similarity, then make basic predictions according to those similarities to lower sparsity of the user-item ratings. After that, item-based collaborative filtering steps are taken to generate predictions. Compared with previous methods, the presented collaborative filtering employs the item genre similarity can alleviate the sparsity issue in the recommender systems, and can improve accuracy of recommendation.
Hung, Che-Lun; Lin, Yu-Shiang; Lin, Chun-Yuan; Chung, Yeh-Ching; Chung, Yi-Fang
2015-10-01
For biological applications, sequence alignment is an important strategy to analyze DNA and protein sequences. Multiple sequence alignment is an essential methodology to study biological data, such as homology modeling, phylogenetic reconstruction and etc. However, multiple sequence alignment is a NP-hard problem. In the past decades, progressive approach has been proposed to successfully align multiple sequences by adopting iterative pairwise alignments. Due to rapid growth of the next generation sequencing technologies, a large number of sequences can be produced in a short period of time. When the problem instance is large, progressive alignment will be time consuming. Parallel computing is a suitable solution for such applications, and GPU is one of the important architectures for contemporary parallel computing researches. Therefore, we proposed a GPU version of ClustalW v2.0.11, called CUDA ClustalW v1.0, in this work. From the experiment results, it can be seen that the CUDA ClustalW v1.0 can achieve more than 33× speedups for overall execution time by comparing to ClustalW v2.0.11. Copyright © 2015 Elsevier Ltd. All rights reserved.
Directory of Open Access Journals (Sweden)
Wen-Chang Cheng
2012-12-01
Full Text Available In this paper we propose a robust lane detection and tracking method by combining particle filters with the particle swarm optimization method. This method mainly uses the particle filters to detect and track the local optimum of the lane model in the input image and then seeks the global optimal solution of the lane model by a particle swarm optimization method. The particle filter can effectively complete lane detection and tracking in complicated or variable lane environments. However, the result obtained is usually a local optimal system status rather than the global optimal system status. Thus, the particle swarm optimization method is used to further refine the global optimal system status in all system statuses. Since the particle swarm optimization method is a global optimization algorithm based on iterative computing, it can find the global optimal lane model by simulating the food finding way of fish school or insects under the mutual cooperation of all particles. In verification testing, the test environments included highways and ordinary roads as well as straight and curved lanes, uphill and downhill lanes, lane changes, etc. Our proposed method can complete the lane detection and tracking more accurately and effectively then existing options.
Cheng, Xuemin; Hao, Qun; Xie, Mengdi
2016-04-07
Video stabilization is an important technology for removing undesired motion in videos. This paper presents a comprehensive motion estimation method for electronic image stabilization techniques, integrating the speeded up robust features (SURF) algorithm, modified random sample consensus (RANSAC), and the Kalman filter, and also taking camera scaling and conventional camera translation and rotation into full consideration. Using SURF in sub-pixel space, feature points were located and then matched. The false matched points were removed by modified RANSAC. Global motion was estimated by using the feature points and modified cascading parameters, which reduced the accumulated errors in a series of frames and improved the peak signal to noise ratio (PSNR) by 8.2 dB. A specific Kalman filter model was established by considering the movement and scaling of scenes. Finally, video stabilization was achieved with filtered motion parameters using the modified adjacent frame compensation. The experimental results proved that the target images were stabilized even when the vibrating amplitudes of the video become increasingly large.
Jiang, Qingan; Wu, Wenqi; Jiang, Mingming; Li, Yun
2017-06-19
High-accuracy railway track surveying is essential for railway construction and maintenance. The traditional approaches based on total station equipment are not efficient enough since high precision surveying frequently needs static measurements. This paper proposes a new filtering and smoothing algorithm based on the IMU/odometer and landmarks integration for the railway track surveying. In order to overcome the difficulty of estimating too many error parameters with too few landmark observations, a new model with completely observable error states is established by combining error terms of the system. Based on covariance analysis, the analytical relationship between the railway track surveying accuracy requirements and equivalent gyro drifts including bias instability and random walk noise are established. Experiment results show that the accuracy of the new filtering and smoothing algorithm for railway track surveying can reach 1 mm (1σ) when using a Ring Laser Gyroscope (RLG)-based Inertial Measurement Unit (IMU) with gyro bias instability of 0.03°/h and random walk noise of 0.005 °h while control points of the track control network (CPIII) position observations are provided by the optical total station in about every 60 m interval. The proposed approach can satisfy at the same time the demands of high accuracy and work efficiency for railway track surveying.
Directory of Open Access Journals (Sweden)
Xin Li
2016-02-01
Full Text Available Wireless signal strength is susceptible to the phenomena of interference, jumping, and instability, which often appear in the positioning results based on Wi-Fi field strength fingerprint database technology for indoor positioning. Therefore, a Wi-Fi and PDR (pedestrian dead reckoning real-time fusion scheme is proposed in this paper to perform fusing calculation by adaptively determining the dynamic noise of a filtering system according to pedestrian movement (straight or turning, which can effectively restrain the jumping or accumulation phenomena of wireless positioning and the PDR error accumulation problem. Wi-Fi fingerprint matching typically requires a quite high computational burden: To reduce the computational complexity of this step, the affinity propagation clustering algorithm is adopted to cluster the fingerprint database and integrate the information of the position domain and signal domain of respective points. An experiment performed in a fourth-floor corridor at the School of Environment and Spatial Informatics, China University of Mining and Technology, shows that the traverse points of the clustered positioning system decrease by 65%–80%, which greatly improves the time efficiency. In terms of positioning accuracy, the average error is 4.09 m through the Wi-Fi positioning method. However, the positioning error can be reduced to 2.32 m after integration of the PDR algorithm with the adaptive noise extended Kalman filter (EKF.
Directory of Open Access Journals (Sweden)
Xin Li
2016-06-01
Full Text Available The problem of heading drift error using only low cost Micro-Electro-Mechanical (MEMS Inertial-Measurement-Unit (IMU has not been well solved. In this paper, a heading estimation method with real-time compensation based on Kalman filter has been proposed, abbreviated as KHD. For the KHD method, a unified heading error model is established for various predictable errors in magnetic compass for pedestrian navigation, and an effective method for solving the model parameters is proposed in the indoor environment with regular structure. In addition, error model parameters are solved by Kalman filtering algorithm with building geometry information in order to achieve real-time heading compensation. The experimental results show that the KHD method can not only effectively correct the original heading information, but also effectively inhibit the accumulation effect of positioning errors. The performance observed in a field experiment performed on the fourth floor of the School of Environmental Science and Spatial Informatics (SESSI building on the China University of Mining and Technology (CUMT campus confirms that apply KHD method to PDR(Pedestrian Dead Reckoning algorithm can reliably achieve meter-level positioning using a low cost MEMS IMU only.
Directory of Open Access Journals (Sweden)
Qingan Jiang
2017-06-01
Full Text Available High-accuracy railway track surveying is essential for railway construction and maintenance. The traditional approaches based on total station equipment are not efficient enough since high precision surveying frequently needs static measurements. This paper proposes a new filtering and smoothing algorithm based on the IMU/odometer and landmarks integration for the railway track surveying. In order to overcome the difficulty of estimating too many error parameters with too few landmark observations, a new model with completely observable error states is established by combining error terms of the system. Based on covariance analysis, the analytical relationship between the railway track surveying accuracy requirements and equivalent gyro drifts including bias instability and random walk noise are established. Experiment results show that the accuracy of the new filtering and smoothing algorithm for railway track surveying can reach 1 mm (1σ when using a Ring Laser Gyroscope (RLG-based Inertial Measurement Unit (IMU with gyro bias instability of 0.03°/h and random walk noise of 0.005 °h while control points of the track control network (CPIII position observations are provided by the optical total station in about every 60 m interval. The proposed approach can satisfy at the same time the demands of high accuracy and work efficiency for railway track surveying.
Meghoufel, Ali; Cloutier, Guy; Crevier-Denoix, Nathalie; de Guise, Jacques A
2011-03-01
The fiber bundle density (FBD) calculated from ultrasound B-scan images of the equine superficial digital flexor tendon (SDFT) can serve as an objective measurement to characterize the three metacarpal sites of normal SDFTs, and also to discriminate a healthy SDFT from an injured one. In this paper, we propose a shock filter algorithm for the thinning of hyper-echoic structures observed in B-scan images of the SDFT. This algorithm is further enhanced by applying closing morphological operations on filtered images to facilitate extraction and quantification of fiber bundle fascicles. The mean FBD values were calculated from a clinical B-scan image dataset of eight normal and five injured SDFTs. The FBD values measured at three different tendon sites in normal cases show a highest density on the proximal site (five cases out of eight) and a lowest value on the distal part (seven cases out of eight). The mean FBD values measured on the entire tendon from the whole B-scan image dataset show a significant difference between normal and injured SDFTs: 51 (±9) for the normal SDFTs and 39 (±7) for the injured ones (p = 0.004) . This difference likely indicates disruption of some fiber fascicle bundles where lesions occurred. To conclude, the potential of this imaging technique is shown to be efficient for anatomical structural SDFT characterizations, and opens the way to clinically identifying the integrity of SDFTs.
Labunets, Valeri G.; Labunets-Rundblad, Ekaterina V.; Astola, Jaakko T.
2001-12-01
Fast algorithms for a wide class of non-separable n-dimensional (nD) discrete unitary K-transforms (DKT) are introduced. They need less 1D DKTs than in the case of the classical radix-2 FFT-type approach. The method utilizes a decomposition of the nD K-transform into the product of a new nD discrete Radon transform and of a set of parallel/independ 1D K-transforms. If the nD K-transform has a separable kernel (e.g., the case of the discrete Fourier transform) our approach leads to decrease of multiplicative complexity by the factor of n comparing to the classical row/column separable approach. It is well known that an n-th order Volterra filter of one dimensional signal can be evaluated by an appropriate nD linear convolution. This work describes new superfast algorithm for Volterra filtering. New approach is based on the superfast discrete Radon and Nussbaumer polynomial transforms.
Institute of Scientific and Technical Information of China (English)
YU Zhi-jun; WEI Jian-ming; LIU Hai-tao
2009-01-01
Target tracking is one of the most important applications of wireless sensor networks. Optimized computation and energy dissipation are critical requirements to save the limited resource of sensor nodes. A new robust and energy-efficient collaborative target tracking framework is proposed in this article. After a target is detected, only one active cluster is responsible for the tracking task at each time step. The tracking algorithm is distributed by passing the sensing and computation operations from one cluster to another. An event-driven cluster reforming scheme is also proposed for balancing energy consumption among nodes. Observations from three cluster members are chosen and a new class of particle filter termed cost-reference particle filter (CRPF) is introduced to estimate the target motion at the cluster head. This CRPF method is quite robust for wireless sensor network tracking applications because it drops the strong assumptions of knowing the probability distributions of the system process and observation noises. In simulation experiments, the performance of the proposed collaborative target tracking algorithm is evaluated by the metrics of tracking precision and network energy consumption.
Directory of Open Access Journals (Sweden)
Offmann Bernard
2008-05-01
Full Text Available Abstract Background Distantly related proteins adopt and retain similar structural scaffolds despite length variations that could be as much as two-fold in some protein superfamilies. In this paper, we describe an analysis of indel regions that accommodate length variations amongst related proteins. We have developed an algorithm CUSP, to examine multi-membered PASS2 superfamily alignments to identify indel regions in an automated manner. Further, we have used the method to characterize the length, structural type and biochemical features of indels in related protein domains. Results CUSP, examines protein domain structural alignments to distinguish regions of conserved structure common to related proteins from structurally unconserved regions that vary in length and type of structure. On a non-redundant dataset of 353 domain superfamily alignments from PASS2, we find that 'length- deviant' protein superfamilies show > 30% length variation from their average domain length. 60% of additional lengths that occur in indels are short-length structures ( 15 residues in length. Structural types in indels also show class-specific trends. Conclusion The extent of length variation varies across different superfamilies and indels show class-specific trends for preferred lengths and structural types. Such indels of different lengths even within a single protein domain superfamily could have structural and functional consequences that drive their selection, underlying their importance in similarity detection and computational modelling. The availability of systematic algorithms, like CUSP, should enable decision making in a domain superfamily-specific manner.
Xu, Shaoping; Hu, Lingyan; Yang, Xiaohui
2016-01-01
The performance of conventional denoising algorithms is usually controlled by one or several parameters whose optimal settings depend on the contents of the processed images and the characteristics of the noises. Among these parameters, noise level is a fundamental parameter that is always assumed to be known by most of the existing denoising algorithms (so-called nonblind denoising algorithms), which largely limits the applicability of these nonblind denoising algorithms in many applications. Moreover, these nonblind algorithms do not always achieve the best denoised images in visual quality even when fed with the actual noise level parameter. To address these shortcomings, in this paper we propose a new quality-aware features-based noise level estimator (NLE), which consists of quality-aware features extraction and optimal noise level parameter prediction. First, considering that image local contrast features convey important structural information that is closely related to image perceptual quality, we utilize the marginal statistics of two local contrast operators, i.e., the gradient magnitude and the Laplacian of Gaussian (LOG), to extract quality-aware features. The proposed quality-aware features have very low computational complexity, making them well suited for time-constrained applications. Then we propose a learning-based framework where the noise level parameter is estimated based on the quality-aware features. Based on the proposed NLE, we develop a blind block matching and three-dimensional filtering (BBM3D) denoising algorithm which is capable of effectively removing additive white Gaussian noise, even coupled with impulse noise. The noise level parameter of the BBM3D algorithm is automatically tuned according to the quality-aware features, guaranteeing the best performance. As such, the classical block matching and three-dimensional algorithm can be transformed into a blind one in an unsupervised manner. Experimental results demonstrate that the
Li, You; Heavican, Tayla B; Vellichirammal, Neetha N; Iqbal, Javeed; Guda, Chittibabu
2017-07-27
The RNA-Seq technology has revolutionized transcriptome characterization not only by accurately quantifying gene expression, but also by the identification of novel transcripts like chimeric fusion transcripts. The 'fusion' or 'chimeric' transcripts have improved the diagnosis and prognosis of several tumors, and have led to the development of novel therapeutic regimen. The fusion transcript detection is currently accomplished by several software packages, primarily relying on sequence alignment algorithms. The alignment of sequencing reads from fusion transcript loci in cancer genomes can be highly challenging due to the incorrect mapping induced by genomic alterations, thereby limiting the performance of alignment-based fusion transcript detection methods. Here, we developed a novel alignment-free method, ChimeRScope that accurately predicts fusion transcripts based on the gene fingerprint (as k-mers) profiles of the RNA-Seq paired-end reads. Results on published datasets and in-house cancer cell line datasets followed by experimental validations demonstrate that ChimeRScope consistently outperforms other popular methods irrespective of the read lengths and sequencing depth. More importantly, results on our in-house datasets show that ChimeRScope is a better tool that is capable of identifying novel fusion transcripts with potential oncogenic functions. ChimeRScope is accessible as a standalone software at (https://github.com/ChimeRScope/ChimeRScope/wiki) or via the Galaxy web-interface at (https://galaxy.unmc.edu/). © The Author(s) 2017. Published by Oxford University Press on behalf of Nucleic Acids Research.
Anghel, Adela; Carrano, Charles; Komjathy, Attila; Astilean, Adina; Letia, Tiberiu
2009-01-01
Data collected from a GPS receiver located at low latitudes in the American sector are used to investigate the performance of the WinTEC algorithm [Anghel et al., 2008a, Kalman filter-based algorithm for near realtime monitoring of the ionosphere using dual frequency GPS data. GPS Solutions, accepted for publication; for different ionospheric modeling techniques: the single-shell linear, quadratic, and cubic approaches, and the multi-shell linear approach. Our results indicate that the quadratic and cubic approaches perform much better than the single-shell and multi-shell linear approaches in terms of post-fit residuals. The performance of the algorithm for the cubic approach is then further tested by comparing the vertical TEC predicted by WinTEC and USTEC [Spencer et al., 2004. Ionospheric data assimilation methods for geodetic applications. In: Proceedings of IEEE PLANS, Monterey, CA, 26-29 April, pp. 510-517] at five North American stations. In addition, since the GPS-derived total electron content (TEC) contains contributions from both ionospheric and plasmaspheric sections of the GPS ray paths, in an effort to improve the accuracy of the TEC retrievals, a new data assimilation module that uses background information from an empirical plasmaspheric model [Gallagher et al., 1988. An empirical model of the Earth's plasmasphere. Advances in Space Research 8, (8)15-(8)24] has been incorporated into the WinTEC algorithm. The new Kalman filter-based algorithm estimates both the ionospheric and plasmaspheric electron contents, the combined satellite and receiver biases, and the estimation error covariance matrix, in a single-site or network solution. To evaluate the effect of the plasmaspheric component on the estimated biases and total TEC and to assess the performance of the newly developed algorithm, we compare the WinTEC results, with and without the plasmaspheric term included, at three GPS receivers located at different latitudes in the American sector, during
Static Filtered Sky Color Constancy
Directory of Open Access Journals (Sweden)
Ali Alkhalifah
2016-05-01
Full Text Available In Computer Vision, the sky color is used for lighting correction, image color enhancement, horizon alignment, image indexing, and outdoor image classification and in many other applications. In this article, for robust color based sky segmentation and detection, usage of lighting correction for sky color detection is investigated. As such, the impact of color constancy on sky color detection algorithms is evaluated and investigated. The color correction (constancy algorithms used includes Gray-Edge (GE, Gray-World (GW, Max-RGB (MRGB and Shades-of-Gray (SG. The algorithms GE, GW, MRGB, and SG, are tested on the static filtered sky modeling. The static filter is developed in the LAB color space. This evaluation and analysis is essential for detection scenarios, especially, color based object detection in outdoor scenes. From the results, it is concluded that the color constancy before sky color detection using LAB static filters has the potential of improving sky color detection performance. However, the application of the color constancy can impart adverse effects on the detection results. For images, the color constancy algorithms depict a compact and stable representative of the sky chroma loci, however, the sky color locus might have a shifting and deviation in a particular color representation. Since the sky static filters are using the static chromatic values, different results can be obtained by applying color constancy algorithms on various datasets.
Institute of Scientific and Technical Information of China (English)
许光辉; 胡光锐
2005-01-01
A new Kalman filtering algorithm based on estimation of spread spectrum signal before suppression of narrowband interference (NBI) in spread spectrum systems, using the dependence of autoregressive (AR) interference, is presented compared with performance of the ACM nonlinear filtering algorithm, simulation results show that the proposed algorithm has preferable performance, there is about 5 dB SNR improvement in average.
一种基于正切图像处理(TIP)模型的图像滤波算法%Image Filtering Algorithm Based on TIP Model
Institute of Scientific and Technical Information of China (English)
康牧; 李永亮
2012-01-01
Few image details will be lost when noise is filtered in traditional image filtering algorithm. This article put forward an image filtering algorithm based on tangent image process model. This algorithm filters image by using tangent function and arctangent function according to 3 × 3 neighborhood pixel value of the pixel to be detected. It is simple, and easy to be implemented. Details of image edge and corner can be preserved and enhanced when noise is restrained effectively. The experiment shows that this algorithm is obviously better than other image filtering algorithm.%传统的图像滤波算法在滤除噪声的同时会丢失一些图像的细节信息,使图像变得模糊,为此提出了一种基于正切图像处理模型的图像滤波算法,算法根据待检测像素周围3×3邻域的像素值,利用正切函数和反正切函数进行处理.算法简单、容易实现,能够在有效地抑制噪声的同时,增强和保留图像的边缘和角点等细节信息.通过实验比较可知,该算法明显优于其它图像滤波算法.
Tracking Infection Diffusion in Social Networks: Filtering Algorithms and Threshold Bounds
Krishnamurthy, Vikram; Pedersen, Tavis
2016-01-01
This paper deals with the statistical signal pro- cessing over graphs for tracking infection diffusion in social networks. Infection (or Information) diffusion is modeled using the Susceptible-Infected-Susceptible (SIS) model. Mean field approximation is employed to approximate the discrete valued infected degree distribution evolution by a deterministic ordinary differential equation for obtaining a generative model for the infection diffusion. The infected degree distribution is shown to follow polynomial dynamics and is estimated using an exact non- linear Bayesian filter. We compute posterior Cramer-Rao bounds to obtain the fundamental limits of the filter which depend on the structure of the network. Considering the time-varying nature of the real world networks, the relationship between the diffusion thresholds and the degree distribution is investigated using generative models for real world networks. In addition, we validate the efficacy of our method with the diffusion data from a real-world online s...
Adaptive Command-Filtered Backstepping Control for Linear Induction Motor via Projection Algorithm
Directory of Open Access Journals (Sweden)
Wenxu Yan
2016-01-01
Full Text Available A theoretical framework of the position control for linear induction motors (LIM has been proposed. First, indirect field-oriented control of LIM is described. Then, the backstepping approach is used to ensure the convergence and robustness of the proposed control scheme against the external time-varying disturbances via Lyapunov stability theory. At the same time, in order to solve the differential expansion and the control saturation problems in the traditional backstepping, command filter is designed in the control and compensating signals are presented to eliminate the influence of the errors caused by command filters. Next, unknown total mass of the mover, viscous friction, and load disturbances are estimated by the projection-based adaptive law which bounds the estimated function and simultaneously guarantees the robustness of the proposed controller against the parameter uncertainties. Finally, simulation results are given to illustrate the validity and potential of the designed control scheme.
A New Subband Adaptive Filtering Algorithm for Sparse System Identification with Impulsive Noise
Directory of Open Access Journals (Sweden)
Young-Seok Choi
2014-01-01
Full Text Available This paper presents a novel subband adaptive filter (SAF for system identification where an impulse response is sparse and disturbed with an impulsive noise. Benefiting from the uses of l1-norm optimization and l0-norm penalty of the weight vector in the cost function, the proposed l0-norm sign SAF (l0-SSAF achieves both robustness against impulsive noise and remarkably improved convergence behavior more than the classical adaptive filters. Simulation results in the system identification scenario confirm that the proposed l0-norm SSAF is not only more robust but also faster and more accurate than its counterparts in the sparse system identification in the presence of impulsive noise.
Directory of Open Access Journals (Sweden)
Abhijit Chandra
2012-04-01
Full Text Available Reduction of computational complexity of digital hardware has drawn the special attention of researchers in recent past. Proper emphasis is needed in this regard towards the settlement of computationally efficient as well as functionally competent design of digital systems. In this communication, we have made one novel attempt for designing multiplier-free Finite duration Impulse Response (FIR digital filter using one robust evolutionary optimization technique, called Differential Evolution (DE. The search has been directed through two sequentially opposite paths which include quantization and optimization as fundamental operations. Besides performing a detailed comparative analysis between these two proposed approaches; the performance evaluation of the designed filter with other existing discrete coefficient FIR models has also been carried out. Finally, the optimum search method for realizing the required set of specifications has been suggested.
Zheng, Jian; Lu, Pei-Rong; Xiang, Dehui; Dai, Ya-Kang; Liu, Zhao-Bang; Kuai, Duo-Jie; Xue, Hui; Yang, Yue-Tao
2013-01-01
We propose a new method to enhance and extract the retinal vessels. First, we employ a multiscale Hessian-based filter to compute the maximum response of vessel likeness function for each pixel. By this step, blood vessels of different widths are significantly enhanced. Then, we adopt a nonlocal mean filter to suppress the noise of enhanced image and maintain the vessel information at the same time. After that, a radial gradient symmetry transformation is adopted to suppress the nonvessel structures. Finally, an accurate graph-cut segmentation step is performed using the result of previous symmetry transformation as an initial. We test the proposed approach on the publicly available databases: DRIVE. The experimental results show that our method is quite effective.
Katyal, Vini; Srivastava, Deepesh
2012-01-01
This paper focuses on fruit defect detection and glare removal using morphological operations, Glare removal can be considered as an important preprocessing step as uneven lighting may introduce it in images, which hamper the results produced through segmentation by Gabor filters .The problem of glare in images is very pronounced sometimes due to the unusual reflectance from the camera sensor or stray light entering, this method counteracts this problem and makes the defect detection much mor...
Directory of Open Access Journals (Sweden)
Yibo Feng
2015-05-01
Full Text Available We present an adaptive algorithm for a system integrated with micro-electro-mechanical systems (MEMS gyroscopes and a compass to eliminate the influence from the environment, compensate the temperature drift precisely, and improve the accuracy of the MEMS gyroscope. We use a simplified drift model and changing but appropriate model parameters to implement this algorithm. The model of MEMS gyroscope temperature drift is constructed mostly on the basis of the temperature sensitivity of the gyroscope. As the state variables of a strong tracking Kalman filter (STKF, the parameters of the temperature drift model can be calculated to adapt to the environment under the support of the compass. These parameters change intelligently with the environment to maintain the precision of the MEMS gyroscope in the changing temperature. The heading error is less than 0.6° in the static temperature experiment, and also is kept in the range from 5° to −2° in the dynamic outdoor experiment. This demonstrates that the proposed algorithm exhibits strong adaptability to a changing temperature, and performs significantly better than KF and MLR to compensate the temperature drift of a gyroscope and eliminate the influence of temperature variation.
Zheng, Ziyi; Sun, Mingshan; Pavkovich, John; Star-Lack, Josh
2011-03-01
A challenge in using on-board cone beam computed tomography (CBCT) to image lung tumor motion prior to radiation therapy treatment is acquiring and reconstructing high quality 4D images in a sufficiently short time for practical use. For the 1 minute rotation times typical of Linacs, severe view aliasing artifacts, including streaks, are created if a conventional phase-correlated FDK reconstruction is performed. The McKinnon-Bates (MKB) algorithm provides an efficient means of reducing streaks from static tissue but can suffer from low SNR and other artifacts due to data truncation and noise. We have added truncation correction and bilateral nonlinear filtering to the MKB algorithm to reduce streaking and improve image quality. The modified MKB algorithm was implemented on a graphical processing unit (GPU) to maximize efficiency. Results show that a nearly 4x improvement in SNR is obtained compared to the conventional FDK phase-correlated reconstruction and that high quality 4D images with 0.4 second temporal resolution and 1 mm3 isotropic spatial resolution can be reconstructed in less than 20 seconds after data acquisition completes.
Feng, Yibo; Li, Xisheng; Zhang, Xiaojuan
2015-05-13
We present an adaptive algorithm for a system integrated with micro-electro-mechanical systems (MEMS) gyroscopes and a compass to eliminate the influence from the environment, compensate the temperature drift precisely, and improve the accuracy of the MEMS gyroscope. We use a simplified drift model and changing but appropriate model parameters to implement this algorithm. The model of MEMS gyroscope temperature drift is constructed mostly on the basis of the temperature sensitivity of the gyroscope. As the state variables of a strong tracking Kalman filter (STKF), the parameters of the temperature drift model can be calculated to adapt to the environment under the support of the compass. These parameters change intelligently with the environment to maintain the precision of the MEMS gyroscope in the changing temperature. The heading error is less than 0.6° in the static temperature experiment, and also is kept in the range from 5° to -2° in the dynamic outdoor experiment. This demonstrates that the proposed algorithm exhibits strong adaptability to a changing temperature, and performs significantly better than KF and MLR to compensate the temperature drift of a gyroscope and eliminate the influence of temperature variation.
Directory of Open Access Journals (Sweden)
Gilson Alexandre Pinto
2005-06-01
Full Text Available This work presented the results of the implementation of an off-line smoothing algorithm in the monitoring system, for the partial hydrolysis of cheese whey proteins using enzymes, which used penalized least squares. Different algorithms for on-line signals filtering used by the control were also compared: artificial neural networks, moving average and smoothing algorithm.A hidrólise parcial de proteínas do soro de queijo, realizada por enzimas imobilizadas em suporte inerte, pode alterar ou evidenciar propriedades funcionais dos polipeptídeos produzidos, aumentando assim suas aplicações. O controle do pH do reator de proteólise é de fundamental importância para modular a distribuição de pesos moleculares dos peptídeos formados. Os sinais de pH e temperatura utilizados pelo algoritmo de controle e inferência de estado podem estar sujeitos a ruído considerável, tornando importante sua filtragem. Apresentam-se aqui resultados da implementação, no sistema de monitoramento do processo, de algoritmo suavizador, que utiliza mínimos quadrados com penalização para o pós-tratamento dos dados. Compara-se ainda o desempenho de diferentes algoritmos na filtragem em tempo real dos sinais utilizados pelo sistema de controle, a saber: redes neurais artificiais, média móvel e o sobredito suavizador.
Directory of Open Access Journals (Sweden)
Jian Wang
2015-11-01
Full Text Available In this paper, a scheme is presented for fusing a foot-mounted Inertial Measurement Unit (IMU and a floor map to provide ubiquitous positioning in a number of settings, such as in a supermarket as a shopping guide, in a fire emergency service for navigation, or with a hospital patient to be tracked. First, several Zero-Velocity Detection (ZDET algorithms are compared and discussed when used in the static detection of a pedestrian. By introducing information on the Zero Velocity of the pedestrian, fused with a magnetometer measurement, an improved Pedestrian Dead Reckoning (PDR model is developed to constrain the accumulating errors associated with the PDR positioning. Second, a Correlation Matching Algorithm based on map projection (CMAP is presented, and a zone division of a floor map is demonstrated for fusion of the PDR algorithm. Finally, in order to use the dynamic characteristics of a pedestrian’s trajectory, the Adaptive Unscented Kalman Filter (A-UKF is applied to tightly integrate the IMU, magnetometers and floor map for ubiquitous positioning. The results of a field experiment performed on the fourth floor of the School of Environmental Science and Spatial Informatics (SESSI building on the China University of Mining and Technology (CUMT campus confirm that the proposed scheme can reliably achieve meter-level positioning.
Values in the filter bubble Ethics of Personalization Algorithms in Cloud Computing
Bozdag, V.E.; Timmermans, J.F.C.
2001-01-01
Cloud services such as Facebook and Google search started to use personalization algorithms in order to deal with growing amount of data online. This is often done in order to reduce the “information overload”. User’s interaction with the system is recorded in a single identity, and the information
Galvan, Jose Ramon; Saxena, Abhinav; Goebel, Kai Frank
2012-01-01
This article discusses several aspects of uncertainty representation and management for model-based prognostics methodologies based on our experience with Kalman Filters when applied to prognostics for electronics components. In particular, it explores the implications of modeling remaining useful life prediction as a stochastic process, and how it relates to uncertainty representation, management and the role of prognostics in decision-making. A distinction between the interpretations of estimated remaining useful life probability density function is explained and a cautionary argument is provided against mixing interpretations for two while considering prognostics in making critical decisions.
RECURSIVE FILTERING RADON-AMBIGUITY TRANSFORM ALGORITHM FOR DETECTING MULTI-LFM SIGNALS
Institute of Scientific and Technical Information of China (English)
Li Yingxiang; Xiao Xianci
2003-01-01
In multi-LFM signal condition, Radon-Ambiguity Transform (RAT) of the strongLFM component has strong suppression effect on that of the weak LFM component. A methodnamed as Recursive Filtering RAT (RFRAT) Mgorithm is proposed for solving this problem. Byfully using of the Maximum Likelihood (ML) estimation value of the frequency modulation rategot by RAT. RFRAT can detect the noisy multi-LFM signals out step by step. The merit of thisnew method is validated by an illustrative example in low Signal-to-Noise-Ratio (SNR) condition.
基于BB-BC的粒子滤波算法研究%Particle Filter Based on BB-BC Algorithm
Institute of Scientific and Technical Information of China (English)
刘钊; 冯新喜; 鹿传国; 孔云波
2012-01-01
Particle filter is the major method of solving the issue of the nonlinear and non-Gaussian system. To overcome the impact of particle degeneration to the performance of particle filter, an intelligent particle filter algorithm based on the Big Bang-Big Crunch (BB-BC) optimization algorithm is proposed. By applying it into resampling, the particle degeneration problem can be resolved by iterative mechanism. The simulation result indicates that compared with standard particle filter, the BB-BC particle filter algorithm is simpler and has better filter effects.%粒子滤波是目前解决非线性、非高斯系统问题的主流方法,为克服粒子退化对粒子滤波性能的影响,提出了一种基于大爆炸-大坍塌(BB-BC)优化算法的智能化粒子滤波算法.将大爆炸-大坍塌优化算法应用于重采样,以迭代机制设计解决粒子退化问题.仿真结果表明,该算法与标准粒子滤波算法相比计算简单,滤波效果优于标准粒子滤波算法.
Design of jitter compensation algorithm for robot vision based on optical flow and Kalman filter.
Wang, B R; Jin, Y L; Shao, D L; Xu, Y
2014-01-01
Image jitters occur in the video of the autonomous robot moving on bricks road, which will reduce robot operation precision based on vision. In order to compensate the image jitters, the affine transformation kinematics were established for obtaining the six image motion parameters. The feature point pair detecting method was designed based on Eigen-value of the feature windows gradient matrix, and the motion parameters equation was solved using the least square method and the matching point pairs got based on the optical flow. The condition number of coefficient matrix was proposed to quantificationally analyse the effect of matching errors on parameters solving errors. Kalman filter was adopted to smooth image motion parameters. Computing cases show that more point pairs are beneficial for getting more precise motion parameters. The integrated jitters compensation software was developed with feature points detecting in subwindow. And practical experiments were conducted on two mobile robots. Results show that the compensation costing time is less than frame sample time and Kalman filter is valid for robot vision jitters compensation.
A FAULT TOLERANT FPGA BASED IMAGE ENHANCEMENT FILTER USING SELF HEALING ALGORITHM
Directory of Open Access Journals (Sweden)
K.SRI RAMA KRISHNA,
2010-09-01
Full Text Available An original approach to automatic design of image filters is presented in this paper. The proposed solution employs Field Programmable Gate Array reconfigurable hardware at simplified functional level and produces high quality image when image features are corrupted by different types of noise. In addition, parallel architectures can be used to ease the enormous computational load due to different operations conducted on image data sets. Self healing circuit is the one which can compete against traditional designs in terms of quality and implementation cost in Xilinx’s chips. During the first phase, schemes for testing the configured processing elements of a reconfigurable circuit evolved for image enhancement application is presented. In the second phase, the internal Processing Elements in evolved circuit found faulty, they are restructured such that the sparse processing elements replace the faulty processing elements both functionally and structurally. Simulation results show that the evolved circuit is inherently testable and can restructure itself by avoiding the faulty ProcessingElements and make use of sparse ones. In third phase implantation of FPGA based image enhancement filter using Virtex-IV application board.
Design of Jitter Compensation Algorithm for Robot Vision Based on Optical Flow and Kalman Filter
Directory of Open Access Journals (Sweden)
B. R. Wang
2014-01-01
Full Text Available Image jitters occur in the video of the autonomous robot moving on bricks road, which will reduce robot operation precision based on vision. In order to compensate the image jitters, the affine transformation kinematics were established for obtaining the six image motion parameters. The feature point pair detecting method was designed based on Eigen-value of the feature windows gradient matrix, and the motion parameters equation was solved using the least square method and the matching point pairs got based on the optical flow. The condition number of coefficient matrix was proposed to quantificationally analyse the effect of matching errors on parameters solving errors. Kalman filter was adopted to smooth image motion parameters. Computing cases show that more point pairs are beneficial for getting more precise motion parameters. The integrated jitters compensation software was developed with feature points detecting in subwindow. And practical experiments were conducted on two mobile robots. Results show that the compensation costing time is less than frame sample time and Kalman filter is valid for robot vision jitters compensation.
Collaborative filtering algorithm with stepwise prediction%分步预测的协同过滤算法
Institute of Scientific and Technical Information of China (English)
肖明波; 郑鑫炜
2015-01-01
The collaborative filtering recommendation algorithm has the problem of data sparseness.In order to solve this problem,this paper put forward a new algorithm with stepwise prediction.It firstly preprocessed the scoring matrix:rearranged the location of the matrix elements to concentrate the values to the left upper corner and filled part of user’s missing data when it scored too less projects.Then it extracted a subsystem with high data density from scoring matrix and filled the missing va-lues by trust-based collaborative filtering algorithm.Finally it achieved stepwise prediction by constantly adding new user or new project.The experimental results on MovieLens demonstrate that the new algorithm can effectively alleviate the data sparseness problem and improve the accuracy.%针对数据稀疏性问题，对协同过滤推荐算法作了改进，提出分步预测的算法。算法先对评分矩阵作预处理，重新排列矩阵元素的位置，使评分数据集中到矩阵左上角，并对评分数过少的用户进行部分填充；然后再提取一个数据密度较高的子系统，用基于信任的算法填充其缺失值；最后通过不断向子系统里添加新用户、新项目的方法实现分步预测的目的。通过在 MovieLens 数据集上的实验结果表明，新算法可以有效地缓解数据稀疏性问题，提高系统的推荐精度。
Fallahi, Kia; Raoufi, Reza; Khoshbin, Hossein
2008-07-01
In recent years chaotic secure communication and chaos synchronization have received ever increasing attention. In this paper a chaotic communication method using extended Kalman filter is presented. The chaotic synchronization is implemented by EKF design in the presence of channel additive noise and processing noise. Encoding chaotic communication is used to achieve a satisfactory, typical secure communication scheme. In the proposed system, a multi-shift cipher algorithm is also used to enhance the security and the key cipher is chosen as one of the chaos states. The key estimate is employed to recover the primary data. To illustrate the effectiveness of the proposed scheme, a numerical example based on Chen dynamical system is presented and the results are compared to two other chaotic systems.
Shin, Yun-ho; Jang, Dong-doo; Moon, Seok-jun; Jung, Hyung-Jo; Moon, Yeong-jong; Song, Chang-kyu
2011-04-01
Recently, vibration requirements are getting stricter as precise equipments need more improved vibration environment to realize their powerful performance. Though the passive pneumatic vibration isolation tables are frequently used to satisfy the rigorous vibration requirements, the specific vibration problem, especially continuous sinusoidal or periodic vibration induced by a rotor system of other precise equipment, a thermo-hygrostat or a ventilation system, is still left. In this research, the application procedure of Filtered-X LMS algorithm to pneumatic vibration isolation table with piezo-stack actuators is proposed to enhance the isolation performance for the continuous sinusoidal or periodic vibration. In addition, the experimental results to show the isolation performance of proposed system are also presented together with the isolation performance of passive pneumatic isolation table.
Ayuk, R; Giovannini, H; Jost, A; Mudry, E; Girard, J; Mangeat, T; Sandeau, N; Heintzmann, R; Wicker, K; Belkebir, K; Sentenac, A
2013-11-15
Structured illumination microscopy (SIM) is a powerful technique for obtaining super-resolved fluorescence maps of samples, but it is very sensitive to aberrations or misalignments affecting the excitation patterns. Here, we present a reconstruction algorithm that is able to process SIM data even if the illuminations are strongly distorted. The approach is an extension of the recent blind-SIM technique, which reconstructs simultaneously the sample and the excitation patterns without a priori information on the latter. Our algorithm was checked on synthetic and experimental data using distorted and nondistorted illuminations. The reconstructions were similar to that obtained by up-to-date SIM methods when the illuminations were periodic and remained artifact-free when the illuminations were strongly distorted.
Rolling ball algorithm as a multitask filter for terrain conductivity measurements
Rashed, Mohamed
2016-09-01
Portable frequency domain electromagnetic devices, commonly known as terrain conductivity meters, have become increasingly popular in recent years, especially in locating underground utilities. Data collected using these devices, however, usually suffer from major problems such as complexity and interference of apparent conductivity anomalies, near edge local spikes, and fading of conductivity contrast between a utility and the surrounding soil. This study presents the experience of adopting the rolling ball algorithm, originally designed to remove background from medical images, to treat these major problems in terrain conductivity measurements. Applying the proposed procedure to data collected using different terrain conductivity meters at different locations and conditions proves the capability of the rolling ball algorithm to treat these data both efficiently and quickly.
Simulation and Performance Analysis of Adaptive Filtering Algorithms in Noise Cancellation
Ferdouse, Lilatul; Nipa, Tamanna Haque; Jaigirdar, Fariha Tasmin
2011-01-01
Noise problems in signals have gained huge attention due to the need of noise-free output signal in numerous communication systems. The principal of adaptive noise cancellation is to acquire an estimation of the unwanted interfering signal and subtract it from the corrupted signal. Noise cancellation operation is controlled adaptively with the target of achieving improved signal to noise ratio. This paper concentrates upon the analysis of adaptive noise canceller using Recursive Least Square (RLS), Fast Transversal Recursive Least Square (FTRLS) and Gradient Adaptive Lattice (GAL) algorithms. The performance analysis of the algorithms is done based on convergence behavior, convergence time, correlation coefficients and signal to noise ratio. After comparing all the simulated results we observed that GAL performs the best in noise cancellation in terms of Correlation Coefficient, SNR and Convergence Time. RLS, FTRLS and GAL were never evaluated and compared before on their performance in noise cancellation in ...
2017-01-05
in terms of DC gain and minimum phase. They carried out performance evaluation with the vowel /a/ synthesized by a physical model of voice production ...synthesizer provides a realistic simulation of the voice production process, and thus an adequate test bed for revealing the temporal and spectral performance...characteristics of each algorithm. Included in the synthetic data are continuous running speech utterances and sustained vowels , which are produced
Institute of Scientific and Technical Information of China (English)
Woo-Cheol Kim; Sanghyun Park; Jung-Im Won
2013-01-01
Over the past several decades,biologists have conducted numerous studies examining both general and specific functions of proteins.Generally,if similarities in either the structure or sequence of amino acids exist for two proteins,then a common biological function is expected.Protein function is determined primarily based on the structure rather than the sequence of amino acids.The algorithm for protein structure alignment is an essential tool for the research.The quality of the algorithm depends on the quality of the similarity measure that is used,and the similarity measure is an objective function used to determine the best alignment.However,none of existing similarity measures became golden standard because of their individual strength and weakness.They require excessive filtering to find a single alignment.In this paper,we introduce a new strategy that finds not a single alignment,but multiple alignments with different lengths.This method has obvious benefits of high quality alignment.However,this novel method leads to a new problem that the running time for this method is considerably longer than that for methods that find only a single alignment.To address this problem,we propose algorithms that can locate a common region (CORE) of multiple alignment candidates,and can then extend the CORE into multiple alignments.Because the CORE can be defined from a final alignment,we introduce CORE* that is similar to CORE and propose an algorithm to identify the CORE*.By adopting CORE* and dynamic programming,our proposed method produces multiple alignments of various lengths with higher accuracy than previous methods.In the experiments,the alignments identified by our algorithm are longer than those obtained by TM-align by 17％ and 15.48％,on average,when the comparison is conducted at the level of super-family and fold,respectively.
Devaprakash, Daniel; Weir, Gillian J; Dunne, James J; Alderson, Jacqueline A; Donnelly, Cyril J
2016-12-01
There is a large and growing body of surface electromyography (sEMG) research using laboratory-specific signal processing procedures (i.e., digital filter type and amplitude normalisation protocols) and data analyses methods (i.e., co-contraction algorithms) to acquire practically meaningful information from these data. As a result, the ability to compare sEMG results between studies is, and continues to be challenging. The aim of this study was to determine if digital filter type, amplitude normalisation method, and co-contraction algorithm could influence the practical or clinical interpretation of processed sEMG data. Sixteen elite female athletes were recruited. During data collection, sEMG data was recorded from nine lower limb muscles while completing a series of calibration and clinical movement assessment trials (running and sidestepping). Three analyses were conducted: (1) signal processing with two different digital filter types (Butterworth or critically damped), (2) three amplitude normalisation methods, and (3) three co-contraction ratio algorithms. Results showed the choice of digital filter did not influence the clinical interpretation of sEMG; however, choice of amplitude normalisation method and co-contraction algorithm did influence the clinical interpretation of the running and sidestepping task. Care is recommended when choosing amplitude normalisation method and co-contraction algorithms if researchers/clinicians are interested in comparing sEMG data between studies.
Performance Analysis of Alignment Process of MEMS IMU
Directory of Open Access Journals (Sweden)
Vadim Bistrov
2012-01-01
Full Text Available The procedure of determining the initial values of the attitude angles (pitch, roll, and heading is known as the alignment. Also, it is essential to align an inertial system before the start of navigation. Unless the inertial system is not aligned with the vehicle, the information provided by MEMS (microelectromechanical system sensors is not useful for navigating the vehicle. At the moment MEMS gyroscopes have poor characteristics and it’s necessary to develop specific algorithms in order to obtain the attitude information of the object. Most of the standard algorithms for the attitude estimation are not suitable when using MEMS inertial sensors. The wavelet technique, the Kalman filter, and the quaternion are not new in navigation data processing. But the joint use of those techniques for MEMS sensor data processing can give some new results. In this paper the performance of a developed algorithm for the attitude estimation using MEMS IMU (inertial measurement unit is tested. The obtained results are compared with the attitude output of another commercial GPS/IMU device by Xsens. The impact of MEMS sensor measurement noises on an alignment process is analysed. Some recommendations for the Kalman filter algorithm tuning to decrease standard deviation of the attitude estimation are given.
一种汉藏双语句子对齐算法%Chinese -Tibetan Bilingual Sentence Alignment Algorithm
Institute of Scientific and Technical Information of China (English)
安见才让; 王玲玲
2011-01-01
双语语料库建设及其自动对齐研究对计算语言学的发展具有重要意义.双语对齐技术是加工双语文本的核心,对齐效果的好坏直接影响了以后工作的进行.基于汉藏双语的实际情况,提出了一种利用句子长度、相似度和锚点信息的汉藏双语句子对齐方法,该方法用相似度找到句子的锚点,用锚点将双语文本分割成几个分块,在对应双语分块中用基于长度的对齐实现句子的对齐.通过测试数据进行的实验结果显示,这种方法有着良好的准确率,有效地解决了汉藏双语真实文本的句子对齐问题.%Bilingual corpus and its automatic alignment are of great significance to the development of computational linguistics. As the key technology during the course of building corpus, bilingual alignment technology has a direct impact on the future work process. Based on the actual situation of Chinese -Tibetan bilingual, a Chinese- Tibetan bilingual sentence aligning method is proposed in this paper,taking advantage of the length and similarity of sentences as well as the anchor information. In this method, after identifying the anchor of a sentence with the similarity measure, the lingual text will be separated into several fragments with the anchor information. Eventually, these text fragments could be aligned to response their counterparts based upon the length of sentences. According to experiments on plenty of testing data, this method manages to tackle the problem about aligning real Chinese - Tibetan bilingual texts effectively with high standard of accuracy.
String Match Algorithms and Applications in DNA Sequence Alignment%字符串匹配算法在 DNA 序列比对中的应用
Institute of Scientific and Technical Information of China (English)
陈建平
2015-01-01
The advancement of high-throughput sequencing technologies has led bioinformatics research into the big data era.New technologies generate huge amounts of biological genetic data,which pose significant challenges to data analysis. DNA sequence alignment is one critical step of the bioinformatics analysis flow,providing mapping information for the following variants calling processes.Question B of 201 5 “Shenzhen Cup ”Summer Camp of Mathematical Modeling discusses about DNA sequence alignment problem,requiring students to provide the best solution for fast sequence alignment.Here,we give a brief review on the students’work,then we introduce algorithms implemented in common DNA sequence alignment programs.%高通量测序技术的飞速发展让生物信息领域迎来了大数据时代。新技术在提供海量生物遗传信息的同时，也给分析这些数据带来了新的挑战。DNA 序列比对是信息分析流程中的关键步骤，为后续的变异检测提供序列比对信息。2015“深圳杯”数学建模夏令营 B 题以 DNA 序列比对为研究课题，希望参赛学生给出序列快速比对的最佳方案。本文简要点评了各参赛队伍的解答情况，然后介绍了现有 DNA 序列比对软件中用到的算法和数据结构。
Sigma: multiple alignment of weakly-conserved non-coding DNA sequence
Directory of Open Access Journals (Sweden)
Siddharthan Rahul
2006-03-01
Full Text Available Abstract Background Existing tools for multiple-sequence alignment focus on aligning protein sequence or protein-coding DNA sequence, and are often based on extensions to Needleman-Wunsch-like pairwise alignment methods. We introduce a new tool, Sigma, with a new algorithm and scoring scheme designed specifically for non-coding DNA sequence. This problem acquires importance with the increasing number of published sequences of closely-related species. In particular, studies of gene regulation seek to take advantage of comparative genomics, and recent algorithms for finding regulatory sites in phylogenetically-related intergenic sequence require alignment as a preprocessing step. Much can also be learned about evolution from intergenic DNA, which tends to evolve faster than coding DNA. Sigma uses a strategy of seeking the best possible gapless local alignments (a strategy earlier used by DiAlign, at each step making the best possible alignment consistent with existing alignments, and scores the significance of the alignment based on the lengths of the aligned fragments and a background model which may be supplied or estimated from an auxiliary file of intergenic DNA. Results Comparative tests of sigma with five earlier algorithms on synthetic data generated to mimic real data show excellent performance, with Sigma balancing high "sensitivity" (more bases aligned with effective filtering of "incorrect" alignments. With real data, while "correctness" can't be directly quantified for the alignment, running the PhyloGibbs motif finder on pre-aligned sequence suggests that Sigma's alignments are superior. Conclusion By taking into account the peculiarities of non-coding DNA, Sigma fills a gap in the toolbox of bioinformatics.
Directory of Open Access Journals (Sweden)
T. O. Ting
2014-01-01
Full Text Available In this work, a state-space battery model is derived mathematically to estimate the state-of-charge (SoC of a battery system. Subsequently, Kalman filter (KF is applied to predict the dynamical behavior of the battery model. Results show an accurate prediction as the accumulated error, in terms of root-mean-square (RMS, is a very small value. From this work, it is found that different sets of Q and R values (KF’s parameters can be applied for better performance and hence lower RMS error. This is the motivation for the application of a metaheuristic algorithm. Hence, the result is further improved by applying a genetic algorithm (GA to tune Q and R parameters of the KF. In an online application, a GA can be applied to obtain the optimal parameters of the KF before its application to a real plant (system. This simply means that the instantaneous response of the KF is not affected by the time consuming GA as this approach is applied only once to obtain the optimal parameters. The relevant workable MATLAB source codes are given in the appendix to ease future work and analysis in this area.
Ting, T O; Man, Ka Lok; Lim, Eng Gee; Leach, Mark
2014-01-01
In this work, a state-space battery model is derived mathematically to estimate the state-of-charge (SoC) of a battery system. Subsequently, Kalman filter (KF) is applied to predict the dynamical behavior of the battery model. Results show an accurate prediction as the accumulated error, in terms of root-mean-square (RMS), is a very small value. From this work, it is found that different sets of Q and R values (KF's parameters) can be applied for better performance and hence lower RMS error. This is the motivation for the application of a metaheuristic algorithm. Hence, the result is further improved by applying a genetic algorithm (GA) to tune Q and R parameters of the KF. In an online application, a GA can be applied to obtain the optimal parameters of the KF before its application to a real plant (system). This simply means that the instantaneous response of the KF is not affected by the time consuming GA as this approach is applied only once to obtain the optimal parameters. The relevant workable MATLAB source codes are given in the appendix to ease future work and analysis in this area.
Fourier Lucas-Kanade algorithm.
Lucey, Simon; Navarathna, Rajitha; Ashraf, Ahmed Bilal; Sridharan, Sridha
2013-06-01
In this paper, we propose a framework for both gradient descent image and object alignment in the Fourier domain. Our method centers upon the classical Lucas & Kanade (LK) algorithm where we represent the source and template/model in the complex 2D Fourier domain rather than in the spatial 2D domain. We refer to our approach as the Fourier LK (FLK) algorithm. The FLK formulation is advantageous when one preprocesses the source image and template/model with a bank of filters (e.g., oriented edges, Gabor, etc.) as 1) it can handle substantial illumination variations, 2) the inefficient preprocessing filter bank step can be subsumed within the FLK algorithm as a sparse diagonal weighting matrix, 3) unlike traditional LK, the computational cost is invariant to the number of filters and as a result is far more efficient, and 4) this approach can be extended to the Inverse Compositional (IC) form of the LK algorithm where nearly all steps (including Fourier transform and filter bank preprocessing) can be precomputed, leading to an extremely efficient and robust approach to gradient descent image matching. Further, these computational savings translate to nonrigid object alignment tasks that are considered extensions of the LK algorithm, such as those found in Active Appearance Models (AAMs).
SYNTHESIS OF NOVEL ALL-DIELECTRIC GRATING FILTERS USING GENETIC ALGORITHMS
Zuffada, Cinzia; Cwik, Tom; Ditchman, Christopher
1997-01-01
We are concerned with the design of inhomogeneous, all dielectric (lossless) periodic structures which act as filters. Dielectric filters made as stacks of inhomogeneous gratings and layers of materials are being used in optical technology, but are not common at microwave frequencies. The problem is then finding the periodic cell's geometric configuration and permittivity values which correspond to a specified reflectivity/transmittivity response as a function of frequency/illumination angle. This type of design can be thought of as an inverse-source problem, since it entails finding a distribution of sources which produce fields (or quantities derived from them) of given characteristics. Electromagnetic sources (electric and magnetic current densities) in a volume are related to the outside fields by a well known linear integral equation. Additionally, the sources are related to the fields inside the volume by a constitutive equation, involving the material properties. Then, the relationship linking the fields outside the source region to those inside is non-linear, in terms of material properties such as permittivity, permeability and conductivity. The solution of the non-linear inverse problem is cast here as a combination of two linear steps, by explicitly introducing the electromagnetic sources in the computational volume as a set of unknowns in addition to the material unknowns. This allows to solve for material parameters and related electric fields in the source volume which are consistent with Maxwell's equations. Solutions are obtained iteratively by decoupling the two steps. First, we invert for the permittivity only in the minimization of a cost function and second, given the materials, we find the corresponding electric fields through direct solution of the integral equation in the source volume. The sources thus computed are used to generate the far fields and the synthesized triter response. The cost function is obtained by calculating the deviation
Institute of Scientific and Technical Information of China (English)
程向红; 王宇; 杨文博
2012-01-01
捷联惯导初始对准大失准角系统误差模型中,当噪声具有不确定统计特性时,基于白噪声假设的无迹卡尔曼滤波算法鲁棒性较差.针对该问题,提出了一种基于H∞理论的鲁棒超球体无迹卡尔曼滤波算法.给出了计算量小的超球体采样策略,推导了H∞滤波的鲁棒机理,分离了鲁棒环节.将鲁棒环节引入超球体无迹卡尔曼滤波算法,得到鲁棒超球体无迹卡尔曼滤波算法,并分别在系统噪声和量测噪声为白噪声和有色噪声的条件下,对超球体无迹卡尔曼滤波和鲁棒超球体无迹卡尔曼滤波两种滤波方法进行了仿真实验.仿真结果表明,鲁棒超球体无迹卡尔曼滤波在白噪声情况下虽然精度有所降低,但是相对超球体无迹卡尔曼滤波具有了对有色噪声的鲁棒性,较超球体无迹卡尔曼滤波方法更适用于天向失准角为大角度并且噪声特性为有色噪声的情况.%The H∞ filtering was introduced to solve the problems of low filtering performance which derived from uncertainty noise caused by wind and wave and high frequency vibrancy in measurement equation of self-alignment of SINS for the carrier plane. First, the basic idea of self-alignment of SINS for the carrier plane on the sea environment was formulated. Second, the state space model for precision alignment of SINS in swing base with large amplitude was built. Finally, a filter of self-alignment based on H∞ filter for SINS of the carrier plane was designed. This method has effectively suppressed the external noise interference and ensured the robustness of the system. Simulation results show that the Kalman filter can not complete estimation of attitude error in 5 min, while H∞ filter can not only estimate attitude error, but also estimate the gyro constant drift error and the accelerometer bias error. The level alignment precision is within 2', while the azimuth alignment precision is about 12'. Meanwhile, it can
A Filtering Algorithm for Removing Image Mixed Noise%一种去除图像混合噪声的滤波算法
Institute of Scientific and Technical Information of China (English)
吴德刚; 赵利平
2012-01-01
Classical median filtering and mean filtering are often used to filter out impulse noise and Gaussian noise, but if both impulse noise and Gaussian noise exist in the image, effect of the two filtering algorithms turn out to be dissatisfactory. In order to filter out two different kinds of noise simultaneously, a new filtering algorithm for mixed noise is proposed. According to the characteristics of impulse noise and the local energy information of pixel, firstly, the impulse noise is separated, and to be removed by median filtering algorithm. Then the image containing Gaussian noise is denoised by mean filtering algorithm. Test results show that the proposed algorithm can filter out mixed noise effectively and preserve image details very well; it provides an effective way for removing mixed noise in images.%经典的中值滤波和均值滤波常常被分别用来滤除脉冲噪声和高斯噪声,但是当图像同时存在脉冲噪声和高斯噪声时,这两种滤波算法都不能达到最好的滤波效果.为了能同时滤除两种不同性质的噪声,提出了一种新的混合噪声滤波算法.该算法首先根据脉冲噪声的特点和像素的局部能量信息,分离出脉冲噪声并采用中值滤波算法加以去除,然后对含有高斯噪声的图像采用均值滤波算法进行去噪.试验结果表明,该算法在有效滤除混合噪声的同时,能很好地保护图像的细节,从而为去除图像中的混合噪声提供了一种有效的途径.
Feng, Kaiqiang; Li, Jie; Zhang, Xiaoming; Shen, Chong; Bi, Yu; Zheng, Tao; Liu, Jun
2017-09-19
In order to reduce the computational complexity, and improve the pitch/roll estimation accuracy of the low-cost attitude heading reference system (AHRS) under conditions of magnetic-distortion, a novel linear Kalman filter, suitable for nonlinear attitude estimation, is proposed in this paper. The new algorithm is the combination of two-step geometrically-intuitive correction (TGIC) and the Kalman filter. In the proposed algorithm, the sequential two-step geometrically-intuitive correction scheme is used to make the current estimation of pitch/roll immune to magnetic distortion. Meanwhile, the TGIC produces a computed quaternion input for the Kalman filter, which avoids the linearization error of measurement equations and reduces the computational complexity. Several experiments have been carried out to validate the performance of the filter design. The results demonstrate that the mean time consumption and the root mean square error (RMSE) of pitch/roll estimation under magnetic disturbances are reduced by 45.9% and 33.8%, respectively, when compared with a standard filter. In addition, the proposed filter is applicable for attitude estimation under various dynamic conditions.
机载火控雷达TWS滤波算法仿真研究%Emulation Research on TWS Filter Algorithm for Airborne Fire-control Radar
Institute of Scientific and Technical Information of China (English)
吴慈伶
2001-01-01
A kind of filter tracking algorithm joint with inertia navigation system parameters (JINS) is proposed in this paper. This algorithm overcomes the affection on filter tracking performance while the airplane is maneuvering. Compared with the classical α—β filter algorithm in Monte Carlo emulation trial on computer, this algorithm is much better than the classical α—β filter in tracking performance as the airplane maneuvers.%提出了一种结合惯性导航系统参数的跟踪滤波算法(JINS)。该算法克服了由于载机本身机动对滤波器跟踪性能所造成的影响。通过计算机进行Monte Carlo仿真试验，并与经典的α—β滤波算法进行了比较。结果表明：该算法在载机机动时仍然能够对目标保持较高精度的跟踪。
A Wavelet Phase Filtering Algorithm for Image Noise Reduction%图像噪声去除的小波相位滤波算法
Institute of Scientific and Technical Information of China (English)
赵瑞珍; 徐龙; 宋国乡
2001-01-01
Most of the wavelet denoising methods available are based on magnitudes. However,for the images with low SNR.the edges of the image m the wavelet domain are hidden in the noise. A wavelet phase filtering algorithm is presented in this paper, which is insensitive to the magnitude of image.
Institute of Scientific and Technical Information of China (English)
王竹婷
2016-01-01
协同过滤算法是目前应用于电子商务个性化推荐系统中的一种最成功的推荐算法。为缓解因数据稀疏性问题导致的算法推荐质量下降，将关联规则分析引入协同过滤算法中，预测部分未评分项目的评分值，再运用传统的基于用户的协同过滤算法实施推荐。实验结果表明：与传统的协同过滤算法相比，采用关联规则预测评分可以一定程度提高算法推荐质量。%Collaborative filtering algorithm is one of the most successful recommendation algorithms ap-plied to the personalized recommendation system of E-commerce.In order to alleviate the problem of the algorithm recommendation quality decline that caused by the data sparse,the association rule anal-ysis is introduced into the collaborative filtering algorithm,which predicts the item ratings of the non rating items,and then uses the traditional user_based collaborative filtering algorithm to implement the recommendation.The experimental results show that compared with the traditional collaborative filte-ring algorithm,the algorithm uses association rules to predict the item ratings can improve the recom-mended quality.
Directory of Open Access Journals (Sweden)
Yap Hoon
2017-02-01
Full Text Available In this paper, a refined reference current generation algorithm based on instantaneous power (pq theory is proposed, for operation of an indirect current controlled (ICC three-level neutral-point diode clamped (NPC inverter-based shunt active power filter (SAPF under non-sinusoidal source voltage conditions. SAPF is recognized as one of the most effective solutions to current harmonics due to its flexibility in dealing with various power system conditions. As for its controller, pq theory has widely been applied to generate the desired reference current due to its simple implementation features. However, the conventional dependency on self-tuning filter (STF in generating reference current has significantly limited mitigation performance of SAPF. Besides, the conventional STF-based pq theory algorithm is still considered to possess needless features which increase computational complexity. Furthermore, the conventional algorithm is mostly designed to suit operation of direct current controlled (DCC SAPF which is incapable of handling switching ripples problems, thereby leading to inefficient mitigation performance. Therefore, three main improvements are performed which include replacement of STF with mathematical-based fundamental real power identifier, removal of redundant features, and generation of sinusoidal reference current. To validate effectiveness and feasibility of the proposed algorithm, simulation work in MATLAB-Simulink and laboratory test utilizing a TMS320F28335 digital signal processor (DSP are performed. Both simulation and experimental findings demonstrate superiority of the proposed algorithm over the conventional algorithm.
Institute of Scientific and Technical Information of China (English)
陈婧; 张苏
2014-01-01
According to fingerprint characteristics and the characteristics of the fingerprint singular points, the methods of multi-scale filtering and complex filtering are used to analyze fingerprint singularity feature extraction algorithm in order to improve the effi-ciency of automatic fingerprint identification.%根据指纹特征及指纹奇异点的特点，利用多尺度滤波及复数滤波方法，分析改进了指纹奇异特征提取算法，提高了自动指纹识别的效率。
Comparative Study on Some Nonlinear Filtering Algorithms%几种非线性滤波算法的比较研究
Institute of Scientific and Technical Information of China (English)
王庆欣; 史连艳
2011-01-01
针对组合导航等非线性系统,扩展卡尔曼滤波算法(EKF)在初值不准确时存在滤波发散的现象,故提出U-卡尔曼滤波(UKF);粒子滤波算法(PF)适合于强非线性、非高斯噪声系统,但同时存在退化现象,故提出2种改进算法.前人的工作多集中在单一算法的研究,而在此是将上述各种算法应用到同一典型非线性系统,通过应用Matlab进行仿真实验得出具体滤渡效果数据,综合对比分析了各算法的优缺点,得出一些有用的结论,为组合导航系统中非线性滤波算法的选择提供了参考.%For the nonlinear systems such as integrated navigation systems, since the extended Kalman filtering ( EKF) has a dispersing phenomenon when the initial state value is inaccurate, the unscented Kalman filiering ( UKF) is proposed,and although particle filtering (PF) is suitable for any nonlinear non-Gaussian systems, it has a degeneracy phenomenon, then two kinds of improved filtering algorithms are put forward. Scientific researchers focused on single filtering before. The filtering algorithms mentioned above are adopted in a same typical model of nonlinear system in this paper. The detailed data of the filtering algorithms were obtained by emulational experiments with Matlab. Some useful conclusios were acquired after the contrast and analysis of their advantages and disadvantages. A reference is offered in choosing a suitable nonlinearfiltering algorithm for integrated navigation systems.
Institute of Scientific and Technical Information of China (English)
俞琰; 邱广华
2012-01-01
Aiming at data sparsity and malicious behavior in traditional collaborative filtering algorithm, this paper pres- ents a new algorithm of collaborative filtering based on social network. Depending on social network information, the algo- rithm integrates user＇ s trust and preference in order to find the nearest neighbors of the target user, which the algorithm uses to compute weight of neighbors and to form item recommendation. Experimental results show that the algorithm can alleviate the sparsity and malicious behaviors problems and achieve a better prediction accuracy than traditional collaborative filtering algorithms.%针对传统协同过滤推荐算法的数据稀疏性及恶意行为等问题，提出一种新的基于社会网络的协同过滤推荐算法。该算法借助社会网络信息，结合用户信任和用户兴趣，寻找目标用户最近邻居，并以此作为权重，形成项目推荐，以提高推荐的准确度。实验表明，相对于传统的协同过滤算法，该算法可有效缓解稀疏性及恶意行为带来的问题，显著提高推荐系统的推荐质量。
Du, Tien Duc; Ngo-Duc, Thanh; Kieu, Chanh
2017-07-01
This study presents an approach to assimilate tropical cyclone (TC) real-time reports and the University of Wisconsin-Cooperative Institute for Meteorological Satellite Studies (CIMSS) Atmospheric Motion Vectors (AMV) data into the Weather Research and Forecasting (WRF) model for TC forecast applications. Unlike current methods in which TC real-time reports are used to either generate a bogus vortex or spin up a model initial vortex, the proposed approach ingests the TC real-time reports through blending a dynamically consistent synthetic vortex structure with the CIMSS-AMV data. The blended dataset is then assimilated into the WRF initial condition, using the local ensemble transform Kalman filter (LETKF) algorithm. Retrospective experiments for a number of TC cases in the northwestern Pacific basin during 2013-2014 demonstrate that this approach could effectively increase both the TC circulation and enhance the large-scale environment that the TCs are embedded in. Further evaluation of track and intensity forecast errors shows that track forecasts benefit more from improvement in the large-scale flow at 4-5-day lead times, whereas the intensity improvement is minimal. While the difference between the track and intensity improvement could be due to a specific model configuration, this result appears to be consistent with the recent reports of insignificant impacts of inner core data assimilation in operational TC models at the long range of 4-5 days. The new approach will be most beneficial for future regional TC models that are directly initialized from very high-resolution global models whose storm initial locations are sufficiently accurate at the initial analysis that there is no need to carry out any artificial vortex removal or filtering steps.
Christe, Andreas; Brönnimann, Alain; Vock, Peter
2014-02-01
A precise detection of volume change allows for better estimating the biological behavior of the lung nodules. Postprocessing tools with automated detection, segmentation, and volumetric analysis of lung nodules may expedite radiological processes and give additional confidence to the radiologists. To compare two different postprocessing software algorithms (LMS Lung, Median Technologies; LungCARE®, Siemens) in CT volumetric measurement and to analyze the effect of soft (B30) and hard reconstruction filter (B70) on automated volume measurement. Between January 2010 and April 2010, 45 patients with a total of 113 pulmonary nodules were included. The CT exam was performed on a 64-row multidetector CT scanner (Somatom Sensation, Siemens, Erlangen, Germany) with the following parameters: collimation, 24x1.2 mm; pitch, 1.15; voltage, 120 kVp; reference tube current-time, 100 mAs. Automated volumetric measurement of each lung nodule was performed with the two different postprocessing algorithms based on two reconstruction filters (B30 and B70). The average relative volume measurement difference (VME%) and the limits of agreement between two methods were used for comparison. At soft reconstruction filters the LMS system produced mean nodule volumes that were 34.1% (P filters (B30) was significantly larger than with hard filters (B70); 11.2% for LMS and 1.6% for LungCARE®, respectively (both with P filters, 13.6% for soft and 3.8% for hard filters, respectively (P 0.05). There is a substantial inter-software (LMS/LungCARE®) as well as intra-software variability (B30/B70) in lung nodule volume measurement; therefore, it is mandatory to use the same equipment with the same reconstruction filter for the follow-up of lung nodule volume.
基于三边滤波的Retinex图像去雾算法%Retinex image defogging algorithm based on trilateral filtering
Institute of Scientific and Technical Information of China (English)
曹永妹; 张尤赛
2013-01-01
针对传统Retinex算法采用高斯滤波估计图像的照射分量易产生边缘模糊，不能有效去除脉冲噪声且处理后的图像颜色易失真等问题，提出一种基于三边滤波的Retinex图像去雾算法。该算法利用三边滤波器估计图像的照射分量，三边滤波器继承了双边滤波器既可以有效降低图像加性高斯噪声又可以保持图像边缘细节的特性，同时又解决了双边滤波器与高斯滤波器不能有效滤除脉冲噪声，易产生伪边缘等问题。为验证该算法的有效性，采用5种不同的客观评价参数对处理后的图像进行评价。实验证明，该算法能有效地改善雾天图像的退化现象，提高图像的清晰度。%A Retinex image defogging algorithm based on trilateral filtering is proposed in this paper to avoid edge fuzzi-ness,impulse noise and color distortion in traditional Retinex algorithm. In the new algorithm,the trilateral filter is adopted to estimate the illumination component on image. The trilateral filter is utilized to replace Gaussian filter and bilateral filter,both of which can not effectively filter the pulse noise but are easy to produce false edge. Trilateral filter can preserve the image’s edges while it suppresses the additive white Gaussian noise as the bilateral filter does. Five different objective evaluation parame-ters are used to evaluate the disposed images to prove the effectiveness of the algorithm proposed in this paper. Experiment re-sults show that this algorithm can effectively improve the degradation of foggy images and enhance their definition.
Directory of Open Access Journals (Sweden)
Jayaraj V
2010-01-01
Full Text Available A new switching-based median filtering scheme for restoration of images that are highly corrupted by salt and pepper noise is proposed. An algorithm based on the scheme is developed. The new scheme introduces the concept of substitution of noisy pixels by linear prediction prior to estimation. A novel simplified linear predictor is developed for this purpose. The objective of the scheme and algorithm is the removal of high-density salt and pepper noise in images. The new algorithm shows significantly better image quality with good PSNR, reduced MSE, good edge preservation, and reduced streaking. The good performance is achieved with reduced computational complexity. A comparison of the performance is made with several existing algorithms in terms of visual and quantitative results. The performance of the proposed scheme and algorithm is demonstrated.
Optimization and improvement of FOA corner cube algorithm
McClay, Wilbert A., III; Awwal, Abdul A. S.; Burkhart, Scott C.; Candy, James V.
2004-11-01
Alignment of laser beams based on video images is a crucial task necessary to automate operation of the 192 beams at the National Ignition Facility (NIF). The final optics assembly (FOA) is the optical element that aligns the beam into the target chamber. This work presents an algorithm for determining the position of a corner cube alignment image in the final optics assembly. The improved algorithm was compared to the existing FOA algorithm on 900 noise-simulated images. While the existing FOA algorithm based on correlation with a synthetic template has a radial standard deviation of 1 pixel, the new algorithm based on classical matched filtering (CMF) and polynomial fit to the correlation peak improves the radial standard deviation performance to less than 0.3 pixels. In the new algorithm the templates are designed from real data stored during a year of actual operation.
Optimization and Improvement of FOA Corner Cube Algorithm
Energy Technology Data Exchange (ETDEWEB)
McClay, W A; Awwal, A S; Burkhart, S C; Candy, J V
2004-10-01
Alignment of laser beams based on video images is a crucial task necessary to automate operation of the 192 beams at the National Ignition Facility (NIF). The final optics assembly (FOA) is the optical element that aligns the beam into the target chamber. This work presents an algorithm for determining the position of a corner cube alignment image in the final optics assembly. The improved algorithm was compared to the existing FOA algorithm on 900 noise-simulated images. While the existing FOA algorithm based on correlation with a synthetic template has a radial standard deviation of 1 pixel, the new algorithm based on classical matched filtering (CMF) and polynomial fit to the correlation peak improves the radial standard deviation performance to less than 0.3 pixels. In the new algorithm the templates are designed from real data stored during a year of actual operation.
Improved Particle Filter Algorithm and Application Simulation%改进粒子滤波算法及其应用仿真
Institute of Scientific and Technical Information of China (English)
张军; 所玉君; 董小丰; 张玉朋
2013-01-01
In view of the low precision of particle filter algorithm and particle degradation in target tracking, a GH-RPF algorithm is put forward. Based on particle filter, Gauss-Hermite filter is applied to generate the importance density function, and meanwhile canonical transformation is adopted to re-sampling in order to improve the diversity of particles. If the algorithm is applied to nonlinear and non-Gaussian target tracking, it can be seen from the simulation result that the filtering accuracy is higher and tracking performance is better compared to the standard particle filter algorithm as well as EKPF.%针对目标跟踪中粒子滤波算法的估计精度不高、粒子退化问题，文中提出了一种 GH-RPF 算法。在粒子滤波的基础上，应用高斯-厄米特滤波来产生重要密度函数，同时对重采样采用正则变换以改善采样粒子的多样性。将该算法应用于非线性、非高斯的目标跟踪中，仿真结果表明，与标准粒子滤波及 EKPF 相比，该算法的滤波精度更高，具有更高的跟踪性能。
模糊自适应混合退火粒子滤波算法%THE ALGORITHM OF FUZZY ADAPTIVE HYBRID ANNEALED PARTICLE FILTER
Institute of Scientific and Technical Information of China (English)
蒋东明
2013-01-01
A new particle filter algorithm is proposed based on the hybrid annealed particle filter (HAPF) for on-line estimation of non-Gaussian nonlinear systems and inherent degeneracy problem of the particle filter.In the filtering algorithm,according to the relation between the statistical properties of state noise and measurement noise of the system,we introduce an adjustment factor,then an annealed coefficient is produced by fuzzy inference system.The state parameters separation and the annealed coefficient are used to produce important probability density function.Using the algorithm,we get better annealed coefficient on the basis of keeping the advantages of HAPF.Simulation experiments show that the performance of the proposed filtering algorithm outperforms the HAPF.%针对非线性、非高斯系统状态的在线估计问题,及粒子滤波本身固有的退化问题,在已提出的混合退火粒子滤波算法的基础上提出一种新的粒子滤波算法.在滤波算法中,根据系统的状态噪声统计特性和量测噪声统计特性的关系引入调整因子,再由模糊推理系统产生退火系数.用状态参数分解和退火系数来产生重要性概率密度函数.在保留原算法优点的基础上取得了更佳的退火系数.仿真实验表明该粒子滤波器的性能优于混合退火粒子滤波算法.
Torteeka, Peerapong; Gao, Peng-Qi; Shen, Ming; Guo, Xiao-Zhang; Yang, Da-Tao; Yu, Huan-Huan; Zhou, Wei-Ping; Zhao, You
2017-02-01
Although tracking with a passive optical telescope is a powerful technique for space debris observation, it is limited by its sensitivity to dynamic background noise. Traditionally, in the field of astronomy, static background subtraction based on a median image technique has been used to extract moving space objects prior to the tracking operation, as this is computationally efficient. The main disadvantage of this technique is that it is not robust to variable illumination conditions. In this article, we propose an approach for tracking small and dim space debris in the context of a dynamic background via one of the optical telescopes that is part of the space surveillance network project, named the Asia-Pacific ground-based Optical Space Observation System or APOSOS. The approach combines a fuzzy running Gaussian average for robust moving-object extraction with dim-target tracking using a particle-filter-based track-before-detect method. The performance of the proposed algorithm is experimentally evaluated, and the results show that the scheme achieves a satisfactory level of accuracy for space debris tracking.
Chen, Guoliang; Meng, Xiaolin; Wang, Yunjia; Zhang, Yanzhe; Tian, Peng; Yang, Huachao
2015-09-23
Because of the high calculation cost and poor performance of a traditional planar map when dealing with complicated indoor geographic information, a WiFi fingerprint indoor positioning system cannot be widely employed on a smartphone platform. By making full use of the hardware sensors embedded in the smartphone, this study proposes an integrated approach to a three-dimensional (3D) indoor positioning system. First, an improved K-means clustering method is adopted to reduce the fingerprint database retrieval time and enhance positioning efficiency. Next, with the mobile phone's acceleration sensor, a new step counting method based on auto-correlation analysis is proposed to achieve cell phone inertial navigation positioning. Furthermore, the integration of WiFi positioning with Pedestrian Dead Reckoning (PDR) obtains higher positional accuracy with the help of the Unscented Kalman Filter algorithm. Finally, a hybrid 3D positioning system based on Unity 3D, which can carry out real-time positioning for targets in 3D scenes, is designed for the fluent operation of mobile terminals.
Lary, David J.; Mussa, Yussuf
2004-01-01
In this study a new extended Kalman filter (EKF) learning algorithm for feed-forward neural networks (FFN) is used. With the EKF approach, the training of the FFN can be seen as state estimation for a non-linear stationary process. The EKF method gives excellent convergence performances provided that there is enough computer core memory and that the machine precision is high. Neural networks are ideally suited to describe the spatial and temporal dependence of tracer-tracer correlations. The neural network performs well even in regions where the correlations are less compact and normally a family of correlation curves would be required. For example, the CH4-N2O correlation can be well described using a neural network trained with the latitude, pressure, time of year, and CH4 volume mixing ratio (v.m.r.). The neural network was able to reproduce the CH4-N2O correlation with a correlation coefficient between simulated and training values of 0.9997. The neural network Fortran code used is available for download.
Directory of Open Access Journals (Sweden)
D. J. Lary
2004-06-01
Full Text Available In this study a new extended Kalman filter (EKF learning algorithm for feed-forward neural networks (FFN is used. With the EKF approach, the training of the FFN can be seen as state estimation for a non-linear stationary process. The EKF method gives excellent convergence performances provided that there is enough computer core memory and that the machine precision is high. Neural networks are ideally suited to describe the spatial and temporal dependence of tracer-tracer correlations. The neural network performs well even in regions where the correlations are less compact and normally a family of correlation curves would be required. For example, the CH_{4}-N_{2}O correlation can be well described using a neural network trained with the latitude, pressure, time of year, and CH_{4} volume mixing ratio (v.m.r.. The neural network was able to reproduce the CH_{4}-N_{2}O correlation with a correlation coefficient between simulated and training values of 0.9997. The neural network Fortran code used is available for download.