Correction and simulation of the intensity compensation algorithm used in curvature wavefront sensing

The wavefront measuring range and recovery precision of a curvature sensor can be improved by an intensity compensation algorithm. However, in a focal system with a fast f-number, especially a telescope with a large field of view, the accuracy of this algorithm cannot meet the requirements. A theoretical analysis of the corrected intensity compensation algorithm in a focal system with a fast f-number is first introduced and afterwards the mathematical equations used in this algorithm are expressed.The corrected result is then verified through simulation. The method used by such a simulation can be described as follows. First, the curvature signal from a focal system with a fast f-number is simulated by Monte Carlo ray tracing; then the wavefront result is calculated by the inner loop of the FFT wavefront recovery algorithm and the outer loop of the intensity compensation algorithm. Upon comparing the intensity compensation algorithm of an ideal system with the corrected intensity compensation algorithm, we reveal that the recovered precision of the curvature sensor can be greatly improved by the corrected intensity compensation algorithm.     

Using Active Contours for Semi-Automated Tracking of UV and EUV Solar Flare Ribbons

Solar-flare UV and EUV images show elongated bright “ribbons” that move over time. If these ribbons are assumed to locate the footpoints of magnetic-field lines reconnecting in the corona, then it is clear that studying their evolution can provide important insight into the reconnection process. An image-processing method based on active contours (commonly referred to as “snakes”) is proposed as a method for tracking UV and EUV flare ribbons and is tested on images from the Transition Region and Coronal Explorer (TRACE). This paper introduces the basic concepts of such an approach with a brief overview of the history and theory behind active contours. It then details the specifics of the snake algorithm developed for this work and shows the results of running the algorithm on test images. The results from the application of the developed algorithm are reported for six different TRACE flares (five in UV and one in EUV). The discussion of these results uses the output from an expert tracking the same ribbons by eye as a benchmark, and against these the snake algorithm is shown to compare favourably in certain conditions, but less so in others. The applicability of the automated snake algorithm to the general problem of ribbon tracking is discussed and suggestions for ways to improve the snake algorithm are proposed.     

四种综合脉冲星时算法比较

由单颗脉冲星定义的脉冲星时受多种噪声源的影响,其短期和长期稳定度都不够好.为了削弱这些噪声源对单脉冲星时的影响,可以采取合适的算法对多个单脉冲星时进行综合得到综合脉冲星时,从而提高综合脉冲星时的长期稳定度.文中介绍4种综合脉冲星时算法:经典加权算法、小波分析算法、维纳滤波算法和小波域中的维纳滤波算法,将这4种算法分别应用于Arecibo天文台对两颗毫秒脉冲星PSR B1855+09和PSRB1937+21观测得到的计时残差并作出比较.     

A genetic algorithm scheme for pairing meteorite finds

Abstract— A genetic algorithm is employed to perform the pairing of meteorite fragments based on various characteristics measured from thin sections using an image analysis program and from analyses routinely carried out during classification. The genetic algorithm searches for best group pairings by generating a population of trial pairs, linking them together to form groups, and evolving the population, so that only pairs that are members of likely pairing groups survive to the next generation of the population. In this way, meaningful pairing groups will emerge from the population, as long as characteristics from within real pairing groups have variance sufficiently small compared to the variance between groups. What constitutes “sufficiently small” is discussed and investigated by testing the genetic algorithm method on artificial data, which shows that, in principle, the method can achieve a 100% success rate. The method is then tested on real data whose pairing groups are definitely known. This is achieved by gathering data from the image processing of several scenes of the same meteorite thin section, treating each scene as a separate fragment. Using thin sections from the Reg el Acfer meteorite population, we find that the genetic algorithm identifies almost all of the main pairing groups, with about half the groups being found in their entirety; the pairwise success rate being 76%. Although this methodology requires some refinement before it could be applied to a population of meteorite fragments, these preliminary results are encouraging. The potential benefit of an automated approach lies in the tremendous savings in time and effort, allowing meaningful and reproducible pairings to be made from data sets that are prohibitively large for a human being.     

A new segmentation algorithm for lunar surface terrain based on CCD images

Terrain classification is one of the critical steps used in lunar geomorphologic analysis and landing site selection. Most of the published works have focused on a Digital Elevation Model(DEM) to distinguish different regions of lunar terrain.This paper presents an algorithm that can be applied to lunar CCD images by blocking and clustering according to image features, which can accurately distinguish between lunar highland and lunar mare. The new algorithm, compared with the traditional algorithm, can improve classification accuracy. The new algorithm incorporates two new features and one Tamura texture feature. The new features are generating an enhanced image histogram and modeling the properties of light reflection, which can represent the geological characteristics based on CCD gray level images. These features are applied to identify texture in order to perform image clustering and segmentation by a weighted Euclidean distance to distinguish between lunar mare and lunar highlands.The new algorithm has been tested on Chang'e-1 CCD data and the testing result has been compared with geological data published by the U.S. Geological Survey. The result has shown that the algorithm can effectively distinguish the lunar mare from highlands in CCD images. The overall accuracy of the proposed algorithm is satisfactory, and the Kappa coefficient is 0.802, which is higher than the result of combining the DEM with CCD images.     

A Comparison of the Four Algorithms of Ensemble Pulsar Time

The pulsar time defined by a single pulsar is affected by many kinds of noise sources. Its short-term and long-term degrees of stability are both not good enough. In order to weaken the influence of these noise sources on the single pulsar time, an appropriate algorithm can be adopted to make a synthesis of many single pulsar times, then the ensemble pulsar time is obtained, thereby increasing the long-term degree of stability of the ensemble pulsar time. In this article four kinds of algorithms of the ensemble pulsar time are introduced, i.e., the classical weighting algorithm, wavelet analysis algorithm, Wiener filtering algorithm and Wiener filtering algorithm in wavelet domain. These four algorithms are respectively applied to the timing residuals obtained from the observation of two millisecond pulsars, PSR B1855+09 and PSR B1937+21 made at the Arecibo Astronomical Observatory, and comparisons are carried out.     

双通道终端进行卫星双向法时间比对的归算方法

用双通道终端进行卫星双向法时间比对,可同时实现多台站时间同步。但是,目前双通道终端卫星双向法时间比对仍采用经典二台站归算方法,同时性的优点并没有得到充分的利用,其结果不闭合,比对得到的结果不统一。为了避免了上述问题,给出了新的归算方法,在同一系统下给出时间比对结果。新的归算方法不但提高了时间比对精度,同时还给出卫星到地面站之间的精确伪距,籍此精确地测定卫星的实时位置。     

Automatic morphological classification of galaxy images

We describe an image analysis supervised learning algorithm that can automatically classify galaxy images. The algorithm is first trained using manually classified images of elliptical, spiral and edge-on galaxies. A large set of image features is extracted from each image, and the most informative features are selected using Fisher scores. Test images can then be classified using a simple Weighted Nearest Neighbour rule such that the Fisher scores are used as the feature weights. Experimental results show that galaxy images from Galaxy Zoo can be classified automatically to spiral, elliptical and edge-on galaxies with an accuracy of ∼90 per cent compared to classifications carried out by the author. Full compilable source code of the algorithm is available for free download, and its general-purpose nature makes it suitable for other uses that involve automatic image analysis of celestial objects.     

On the dynamical derivation of the Titius-Bode law

The Principle of Least Action Interaction, developed by the dynamical astronomer Michael W. Ovenden, is tested using a new algorithm based on the ergodic hypothesis that the time mean of the disturbing function is equal to the space mean. This algorithm is an improvement over the one that Ovenden (1972) used in testing his principle, i.e. it can be applied to systems having more than three satellites without violating the conservation law of angular momentum and these satellites may have significant inclinations. This algorithm treats the problem of finding the configuration of least action interaction as a Lagrange multiplier problem. Renormalization group techniques and existing non-gradient optimization algorithms are incorporated into this new algorithm to reduce some of the numerical complexities.This algorithm is tested on the planets and asteroids in our solar system and on the satellite systems of Jupiter, Saturn, and Uranus. In most cases the results show that the current distances of the satellites from their primary is very close to the minimum interaction-action configuration for that system. The possibility of a planet lying beyond Pluto is investigated using this algorithm.Finally, some of my results are compared with those of Ovenden (1972) for our solar system. The results indicate that the interaction-action potential is lower using this new algorithm than the potential obtained from Ovenden's. Also, greater skepticism is raised concerning the one-time existence of a planet of 90 earth masses lying between Mars and Jupiter.     

Bayesian galaxy shape measurement for weak lensing surveys – I. Methodology and a fast-fitting algorithm

The principles of measuring the shapes of galaxies by a model-fitting approach are discussed in the context of shape measurement for surveys of weak gravitational lensing. It is argued that such an approach should be optimal, allowing measurement with maximal signal-to-noise ratio, coupled with estimation of measurement errors. The distinction between likelihood-based and Bayesian methods is discussed. Systematic biases in the Bayesian method may be evaluated as part of the fitting process, and overall such an approach should yield unbiased shear estimation without requiring external calibration from simulations. The principal disadvantage of model fitting for large surveys is the computational time required, but here an algorithm is presented that enables large surveys to be analysed in feasible computation times. The method and algorithm is tested on simulated galaxies from the Shear TEsting Programme (STEP).     

Optimal Compensation and Implementation for Adaptive Optics Systems

This paper develops a compensation algorithm based on Linear–Quadratic–Gaussian (LQG) control system design whose parameters are determined (in part) by a model of the atmosphere. The model for the atmosphere is based on the open-loop statistics of the atmosphere as observed by the wavefront sensor, and is identified from these using an auto-regressive, moving average (ARMA) model. The (LQG) control design is compared with an existing compensation algorithm for a simulation developed at ESO that represents the operation of MACAO adaptive optics system on the 8.2 m telescopes at Paranal, Chile. This revised version was published online in July 2006 with corrections to the Cover Date.     

一种固定选图数的实时幸运成像算法

幸运成像技术是一种从大量短曝光图像中选取少量幸运好图进行配准、叠加的高分辨率图像恢复技术,能够有效减小大气湍流对图像质量的影响,但传统的基于中央处理器(Central Processing Unit,CPU)的幸运成像算法难以实现实时化.利用现场可编程门阵列(Field Programmable Gate Array,...     

Wavelet Analysis Algorithm for Synthetic Pulsar Time

The pulsar time defined by a single pulsar is affected by several noises and in order to weaken their effects and acquire a much more stable time scale we define a synthetic pulsar time from many single pulsar times. Synthesis of the two pulsars, PSR B1855 + 09 and PSR B1937 + 21 is implemented by two methods: the classical weighting algorithm and the wavelet decomposition algorithm. The results are compared. The classical weighting algorithm is unable to take into consideration the different degrees of stability at different frequencies while the wavelet algorithm can, and thereby get better results.     

Asteroid close encounters characterization using differential algebra: the case of Apophis

A method for the nonlinear propagation of uncertainties in Celestial Mechanics based on differential algebra is presented. The arbitrary order Taylor expansion of the flow of ordinary differential equations with respect to the initial condition delivered by differential algebra is exploited to implement an accurate and computationally efficient Monte Carlo algorithm, in which thousands of pointwise integrations are substituted by polynomial evaluations. The algorithm is applied to study the close encounter of asteroid Apophis with our planet in 2029. To this aim, we first compute the high order Taylor expansion of Apophis’ close encounter distance from the Earth by means of map inversion and composition; then we run the proposed Monte Carlo algorithm to perform the statistical analysis.     

A new method for determining physical parameters of fundamental mode RR Lyrae stars from multicolour light curves

We present a new method for determining physical parameters of RRab variables exclusively from multicolour light curves. Our method is an inverse photometric Baade–Wesselink analysis which, using a non-linear least-squares algorithm, searches for the effective temperature ( T _eff) and pulsational velocity ( V _p) curves and other physical parameters that best fit the observed light curves, utilizing synthetic colours and bolometric corrections from static atmosphere models. The T _eff and V _p curves are initially derived from empirical relations then they are varied by the fitting algorithm. The method yields the variations and the absolute values of the radius, the effective temperature, the visual brightness and the luminosity of individual objects. Distance and mass are also determined. The method is tested on nine RRab stars subjected to Baade–Wesselink analyses earlier by several authors. The physical parameters derived by our method using only the light-curve data of these stars are well within their possible ranges defined by direct Baade–Wesselink and other techniques. A new empirical relation between the I _C magnitude and the pulsational velocity is also presented, which allows to construct the V _p curve of an RRab star purely from photometric observations to an accuracy of about 3.5 km s⁻¹.     

Design and analysis of Weak Stability Boundary trajectories to Moon

An algorithm is developed to find Weak Stability Boundary transfer trajectories to Moon in high fidelity force model using forward propagation. The trajectory starts from an Earth Parking Orbit (circular or elliptical). The algorithm varies the control parameters at Earth Parking Orbit and on the way to Moon to arrive at a ballistic capture trajectory at Moon. Forward propagation helps to satisfy launch vehicle’s maximum payload constraints. Using this algorithm, a number of test cases are evaluated and detailed analysis of capture orbits is presented.     

A Monte Carlo template based analysis for air-Cherenkov arrays

We present a high-performance event reconstruction algorithm: an Image Pixel-wise fit for Atmospheric Cherenkov Telescopes (ImPACT). The reconstruction algorithm is based around the likelihood fitting of camera pixel amplitudes to an expected image template. A maximum likelihood fit is performed to find the best-fit shower parameters. A related reconstruction algorithm has already been shown to provide significant improvements over traditional reconstruction for both the CAT and H.E.S.S. experiments. We demonstrate a significant improvement to the template generation step of the procedure, by the use of a full Monte Carlo air shower simulation in combination with a ray-tracing optics simulation to more accurately model the expected camera images. This reconstruction step is combined with an MVA-based background rejection.Examples are shown of the performance of the ImPACT analysis on both simulated and measured (from a strong VHE source) gamma-ray data from the H.E.S.S. array, demonstrating an improvement in sensitivity of more than a factor two in observation time over traditional image moments-fitting methods, with comparable performance to previous likelihood fitting analyses. ImPACT is a particularly promising approach for future large arrays such as the Cherenkov Telescope Array (CTA) due to its improved high-energy performance and suitability for arrays of mixed telescope types.     

Improving Bayesian analysis for LISA Pathfinder using an efficient Markov Chain Monte Carlo method

We present a parameter estimation procedure based on a Bayesian framework by applying a Markov Chain Monte Carlo algorithm to the calibration of the dynamical parameters of the LISA Pathfinder satellite. The method is based on the Metropolis-Hastings algorithm and a two-stage annealing treatment in order to ensure an effective exploration of the parameter space at the beginning of the chain. We compare two versions of the algorithm with an application to a LISA Pathfinder data analysis problem. The two algorithms share the same heating strategy but with one moving in coordinate directions using proposals from a multivariate Gaussian distribution, while the other uses the natural logarithm of some parameters and proposes jumps in the eigen-space of the Fisher Information matrix. The algorithm proposing jumps in the eigen-space of the Fisher Information matrix demonstrates a higher acceptance rate and a slightly better convergence towards the equilibrium parameter distributions in the application to LISA Pathfinder data. For this experiment, we return parameter values that are all within ～1σ of the injected values. When we analyse the accuracy of our parameter estimation in terms of the effect they have on the force-per-unit of mass noise, we find that the induced errors are three orders of magnitude less than the expected experimental uncertainty in the power spectral density.     

Correcting systematic effects in a large set of photometric light curves

We suggest a new algorithm to remove systematic effects in a large set of light curves obtained by a photometric survey. The algorithm can remove systematic effects, such as those associated with atmospheric extinction, detector efficiency, or point spread function changes over the detector. The algorithm works without any prior knowledge of the effects, as long as they linearly appear in many stars of the sample. The approach, which was originally developed to remove atmospheric extinction effects, is based on a lower rank approximation of matrices, an approach which has already been suggested and used in chemometrics, for example. The proposed algorithm is especially useful in cases where the uncertainties of the measurements are unequal. For equal uncertainties, the algorithm reduces to the Principal Component Analysis (PCA) algorithm. We present a simulation to demonstrate the effectiveness of the proposed algorithm and we point out its potential, in the search for transit candidates in particular.     

On a relation among lie series

In this paper we discuss the relation between the structures of the series expansion for the Dragt and Finn composition of Lie transforms and for a transformation introduced by Giorgilli and Galgani. A recursive algorithm is presented which is used to generate the series expansion for the composition of Lie transforms. This algorithm strongly resembles the algorithm of Giorgilli and Galgani, and differs from it only in an ordering property. The relation with the algorithms of Kamel and Henrard for Deprit's direct and inverse series is also discussed.