Photometric invariant stereo matching method.
Gu, Feifei; Zhao, Hong; Zhou, Xiang; Li, Jinjun; Bu, Penghui; Zhao, Zixin
2015-12-14
A robust stereo matching method based on a comprehensive mathematical model for color formation process is proposed to estimate the disparity map of stereo images with noise and photometric variations. The band-pass filter with DoP kernel is firstly used to filter out noise component of the stereo images. Then the log-chromaticity normalization process is applied to eliminate the influence of lightning geometry. All the other factors that may influence the color formation process are removed through the disparity estimation process with a specific matching cost. Performance of the developed method is evaluated by comparing with some up-to-date algorithms. Experimental results are presented to demonstrate the robustness and accuracy of the method.
A new affine-invariant image matching method based on SIFT
NASA Astrophysics Data System (ADS)
Wang, Peng-cheng; Chen, Qian; Chen, Hai-xin; Cheng, Hong-chang; Gong, Zhen-fei
2013-09-01
Local invariant feature extraction, as one of the main problems in the field of computer vision, has been widely applied to image matching, splicing and target recognition etc. Lowe's scale invariant feature transform (known as SIFT) algorithm has attracted much attention due to its invariance to scale, rotation and illumination. However, SIFT is not robust to affine deformations, because it is based on the DoG detector which extracts keypoints in a circle region. Besides, the feature descriptor is represented by a 128-dimensional vector, which means that the algorithm complexity is extremely large especially when there is a great quantity of keypoints in the image. In this paper, a new feature descriptor, which is robust to affine deformations, is proposed. Considering that circles turn to be ellipses after affine deformations, some improvements have been made. Firstly, the Gaussian image pyramids are constructed by convoluting the source image and the elliptical Gaussian kernel with two volatile parameters, orientation and eccentricity. In addition, the two parameters are discretely selected in order to imitate the possibilities of the affine deformation, which can make sure that anisotropic regions are transformed into isotropic ones. Next, all extreme points can be extracted as the candidates for the affine-invariant keypoints in the image pyramids. After accurate keypoints localization is performed, the secondary moment of the keypoints' neighborhood is calculated to identify the elliptical region which is affineinvariant, the same as SIFT, the main orientation of the keypoints can be determined and the feature descriptor is generated based on the histogram constructed in this region. At last, the PCA method for the 128-dimensional descriptor's reduction is used to improve the computer calculating efficiency. The experiments show that this new algorithm inherits all SIFT's original advantages, and has a good resistance to affine deformations; what's more, it
Optimal Affine-Invariant Point Matching
NASA Astrophysics Data System (ADS)
Costa, Mauro S.; Haralick, Robert M.; Phillips, Tsaiyun I.; Shapiro, Linda G.
1989-03-01
The affine-transformation matching scheme proposed by Hummel and Wolfson (1988) is very efficient in a model-based matching system, not only in terms of the computational complexity involved, but also in terms of the simplicity of the method. This paper addresses the implementation of the affine-invariant point matching, applied to the problem of recognizing and determining the pose of sheet metal parts. It points out errors that can occur with this method due to quantization, stability, symmetry, and noise problems. By beginning with an explicit noise model which the Hummel and Wolfson technique lacks, we can derive an optimal approach which overcomes these problems. We show that results obtained with the new algorithm are clearly better than the results from the original method.
Rotation and scale change invariant point pattern relaxation matching by the Hopfield neural network
NASA Astrophysics Data System (ADS)
Sang, Nong; Zhang, Tianxu
1997-12-01
Relaxation matching is one of the most relevant methods for image matching. The original relaxation matching technique using point patterns is sensitive to rotations and scale changes. We improve the original point pattern relaxation matching technique to be invariant to rotations and scale changes. A method that makes the Hopfield neural network perform this matching process is discussed. An advantage of this is that the relaxation matching process can be performed in real time with the neural network's massively parallel capability to process information. Experimental results with large simulated images demonstrate the effectiveness and feasibility of the method to perform point patten relaxation matching invariant to rotations and scale changes and the method to perform this matching by the Hopfield neural network. In addition, we show that the method presented can be tolerant to small random error.
Oblique low-altitude image matching using robust perspective invariant features
NASA Astrophysics Data System (ADS)
He, Haiqing; Du, Jing; Chen, Xiaoyong; Wang, Yuqian
2017-01-01
Compared with vertical photogrammtry, oblique photogrammetry is radically different for images acquired from sensor with big yaw, pitch, and roll angles. Image matching is a vital step and core problem of oblique low-altitude photogrammetric process. Among the most popular oblique images matching methods are currently SIFT/ASIFT and many affine invariant feature-based approaches, which are mainly used in computer vision, while these methods are unsuitable for requiring evenly distributed corresponding points and high efficiency simultaneously in oblique photogrammetry. In this paper, we present an oblique low-altitude images matching approach using robust perspective invariant features. Firstly, the homography matrix is estimated by a few corresponding points obtained from top pyramid images matching in several projective simulation. Then images matching are implemented by sub-pixel Harris corners and descriptors after shape perspective transforming on the basis of homography matrix. Finally, the error or gross error matched points are excluded by epipolar geometry, RANSAC algorithm and back projection constraint. Experimental results show that the proposed approach can achieve more excellent performances in oblique low-altitude images matching than the common methods, including SIFT and SURF. And the proposed approach can significantly improve the computational efficiency compared with ASIFT and Affine-SURF.
Object matching using a locally affine invariant and linear programming techniques.
Li, Hongsheng; Huang, Xiaolei; He, Lei
2013-02-01
In this paper, we introduce a new matching method based on a novel locally affine-invariant geometric constraint and linear programming techniques. To model and solve the matching problem in a linear programming formulation, all geometric constraints should be able to be exactly or approximately reformulated into a linear form. This is a major difficulty for this kind of matching algorithm. We propose a novel locally affine-invariant constraint which can be exactly linearized and requires a lot fewer auxiliary variables than other linear programming-based methods do. The key idea behind it is that each point in the template point set can be exactly represented by an affine combination of its neighboring points, whose weights can be solved easily by least squares. Errors of reconstructing each matched point using such weights are used to penalize the disagreement of geometric relationships between the template points and the matched points. The resulting overall objective function can be solved efficiently by linear programming techniques. Our experimental results on both rigid and nonrigid object matching show the effectiveness of the proposed algorithm.
Mousavi Kahaki, Seyed Mostafa; Nordin, Md Jan; Ashtari, Amir H.; J. Zahra, Sophia
2016-01-01
An invariant feature matching method is proposed as a spatially invariant feature matching approach. Deformation effects, such as affine and homography, change the local information within the image and can result in ambiguous local information pertaining to image points. New method based on dissimilarity values, which measures the dissimilarity of the features through the path based on Eigenvector properties, is proposed. Evidence shows that existing matching techniques using similarity metrics—such as normalized cross-correlation, squared sum of intensity differences and correlation coefficient—are insufficient for achieving adequate results under different image deformations. Thus, new descriptor’s similarity metrics based on normalized Eigenvector correlation and signal directional differences, which are robust under local variation of the image information, are proposed to establish an efficient feature matching technique. The method proposed in this study measures the dissimilarity in the signal frequency along the path between two features. Moreover, these dissimilarity values are accumulated in a 2D dissimilarity space, allowing accurate corresponding features to be extracted based on the cumulative space using a voting strategy. This method can be used in image registration applications, as it overcomes the limitations of the existing approaches. The output results demonstrate that the proposed technique outperforms the other methods when evaluated using a standard dataset, in terms of precision-recall and corner correspondence. PMID:26985996
NASA Astrophysics Data System (ADS)
Wang, Xianmin; Li, Bo; Xu, Qizhi
2016-07-01
The anisotropic scale space (ASS) is often used to enhance the performance of a scale-invariant feature transform (SIFT) algorithm in the registration of synthetic aperture radar (SAR) images. The existing ASS-based methods usually suffer from unstable keypoints and false matches, since the anisotropic diffusion filtering has limitations in reducing the speckle noise from SAR images while building the ASS image representation. We proposed a speckle reducing SIFT match method to obtain stable keypoints and acquire precise matches for the SAR image registration. First, the keypoints are detected in a speckle reducing anisotropic scale space constructed by the speckle reducing anisotropic diffusion, so that speckle noise is greatly reduced and prominent structures of the images are preserved, consequently the stable keypoints can be derived. Next, the probabilistic relaxation labeling approach is employed to establish the matches of the keypoints then the correct match rate of the keypoints is significantly increased. Experiments conducted on simulated speckled images and real SAR images demonstrate the effectiveness of the proposed method.
Position, rotation, and intensity invariant recognizing method
Ochoa, Ellen; Schils, George F.; Sweeney, Donald W.
1989-01-01
A method for recognizing the presence of a particular target in a field of view which is target position, rotation, and intensity invariant includes the preparing of a target-specific invariant filter from a combination of all eigen-modes of a pattern of the particular target. Coherent radiation from the field of view is then imaged into an optical correlator in which the invariant filter is located. The invariant filter is rotated in the frequency plane of the optical correlator in order to produce a constant-amplitude rotational response in a correlation output plane when the particular target is present in the field of view. Any constant response is thus detected in the output The U.S. Government has rights in this invention pursuant to Contract No. DE-AC04-76DP00789 between the U.S. Department of Energy and AT&T Technologies, Inc.
Nonlocal matching condition and scale-invariant spectrum in bouncing cosmology
Chu, C.-S.; Furuta, K.; Lin, F.-L.
2006-05-15
In cosmological scenarios such as the pre-big bang scenario or the ekpyrotic scenario, a matching condition between the metric perturbations in the pre-big bang phase and those in the post big bang phase is often assumed. Various matching conditions have been considered in the literature. Nevertheless obtaining a scale-invariant CMB spectrum via a concrete mechanism remains impossible. In this paper, we examine this problem from the point of view of local causality. We begin with introducing the notion of local causality and explain how it constrains the form of the matching condition. We then prove a no-go theorem: independent of the details of the matching condition, a scale-invariant spectrum is impossible as long as the local causality condition is satisfied. In our framework, it is easy to show that a violation of local causality around the bounce is needed in order to give a scale-invariant spectrum. We study a specific scenario of this possibility by considering a nonlocal effective theory inspired by noncommutative geometry around the bounce and show that a scale-invariant spectrum is possible. Moreover we demonstrate that the magnitude of the spectrum is compatible with observations if the bounce is assumed to occur at an energy scale which is a few orders of magnitude below the Planckian energy scale.
Position, rotation, and intensity invariant recognizing method
Ochoa, E.; Schils, G.F.; Sweeney, D.W.
1987-09-15
A method for recognizing the presence of a particular target in a field of view which is target position, rotation, and intensity invariant includes the preparing of a target-specific invariant filter from a combination of all eigen-modes of a pattern of the particular target. Coherent radiation from the field of view is then imaged into an optical correlator in which the invariant filter is located. The invariant filter is rotated in the frequency plane of the optical correlator in order to produce a constant-amplitude rotational response in a correlation output plane when the particular target is present in the field of view. Any constant response is thus detected in the output plane to determine whether a particular target is present in the field of view. Preferably, a temporal pattern is imaged in the output plane with a optical detector having a plurality of pixels and a correlation coefficient for each pixel is determined by accumulating the intensity and intensity-square of each pixel. The orbiting of the constant response caused by the filter rotation is also preferably eliminated either by the use of two orthogonal mirrors pivoted correspondingly to the rotation of the filter or the attaching of a refracting wedge to the filter to remove the offset angle. Detection is preferably performed of the temporal pattern in the output plane at a plurality of different angles with angular separation sufficient to decorrelate successive frames. 1 fig.
On Integral Invariants for Effective 3-D Motion Trajectory Matching and Recognition.
Shao, Zhanpeng; Li, Youfu
2016-02-01
Motion trajectories tracked from the motions of human, robots, and moving objects can provide an important clue for motion analysis, classification, and recognition. This paper defines some new integral invariants for a 3-D motion trajectory. Based on two typical kernel functions, we design two integral invariants, the distance and area integral invariants. The area integral invariants are estimated based on the blurred segment of noisy discrete curve to avoid the computation of high-order derivatives. Such integral invariants for a motion trajectory enjoy some desirable properties, such as computational locality, uniqueness of representation, and noise insensitivity. Moreover, our formulation allows the analysis of motion trajectories at a range of scales by varying the scale of kernel function. The features of motion trajectories can thus be perceived at multiscale levels in a coarse-to-fine manner. Finally, we define a distance function to measure the trajectory similarity to find similar trajectories. Through the experiments, we examine the robustness and effectiveness of the proposed integral invariants and find that they can capture the motion cues in trajectory matching and sign recognition satisfactorily.
Illumination-invariant image matching for autonomous UAV localisation based on optical sensing
NASA Astrophysics Data System (ADS)
Wan, Xue; Liu, Jianguo; Yan, Hongshi; Morgan, Gareth L. K.
2016-09-01
This paper presents an UAV (Unmanned Aerial Vehicle) localisation algorithm for its autonomous navigation based on matching between on-board UAV image sequences to a pre-installed reference satellite image. As the UAV images and the reference image are not necessarily taken under the same illumination condition, illumination-invariant image matching is essential. Based on the investigation of illumination-invariant property of Phase Correlation (PC) via mathematical derivation and experiments, we propose a PC based fast and robust illumination-invariant localisation algorithm for UAV navigation. The algorithm accurately determines the current UAV position as well as the next UAV position even the illumination condition of UAV on-board images is different from the reference satellite image. A Dirac delta function based registration quality assessment together with a risk alarming criterion is introduced to enable the UAV to perform self-correction in case the UAV deviates from the planned route. UAV navigation experiments using simulated terrain shading images and remote sensing images have demonstrated a robust high performance of the proposed PC based localisation algorithm under very different illumination conditions resulted from solar motion. The superiority of the algorithm, in comparison with two other widely used image matching algorithms, MI (Mutual Information) and NCC (Normalised Correlation Coefficient), is significant for its high matching accuracy and fast processing speed.
2007-12-20
shoe was that? The use of computerised image database to assist in identification”. Forensic Science International , 82(1):7–20, 9/15 1996. 3. Bay...biometric systems”. Forensic science international , 155(2-3):126–140, 2005. 7. Haibin Ling; Jacobs, D.W. “Deformation invariant image matching”. Computer...Image match- ing algorithms for breech face marks and firing pins in a database of spent car- tridge cases of firearms”. Forensic science international , 2001
Visual Odometry Based on Structural Matching of Local Invariant Features Using Stereo Camera Sensor
Núñez, Pedro; Vázquez-Martín, Ricardo; Bandera, Antonio
2011-01-01
This paper describes a novel sensor system to estimate the motion of a stereo camera. Local invariant image features are matched between pairs of frames and linked into image trajectories at video rate, providing the so-called visual odometry, i.e., motion estimates from visual input alone. Our proposal conducts two matching sessions: the first one between sets of features associated to the images of the stereo pairs and the second one between sets of features associated to consecutive frames. With respect to previously proposed approaches, the main novelty of this proposal is that both matching algorithms are conducted by means of a fast matching algorithm which combines absolute and relative feature constraints. Finding the largest-valued set of mutually consistent matches is equivalent to finding the maximum-weighted clique on a graph. The stereo matching allows to represent the scene view as a graph which emerge from the features of the accepted clique. On the other hand, the frame-to-frame matching defines a graph whose vertices are features in 3D space. The efficiency of the approach is increased by minimizing the geometric and algebraic errors to estimate the final displacement of the stereo camera between consecutive acquired frames. The proposed approach has been tested for mobile robotics navigation purposes in real environments and using different features. Experimental results demonstrate the performance of the proposal, which could be applied in both industrial and service robot fields. PMID:22164016
Visual odometry based on structural matching of local invariant features using stereo camera sensor.
Núñez, Pedro; Vázquez-Martín, Ricardo; Bandera, Antonio
2011-01-01
This paper describes a novel sensor system to estimate the motion of a stereo camera. Local invariant image features are matched between pairs of frames and linked into image trajectories at video rate, providing the so-called visual odometry, i.e., motion estimates from visual input alone. Our proposal conducts two matching sessions: the first one between sets of features associated to the images of the stereo pairs and the second one between sets of features associated to consecutive frames. With respect to previously proposed approaches, the main novelty of this proposal is that both matching algorithms are conducted by means of a fast matching algorithm which combines absolute and relative feature constraints. Finding the largest-valued set of mutually consistent matches is equivalent to finding the maximum-weighted clique on a graph. The stereo matching allows to represent the scene view as a graph which emerge from the features of the accepted clique. On the other hand, the frame-to-frame matching defines a graph whose vertices are features in 3D space. The efficiency of the approach is increased by minimizing the geometric and algebraic errors to estimate the final displacement of the stereo camera between consecutive acquired frames. The proposed approach has been tested for mobile robotics navigation purposes in real environments and using different features. Experimental results demonstrate the performance of the proposal, which could be applied in both industrial and service robot fields.
NASA Astrophysics Data System (ADS)
Stumpf, André; Malet, Jean-Philippe; Allemand, Pascal; Skupinski, Grzegorz; Deseilligny, Marc-Pierrot
2013-04-01
Multi-view stereo surface reconstruction from dense terrestrial photographs is being increasingly applied for geoscience applications such as quantitative geomorphology, and a number of different software solution and processing streamlines have been suggested. For image matching, camera self-calibration and bundle block adjustment, most approaches make use of scale-invariant feature transform (SIFT) to identify homologous points in multiple images. SIFT-like point matching is robust to apparent translation, rotation, and scaling of objects in multiple viewing geometries but the number of correctly identified matching points typically declines drastically with increasing angles between the viewpoints. For the application of multi-view stereo of complex landslide scenes, the viewing geometry is often constrained by the local topography and barriers such as rocks and vegetation occluding the target. Under such conditions it is not uncommon to encounter view angle differences of > 30% that hinder the image matching and eventually prohibit the joint estimation of the camera parameters from all views. Recently an affine invariant extension of the SIFT detector (ASIFT) has been demonstrated to provide more robust matches when large view-angle differences become an issue. In this study the ASIFT detector was adopted to detect homologous points in terrestrial photographs preceding 3D reconstruction of different parts (main scarp, toe) of the Super-Sauze landslide (Southern French Alps). 3D surface models for different time periods and different parts of the landslide were derived using the multi-view stereo framework implemented in MicMac (©IGN). The obtained 3D models were compared with reconstructions using the traditional SIFT detectors as well as alternative structure-from-motion implementations. An estimate of the absolute accuracy of the photogrammetric models was obtained through co-registration and comparison with high-resolution terrestrial LiDAR scans.
Robust estimation of albedo for illumination-invariant matching and shape recovery.
Biswas, Soma; Aggarwal, Gaurav; Chellappa, Rama
2009-05-01
We present a nonstationary stochastic filtering framework for the task of albedo estimation from a single image. There are several approaches in the literature for albedo estimation, but few include the errors in estimates of surface normals and light source direction to improve the albedo estimate. The proposed approach effectively utilizes the error statistics of surface normals and illumination direction for robust estimation of albedo, for images illuminated by single and multiple light sources. The albedo estimate obtained is subsequently used to generate albedo-free normalized images for recovering the shape of an object. Traditional Shape-from-Shading (SFS) approaches often assume constant/piecewise constant albedo and known light source direction to recover the underlying shape. Using the estimated albedo, the general problem of estimating the shape of an object with varying albedo map and unknown illumination source is reduced to one that can be handled by traditional SFS approaches. Experimental results are provided to show the effectiveness of the approach and its application to illumination-invariant matching and shape recovery. The estimated albedo maps are compared with the ground truth. The maps are used as illumination-invariant signatures for the task of face recognition across illumination variations. The recognition results obtained compare well with the current state-of-the-art approaches. Impressive shape recovery results are obtained using images downloaded from the Web with little control over imaging conditions. The recovered shapes are also used to synthesize novel views under novel illumination conditions.
NASA Astrophysics Data System (ADS)
Morstad, D.; Doelling, D. R.; Scarino, B.; Gopalan, A.; Bhatt, R.; Minnis, P.
2010-12-01
The Advanced Very High Resolution Radiometer (AVHRR) record spans over 30 years and provides a unique opportunity for long-term climate studies. The precision of these climate studies is largely reliant on the consistent absolute calibration of the AVHRR visible data. Currently, AVHRR visible sensors lack onboard calibration and must be vicariously monitored to assure stability over time. AVHRR onboard the NOAA satellites are on a degrading sun-synchronous orbit where the solar zenith angle continuously increases through time. The ray-matching technique can be used to transfer the calibration of a well-calibrated sensor, such as MODIS that employs a solar diffuser, to an un-calibrated sensor, such as AVHRR. In order to transfer the MODIS calibration to AVHRR, existing GEO satellites will be used as a transfer medium. Successive GEO to AVHRR transfers and AVHRR to GEO transfers will be used to maintain a consistent absolute calibration throughout the AVHRR record. To ensure the absolute calibration is accurately transferred, differences in the spectral response functions between each sensor can be removed using ENVISAT Scanning Imaging Absorption Spectrometer for Atmospheric Cartography (SCIAMACHY) hyperspectral data and spectral band adjustment factors. The temporal trends in the absolute calibration of AVHRR and GEO can be validated using pseudo-invariant test sites as well as deep convective cloud targets. This presentation will show examples of ray-matching, spectral band adjustment, DCC, and desert trending techniques and highlight the initial results for lifetime calibration of AVHRR onboard NOAA 16 and NOAA18.
NASA Astrophysics Data System (ADS)
Swathanthira Kumar, M. M.; Sullivan, John M., Jr.
2007-03-01
Medical research is dominated by animal models, especially rats and mice. Within a species most laboratory subjects exhibit little variation in brain anatomy. This uniformity of features is used to crop regions of interest based upon a known, cropped brain atlas. For any study involving N subjects, image registration or alignment to an atlas is required to construct a composite result. A highly resolved stack of T2 weighted MRI anatomy images of a Sprague-Dawley rat was registered and cropped to a known segmented atlas. This registered MRI volume was used as the reference atlas. A Pulse Coupled Neural Network (PCNN) was used to separate brain tissue from surrounding structures, such as cranium and muscle. Each iteration of the PCNN produces binary images of increasing area as the intensity spectrum is increased. A rapid filtering algorithm is applied that breaks narrow passages connecting larger segmented areas. A Generalized Invariant Hough Transform is applied subsequently to each PCNN segmented area to identify which segmented reference slice it matches. This process is repeated for multiple slices within each subject. Since we have apriori knowledge of the image ordering and fields of view this information provides initial estimates for subsequent registration codes. This process of subject slice extraction to PCNN mask creations and GIHT matching with known atlas locations is fully automatic.
Similarity invariant partial shape matching using coarse-to-fine strategy
NASA Astrophysics Data System (ADS)
Zhang, Xinfeng
2014-09-01
The matching between an open contour and a closed contour is a basis for the alignment of their common part and a similarity measure. We propose a coarse-to-fine method for partial shape matching, which does not need to scan the target shape, construct a codebook of model contour fragments, or depend on background support domains. For this purpose, a linearization algorithm for partial shapes is introduced to extract the initial shape segments from the closed contour those possibly match with the open contour. The next refining procedure of the coarse matching eliminates significantly dissimilar shape segments to reduce the further processing of fine matching. We propose a shape similarity description to finely describe the similarity between the open contour and the remaining shape segments. Finally, an order-preserving point injection between the open contour and the closed contour is established. Valuations of the proposed method on a benchmark dataset and real images demonstrate that the overall and component performances are excellent and robust to various disturbances and similarity transformations. Last, a gesture recognition application is implemented.
A new template matching method based on contour information
NASA Astrophysics Data System (ADS)
Cai, Huiying; Zhu, Feng; Wu, Qingxiao; Li, Sicong
2014-11-01
Template matching is a significant approach in machine vision due to its effectiveness and robustness. However, most of the template matching methods are so time consuming that they can't be used to many real time applications. The closed contour matching method is a popular kind of template matching methods. This paper presents a new closed contour template matching method which is suitable for two dimensional objects. Coarse-to-fine searching strategy is used to improve the matching efficiency and a partial computation elimination scheme is proposed to further speed up the searching process. The method consists of offline model construction and online matching. In the process of model construction, triples and distance image are obtained from the template image. A certain number of triples which are composed by three points are created from the contour information that is extracted from the template image. The rule to select the three points is that the template contour is divided equally into three parts by these points. The distance image is obtained here by distance transform. Each point on the distance image represents the nearest distance between current point and the points on the template contour. During the process of matching, triples of the searching image are created with the same rule as the triples of the model. Through the similarity that is invariant to rotation, translation and scaling between triangles, the triples corresponding to the triples of the model are found. Then we can obtain the initial RST (rotation, translation and scaling) parameters mapping the searching contour to the template contour. In order to speed up the searching process, the points on the searching contour are sampled to reduce the number of the triples. To verify the RST parameters, the searching contour is projected into the distance image, and the mean distance can be computed rapidly by simple operations of addition and multiplication. In the fine searching process
NASA Astrophysics Data System (ADS)
Xing, Jing; Wei, Zhenzhong; Zhang, Guangjun
2016-10-01
This paper reports an efficient method for line matching, which utilizes local intensity gradient information and neighboring geometric attributes. Lines are detected in a multi-scale way to make the method robust to scale changes. A descriptor based on local appearance is built to generate candidate matching pairs. The key idea is to accumulate intensity gradient information into histograms based on their intensity orders to overcome the fragmentation problem of lines. Besides, local coordinate system is built for each line to achieve rotation invariance. For each line segment in candidate matching pairs, a histogram is built by aggregating geometric attributes of neighboring line segments. The final matching measure derives from the distance between normalized geometric attributes histograms. Experiments show that the proposed method is robust to large illumination changes and is rotation invariant.
Systems and methods for measuring component matching
NASA Technical Reports Server (NTRS)
Courter, Kelly J. (Inventor); Slenk, Joel E. (Inventor)
2006-01-01
Systems and methods for measuring a contour match between adjacent components are disclosed. In one embodiment, at least two pressure sensors are located between adjacent components. Each pressure sensor is adapted to obtain a pressure measurement at a location a predetermined distance away from the other pressure sensors, and to output a pressure measurement for each sensor location. An output device is adapted to receive the pressure measurements from at least two pressure sensors and display the pressure measurements. In one aspect, the pressure sensors include flexible thin film pressure sensors. In accordance with other aspects of the invention, a method is provided for measuring a contour match between two interfacing components including measuring at least one pressure applied to at least one sensor between the interfacing components.
A novel eye localization method with rotation invariance.
Ren, Yan; Wang, Shuang; Hou, Biao; Ma, Jingjing
2014-01-01
This paper presents a novel learning method for precise eye localization, a challenge to be solved in order to improve the performance of face processing algorithms. Few existing approaches can directly detect and localize eyes with arbitrary angels in predicted eye regions, face images, and original portraits at the same time. To preserve rotation invariant property throughout the entire eye localization framework, a codebook of invariant local features is proposed for the representation of eye patterns. A heat map is then generated by integrating a 2-class sparse representation classifier with a pyramid-like detecting and locating strategy to fulfill the task of discriminative classification and precise localization. Furthermore, a series of prior information is adopted to improve the localization precision and accuracy. Experimental results on three different databases show that our method is capable of effectively locating eyes in arbitrary rotation situations (360° in plane).
NASA Astrophysics Data System (ADS)
Grusdt, Fabian; Abanin, Dmitry; Demler, Eugene
2013-05-01
Recently experiments with ultracold atoms started to explore topological phases in 1D optical lattices. While transport measurements are challenging in these systems, ways to directly measure topological quantum numbers using a combination of Bloch oscillations and Ramsey interferometry have been explored (Atala et al., arXiv:1212.0572). In this talk I will present ways to measure the Z2 topological quantum numbers of two and three dimensional time-reversal invariant (TR) topological insulators. In this case non-Abelian Bloch oscillations can be combined with Ramsey interferometry to map out the topological properties of a given band-structure. Our method is very general and works even in the presence of accidental degeneracies. The applicability of the scheme is discussed for different theoretically proposed implementations of TR topological insulators using ultracold atoms. F. G. is grateful to Harvard University for hospitality and acknowledges financial support from Graduate School Materials Science in Mainz (MAINZ).
Chaotic background phase matching signal separation method
NASA Astrophysics Data System (ADS)
Peng, Wu; Hui, Xia; Chen, Wang
2016-07-01
Aiming at the problem of separating the useful signal in the chaos background and using the phase matching method, the signal can be extracted effectively from the chaotic background. In this method, the chaotic background is not estimated with phase reconstruction and the geometric analysis of phase space is not required. Through the separation Simulation of the sinusoidal signal in the chaos background and the separation degree analysis, the low signal to noise ratio of the signal in the chaos background can be effectively separated. The effect of removing the chaotic background noise is obvious.
NASA Astrophysics Data System (ADS)
Mansourian, Leila; Taufik Abdullah, Muhamad; Nurliyana Abdullah, Lili; Azman, Azreen; Mustaffa, Mas Rina
2017-02-01
Pyramid Histogram of Words (PHOW), combined Bag of Visual Words (BoVW) with the spatial pyramid matching (SPM) in order to add location information to extracted features. However, different PHOW extracted from various color spaces, and they did not extract color information individually, that means they discard color information, which is an important characteristic of any image that is motivated by human vision. This article, concatenated PHOW Multi-Scale Dense Scale Invariant Feature Transform (MSDSIFT) histogram and a proposed Color histogram to improve the performance of existing image classification algorithms. Performance evaluation on several datasets proves that the new approach outperforms other existing, state-of-the-art methods.
Hydrograph matching method for measuring model performance
NASA Astrophysics Data System (ADS)
Ewen, John
2011-09-01
SummaryDespite all the progress made over the years on developing automatic methods for analysing hydrographs and measuring the performance of rainfall-runoff models, automatic methods cannot yet match the power and flexibility of the human eye and brain. Very simple approaches are therefore being developed that mimic the way hydrologists inspect and interpret hydrographs, including the way that patterns are recognised, links are made by eye, and hydrological responses and errors are studied and remembered. In this paper, a dynamic programming algorithm originally designed for use in data mining is customised for use with hydrographs. It generates sets of "rays" that are analogous to the visual links made by the hydrologist's eye when linking features or times in one hydrograph to the corresponding features or times in another hydrograph. One outcome from this work is a new family of performance measures called "visual" performance measures. These can measure differences in amplitude and timing, including the timing errors between simulated and observed hydrographs in model calibration. To demonstrate this, two visual performance measures, one based on the Nash-Sutcliffe Efficiency and the other on the mean absolute error, are used in a total of 34 split-sample calibration-validation tests for two rainfall-runoff models applied to the Hodder catchment, northwest England. The customised algorithm, called the Hydrograph Matching Algorithm, is very simple to apply; it is given in a few lines of pseudocode.
NASA Astrophysics Data System (ADS)
Rodrigues, Marco Túlio A. N.; Balbino de Mesquita, Daniel; Nascimento, Erickson R.; Schwartz, William Robson
2016-01-01
In several image processing applications, discovering regions that have changed in a set of images acquired from a scene at different times and possibly from different viewpoints plays a very important role. Remote sensing, visual surveillance, medical diagnosis, civil infrastructure, and underwater sensing are examples of such applications that operate in dynamic environments. We propose an approach to detect such changes automatically by using image analysis techniques and segmentation based on superpixels in two stages: (1) the tuning stage, which is focused on adjusting the parameters; and (2) the unsupervised stage that is executed in real scenarios without an appropriate ground truth. Unlike most common approaches, which are pixel-based, our approach combines superpixel extraction, hierarchical clustering, and segment matching. Experimental results demonstrate the effectiveness of the proposed approach compared to a remote sensing technique and a background subtraction technique, demonstrating the robustness of our algorithm against illumination variations.
An image matching method based on closed edges incorporated with vertex angles
NASA Astrophysics Data System (ADS)
Zhang, Baoming; Chen, Xiaowei; Lu, Jun; Gong, Zhihui; Guo, Haitao
2015-10-01
An image matching method based on closed edges incorporated with vertex angles is proposed in this paper. Based on edge detection results by Edison operator, invariant moments of closed edges and angles between the two branches for edge vertexes are used as matching entities to determine conjugate features candidates. The transformation relationship between images is approximated by similarity transformation model, and a set of transformation parameters can be determined by each pair of conjugate features after combining conjugate feature candidates in pair-wise. Furthermore, considering that the difference among transformation parameters which calculated by real conjugate features are minor, K-d tree method and K-means Spatial clustering method are used in succession to eliminate pairs which contain mismatching features. Therefore, conjugate features can be obtained from the similarity transformation parameters. Experimental results turn out that this method shows a stable performance and presents a satisfactory matching result.
Longitudinal Invariance of Self-Esteem and Method Effects Associated with Negatively Worded Items.
ERIC Educational Resources Information Center
Motl, Robert W.; DiStefano, Christine
2002-01-01
Examined the longitudinal invariance of method effects associated with negatively worded items on a self-report measure of global self-esteem. Data from the National Educational Longitudinal Study for 3,950 junior high school and high school students show that the method effects associated with negatively worded items exhibit invariance across…
Bayesian Stereo Matching Method Based on Edge Constraints.
Li, Jie; Shi, Wenxuan; Deng, Dexiang; Jia, Wenyan; Sun, Mingui
2012-12-01
A new global stereo matching method is presented that focuses on the handling of disparity, discontinuity and occlusion. The Bayesian approach is utilized for dense stereo matching problem formulated as a maximum a posteriori Markov Random Field (MAP-MRF) problem. In order to improve stereo matching performance, edges are incorporated into the Bayesian model as a soft constraint. Accelerated belief propagation is applied to obtain the maximum a posteriori estimates in the Markov random field. The proposed algorithm is evaluated using the Middlebury stereo benchmark. Our experimental results comparing with some state-of-the-art stereo matching methods demonstrate that the proposed method provides superior disparity maps with a subpixel precision.
A quantitative method for measuring the quality of history matches
Shaw, T.S.; Knapp, R.M.
1997-08-01
History matching can be an efficient tool for reservoir characterization. A {open_quotes}good{close_quotes} history matching job can generate reliable reservoir parameters. However, reservoir engineers are often frustrated when they try to select a {open_quotes}better{close_quotes} match from a series of history matching runs. Without a quantitative measurement, it is always difficult to tell the difference between a {open_quotes}good{close_quotes} and a {open_quotes}better{close_quotes} matches. For this reason, we need a quantitative method for testing the quality of matches. This paper presents a method for such a purpose. The method uses three statistical indices to (1) test shape conformity, (2) examine bias errors, and (3) measure magnitude of deviation. The shape conformity test insures that the shape of a simulated curve matches that of a historical curve. Examining bias errors assures that model reservoir parameters have been calibrated to that of a real reservoir. Measuring the magnitude of deviation assures that the difference between the model and the real reservoir parameters is minimized. The method was first tested on a hypothetical model and then applied to published field studies. The results showed that the method can efficiently measure the quality of matches. It also showed that the method can serve as a diagnostic tool for calibrating reservoir parameters during history matching.
PIPI: PTM-Invariant Peptide Identification Using Coding Method.
Yu, Fengchao; Li, Ning; Yu, Weichuan
2016-12-02
In computational proteomics, the identification of peptides with an unlimited number of post-translational modification (PTM) types is a challenging task. The computational cost associated with database search increases exponentially with respect to the number of modified amino acids and linearly with respect to the number of potential PTM types at each amino acid. The problem becomes intractable very quickly if we want to enumerate all possible PTM patterns. To address this issue, one group of methods named restricted tools (including Mascot, Comet, and MS-GF+) only allow a small number of PTM types in database search process. Alternatively, the other group of methods named unrestricted tools (including MS-Alignment, ProteinProspector, and MODa) avoids enumerating PTM patterns with an alignment-based approach to localizing and characterizing modified amino acids. However, because of the large search space and PTM localization issue, the sensitivity of these unrestricted tools is low. This paper proposes a novel method named PIPI to achieve PTM-invariant peptide identification. PIPI belongs to the category of unrestricted tools. It first codes peptide sequences into Boolean vectors and codes experimental spectra into real-valued vectors. For each coded spectrum, it then searches the coded sequence database to find the top scored peptide sequences as candidates. After that, PIPI uses dynamic programming to localize and characterize modified amino acids in each candidate. We used simulation experiments and real data experiments to evaluate the performance in comparison with restricted tools (i.e., Mascot, Comet, and MS-GF+) and unrestricted tools (i.e., Mascot with error tolerant search, MS-Alignment, ProteinProspector, and MODa). Comparison with restricted tools shows that PIPI has a close sensitivity and running speed. Comparison with unrestricted tools shows that PIPI has the highest sensitivity except for Mascot with error tolerant search and Protein
Robust polygon recognition method with similarity invariants applied to star identification
NASA Astrophysics Data System (ADS)
Hernández, E. Antonio; Alonso, Miguel A.; Chávez, Edgar; Covarrubias, David H.; Conte, Roberto
2017-02-01
In the star identification process the goal is to recognize a star by using the celestial bodies in its vicinity as context. An additional requirement is to avoid having to perform an exhaustive scan of the star database. In this paper we present a novel approach to star identification using similarity invariants. More specifically, the proposed algorithm defines a polygon for each star, using the neighboring celestial bodies in the field of view as vertices. The mapping is insensitive to similarity transformation; that is, the image of the polygon under the transformation is not affected by rotation, scaling or translations. Each polygon is associated with an essentially unique complex number. We perform an exhaustive experimental validation of the proposed algorithm using synthetic data generated from the star catalog with uniformly-distributed positional noise introduced to each star. The star identification method that we present is proven to be robust, achieving a recognition rate of 99.68% when noise levels of up to ± 424 μ radians are introduced to the location of the stars. In our tests the proposed algorithm proves that if a polygon match is found, it always corresponds to the star under analysis; no mismatches are found. In its present form our method cannot identify polygons in cases where there exist missing or false stars in the analyzed images, in those situations it only indicates that no match was found.
Method of stereo matching based on genetic algorithm
NASA Astrophysics Data System (ADS)
Lu, Chaohui; An, Ping; Zhang, Zhaoyang
2003-09-01
A new stereo matching scheme based on image edge and genetic algorithm (GA) is presented to improve the conventional stereo matching method in this paper. In order to extract robust edge feature for stereo matching, infinite symmetric exponential filter (ISEF) is firstly applied to remove the noise of image, and nonlinear Laplace operator together with local variance of intensity are then used to detect edges. Apart from the detected edge, the polarity of edge pixels is also obtained. As an efficient search method, genetic algorithm is applied to find the best matching pair. For this purpose, some new ideas are developed for applying genetic algorithm to stereo matching. Experimental results show that the proposed methods are effective and can obtain good results.
NASA Astrophysics Data System (ADS)
Kurnyavko, O. L.; Shirokov, I. V.
2016-07-01
We offer a method for constructing invariants of the coadjoint representation of Lie groups that reduces this problem to known problems of linear algebra. This method is based on passing to symplectic coordinates on the coadjoint representation orbits, which play the role of local coordinates on those orbits. The corresponding transition functions are their parametric equations. Eliminating the symplectic coordinates from the transition functions, we can obtain the complete set of invariants. The proposed method allows solving the problem of constructing invariants of the coadjoint representation for Lie groups with an arbitrary dimension and structure.
A TSR Visual Servoing System Based on a Novel Dynamic Template Matching Method.
Cai, Jia; Huang, Panfeng; Zhang, Bin; Wang, Dongke
2015-12-21
The so-called Tethered Space Robot (TSR) is a novel active space debris removal system. To solve its problem of non-cooperative target recognition during short-distance rendezvous events, this paper presents a framework for a real-time visual servoing system using non-calibrated monocular-CMOS (Complementary Metal Oxide Semiconductor). When a small template is used for matching with a large scene, it always leads to mismatches, so a novel template matching algorithm to solve the problem is presented. Firstly, the novel matching algorithm uses a hollow annulus structure according to a FAST (Features from Accelerated Segment) algorithm and makes the method be rotation-invariant. Furthermore, the accumulative deviation can be decreased by the hollow structure. The matching function is composed of grey and gradient differences between template and object image, which help it reduce the effects of illumination and noises. Then, a dynamic template update strategy is designed to avoid tracking failures brought about by wrong matching or occlusion. Finally, the system synthesizes the least square integrated predictor, realizing tracking online in complex circumstances. The results of ground experiments show that the proposed algorithm can decrease the need for sophisticated computation and improves matching accuracy.
A TSR Visual Servoing System Based on a Novel Dynamic Template Matching Method †
Cai, Jia; Huang, Panfeng; Zhang, Bin; Wang, Dongke
2015-01-01
The so-called Tethered Space Robot (TSR) is a novel active space debris removal system. To solve its problem of non-cooperative target recognition during short-distance rendezvous events, this paper presents a framework for a real-time visual servoing system using non-calibrated monocular-CMOS (Complementary Metal Oxide Semiconductor). When a small template is used for matching with a large scene, it always leads to mismatches, so a novel template matching algorithm to solve the problem is presented. Firstly, the novel matching algorithm uses a hollow annulus structure according to a FAST (Features from Accelerated Segment) algorithm and makes the method be rotation-invariant. Furthermore, the accumulative deviation can be decreased by the hollow structure. The matching function is composed of grey and gradient differences between template and object image, which help it reduce the effects of illumination and noises. Then, a dynamic template update strategy is designed to avoid tracking failures brought about by wrong matching or occlusion. Finally, the system synthesizes the least square integrated predictor, realizing tracking online in complex circumstances. The results of ground experiments show that the proposed algorithm can decrease the need for sophisticated computation and improves matching accuracy. PMID:26703609
Improved artificial bee colony algorithm based gravity matching navigation method.
Gao, Wei; Zhao, Bo; Zhou, Guang Tao; Wang, Qiu Ying; Yu, Chun Yang
2014-07-18
Gravity matching navigation algorithm is one of the key technologies for gravity aided inertial navigation systems. With the development of intelligent algorithms, the powerful search ability of the Artificial Bee Colony (ABC) algorithm makes it possible to be applied to the gravity matching navigation field. However, existing search mechanisms of basic ABC algorithms cannot meet the need for high accuracy in gravity aided navigation. Firstly, proper modifications are proposed to improve the performance of the basic ABC algorithm. Secondly, a new search mechanism is presented in this paper which is based on an improved ABC algorithm using external speed information. At last, modified Hausdorff distance is introduced to screen the possible matching results. Both simulations and ocean experiments verify the feasibility of the method, and results show that the matching rate of the method is high enough to obtain a precise matching position.
NASA Astrophysics Data System (ADS)
Ren, Zhong; Liu, Guodong
2016-11-01
To improve the denoising effect of the glucose photoacoustic signals, a modified wavelet thresholding combined shift-invariance algorithm was used in this paper. In addition, the shift-invariance method was added into the improved algorithm. To verify the feasibility of modified wavelet shift-invariance threshold denoising algorithm, the simulation experiments were performed. Results show that the denoising effect of modified wavelet shift-invariance thresholding algorithm is better than that of others because its signal-to-noise ratio is largest and the root-mean-square error is lest. Finally, the modified wavelet shift-invariance threshold denoising was used to remove the noises of the photoacoustic signals of glucose aqueous solutions.
A method for matching Chinese place-name data
NASA Astrophysics Data System (ADS)
Liao, Yilan; Wang, Jinfeng
2009-10-01
Conversion and sharing of spatial data from different departments is an essential part of information construction in China. The first step of the solution is to match place-name data. However, there are administrative changes in some places with the development of urbanization process. It undoubtedly increases the difficulty to match place-name data. In the daily work, the data are artificially matched with available place-name database and materials such as graphs and record cards. Although it is easy to put in practice, this method may cost a lot of time and labor to keep the accuracy. The algorithms for matching strings can be used to solve the problem. But most of them focus on solving the English strings match problems and less refer to Chinese. In the paper, BPM-BM (Bit-Parallel Matrix -Boyer Moore) algorithm, the most efficient filter method for approximate string matching of Chinese text, is proposed to match place-names between the national surveillance sites of infectious diseases and the 1:1, 000, 000 scale township map of China in 2000. The study indicated that the proposed method decreased artificial process greatly and the accuracy which achieved 94.2% was higher than the SQL commands method.
Feature matching method in shaped light mode VFD defect detection
NASA Astrophysics Data System (ADS)
Jin, Xuanhong; Dai, Shuguang; Mu, Pingan
2010-08-01
In recent years, Vacuum Fluorescent Display (VFD) module in the car audio panel has been widely used. However, due to process reasons, VFD display production process will produce defects, not only affect the appearance, but also affect the display correctly. So building a car VFD display panel defect detection system is of great significance. Machine vision technology is introduced into the automotive VFD display defect detection in order to achieve fast and accurate detection of defects. Shaped light mode is a typical flaw detection mode which is based on characteristics of vehicle VFD panel. According to the image features, learning of the gray matching and feature matching method, we integrated use of feature matching method and the gray level matching method to achieve defect detection.
Method and apparatus for measuring flow velocity using matched filters
Raptis, Apostolos C.
1983-01-01
An apparatus and method for measuring the flow velocities of individual phase flow components of a multiphase flow utilizes matched filters. Signals arising from flow noise disturbance are extracted from the flow, at upstream and downstream locations. The signals are processed through pairs of matched filters which are matched to the flow disturbance frequency characteristics of the phase flow component to be measured. The processed signals are then cross-correlated to determine the transit delay time of the phase flow component between sensing positions.
Method and apparatus for measuring flow velocity using matched filters
Raptis, A.C.
1983-09-06
An apparatus and method for measuring the flow velocities of individual phase flow components of a multiphase flow utilizes matched filters. Signals arising from flow noise disturbance are extracted from the flow, at upstream and downstream locations. The signals are processed through pairs of matched filters which are matched to the flow disturbance frequency characteristics of the phase flow component to be measured. The processed signals are then cross-correlated to determine the transit delay time of the phase flow component between sensing positions. 8 figs.
Areal Feature Matching Based on Similarity Using Critic Method
NASA Astrophysics Data System (ADS)
Kim, J.; Yu, K.
2015-10-01
In this paper, we propose an areal feature matching method that can be applied for many-to-many matching, which involves matching a simple entity with an aggregate of several polygons or two aggregates of several polygons with fewer user intervention. To this end, an affine transformation is applied to two datasets by using polygon pairs for which the building name is the same. Then, two datasets are overlaid with intersected polygon pairs that are selected as candidate matching pairs. If many polygons intersect at this time, we calculate the inclusion function between such polygons. When the value is more than 0.4, many of the polygons are aggregated as single polygons by using a convex hull. Finally, the shape similarity is calculated between the candidate pairs according to the linear sum of the weights computed in CRITIC method and the position similarity, shape ratio similarity, and overlap similarity. The candidate pairs for which the value of the shape similarity is more than 0.7 are determined as matching pairs. We applied the method to two geospatial datasets: the digital topographic map and the KAIS map in South Korea. As a result, the visual evaluation showed two polygons that had been well detected by using the proposed method. The statistical evaluation indicates that the proposed method is accurate when using our test dataset with a high F-measure of 0.91.
The Vector Matching Method in Geomagnetic Aiding Navigation.
Song, Zhongguo; Zhang, Jinsheng; Zhu, Wenqi; Xi, Xiaoli
2016-07-20
In this paper, a geomagnetic matching navigation method that utilizes the geomagnetic vector is developed, which can greatly improve the matching probability and positioning precision, even when the geomagnetic entropy information in the matching region is small or the geomagnetic contour line's variety is obscure. The vector iterative closest contour point (VICCP) algorithm that is proposed here has better adaptability with the positioning error characteristics of the inertial navigation system (INS), where the rigid transformation in ordinary ICCP is replaced with affine transformation. In a subsequent step, a geomagnetic vector information fusion algorithm based on Bayesian statistical analysis is introduced into VICCP to improve matching performance further. Simulations based on the actual geomagnetic reference map have been performed for the validation of the proposed algorithm.
The Vector Matching Method in Geomagnetic Aiding Navigation
Song, Zhongguo; Zhang, Jinsheng; Zhu, Wenqi; Xi, Xiaoli
2016-01-01
In this paper, a geomagnetic matching navigation method that utilizes the geomagnetic vector is developed, which can greatly improve the matching probability and positioning precision, even when the geomagnetic entropy information in the matching region is small or the geomagnetic contour line’s variety is obscure. The vector iterative closest contour point (VICCP) algorithm that is proposed here has better adaptability with the positioning error characteristics of the inertial navigation system (INS), where the rigid transformation in ordinary ICCP is replaced with affine transformation. In a subsequent step, a geomagnetic vector information fusion algorithm based on Bayesian statistical analysis is introduced into VICCP to improve matching performance further. Simulations based on the actual geomagnetic reference map have been performed for the validation of the proposed algorithm. PMID:27447645
Development of a Matched Runs Method for VERITAS
NASA Astrophysics Data System (ADS)
Flinders, Andrew; VERITAS Collaboration
2016-03-01
VERITAS is an array of four Imaging Air Cherenkov Telescopes located in southern Arizona. It has been successful in detecting Very High Energy (VHE) radiation from a variety of sources including pulsars, Pulsar Wind Nebulae, Blazars, and High Mass X-Ray Binary systems. Each of these detections been accomplished using either the standard Ring Background Method or the Reflected Region Method in order to determine the appropriate background for the source region. For highly extended sources (>1 degree) these background estimation methods become unsuitable due to the possibility of source contamination in the background regions. A new method, called the matched background method, has been implemented for potentially highly extended sources observed by VERITAS. It provides and algorithm for identifying a suitable gamma-ray background estimation from a different field of view than the source region. By carefully matching cosmic-ray event rates between the source and the background sky observations, a suitable gamma-ray background matched data set can be identified. We will describe the matched background method and give examples of its use for several sources including the Crab Nebula and IC443. This research is supported by Grants from the U.S. Department of Energy Office of Science, the U.S. National Science Foundation and the Smithsonian Institution, and by NSERC in Canada.
Invariant measures of smooth dynamical systems, generalized functions and summation methods
NASA Astrophysics Data System (ADS)
Kozlov, V. V.
2016-04-01
We discuss conditions for the existence of invariant measures of smooth dynamical systems on compact manifolds. If there is an invariant measure with continuously differentiable density, then the divergence of the vector field along every solution tends to zero in the Cesàro sense as time increases unboundedly. Here the Cesàro convergence may be replaced, for example, by any Riesz summation method, which can be arbitrarily close to ordinary convergence (but does not coincide with it). We give an example of a system whose divergence tends to zero in the ordinary sense but none of its invariant measures is absolutely continuous with respect to the `standard' Lebesgue measure (generated by some Riemannian metric) on the phase space. We give examples of analytic systems of differential equations on analytic phase spaces admitting invariant measures of any prescribed smoothness (including a measure with integrable density), but having no invariant measures with positive continuous densities. We give a new proof of the classical Bogolyubov-Krylov theorem using generalized functions and the Hahn-Banach theorem. The properties of signed invariant measures are also discussed.
Almeida, Leandro G.; Sturm, Christian
2010-09-01
Light quark masses can be determined through lattice simulations in regularization invariant momentum-subtraction (RI/MOM) schemes. Subsequently, matching factors, computed in continuum perturbation theory, are used in order to convert these quark masses from a RI/MOM scheme to the MS scheme. We calculate the two-loop corrections in QCD to these matching factors as well as the three-loop mass anomalous dimensions for the RI/SMOM and RI/SMOM{sub {gamma}{sub {mu}} }schemes. These two schemes are characterized by a symmetric subtraction point. Providing the conversion factors in the two different schemes allows for a better understanding of the systematic uncertainties. The two-loop expansion coefficients of the matching factors for both schemes turn out to be small compared to the traditional RI/MOM schemes. For n{sub f}=3 quark flavors they are about 0.6%-0.7% and 2%, respectively, of the leading order result at scales of about 2 GeV. Therefore, they will allow for a significant reduction of the systematic uncertainty of light quark mass determinations obtained through this approach. The determination of these matching factors requires the computation of amputated Green's functions with the insertions of quark bilinear operators. As a by-product of our calculation we also provide the corresponding results for the tensor operator.
Method and apparatus for measuring flow velocity using matched filters
Raptis, A.C.
1981-07-17
An apparatus and method for measuring the flow velocities of individual phase flow components of a multiphase flow is disclosed. Signals arising from flow noise disturbance are extracted from the flow, at upstream and downstream locations. The signals are processed through pairs of matched filters which are matched to the flow disturbance frequency characteristics of the phase flow component to be measured. The processed signals are then cross-correlated to determine the transit delay time of the phase flow component between sensing positions.
A Finger Vein Identification Method Based on Template Matching
NASA Astrophysics Data System (ADS)
Zou, Hui; Zhang, Bing; Tao, Zhigang; Wang, Xiaoping
2016-01-01
New methods for extracting vein features from finger vein image and generating templates for matching are proposed. In the algorithm for generating templates, we proposed a parameter-templates quality factor (TQF) - to measure the quality of generated templates. So that we can use fewer finger vein samples to generate templates that meet the quality requirement of identification. The recognition accuracy of using proposed methods of finger vein feature extraction and template generation strategy for identification is 97.14%.
Al-Osaimi, Faisal R
2016-02-01
In this paper, a novel approach to local 3D surface matching representation suitable for a range of 3D vision applications is introduced. Local 3D surface patches around key points on the 3D surface are represented by 2D images such that the representing 2D images enjoy certain characteristics which positively impact the matching accuracy, robustness, and speed. First, the proposed representation is complete, in the sense, there is no information loss during their computation. Second, the 3DoF 2D representations are strictly invariant to all the 3DoF rotations. To optimally avail surface information, the sensitivity of the representations to surface information is adjustable. This also provides the proposed matching representation with the means to optimally adjust to a particular class of problems/applications or an acquisition technology. Each 2D matching representation is a sequence of adjustable integral kernels, where each kernel is efficiently computed from a triple of precise 3D curves (profiles) formed by intersecting three concentric spheres with the 3D surface. Robust techniques for sampling the profiles and establishing correspondences among them were devised. Based on the proposed matching representation, two techniques for the detection of key points were presented. The first is suitable for static images, while the second is suitable for 3D videos. The approach was tested on the face recognition grand challenge v2.0, the 3D twins expression challenge, and the Bosphorus data sets, and a superior face recognition performance was achieved. In addition, the proposed approach was used in object class recognition and tested on a Kinect data set.
Calculation of NMR chemical shifts. 7. Gauge-invariant INDO method
NASA Astrophysics Data System (ADS)
Fukui, H.; Miura, K.; Hirai, A.
A gauge-invariant INDO method based on the coupled Hartree-Fuck perturbation theory is presented and applied to the calculation of 1H and 13C chemical shifts of hydrocarbons including ring compounds. Invariance of the diamagnetic and paramagnetic shieldings with respect to displacement of the coordinate origin is discussed. Comparison between calculated and experimental results exhibits fairly good agreement, provided that the INDO parameters of Ellis et al. (J. Am. Chem. Soc.94, 4069 (1972)) are used with the inclusion of all multicenter one-electron integrals.
Tests of Measurement Invariance without Subgroups: A Generalization of Classical Methods
ERIC Educational Resources Information Center
Merkle, Edgar C.; Zeileis, Achim
2013-01-01
The issue of measurement invariance commonly arises in factor-analytic contexts, with methods for assessment including likelihood ratio tests, Lagrange multiplier tests, and Wald tests. These tests all require advance definition of the number of groups, group membership, and offending model parameters. In this paper, we study tests of measurement…
MR Image Reconstruction Using Block Matching and Adaptive Kernel Methods
Schmidt, Johannes F. M.; Santelli, Claudio; Kozerke, Sebastian
2016-01-01
An approach to Magnetic Resonance (MR) image reconstruction from undersampled data is proposed. Undersampling artifacts are removed using an iterative thresholding algorithm applied to nonlinearly transformed image block arrays. Each block array is transformed using kernel principal component analysis where the contribution of each image block to the transform depends in a nonlinear fashion on the distance to other image blocks. Elimination of undersampling artifacts is achieved by conventional principal component analysis in the nonlinear transform domain, projection onto the main components and back-mapping into the image domain. Iterative image reconstruction is performed by interleaving the proposed undersampling artifact removal step and gradient updates enforcing consistency with acquired k-space data. The algorithm is evaluated using retrospectively undersampled MR cardiac cine data and compared to k-t SPARSE-SENSE, block matching with spatial Fourier filtering and k-t ℓ1-SPIRiT reconstruction. Evaluation of image quality and root-mean-squared-error (RMSE) reveal improved image reconstruction for up to 8-fold undersampled data with the proposed approach relative to k-t SPARSE-SENSE, block matching with spatial Fourier filtering and k-t ℓ1-SPIRiT. In conclusion, block matching and kernel methods can be used for effective removal of undersampling artifacts in MR image reconstruction and outperform methods using standard compressed sensing and ℓ1-regularized parallel imaging methods. PMID:27116675
NASA Astrophysics Data System (ADS)
Xiao, Huachao; Zhou, Quan; Li, Li
2015-10-01
Image information onboard processing is one o f important technology to rapidly achieve intelligence for remote sensing satellites. As a typical target, aircraft onboard detection has been getting more attention. In this paper, we propose an efficient method of aircraft detection for remote sensing satellite onboard processing. According to the feature of aircraft performance in remote sensing image, the detection algorithm consists of two steps: First Salient Object Detection (SOD) is employed to reduce the amount of calculation on large remote sensing image. SOD uses Gabor filtering and a simple binary test between pixels in a filtered image. White points are connected as regions. Plane candidate regions are screened from white regions by area, length and width of connected region. Next a new algorithm, called Circumferential Information Matching method, is used to detect aircraft on candidate regions. The results of tests show circumference curve around the plane center is stable shape, so the candidate region can be accurately detecting with this feature. In order to rotation invariant, we use circle matched filter to detect target. And discrete fast Fourier transform (DFFT) is used to accelerate and reduce calculation. Experiments show the detection accuracy rate of proposed algorithm is 90% with less than 0.5s processing time. In addition, the calculation of the proposed method through quantitative anglicized is very small. Experimental results and theoretical analysis show that the proposed method is reasonable and highly-efficient.
A vector matching method for analysing logic Petri nets
NASA Astrophysics Data System (ADS)
Du, YuYue; Qi, Liang; Zhou, MengChu
2011-11-01
Batch processing function and passing value indeterminacy in cooperative systems can be described and analysed by logic Petri nets (LPNs). To directly analyse the properties of LPNs, the concept of transition enabling vector sets is presented and a vector matching method used to judge the enabling transitions is proposed in this article. The incidence matrix of LPNs is defined; an equation about marking change due to a transition's firing is given; and a reachable tree is constructed. The state space explosion is mitigated to a certain extent from directly analysing LPNs. Finally, the validity and reliability of the proposed method are illustrated by an example in electronic commerce.
A Lyapunov method for stability analysis of piecewise-affine systems over non-invariant domains
NASA Astrophysics Data System (ADS)
Rubagotti, Matteo; Zaccarian, Luca; Bemporad, Alberto
2016-05-01
This paper analyses stability of discrete-time piecewise-affine systems, defined on possibly non-invariant domains, taking into account the possible presence of multiple dynamics in each of the polytopic regions of the system. An algorithm based on linear programming is proposed, in order to prove exponential stability of the origin and to find a positively invariant estimate of its region of attraction. The results are based on the definition of a piecewise-affine Lyapunov function, which is in general discontinuous on the boundaries of the regions. The proposed method is proven to lead to feasible solutions in a broader range of cases as compared to a previously proposed approach. Two numerical examples are shown, among which a case where the proposed method is applied to a closed-loop system, to which model predictive control was applied without a-priori guarantee of stability.
Restricted surface matching: a new registration method for medical images
NASA Astrophysics Data System (ADS)
Gong, JianXing; Zamorano, Lucia J.; Jiang, Zhaowei; Nolte, Lutz P.; Diaz, Fernando
1998-06-01
Since its introduction to neurological surgery in the early 1980's, computer assisted surgery (CAS) with and without robotics navigation has been applied to several medical fields. The common issue all CAS systems is registration between two pre-operative 3D image modalities (for example, CT/MRI/PET et al) and the 3D image references of the patient in the operative room. In Wayne State University, a new way is introduced for medical image registration, which is different from traditional fiducial point registration and surface registration. We call it restricted surface matching (RSM). The method fast, convenient, accurate and robust. It combines the advantages from two registration methods mentioned before. Because of a penalty function introduced in its cost function, it is called `RSM'. The surface of a 3D image modality is pre-operatively extracted using segmentation techniques, and a distance map is created from such surface. The surface of another 3D reference is presented by a cloud of 3D points. At least three rough landmarks are used to restrict a registration not far away from global minimum. The local minimum issue is solved by use of a restriction for in the cost function and larger number of random starting points. The accuracy of matching is achieved by gradually releasing the restriction and limiting the influence of outliers. It only needs about half a minute to find the global minimum (for 256 X 256 X 56 images) in a SunSparc 10 station.
Template matching method for the analysis of interstellar cloud structure
NASA Astrophysics Data System (ADS)
Juvela, M.
2016-09-01
Context. The structure of interstellar medium can be characterised at large scales in terms of its global statistics (e.g. power spectra) and at small scales by the properties of individual cores. Interest has been increasing in structures at intermediate scales, resulting in a number of methods being developed for the analysis of filamentary structures. Aims: We describe the application of the generic template-matching (TM) method to the analysis of maps. Our aim is to show that it provides a fast and still relatively robust way to identify elongated structures or other image features. Methods: We present the implementation of a TM algorithm for map analysis. The results are compared against rolling Hough transform (RHT), one of the methods previously used to identify filamentary structures. We illustrate the method by applying it to Herschel surface brightness data. Results: The performance of the TM method is found to be comparable to that of RHT but TM appears to be more robust regarding the input parameters, for example, those related to the selected spatial scales. Small modifications of TM enable one to target structures at different size and intensity levels. In addition to elongated features, we demonstrate the possibility of using TM to also identify other types of structures. Conclusions: The TM method is a viable tool for data quality control, exploratory data analysis, and even quantitative analysis of structures in image data.
A sorting-to-matching method to teach compound matching to sample.
Farber, Rachel S; Dube, William V; Dickson, Chata A
2016-06-01
Individuals with developmental disabilities may fail to attend to multiple features in compound stimuli (e.g., arrays of pictures, letters within words) with detrimental effects on learning. Participants were 5 children with autism spectrum disorder who had low to intermediate accuracy scores (35% to 84%) on a computer-presented compound matching task. Sample stimuli were pairs of icons (e.g., chair-tree), the correct comparison was identical to the sample, and each incorrect comparison had one icon in common with the sample (e.g., chair-sun, airplane-tree). A 5-step tabletop sorting-to-matching training procedure was used to teach compound matching. The first step was sorting 3 single pictures; subsequent steps gradually changed the task to compound matching. If progress stalled, tasks were modified temporarily to prompt observing behavior. After tabletop training, participants were retested on the compound matching task; accuracy improved to at least 95% for all children. This procedure illustrates one way to improve attending to multiple features of compound stimuli.
A Critical Appraisal of NLO+PS Matching Methods
Hoeche, Stefan; Krauss, Frank; Schonherr, Marek; Siegert, Frank; /Freiburg U.
2012-03-19
In this publication, uncertainties in and differences between the MC{at}NLO and POWHEG methods for matching next-to-leading order QCD calculations with parton showers are discussed. Implementations of both algorithms within the event generator SHERPA are employed to assess the impact on a representative selection of observables. In the MC{at}NLO approach a phase space restriction has been added to subtraction and parton shower, which allows to vary in a transparent way the amount of non-singular radiative corrections that are exponentiated. Effects on various observables are investigated, using the production of a Higgs boson in gluon fusion, with or without an associated jet, as a benchmark process. The case of H+jet production is presented for the first time in an NLO+PS matched simulation. Uncertainties due to scale choices and non-perturbative effects are explored in the production of W{sup {+-}} and Z bosons in association with a jet. Corresponding results are compared to data from the Tevatron and LHC experiments.
Multiscale molecular dynamics using the matched interface and boundary method
Geng Weihua; Wei, G.W.
2011-01-20
The Poisson-Boltzmann (PB) equation is an established multiscale model for electrostatic analysis of biomolecules and other dielectric systems. PB based molecular dynamics (MD) approach has a potential to tackle large biological systems. Obstacles that hinder the current development of PB based MD methods are concerns in accuracy, stability, efficiency and reliability. The presence of complex solvent-solute interface, geometric singularities and charge singularities leads to challenges in the numerical solution of the PB equation and electrostatic force evaluation in PB based MD methods. Recently, the matched interface and boundary (MIB) method has been utilized to develop the first second order accurate PB solver that is numerically stable in dealing with discontinuous dielectric coefficients, complex geometric singularities and singular source charges. The present work develops the PB based MD approach using the MIB method. New formulation of electrostatic forces is derived to allow the use of sharp molecular surfaces. Accurate reaction field forces are obtained by directly differentiating the electrostatic potential. Dielectric boundary forces are evaluated at the solvent-solute interface using an accurate Cartesian-grid surface integration method. The electrostatic forces located at reentrant surfaces are appropriately assigned to related atoms. Extensive numerical tests are carried out to validate the accuracy and stability of the present electrostatic force calculation. The new PB based MD method is implemented in conjunction with the AMBER package. MIB based MD simulations of biomolecules are demonstrated via a few example systems.
NASA Astrophysics Data System (ADS)
Chen, Rui; Xu, Jing; Zhang, Song; Chen, Heping; Guan, Yong; Chen, Ken
2017-01-01
The accuracy of structured light measurement depends on delicate offline calibration. However, in some practical applications, the system is supposed to be reconfigured so frequently to track the target that an online calibration is required. To this end, this paper proposes a rapid and autonomous self-recalibration method. For the proposed method, first, the rotation matrix and the normalized translation vector are attained from the fundamental matrix; second, the scale factor is acquired based on scale-invariant registration such that the actual translation vector is obtained. Experiments have been conducted to verify the effectiveness of our proposed method and the results indicate a high degree of accuracy.
Fox, Mark C; Mitchum, Ainsley L
2014-01-01
The trend of rising scores on intelligence tests raises important questions about the comparability of variation within and between time periods. Descriptions of the processes that mediate selection of item responses provide meaningful psychological criteria upon which to base such comparisons. In a recent paper, Fox and Mitchum presented and tested a cognitive theory of rising scores on analogical and inductive reasoning tests that is specific enough to make novel predictions about cohort differences in patterns of item responses for tests such as the Raven's Matrices. In this paper we extend the same proposal in two important ways by (1) testing it against a dataset that enables the effects of cohort to be isolated from those of age, and (2) applying it to two other inductive reasoning tests that exhibit large Flynn effects: Letter Series and Word Series. Following specification and testing of a confirmatory item response model, predicted violations of measurement invariance are observed between two age-matched cohorts that are separated by only 20 years, as members of the later cohort are found to map objects at higher levels of abstraction than members of the earlier cohort who possess the same overall level of ability. Results have implications for the Flynn effect and cognitive aging while underscoring the value of establishing psychological criteria for equating members of distinct groups who achieve the same scores.
An Invariant-Preserving ALE Method for Solids under Extreme Conditions
Sambasivan, Shiv Kumar; Christon, Mark A
2012-07-17
We are proposing a fundamentally new approach to ALE methods for solids undergoing large deformation due to extreme loading conditions. Our approach is based on a physically-motivated and mathematically rigorous construction of the underlying Lagrangian method, vector/tensor reconstruction, remapping, and interface reconstruction. It is transformational because it deviates dramatically from traditionally accepted ALE methods and provides the following set of unique attributes: (1) a three-dimensional, finite volume, cell-centered ALE framework with advanced hypo-/hyper-elasto-plastic constitutive theories for solids; (2) a new physically and mathematically consistent reconstruction method for vector/tensor fields; (3) advanced invariant-preserving remapping algorithm for vector/tensor quantities; (4) moment-of-fluid (MoF) interface reconstruction technique for multi-material problems with solids undergoing large deformations. This work brings together many new concepts, that in combination with emergent cell-centered Lagrangian hydrodynamics methods will produce a cutting-edge ALE capability and define a new state-of-the-art. Many ideas in this work are new, completely unexplored, and hence high risk. The proposed research and the resulting algorithms will be of immediate use in Eulerian, Lagrangian and ALE codes under the ASC program at the lab. In addition, the research on invariant preserving reconstruction/remap of tensor quantities is of direct interest to ongoing CASL and climate modeling efforts at LANL. The application space impacted by this work includes Inertial Confinement Fusion (ICF), Z-pinch, munition-target interactions, geological impact dynamics, shock processing of powders and shaped charges. The ALE framework will also provide a suitable test-bed for rapid development and assessment of hypo-/hyper-elasto-plastic constitutive theories. Today, there are no invariant-preserving ALE algorithms for treating solids with large deformations. Therefore
Becht, Andrik I; Branje, Susan J T; Vollebergh, Wilma A M; Maciejewski, Dominique F; van Lier, Pol A C; Koot, Hans M; Denissen, Jaap J A; Meeus, Wim H J
2016-06-01
The aim of this study was to assess measurement invariance of adolescents' daily reports on identity across time and sex. Adolescents (N = 497; mean age = 13.32 years at Time 1, 56.7% boys) from the general population reported on their identity commitments, exploration in depth and reconsideration on a daily basis for 3 weeks within 1 year across 5 years. We used the single-item version of the Utrecht Management of Identity Commitments Scale (UMICS; Klimstra et al., 2010), a broad measure of identity-formation processes covering both interpersonal and educational identity domains. This study tested configural, metric, scalar, and strict measurement invariance across days within weeks, across sex, across weeks within years, and across years. Results indicated that daily diary reports show strict measurement invariance across days, across weeks within years, across years, and across boys and girls. These results support the use of daily diary methods to assess identity at various time intervals ranging from days to years and across sex. Results are discussed with regard to future implications to study identity processes, both on smaller and larger time intervals. (PsycINFO Database Record
NASA Technical Reports Server (NTRS)
Takacs, Lawrence L.
1988-01-01
The nature and effect of using a posteriori adjustments to nonconservative finite-difference schemes to enforce integral invariants of the corresponding analytic system are examined. The method of a posteriori integral constraint restoration is analyzed for the case of linear advection, and the harmonic response associated with the a posteriori adjustments is examined in detail. The conservative properties of the shallow water system are reviewed, and the constraint restoration algorithm applied to the shallow water equations are described. A comparison is made between forecasts obtained using implicit and a posteriori methods for the conservation of mass, energy, and potential enstrophy in the complete nonlinear shallow-water system.
Matching wind turbine rotors and loads: Computational methods for designers
NASA Astrophysics Data System (ADS)
Seale, J. B.
1983-04-01
A comprehensive method for matching wind energy conversion system (WECS) rotors with the load characteristics of common electrical and mechanical applications was reported. A method was developed to convert the data into useful results: (1) from turbine efficiency and load torque characteristics, turbine power is predicted as a function of windspeed; (2) it is decided how turbine power is to be governed to insure safety of all components; (3) mechanical conversion efficiency comes into play to predict how useful delivered power varies with windspeed; (4) wind statistics are used to predict longterm energy output. Most systems are approximated by a graph and calculator approach. The method leads to energy predictions, and to insight into modeled processes. A computer program provides more sophisticated calculations where a highly unusual system is to be modeled, where accuracy is at a premium, or where error analysis is required. The analysis is fleshed out with in depth case studies for induction generator and inverter utility systems; battery chargers; resistance heaters; positive displacement pumps; including three different load compensation strategies; and centrifugal pumps with unregulated electric power transmission from turbine to pump.
Matched Interface and Boundary Method for Elasticity Interface Problems
Wang, Bao; Xia, Kelin; Wei, Guo-Wei
2015-01-01
Elasticity theory is an important component of continuum mechanics and has had widely spread applications in science and engineering. Material interfaces are ubiquity in nature and man-made devices, and often give rise to discontinuous coefficients in the governing elasticity equations. In this work, the matched interface and boundary (MIB) method is developed to address elasticity interface problems. Linear elasticity theory for both isotropic homogeneous and inhomogeneous media is employed. In our approach, Lamé’s parameters can have jumps across the interface and are allowed to be position dependent in modeling isotropic inhomogeneous material. Both strong discontinuity, i.e., discontinuous solution, and weak discontinuity, namely, discontinuous derivatives of the solution, are considered in the present study. In the proposed method, fictitious values are utilized so that the standard central finite different schemes can be employed regardless of the interface. Interface jump conditions are enforced on the interface, which in turn, accurately determines fictitious values. We design new MIB schemes to account for complex interface geometries. In particular, the cross derivatives in the elasticity equations are difficult to handle for complex interface geometries. We propose secondary fictitious values and construct geometry based interpolation schemes to overcome this difficulty. Numerous analytical examples are used to validate the accuracy, convergence and robustness of the present MIB method for elasticity interface problems with both small and large curvatures, strong and weak discontinuities, and constant and variable coefficients. Numerical tests indicate second order accuracy in both L∞ and L2 norms. PMID:25914439
Matched Interface and Boundary Method for Elasticity Interface Problems.
Wang, Bao; Xia, Kelin; Wei, Guo-Wei
2015-09-01
Elasticity theory is an important component of continuum mechanics and has had widely spread applications in science and engineering. Material interfaces are ubiquity in nature and man-made devices, and often give rise to discontinuous coefficients in the governing elasticity equations. In this work, the matched interface and boundary (MIB) method is developed to address elasticity interface problems. Linear elasticity theory for both isotropic homogeneous and inhomogeneous media is employed. In our approach, Lamé's parameters can have jumps across the interface and are allowed to be position dependent in modeling isotropic inhomogeneous material. Both strong discontinuity, i.e., discontinuous solution, and weak discontinuity, namely, discontinuous derivatives of the solution, are considered in the present study. In the proposed method, fictitious values are utilized so that the standard central finite different schemes can be employed regardless of the interface. Interface jump conditions are enforced on the interface, which in turn, accurately determines fictitious values. We design new MIB schemes to account for complex interface geometries. In particular, the cross derivatives in the elasticity equations are difficult to handle for complex interface geometries. We propose secondary fictitious values and construct geometry based interpolation schemes to overcome this difficulty. Numerous analytical examples are used to validate the accuracy, convergence and robustness of the present MIB method for elasticity interface problems with both small and large curvatures, strong and weak discontinuities, and constant and variable coefficients. Numerical tests indicate second order accuracy in both L∞ and L2 norms.
Binocular stereo matching method based on structure tensor
NASA Astrophysics Data System (ADS)
Song, Xiaowei; Yang, Manyi; Fan, Yubo; Yang, Lei
2016-10-01
In a binocular visual system, to recover the three-dimensional information of the object, the most important step is to acquire matching points. Structure tensor is the vector representation of each point in its local neighborhood. Therefore, structure tensor performs well in region detection of local structure, and it is very suitable for detecting specific graphics such as pedestrians, cars and road signs in the image. In this paper, the structure tensor is combined with the luminance information to form the extended structure tensor. The directional derivatives of luminance in x and y directions are calculated, so that the local structure of the image is more prominent. Meanwhile, the Euclidean distance between the eigenvectors of key points is used as the similarity determination metric of key points in the two images. By matching, the coordinates of the matching points in the detected target are precisely acquired. In this paper, experiments were performed on the captured left and right images. After the binocular calibration, image matching was done to acquire the matching points, and then the target depth was calculated according to these matching points. By comparison, it is proved that the structure tensor can accurately acquire the matching points in binocular stereo matching.
On the NP-completeness of the Hartree-Fock method for translationally invariant systems
Whitfield, James Daniel; Zimborás, Zoltán
2014-12-21
The self-consistent field method utilized for solving the Hartree-Fock (HF) problem and the closely related Kohn-Sham problem is typically thought of as one of the cheapest methods available to quantum chemists. This intuition has been developed from the numerous applications of the self-consistent field method to a large variety of molecular systems. However, as characterized by its worst-case behavior, the HF problem is NP-complete. In this work, we map out boundaries of the NP-completeness by investigating restricted instances of HF. We have constructed two new NP-complete variants of the problem. The first is a set of Hamiltonians whose translationally invariant Hartree-Fock solutions are trivial, but whose broken symmetry solutions are NP-complete. Second, we demonstrate how to embed instances of spin glasses into translationally invariant Hartree-Fock instances and provide a numerical example. These findings are the first steps towards understanding in which cases the self-consistent field method is computationally feasible and when it is not.
Matching wind turbine rotors and loads: computational methods for designers
Seale, J.B.
1983-04-01
This report provides a comprehensive method for matching wind energy conversion system (WECS) rotors with the load characteristics of common electrical and mechanical applications. The user must supply: (1) turbine aerodynamic efficiency as a function of tipspeed ratio; (2) mechanical load torque as a function of rotation speed; (3) useful delivered power as a function of incoming mechanical power; (4) site average windspeed and, for maximum accuracy, distribution data. The description of the data includes governing limits consistent with the capacities of components. The report develops, a step-by-step method for converting the data into useful results: (1) from turbine efficiency and load torque characteristics, turbine power is predicted as a function of windspeed; (2) a decision is made how turbine power is to be governed (it may self-govern) to insure safety of all components; (3) mechanical conversion efficiency comes into play to predict how useful delivered power varies with windspeed; (4) wind statistics come into play to predict longterm energy output. Most systems can be approximated by a graph-and-calculator approach: Computer-generated families of coefficient curves provide data for algebraic scaling formulas. The method leads not only to energy predictions, but also to insight into the processes being modeled. Direct use of a computer program provides more sophisticated calculations where a highly unusual system is to be modeled, where accuracy is at a premium, or where error analysis is required. The analysis is fleshed out witn in-depth case studies for induction generator and inverter utility systems; battery chargers; resistance heaters; positive displacement pumps, including three different load-compensation strategies; and centrifugal pumps with unregulated electric power transmission from turbine to pump.
NASA Astrophysics Data System (ADS)
Rogovtsov, Nikolai N.; Borovik, Felix
2016-11-01
A brief analysis of different properties and principles of invariance to solve a number of classical problems of the radiation transport theory is presented. The main ideas, constructions, and assertions used in the general invariance relations reduction method are described in outline. The most important distinctive features of this general method of solving a wide enough range of problems of the radiation transport theory and mathematical physics are listed. To illustrate the potential of this method, a number of problems of the scalar radiative transfer theory have been solved rigorously in the article. The main stages of rigorous derivations of asymptotical formulas for the smallest in modulo elements of the discrete spectrum and the eigenfunctions, corresponding to them, of the characteristic equation for the case of an arbitrary phase function and almost conservative scattering are described. Formulas of the same type for the azimuthal averaged reflection function, the plane and spherical albedos have been obtained rigorously. New analytical representations for the reflection function, the plane and spherical albedos have been obtained, and effective algorithms for calculating these values have been offered for the case of a practically arbitrary phase function satisfying the Hölder condition. New analytical representation of the «surface» Green function of the scalar radiative transfer equation for a semi-infinite plane-parallel conservatively scattering medium has been found. The deep regime asymptotics of the "volume" Green function has been obtained for the case of a turbid medium of cylindrical form.
NASA Astrophysics Data System (ADS)
Ren, Zhuyin; Pope, Stephen B.; Vladimirsky, Alexander; Guckenheimer, John M.
2006-03-01
This work addresses the construction and use of low-dimensional invariant manifolds to simplify complex chemical kinetics. Typically, chemical kinetic systems have a wide range of time scales. As a consequence, reaction trajectories rapidly approach a hierarchy of attracting manifolds of decreasing dimension in the full composition space. In previous research, several different methods have been proposed to identify these low-dimensional attracting manifolds. Here we propose a new method based on an invariant constrained equilibrium edge (ICE) manifold. This manifold (of dimension nr) is generated by the reaction trajectories emanating from its (nr-1)-dimensional edge, on which the composition is in a constrained equilibrium state. A reasonable choice of the nr represented variables (e.g., nr "major" species) ensures that there exists a unique point on the ICE manifold corresponding to each realizable value of the represented variables. The process of identifying this point is referred to as species reconstruction. A second contribution of this work is a local method of species reconstruction, called ICE-PIC, which is based on the ICE manifold and uses preimage curves (PICs). The ICE-PIC method is local in the sense that species reconstruction can be performed without generating the whole of the manifold (or a significant portion thereof). The ICE-PIC method is the first approach that locally determines points on a low-dimensional invariant manifold, and its application to high-dimensional chemical systems is straightforward. The "inputs" to the method are the detailed kinetic mechanism and the chosen reduced representation (e.g., some major species). The ICE-PIC method is illustrated and demonstrated using an idealized H2/O system with six chemical species. It is then tested and compared to three other dimension-reduction methods for the test case of a one-dimensional premixed laminar flame of stoichiometric hydrogen/air, which is described by a detailed mechanism
Ren, Zhuyin; Pope, Stephen B; Vladimirsky, Alexander; Guckenheimer, John M
2006-03-21
This work addresses the construction and use of low-dimensional invariant manifolds to simplify complex chemical kinetics. Typically, chemical kinetic systems have a wide range of time scales. As a consequence, reaction trajectories rapidly approach a hierarchy of attracting manifolds of decreasing dimension in the full composition space. In previous research, several different methods have been proposed to identify these low-dimensional attracting manifolds. Here we propose a new method based on an invariant constrained equilibrium edge (ICE) manifold. This manifold (of dimension nr) is generated by the reaction trajectories emanating from its (nr-1)-dimensional edge, on which the composition is in a constrained equilibrium state. A reasonable choice of the nr represented variables (e.g., nr "major" species) ensures that there exists a unique point on the ICE manifold corresponding to each realizable value of the represented variables. The process of identifying this point is referred to as species reconstruction. A second contribution of this work is a local method of species reconstruction, called ICE-PIC, which is based on the ICE manifold and uses preimage curves (PICs). The ICE-PIC method is local in the sense that species reconstruction can be performed without generating the whole of the manifold (or a significant portion thereof). The ICE-PIC method is the first approach that locally determines points on a low-dimensional invariant manifold, and its application to high-dimensional chemical systems is straightforward. The "inputs" to the method are the detailed kinetic mechanism and the chosen reduced representation (e.g., some major species). The ICE-PIC method is illustrated and demonstrated using an idealized H2O system with six chemical species. It is then tested and compared to three other dimension-reduction methods for the test case of a one-dimensional premixed laminar flame of stoichiometric hydrogen/air, which is described by a detailed mechanism
NASA Astrophysics Data System (ADS)
Peng, Cheng; Geneva, Nicholas; Guo, Zhaoli; Wang, Lian-Ping
2017-01-01
In lattice Boltzmann simulations involving moving solid boundaries, the momentum exchange between the solid and fluid phases was recently found to be not fully consistent with the principle of local Galilean invariance (GI) when the bounce-back schemes (BBS) and the momentum exchange method (MEM) are used. In the past, this inconsistency was resolved by introducing modified MEM schemes so that the overall moving-boundary algorithm could be more consistent with GI. However, in this paper we argue that the true origin of this violation of Galilean invariance (VGI) in the presence of a moving solid-fluid interface is due to the BBS itself, as the VGI error not only exists in the hydrodynamic force acting on the solid phase, but also in the boundary force exerted on the fluid phase, according to Newton's Third Law. The latter, however, has so far gone unnoticed in previously proposed modified MEM schemes. Based on this argument, we conclude that the previous modifications to the momentum exchange method are incomplete solutions to the VGI error in the lattice Boltzmann method (LBM). An implicit remedy to the VGI error in the LBM and its limitation is then revealed. To address the VGI error for a case when this implicit remedy does not exist, a bounce-back scheme based on coordinate transformation is proposed. Numerical tests in both laminar and turbulent flows show that the proposed scheme can effectively eliminate the errors associated with the usual bounce-back implementations on a no-slip solid boundary, and it can maintain an accurate momentum exchange calculation with minimal computational overhead.
Peng, Cheng; Geneva, Nicholas; Guo, Zhaoli; Wang, Lian-Ping
2017-01-01
In lattice Boltzmann simulations involving moving solid boundaries, the momentum exchange between the solid and fluid phases was recently found to be not fully consistent with the principle of local Galilean invariance (GI) when the bounce-back schemes (BBS) and the momentum exchange method (MEM) are used. In the past, this inconsistency was resolved by introducing modified MEM schemes so that the overall moving-boundary algorithm could be more consistent with GI. However, in this paper we argue that the true origin of this violation of Galilean invariance (VGI) in the presence of a moving solid-fluid interface is due to the BBS itself, as the VGI error not only exists in the hydrodynamic force acting on the solid phase, but also in the boundary force exerted on the fluid phase, according to Newton's Third Law. The latter, however, has so far gone unnoticed in previously proposed modified MEM schemes. Based on this argument, we conclude that the previous modifications to the momentum exchange method are incomplete solutions to the VGI error in the lattice Boltzmann method (LBM). An implicit remedy to the VGI error in the LBM and its limitation is then revealed. To address the VGI error for a case when this implicit remedy does not exist, a bounce-back scheme based on coordinate transformation is proposed. Numerical tests in both laminar and turbulent flows show that the proposed scheme can effectively eliminate the errors associated with the usual bounce-back implementations on a no-slip solid boundary, and it can maintain an accurate momentum exchange calculation with minimal computational overhead.
Lamb Waves Decomposition and Mode Identification Using Matching Pursuit Method
2009-01-01
an adaptive signal decomposition technique and can be applied to process Lamb waves, such as denoising , wave parameter estimation, and feature...transform (STFT), wavelet transform, Wigner-Ville distribution, matching pursuit decomposition, etc. 1 Report Documentation Page Form ApprovedOMB No...positions, but constant time widths. In contrast to the STFT, which uses a single analysis window, the wavelet transform offers a tradeoff between
Explicit Krawtchouk moment invariants for invariant image recognition
NASA Astrophysics Data System (ADS)
Xiao, Bin; Zhang, Yanhong; Li, Linping; Li, Weisheng; Wang, Guoyin
2016-03-01
The existing Krawtchouk moment invariants are derived by a linear combination of geometric moment invariants. This indirect method cannot achieve perfect performance in rotation, scale, and translation (RST) invariant image recognition since the derivation of these invariants are not built on Krawtchouk polynomials. A direct method to derive RST invariants from Krawtchouk moments, named explicit Krawtchouk moment invariants, is proposed. The proposed method drives Krawtchouk moment invariants by algebraically eliminating the distorted (i.e., rotated, scaled, and translated) factor contained in the Krawtchouk moments of distorted image. Experimental results show that, compared with the indirect methods, the proposed approach can significantly improve the performance in terms of recognition accuracy and noise robustness.
ERIC Educational Resources Information Center
Moses, Tim
2008-01-01
Equating functions are supposed to be population invariant, meaning that the choice of subpopulation used to compute the equating function should not matter. The extent to which equating functions are population invariant is typically assessed in terms of practical difference criteria that do not account for equating functions' sampling…
Detection of copy-move forgery using a method based on blur moment invariants.
Mahdian, Babak; Saic, Stanislav
2007-09-13
In our society digital images are a powerful and widely used communication medium. They have an important impact on our life. In recent years, due to the advent of high-performance commodity hardware and improved human-computer interfaces, it has become relatively easy to create fake images. Modern, easy to use image processing software enables forgeries that are undetectable by the naked eye. In this work we propose a method to automatically detect and localize duplicated regions in digital images. The presence of duplicated regions in an image may signify a common type of forgery called copy-move forgery. The method is based on blur moment invariants, which allows successful detection of copy-move forgery, even when blur degradation, additional noise, or arbitrary contrast changes are present in the duplicated regions. These modifications are commonly used techniques to conceal traces of copy-move forgery. Our method works equally well for lossy format such as JPEG. We demonstrate our method on several images affected by copy-move forgery.
ERIC Educational Resources Information Center
Spilt, Jantine L.; Koomen, Helma M. Y.; Jak, Suzanne
2012-01-01
Although research consistently points to poorer teacher-student relationships for boys than girls, there are no studies that take into account the effects of teacher gender and control for possible measurement non-invariance across student and teacher gender. This study addressed both issues. The sample included 649 primary school teachers (182…
NASA Astrophysics Data System (ADS)
Yang, Xiaofeng; Zhao, Jia; Wang, Qi
2017-03-01
The Molecular Beam Epitaxial model is derived from the variation of a free energy, that consists of either a fourth order Ginzburg-Landau double well potential or a nonlinear logarithmic potential in terms of the gradient of a height function. One challenge in solving the MBE model numerically is how to develop proper temporal discretization for the nonlinear terms in order to preserve energy stability at the time-discrete level. In this paper, we resolve this issue by developing a first and second order time-stepping scheme based on the "Invariant Energy Quadratization" (IEQ) method. The novelty is that all nonlinear terms are treated semi-explicitly, and the resulted semi-discrete equations form a linear system at each time step. Moreover, the linear operator is symmetric positive definite and thus can be solved efficiently. We then prove that all proposed schemes are unconditionally energy stable. The semi-discrete schemes are further discretized in space using finite difference methods and implemented on GPUs for high-performance computing. Various 2D and 3D numerical examples are presented to demonstrate stability and accuracy of the proposed schemes.
A Comparison of Propensity Score Matching Methods for Reducing Selection Bias
ERIC Educational Resources Information Center
Bai, Haiyan
2011-01-01
Propensity score matching (PSM) has become a popular approach for research studies when randomization is infeasible. However, there are significant differences in the effectiveness of selection bias reduction among the existing PSM methods and, therefore, it is challenging for researchers to select an appropriate matching method. This current…
Spilt, Jantine L; Koomen, Helma M Y; Jak, Suzanne
2012-06-01
Although research consistently points to poorer teacher-student relationships for boys than girls, there are no studies that take into account the effects of teacher gender and control for possible measurement non-invariance across student and teacher gender. This study addressed both issues. The sample included 649 primary school teachers (182 men) and 1493 students (685 boys). Teachers completed a slightly adapted version of the Student-Teacher Relationship Scale. The results indicated limited measurement non-invariance in teacher reports. Female teachers reported better (i.e., more close, less conflictual, and less dependent) relationships with students than male teachers. In addition, both male and female teachers reported more conflictual relationships with boys than with girls, and female teachers also reported less close relationships with boys than with girls. The findings challenge society's presumption that male teachers have better relationships with boys than women teachers.
NASA Astrophysics Data System (ADS)
Miroshnikov, Victor
2015-11-01
The Navier-Stokes system of PDEs is reduced to a system of the vorticity, continuity, Helmholtz, and Lamb-Helmholtz PDEs. The periodic Dirichlet problems are formulated for conservative internal waves vanishing at infinity in upper and lower domains. Stationary kinematic Fourier (SKF) structures, stationary kinematic Euler-Fourier (SKEF) structures, stationary dynamic Euler-Fourier (SDEF) structures, and SKEF-SDEF structures of three spatial variables and time are constructed to consider kinematic and dynamic problems of the three-dimensional theory of the Newtonian flows with harmonic velocity. Exact solutions for propagation and interaction of N internal waves in the upper and lower domains are developed by the method of decomposition in invariant structures and implemented through experimental and theoretical programming in Maple. Main results are summarized in a global existence theorem for the strong solutions. The SKEF, SDEF, and SKEF-SDEF structures of the cumulative flows are visualized by two-parametric surface plots for six fluid-dynamic variables.
NASA Astrophysics Data System (ADS)
Bae, Joseph H.
2015-07-01
Applying the Jacobi method of second variation to the Bianchi IX system in Misner variables (α ,{β }+,{β }-), we specialize to the Taub space background ({β }-=0) and obtain the governing equations for linearized homogeneous perturbations ({α }\\prime ,{β }+\\prime ,{β }-\\prime ) thereabout. Employing a canonical transformation, we isolate two decoupled gauge-invariant linearized variables ({β }-\\prime and {Q}+\\prime ={p}+{α }\\prime +{p}α {β }+\\prime ), together with their conjugate momenta and linearized Hamiltonians. These two linearized Hamiltonians are of time-dependent harmonic oscillator form, and we quantize them to get time-dependent Schrödinger equations. For the case of {Q}+\\prime , we are able to solve for the discrete solutions and the exact quantum squeezed states.
NASA Astrophysics Data System (ADS)
Bazhenov, V. A.; Sakharov, A. S.; Maksimyuk, Yu. V.; Shkryl', A. A.
2016-03-01
Numerical experiments are performed to analyze the invariance and reliability of the results of evaluation of the J-integral by the modified method of reactions in problems of mixed fracture. Bodies with cracks undergoing elastoplastic deformation under static loading are considered. To demonstrate the universality of the method to finite-element schemes, prismatic bodies are considered. This allows using not only conventional finite-element schemes, but also the semi-analytical finite-element method
Regularized discriminative spectral regression method for heterogeneous face matching.
Huang, Xiangsheng; Lei, Zhen; Fan, Mingyu; Wang, Xiao; Li, Stan Z
2013-01-01
Face recognition is confronted with situations in which face images are captured in various modalities, such as the visual modality, the near infrared modality, and the sketch modality. This is known as heterogeneous face recognition. To solve this problem, we propose a new method called discriminative spectral regression (DSR). The DSR maps heterogeneous face images into a common discriminative subspace in which robust classification can be achieved. In the proposed method, the subspace learning problem is transformed into a least squares problem. Different mappings should map heterogeneous images from the same class close to each other, while images from different classes should be separated as far as possible. To realize this, we introduce two novel regularization terms, which reflect the category relationships among data, into the least squares approach. Experiments conducted on two heterogeneous face databases validate the superiority of the proposed method over the previous methods.
A method to analyse measurement invariance under uncertainty in between-subjects design.
Martínez, José A; Ruiz Marin, Manuel; Vivo Molina, Maria del Carmen
2012-11-01
In this research we have introduced a new test (H-test) for analyzing scale invariance in between group designs, and considering uncertainty in individual responses, in order to study the adequacy of disparate rating and visual scales for measuring abstract concepts. The H-test is easy to compute and, as a nonparametric test, does not require any a priori distribution of the data nor conditions on the variances of the distributions to be tested. We apply this test to measure perceived service quality of consumers of a sports services. Results show that, without considering uncertainty, the 1-7 scale is invariant, in line with the related works regarding this topic. However, de 1-5 scale and the 1-7 scale are invariant when adding uncertainty to the analysis. Therefore, adding uncertainty importantly change the conclusions regarding invariance analysis. Both types of visual scales are not invariant in the uncertainty scenario. Implications for the use of rating scales are discussed.
Matching method of the vision image captured by the lunar rover exploring on lunar surface
NASA Astrophysics Data System (ADS)
Li, Lichun; Zhou, Jianliang; Sun, Jun; Shang, Desheng; Xu, Yinghui; Zhang, Wei; Wan, Wenhui
2014-11-01
Facing the lunar surface survey of the Lunar Exploring Engineering, the paper summarizes the environment sensing technology based on vision image. For the image matching is the most important step in the process of the lunar exploring images, the accuracy and speed of the matching method is the key problem of the lunar exploring, which play an important role in the rover auto navigating and tele-operating. To conquer difficult problem that there are significant illumination variation of the imaging, lack of image texture, and non-uniform distribution of the image texture, the huge change of the disparity for the prominent target in the scene, in the image process Engineering, the image matching method is proposed which divided the whole image into M×N regions, and each region employs the Forstner algorithm to extract features by which the semi-uniform distribution features of whole image and avoiding of the features gathering is achieved. According to the semi- uniform distribution features, the Sift and Least Square Matching method are used to realize accurate image matching. Guided by the matched features of the first step, the locale plane is detected to restrict dense image registering. The matching experiments show that the method is effective to deal with the image captured by the lunar exploring rover, that has large variation of illumination and lacking of image texture. The robustness and high accuracy of the method is also proved. The method satisfied the request of the lunar surface exploring.
NASA Technical Reports Server (NTRS)
Lallemand, Pierre; Luo, Li-Shi
2000-01-01
The generalized hydrodynamics (the wave vector dependence of the transport coefficients) of a generalized lattice Boltzmann equation (LBE) is studied in detail. The generalized lattice Boltzmann equation is constructed in moment space rather than in discrete velocity space. The generalized hydrodynamics of the model is obtained by solving the dispersion equation of the linearized LBE either analytically by using perturbation technique or numerically. The proposed LBE model has a maximum number of adjustable parameters for the given set of discrete velocities. Generalized hydrodynamics characterizes dispersion, dissipation (hyper-viscosities), anisotropy, and lack of Galilean invariance of the model, and can be applied to select the values of the adjustable parameters which optimize the properties of the model. The proposed generalized hydrodynamic analysis also provides some insights into stability and proper initial conditions for LBE simulations. The stability properties of some 2D LBE models are analyzed and compared with each other in the parameter space of the mean streaming velocity and the viscous relaxation time. The procedure described in this work can be applied to analyze other LBE models. As examples, LBE models with various interpolation schemes are analyzed. Numerical results on shear flow with an initially discontinuous velocity profile (shock) with or without a constant streaming velocity are shown to demonstrate the dispersion effects in the LBE model; the results compare favorably with our theoretical analysis. We also show that whereas linear analysis of the LBE evolution operator is equivalent to Chapman-Enskog analysis in the long wave-length limit (wave vector k = 0), it can also provide results for large values of k. Such results are important for the stability and other hydrodynamic properties of the LBE method and cannot be obtained through Chapman-Enskog analysis.
Scale invariance vs conformal invariance
NASA Astrophysics Data System (ADS)
Nakayama, Yu
2015-03-01
In this review article, we discuss the distinction and possible equivalence between scale invariance and conformal invariance in relativistic quantum field theories. Under some technical assumptions, we can prove that scale invariant quantum field theories in d = 2 space-time dimensions necessarily possess the enhanced conformal symmetry. The use of the conformal symmetry is well appreciated in the literature, but the fact that all the scale invariant phenomena in d = 2 space-time dimensions enjoy the conformal property relies on the deep structure of the renormalization group. The outstanding question is whether this feature is specific to d = 2 space-time dimensions or it holds in higher dimensions, too. As of January 2014, our consensus is that there is no known example of scale invariant but non-conformal field theories in d = 4 space-time dimensions under the assumptions of (1) unitarity, (2) Poincaré invariance (causality), (3) discrete spectrum in scaling dimensions, (4) existence of scale current and (5) unbroken scale invariance in the vacuum. We have a perturbative proof of the enhancement of conformal invariance from scale invariance based on the higher dimensional analogue of Zamolodchikov's c-theorem, but the non-perturbative proof is yet to come. As a reference we have tried to collect as many interesting examples of scale invariance in relativistic quantum field theories as possible in this article. We give a complementary holographic argument based on the energy-condition of the gravitational system and the space-time diffeomorphism in order to support the claim of the symmetry enhancement. We believe that the possible enhancement of conformal invariance from scale invariance reveals the sublime nature of the renormalization group and space-time with holography. This review is based on a lecture note on scale invariance vs conformal invariance, on which the author gave lectures at Taiwan Central University for the 5th Taiwan School on Strings and
Method of electric powertrain matching for battery-powered electric cars
NASA Astrophysics Data System (ADS)
Ning, Guobao; Xiong, Lu; Zhang, Lijun; Yu, Zhuoping
2013-05-01
The current match method of electric powertrain still makes use of longitudinal dynamics, which can't realize maximum capacity for on-board energy storage unit and can't reach lowest equivalent fuel consumption as well. Another match method focuses on improving available space considering reasonable layout of vehicle to enlarge rated energy capacity for on-board energy storage unit, which can keep the longitudinal dynamics performance almost unchanged but can't reach lowest fuel consumption. Considering the characteristics of driving motor, method of electric powertrain matching utilizing conventional longitudinal dynamics for driving system and cut-and-try method for energy storage system is proposed for passenger cars converted from traditional ones. Through combining the utilization of vehicle space which contributes to the on-board energy amount, vehicle longitudinal performance requirements, vehicle equivalent fuel consumption level, passive safety requirements and maximum driving range requirement together, a comprehensive optimal match method of electric powertrain for battery-powered electric vehicle is raised. In simulation, the vehicle model and match method is built in Matlab/simulink, and the Environmental Protection Agency (EPA) Urban Dynamometer Driving Schedule (UDDS) is chosen as a test condition. The simulation results show that 2.62% of regenerative energy and 2% of energy storage efficiency are increased relative to the traditional method. The research conclusions provide theoretical and practical solutions for electric powertrain matching for modern battery-powered electric vehicles especially for those converted from traditional ones, and further enhance dynamics of electric vehicles.
Numerical optimization algorithm for rotationally invariant multi-orbital slave-boson method
NASA Astrophysics Data System (ADS)
Quan, Ya-Min; Wang, Qing-wei; Liu, Da-Yong; Yu, Xiang-Long; Zou, Liang-Jian
2015-06-01
We develop a generalized numerical optimization algorithm for the rotationally invariant multi-orbital slave boson approach, which is applicable for arbitrary boundary constraints of high-dimensional objective function by combining several classical optimization techniques. After constructing the calculation architecture of rotationally invariant multi-orbital slave boson model, we apply this optimization algorithm to find the stable ground state and magnetic configuration of two-orbital Hubbard models. The numerical results are consistent with available solutions, confirming the correctness and accuracy of our present algorithm. Furthermore, we utilize it to explore the effects of the transverse Hund's coupling terms on metal-insulator transition, orbital selective Mott phase and magnetism. These results show the quick convergency and robust stable character of our algorithm in searching the optimized solution of strongly correlated electron systems.
Lombaert, Herve; Grady, Leo; Polimeni, Jonathan R.; Cheriet, Farida
2013-01-01
Existing methods for surface matching are limited by the trade-off between precision and computational efficiency. Here we present an improved algorithm for dense vertex-to-vertex correspondence that uses direct matching of features defined on a surface and improves it by using spectral correspondence as a regularization. This algorithm has the speed of both feature matching and spectral matching while exhibiting greatly improved precision (distance errors of 1.4%). The method, FOCUSR, incorporates implicitly such additional features to calculate the correspondence and relies on the smoothness of the lowest-frequency harmonics of a graph Laplacian to spatially regularize the features. In its simplest form, FOCUSR is an improved spectral correspondence method that nonrigidly deforms spectral embeddings. We provide here a full realization of spectral correspondence where virtually any feature can be used as additional information using weights on graph edges, but also on graph nodes and as extra embedded coordinates. As an example, the full power of FOCUSR is demonstrated in a real case scenario with the challenging task of brain surface matching across several individuals. Our results show that combining features and regularizing them in a spectral embedding greatly improves the matching precision (to a sub-millimeter level) while performing at much greater speed than existing methods. PMID:23868776
Lombaert, Herve; Grady, Leo; Polimeni, Jonathan R; Cheriet, Farida
2013-09-01
Existing methods for surface matching are limited by the tradeoff between precision and computational efficiency. Here, we present an improved algorithm for dense vertex-to-vertex correspondence that uses direct matching of features defined on a surface and improves it by using spectral correspondence as a regularization. This algorithm has the speed of both feature matching and spectral matching while exhibiting greatly improved precision (distance errors of 1.4 percent). The method, FOCUSR, incorporates implicitly such additional features to calculate the correspondence and relies on the smoothness of the lowest-frequency harmonics of a graph Laplacian to spatially regularize the features. In its simplest form, FOCUSR is an improved spectral correspondence method that nonrigidly deforms spectral embeddings. We provide here a full realization of spectral correspondence where virtually any feature can be used as an additional information using weights on graph edges, but also on graph nodes and as extra embedded coordinates. As an example, the full power of FOCUSR is demonstrated in a real-case scenario with the challenging task of brain surface matching across several individuals. Our results show that combining features and regularizing them in a spectral embedding greatly improves the matching precision (to a submillimeter level) while performing at much greater speed than existing methods.
NASA Astrophysics Data System (ADS)
Wróbel, Jacek K.; Goodman, Roy H.
2013-07-01
An efficient and accurate numerical method is presented for computing invariant manifolds of maps which arise in the study of dynamical systems. A quasi-interpolation method due to Hering-Bertram et al. is used to decrease the number of points needed to compute a portion of the manifold. Bézier triangular patches are used in this construction, together with adaptivity conditions based on properties of these patches. Several numerical tests are performed, which show the method to compare favorably with previous approaches.
Tong, Mingsi; Song, John; Chu, Wei; Thompson, Robert M
2014-01-01
The Congruent Matching Cells (CMC) method for ballistics identification was invented at the National Institute of Standards and Technology (NIST). The CMC method is based on the correlation of pairs of small correlation cells instead of the correlation of entire images. Four identification parameters – TCCF, Tθ, Tx and Ty are proposed for identifying correlated cell pairs originating from the same firearm. The correlation conclusion (matching or non-matching) is determined by whether the number of CMC is ≥ 6. This method has been previously validated using a set of 780 pair-wise 3D topography images. However, most ballistic images stored in current local and national databases are in an optical intensity (grayscale) format. As a result, the reliability of applying the CMC method on optical intensity images is an important issue. In this paper, optical intensity images of breech face impressions captured on the same set of 40 cartridge cases are correlated and analyzed for the validation test of CMC method using optical images. This includes correlations of 63 pairs of matching images and 717 pairs of non-matching images under top ring lighting. Tests of the method do not produce any false identification (false positive) or false exclusion (false negative) results, which support the CMC method and the proposed identification criterion, C = 6, for firearm breech face identifications using optical intensity images. PMID:26601045
Magnetohydrodynamic mode identification from magnetic probe signals via a matched filter method
NASA Astrophysics Data System (ADS)
Edgell, Dana H.; Kim, Jin-Soo; Bogatu, Ioan N.; Humphreys, David A.; Turnbull, Alan D.
2002-04-01
A matched filter analysis has been developed to identify the amplitude and phase of magnetohydrodynamic modes in DIII-D tokamak plasmas using magnetic probe signals (δBp). As opposed to conventional Fourier spatial analysis of toroidally spaced probes, this analysis includes data from both toroidally and poloidally spaced magnetic probe arrays. Using additional probes both improves the statistics of the analysis and more importantly incorporates poloidal information into the mode analysis. The matched filter is a numeric filter that matches signals from the magnetic probes with numerically predicted signals for the mode. The numerical predictions are developed using EFIT equilibrium reconstruction data as input to the stability code GATO and the vacuum field code VACUUM. Changes is the plasma equilibrium that occur on the same time scale as the mode are taken into account by modeling simple matched filter vectors corresponding to changes in total plasma current, plus vertical and horizontal plasma shifts. The matched filter method works well when there is good understanding of a mode and good modeling of its structure. Matched filter analysis results for a fast growing ideal kink mode, where equilibrium change effects are minimal, show the effectiveness of this method. A slow growing resistive-wall mode (RWM) is also analyzed using the matched filter method. The method gives good results for identifying the amplitude and phase of the RWM but the simple equilibrium vectors are insufficient for complete elimination of equilibrium changes on this time scale. An analysis of the computational requirements of the scheme indicates that real-time application of the matched filter for RWM identification will be possible.
Experience with the matched filtered weighted-shift-and-add method
NASA Technical Reports Server (NTRS)
Hege, E. Keith; Strobel, Nicolas V.; Ribak, Erez; Christou, Julian C.
1987-01-01
It is presently demonstrated that while the matched filter formulated by Ribak (1986) for the extension of the weighted-shift-and-add (WSA) method successfully reduces photon statistics-dominated specklegrams, the iterative method originally proposed by Ribak does not converge in the case of photon-noisy specklegrams for objects having more than one maxima. Attention is accordingly given to methods for rendering the procedure more 'artificially intelligent'. An error matrix is defined that is useful in evaluating the validity of the results produced by the matched filter extension of the WSA method.
A new stereo matching method based on threshold constrained minimum spanning tree
NASA Astrophysics Data System (ADS)
Cao, Hai; Ding, Yan; Du, Ming; Zhao, Liangjin; Yuan, Yating
2017-01-01
This paper proposes a novelty dense stereo matching method based on TC-MST (Threshold Constrained Minimum Spanning Tree), which aims to improve the accuracy of distance measuring. Due to the threshold has a great impact on the results of image segments, to select a better threshold, we adopt iteration threshold method. And then we uses MST to calculate the cost aggregation, and utilize the winner-take-all algorithm for the cost aggregation to obtain the disparity. Finally the method proposed is used in a distance measuring system. The experiment results show that this method improves the distance measuring accuracy compared with BM (block matching).
A new method for generating an invariant iris private key based on the fuzzy vault system.
Lee, Youn Joo; Park, Kang Ryoung; Lee, Sung Joo; Bae, Kwanghyuk; Kim, Jaihie
2008-10-01
Cryptographic systems have been widely used in many information security applications. One main challenge that these systems have faced has been how to protect private keys from attackers. Recently, biometric cryptosystems have been introduced as a reliable way of concealing private keys by using biometric data. A fuzzy vault refers to a biometric cryptosystem that can be used to effectively protect private keys and to release them only when legitimate users enter their biometric data. In biometric systems, a critical problem is storing biometric templates in a database. However, fuzzy vault systems do not need to directly store these templates since they are combined with private keys by using cryptography. Previous fuzzy vault systems were designed by using fingerprint, face, and so on. However, there has been no attempt to implement a fuzzy vault system that used an iris. In biometric applications, it is widely known that an iris can discriminate between persons better than other biometric modalities. In this paper, we propose a reliable fuzzy vault system based on local iris features. We extracted multiple iris features from multiple local regions in a given iris image, and the exact values of the unordered set were then produced using the clustering method. To align the iris templates with the new input iris data, a shift-matching technique was applied. Experimental results showed that 128-bit private keys were securely and robustly generated by using any given iris data without requiring prealignment.
Line segment confidence region-based string matching method for map conflation
NASA Astrophysics Data System (ADS)
Huh, Yong; Yang, Sungchul; Ga, Chillo; Yu, Kiyun; Shi, Wenzhong
2013-04-01
In this paper, a method to detect corresponding point pairs between polygon object pairs with a string matching method based on a confidence region model of a line segment is proposed. The optimal point edit sequence to convert the contour of a target object into that of a reference object was found by the string matching method which minimizes its total error cost, and the corresponding point pairs were derived from the edit sequence. Because a significant amount of apparent positional discrepancies between corresponding objects are caused by spatial uncertainty and their confidence region models of line segments are therefore used in the above matching process, the proposed method obtained a high F-measure for finding matching pairs. We applied this method for built-up area polygon objects in a cadastral map and a topographical map. Regardless of their different mapping and representation rules and spatial uncertainties, the proposed method with a confidence level at 0.95 showed a matching result with an F-measure of 0.894.
NASA Astrophysics Data System (ADS)
Heid, T.; Kääb, A.
2011-12-01
Automatic matching of images from two different times is a method that is often used to derive glacier surface velocity. Nearly global repeat coverage of the Earth's surface by optical satellite sensors now opens the possibility for global-scale mapping and monitoring of glacier flow with a number of applications in, for example, glacier physics, glacier-related climate change and impact assessment, and glacier hazard management. The purpose of this study is to compare and evaluate different existing image matching methods for glacier flow determination over large scales. The study compares six different matching methods: normalized cross-correlation (NCC), the phase correlation algorithm used in the COSI-Corr software, and four other Fourier methods with different normalizations. We compare the methods over five regions of the world with different representative glacier characteristics: Karakoram, the European Alps, Alaska, Pine Island (Antarctica) and southwest Greenland. Landsat images are chosen for matching because they expand back to 1972, they cover large areas, and at the same time their spatial resolution is as good as 15 m for images after 1999 (ETM+ pan). Cross-correlation on orientation images (CCF-O) outperforms the three similar Fourier methods, both in areas with high and low visual contrast. NCC experiences problems in areas with low visual contrast, areas with thin clouds or changing snow conditions between the images. CCF-O has problems on narrow outlet glaciers where small window sizes (about 16 pixels by 16 pixels or smaller) are needed, and it also obtains fewer correct matches than COSI-Corr in areas with low visual contrast. COSI-Corr has problems on narrow outlet glaciers and it obtains fewer correct matches compared to CCF-O when thin clouds cover the surface, or if one of the images contains snow dunes. In total, we consider CCF-O and COSI-Corr to be the two most robust matching methods for global-scale mapping and monitoring of glacier
Gearbox coupling modulation separation method based on match pursuit and correlation filtering
NASA Astrophysics Data System (ADS)
He, Guolin; Ding, Kang; Lin, Huibin
2016-01-01
The vibration signal of faulty gearbox commonly involves complex coupling modulation components. The method of sparse representation has been successfully used for gearbox fault diagnosis, but most of the literatures only focus on the extraction of impact modulation and always neglect the steady modulation representing the distributed faults. This paper presents a new method for separating coupling modulation from vibration signal of gearbox based on match pursuit and correlation filtering. To separate the steady modulation caused by distributed fault and the impact modulation caused by impact fault, two sub-dictionaries are specially designed according to the gearbox operating and structural parameters and the characteristics of vibration signal. The new dictionaries have clear physical meaning and good adaptability. In addition, an amplitude recovery step is conducted to improve the matching accuracy in the match pursuit. Simulation and experimental results show that the proposed method can separate the coupling components of gearbox vibration signal effectively under intensive background noise.
An efficient photogrammetric stereo matching method for high-resolution images
NASA Astrophysics Data System (ADS)
Li, Yingsong; Zheng, Shunyi; Wang, Xiaonan; Ma, Hao
2016-12-01
Stereo matching of high-resolution images is a great challenge in photogrammetry. The main difficulty is the enormous processing workload that involves substantial computing time and memory consumption. In recent years, the semi-global matching (SGM) method has been a promising approach for solving stereo problems in different data sets. However, the time complexity and memory demand of SGM are proportional to the scale of the images involved, which leads to very high consumption when dealing with large images. To solve it, this paper presents an efficient hierarchical matching strategy based on the SGM algorithm using single instruction multiple data instructions and structured parallelism in the central processing unit. The proposed method can significantly reduce the computational time and memory required for large scale stereo matching. The three-dimensional (3D) surface is reconstructed by triangulating and fusing redundant reconstruction information from multi-view matching results. Finally, three high-resolution aerial date sets are used to evaluate our improvement. Furthermore, precise airborne laser scanner data of one data set is used to measure the accuracy of our reconstruction. Experimental results demonstrate that our method remarkably outperforms in terms of time and memory savings while maintaining the density and precision of the 3D cloud points derived.
A Real-Time Infrared Ultra-Spectral Signature Classification Method via Spatial Pyramid Matching
Mei, Xiaoguang; Ma, Yong; Li, Chang; Fan, Fan; Huang, Jun; Ma, Jiayi
2015-01-01
The state-of-the-art ultra-spectral sensor technology brings new hope for high precision applications due to its high spectral resolution. However, it also comes with new challenges, such as the high data dimension and noise problems. In this paper, we propose a real-time method for infrared ultra-spectral signature classification via spatial pyramid matching (SPM), which includes two aspects. First, we introduce an infrared ultra-spectral signature similarity measure method via SPM, which is the foundation of the matching-based classification method. Second, we propose the classification method with reference spectral libraries, which utilizes the SPM-based similarity for the real-time infrared ultra-spectral signature classification with robustness performance. Specifically, instead of matching with each spectrum in the spectral library, our method is based on feature matching, which includes a feature library-generating phase. We calculate the SPM-based similarity between the feature of the spectrum and that of each spectrum of the reference feature library, then take the class index of the corresponding spectrum having the maximum similarity as the final result. Experimental comparisons on two publicly-available datasets demonstrate that the proposed method effectively improves the real-time classification performance and robustness to noise. PMID:26205263
A Real-Time Infrared Ultra-Spectral Signature Classification Method via Spatial Pyramid Matching.
Mei, Xiaoguang; Ma, Yong; Li, Chang; Fan, Fan; Huang, Jun; Ma, Jiayi
2015-07-03
The state-of-the-art ultra-spectral sensor technology brings new hope for high precision applications due to its high spectral resolution. However, it also comes with new challenges, such as the high data dimension and noise problems. In this paper, we propose a real-time method for infrared ultra-spectral signature classification via spatial pyramid matching (SPM), which includes two aspects. First, we introduce an infrared ultra-spectral signature similarity measure method via SPM, which is the foundation of the matching-based classification method. Second, we propose the classification method with reference spectral libraries, which utilizes the SPM-based similarity for the real-time infrared ultra-spectral signature classification with robustness performance. Specifically, instead of matching with each spectrum in the spectral library, our method is based on feature matching, which includes a feature library-generating phase. We calculate the SPM-based similarity between the feature of the spectrum and that of each spectrum of the reference feature library, then take the class index of the corresponding spectrum having the maximum similarity as the final result. Experimental comparisons on two publicly-available datasets demonstrate that the proposed method effectively improves the real-time classification performance and robustness to noise.
A frequency response model matching method for PID controller design for processes with dead-time.
Anwar, Md Nishat; Pan, Somnath
2015-03-01
In this paper, a PID controller design method for the integrating processes based on frequency response matching is presented. Two approaches are proposed for the controller design. In the first approach, a double feedback loop configuration is considered where the inner loop is designed with a stabilizing gain. In the outer loop, the parameters of the PID controller are obtained by frequency response matching between the closed-loop system with the PID controller and a reference model with desired specifications. In the second approach, the design is directly carried out considering a desired load-disturbance rejection model of the system. In both the approaches, two low frequency points are considered for matching the frequency response, which yield linear algebraic equations, solution of which gives the controller parameters. Several examples are taken from the literature to demonstrate the effectiveness and to compare with some well known design methods.
Proton-decaying, light nuclei accessed via the invariant-mass method
NASA Astrophysics Data System (ADS)
Brown, Kyle
2017-01-01
Two-nucleon decay is the most recently discovered nuclear decay mode. For proton-rich nuclei, the majority of multi-proton decays occur via sequential steps of one-proton emission. Direct two-proton (2p) decay was believed to occur only in even-Z nuclei beyond the proton drip line where one-proton decay is energy forbidden. This has been observed for the ground states of around a dozen nuclei including 6Be, the lightest case, and 54Zn, the heaviest case. Direct 2p decay has also recently been observed for isobaric analog states where all possible 1p intermediates are either isospin allowed and energy forbidden, or energy-allowed and isospin forbidden. For light proton emitters, the lifetimes are short enough that the invariant-mass technique is ideal for measuring the decay energy, intrinsic width and, for multi-proton decays, the momentum correlations between the fragments. I will describe recent measurements of proton emitters using the invariant-mass technique with the High Resolution Array (HiRA). I will present a new, high-statistics measurement on the sequential 2p decay of excited states in 17Ne. Measuring the momentum correlations between the decay fragments allow us to determine the 1p intermediate state through which the decay proceeds. I will present data on the isobaric-analog pair 8C and 8BIAS, which highlight the two known types of direct 2p decay. I will also present the first observation of 17Na, which is unbound with respect to three-proton emission. Finally I will present a new measurement on the width of the first-excited state of 9C and compare to recent theoretical calculations.
NASA Astrophysics Data System (ADS)
Huang, Jingzhi; Sun, Tao; Gu, Wei; Wen, Zhongpu; Guo, Tenghui
2015-02-01
With the fast development of the advanced equipment manufacturing toward precision and ultra-precision trend, especially with the continuously improving of the aviation engine's performance, the problem of high displacement resolution for the large-load two-dimension adjusting and positioning worktable used for the aeroengine assembling become evident. A method was proposed which is based on the invariable restoring force, and the adjusting and positioning physical model was established. The experiment results indicate that under the occasion of a load with 508 kilogram, the worktable has got a displacement resolution of 0.3μm after using the improved method compared to 1.4μm of the traditional method. The improved method could meet the requirements of aviation engine assembling worktable.
Propensity Scores: Method for Matching on Multiple Variables in Down Syndrome Research
ERIC Educational Resources Information Center
Blackford, Jennifer Urbano
2009-01-01
Confounding variables can affect the results from studies of children with Down syndrome and their families. Traditional methods for addressing confounders are often limited, providing control for only a few confounding variables. This study introduces propensity score matching to control for multiple confounding variables. Using Tennessee birth…
NASA Astrophysics Data System (ADS)
Doko, Tomoko; Chen, Wenbo; Higuchi, Hiroyoshi
2016-06-01
Satellite tracking technology has been used to reveal the migration patterns and flyways of migratory birds. In general, bird migration can be classified according to migration status. These statuses include the wintering period, spring migration, breeding period, and autumn migration. To determine the migration status, periods of these statuses should be individually determined, but there is no objective method to define 'a threshold date' for when an individual bird changes its status. The research objective is to develop an effective and objective method to determine threshold dates of migration status based on satellite-tracked data. The developed method was named the "MATCHED (Migratory Analytical Time Change Easy Detection) method". In order to demonstrate the method, data acquired from satellite-tracked Tundra Swans were used. MATCHED method is composed by six steps: 1) dataset preparation, 2) time frame creation, 3) automatic identification, 4) visualization of change points, 5) interpretation, and 6) manual correction. Accuracy was tested. In general, MATCHED method was proved powerful to identify the change points between migration status as well as stopovers. Nevertheless, identifying "exact" threshold dates is still challenging. Limitation and application of this method was discussed.
ERIC Educational Resources Information Center
Wyse, Adam E.; Seo, Dong Gi
2014-01-01
This article provides a brief overview and comparison of three conditional growth percentile methods; student growth percentiles, percentile rank residuals, and a nonparametric matching method. These approaches seek to describe student growth in terms of the relative percentile ranking of a student in relationship to students that had the same…
Frank, Steven A
2016-01-01
In nematodes, environmental or physiological perturbations alter death's scaling of time. In human cancer, genetic perturbations alter death's curvature of time. Those changes in scale and curvature follow the constraining contours of death's invariant geometry. I show that the constraints arise from a fundamental extension to the theories of randomness, invariance and scale. A generalized Gompertz law follows. The constraints imposed by the invariant Gompertz geometry explain the tendency of perturbations to stretch or bend death's scaling of time. Variability in death rate arises from a combination of constraining universal laws and particular biological processes.
Frank, Steven A.
2016-01-01
In nematodes, environmental or physiological perturbations alter death’s scaling of time. In human cancer, genetic perturbations alter death’s curvature of time. Those changes in scale and curvature follow the constraining contours of death’s invariant geometry. I show that the constraints arise from a fundamental extension to the theories of randomness, invariance and scale. A generalized Gompertz law follows. The constraints imposed by the invariant Gompertz geometry explain the tendency of perturbations to stretch or bend death’s scaling of time. Variability in death rate arises from a combination of constraining universal laws and particular biological processes. PMID:27785361
A layered modulation method for pixel matching in online phase measuring profilometry
NASA Astrophysics Data System (ADS)
Li, Hongru; Feng, Guoying; Bourgade, Thomas; Yang, Peng; Zhou, Shouhuan; Asundi, Anand
2016-10-01
An online phase measuring profilometry with new layered modulation method for pixel matching is presented. In this method and in contrast with previous modulation matching methods, the captured images are enhanced by Retinex theory for better modulation distribution, and all different layer modulation masks are fully used to determine the displacement of a rectilinear moving object. High, medium and low modulation masks are obtained by performing binary segmentation with iterative Otsu method. The final shifting pixels are calculated based on centroid concept, and after that the aligned fringe patterns can be extracted from each frame. After performing Stoilov algorithm and a series of subsequent operations, the object profile on a translation stage is reconstructed. All procedures are carried out automatically, without setting specific parameters in advance. Numerical simulations are detailed and experimental results verify the validity and feasibility of the proposed approach.
The use of suitable pseudo-invariant targets for MIVIS data calibration by the empirical line method
NASA Astrophysics Data System (ADS)
Mei, Alessandro; Bassani, Cristiana; Fontinovo, Giuliano; Salvatori, Rosamaria; Allegrini, Alessia
2016-04-01
The Empirical Line Method (ELM) enables the calibration of multi- and hyper-airborne/satellite image converting DN or radiance to reflectance values performed by using at ground data. High quality outcome can be reached with the selection of appropriate Pseudo-Invariant Targets (PIT). In this paper, spectral variability of "usual" (asphalt and concrete) and "unusual" (calcareous gravel, basaltic paving, concrete bricks, tartan paving and artificial turf) PITs is retrieved for ELM application. Such PITs are used to calibrate the Multispectral Infrared and Visible Imaging Spectrometer (MIVIS) airborne sensor in 12 different Runs. Firstly, processing of field spectral data enables the evaluation of pseudo-invariance of targets by studying their spectral changes in space and in time. Finally, these surfaces are used as Ground Calibration (GCT) and Validation Targets (GVT) in ELM. High calibration accuracy values are observed in Visible (VIS) range (98.9%) while a general decrease of accuracy in Near-InfraRed (NIR) (96.6%) and Middle-InfraRed (SWIR) (88.1%) are reached. Outcomes show that "usual" surfaces as asphalt and concrete and "unusual" surfaces such as tartan can be successfully used for MIVIS image calibration.
A new method for matched field localization based on two-hydrophone
NASA Astrophysics Data System (ADS)
Li, Kun; Fang, Shi-liang
2015-03-01
The conventional matched field processing (MFP) uses large vertical arrays to locate an underwater acoustic target. However, the use of large vertical arrays increases equipment and computational cost, and causes some problems such as element failures, and array tilting to degrade the localization performance. In this paper, the matched field localization method using two-hydrophone is proposed for underwater acoustic pulse signals with an unknown emitted signal waveform. Using the received signal of hydrophones and the ocean channel pulse response which can be calculated from an acoustic propagation model, the spectral matrix of the emitted signal for different source locations can be estimated by employing the method of frequency domain least squares. The resulting spectral matrix of the emitted signal for every grid region is then multiplied by the ocean channel frequency response matrix to generate the spectral matrix of replica signal. Finally, the matched field localization using two-hydrophone for underwater acoustic pulse signals of an unknown emitted signal waveform can be estimated by comparing the difference between the spectral matrixes of the received signal and the replica signal. The simulated results from a shallow water environment for broadband signals demonstrate the significant localization performance of the proposed method. In addition, the localization accuracy in five different cases are analyzed by the simulation trial, and the results show that the proposed method has a sharp peak and low sidelobes, overcoming the problem of high sidelobes in the conventional MFP due to lack of the number of elements.
NASA Astrophysics Data System (ADS)
Ke, Xianhua; Jiang, Hao; Lv, Wen; Liu, Shiyuan
2016-03-01
Triple patterning (TP) lithography becomes a feasible technology for manufacturing as the feature size further scale down to sub 14/10 nm. In TP, a layout is decomposed into three masks followed with exposures and etches/freezing processes respectively. Previous works mostly focus on layout decomposition with minimal conflicts and stitches simultaneously. However, since any existence of native conflict will result in layout re-design/modification and reperforming the time-consuming decomposition, the effective method that can be aware of native conflicts (NCs) in layout is desirable. In this paper, a bin-based library matching method is proposed for NCs detection and layout decomposition. First, a layout is divided into bins and the corresponding conflict graph in each bin is constructed. Then, we match the conflict graph in a prebuilt colored library, and as a result the NCs can be located and highlighted quickly.
Invariants from classical field theory
Diaz, Rafael; Leal, Lorenzo
2008-06-15
We introduce a method that generates invariant functions from perturbative classical field theories depending on external parameters. By applying our methods to several field theories such as Abelian BF, Chern-Simons, and two-dimensional Yang-Mills theory, we obtain, respectively, the linking number for embedded submanifolds in compact varieties, the Gauss' and the second Milnor's invariant for links in S{sup 3}, and invariants under area-preserving diffeomorphisms for configurations of immersed planar curves.
Generalized scale invariant theories
NASA Astrophysics Data System (ADS)
Padilla, Antonio; Stefanyszyn, David; Tsoukalas, Minas
2014-03-01
We present the most general actions of a single scalar field and two scalar fields coupled to gravity, consistent with second-order field equations in four dimensions, possessing local scale invariance. We apply two different methods to arrive at our results. One method, Ricci gauging, was known to the literature and we find this to produce the same result for the case of one scalar field as a more efficient method presented here. However, we also find our more efficient method to be much more general when we consider two scalar fields. Locally scale invariant actions are also presented for theories with more than two scalar fields coupled to gravity and we explain how one could construct the most general actions for any number of scalar fields. Our generalized scale invariant actions have obvious applications to early Universe cosmology and include, for example, the Bezrukov-Shaposhnikov action as a subset.
Li, Yun; Schaubel, Douglas E.; He, Kevin
2013-01-01
In observational studies of survival time featuring a binary time-dependent treatment, the hazard ratio (an instantaneous measure) is often used to represent the treatment effect. However, investigators are often more interested in the difference in survival functions. We propose semiparametric methods to estimate the causal effect of treatment among the treated with respect to survival probability. The objective is to compare post-treatment survival with the survival function that would have been observed in the absence of treatment. For each patient, we compute a prognostic score (based on the pre-treatment death hazard) and a propensity score (based on the treatment hazard). Each treated patient is then matched with an alive, uncensored and not-yet-treated patient with similar prognostic and/or propensity scores. The experience of each treated and matched patient is weighted using a variant of Inverse Probability of Censoring Weighting to account for the impact of censoring. We propose estimators of the treatment-specific survival functions (and their difference), computed through weighted Nelson-Aalen estimators. Closed-form variance estimators are proposed which take into consideration the potential replication of subjects across matched sets. The proposed methods are evaluated through simulation, then applied to estimate the effect of kidney transplantation on survival among end-stage renal disease patients using data from a national organ failure registry. PMID:25309633
Localization of incipient tip vortex cavitation using ray based matched field inversion method
NASA Astrophysics Data System (ADS)
Kim, Dongho; Seong, Woojae; Choo, Youngmin; Lee, Jeunghoon
2015-10-01
Cavitation of marine propeller is one of the main contributing factors of broadband radiated ship noise. In this research, an algorithm for the source localization of incipient vortex cavitation is suggested. Incipient cavitation is modeled as monopole type source and matched-field inversion method is applied to find the source position by comparing the spatial correlation between measured and replicated pressure fields at the receiver array. The accuracy of source localization is improved by broadband matched-field inversion technique that enhances correlation by incoherently averaging correlations of individual frequencies. Suggested localization algorithm is verified through known virtual source and model test conducted in Samsung ship model basin cavitation tunnel. It is found that suggested localization algorithm enables efficient localization of incipient tip vortex cavitation using a few pressure data measured on the outer hull above the propeller and practically applicable to the typically performed model scale experiment in a cavitation tunnel at the early design stage.
A hybrid method in combining treatment effects from matched and unmatched studies.
Byun, Jinyoung; Lai, Dejian; Luo, Sheng; Risser, Jan; Tung, Betty; Hardy, Robert J
2013-12-10
The most common data structures in the biomedical studies have been matched or unmatched designs. Data structures resulting from a hybrid of the two may create challenges for statistical inferences. The question may arise whether to use parametric or nonparametric methods on the hybrid data structure. The Early Treatment for Retinopathy of Prematurity study was a multicenter clinical trial sponsored by the National Eye Institute. The design produced data requiring a statistical method of a hybrid nature. An infant in this multicenter randomized clinical trial had high-risk prethreshold retinopathy of prematurity that was eligible for treatment in one or both eyes at entry into the trial. During follow-up, recognition visual acuity was accessed for both eyes. Data from both eyes (matched) and from only one eye (unmatched) were eligible to be used in the trial. The new hybrid nonparametric method is a meta-analysis based on combining the Hodges-Lehmann estimates of treatment effects from the Wilcoxon signed rank and rank sum tests. To compare the new method, we used the classic meta-analysis with the t-test method to combine estimates of treatment effects from the paired and two sample t-tests. We used simulations to calculate the empirical size and power of the test statistics, as well as the bias, mean square and confidence interval width of the corresponding estimators. The proposed method provides an effective tool to evaluate data from clinical trials and similar comparative studies.
Alam, S Kaisar; Mamou, Jonathan; Feleppa, Ernest J; Kalisz, Andrew; Ramachandran, Sarayu
2011-11-01
Brachytherapy using small implanted radioactive seeds is becoming an increasingly popular method for treating prostate cancer, in which a radiation oncologist implants seeds in the prostate transperineally under ultrasound guidance. Dosimetry software determines the optimal placement of seeds for achieving the prescribed dose based on ultrasonic determination of the gland boundaries. However, because of prostate movement and distortion during the implantation procedure, some seeds may not be placed in the desired locations; this causes the delivered dose to differ from the prescribed dose. Current ultrasonic imaging methods generally cannot depict the implanted seeds accurately. We are investigating new ultrasonic imaging methods that show promise for enhancing the visibility of seeds and thereby enabling real-time detection and correction of seed-placement errors during the implantation procedure. Real-time correction of seed-placement errors will improve the therapeutic radiation dose delivered to target tissues. In this work, we compare the potential performance of a template-matching method and a previously published method based on singular spectrum analysis for imaging seeds. In particular, we evaluated how changes in seed angle and position relative to the ultrasound beam affect seed detection. The conclusion of the present study is that singular spectrum analysis has better sensitivity but template matching is more resistant to false positives; both perform well enough to make seed detection clinically feasible over a relevant range of angles and positions. Combining the information provided by the two methods may further reduce ambiguities in determining where seeds are located.
Tropospheric ozone retrieval by using SCIAMACHY Limb-Nadir-Matching method
NASA Astrophysics Data System (ADS)
Jia, Jia; Ladstätter-Weissenmayer, Annette; Ebojie, Felix; Rozanov, Alexei; Burrows, John
2014-05-01
Tropospheric ozone is photochemically produced during pollution events and transported from the stratosphere towards the troposphere. It is the third most important green house gases and the main component of summer smog. Global covered satellite measurements are well suitable to investigate sources, sinks, and transport mechanisms of tropospheric ozone in a global view, and to study a characteristic behaviour of the tropospheric ozone in regions. However, the usage of satellite data is associated to a large uncertainty as 90% ozone is located in the stratosphere and only the remaining part of 10% can be observed in the troposphere. The limb-nadir matching (LNM) technique is one of the methods suitable to retrieve tropospheric ozone distributions from space borne observations of the scattered solar light in the UV-visible spectral range. In this study we apply the LNM approach to alternating limb and nadir measurements performed by the SCIAMACHY instrument. A precise tropopause height is used to subtract the stratospheric ozone from the total ozone amount for each matching point. The focus of this work is to reduce the uncertainty of the resulting tropospheric ozone distributions by analysing possible error sources, refining both limb and nadir retrievals and the matching technique.
Tractors, mass, and Weyl invariance
NASA Astrophysics Data System (ADS)
Gover, A. R.; Shaukat, A.; Waldron, A.
2009-05-01
Deser and Nepomechie established a relationship between masslessness and rigid conformal invariance by coupling to a background metric and demanding local Weyl invariance, a method which applies neither to massive theories nor theories which rely upon gauge invariances for masslessness. We extend this method to describe massive and gauge invariant theories using Weyl invariance. The key idea is to introduce a new scalar field which is constant when evaluated at the scale corresponding to the metric of physical interest. This technique relies on being able to efficiently construct Weyl invariant theories. This is achieved using tractor calculus—a mathematical machinery designed for the study of conformal geometry. From a physics standpoint, this amounts to arranging fields in multiplets with respect to the conformal group but with novel Weyl transformation laws. Our approach gives a mechanism for generating masses from Weyl weights. Breitenlohner-Freedman stability bounds for Anti-de Sitter theories arise naturally as do direct derivations of the novel Weyl invariant theories given by Deser and Nepomechie. In constant curvature spaces, partially massless theories—which rely on the interplay between mass and gauge invariance—are also generated by our method. Another simple consequence is conformal invariance of the maximal depth partially massless theories. Detailed examples for spins s⩽2 are given including tractor and component actions, on-shell and off-shell approaches and gauge invariances. For all spins s⩾2 we give tractor equations of motion unifying massive, massless, and partially massless theories.
ERIC Educational Resources Information Center
DiStefano, Christine; Motl, Robert W.
2009-01-01
The Rosenberg Self-Esteem scale (RSE) has been widely used in examinations of sex differences in global self-esteem. However, previous examinations of sex differences have not accounted for method effects associated with item wording, which have consistently been reported by researchers using the RSE. Accordingly, this study examined the…
NASA Technical Reports Server (NTRS)
Garai, Anirban; Diosady, Laslo T.; Murman, Scott M.; Madavan, Nateri K.
2016-01-01
The perfectly matched layer (PML) technique is developed in the context of a high- order spectral-element Discontinuous-Galerkin (DG) method. The technique is applied to a range of test cases and is shown to be superior compared to other approaches, such as those based on using characteristic boundary conditions and sponge layers, for treating the inflow and outflow boundaries of computational domains. In general, the PML technique improves the quality of the numerical results for simulations of practical flow configurations, but it also exhibits some instabilities for large perturbations. A preliminary analysis that attempts to understand the source of these instabilities is discussed.
[Using neural networks based template matching method to obtain redshifts of normal galaxies].
Xu, Xin; Luo, A-li; Wu, Fu-chao; Zhao, Yong-heng
2005-06-01
Galaxies can be divided into two classes: normal galaxy (NG) and active galaxy (AG). In order to determine NG redshifts, an automatic effective method is proposed in this paper, which consists of the following three main steps: (1) From the template of normal galaxy, the two sets of samples are simulated, one with the redshift of 0.0-0.3, the other of 0.3-0.5, then the PCA is used to extract the main components, and train samples are projected to the main component subspace to obtain characteristic spectra. (2) The characteristic spectra are used to train a Probabilistic Neural Network to obtain a Bayes classifier. (3) An unknown real NG spectrum is first inputted to this Bayes classifier to determine the possible range of redshift, then the template matching is invoked to locate the redshift value within the estimated range. Compared with the traditional template matching technique with an unconstrained range, our proposed method not only halves the computational load, but also increases the estimation accuracy. As a result, the proposed method is particularly useful for automatic spectrum processing produced from a large-scale sky survey project.
Color matching of fabric blends: hybrid Kubelka-Munk + artificial neural network based method
NASA Astrophysics Data System (ADS)
Furferi, Rocco; Governi, Lapo; Volpe, Yary
2016-11-01
Color matching of fabric blends is a key issue for the textile industry, mainly due to the rising need to create high-quality products for the fashion market. The process of mixing together differently colored fibers to match a desired color is usually performed by using some historical recipes, skillfully managed by company colorists. More often than desired, the first attempt in creating a blend is not satisfactory, thus requiring the experts to spend efforts in changing the recipe with a trial-and-error process. To confront this issue, a number of computer-based methods have been proposed in the last decades, roughly classified into theoretical and artificial neural network (ANN)-based approaches. Inspired by the above literature, the present paper provides a method for accurate estimation of spectrophotometric response of a textile blend composed of differently colored fibers made of different materials. In particular, the performance of the Kubelka-Munk (K-M) theory is enhanced by introducing an artificial intelligence approach to determine a more consistent value of the nonlinear function relationship between the blend and its components. Therefore, a hybrid K-M+ANN-based method capable of modeling the color mixing mechanism is devised to predict the reflectance values of a blend.
Combining fuzzy logic and voting methods for matching pixel spectra with signature databases
NASA Astrophysics Data System (ADS)
Raeth, Peter G.; Pilati, Martin L.
2002-08-01
This paper discusses a method for searching a database of known material signatures to find the closest match with an unknown signature. This database search method combines fuzzy logic and voting methods to achieve a high level of classification accuracy with the signatures and data cubes tested. This paper discusses the method in detail to include background and test results. It makes reference to public literature concerning components used by the method but developed elsewhere. This paper results from a project whose main objective is to produce an easily integrated software tool that makes an accurate best-guess as to the material(s) indicated by the signature of a pixel found to be interesting according to some analysis method, such as anomaly detection and scene characterization. Anomaly detection examines a spectral cube and determines which pixels are unusual relative to the majority background. Scene characterization finds pixels whose signatures are representative of the unique pixel groups. The current project fully automates the process of determining unknown pixels of interest, taking the signatures from the flagged pixels, searching a database of known signatures, and making a best guess as to the material(s) represented by each pixel's signature. The method ranks the possible materials by order of likelihood with the purpose of accounting for multiple materials existing in the same pixel. In this way it is possible to deliver multiple reportings when more than one material is closely matched within some threshold. This facilitates human analysis and decision-making for productions purposes. The implementation facilitates rapid response to interactive analysis need in support of strategic and tactical operational requirements in both the civil and defense sectors.
Energy Calibration of the BaBar EMC Using the Pi0 Invariant Mass Method
Tanner, David J.; /Manchester U.
2007-04-06
The BaBar electromagnetic calorimeter energy calibration method was compared with the local and global peak iteration procedures, of Crystal Barrel and CLEO-II. An investigation was made of the possibility of {Upsilon}(4S) background reduction which could lead to increased statistics over a shorter time interval, for efficient calibration runs. The BaBar software package was used with unreconstructed data to study the energy response of the calorimeter, by utilizing the {pi}{sup 0} mass constraint on pairs of photon clusters.
Correlation of firing pin impressions based on congruent matching cross-sections (CMX) method.
Zhang, Hao; Song, John; Tong, Mingsi; Chu, Wei
2016-06-01
Comparison of firing pin impressions of cartridge cases is an important part of firearms evidence identification. However, compared with breach face impressions, there is only a limited surface area over which firing pin impressions can be compared. Furthermore, the curvature of firing pin impressions makes it difficult to perform automatic correlations of the surfaces. In this study, a new method and related algorithm named congruent matching cross-sections (CMX) are proposed. Each firing pin impression is sliced into layers and the resulting circular cross-sections are converted to two dimensional linear profiles by a polar coordinate transformation. The differential profile extraction method is used for extracting the high frequency micro-features, or the individual characteristics, for accurate correlation. Three parameters are proposed for determining whether these pairwise firing pin impressions are fired from the same firearm. The cross-correlation function (CCF) is used for quantifying similarity of the pairwise profiles which represent the two correlated firing pin images. If the correlated cartridge pair is fired from the same firearm, the maximum CCF value between each of the profile pairs from the reference and the correlated firing pin impressions will be high. The other two parameters relate to the horizontal (or angular) and vertical range of relative shifts that the profiles undergo to obtain the maximum CCF. These shifts are the phase angle θ which corresponds to a horizontal shift of the 2D profiles and the vertical shift distance of slice section, i.e. where the profiles match in the depth of the impression. These shift parameters are used to determine the congruency of the pairwise profile patterns. When these parameter values and their statistical distributions are collected for analysis, the CMX number is derived as a key parameter for a conclusive identification or exclusion. Validation tests using 40 cartridge cases of three different
NASA Astrophysics Data System (ADS)
Cao, J.; Gu, H.
2015-12-01
Simultaneous source technology allows us to acquire seismic data in a much more efficient way and saves considerable acquisition time. However, it is necessary to separate these data into their conventionally acquired equivalent state. Luckily, we can simply treat the deblending problem as a noise attenuation problem because the blending noise has been performed to be incoherent in some domains such as common receiver, common offset domains. Multichannel matching pursuit (MCMP) is a lateral coherency based technique and has been widely used in a variety of seismic applications such as seismic trace decomposition and denoising seismic records. It decomposes the signals into a series of wavelets namely atoms, but the atom is just the best match to the average of multiple traces with the same scale factor, translation factor, frequency factor and phase parameter at each iteration, which is not in accord with the real seismic records. In this paper, we propose a new multichannel matching pursuit (MCMP) algorithm with directional features for simultaneous source separation in common receiver gathers. The new MCMP uses local lateral coherence as a constraint and utilizes the maximum semblance coefficient within a multidirectional window as the best direction at each iteration. To verify the effectiveness of this method, we use Ricker wavelet to synthetize a simultaneous source data set and sort the data to common receiver gathers. Comparing the deblending results with multidirectional vector median filter (MDVMF) method, the new MCMP preserves more useful seismic signals, but some individual useful signals are not reconstructed successfully probably because of the zero padding influence. The real data examples also prove that the new MCMP is effective in practice for deblending.
Fast 2D DOA Estimation Algorithm by an Array Manifold Matching Method with Parallel Linear Arrays
Yang, Lisheng; Liu, Sheng; Li, Dong; Jiang, Qingping; Cao, Hailin
2016-01-01
In this paper, the problem of two-dimensional (2D) direction-of-arrival (DOA) estimation with parallel linear arrays is addressed. Two array manifold matching (AMM) approaches, in this work, are developed for the incoherent and coherent signals, respectively. The proposed AMM methods estimate the azimuth angle only with the assumption that the elevation angles are known or estimated. The proposed methods are time efficient since they do not require eigenvalue decomposition (EVD) or peak searching. In addition, the complexity analysis shows the proposed AMM approaches have lower computational complexity than many current state-of-the-art algorithms. The estimated azimuth angles produced by the AMM approaches are automatically paired with the elevation angles. More importantly, for estimating the azimuth angles of coherent signals, the aperture loss issue is avoided since a decorrelation procedure is not required for the proposed AMM method. Numerical studies demonstrate the effectiveness of the proposed approaches. PMID:26907301
Measuring the complex orbital angular momentum spectrum of light with a mode-matching method.
Zhao, Peng; Li, Shikang; Feng, Xue; Cui, Kaiyu; Liu, Fang; Zhang, Wei; Huang, Yidong
2017-03-15
The relative phase shift among different components in the superposition of orbital angular momentum (OAM) states contains significant information. However, with existing methods of measuring the OAM spectrum, the phase term of the spectrum coefficient is hard to obtain. In this Letter, a mode-matching method is proposed to identify the complex OAM spectrum with a Mach-Zehnder interferometer and a charge-coupled device camera. It has the potential to extend the applications of OAM in scenarios sensitive to the phase factor, for instance, in imaging and quantum manipulation. The method is experimentally demonstrated with the superposition of two or three OAM states, while the maximum deviation of the energy ratio and the relative phase shift is 8.4% and 5.5% of 2π, respectively.
Systems, methods and apparatus for pattern matching in procedure development and verification
NASA Technical Reports Server (NTRS)
Hinchey, Michael G. (Inventor); Rash, James L. (Inventor); Rouff, Christopher A. (Inventor)
2011-01-01
Systems, methods and apparatus are provided through which, in some embodiments, a formal specification is pattern-matched from scenarios, the formal specification is analyzed, and flaws in the formal specification are corrected. The systems, methods and apparatus may include pattern-matching an equivalent formal model from an informal specification. Such a model can be analyzed for contradictions, conflicts, use of resources before the resources are available, competition for resources, and so forth. From such a formal model, an implementation can be automatically generated in a variety of notations. The approach can improve the resulting implementation, which, in some embodiments, is provably equivalent to the procedures described at the outset, which in turn can improve confidence that the system reflects the requirements, and in turn reduces system development time and reduces the amount of testing required of a new system. Moreover, in some embodiments, two or more implementations can be "reversed" to appropriate formal models, the models can be combined, and the resulting combination checked for conflicts. Then, the combined, error-free model can be used to generate a new (single) implementation that combines the functionality of the original separate implementations, and may be more likely to be correct.
New Spectral Method for Halo Particle Definition in Intense Mis-matched Beams
Dorf, Mikhail A.; Davidson, Ronald C.; Startsev, Edward A.
2011-04-27
An advanced spectral analysis of a mis-matched charged particle beam propagating through a periodic focusing transport lattice is utilized in particle-in-cell (PIC) simulations. It is found that the betatron frequency distribution function of a mismatched space-charge-dominated beam has a bump-on-tail structure attributed to the beam halo particles. Based on this observation, a new spectral method for halo particle definition is proposed that provides the opportunity to carry out a quantitative analysis of halo particle production by a beam mismatch. In addition, it is shown that the spectral analysis of the mismatch relaxation process provides important insights into the emittance growth attributed to the halo formation and the core relaxation processes. Finally, the spectral method is applied to the problem of space-charge transport limits.
Low-quality fingerprint recognition using a limited ellipse-band-based matching method.
He, Zaixing; Zhao, Xinyue; Zhang, Shuyou
2015-06-01
Current fingerprint recognition technologies are based mostly on the minutia algorithms, which cannot recognize fingerprint images in low-quality conditions. This paper proposes a novel recognition algorithm using a limited ellipse-band-based matching method. It uses the Fourier-Mellin transformation method to improve the limitation of the original algorithm, which cannot resist rotation changes. Furthermore, an ellipse band on the frequency amplitude is used to suppress noise that is introduced by the high-frequency parts of images. Finally, the recognition result is obtained by considering both the contrast and position correlation peaks. The experimental results show that the proposed algorithm can increase the recognition accuracy, particularly of images in low-quality conditions.
Application of the Sketch Match method in Sulina coastal study area within PEGASO project
NASA Astrophysics Data System (ADS)
Marin, Eugenia; Nichersu, Iuliana; Mierla, Marian; Trifanov, Cristian; Nichersu, Iulian
2013-04-01
The Sketch Match approach for Sulina pilot case was carried out in the frame of the project "People for Ecosystem Based Governance in Assessing Sustainable Development of Ocean and Coast" - PEGASO, funded by the Seventh Framework Programme. The PEGASO project has been designed to identify common threats and solutions in relation to the long-term sustainable development and environmental protection of coastal zones bordering the Mediterranean and Black Seas in ways relevant to the implementation of the Integrated Coastal Zone Management Protocol (ICZM) for the Mediterranean. PEGASO will use the model of the existing ICZM Protocol for the Mediterranean and adjust it to the needs of the Black Sea through innovative actions, one of them being Refine and develop efficient and easy to use tools for making sustainability assessments in the coastal zone tested through a number of relevant pilot sites. Thus, for the Romania case study, the Sketch Match approach was selected, being an interactive public participation planning method, developed by the Dutch Government, and applied for Sulina area in order to stimulate support and involvement from stakeholders regarding Integrated Coastal Zone Management Protocol by consulting and involving these people in the planning process and making use of a coherent package of interactive methods. Participants were representatives of a wide range of stakeholders, varying from local fisherman to representatives of the Local and County council and Danube Delta Biosphere Reserve Authority. They participated in a two-day design session, focused on problems and potentials of the area, with the aim to work out possible solutions for an integrated coastal spatial planning, focusing on the parallel enhance of the various local functions in the spatial design (coastal area protection next to industry, tourism, nature, recreation, and other activities).
ERIC Educational Resources Information Center
Powers, Sonya Jean
2010-01-01
When test forms are administered to examinee groups that differ in proficiency, equating procedures are used to disentangle group differences from form differences. This dissertation investigates the extent to which equating results are population invariant, the impact of group differences on equating results, the impact of group differences on…
An Improved Algorithm of Congruent Matching Cells (CMC) Method for Firearm Evidence Identifications
Tong, Mingsi; Song, John; Chu, Wei
2015-01-01
The Congruent Matching Cells (CMC) method was invented at the National Institute of Standards and Technology (NIST) for firearm evidence identifications. The CMC method divides the measured image of a surface area, such as a breech face impression from a fired cartridge case, into small correlation cells and uses four identification parameters to identify correlated cell pairs originating from the same firearm. The CMC method was validated by identification tests using both 3D topography images and optical images captured from breech face impressions of 40 cartridge cases fired from a pistol with 10 consecutively manufactured slides. In this paper, we discuss the processing of the cell correlations and propose an improved algorithm of the CMC method which takes advantage of the cell correlations at a common initial phase angle and combines the forward and backward correlations to improve the identification capability. The improved algorithm is tested by 780 pairwise correlations using the same optical images and 3D topography images as the initial validation. PMID:26958441
Murata, T; Akagi, K; Ostapenko, V V; Isoda, H; Nagata, K; Nasu, R; Shiga, T; Tanaka, Y; Yamamoto, I
1998-01-01
Capacitive heating is widely used in hyperthermic treatment of human malignancies. However, the pain on the body surface or thermoesthesia in the subcutaneous fatty layer may prevent an elevation of temperature in the tumors. Impedance matching is improved by a subtrap method entailing the application of two copper plates (10 x 850 x 0.06 mm) as a subtrap circuit to each of two capacitive electrodes. In a clinical trial the Tmax, Tave, Tmin for the subtrap method were all higher in comparison with those for the conventional technique (42.5 +/- 0.7 degrees C, 41.9 +/- 1.0 degrees C, 41.3 +/- 1.1 degrees C vs. 41.1 +/- 1.5 degrees C, 40.6 +/- 1.3 degrees C, 40.0 +/- 1.3 degrees C). Although the maximal radiofrequency (RF) power applied to patients was higher with the subtrap method (875 +/- 189 W vs. 763 +/- 200 W), the incidence of surface pain was reduced dramatically. It is concluded that the subtrap method substantially improves the RF capacitive heating of deep-seated tumors.
The impacts of speed cameras on road accidents: an application of propensity score matching methods.
Li, Haojie; Graham, Daniel J; Majumdar, Arnab
2013-11-01
This paper aims to evaluate the impacts of speed limit enforcement cameras on reducing road accidents in the UK by accounting for both confounding factors and the selection of proper reference groups. The propensity score matching (PSM) method is employed to do this. A naïve before and after approach and the empirical Bayes (EB) method are compared with the PSM method. A total of 771 sites and 4787 sites for the treatment and the potential reference groups respectively are observed for a period of 9 years in England. Both the PSM and the EB methods show similar results that there are significant reductions in the number of accidents of all severities at speed camera sites. It is suggested that the propensity score can be used as the criteria for selecting the reference group in before-after control studies. Speed cameras were found to be most effective in reducing accidents up to 200 meters from camera sites and no evidence of accident migration was found.
NASA Astrophysics Data System (ADS)
Ding, Baiyuan; Wen, Gongjian; Zhong, Jinrong; Ma, Conghui; Yang, Xiaoliang
2016-01-01
This paper proposes a robust method for the matching of attributed scattering centers (ASCs) with application to synthetic aperture radar automatic target recognition (ATR). For the testing image to be classified, ASCs are extracted to match with the ones predicted by templates. First, Hungarian algorithm is employed to match those two ASC sets initially. Then, a precise matching is carried out through a threshold method. Point similarity and structure similarity are calculated, which are fused to evaluate the overall similarity of the two ASC sets based on the Dempster-Shafer theory of evidence. Finally, the target type is determined by such similarities between the testing image and various types of targets. Experiments on the moving and stationary target acquisition and recognition data verify the validity of the proposed method.
Iris recognition using possibilistic fuzzy matching on local features.
Tsai, Chung-Chih; Lin, Heng-Yi; Taur, Jinshiuh; Tao, Chin-Wang
2012-02-01
In this paper, we propose a novel possibilistic fuzzy matching strategy with invariant properties, which can provide a robust and effective matching scheme for two sets of iris feature points. In addition, the nonlinear normalization model is adopted to provide more accurate position before matching. Moreover, an effective iris segmentation method is proposed to refine the detected inner and outer boundaries to smooth curves. For feature extraction, the Gabor filters are adopted to detect the local feature points from the segmented iris image in the Cartesian coordinate system and to generate a rotation-invariant descriptor for each detected point. After that, the proposed matching algorithm is used to compute a similarity score for two sets of feature points from a pair of iris images. The experimental results show that the performance of our system is better than those of the systems based on the local features and is comparable to those of the typical systems.
Guan, Yanwei; Gao, Shiqiao; Liu, Haipeng; Jin, Lei; Zhang, Yaping
2016-01-01
In this paper, a stiffness match method is proposed to reduce the vibration sensitivity of micromachined tuning fork gyroscopes. Taking advantage of the coordinate transformation method, a theoretical model is established to analyze the anti-phase vibration output caused by the stiffness mismatch due to the fabrication imperfections. The analytical solutions demonstrate that the stiffness mismatch is proportional to the output induced by the external linear vibration from the sense direction in the anti-phase mode frequency. In order to verify the proposed stiffness match method, a tuning fork gyroscope (TFG) with the stiffness match electrodes is designed and implemented using the micromachining technology and the experimental study is carried out. The experimental tests illustrate that the vibration output can be reduced by 73.8% through the stiffness match method than the structure without the stiffness match. Therefore, the proposed stiffness match method is experimentally validated to be applicable to vibration sensitivity reduction in the Micro-Electro-Mechanical-Systems (MEMS) tuning fork gyroscopes without sacrificing the scale factor. PMID:27455272
Guan, Yanwei; Gao, Shiqiao; Liu, Haipeng; Jin, Lei; Zhang, Yaping
2016-07-22
In this paper, a stiffness match method is proposed to reduce the vibration sensitivity of micromachined tuning fork gyroscopes. Taking advantage of the coordinate transformation method, a theoretical model is established to analyze the anti-phase vibration output caused by the stiffness mismatch due to the fabrication imperfections. The analytical solutions demonstrate that the stiffness mismatch is proportional to the output induced by the external linear vibration from the sense direction in the anti-phase mode frequency. In order to verify the proposed stiffness match method, a tuning fork gyroscope (TFG) with the stiffness match electrodes is designed and implemented using the micromachining technology and the experimental study is carried out. The experimental tests illustrate that the vibration output can be reduced by 73.8% through the stiffness match method than the structure without the stiffness match. Therefore, the proposed stiffness match method is experimentally validated to be applicable to vibration sensitivity reduction in the Micro-Electro-Mechanical-Systems (MEMS) tuning fork gyroscopes without sacrificing the scale factor.
Apparatus and methods for using achromatic phase matching at high orders of dispersion
Richman, Bruce; Trebino, Rick; Bisson, Scott; Sidick, Erkin
2001-01-01
Achromatic phase-matching (APM) is used for efficiently multiplying the frequency of broad bandwidth light by using a nonlinear optical medium comprising a second-harmonic generation (SHG) crystal. Stationary optical elements whose configuration, properties, and arrangement have been optimized to match the dispersion characteristics of the SHG crystal to at least the second order. These elements include a plurality of prismatic elements for directing an input light beam onto the SHG crystal such that each ray wavelength is aligned to match the phase-matching angle for the crystal at each wavelength of light to at least the second order and such that every ray wavelength overlap within the crystal.
[A method for obtaining redshifts of quasars based on wavelet multi-scaling feature matching].
Liu, Zhong-Tian; Li, Xiang-Ru; Wu, Fu-Chao; Zhao, Yong-Heng
2006-09-01
The LAMOST project, the world's largest sky survey project being implemented in China, is expected to obtain 10(5) quasar spectra. The main objective of the present article is to explore methods that can be used to estimate the redshifts of quasar spectra from LAMOST. Firstly, the features of the broad emission lines are extracted from the quasar spectra to overcome the disadvantage of low signal-to-noise ratio. Then the redshifts of quasar spectra can be estimated by using the multi-scaling feature matching. The experiment with the 15, 715 quasars from the SDSS DR2 shows that the correct rate of redshift estimated by the method is 95.13% within an error range of 0. 02. This method was designed to obtain the redshifts of quasar spectra with relative flux and a low signal-to-noise ratio, which is applicable to the LAMOST data and helps to study quasars and the large-scale structure of the universe etc.
Reflection symmetry detection using locally affine invariant edge correspondence.
Wang, Zhaozhong; Tang, Zesheng; Zhang, Xiao
2015-04-01
Reflection symmetry detection receives increasing attentions in recent years. The state-of-the-art algorithms mainly use the matching of intensity-based features (such as the SIFT) within a single image to find symmetry axes. This paper proposes a novel approach by establishing the correspondence of locally affine invariant edge-based features, which are superior to the intensity based in the aspects that it is insensitive to illumination variations, and applicable to textureless objects. The locally affine invariance is achieved by simple linear algebra for efficient and robust computations, making the algorithm suitable for detections under object distortions like perspective projection. Commonly used edge detectors and a voting process are, respectively, used before and after the edge description and matching steps to form a complete reflection detection pipeline. Experiments are performed using synthetic and real-world images with both multiple and single reflection symmetry axis. The test results are compared with existing algorithms to validate the proposed method.
NASA Technical Reports Server (NTRS)
Bi, Lei; Yang, Ping; Kattawar, George W.; Mishchenko, Michael I.
2012-01-01
Three terms, ''Waterman's T-matrix method'', ''extended boundary condition method (EBCM)'', and ''null field method'', have been interchangeable in the literature to indicate a method based on surface integral equations to calculate the T-matrix. Unlike the previous method, the invariant imbedding method (IIM) calculates the T-matrix by the use of a volume integral equation. In addition, the standard separation of variables method (SOV) can be applied to compute the T-matrix of a sphere centered at the origin of the coordinate system and having a maximal radius such that the sphere remains inscribed within a nonspherical particle. This study explores the feasibility of a numerical combination of the IIM and the SOV, hereafter referred to as the IIMþSOV method, for computing the single-scattering properties of nonspherical dielectric particles, which are, in general, inhomogeneous. The IIMþSOV method is shown to be capable of solving light-scattering problems for large nonspherical particles where the standard EBCM fails to converge. The IIMþSOV method is flexible and applicable to inhomogeneous particles and aggregated nonspherical particles (overlapped circumscribed spheres) representing a challenge to the standard superposition T-matrix method. The IIMþSOV computational program, developed in this study, is validated against EBCM simulated spheroid and cylinder cases with excellent numerical agreement (up to four decimal places). In addition, solutions for cylinders with large aspect ratios, inhomogeneous particles, and two-particle systems are compared with results from discrete dipole approximation (DDA) computations, and comparisons with the improved geometric-optics method (IGOM) are found to be quite encouraging.
Conley, Colleen M; Derby, K Mark; Roberts-Gwinn, Michelle; Weber, Kimberly P; McLaughlin, T E
2004-01-01
This study compared the copy, cover, and compare method to a picture-word matching method for teaching sight word recognition. Participants were 5 kindergarten students with less than preprimer sight word vocabularies who were enrolled in a public school in the Pacific Northwest. A multielement design was used to evaluate the effects of the two interventions. Outcomes suggested that sight words taught using the copy, cover, and compare method resulted in better maintenance of word recognition when compared to the picture-matching intervention. Benefits to students and the practicality of employing the word-level teaching methods are discussed. PMID:15529890
2016-06-01
Reports an error in "Assessment of Identity During Adolescence Using Daily Diary Methods: Measurement Invariance Across Time and Sex" by Andrik I. Becht, Susan J. T. Branje, Wilma A. M. Vollebergh, Dominique F. Maciejewski, Pol A. C. van Lier, Hans M. Koot, Jaap J. A. Denissen and Wim H. J. Meeus (Psychological Assessment, Advanced Online Publication, Aug 10, 2015, np). In the article the participants should have been reported as N = 494. No differences were found in the results upon reanalyzing the data with the correct number of participants. Additionally, the last sentence of the first full paragraph in the Invariance Across Boys and Girls subsection of the Method section should read "In the fourth model, strict invariance was examined, in which the residual variances were constrained to be equal for boys and girls." (The following abstract of the original article appeared in record 2015-36246-001.) The aim of this study was to assess measurement invariance of adolescents' daily reports on identity across time and sex. Adolescents (N = 497; mean age = 13.32 years at Time 1, 56.7% boys) from the general population reported on their identity commitments, exploration in depth and reconsideration on a daily basis for 3 weeks within 1 year across 5 years. We used the single-item version of the Utrecht Management of Identity Commitments Scale (UMICS; Klimstra et al., 2010), a broad measure of identity-formation processes covering both interpersonal and educational identity domains. This study tested configural, metric, scalar, and strict measurement invariance across days within weeks, across sex, across weeks within years, and across years. Results indicated that daily diary reports show strict measurement invariance across days, across weeks within years, across years, and across boys and girls. These results support the use of daily diary methods to assess identity at various time intervals ranging from days to years and across sex. Results are discussed with
NASA Astrophysics Data System (ADS)
Staufer, J.; Staehelin, J.; Stübi, R.; Peter, T.; Tummon, F.; Thouret, V.
2013-12-01
With the aim of improving ozonesonde observations in the upper troposphere/lower stratosphere (UTLS), we use three-dimensional forward and backward trajectories, driven by ERA-Interim wind fields to match and compare ozonesonde measurements at Payerne (Switzerland) with observations from the MOZAIC aircraft program from 1994-2009. The uncertainties associated with the sonde-MOZAIC match technique were assessed using "self-matches", i.e. matches of instruments of the same type, such as MOZAIC-MOZAIC. Despite strong vertical gradients of ozone at the tropopause, which render the match approach difficult, the method provides excellent results, showing mean differences between different MOZAIC aircraft of ±2% (typically with a few hours between the up- and downstream match points). Matches between MOZAIC aircraft and Payerne ozonesondes show an agreement of ±5% for sondes equipped with electrochemical concentration cells (ECC) and between < 5% (not scaled to total ozone) and < 10% (scaled) for the Brewer-Mast (BM) sondes after 1998. Prior to 1998, BM sondes show an offset of around 20% (scaled). No break can be identified through the change from the BM to ECC sonde types in September 2002. A comparison of BM sondes with ozone measurements from the NOXAR B747 project for the period 1995-1996 show a smaller offset of around 15% (scaled), which may indicate a small drift in the MOZAIC calibration.
NASA Astrophysics Data System (ADS)
Staufer, J.; Staehelin, J.; Stübi, R.; Peter, T.; Tummon, F.; Thouret, V.
2013-08-01
With the aim of improving ozonesonde observations in the upper troposphere/lower stratosphere (UTLS), we use three-dimensional forward and backward trajectories, driven by ERA-Interim wind fields to match and compare ozonesonde measurements at Payerne (Switzerland) with observations from the MOZAIC aircraft program from 1994-2009. The uncertainties associated with the sonde-MOZAIC match technique were assessed using "self-matches", i.e. matches of instruments of the same type, such as MOZAIC-MOZAIC. Despite strong vertical ozone gradients of ozone at the tropopause, which render the match approach difficult, the method provides excellent results, showing mean differences between different MOZAIC aircraft of ±2% (typically with a few hours between the up- and downstream match points). Matches between MOZAIC aircraft and Payerne ozonesondes show an agreement of ±5% for sondes equipped with electrochemical concentration cells (ECC) and between <5% (not scaled to total ozone) and <10% (scaled) for the Brewer-Mast (BM) sondes after 1998. Prior to 1998, BM sondes show an offset of around 20% (scaled). No break can be identified through the change from the BM to ECC sonde types in September 2002. A comparison of BM sondes with ozone measurements from the NOXAR B747 project for the period 1995-1996 show a smaller offset of around 15% (scaled), which may indicate a small drift in the MOZAIC calibration.
NASA Technical Reports Server (NTRS)
Bi, Lei; Yang, Ping; Kattawar, George W.; Mishchenko, Michael I.
2013-01-01
The extended boundary condition method (EBCM) and invariant imbedding method (IIM) are two fundamentally different T-matrix methods for the solution of light scattering by nonspherical particles. The standard EBCM is very efficient but encounters a loss of precision when the particle size is large, the maximum size being sensitive to the particle aspect ratio. The IIM can be applied to particles in a relatively large size parameter range but requires extensive computational time due to the number of spherical layers in the particle volume discretization. A numerical combination of the EBCM and the IIM (hereafter, the EBCM+IIM) is proposed to overcome the aforementioned disadvantages of each method. Even though the EBCM can fail to obtain the T-matrix of a considered particle, it is valuable for decreasing the computational domain (i.e., the number of spherical layers) of the IIM by providing the initial T-matrix associated with an iterative procedure in the IIM. The EBCM+IIM is demonstrated to be more efficient than the IIM in obtaining the optical properties of large size parameter particles beyond the convergence limit of the EBCM. The numerical performance of the EBCM+IIM is illustrated through representative calculations in spheroidal and cylindrical particle cases.
NASA Astrophysics Data System (ADS)
Hayes, Charles E.; McClellan, James H.; Scott, Waymond R.; Kerr, Andrew J.
2016-05-01
This work introduces two advances in wide-band electromagnetic induction (EMI) processing: a novel adaptive matched filter (AMF) and matched subspace detection methods. Both advances make use of recent work with a subspace SVD approach to separating the signal, soil, and noise subspaces of the frequency measurements The proposed AMF provides a direct approach to removing the EMI self-response while improving the signal to noise ratio of the data. Unlike previous EMI adaptive downtrack filters, this new filter will not erroneously optimize the EMI soil response instead of the EMI target response because these two responses are projected into separate frequency subspaces. The EMI detection methods in this work elaborate on how the signal and noise subspaces in the frequency measurements are ideal for creating the matched subspace detection (MSD) and constant false alarm rate matched subspace detection (CFAR) metrics developed by Scharf The CFAR detection metric has been shown to be the uniformly most powerful invariant detector.
NASA Astrophysics Data System (ADS)
Kypraios, Ioannis; Young, Rupert C. D.; Birch, Philip M.; Chatwin, Christopher R.
2003-08-01
The various types of synthetic discriminant function (sdf) filter result in a weighted linear superposition of the training set images. Neural network training procedures result in a non-linear superposition of the training set images or, effectively, a feature extraction process, which leads to better interpolation properties than achievable with the sdf filter. However, generally, shift invariance is lost since a data dependant non-linear weighting function is incorporated in the input data window. As a compromise, we train a non-linear superposition filter via neural network methods with the constraint of a linear input to allow for shift invariance. The filter can then be used in a frequency domain based optical correlator. Simulation results are presented that demonstrate the improved training set interpolation achieved by the non-linear filter as compared to a linear superposition filter.
NASA Astrophysics Data System (ADS)
Vollmer, Gerhard
2010-10-01
Scientific knowledge should not only be true, it should be as objective as possible. It should refer to a reality independent of any subject. What can we use as a criterion of objectivity? Intersubjectivity (i.e., intersubjective understandability and intersubjective testability) is necessary, but not sufficient. Other criteria are: independence of reference system, independence of method, non-conventionality. Is there some common trait? Yes, there is: invariance under some specified transformations. Thus, we say: A proposition is objective only if its truth is invariant against a change in the conditions under which it was formulated. We give illustrations from geometry, perception, neurobiology, relativity theory, and quantum theory. Such an objectivist position has many advantages.
Wu, Yang; Zuo, Bin; Wen, Fangfang; Yan, Lei
2017-01-01
Using confirmatory factor analyses, this study examined the method effects on a Chinese version of the Rosenberg Self-Esteem Scale (RSES; Rosenberg, 1965 ) in a sample of migrant and urban children in China. In all, 982 children completed the RSES, and 9 models and 9 corresponding variants were specified and tested. The results indicated that the method effects are associated with both positively and negatively worded items and that Item 8 should be treated as a positively worded item. Additionally, the method effects models were invariant across migrant and urban children in China.
NASA Astrophysics Data System (ADS)
Hagenmuller, Pascal; Pilloix, Thibault
2016-05-01
Hardness has long been recognized as a good predictor of snow mechanical properties and therefore as an indicator of snowpack stability at the measured point. Portable digital penetrometers enable the amassing of a large number of snow stratigraphic hardness profiles. Numerous probings can be performed to assess the snowpack spatial variability and to compensate for measurement errors. On a decameter scale, continuous internal layers are typically present in the snowpack. The variability in stratigraphic features observed in the measurement set mainly originates from the measured variations in internal layer thickness due to either a real heterogeneity in the snowpack or to errors in depth measurement. For the purpose of real time analysis of snowpack stability, a great amount of data collected by digital penetrometers must be quickly synthesized into a characterization representative of the test site. This paper presents a method with which to match and combine several hardness profiles by automatically adjusting their layer thicknesses. The objectives are to synthesize the information collected by several profiles into one representative profile of the measurement set, disentangle information about hardness and depth variabilities, and quantitatively compare hardness profiles measured by different penetrometers. The method was tested by using co-located hardness profiles measured with three different penetrometers --- the snow micropenetrometer (SMP), the Avatech SP1 and the ramsonde --- during the winter 2014-2015 at two sites in the French Alps. When applied to the SMP profiles of both sites, the method reveals a low spatial variability of hardness properties, which is usually masked by depth variations. The developed algorithm is further used to evaluate the new portable penetrometer SP1. The hardness measured with this instrument is shown to be in good agreement with the SMP measurements, but errors in the recovered depth are notable, with a standard
The method of x-ray image intensifies pixel matching and noise suppression based on the CCD
NASA Astrophysics Data System (ADS)
Yu, Shengtao; Qin, Xulei; Li, Ye
2016-11-01
In the proximity of X-ray imaging systems based on X-ray image intensifier, pixel matching and noise suppression are important methods to improve image quality. This paper analyzes CCD parameters' impact on imaging quality and the relations with, proposes pixel matching degree is a critical factor to restrict the performance of imaging system, and verified by experiments, the CCD refrigeration can effectively suppress the image noise, which adopts the extension of integration time method and obtains favorable signal-to-noise ratio, it also provides a simple and low cost solution for high quality X-ray real-time imaging of static objects.
View Invariant Gait Recognition
NASA Astrophysics Data System (ADS)
Seely, Richard D.; Goffredo, Michela; Carter, John N.; Nixon, Mark S.
Recognition by gait is of particular interest since it is the biometric that is available at the lowest resolution, or when other biometrics are (intentionally) obscured. Gait as a biometric has now shown increasing recognition capability. There are many approaches and these show that recognition can achieve excellent performance on current large databases. The majority of these approaches are planar 2D, largely since the early large databases featured subjects walking in a plane normal to the camera view. To extend deployment capability, we need viewpoint invariant gait biometrics. We describe approaches where viewpoint invariance is achieved by 3D approaches or in 2D. In the first group, the identification relies on parameters extracted from the 3D body deformation during walking. These methods use several video cameras and the 3D reconstruction is achieved after a camera calibration process. On the other hand, the 2D gait biometric approaches use a single camera, usually positioned perpendicular to the subject’s walking direction. Because in real surveillance scenarios a system that operates in an unconstrained environment is necessary, many of the recent gait analysis approaches are orientated toward view-invariant gait recognition.
NASA Astrophysics Data System (ADS)
Farafonov, V. G.; Ustimov, V. I.; Tulegenov, A. R.
2016-08-01
An integral modification of the generalized point-matching method (GPMMi) in the electrostatic problem for axisymmetric particles is developed. Scalar potentials that determine electric fields are represented as expansions in terms of eigenfunctions of the Laplace operator in the spherical coordinate system. Unknown expansion coefficients are determined from infinite systems of linear algebraic equations (ISLAEs), which are obtained from the requirement of a minimum of the integrated residual in the boundary conditions on the particle surface. Matrix elements of ISLAEs and expansion coefficients of the "scattered" field at large index values are analyzed analytically and numerically. It is shown analytically that the applicability condition of the GPMMi coincides with that for the extended boundary conditions method (EBCM). As model particles, oblate pseudospheroids r( θ ) = a√ {1 - {^2}{{cos}^2}θ } ,{^2} = 1 - {b^2} {a_2} ≥ 0 with semiaxes a = 1 and b ≤ 1 are considered, which are obtained as a result of the inversion of prolate spheroids with the same semiaxes with respect to the coordinate origin. For pseudospheroids, the range of applicability of the considered methods is determined by the condition {a b} < √ 2 + 1. Numerical calculations show that, as a rule, the EBCM yields considerably more accurate results in this range, with the time consumption being substantially shorter. Beyond the EBCM range of applicability, the GPMMi approach can yield reasonable results for the calculation of the polarizability, which should be considered as approximate and which should be verified with other approaches. For oblate nonconvex pseudospheroids (i.e., at {a b} ≥slant √ 2 ), it is shown that the spheroidal model works well if pseudospheroids are replaced with ordinary "effective" oblate spheroids. Semiaxes a ef and b ef of the effective spheroids are determined from the requirement of the particle volumes, as well as from the equality of the maximal
Combined invariants to similarity transformation and to blur using orthogonal Zernike moments
Beijing, Chen; Shu, Huazhong; Zhang, Hui; Coatrieux, Gouenou; Luo, Limin; Coatrieux, Jean-Louis
2011-01-01
The derivation of moment invariants has been extensively investigated in the past decades. In this paper, we construct a set of invariants derived from Zernike moments which is simultaneously invariant to similarity transformation and to convolution with circularly symmetric point spread function (PSF). Two main contributions are provided: the theoretical framework for deriving the Zernike moments of a blurred image and the way to construct the combined geometric-blur invariants. The performance of the proposed descriptors is evaluated with various PSFs and similarity transformations. The comparison of the proposed method with the existing ones is also provided in terms of pattern recognition accuracy, template matching and robustness to noise. Experimental results show that the proposed descriptors perform on the overall better. PMID:20679028
NASA Technical Reports Server (NTRS)
Myneni, Ranga B.; Kanemasu, Edward T.; Asrar, Ghassem
1988-01-01
A finite element discrete ordinates method for solving the radiative transfer equation in nonrotationally invariant scattering media has been applied to the lead-canopy problem, and results are presented on the cross sections and the reflection functions. The method is based on a unique implementation of the Galerkin integral law formulation of the transport equation. For both near-normal and grazing incidences, the transfer functions of leaf canopies are found to be strongly anisotropic, with relatively more scattered flux in the vertical directions. It is suggested that the assumption of isotropic scattering in leaf canopies is not valid.
Re-evaluation of a Programmed Method To Teach Generalized Identity Matching to Sample.
ERIC Educational Resources Information Center
Dube, William V.; Serna, Richard W.
1998-01-01
Programmed identity-matching training was given to five participants with severe mental retardation and histories of failures in assessments and training attempts. When an intermediate goal of establishing one-trial discrimination learning was eliminated, four participants completed the program and passed tests for generalized identity matching…
ERIC Educational Resources Information Center
Nolting, Kimberly; Nolting, Paul
2008-01-01
Research supports the effectiveness of matching instructional methods with student learning preferences (Dunn et al., 1995; Pascarella and Terenzini, 2005). Several challenges exist, however, for mathematics departments to design classroom learning experiences that allow students to learn mathematics and learn how to study math through their…
Image mosaicking based on feature points using color-invariant values
NASA Astrophysics Data System (ADS)
Lee, Dong-Chang; Kwon, Oh-Seol; Ko, Kyung-Woo; Lee, Ho-Young; Ha, Yeong-Ho
2008-02-01
In the field of computer vision, image mosaicking is achieved using image features, such as textures, colors, and shapes between corresponding images, or local descriptors representing neighborhoods of feature points extracted from corresponding images. However, image mosaicking based on feature points has attracted more recent attention due to the simplicity of the geometric transformation, regardless of distortion and differences in intensity generated by camera motion in consecutive images. Yet, since most feature-point matching algorithms extract feature points using gray values, identifying corresponding points becomes difficult in the case of changing illumination and images with a similar intensity. Accordingly, to solve these problems, this paper proposes a method of image mosaicking based on feature points using color information of images. Essentially, the digital values acquired from a real digital color camera are converted to values of a virtual camera with distinct narrow bands. Values based on the surface reflectance and invariant to the chromaticity of various illuminations are then derived from the virtual camera values and defined as color-invariant values invariant to changing illuminations. The validity of these color-invariant values is verified in a test using a Macbeth Color-Checker under simulated illuminations. The test also compares the proposed method using the color-invariant values with the conventional SIFT algorithm. The accuracy of the matching between the feature points extracted using the proposed method is increased, while image mosaicking using color information is also achieved.
Galilei invariant technique for quantum system description
Kamuntavičius, Gintautas P.
2014-04-15
Problems with quantum systems models, violating Galilei invariance are examined. The method for arbitrary non-relativistic quantum system Galilei invariant wave function construction, applying a modified basis where center-of-mass excitations have been removed before Hamiltonian matrix diagonalization, is developed. For identical fermion system, the Galilei invariant wave function can be obtained while applying conventional antisymmetrization methods of wave functions, dependent on single particle spatial variables.
Generalizing twisted gauge invariance
Duenas-Vidal, Alvaro; Vazquez-Mozo, Miguel A.
2009-05-01
We discuss the twisting of gauge symmetry in noncommutative gauge theories and show how this can be generalized to a whole continuous family of twisted gauge invariances. The physical relevance of these twisted invariances is discussed.
An improved tropospheric ozone database retrieved from SCIAMACHY Limb-Nadir-Matching method
NASA Astrophysics Data System (ADS)
Jia, Jia; Rozanov, Alexei; Ladstätter-Weißenmayer, Annette; Ebojie, Felix; Rahpoe, Nabiz; Bötel, Stefan; Burrows, John
2015-04-01
Tropospheric ozone is one of the most important green-house gases and the main component of photochemical smog. It is either transported from the stratosphere or photochemically produced during pollution events in the troposphere that threaten the respiratory system. To investigate sources, transport mechanisms of tropospheric ozone in a global view, limb nadir matching (LNM) technique applied with SCIAMACHY instrument is used to retrieve tropospheric ozone. With the fact that 90% ozone is located in the stratosphere and only about 10% can be observed in the troposphere, the usage of satellite data requires highly qualified nadir and limb data. In this study we show an improvement of SCIAMACHY limb data as well as its influence on tropospheric ozone results. The limb nadir matching technique is also refined to increase the quality of the tropospheric ozone. The results are validated with ozone sonde measurements.
Marin, Diego; Aquino, Arturo; Gegundez-Arias, Manuel Emilio; Bravo, José Manuel
2011-01-01
This paper presents a new supervised method for blood vessel detection in digital retinal images. This method uses a neural network (NN) scheme for pixel classification and computes a 7-D vector composed of gray-level and moment invariants-based features for pixel representation. The method was evaluated on the publicly available DRIVE and STARE databases, widely used for this purpose, since they contain retinal images where the vascular structure has been precisely marked by experts. Method performance on both sets of test images is better than other existing solutions in literature. The method proves especially accurate for vessel detection in STARE images. Its application to this database (even when the NN was trained on the DRIVE database) outperforms all analyzed segmentation approaches. Its effectiveness and robustness with different image conditions, together with its simplicity and fast implementation, make this blood vessel segmentation proposal suitable for retinal image computer analyses such as automated screening for early diabetic retinopathy detection.
ERIC Educational Resources Information Center
Moses, Tim
2006-01-01
Population invariance is an important requirement of test equating. An equating function is said to be population invariant when the choice of (sub)population used to compute the equating function does not matter. In recent studies, the extent to which equating functions are population invariant is typically addressed in terms of practical…
Line segment matching and reconstruction via exploiting coplanar cues
NASA Astrophysics Data System (ADS)
Li, Kai; Yao, Jian
2017-03-01
This paper introduces a new system for reconstructing 3D scenes from Line Segments (LS) on images. A new LS matching algorithm and a novel 3D LS reconstruction algorithm are incorporated into the system. Two coplanar cues that indicates image LSs are coplanar in physical (3D) space are extensively exploited in both algorithms: (1) adjacent image LSs are coplanar in space in a high possibility; (2) the projections of coplanar 3D LSs in two images are related by the same planar homography. Based on these two cues, we efficiently match LSs from two images firstly in pairs through matching the V-junctions formed by adjacent LSs, and secondly in individuals by exploiting local homographies. We extract for each V-junction a scale and affine invariant local region to match V-junctions from two images. The local homographies estimated from V-junction matches are used to match LSs in individuals. To get 3D LSs from the obtained LS matches, we propose to first estimate space planes from clustered LS matches and then back-project image LSs onto the space planes. Markov Random Field (MRF) is introduced to help more reliable LS match clustering. Experiments shows our LS matching algorithm significantly improves the efficiency of state-of-the-art methods while achieves comparable matching performance, and our 3D LS reconstruction algorithm generates more complete and detailed 3D scene models using much fewer images.
Robertson, Sam; Gupta, Ritu; McIntosh, Sam
2016-10-01
This study developed a method to determine whether the distribution of individual player performances can be modelled to explain match outcome in team sports, using Australian Rules football as an example. Player-recorded values (converted to a percentage of team total) in 11 commonly reported performance indicators were obtained for all regular season matches played during the 2014 Australian Football League season, with team totals also recorded. Multiple features relating to heuristically determined percentiles for each performance indicator were then extracted for each team and match, along with the outcome (win/loss). A generalised estimating equation model comprising eight key features was developed, explaining match outcome at a median accuracy of 63.9% under 10-fold cross-validation. Lower 75th, 90th and 95th percentile values for team goals and higher 25th and 50th percentile values for disposals were linked with winning. Lower 95th and higher 25th percentile values for Inside 50s and Marks, respectively, were also important contributors. These results provide evidence supporting team strategies which aim to obtain an even spread of goal scorers in Australian Rules football. The method developed in this investigation could be used to quantify the importance of individual contributions to overall team performance in team sports.
NASA Astrophysics Data System (ADS)
Apaya, Robert P.; Lucchese, Baldo; Price, Sarah L.; Vinter, J. G.
1995-02-01
Ligands which bind to a specific protein binding site are often expected to have a similar electrostatic environment which complements that of the binding site. One method of assessing molecular electrostatic similarity is to examine the possible overlay of the maxima and minima in the electrostatic potential outside the molecules and thereby match the regions where strong electrostatic interactions, including hydrogen bonds, with the residues of the binding site may be possible. This approach is validated with accurate calculations of the electrostatic potential, derived from a distributed multipole analysis of an ab initio charge density of the molecule, so that the effects of lone pair and π-electron density are correctly included. We have applied this method to the phosphodiesterase (PDE) III substrate adenosine-3',5'-cyclic monophosphate (cAMP) and a range of nonspecific and specific PDE III inhibitors. Despite the structural variation between cAMP and the inhibitors, it is possible to match three or four extrema to produce relative orientations in which the inhibitors are sufficiently sterically and electrostatically similar to the natural substrate to account for their affinity for PDE III. This matching of extrema is more apparent using the accurate electrostatic models than it was when this approach was first applied, using semiempirical point charge models. These results reinforce the hypothesis of electrostatic similarity and give weight to the technique of extrema matching as a useful tool in drug design.
NASA Technical Reports Server (NTRS)
Scott, Robert C.; Pototzky, Anthony S.; Perry, Boyd, III
1994-01-01
NASA Langley Research Center has, for several years, conducted research in the area of time-correlated gust loads for linear and nonlinear aircraft. The results of this work led NASA to recommend that the Matched-Filter-Based One-Dimensional Search Method be used for gust load analyses of nonlinear aircraft. This manual describes this method, describes a FORTRAN code which performs this method, and presents example calculations for a sample nonlinear aircraft model. The name of the code is MFD1DS (Matched-Filter-Based One-Dimensional Search). The program source code, the example aircraft equations of motion, a sample input file, and a sample program output are all listed in the appendices.
NASA Astrophysics Data System (ADS)
Huebner, Claudia S.
2016-10-01
As a consequence of fluctuations in the index of refraction of the air, atmospheric turbulence causes scintillation, spatial and temporal blurring as well as global and local image motion creating geometric distortions. To mitigate these effects many different methods have been proposed. Global as well as local motion compensation in some form or other constitutes an integral part of many software-based approaches. For the estimation of motion vectors between consecutive frames simple methods like block matching are preferable to more complex algorithms like optical flow, at least when challenged with near real-time requirements. However, the processing power of commercially available computers continues to increase rapidly and the more powerful optical flow methods have the potential to outperform standard block matching methods. Therefore, in this paper three standard optical flow algorithms, namely Horn-Schunck (HS), Lucas-Kanade (LK) and Farnebäck (FB), are tested for their suitability to be employed for local motion compensation as part of a turbulence mitigation system. Their qualitative performance is evaluated and compared with that of three standard block matching methods, namely Exhaustive Search (ES), Adaptive Rood Pattern Search (ARPS) and Correlation based Search (CS).
NASA Astrophysics Data System (ADS)
Bueeler, M.; Donitzky, Ch.; Mrochen, M.
2006-02-01
The effectiveness of the corneal ablation process in refractive surgery is mostly evaluated by indirect measures of vision or optical quality such as post-operative refraction or wavefront aberrometry. Yet, the effective amount of corneal tissue removed in the treatment can only be determined by correctly overlapping a pre- and a post-operative topography measurement. However such an overlap is not trivial due to the discrepancy in the centration axes used in the measurement and the treatment, as well as due to the shift of ocular axes through the treatment or tilt between the two surfaces. We therefore present two methods for overlapping pre- and post-operative topographies for the purpose of extracting an effective corneal ablation profile. Method one uses a 3-dimensional profile matching algorithm and cross-correlation analysis on surface rings outside the optical zone of the topographies. Method two employs a surface normal matching routine to align the two surfaces along their common ablation axis. The profile matching method implies the problem that it requires measurement data outside of the optical zone which was found to be uncertain with placido-disk-based topographers. Method number two is more simple and implies the advantage of using measurement data within the optical zone. For regular profiles the extracted ablation profiles showed a very good match with the planned ones. Surprisingly, even for highly irregular profiles of topography-guided laser treatments the method delivered reasonable overlaps when being compared to the planned profiles. Analysis of the effective tissue removal yields valuable information on the quality of the ablation process.
NASA Technical Reports Server (NTRS)
Garai, Anirban; Murman, Scott M.; Madavan, Nateri K.
2016-01-01
used involves modeling the pressure fluctuations as acoustic waves propagating in the far-field relative to a single noise-source inside the buffer region. This approach treats vorticity-induced pressure fluctuations the same as acoustic waves. Another popular approach, often referred to as the "sponge layer," attempts to dampen the flow perturbations by introducing artificial dissipation in the buffer region. Although the artificial dissipation removes all perturbations inside the sponge layer, incoming waves are still reflected from the interface boundary between the computational domain and the sponge layer. The effect of these refkections can be somewhat mitigated by appropriately selecting the artificial dissipation strength and the extent of the sponge layer. One of the most promising variants on the buffer region approach is the Perfectly Matched Layer (PML) technique. The PML technique mitigates spurious reflections from boundaries and interfaces by dampening the perturbation modes inside the buffer region such that their eigenfunctions remain unchanged. The technique was first developed by Berenger for application to problems involving electromagnetic wave propagation. It was later extended to the linearized Euler, Euler and Navier-Stokes equations by Hu and his coauthors. The PML technique ensures the no-reflection property for all waves, irrespective of incidence angle, wavelength, and propagation direction. Although the technique requires the solution of a set of auxiliary equations, the computational overhead is easily justified since it allows smaller domain sizes and can provide better accuracy, stability, and convergence of the numerical solution. In this paper, the PML technique is developed in the context of a high-order spectral-element Discontinuous Galerkin (DG) method. The technique is compared to other approaches to treating the in flow and out flow boundary, such as those based on using characteristic boundary conditions and sponge layers. The
Guse, Jennifer; Schweigert, Eva; Kulms, Gerhild; Heinen, Ines; Martens, Claudia; Guse, Andreas H.
2016-01-01
Objectives Choosing the right mentor is crucial for effective mentorship. Yet, many medical students have difficulties finding a suitable mentor. Thus we developed mentoring speed dating (MSD) as a promising matching tool to connect students and faculty mentors successfully. The purpose of this study was to explore mentees’ and mentors’ experience with MSD and investigate the impact of MSD on the perceived mentorship quality and continuance of the mentoring relationship. Methods The authors completed a mixed methods study at the University Medical Center Hamburg-Eppendorf, Germany, between June 2011 and March 2014. They conducted four focus groups with mentees and mentors who participated in a mentoring speed dating event and analyzed transcripts using conventional content analysis with inductive categorizing. In addition, three mentoring cohorts (two matched via MSD, one matched via conventional online profiles) were surveyed on mentorship satisfaction and the 1-year continuance of their mentorship was monitored. Fifteen mentees and fifteen mentors participated in the focus groups. The authors identified several themes such as short and long term benefits of MSD and fulfillment of expectations. Benefits included finding out about the personal connection, matching expectations, providing an efficient overview of candidates. The survey was completed by 93 students (n = 29 without MSD; n = 64 with MSD). Independent t-tests and multivariate analysis of variance were used to analyze the impact of MSD on student’s mentorship satisfaction. Results There were significant differences in responses to the items “Commitment of mentor” (p = .019) and “Constructive feedback” (p = .038) among the students who attended MSD and the students without MSD. After one year far more mentoring relationships existed among those mentees who participated in MSD in comparison to the “no MSD group”. Conclusion MSD is a valuable matching tool with beneficial effects on the
A New Impedance Matching Method for an Ultra-Wide Band and Dual Circularly Polarised Feed
NASA Astrophysics Data System (ADS)
Li, Sha; Yan, Yi Hua; Wang, Wei; Chen, Zhi Jun; Liu, Dong Hao; Zhang, Fu Shun; Jeffrey, Natasha
2016-12-01
In traditional antenna design, metal components are not placed in the central part of the antenna as they change the characteristics of near field radiation. However, we show that placing a metal ring in the centre of the strip lines, which connect the ends of folded high-frequency dipoles, does not damage the performance of the feed. Instead it significantly improves the voltage standing wave ratio of the feed whilst other performance indicators are not compromised. Thus, our findings show an excellent way of improving the wide band feed. Based on this foundation, a new circularly polarised feed for operation between 0.4 to 2 GHz is introduced for the Chinese Spectral Radioheliograph in this paper. The issue of a feed impedance matching network is investigated. By optimising the impedance matching, the performance of the feed is enhanced with respect to the previous realisations of the Eleven feed. The simulation and experimental results show that the gain of the feed is about 10 dBi, and the VSWR is less than 2:1. In addition, the feed has a low axial ratio, fixed phase centre location, and constant beam width in the range of 0.4 to 2 GHz.
Matches, Mismatches, and Methods: Multiple-View Workflows for Energy Portfolio Analysis.
Brehmer, Matthew; Ng, Jocelyn; Tate, Kevin; Munzner, Tamara
2016-01-01
The energy performance of large building portfolios is challenging to analyze and monitor, as current analysis tools are not scalable or they present derived and aggregated data at too coarse of a level. We conducted a visualization design study, beginning with a thorough work domain analysis and a characterization of data and task abstractions. We describe generalizable visual encoding design choices for time-oriented data framed in terms of matches and mismatches, as well as considerations for workflow design. Our designs address several research questions pertaining to scalability, view coordination, and the inappropriateness of line charts for derived and aggregated data due to a combination of data semantics and domain convention. We also present guidelines relating to familiarity and trust, as well as methodological considerations for visualization design studies. Our designs were adopted by our collaborators and incorporated into the design of an energy analysis software application that will be deployed to tens of thousands of energy workers in their client base.
Two dimensional template matching method for buried object discrimination in GPR data
NASA Astrophysics Data System (ADS)
Sezgin, Mehmet
2009-05-01
In this study discrimination of two different metallic object classes were studied, utilizing Ground Penetrating Radar (GPR). Feature sets of both classes have almost the same information for both Metal Detector (MD) and GPR data. There were no evident features those are easily discriminate classes. Background removal has been applied to original B-Scan data and then a normalization process was performed. Image thresholding was applied to segment B-Scan GPR images. So, main hyperbolic shape of buried object reflection was extracted and then a morphological process was performed optionally. Templates of each class representatives have been obtained and they were searched whether they match with true class or not. Two data sets were examined experimentally. Actually they were obtained in different time and burial for the same objects. Considerably high discrimination performance was obtained which was not possible by using individual Metal Detector data.
Entanglement, Invariants, and Phylogenetics
NASA Astrophysics Data System (ADS)
Sumner, J. G.
2007-10-01
This thesis develops and expands upon known techniques of mathematical physics relevant to the analysis of the popular Markov model of phylogenetic trees required in biology to reconstruct the evolutionary relationships of taxonomic units from biomolecular sequence data. The techniques of mathematical physics are plethora and have been developed for some time. The Markov model of phylogenetics and its analysis is a relatively new technique where most progress to date has been achieved by using discrete mathematics. This thesis takes a group theoretical approach to the problem by beginning with a remarkable mathematical parallel to the process of scattering in particle physics. This is shown to equate to branching events in the evolutionary history of molecular units. The major technical result of this thesis is the derivation of existence proofs and computational techniques for calculating polynomial group invariant functions on a multi-linear space where the group action is that relevant to a Markovian time evolution. The practical results of this thesis are an extended analysis of the use of invariant functions in distance based methods and the presentation of a new reconstruction technique for quartet trees which is consistent with the most general Markov model of sequence evolution.
New point matching algorithm for panoramic reflectance images
NASA Astrophysics Data System (ADS)
Kang, Zhizhong; Zlatanova, Sisi
2007-11-01
Much attention is paid to registration of terrestrial point clouds nowadays. Research is carried out towards improved efficiency and automation of the registration process. The most important part of registration is finding correspondence. The panoramic reflectance images are generated according to the angular coordinates and reflectance value of each 3D point of 360° full scans. Since it is similar to a black and white photo, it is possible to implement image matching on this kind of images. Therefore, this paper reports a new corresponding point matching algorithm for panoramic reflectance images. Firstly SIFT (Scale Invariant Feature Transform) method is employed for extracting distinctive invariant features from panoramic images that can be used to perform reliable matching between different views of an object or scene. The correspondences are identified by finding the nearest neighbors of each keypoint form the first image among those in the second image afterwards. The rigid geometric invariance derived from point cloud is used to prune false correspondences. Finally, an iterative process is employed to include more new matches for transformation parameters computation until the computation accuracy reaches predefined accuracy threshold. The approach is tested with panoramic reflectance images (indoor and outdoor scenes) acquired by the laser scanner FARO LS 880. 1
Bender, Jason D.; Doraiswamy, Sriram; Candler, Graham V. E-mail: candler@aem.umn.edu; Truhlar, Donald G. E-mail: candler@aem.umn.edu
2014-02-07
Fitting potential energy surfaces to analytic forms is an important first step for efficient molecular dynamics simulations. Here, we present an improved version of the local interpolating moving least squares method (L-IMLS) for such fitting. Our method has three key improvements. First, pairwise interactions are modeled separately from many-body interactions. Second, permutational invariance is incorporated in the basis functions, using permutationally invariant polynomials in Morse variables, and in the weight functions. Third, computational cost is reduced by statistical localization, in which we statistically correlate the cutoff radius with data point density. We motivate our discussion in this paper with a review of global and local least-squares-based fitting methods in one dimension. Then, we develop our method in six dimensions, and we note that it allows the analytic evaluation of gradients, a feature that is important for molecular dynamics. The approach, which we call statistically localized, permutationally invariant, local interpolating moving least squares fitting of the many-body potential (SL-PI-L-IMLS-MP, or, more simply, L-IMLS-G2), is used to fit a potential energy surface to an electronic structure dataset for N{sub 4}. We discuss its performance on the dataset and give directions for further research, including applications to trajectory calculations.
NASA Astrophysics Data System (ADS)
Lei, Yaguo; Qiao, Zijian; Xu, Xuefang; Lin, Jing; Niu, Shantao
2017-09-01
Most traditional overdamped monostable, bistable and even tristable stochastic resonance (SR) methods have three shortcomings in weak characteristic extraction: (1) their potential structures characterized by single stable-state type are insufficient to match with the complicated and diverse mechanical vibration signals; (2) they vulnerably suffer the interference from multiscale noise and largely depend on the help of highpass filters whose parameters are selected subjectively, probably resulting in false detection; and (3) their rescaling factors are fixed as constants generally, thereby ignoring the synergistic effect among vibration signals, potential structures and rescaling factors. These three shortcomings have limited the enhancement ability of SR. To explore the SR potential, this paper initially investigates the SR in a multistable system by calculating its output spectral amplification, further analyzes its output frequency response numerically, then examines the effect of both damping and rescaling factors on output responses and finally presents a promising underdamped SR method with stable-state matching for incipient bearing fault diagnosis. This method has three advantages: (1) the diversity of stable-state types in a multistable potential makes it easy to match with various vibration signals; (2) the underdamped multistable SR, equivalent to a moving nonlinear bandpass filter that is dependent on the rescaling factors, is able to suppress the multiscale noise; and (3) the synergistic effect among vibration signals, potential structures and rescaling and damping factors is achieved using quantum genetic algorithms whose fitness functions are new weighted signal-to-noise ratio (WSNR) instead of SNR. Therefore, the proposed method is expected to possess good enhancement ability. Simulated and experimental data of rolling element bearings demonstrate its effectiveness. The comparison results show that the proposed method is able to obtain higher
D'Ambra, P.; Vassilevski, P. S.
2014-05-30
Adaptive Algebraic Multigrid (or Multilevel) Methods (αAMG) are introduced to improve robustness and efficiency of classical algebraic multigrid methods in dealing with problems where no a-priori knowledge or assumptions on the near-null kernel of the underlined matrix are available. Recently we proposed an adaptive (bootstrap) AMG method, αAMG, aimed to obtain a composite solver with a desired convergence rate. Each new multigrid component relies on a current (general) smooth vector and exploits pairwise aggregation based on weighted matching in a matrix graph to define a new automatic, general-purpose coarsening process, which we refer to as “the compatible weighted matching”. In this work, we present results that broaden the applicability of our method to different finite element discretizations of elliptic PDEs. In particular, we consider systems arising from displacement methods in linear elasticity problems and saddle-point systems that appear in the application of the mixed method to Darcy problems.
Robust spatiotemporal matching of electronic slides to presentation videos.
Fan, Quanfu; Barnard, Kobus; Amir, Arnon; Efrat, Alon
2011-08-01
We describe a robust and efficient method for automatically matching and time-aligning electronic slides to videos of corresponding presentations. Matching electronic slides to videos provides new methods for indexing, searching, and browsing videos in distance-learning applications. However, robust automatic matching is challenging due to varied frame composition, slide distortion, camera movement, low-quality video capture, and arbitrary slides sequence. Our fully automatic approach combines image-based matching of slide to video frames with a temporal model for slide changes and camera events. To address these challenges, we begin by extracting scale-invariant feature-transformation (SIFT) keypoints from both slides and video frames, and matching them subject to a consistent projective transformation (homography) by using random sample consensus (RANSAC). We use the initial set of matches to construct a background model and a binary classifier for separating video frames showing slides from those without. We then introduce a new matching scheme for exploiting less distinctive SIFT keypoints that enables us to tackle more difficult images. Finally, we improve upon the matching based on visual information by using estimated matching probabilities as part of a hidden Markov model (HMM) that integrates temporal information and detected camera operations. Detailed quantitative experiments characterize each part of our approach and demonstrate an average accuracy of over 95% in 13 presentation videos.
Determination of impurities in uranium matrices by time-of-flight ICP-MS using matrix-matched method
Buerger, Stefan; Riciputi, Lee R; Bostick, Debra A
2007-01-01
The analysis of impurities in uranium matrices is performed in a variety of fields, e.g. for quality control in the production stream converting uranium ores to fuels, as element signatures in nuclear forensics and safeguards, and for non-proliferation control. We have investigated the capabilities of time-of-flight ICP-MS for the analysis of impurities in uranium matrices using a matrix-matched method. The method was applied to the New Brunswick Laboratory CRM 124(1-7) series. For the seven certified reference materials, an overall precision and accuracy of approximately 5% and 14%, respectively, were obtained for 18 analyzed elements.
Jang, Jae-Wook; Yun, Jaesung; Mohaisen, Aziz; Woo, Jiyoung; Kim, Huy Kang
2016-01-01
Mass-market mobile security threats have increased recently due to the growth of mobile technologies and the popularity of mobile devices. Accordingly, techniques have been introduced for identifying, classifying, and defending against mobile threats utilizing static, dynamic, on-device, and off-device techniques. Static techniques are easy to evade, while dynamic techniques are expensive. On-device techniques are evasion, while off-device techniques need being always online. To address some of those shortcomings, we introduce Andro-profiler, a hybrid behavior based analysis and classification system for mobile malware. Andro-profiler main goals are efficiency, scalability, and accuracy. For that, Andro-profiler classifies malware by exploiting the behavior profiling extracted from the integrated system logs including system calls. Andro-profiler executes a malicious application on an emulator in order to generate the integrated system logs, and creates human-readable behavior profiles by analyzing the integrated system logs. By comparing the behavior profile of malicious application with representative behavior profile for each malware family using a weighted similarity matching technique, Andro-profiler detects and classifies it into malware families. The experiment results demonstrate that Andro-profiler is scalable, performs well in detecting and classifying malware with accuracy greater than 98 %, outperforms the existing state-of-the-art work, and is capable of identifying 0-day mobile malware samples.
NASA Astrophysics Data System (ADS)
Lowry, Thomas; Li, Shu-Guang
2005-02-01
Difficulty in solving the transient advection-diffusion equation (ADE) stems from the relationship between the advection derivatives and the time derivative. For a solution method to be viable, it must account for this relationship by being accurate in both space and time. This research presents a unique method for solving the time-dependent ADE that does not discretize the derivative terms but rather solves the equation analytically in the space-time domain. The method is computationally efficient and numerically accurate and addresses the common limitations of numerical dispersion and spurious oscillations that can be prevalent in other solution methods. The method is based on the improved finite analytic (IFA) solution method [Lowry TS, Li S-G. A characteristic based finite analytic method for solving the two-dimensional steady-state advection-diffusion equation. Water Resour Res 38 (7), 10.1029/2001WR000518] in space coupled with a Laplace transformation in time. In this way, the method has no Courant condition and maintains accuracy in space and time, performing well even at high Peclet numbers. The method is compared to a hybrid method of characteristics, a random walk particle tracking method, and an Eulerian-Lagrangian Localized Adjoint Method using various degrees of flow-field heterogeneity across multiple Peclet numbers. Results show the IFALT method to be computationally more efficient while producing similar or better accuracy than the other methods.
Zhou, Y.; Ojeda-May, P.; Nagaraju, M.; Pu, J.
2016-01-01
Adenosine triphosphate (ATP)-binding cassette (ABC) transporters are ubiquitous ATP-dependent membrane proteins involved in translocations of a wide variety of substrates across cellular membranes. To understand the chemomechanical coupling mechanism as well as functional asymmetry in these systems, a quantitative description of how ABC transporters hydrolyze ATP is needed. Complementary to experimental approaches, computer simulations based on combined quantum mechanical and molecular mechanical (QM/MM) potentials have provided new insights into the catalytic mechanism in ABC transporters. Quantitatively reliable determination of the free energy requirement for enzymatic ATP hydrolysis, however, requires substantial statistical sampling on QM/MM potential. A case study shows that brute force sampling of ab initio QM/MM (AI/MM) potential energy surfaces is computationally impractical for enzyme simulations of ABC transporters. On the other hand, existing semiempirical QM/MM (SE/MM) methods, although affordable for free energy sampling, are unreliable for studying ATP hydrolysis. To close this gap, a multiscale QM/MM approach named reaction path–force matching (RP–FM) has been developed. In RP–FM, specific reaction parameters for a selected SE method are optimized against AI reference data along reaction paths by employing the force matching technique. The feasibility of the method is demonstrated for a proton transfer reaction in the gas phase and in solution. The RP–FM method may offer a general tool for simulating complex enzyme systems such as ABC transporters. PMID:27498639
ERIC Educational Resources Information Center
Weil, Joyce
2015-01-01
As Baby Boomers reach 65 years of age and methods of studying older populations are becoming increasingly varied (e.g., including mixed methods designs, on-line surveys, and video-based environments), there is renewed interest in evaluating methodologies used to collect data with older persons. The goal of this article is to examine…
NASA Astrophysics Data System (ADS)
Herwig, H.
Theoretical investigations of stationary incompressible two-dimensional laminar flows with finite regions of catastrophic separation, applying the method of matched asymptotic expansions, are presented. The difficulties associated with the Goldstein singularity are attacked in two ways, corresponding to the limiting values of a complex parameter kappa. Each case is applied to a unified model geometry using triple-deck equations. The flow model of Batchelor (1955) is shown not to fulfill the asymptotic-expansion assumptions; the model of Kirchhoff (1869), actually a degenerate version of the Batchelor model for the case omega-0 = 0, is found to be the uniquely valid one under these conditions.
Conformal differential invariants
NASA Astrophysics Data System (ADS)
Kruglikov, Boris
2017-03-01
We compute the Hilbert polynomial and the Poincaré function counting the number of fixed jet-order differential invariants of conformal metric structures modulo local diffeomorphisms, and we describe the field of rational differential invariants separating generic orbits of the diffeomorphism pseudogroup action. This resolves the local recognition problem for conformal structures.
Silva, E. Costa Gusmão, L. A. P.; Barbosa, C. R. Hall; Leipner, Y.; Fortaleza, L. G. S.; Monteiro, E. Costa
2014-08-15
Recently, our research group at PUC-Rio discovered that magnetic transducers based on the impedance phase characteristics of GMI sensors have the potential to multiply by one hundred the sensitivity values when compared to magnitude-based GMI transducers. Those GMI sensors can be employed in the measurement of ultra-weak magnetic fields, which intensities are even lower than the environmental magnetic noise. A traditional solution for cancelling the electromagnetic noise and interference makes use of gradiometric configurations, but the performance is strongly tied to the homogeneity of the sensing elements. This paper presents a new method that uses electronic circuits to modify the equivalent impedance of the GMI samples, aiming at homogenizing their phase characteristics and, consequently, improving the performance of gradiometric configurations based on GMI samples. It is also shown a performance comparison between this new method and another homogenization method previously developed.
DNA barcoding of recently diverged species: relative performance of matching methods.
van Velzen, Robin; Weitschek, Emanuel; Felici, Giovanni; Bakker, Freek T
2012-01-01
Recently diverged species are challenging for identification, yet they are frequently of special interest scientifically as well as from a regulatory perspective. DNA barcoding has proven instrumental in species identification, especially in insects and vertebrates, but for the identification of recently diverged species it has been reported to be problematic in some cases. Problems are mostly due to incomplete lineage sorting or simply lack of a 'barcode gap' and probably related to large effective population size and/or low mutation rate. Our objective was to compare six methods in their ability to correctly identify recently diverged species with DNA barcodes: neighbor joining and parsimony (both tree-based), nearest neighbor and BLAST (similarity-based), and the diagnostic methods DNA-BAR, and BLOG. We analyzed simulated data assuming three different effective population sizes as well as three selected empirical data sets from published studies. Results show, as expected, that success rates are significantly lower for recently diverged species (∼75%) than for older species (∼97%) (P<0.00001). Similarity-based and diagnostic methods significantly outperform tree-based methods, when applied to simulated DNA barcode data (P<0.00001). The diagnostic method BLOG had highest correct query identification rate based on simulated (86.2%) as well as empirical data (93.1%), indicating that it is a consistently better method overall. Another advantage of BLOG is that it offers species-level information that can be used outside the realm of DNA barcoding, for instance in species description or molecular detection assays. Even though we can confirm that identification success based on DNA barcoding is generally high in our data, recently diverged species remain difficult to identify. Nevertheless, our results contribute to improved solutions for their accurate identification.
NASA Astrophysics Data System (ADS)
Kerzhakov, B. V.; Kulinich, V. V.
2016-08-01
We use the field matching method to solve the inverse problem of estimating the geoacoustic parameters of a stratified sea bed using the objective function based on the norm of difference between the experimental and simulated vertical angular spectra of the acoustic field and combination of the rapid-annealing method with direct search methods for localization of the global minimum of the objective function. To reduce the influence of the ravine effects of the objective function, we use regularization on the basis of mutual correlations of the experimental and simulated vertical angular spectra of the acoustic field. The numerical experiment has been performed to retrieve the parameters of the model waveguide, e.g., the thickness of the water layer and the layer of sediments, the velocity and attenuation coefficients of longitudinal waves, and the density of the sediment layer and the subjacent half-space in the presence of noise interference of different intensity levels.
Matching Learning Style Preferences with Suitable Delivery Methods on Textile Design Programmes
ERIC Educational Resources Information Center
Sayer, Kate; Studd, Rachel
2006-01-01
Textile design is a subject that encompasses both design and technology; aesthetically pleasing patterns and forms must be set within technical parameters to create successful fabrics. When considering education methods in design programmes, identifying the most relevant learning approach is key to creating future successes. Yet are the most…
A Method of Designing Practical Examinations to Match What Is Taught in Laboratory Activities.
ERIC Educational Resources Information Center
Stensvold, Mark S.; Wilson, John T.
1993-01-01
Proposes methods by which laboratory practical exams may be structured to assess outcomes from laboratory instruction. Presents eight general considerations for writing and using practical exams. Describes four example laboratory exams involving a box camera, circuit boxes, floating objects, and light. (MDH)
Burden, Anne; Roche, Nicolas; Miglio, Cristiana; Hillyer, Elizabeth V; Postma, Dirkje S; Herings, Ron MC; Overbeek, Jetty A; Khalid, Javaria Mona; van Eickels, Daniela; Price, David B
2017-01-01
Background Cohort matching and regression modeling are used in observational studies to control for confounding factors when estimating treatment effects. Our objective was to evaluate exact matching and propensity score methods by applying them in a 1-year pre–post historical database study to investigate asthma-related outcomes by treatment. Methods We drew on longitudinal medical record data in the PHARMO database for asthma patients prescribed the treatments to be compared (ciclesonide and fine-particle inhaled corticosteroid [ICS]). Propensity score methods that we evaluated were propensity score matching (PSM) using two different algorithms, the inverse probability of treatment weighting (IPTW), covariate adjustment using the propensity score, and propensity score stratification. We defined balance, using standardized differences, as differences of <10% between cohorts. Results Of 4064 eligible patients, 1382 (34%) were prescribed ciclesonide and 2682 (66%) fine-particle ICS. The IPTW and propensity score-based methods retained more patients (96%–100%) than exact matching (90%); exact matching selected less severe patients. Standardized differences were >10% for four variables in the exact-matched dataset and <10% for both PSM algorithms and the weighted pseudo-dataset used in the IPTW method. With all methods, ciclesonide was associated with better 1-year asthma-related outcomes, at one-third the prescribed dose, than fine-particle ICS; results varied slightly by method, but direction and statistical significance remained the same. Conclusion We found that each method has its particular strengths, and we recommend at least two methods be applied for each matched cohort study to evaluate the robustness of the findings. Balance diagnostics should be applied with all methods to check the balance of confounders between treatment cohorts. If exact matching is used, the calculation of a propensity score could be useful to identify variables that require
Urbán, Róbert; Szigeti, Réka; Kökönyei, Gyöngyi; Demetrovics, Zsolt
2014-06-01
The Rosenberg Self-Esteem Scale (RSES) is a widely used measure for assessing self-esteem, but its factor structure is debated. Our goals were to compare 10 alternative models for the RSES and to quantify and predict the method effects. This sample involves two waves (N =2,513 9th-grade and 2,370 10th-grade students) from five waves of a school-based longitudinal study. The RSES was administered in each wave. The global self-esteem factor with two latent method factors yielded the best fit to the data. The global factor explained a large amount of the common variance (61% and 46%); however, a relatively large proportion of the common variance was attributed to the negative method factor (34 % and 41%), and a small proportion of the common variance was explained by the positive method factor (5% and 13%). We conceptualized the method effect as a response style and found that being a girl and having a higher number of depressive symptoms were associated with both low self-esteem and negative response style, as measured by the negative method factor. Our study supported the one global self-esteem construct and quantified the method effects in adolescents.
Macdonald, Benn; Husmeier, Dirk
2015-01-01
Parameter inference in mathematical models of biological pathways, expressed as coupled ordinary differential equations (ODEs), is a challenging problem in contemporary systems biology. Conventional methods involve repeatedly solving the ODEs by numerical integration, which is computationally onerous and does not scale up to complex systems. Aimed at reducing the computational costs, new concepts based on gradient matching have recently been proposed in the computational statistics and machine learning literature. In a preliminary smoothing step, the time series data are interpolated; then, in a second step, the parameters of the ODEs are optimized, so as to minimize some metric measuring the difference between the slopes of the tangents to the interpolants, and the time derivatives from the ODEs. In this way, the ODEs never have to be solved explicitly. This review provides a concise methodological overview of the current state-of-the-art methods for gradient matching in ODEs, followed by an empirical comparative evaluation based on a set of widely used and representative benchmark data.
Method of Matching Performance of Compressor Systems with that of Aircraft Power Sections
NASA Technical Reports Server (NTRS)
Bullock, Robert O.; Keetch, Robert C.; Moses, Jason J.
1945-01-01
A method is developed of easily determining the performance of a compressor system relative to that of the power section for a given altitude. Because compressors, reciprocating engines, and turbines are essentially flow devices, the performance of each of these power-plant components is presented in terms of similar dimensionless ratios. The pressure and temperature changes resulting from restrictions of the charge-air flow and from heat transfer in the ducts connecting the components of the power plant are also expressed by the same dimensionless ratios and the losses are included in the performance of the compressor. The performance of a mechanically driven, single-stage compressor in relation to the performance of a conventional air-cooled engine operating at sea-level conditions is presented as an example of the application of the method.
A Template-Matching Method For Measuring Energy Depositions In TES Films
NASA Astrophysics Data System (ADS)
Shank, Benjamin; Yen, Jeffrey; Cabrera, Blas; Kreikebaum, John Mark; Moffatt, Robert; Redl, Peter; Young, Betty; Brink, Paul; Cherry, Matthew; Tomada, Astrid
2014-03-01
Transition edge sensors (TES) have a wide variety of applications in particle ∖astrophysics for detecting incoming particles with high energy resolution. In TES design, the need for sufficient heat capacity to avoid saturation limits the ultimate energy resolution. Building on the TES model developed for SuperCDMS by Yen et al. for tungsten TESs deposited next to aluminum collection fins, we outline a time-domain non-linear optimal filter method for reconstructing energy depositions in TES films. This allows us to operate devices into their saturation region while taking into account changing noise performance and loss of energy collection. We show how this method has improved our understanding of quasiparticle diffusion and energy collection in our superconducting sensors.
Davtyan, Aram; Dama, James F.; Voth, Gregory A.; Andersen, Hans C.
2015-04-21
Coarse-grained (CG) models of molecular systems, with fewer mechanical degrees of freedom than an all-atom model, are used extensively in chemical physics. It is generally accepted that a coarse-grained model that accurately describes equilibrium structural properties (as a result of having a well constructed CG potential energy function) does not necessarily exhibit appropriate dynamical behavior when simulated using conservative Hamiltonian dynamics for the CG degrees of freedom on the CG potential energy surface. Attempts to develop accurate CG dynamic models usually focus on replacing Hamiltonian motion by stochastic but Markovian dynamics on that surface, such as Langevin or Brownian dynamics. However, depending on the nature of the system and the extent of the coarse-graining, a Markovian dynamics for the CG degrees of freedom may not be appropriate. In this paper, we consider the problem of constructing dynamic CG models within the context of the Multi-Scale Coarse-graining (MS-CG) method of Voth and coworkers. We propose a method of converting a MS-CG model into a dynamic CG model by adding degrees of freedom to it in the form of a small number of fictitious particles that interact with the CG degrees of freedom in simple ways and that are subject to Langevin forces. The dynamic models are members of a class of nonlinear systems interacting with special heat baths that were studied by Zwanzig [J. Stat. Phys. 9, 215 (1973)]. The properties of the fictitious particles can be inferred from analysis of the dynamics of all-atom simulations of the system of interest. This is analogous to the fact that the MS-CG method generates the CG potential from analysis of equilibrium structures observed in all-atom simulation data. The dynamic models generate a non-Markovian dynamics for the CG degrees of freedom, but they can be easily simulated using standard molecular dynamics programs. We present tests of this method on a series of simple examples that demonstrate that
NASA Astrophysics Data System (ADS)
Davtyan, Aram; Dama, James F.; Voth, Gregory A.; Andersen, Hans C.
2015-04-01
Coarse-grained (CG) models of molecular systems, with fewer mechanical degrees of freedom than an all-atom model, are used extensively in chemical physics. It is generally accepted that a coarse-grained model that accurately describes equilibrium structural properties (as a result of having a well constructed CG potential energy function) does not necessarily exhibit appropriate dynamical behavior when simulated using conservative Hamiltonian dynamics for the CG degrees of freedom on the CG potential energy surface. Attempts to develop accurate CG dynamic models usually focus on replacing Hamiltonian motion by stochastic but Markovian dynamics on that surface, such as Langevin or Brownian dynamics. However, depending on the nature of the system and the extent of the coarse-graining, a Markovian dynamics for the CG degrees of freedom may not be appropriate. In this paper, we consider the problem of constructing dynamic CG models within the context of the Multi-Scale Coarse-graining (MS-CG) method of Voth and coworkers. We propose a method of converting a MS-CG model into a dynamic CG model by adding degrees of freedom to it in the form of a small number of fictitious particles that interact with the CG degrees of freedom in simple ways and that are subject to Langevin forces. The dynamic models are members of a class of nonlinear systems interacting with special heat baths that were studied by Zwanzig [J. Stat. Phys. 9, 215 (1973)]. The properties of the fictitious particles can be inferred from analysis of the dynamics of all-atom simulations of the system of interest. This is analogous to the fact that the MS-CG method generates the CG potential from analysis of equilibrium structures observed in all-atom simulation data. The dynamic models generate a non-Markovian dynamics for the CG degrees of freedom, but they can be easily simulated using standard molecular dynamics programs. We present tests of this method on a series of simple examples that demonstrate that
System and method for knowledge based matching of users in a network
Verspoor, Cornelia Maria; Sims, Benjamin Hayden; Ambrosiano, John Joseph; Cleland, Timothy James
2011-04-26
A knowledge-based system and methods to matchmaking and social network extension are disclosed. The system is configured to allow users to specify knowledge profiles, which are collections of concepts that indicate a certain topic or area of interest selected from an. The system utilizes the knowledge model as the semantic space within which to compare similarities in user interests. The knowledge model is hierarchical so that indications of interest in specific concepts automatically imply interest in more general concept. Similarity measures between profiles may then be calculated based on suitable distance formulas within this space.
NASA Astrophysics Data System (ADS)
Wong, S. K.; Chan, V. S.; Hinton, F. L.
2001-10-01
The classic solution of the linearized drift kinetic equations in neoclassical transport theory for large-aspect-ratio tokamak flux-surfaces relies on the variational principle and the choice of ``localized" distribution functions as trialfunctions.(M.N. Rosenbluth, et al., Phys. Fluids 15) (1972) 116. Somewhat unclear in this approach are the nature and the origin of the ``localization" and whether the results obtained represent the exact leading terms in an asymptotic expansion int he inverse aspect ratio. Using the method of matched asymptotic expansions, we were able to derive the leading approximations to the distribution functions and demonstrated the asymptotic exactness of the existing results. The method is also applied to the calculation of angular momentum transport(M.N. Rosenbluth, et al., Plasma Phys. and Contr. Nucl. Fusion Research, 1970, Vol. 1 (IAEA, Vienna, 1971) p. 495.) and the current driven by electron cyclotron waves.
Ta2O5-memristor synaptic array with winner-take-all method for neuromorphic pattern matching
NASA Astrophysics Data System (ADS)
Truong, Son Ngoc; Van Pham, Khoa; Yang, Wonsun; Min, Kyeong-Sik; Abbas, Yawar; Kang, Chi Jung; Shin, Sangho; Pedrotti, Ken
2016-08-01
Pattern matching or pattern recognition is one of the elemental components that constitute the very complicated recalling and remembering process in human's brain. To realize this neuromorphic pattern matching, we fabricated and tested a 3 × 3 memristor synaptic array with the winner-take-all method in this research. In the measurement, first, the 3 × 3 Ta2O5 memristor array is programmed to store [LLL], [LHH], and [HLH], where L is a low-resistance state and H is a high-resistance state, at the 1st, 2nd, and 3rd columns, respectively. After the programming, three input patterns, [111], [100], and [010], are applied to the memristor synaptic array. From the measurement results, we confirm that all three input patterns can be recognized well by using a twin memristor crossbar with synaptic arrays. This measurement can be thought of as the first real verification of the twin memristor crossbar with memristive synaptic arrays for neuromorphic pattern recognition.
Tang, Nian-Sheng; Li, Hui-Qiong; Tang, Man-Lai
2010-01-15
A stratified matched-pair study is often designed for adjusting a confounding effect or effect of different trails/centers/ groups in modern medical studies. The relative risk is one of the most frequently used indices in comparing efficiency of two treatments in clinical trials. In this paper, we propose seven confidence interval estimators for the common relative risk and three simultaneous confidence interval estimators for the relative risks in stratified matched-pair designs. The performance of the proposed methods is evaluated with respect to their type I error rates, powers, coverage probabilities, and expected widths. Our empirical results show that the percentile bootstrap confidence interval and bootstrap-resampling-based Bonferroni simultaneous confidence interval behave satisfactorily for small to large sample sizes in the sense that (i) their empirical coverage probabilities can be well controlled around the pre-specified nominal confidence level with reasonably shorter confidence widths; and (ii) the empirical type I error rates of their associated test statistics are generally closer to the pre-specified nominal level with larger powers. They are hence recommended. Two real examples from clinical laboratory studies are used to illustrate the proposed methodologies.
Numerical considerations in computing invariant subspaces
Dongarra, J.J. . Dept. of Computer Science Oak Ridge National Lab., TN ); Hammarling, S. ); Wilkinson, J.H. )
1990-11-01
This paper describes two methods for computing the invariant subspace of a matrix. The first involves using transformations to interchange the eigenvalues; the second involves direct computation of the vectors. 10 refs.
Cosmological disformal invariance
Domènech, Guillem; Sasaki, Misao; Naruko, Atsushi E-mail: naruko@th.phys.titech.ac.jp
2015-10-01
The invariance of physical observables under disformal transformations is considered. It is known that conformal transformations leave physical observables invariant. However, whether it is true for disformal transformations is still an open question. In this paper, it is shown that a pure disformal transformation without any conformal factor is equivalent to rescaling the time coordinate. Since this rescaling applies equally to all the physical quantities, physics must be invariant under a disformal transformation, that is, neither causal structure, propagation speed nor any other property of the fields are affected by a disformal transformation itself. This fact is presented at the action level for gravitational and matter fields and it is illustrated with some examples of observable quantities. We also find the physical invariance for cosmological perturbations at linear and high orders in perturbation, extending previous studies. Finally, a comparison with Horndeski and beyond Horndeski theories under a disformal transformation is made.
Exposing region duplication through local geometrical color invariant features
NASA Astrophysics Data System (ADS)
Gong, Jiachang; Guo, Jichang
2015-05-01
Many advanced image-processing softwares are available for tampering images. How to determine the authenticity of an image has become an urgent problem. Copy-move is one of the most common image forgery operations. Many methods have been proposed for copy-move forgery detection (CMFD). However, most of these methods are designed for grayscale images without any color information used. They are usually not suitable when the duplicated regions have little structure or have undergone various transforms. We propose a CMFD method using local geometrical color invariant features to detect duplicated regions. The method starts by calculating the color gradient of the inspected image. Then, we directly take the color gradient as the input for scale invariant features transform (SIFT) to extract color-SIFT descriptors. Finally, keypoints are matched and clustered before their geometrical relationship is estimated to expose the duplicated regions. We evaluate the detection performance and computational complexity of the proposed method together with several popular CMFD methods on a public database. Experimental results demonstrate the efficacy of the proposed method in detecting duplicated regions with various transforms and poor structure.
Maier, Christopher A; Zhang, Kang; Manhein, Mary H; Li, Xin
2015-09-01
In the past, assessing ancestry relied on the naked eye and observer experience; however, replicability has become an important aspect of such analysis through the application of metric techniques. This study examines palate shape and assesses ancestry quantitatively using a 3D digitizer and shape-matching and machine learning methods. Palate curves and depths were recorded, processed, and tested for 376 individuals. Palate shape was an accurate indicator of ancestry in 58% of cases. Cluster analysis revealed that the parabolic, hyperbolic, and elliptical shapes are discrete from one another. Preliminary results indicate that palate depth in Hispanic individuals is greatest. Palate shape appears to be a useful indicator of ancestry, particularly when assessed by a computer. However, these data suggest that palate shape is not useful for assessing ancestry in Hispanic individuals. Although ancestry may be determined from palate shape, the use of multiple features is recommended and more reliable.
Matching using estimated propensity scores: relating theory to practice.
Rubin, D B; Thomas, N
1996-03-01
Matched sampling is a standard technique in the evaluation of treatments in observational studies. Matching on estimated propensity scores comprises an important class of procedures when there are numerous matching variables. Recent theoretical work (Rubin, D. B. and Thomas, N., 1992, The Annals of Statistics 20, 1079-1093) on affinely invariant matching methods with ellipsoidal distributions provides a general framework for evaluating the operating characteristics of such methods. Moreover, Rubin and Thomas (1992, Biometrika 79, 797-809) uses this framework to derive several analytic approximations under normality for the distribution of the first two moments of the matching variables in samples obtained by matching on estimated linear propensity scores. Here we provide a bridge between these theoretical approximations and actual practice. First, we complete and refine the nomal-based analytic approximations, thereby making it possible to apply these results to practice. Second, we perform Monte Carlo evaluations of the analytic results under normal and nonnormal ellipsoidal distributions, which confirm the accuracy of the analytic approximations, and demonstrate the predictable ways in which the approximations deviate from simulation results when normal assumptions are violated within the ellipsoidal family. Third, we apply the analytic approximations to real data with clearly nonellipsoidal distributions, and show that the theoretical expressions, although derived under artificial distributional conditions, produce useful guidance for practice. Our results delineate the wide range of settings in which matching on estimated linear propensity scores performs well, thereby providing useful information for the design of matching studies. When matching with a particular data set, our theoretical approximations provide benchmarks for expected performance under favorable conditions, thereby identifying matching variables requiring special treatment. After matching is
Rotationally Invariant Holographic Tracking System
NASA Astrophysics Data System (ADS)
Lambert, James L.; Chao, Tien-Hsin; Gheen, Gregory; Johnston, Alan R.; Liu, Hua-Kuang
1989-06-01
A multi-channel holographic correlator has been constructed which can identify and track objects of a given shape across the input field independent of their in-plane rotation. This system, derived from the classic Vander Lugt correlator, incorporates a hololens to store an array of matched spatial filters (MSFs) on thermoplastic film. Each member of the MSF array is generated from a different incrementally rotated version of the training object. Rotational invariant tracking is achieved through superposition of the corresponding array of the correlations in the output plane. Real time tracking is accomplished by utilizing a liquid crystal light valve (LCLV) illuminated with a CRT to process video input signals. The system can be programmed to recognize different objects by recording the MSF array on re-usable thermoplastic film. Discussion of the system architecture and laboratory results are presented.
Scope and applications of translation invariant wavelets to image registration
NASA Technical Reports Server (NTRS)
Chettri, Samir; LeMoigne, Jacqueline; Campbell, William
1997-01-01
The first part of this article introduces the notion of translation invariance in wavelets and discusses several wavelets that have this property. The second part discusses the possible applications of such wavelets to image registration. In the case of registration of affinely transformed images, we would conclude that the notion of translation invariance is not really necessary. What is needed is affine invariance and one way to do this is via the method of moment invariants. Wavelets or, in general, pyramid processing can then be combined with the method of moment invariants to reduce the computational load.
NASA Technical Reports Server (NTRS)
Manning, Robert M.
2012-01-01
The method of moments is used to define and derive expressions for laser beam deflection and beam radius broadening for high-energy propagation through the Earth s atmosphere. These expressions are augmented with the integral invariants of the corresponding nonlinear parabolic equation that describes the electric field of high-energy laser beam to propagation to yield universal equations for the aforementioned quantities; the beam deflection is a linear function of the propagation distance whereas the beam broadening is a quadratic function of distance. The coefficients of these expressions are then derived from a thin screen approximation solution of the nonlinear parabolic equation to give corresponding analytical expressions for a target located outside the Earth s atmospheric layer. These equations, which are graphically presented for a host of propagation scenarios, as well as the thin screen model, are easily amenable to the phase expansions of the wave front for the specification and design of adaptive optics algorithms to correct for the inherent phase aberrations. This work finds application in, for example, the analysis of beamed energy propulsion for space-based vehicles.
Aad, G; Abbott, B; Abdinov, O; Abdallah, J; Abeloos, B; Aben, R; Abolins, M; Aben, R; Abolins, M; AbouZeid, O S; Abraham, N L; Abramowicz, H; Abreu, H; Abreu, R; Abulaiti, Y; Acharya, B S; Adamczyk, L; Adams, D L; Adelman, J; Adomeit, S; Adye, T; Affolder, A A; Agatonovic-Jovin, T; Agricola, J; Aguilar-Saavedra, J A; Ahlen, S P; Ahmadov, F; Aielli, G; Akerstedt, H; Åkesson, T P A; Akimov, A V; Alberghi, G L; Albert, J; Albrand, S; Verzini, M J Alconada; Aleksa, M; Aleksandrov, I N; Alexa, C; Alexander, G; Alexopoulos, T; Alhroob, M; Alimonti, G; Alison, J; Alkire, S P; Allbrooke, B M M; Allen, B W; Allport, P P; Aloisio, A; Alonso, A; Alonso, F; Alpigiani, C; Gonzalez, B Alvarez; Piqueras, D Álvarez; Alviggi, M G; Amadio, B T; Amako, K; Coutinho, Y Amaral; Amelung, C; Amidei, D; Santos, S P Amor Dos; Amorim, A; Amoroso, S; Amram, N; Amundsen, G; Anastopoulos, C; Ancu, L S; Andari, N; Andeen, T; Anders, C F; Anders, G; Anders, J K; Anderson, K J; Andreazza, A; Andrei, V; Angelidakis, S; Angelozzi, I; Anger, P; Angerami, A; Anghinolfi, F; Anisenkov, A V; Anjos, N; Annovi, A; Antonelli, M; Antonov, A; Antos, J; Anulli, F; Aoki, M; Bella, L Aperio; Arabidze, G; Arai, Y; Araque, J P; Arce, A T H; Arduh, F A; Arguin, J-F; Argyropoulos, S; Arik, M; Armbruster, A J; Armitage, L J; Arnaez, O; Arnold, H; Arratia, M; Arslan, O; Artamonov, A; Artoni, G; Artz, S; Asai, S; Asbah, N; Ashkenazi, A; Åsman, B; Asquith, L; Assamagan, K; Astalos, R; Atkinson, M; Atlay, N B; Augsten, K; Avolio, G; Axen, B; Ayoub, M K; Azuelos, G; Baak, M A; Baas, A E; Baca, M J; Bachacou, H; Bachas, K; Backes, M; Backhaus, M; Bagiacchi, P; Bagnaia, P; Bai, Y; Baines, J T; Baker, O K; Baldin, E M; Balek, P; Balestri, T; Balli, F; Balunas, W K; Banas, E; Banerjee, Sw; Bannoura, A A E; Barak, L; Barberio, E L; Barberis, D; Barbero, M; Barillari, T; Barisonzi, M; Barklow, T; Barlow, N; Barnes, S L; Barnett, B M; Barnett, R M; Barnovska, Z; Baroncelli, A; Barone, G; Barr, A J; Navarro, L Barranco; Barreiro, F; da Costa, J Barreiro Guimarães; Bartoldus, R; Barton, A E; Bartos, P; Basalaev, A; Bassalat, A; Basye, A; Bates, R L; Batista, S J; Batley, J R; Battaglia, M; Bauce, M; Bauer, F; Bawa, H S; Beacham, J B; Beattie, M D; Beau, T; Beauchemin, P H; Bechtle, P; Beck, H P; Becker, K; Becker, M; Beckingham, M; Becot, C; Beddall, A J; Beddall, A; Bednyakov, V A; Bedognetti, M; Bee, C P; Beemster, L J; Beermann, T A; Begel, M; Behr, J K; Belanger-Champagne, C; Bell, A S; Bell, W H; Bella, G; Bellagamba, L; Bellerive, A; Bellomo, M; Belotskiy, K; Beltramello, O; Belyaev, N L; Benary, O; Benchekroun, D; Bender, M; Bendtz, K; Benekos, N; Benhammou, Y; Noccioli, E Benhar; Benitez, J; Garcia, J A Benitez; Benjamin, D P; Bensinger, J R; Bentvelsen, S; Beresford, L; Beretta, M; Berge, D; Kuutmann, E Bergeaas; Berger, N; Berghaus, F; Beringer, J; Berlendis, S; Bernard, N R; Bernius, C; Bernlochner, F U; Berry, T; Berta, P; Bertella, C; Bertoli, G; Bertolucci, F; Bertram, I A; Bertsche, C; Bertsche, D; Besjes, G J; Bylund, O Bessidskaia; Bessner, M; Besson, N; Betancourt, C; Bethke, S; Bevan, A J; Bhimji, W; Bianchi, R M; Bianchini, L; Bianco, M; Biebel, O; Biedermann, D; Bielski, R; Biesuz, N V; Biglietti, M; De Mendizabal, J Bilbao; Bilokon, H; Bindi, M; Binet, S; Bingul, A; Bini, C; Biondi, S; Bjergaard, D M; Black, C W; Black, J E; Black, K M; Blackburn, D; Blair, R E; Blanchard, J-B; Blanco, J E; Blazek, T; Bloch, I; Blocker, C; Blum, W; Blumenschein, U; Blunier, S; Bobbink, G J; Bobrovnikov, V S; Bocchetta, S S; Bocci, A; Bock, C; Boehler, M; Boerner, D; Bogaerts, J A; Bogavac, D; Bogdanchikov, A G; Bohm, C; Boisvert, V; Bold, T; Boldea, V; Boldyrev, A S; Bomben, M; Bona, M; Boonekamp, M; Borisov, A; Borissov, G; Bortfeldt, J; Bortoletto, D; Bortolotto, V; Bos, K; Boscherini, D; Bosman, M; Sola, J D Bossio; Boudreau, J; Bouffard, J; Bouhova-Thacker, E V; Boumediene, D; Bourdarios, C; Boutle, S K; Boveia, A; Boyd, J; Boyko, I R; Bracinik, J; Brandt, A; Brandt, G; Brandt, O; Bratzler, U; Brau, B; Brau, J E; Braun, H M; Madden, W D Breaden; Brendlinger, K; Brennan, A J; Brenner, L; Brenner, R; Bressler, S; Bristow, T M; Britton, D; Britzger, D; Brochu, F M; Brock, I; Brock, R; Brooijmans, G; Brooks, T; Brooks, W K; Brosamer, J; Brost, E; Broughton, J H; de Renstrom, P A Bruckman; Bruncko, D; Bruneliere, R; Bruni, A; Bruni, G; Brunt, B H; Bruschi, M; Bruscino, N; Bryant, P; Bryngemark, L; Buanes, T; Buat, Q; Buchholz, P; Buckley, A G; Budagov, I A; Buehrer, F; Bugge, M K; Bulekov, O; Bullock, D; Burckhart, H; Burdin, S; Burgard, C D; Burghgrave, B; Burka, K; Burke, S; Burmeister, I; Busato, E; Büscher, D; Büscher, V; Bussey, P; Butler, J M; Butt, A I; Buttar, C M; Butterworth, J M; Butti, P; Buttinger, W; Buzatu, A; Buzykaev, A R; Urbán, S Cabrera; Caforio, D; Cairo, V M; Cakir, O; Calace, N; Calafiura, P; Calandri, A; Calderini, G; Calfayan, P; Caloba, L P; Calvet, D; Calvet, S; Calvet, T P; Toro, R Camacho; Camarda, S; Camarri, P; Cameron, D; Armadans, R Caminal; Camincher, C; Campana, S; Campanelli, M; Campoverde, A; Canale, V; Canepa, A; Bret, M Cano; Cantero, J; Cantrill, R; Cao, T; Garrido, M D M Capeans; Caprini, I; Caprini, M; Capua, M; Caputo, R; Carbone, R M; Cardarelli, R; Cardillo, F; Carli, T; Carlino, G; Carminati, L; Caron, S; Carquin, E; Carrillo-Montoya, G D; Carter, J R; Carvalho, J; Casadei, D; Casado, M P; Casolino, M; Casper, D W; Castaneda-Miranda, E; Castelli, A; Gimenez, V Castillo; Castro, N F; Catinaccio, A; Catmore, J R; Cattai, A; Caudron, J; Cavaliere, V; Cavallaro, E; Cavalli, D; Cavalli-Sforza, M; Cavasinni, V; Ceradini, F; Alberich, L Cerda; Cerio, B C; Cerqueira, A S; Cerri, A; Cerrito, L; Cerutti, F; Cerv, M; Cervelli, A; Cetin, S A; Chafaq, A; Chakraborty, D; Chalupkova, I; Chan, S K; Chan, Y L; Chang, P; Chapman, J D; Charlton, D G; Chatterjee, A; Chau, C C; Barajas, C A Chavez; Che, S; Cheatham, S; Chegwidden, A; Chekanov, S; Chekulaev, S V; Chelkov, G A; Chelstowska, M A; Chen, C; Chen, H; Chen, K; Chen, S; Chen, S; Chen, X; Chen, Y; Cheng, H C; Cheng, H J; Cheng, Y; Cheplakov, A; Cheremushkina, E; Moursli, R Cherkaoui El; Chernyatin, V; Cheu, E; Chevalier, L; Chiarella, V; Chiarelli, G; Chiodini, G; Chisholm, A S; Chitan, A; Chizhov, M V; Choi, K; Chomont, A R; Chouridou, S; Chow, B K B; Christodoulou, V; Chromek-Burckhart, D; Chudoba, J; Chuinard, A J; Chwastowski, J J; Chytka, L; Ciapetti, G; Ciftci, A K; Cinca, D; Cindro, V; Cioara, I A; Ciocio, A; Cirotto, F; Citron, Z H; Ciubancan, M; Clark, A; Clark, B L; Clark, P J; Clarke, R N; Clement, C; Coadou, Y; Cobal, M; Coccaro, A; Cochran, J; Coffey, L; Colasurdo, L; Cole, B; Cole, S; Colijn, A P; Collot, J; Colombo, T; Compostella, G; Muiño, P Conde; Coniavitis, E; Connell, S H; Connelly, I A; Consorti, V; Constantinescu, S; Conta, C; Conti, G; Conventi, F; Cooke, M; Cooper, B D; Cooper-Sarkar, A M; Cornelissen, T; Corradi, M; Corriveau, F; Corso-Radu, A; Cortes-Gonzalez, A; Cortiana, G; Costa, G; Costa, M J; Costanzo, D; Cottin, G; Cowan, G; Cox, B E; Cranmer, K; Crawley, S J; Cree, G; Crépé-Renaudin, S; Crescioli, F; Cribbs, W A; Ortuzar, M Crispin; Cristinziani, M; Croft, V; Crosetti, G; Donszelmann, T Cuhadar; Cummings, J; Curatolo, M; Cúth, J; Cuthbert, C; Czirr, H; Czodrowski, P; D'Auria, S; D'Onofrio, M; De Sousa, M J Da Cunha Sargedas; Via, C Da; Dabrowski, W; Dai, T; Dale, O; Dallaire, F; Dallapiccola, C; Dam, M; Dandoy, J R; Dang, N P; Daniells, A C; Dann, N S; Danninger, M; Hoffmann, M Dano; Dao, V; Darbo, G; Darmora, S; Dassoulas, J; Dattagupta, A; Davey, W; David, C; Davidek, T; Davies, M; Davison, P; Davygora, Y; Dawe, E; Dawson, I; Daya-Ishmukhametova, R K; De, K; de Asmundis, R; De Benedetti, A; De Castro, S; De Cecco, S; De Groot, N; de Jong, P; De la Torre, H; De Lorenzi, F; De Pedis, D; De Salvo, A; De Sanctis, U; De Santo, A; De Regie, J B De Vivie; Dearnaley, W J; Debbe, R; Debenedetti, C; Dedovich, D V; Deigaard, I; Del Peso, J; Del Prete, T; Delgove, D; Deliot, F; Delitzsch, C M; Deliyergiyev, M; Dell'Acqua, A; Dell'Asta, L; Dell'Orso, M; Della Pietra, M; Della Volpe, D; Delmastro, M; Delsart, P A; Deluca, C; DeMarco, D A; Demers, S; Demichev, M; Demilly, A; Denisov, S P; Denysiuk, D; Derendarz, D; Derkaoui, J E; Derue, F; Dervan, P; Desch, K; Deterre, C; Dette, K; Deviveiros, P O; Dewhurst, A; Dhaliwal, S; Di Ciaccio, A; Di Ciaccio, L; Di Clemente, W K; Di Domenico, A; Di Donato, C; Di Girolamo, A; Di Girolamo, B; Di Mattia, A; Di Micco, B; Di Nardo, R; Di Simone, A; Di Sipio, R; Di Valentino, D; Diaconu, C; Diamond, M; Dias, F A; Diaz, M A; Diehl, E B; Dietrich, J; Diglio, S; Dimitrievska, A; Dingfelder, J; Dita, P; Dita, S; Dittus, F; Djama, F; Djobava, T; Djuvsland, J I; do Vale, M A B; Dobos, D; Dobre, M; Doglioni, C; Dohmae, T; Dolejsi, J; Dolezal, Z; Dolgoshein, B A; Donadelli, M; Donati, S; Dondero, P; Donini, J; Dopke, J; Doria, A; Dova, M T; Doyle, A T; Drechsler, E; Dris, M; Du, Y; Duarte-Campderros, J; Duchovni, E; Duckeck, G; Ducu, O A; Duda, D; Dudarev, A; Duflot, L; Duguid, L; Dührssen, M; Dunford, M; Yildiz, H Duran; Düren, M; Durglishvili, A; Duschinger, D; Dutta, B; Dyndal, M; Eckardt, C; Ecker, K M; Edgar, R C; Edson, W; Edwards, N C; Eifert, T; Eigen, G; Einsweiler, K; Ekelof, T; Kacimi, M El; Ellajosyula, V; Ellert, M; Elles, S; Ellinghaus, F; Elliot, A A; Ellis, N; Elmsheuser, J; Elsing, M; Emeliyanov, D; Enari, Y; Endner, O C; Endo, M; Ennis, J S; Erdmann, J; Ereditato, A; Ernis, G; Ernst, J; Ernst, M; Errede, S; Ertel, E; Escalier, M; Esch, H; Escobar, C; Esposito, B; Etienvre, A I; Etzion, E; Evans, H; Ezhilov, A; Fabbri, F; Fabbri, L; Facini, G; Fakhrutdinov, R M; Falciano, S; Falla, R J; Faltova, J; Fang, Y; Fanti, M; Farbin, A; Farilla, A; Farina, C; Farooque, T; Farrell, S; Farrington, S M; Farthouat, P; Fassi, F; Fassnacht, P; Fassouliotis, D; Giannelli, M Faucci; Favareto, A; Fawcett, W J; Fayard, L; Fedin, O L; Fedorko, W; Feigl, S; Feligioni, L; Feng, C; Feng, E J; Feng, H; Fenyuk, A B; Feremenga, L; Martinez, P Fernandez; Perez, S Fernandez; Ferrando, J; Ferrari, A; Ferrari, P; Ferrari, R; de Lima, D E Ferreira; Ferrer, A; Ferrere, D; Ferretti, C; Parodi, A Ferretto; Fiedler, F; Filipčič, A; Filipuzzi, M; Filthaut, F; Fincke-Keeler, M; Finelli, K D; Fiolhais, M C N; Fiorini, L; Firan, A; Fischer, A; Fischer, C; Fischer, J; Fisher, W C; Flaschel, N; Fleck, I; Fleischmann, P; Fletcher, G T; Fletcher, G; Fletcher, R R M; Flick, T; Floderus, A; Castillo, L R Flores; Flowerdew, M J; Forcolin, G T; Formica, A; Forti, A; Foster, A G; Fournier, D; Fox, H; Fracchia, S; Francavilla, P; Franchini, M; Francis, D; Franconi, L; Franklin, M; Frate, M; Fraternali, M; Freeborn, D; Fressard-Batraneanu, S M; Friedrich, F; Froidevaux, D; Frost, J A; Fukunaga, C; Torregrosa, E Fullana; Fusayasu, T; Fuster, J; Gabaldon, C; Gabizon, O; Gabrielli, A; Gabrielli, A; Gach, G P; Gadatsch, S; Gadomski, S; Gagliardi, G; Gagnon, L G; Gagnon, P; Galea, C; Galhardo, B; Gallas, E J; Gallop, B J; Gallus, P; Galster, G; Gan, K K; Gao, J; Gao, Y; Gao, Y S; Walls, F M Garay; García, C; Navarro, J E García; Garcia-Sciveres, M; Gardner, R W; Garelli, N; Garonne, V; Bravo, A Gascon; Gatti, C; Gaudiello, A; Gaudio, G; Gaur, B; Gauthier, L; Gavrilenko, I L; Gay, C; Gaycken, G; Gazis, E N; Gecse, Z; Gee, C N P; Geich-Gimbel, Ch; Geisler, M P; Gemme, C; Genest, M H; Geng, C; Gentile, S; George, S; Gerbaudo, D; Gershon, A; Ghasemi, S; Ghazlane, H; Ghneimat, M; Giacobbe, B; Giagu, S; Giannetti, P; Gibbard, B; Gibson, S M; Gignac, M; Gilchriese, M; Gillam, T P S; Gillberg, D; Gilles, G; Gingrich, D M; Giokaris, N; Giordani, M P; Giorgi, F M; Giorgi, F M; Giraud, P F; Giromini, P; Giugni, D; Giuli, F; Giuliani, C; Giulini, M; Gjelsten, B K; Gkaitatzis, S; Gkialas, I; Gkougkousis, E L; Gladilin, L K; Glasman, C; Glatzer, J; Glaysher, P C F; Glazov, A; Goblirsch-Kolb, M; Godlewski, J; Goldfarb, S; Golling, T; Golubkov, D; Gomes, A; Gonçalo, R; Costa, J Goncalves Pinto Firmino Da; Gonella, L; Gongadze, A; de la Hoz, S González; Parra, G Gonzalez; Gonzalez-Sevilla, S; Goossens, L; Gorbounov, P A; Gordon, H A; Gorelov, I; Gorini, B; Gorini, E; Gorišek, A; Gornicki, E; Goshaw, A T; Gössling, C; Gostkin, M I; Goudet, C R; Goujdami, D; Goussiou, A G; Govender, N; Gozani, E; Graber, L; Grabowska-Bold, I; Gradin, P O J; Grafström, P; Gramling, J; Gramstad, E; Grancagnolo, S; Gratchev, V; Gray, H M; Graziani, E; Greenwood, Z D; Grefe, C; Gregersen, K; Gregor, I M; Grenier, P; Grevtsov, K; Griffiths, J; Grillo, A A; Grimm, K; Grinstein, S; Gris, Ph; Grivaz, J-F; Groh, S; Grohs, J P; Gross, E; Grosse-Knetter, J; Grossi, G C; Grout, Z J; Guan, L; Guan, W; Guenther, J; Guescini, F; Guest, D; Gueta, O; Guido, E; Guillemin, T; Guindon, S; Gul, U; Gumpert, C; Guo, J; Guo, Y; Gupta, S; Gustavino, G; Gutierrez, P; Ortiz, N G Gutierrez; Gutschow, C; Guyot, C; Gwenlan, C; Gwilliam, C B; Haas, A; Haber, C; Hadavand, H K; Haddad, N; Hadef, A; Haefner, P; Hageböck, S; Hajduk, Z; Hakobyan, H; Haleem, M; Haley, J; Hall, D; Halladjian, G; Hallewell, G D; Hamacher, K; Hamal, P; Hamano, K; Hamilton, A; Hamity, G N; Hamnett, P G; Han, L; Hanagaki, K; Hanawa, K; Hance, M; Haney, B; Hanke, P; Hanna, R; Hansen, J B; Hansen, J D; Hansen, M C; Hansen, P H; Hara, K; Hard, A S; Harenberg, T; Hariri, F; Harkusha, S; Harrington, R D; Harrison, P F; Hartjes, F; Hasegawa, M; Hasegawa, Y; Hasib, A; Hassani, S; Haug, S; Hauser, R; Hauswald, L; Havranek, M; Hawkes, C M; Hawkings, R J; Hawkins, A D; Hayden, D; Hays, C P; Hays, J M; Hayward, H S; Haywood, S J; Head, S J; Heck, T; Hedberg, V; Heelan, L; Heim, S; Heim, T; Heinemann, B; Heinrich, J J; Heinrich, L; Heinz, C; Hejbal, J; Helary, L; Hellman, S; Helsens, C; Henderson, J; Henderson, R C W; Heng, Y; Henkelmann, S; Correia, A M Henriques; Henrot-Versille, S; Herbert, G H; Jiménez, Y Hernández; Herten, G; Hertenberger, R; Hervas, L; Hesketh, G G; Hessey, N P; Hetherly, J W; Hickling, R; Higón-Rodriguez, E; Hill, E; Hill, J C; Hiller, K H; Hillier, S J; Hinchliffe, I; Hines, E; Hinman, R R; Hirose, M; Hirschbuehl, D; Hobbs, J; Hod, N; Hodgkinson, M C; Hodgson, P; Hoecker, A; Hoeferkamp, M R; Hoenig, F; Hohlfeld, M; Hohn, D; Holmes, T R; Homann, M; Hong, T M; Hooberman, B H; Hopkins, W H; Horii, Y; Horton, A J; Hostachy, J-Y; Hou, S; Hoummada, A; Howard, J; Howarth, J; Hrabovsky, M; Hristova, I; Hrivnac, J; Hryn'ova, T; Hrynevich, A; Hsu, C; Hsu, P J; Hsu, S-C; Hu, D; Hu, Q; Huang, Y; Hubacek, Z; Hubaut, F; Huegging, F; Huffman, T B; Hughes, E W; Hughes, G; Huhtinen, M; Hülsing, T A; Huseynov, N; Huston, J; Huth, J; Iacobucci, G; Iakovidis, G; Ibragimov, I; Iconomidou-Fayard, L; Ideal, E; Idrissi, Z; Iengo, P; Igonkina, O; Iizawa, T; Ikegami, Y; Ikeno, M; Ilchenko, Y; Iliadis, D; Ilic, N; Ince, T; Introzzi, G; Ioannou, P; Iodice, M; Iordanidou, K; Ippolito, V; Quiles, A Irles; Isaksson, C; Ishino, M; Ishitsuka, M; Ishmukhametov, R; Issever, C; Istin, S; Ito, F; Ponce, J M Iturbe; Iuppa, R; Ivarsson, J; Iwanski, W; Iwasaki, H; Izen, J M; Izzo, V; Jabbar, S; Jackson, B; Jackson, M; Jackson, P; Jain, V; Jakobi, K B; Jakobs, K; Jakobsen, S; Jakoubek, T; Jamin, D O; Jana, D K; Jansen, E; Jansky, R; Janssen, J; Janus, M; Jarlskog, G; Javadov, N; Javůrek, T; Jeanneau, F; Jeanty, L; Jejelava, J; Jeng, G-Y; Jennens, D; Jenni, P; Jentzsch, J; Jeske, C; Jézéquel, S; Ji, H; Jia, J; Jiang, H; Jiang, Y; Jiggins, S; Pena, J Jimenez; Jin, S; Jinaru, A; Jinnouchi, O; Johansson, P; Johns, K A; Johnson, W J; Jon-And, K; Jones, G; Jones, R W L; Jones, S; Jones, T J; Jongmanns, J; Jorge, P M; Jovicevic, J; Ju, X; Rozas, A Juste; Köhler, M K; Kaczmarska, A; Kado, M; Kagan, H; Kagan, M; Kahn, S J; Kajomovitz, E; Kalderon, C W; Kaluza, A; Kama, S; Kamenshchikov, A; Kanaya, N; Kaneti, S; Kantserov, V A; Kanzaki, J; Kaplan, B; Kaplan, L S; Kapliy, A; Kar, D; Karakostas, K; Karamaoun, A; Karastathis, N; Kareem, M J; Karentzos, E; Karnevskiy, M; Karpov, S N; Karpova, Z M; Karthik, K; Kartvelishvili, V; Karyukhin, A N; Kasahara, K; Kashif, L; Kass, R D; Kastanas, A; Kataoka, Y; Kato, C; Katre, A; Katzy, J; Kawade, K; Kawagoe, K; Kawamoto, T; Kawamura, G; Kazama, S; Kazanin, V F; Keeler, R; Kehoe, R; Keller, J S; Kempster, J J; Keoshkerian, H; Kepka, O; Kerševan, B P; Kersten, S; Keyes, R A; Khalil-Zada, F; Khandanyan, H; Khanov, A; Kharlamov, A G; Khoo, T J; Khovanskiy, V; Khramov, E; Khubua, J; Kido, S; Kim, H Y; Kim, S H; Kim, Y K; Kimura, N; Kind, O M; King, B T; King, M; King, S B; Kirk, J; Kiryunin, A E; Kishimoto, T; Kisielewska, D; Kiss, F; Kiuchi, K; Kivernyk, O; Kladiva, E; Klein, M H; Klein, M; Klein, U; Kleinknecht, K; Klimek, P; Klimentov, A; Klingenberg, R; Klinger, J A; Klioutchnikova, T; Kluge, E-E; Kluit, P; Kluth, S; Knapik, J; Kneringer, E; Knoops, E B F G; Knue, A; Kobayashi, A; Kobayashi, D; Kobayashi, T; Kobel, M; Kocian, M; Kodys, P; Koffas, T; Koffeman, E; Kogan, L A; Kohriki, T; Koi, T; Kolanoski, H; Kolb, M; Koletsou, I; Komar, A A; Komori, Y; Kondo, T; Kondrashova, N; Köneke, K; König, A C; Kono, T; Konoplich, R; Konstantinidis, N; Kopeliansky, R; Koperny, S; Köpke, L; Kopp, A K; Korcyl, K; Kordas, K; Korn, A; Korol, A A; Korolkov, I; Korolkova, E V; Kortner, O; Kortner, S; Kosek, T; Kostyukhin, V V; Kotov, V M; Kotwal, A; Kourkoumeli-Charalampidi, A; Kourkoumelis, C; Kouskoura, V; Koutsman, A; Kowalewska, A B; Kowalewski, R; Kowalski, T Z; Kozanecki, W; Kozhin, A S; Kramarenko, V A; Kramberger, G; Krasnopevtsev, D; Krasny, M W; Krasznahorkay, A; Kraus, J K; Kravchenko, A; Kretz, M; Kretzschmar, J; Kreutzfeldt, K; Krieger, P; Krizka, K; Kroeninger, K; Kroha, H; Kroll, J; Kroseberg, J; Krstic, J; Kruchonak, U; Krüger, H; Krumnack, N; Kruse, A; Kruse, M C; Kruskal, M; Kubota, T; Kucuk, H; Kuday, S; Kuechler, J T; Kuehn, S; Kugel, A; Kuger, F; Kuhl, A; Kuhl, T; Kukhtin, V; Kukla, R; Kulchitsky, Y; Kuleshov, S; Kuna, M; Kunigo, T; Kupco, A; Kurashige, H; Kurochkin, Y A; Kus, V; Kuwertz, E S; Kuze, M; Kvita, J; Kwan, T; Kyriazopoulos, D; Rosa, A La; Navarro, J L La Rosa; Rotonda, L La; Lacasta, C; Lacava, F; Lacey, J; Lacker, H; Lacour, D; Lacuesta, V R; Ladygin, E; Lafaye, R; Laforge, B; Lagouri, T; Lai, S; Lammers, S; Lampl, W; Lançon, E; Landgraf, U; Landon, M P J; Lang, V S; Lange, J C; Lankford, A J; Lanni, F; Lantzsch, K; Lanza, A; Laplace, S; Lapoire, C; Laporte, J F; Lari, T; Manghi, F Lasagni; Lassnig, M; Laurelli, P; Lavrijsen, W; Law, A T; Laycock, P; Lazovich, T; Lazzaroni, M; Dortz, O Le; Guirriec, E Le; Menedeu, E Le; Quilleuc, E P Le; LeBlanc, M; LeCompte, T; Ledroit-Guillon, F; Lee, C A; Lee, S C; Lee, L; Lefebvre, G; Lefebvre, M; Legger, F; Leggett, C; Lehan, A; Miotto, G Lehmann; Lei, X; Leight, W A; Leisos, A; Leister, A G; Leite, M A L; Leitner, R; Lellouch, D; Lemmer, B; Leney, K J C; Lenz, T; Lenzi, B; Leone, R; Leone, S; Leonidopoulos, C; Leontsinis, S; Lerner, G; Leroy, C; Lesage, A A J; Lester, C G; Levchenko, M; Levêque, J; Levin, D; Levinson, L J; Levy, M; Leyko, A M; Leyton, M; Li, B; Li, H; Li, H L; Li, L; Li, L; Li, Q; Li, S; Li, X; Li, Y; Liang, Z; Liao, H; Liberti, B; Liblong, A; Lichard, P; Lie, K; Liebal, J; Liebig, W; Limbach, C; Limosani, A; Lin, S C; Lin, T H; Lindquist, B E; Lipeles, E; Lipniacka, A; Lisovyi, M; Liss, T M; Lissauer, D; Lister, A; Litke, A M; Liu, B; Liu, D; Liu, H; Liu, H; Liu, J; Liu, J B; Liu, K; Liu, L; Liu, M; Liu, M; Liu, Y L; Liu, Y; Livan, M; Lleres, A; Merino, J Llorente; Lloyd, S L; Sterzo, F Lo; Lobodzinska, E; Loch, P; Lockman, W S; Loebinger, F K; Loevschall-Jensen, A E; Loew, K M; Loginov, A; Lohse, T; Lohwasser, K; Lokajicek, M; Long, B A; Long, J D; Long, R E; Longo, L; Looper, K A; Lopes, L; Mateos, D Lopez; Paredes, B Lopez; Paz, I Lopez; Solis, A Lopez; Lorenz, J; Martinez, N Lorenzo; Losada, M; Lösel, P J; Lou, X; Lounis, A; Love, J; Love, P A; Lu, H; Lu, N; Lubatti, H J; Luci, C; Lucotte, A; Luedtke, C; Luehring, F; Lukas, W; Luminari, L; Lundberg, O; Lund-Jensen, B; Lynn, D; Lysak, R; Lytken, E; Lyubushkin, V; Ma, H; Ma, L L; Ma, Y; Maccarrone, G; Macchiolo, A; Macdonald, C M; Maček, B; Miguens, J Machado; Madaffari, D; Madar, R; Maddocks, H J; Mader, W F; Madsen, A; Maeda, J; Maeland, S; Maeno, T; Maevskiy, A; Magradze, E; Mahlstedt, J; Maiani, C; Maidantchik, C; Maier, A A; Maier, T; Maio, A; Majewski, S; Makida, Y; Makovec, N; Malaescu, B; Malecki, Pa; Maleev, V P; Malek, F; Mallik, U; Malon, D; Malone, C; Maltezos, S; Malyshev, V M; Malyukov, S; Mamuzic, J; Mancini, G; Mandelli, B; Mandelli, L; Mandić, I; Maneira, J; Andrade Filho, L Manhaes de; Ramos, J Manjarres; Mann, A; Mansoulie, B; Mantifel, R; Mantoani, M; Manzoni, S; Mapelli, L; Marceca, G; March, L; Marchiori, G; Marcisovsky, M; Marjanovic, M; Marley, D E; Marroquim, F; Marsden, S P; Marshall, Z; Marti, L F; Marti-Garcia, S; Martin, B; Martin, T A; Martin, V J; Latour, B Martin Dit; Martinez, M; Martin-Haugh, S; Martoiu, V S; Martyniuk, A C; Marx, M; Marzano, F; Marzin, A; Masetti, L; Mashimo, T; Mashinistov, R; Masik, J; Maslennikov, A L; Massa, I; Massa, L; Mastrandrea, P; Mastroberardino, A; Masubuchi, T; Mättig, P; Mattmann, J; Maurer, J; Maxfield, S J; Maximov, D A; Mazini, R; Mazza, S M; Fadden, N C Mc; Goldrick, G Mc; Kee, S P Mc; McCarn, A; McCarthy, R L; McCarthy, T G; McClymont, L I; McFarlane, K W; Mcfayden, J A; Mchedlidze, G; McMahon, S J; McPherson, R A; Medinnis, M; Meehan, S; Mehlhase, S; Mehta, A; Meier, K; Meineck, C; Meirose, B; Garcia, B R Mellado; Meloni, F; Mengarelli, A; Menke, S; Meoni, E; Mercurio, K M; Mergelmeyer, S; Mermod, P; Merola, L; Meroni, C; Merritt, F S; Messina, A; Metcalfe, J; Mete, A S; Meyer, C; Meyer, C; Meyer, J-P; Meyer, J; Theenhausen, H Meyer Zu; Middleton, R P; Miglioranzi, S; Mijović, L; Mikenberg, G; Mikestikova, M; Mikuž, M; Milesi, M; Milic, A; Miller, D W; Mills, C; Milov, A; Milstead, D A; Minaenko, A A; Minami, Y; Minashvili, I A; Mincer, A I; Mindur, B; Mineev, M; Ming, Y; Mir, L M; Mistry, K P; Mitani, T; Mitrevski, J; Mitsou, V A; Miucci, A; Miyagawa, P S; Mjörnmark, J U; Moa, T; Mochizuki, K; Mohapatra, S; Mohr, W; Molander, S; Moles-Valls, R; Monden, R; Mondragon, M C; Mönig, K; Monk, J; Monnier, E; Montalbano, A; Berlingen, J Montejo; Monticelli, F; Monzani, S; Moore, R W; Morange, N; Moreno, D; Llácer, M Moreno; Morettini, P; Mori, D; Mori, T; Morii, M; Morinaga, M; Morisbak, V; Moritz, S; Morley, A K; Mornacchi, G; Morris, J D; Mortensen, S S; Morvaj, L; Mosidze, M; Moss, J; Motohashi, K; Mount, R; Mountricha, E; Mouraviev, S V; Moyse, E J W; Muanza, S; Mudd, R D; Mueller, F; Mueller, J; Mueller, R S P; Mueller, T; Muenstermann, D; Mullen, P; Mullier, G A; Sanchez, F J Munoz; Quijada, J A Murillo; Murray, W J; Murrone, A; Musheghyan, H; Muskinja, M; Myagkov, A G; Myska, M; Nachman, B P; Nackenhorst, O; Nadal, J; Nagai, K; Nagai, R; Nagano, K; Nagasaka, Y; Nagata, K; Nagel, M; Nagy, E; Nairz, A M; Nakahama, Y; Nakamura, K; Nakamura, T; Nakano, I; Namasivayam, H; Garcia, R F Naranjo; Narayan, R; Villar, D I Narrias; Naryshkin, I; Naumann, T; Navarro, G; Nayyar, R; Neal, H A; Nechaeva, P Yu; Neep, T J; Nef, P D; Negri, A; Negrini, M; Nektarijevic, S; Nellist, C; Nelson, A; Nemecek, S; Nemethy, P; Nepomuceno, A A; Nessi, M; Neubauer, M S; Neumann, M; Neves, R M; Nevski, P; Newman, P R; Nguyen, D H; Nickerson, R B; Nicolaidou, R; Nicquevert, B; Nielsen, J; Nikiforov, A; Nikolaenko, V; Nikolic-Audit, I; Nikolopoulos, K; Nilsen, J K; Nilsson, P; Ninomiya, Y; Nisati, A; Nisius, R; Nobe, T; Nodulman, L; Nomachi, M; Nomidis, I; Nooney, T; Norberg, S; Nordberg, M; Norjoharuddeen, N; Novgorodova, O; Nowak, S; Nozaki, M; Nozka, L; Ntekas, K; Nurse, E; Nuti, F; O'grady, F; O'Neil, D C; O'Rourke, A A; O'Shea, V; Oakham, F G; Oberlack, H; Obermann, T; Ocariz, J; Ochi, A; Ochoa, I; Ochoa-Ricoux, J P; Oda, S; Odaka, S; Ogren, H; Oh, A; Oh, S H; Ohm, C C; Ohman, H; Oide, H; Okawa, H; Okumura, Y; Okuyama, T; Olariu, A; Seabra, L F Oleiro; Pino, S A Olivares; Damazio, D Oliveira; Olszewski, A; Olszowska, J; Onofre, A; Onogi, K; Onyisi, P U E; Oram, C J; Oreglia, M J; Oren, Y; Orestano, D; Orlando, N; Orr, R S; Osculati, B; Ospanov, R; Garzon, G Otero Y; Otono, H; Ouchrif, M; Ould-Saada, F; Ouraou, A; Oussoren, K P; Ouyang, Q; Ovcharova, A; Owen, M; Owen, R E; Ozcan, V E; Ozturk, N; Pachal, K; Pages, A Pacheco; Aranda, C Padilla; Pagáčová, M; Griso, S Pagan; Paige, F; Pais, P; Pajchel, K; Palacino, G; Palestini, S; Palka, M; Pallin, D; Palma, A; Panagiotopoulou, E St; Pandini, C E; Vazquez, J G Panduro; Pani, P; Panitkin, S; Pantea, D; Paolozzi, L; Papadopoulou, Th D; Papageorgiou, K; Paramonov, A; Hernandez, D Paredes; Parker, A J; Parker, M A; Parker, K A; Parodi, F; Parsons, J A; Parzefall, U; Pascuzzi, V; Pasqualucci, E; Passaggio, S; Pastore, F; Pastore, Fr; Pásztor, G; Pataraia, S; Patel, N D; Pater, J R; Pauly, T; Pearce, J; Pearson, B; Pedersen, L E; Pedersen, M; Lopez, S Pedraza; Pedro, R; Peleganchuk, S V; Pelikan, D; Penc, O; Peng, C; Peng, H; Penwell, J; Peralva, B S; Perego, M M; Perepelitsa, D V; Codina, E Perez; Perini, L; Pernegger, H; Perrella, S; Peschke, R; Peshekhonov, V D; Peters, K; Peters, R F Y; Petersen, B A; Petersen, T C; Petit, E; Petridis, A; Petridou, C; Petroff, P; Petrolo, E; Petrov, M; Petrucci, F; Pettersson, N E; Peyaud, A; Pezoa, R; Phillips, P W; Piacquadio, G; Pianori, E; Picazio, A; Piccaro, E; Piccinini, M; Pickering, M A; Piegaia, R; Pilcher, J E; Pilkington, A D; Pin, A W J; Pina, J; Pinamonti, M; Pinfold, J L; Pingel, A; Pires, S; Pirumov, H; Pitt, M; Plazak, L; Pleier, M-A; Pleskot, V; Plotnikova, E; Plucinski, P; Pluth, D; Poettgen, R; Poggioli, L; Pohl, D; Polesello, G; Poley, A; Policicchio, A; Polifka, R; Polini, A; Pollard, C S; Polychronakos, V; Pommès, K; Pontecorvo, L; Pope, B G; Popeneciu, G A; Popovic, D S; Poppleton, A; Pospisil, S; Potamianos, K; Potrap, I N; Potter, C J; Potter, C T; Poulard, G; Poveda, J; Pozdnyakov, V; Astigarraga, M E Pozo; Pralavorio, P; Pranko, A; Prell, S; Price, D; Price, L E; Primavera, M; Prince, S; Proissl, M; Prokofiev, K; Prokoshin, F; Protopopescu, S; Proudfoot, J; Przybycien, M; Puddu, D; Puldon, D; Purohit, M; Puzo, P; Qian, J; Qin, G; Qin, Y; Quadt, A; Quayle, W B; Queitsch-Maitland, M; Quilty, D; Raddum, S; Radeka, V; Radescu, V; Radhakrishnan, S K; Radloff, P; Rados, P; Ragusa, F; Rahal, G; Raine, J A; Rajagopalan, S; Rammensee, M; Rangel-Smith, C; Ratti, M G; Rauscher, F; Rave, S; Ravenscroft, T; Raymond, M; Read, A L; Readioff, N P; Rebuzzi, D M; Redelbach, A; Redlinger, G; Reece, R; Reeves, K; Rehnisch, L; Reichert, J; Reisin, H; Rembser, C; Ren, H; Rescigno, M; Resconi, S; Rezanova, O L; Reznicek, P; Rezvani, R; Richter, R; Richter, S; Richter-Was, E; Ricken, O; Ridel, M; Rieck, P; Riegel, C J; Rieger, J; Rifki, O; Rijssenbeek, M; Rimoldi, A; Rinaldi, L; Ristić, B; Ritsch, E; Riu, I; Rizatdinova, F; Rizvi, E; Rizzi, C; Robertson, S H; Robichaud-Veronneau, A; Robinson, D; Robinson, J E M; Robson, A; Roda, C; Rodina, Y; Perez, A Rodriguez; Rodriguez, D Rodriguez; Roe, S; Rogan, C S; Røhne, O; Romaniouk, A; Romano, M; Saez, S M Romano; Adam, E Romero; Rompotis, N; Ronzani, M; Roos, L; Ros, E; Rosati, S; Rosbach, K; Rose, P; Rosenthal, O; Rossetti, V; Rossi, E; Rossi, L P; Rosten, J H N; Rosten, R; Rotaru, M; Roth, I; Rothberg, J; Rousseau, D; Royon, C R; Rozanov, A; Rozen, Y; Ruan, X; Rubbo, F; Rubinskiy, I; Rud, V I; Rudolph, M S; Rühr, F; Ruiz-Martinez, A; Rurikova, Z; Rusakovich, N A; Ruschke, A; Russell, H L; Rutherfoord, J P; Ruthmann, N; Ryabov, Y F; Rybar, M; Rybkin, G; Ryu, S; Ryzhov, A; Saavedra, A F; Sabato, G; Sacerdoti, S; Sadrozinski, H F-W; Sadykov, R; Tehrani, F Safai; Saha, P; Sahinsoy, M; Saimpert, M; Saito, T; Sakamoto, H; Sakurai, Y; Salamanna, G; Salamon, A; Loyola, J E Salazar; Salek, D; De Bruin, P H Sales; Salihagic, D; Salnikov, A; Salt, J; Salvatore, D; Salvatore, F; Salvucci, A; Salzburger, A; Sammel, D; Sampsonidis, D; Sanchez, A; Sánchez, J; Martinez, V Sanchez; Sandaker, H; Sandbach, R L; Sander, H G; Sanders, M P; Sandhoff, M; Sandoval, C; Sandstroem, R; Sankey, D P C; Sannino, M; Sansoni, A; Santoni, C; Santonico, R; Santos, H; Castillo, I Santoyo; Sapp, K; Sapronov, A; Saraiva, J G; Sarrazin, B; Sasaki, O; Sasaki, Y; Sato, K; Sauvage, G; Sauvan, E; Savage, G; Savard, P; Sawyer, C; Sawyer, L; Saxon, J; Sbarra, C; Sbrizzi, A; Scanlon, T; Scannicchio, D A; Scarcella, M; Scarfone, V; Schaarschmidt, J; Schacht, P; Schaefer, D; Schaefer, R; Schaeffer, J; Schaepe, S; Schaetzel, S; Schäfer, U; Schaffer, A C; Schaile, D; Schamberger, R D; Scharf, V; Schegelsky, V A; Scheirich, D; Schernau, M; Schiavi, C; Schillo, C; Schioppa, M; Schlenker, S; Schmieden, K; Schmitt, C; Schmitt, S; Schmitz, S; Schneider, B; Schnellbach, Y J; Schnoor, U; Schoeffel, L; Schoening, A; Schoenrock, B D; Schopf, E; Schorlemmer, A L S; Schott, M; Schovancova, J; Schramm, S; Schreyer, M; Schuh, N; Schultens, M J; Schultz-Coulon, H-C; Schulz, H; Schumacher, M; Schumm, B A; Schune, Ph; Schwanenberger, C; Schwartzman, A; Schwarz, T A; Schwegler, Ph; Schweiger, H; Schwemling, Ph; Schwienhorst, R; Schwindling, J; Schwindt, T; Sciolla, G; Scuri, F; Scutti, F; Searcy, J; Seema, P; Seidel, S C; Seiden, A; Seifert, F; Seixas, J M; Sekhniaidze, G; Sekhon, K; Sekula, S J; Seliverstov, D M; Semprini-Cesari, N; Serfon, C; Serin, L; Serkin, L; Sessa, M; Seuster, R; Severini, H; Sfiligoj, T; Sforza, F; Sfyrla, A; Shabalina, E; Shaikh, N W; Shan, L Y; Shang, R; Shank, J T; Shapiro, M; Shatalov, P B; Shaw, K; Shaw, S M; Shcherbakova, A; Shehu, C Y; Sherwood, P; Shi, L; Shimizu, S; Shimmin, C O; Shimojima, M; Shiyakova, M; Shmeleva, A; Saadi, D Shoaleh; Shochet, M J; Shojaii, S; Shrestha, S; Shulga, E; Shupe, M A; Sicho, P; Sidebo, P E; Sidiropoulou, O; Sidorov, D; Sidoti, A; Siegert, F; Sijacki, Dj; Silva, J; Silverstein, S B; Simak, V; Simard, O; Simic, Lj; Simion, S; Simioni, E; Simmons, B; Simon, D; Simon, M; Sinervo, P; Sinev, N B; Sioli, M; Siragusa, G; Sivoklokov, S Yu; Sjölin, J; Sjursen, T B; Skinner, M B; Skottowe, H P; Skubic, P; Slater, M; Slavicek, T; Slawinska, M; Sliwa, K; Slovak, R; Smakhtin, V; Smart, B H; Smestad, L; Smirnov, S Yu; Smirnov, Y; Smirnova, L N; Smirnova, O; Smith, M N K; Smith, R W; Smizanska, M; Smolek, K; Snesarev, A A; Snidero, G; Snyder, S; Sobie, R; Socher, F; Soffer, A; Soh, D A; Sokhrannyi, G; Sanchez, C A Solans; Solar, M; Soldatov, E Yu; Soldevila, U; Solodkov, A A; Soloshenko, A; Solovyanov, O V; Solovyev, V; Sommer, P; Son, H; Song, H Y; Sood, A; Sopczak, A; Sopko, V; Sorin, V; Sosa, D; Sotiropoulou, C L; Soualah, R; Soukharev, A M; South, D; Sowden, B C; Spagnolo, S; Spalla, M; Spangenberg, M; Spanò, F; Sperlich, D; Spettel, F; Spighi, R; Spigo, G; Spiller, L A; Spousta, M; Denis, R D St; Stabile, A; Staerz, S; Stahlman, J; Stamen, R; Stamm, S; Stanecka, E; Stanek, R W; Stanescu, C; Stanescu-Bellu, M; Stanitzki, M M; Stapnes, S; Starchenko, E A; Stark, G H; Stark, J; Staroba, P; Starovoitov, P; Staszewski, R; Steinberg, P; Stelzer, B; Stelzer, H J; Stelzer-Chilton, O; Stenzel, H; Stewart, G A; Stillings, J A; Stockton, M C; Stoebe, M; Stoicea, G; Stolte, P; Stonjek, S; Stradling, A R; Straessner, A; Stramaglia, M E; Strandberg, J; Strandberg, S; Strandlie, A; Strauss, M; Strizenec, P; Ströhmer, R; Strom, D M; Stroynowski, R; Strubig, A; Stucci, S A; Stugu, B; Styles, N A; Su, D; Su, J; Subramaniam, R; Suchek, S; Sugaya, Y; Suk, M; Sulin, V V; Sultansoy, S; Sumida, T; Sun, S; Sun, X; Sundermann, J E; Suruliz, K; Susinno, G; Sutton, M R; Suzuki, S; Svatos, M; Swiatlowski, M; Sykora, I; Sykora, T; Ta, D; Taccini, C; Tackmann, K; Taenzer, J; Taffard, A; Tafirout, R; Taiblum, N; Takai, H; Takashima, R; Takeda, H; Takeshita, T; Takubo, Y; Talby, M; Talyshev, A A; Tam, J Y C; Tan, K G; Tanaka, J; Tanaka, R; Tanaka, S; Tannenwald, B B; Araya, S Tapia; Tapprogge, S; Tarem, S; Tartarelli, G F; Tas, P; Tasevsky, M; Tashiro, T; Tassi, E; Delgado, A Tavares; Tayalati, Y; Taylor, A C; Taylor, G N; Taylor, P T E; Taylor, W; Teischinger, F A; Teixeira-Dias, P; Temming, K K; Temple, D; Kate, H Ten; Teng, P K; Teoh, J J; Tepel, F; Terada, S; Terashi, K; Terron, J; Terzo, S; Testa, M; Teuscher, R J; Theveneaux-Pelzer, T; Thomas, J P; Thomas-Wilsker, J; Thompson, E N; Thompson, P D; Thompson, R J; Thompson, A S; Thomsen, L A; Thomson, E; Thomson, M; Tibbetts, M J; Torres, R E Ticse; Tikhomirov, V O; Tikhonov, Yu A; Timoshenko, S; Tipton, P; Tisserant, S; Todome, K; Todorov, T; Todorova-Nova, S; Tojo, J; Tokár, S; Tokushuku, K; Tolley, E; Tomlinson, L; Tomoto, M; Tompkins, L; Toms, K; Tong, B; Torrence, E; Torres, H; Pastor, E Torró; Toth, J; Touchard, F; Tovey, D R; Trefzger, T; Tremblet, L; Tricoli, A; Trigger, I M; Trincaz-Duvoid, S; Tripiana, M F; Trischuk, W; Trocmé, B; Trofymov, A; Troncon, C; Trottier-McDonald, M; Trovatelli, M; Truong, L; Trzebinski, M; Trzupek, A; Tseng, J C-L; Tsiareshka, P V; Tsipolitis, G; Tsirintanis, N; Tsiskaridze, S; Tsiskaridze, V; Tskhadadze, E G; Tsui, K M; Tsukerman, I I; Tsulaia, V; Tsuno, S; Tsybychev, D; Tudorache, A; Tudorache, V; Tuna, A N; Tupputi, S A; Turchikhin, S; Turecek, D; Turgeman, D; Turra, R; Turvey, A J; Tuts, P M; Tyndel, M; Ucchielli, G; Ueda, I; Ueno, R; Ughetto, M; Ukegawa, F; Unal, G; Undrus, A; Unel, G; Ungaro, F C; Unno, Y; Unverdorben, C; Urban, J; Urquijo, P; Urrejola, P; Usai, G; Usanova, A; Vacavant, L; Vacek, V; Vachon, B; Valderanis, C; Santurio, E Valdes; Valencic, N; Valentinetti, S; Valero, A; Valery, L; Valkar, S; Vallecorsa, S; Ferrer, J A Valls; Van Den Wollenberg, W; Van Der Deijl, P C; van der Geer, R; van der Graaf, H; van Eldik, N; van Gemmeren, P; Van Nieuwkoop, J; van Vulpen, I; van Woerden, M C; Vanadia, M; Vandelli, W; Vanguri, R; Vaniachine, A; Vankov, P; Vardanyan, G; Vari, R; Varnes, E W; Varol, T; Varouchas, D; Vartapetian, A; Varvell, K E; Vasquez, J G; Vazeille, F; Schroeder, T Vazquez; Veatch, J; Veloce, L M; Veloso, F; Veneziano, S; Ventura, A; Venturi, M; Venturi, N; Venturini, A; Vercesi, V; Verducci, M; Verkerke, W; Vermeulen, J C; Vest, A; Vetterli, M C; Viazlo, O; Vichou, I; Vickey, T; Boeriu, O E Vickey; Viehhauser, G H A; Viel, S; Vigani, L; Vigne, R; Villa, M; Perez, M Villaplana; Vilucchi, E; Vincter, M G; Vinogradov, V B; Vittori, C; Vivarelli, I; Vlachos, S; Vlasak, M; Vogel, M; Vokac, P; Volpi, G; Volpi, M; von der Schmitt, H; von Toerne, E; Vorobel, V; Vorobev, K; Vos, M; Voss, R; Vossebeld, J H; Vranjes, N; Milosavljevic, M Vranjes; Vrba, V; Vreeswijk, M; Vuillermet, R; Vukotic, I; Vykydal, Z; Wagner, P; Wagner, W; Wahlberg, H; Wahrmund, S; Wakabayashi, J; Walder, J; Walker, R; Walkowiak, W; Wallangen, V; Wang, C; Wang, C; Wang, F; Wang, H; Wang, H; Wang, J; Wang, J; Wang, K; Wang, R; Wang, S M; Wang, T; Wang, T; Wang, X; Wanotayaroj, C; Warburton, A; Ward, C P; Wardrope, D R; Washbrook, A; Watkins, P M; Watson, A T; Watson, I J; Watson, M F; Watts, G; Watts, S; Waugh, B M; Webb, S; Weber, M S; Weber, S W; Webster, J S; Weidberg, A R; Weinert, B; Weingarten, J; Weiser, C; Weits, H; Wells, P S; Wenaus, T; Wengler, T; Wenig, S; Wermes, N; Werner, M; Werner, P; Wessels, M; Wetter, J; Whalen, K; Whallon, N L; Wharton, A M; White, A; White, M J; White, R; White, S; Whiteson, D; Wickens, F J; Wiedenmann, W; Wielers, M; Wienemann, P; Wiglesworth, C; Wiik-Fuchs, L A M; Wildauer, A; Wilk, F; Wilkens, H G; Williams, H H; Williams, S; Willis, C; Willocq, S; Wilson, J A; Wingerter-Seez, I; Winklmeier, F; Winston, O J; Winter, B T; Wittgen, M; Wittkowski, J; Wollstadt, S J; Wolter, M W; Wolters, H; Wosiek, B K; Wotschack, J; Woudstra, M J; Wozniak, K W; Wu, M; Wu, M; Wu, S L; Wu, X; Wu, Y; Wyatt, T R; Wynne, B M; Xella, S; Xu, D; Xu, L; Yabsley, B; Yacoob, S; Yakabe, R; Yamaguchi, D; Yamaguchi, Y; Yamamoto, A; Yamamoto, S; Yamanaka, T; Yamauchi, K; Yamazaki, Y; Yan, Z; Yang, H; Yang, H; Yang, Y; Yang, Z; Yao, W-M; Yap, Y C; Yasu, Y; Yatsenko, E; Wong, K H Yau; Ye, J; Ye, S; Yeletskikh, I; Yen, A L; Yildirim, E; Yorita, K; Yoshida, R; Yoshihara, K; Young, C; Young, C J S; Youssef, S; Yu, D R; Yu, J; Yu, J M; Yu, J; Yuan, L; Yuen, S P Y; Yusuff, I; Zabinski, B; Zaidan, R; Zaitsev, A M; Zakharchuk, N; Zalieckas, J; Zaman, A; Zambito, S; Zanello, L; Zanzi, D; Zeitnitz, C; Zeman, M; Zemla, A; Zeng, J C; Zeng, Q; Zengel, K; Zenin, O; Ženiš, T; Zerwas, D; Zhang, D; Zhang, F; Zhang, G; Zhang, H; Zhang, J; Zhang, L; Zhang, R; Zhang, R; Zhang, X; Zhang, Z; Zhao, X; Zhao, Y; Zhao, Z; Zhemchugov, A; Zhong, J; Zhou, B; Zhou, C; Zhou, L; Zhou, L; Zhou, M; Zhou, N; Zhu, C G; Zhu, H; Zhu, J; Zhu, Y; Zhuang, X; Zhukov, K; Zibell, A; Zieminska, D; Zimine, N I; Zimmermann, C; Zimmermann, S; Zinonos, Z; Zinser, M; Ziolkowski, M; Živković, L; Zobernig, G; Zoccoli, A; Nedden, M Zur; Zurzolo, G; Zwalinski, L
2016-01-01
A test of CP invariance in Higgs boson production via vector-boson fusion using the method of the Optimal Observable is presented. The analysis exploits the decay mode of the Higgs boson into a pair of [Formula: see text] leptons and is based on 20.3 [Formula: see text] of proton-proton collision data at [Formula: see text] = 8 [Formula: see text] collected by the ATLAS experiment at the LHC. Contributions from CP-violating interactions between the Higgs boson and electroweak gauge bosons are described in an effective field theory framework, in which the strength of CP violation is governed by a single parameter [Formula: see text]. The mean values and distributions of CP-odd observables agree with the expectation in the Standard Model and show no sign of CP violation. The CP-mixing parameter [Formula: see text] is constrained to the interval [Formula: see text] at 68% confidence level, consistent with the Standard Model expectation of [Formula: see text].
NASA Astrophysics Data System (ADS)
Aad, G.; Abbott, B.; Abdinov, O.; Abdallah, J.; Abeloos, B.; Aben, R.; Abolins, M.; Aben, R.; Abolins, M.; AbouZeid, O. S.; Abraham, N. L.; Abramowicz, H.; Abreu, H.; Abreu, R.; Abulaiti, Y.; Acharya, B. S.; Adamczyk, L.; Adams, D. L.; Adelman, J.; Adomeit, S.; Adye, T.; Affolder, A. A.; Agatonovic-Jovin, T.; Agricola, J.; Aguilar-Saavedra, J. A.; Ahlen, S. P.; Ahmadov, F.; Aielli, G.; Akerstedt, H.; Åkesson, T. P. A.; Akimov, A. V.; Alberghi, G. L.; Albert, J.; Albrand, S.; Verzini, M. J. Alconada; Aleksa, M.; Aleksandrov, I. N.; Alexa, C.; Alexander, G.; Alexopoulos, T.; Alhroob, M.; Alimonti, G.; Alison, J.; Alkire, S. P.; Allbrooke, B. M. M.; Allen, B. W.; Allport, P. P.; Aloisio, A.; Alonso, A.; Alonso, F.; Alpigiani, C.; Gonzalez, B. Alvarez; Piqueras, D. Álvarez; Alviggi, M. G.; Amadio, B. T.; Amako, K.; Coutinho, Y. Amaral; Amelung, C.; Amidei, D.; Santos, S. P. Amor Dos; Amorim, A.; Amoroso, S.; Amram, N.; Amundsen, G.; Anastopoulos, C.; Ancu, L. S.; Andari, N.; Andeen, T.; Anders, C. F.; Anders, G.; Anders, J. K.; Anderson, K. J.; Andreazza, A.; Andrei, V.; Angelidakis, S.; Angelozzi, I.; Anger, P.; Angerami, A.; Anghinolfi, F.; Anisenkov, A. V.; Anjos, N.; Annovi, A.; Antonelli, M.; Antonov, A.; Antos, J.; Anulli, F.; Aoki, M.; Bella, L. Aperio; Arabidze, G.; Arai, Y.; Araque, J. P.; Arce, A. T. H.; Arduh, F. A.; Arguin, J.-F.; Argyropoulos, S.; Arik, M.; Armbruster, A. J.; Armitage, L. J.; Arnaez, O.; Arnold, H.; Arratia, M.; Arslan, O.; Artamonov, A.; Artoni, G.; Artz, S.; Asai, S.; Asbah, N.; Ashkenazi, A.; Åsman, B.; Asquith, L.; Assamagan, K.; Astalos, R.; Atkinson, M.; Atlay, N. B.; Augsten, K.; Avolio, G.; Axen, B.; Ayoub, M. K.; Azuelos, G.; Baak, M. A.; Baas, A. E.; Baca, M. J.; Bachacou, H.; Bachas, K.; Backes, M.; Backhaus, M.; Bagiacchi, P.; Bagnaia, P.; Bai, Y.; Baines, J. T.; Baker, O. K.; Baldin, E. M.; Balek, P.; Balestri, T.; Balli, F.; Balunas, W. K.; Banas, E.; Banerjee, Sw.; Bannoura, A. A. E.; Barak, L.; Barberio, E. L.; Barberis, D.; Barbero, M.; Barillari, T.; Barisonzi, M.; Barklow, T.; Barlow, N.; Barnes, S. L.; Barnett, B. M.; Barnett, R. M.; Barnovska, Z.; Baroncelli, A.; Barone, G.; Barr, A. J.; Navarro, L. Barranco; Barreiro, F.; da Costa, J. Barreiro Guimarães; Bartoldus, R.; Barton, A. E.; Bartos, P.; Basalaev, A.; Bassalat, A.; Basye, A.; Bates, R. L.; Batista, S. J.; Batley, J. R.; Battaglia, M.; Bauce, M.; Bauer, F.; Bawa, H. S.; Beacham, J. B.; Beattie, M. D.; Beau, T.; Beauchemin, P. H.; Bechtle, P.; Beck, H. P.; Becker, K.; Becker, M.; Beckingham, M.; Becot, C.; Beddall, A. J.; Beddall, A.; Bednyakov, V. A.; Bedognetti, M.; Bee, C. P.; Beemster, L. J.; Beermann, T. A.; Begel, M.; Behr, J. K.; Belanger-Champagne, C.; Bell, A. S.; Bell, W. H.; Bella, G.; Bellagamba, L.; Bellerive, A.; Bellomo, M.; Belotskiy, K.; Beltramello, O.; Belyaev, N. L.; Benary, O.; Benchekroun, D.; Bender, M.; Bendtz, K.; Benekos, N.; Benhammou, Y.; Noccioli, E. Benhar; Benitez, J.; Garcia, J. A. Benitez; Benjamin, D. P.; Bensinger, J. R.; Bentvelsen, S.; Beresford, L.; Beretta, M.; Berge, D.; Kuutmann, E. Bergeaas; Berger, N.; Berghaus, F.; Beringer, J.; Berlendis, S.; Bernard, N. R.; Bernius, C.; Bernlochner, F. U.; Berry, T.; Berta, P.; Bertella, C.; Bertoli, G.; Bertolucci, F.; Bertram, I. A.; Bertsche, C.; Bertsche, D.; Besjes, G. J.; Bylund, O. Bessidskaia; Bessner, M.; Besson, N.; Betancourt, C.; Bethke, S.; Bevan, A. J.; Bhimji, W.; Bianchi, R. M.; Bianchini, L.; Bianco, M.; Biebel, O.; Biedermann, D.; Bielski, R.; Biesuz, N. V.; Biglietti, M.; De Mendizabal, J. Bilbao; Bilokon, H.; Bindi, M.; Binet, S.; Bingul, A.; Bini, C.; Biondi, S.; Bjergaard, D. M.; Black, C. W.; Black, J. E.; Black, K. M.; Blackburn, D.; Blair, R. E.; Blanchard, J.-B.; Blanco, J. E.; Blazek, T.; Bloch, I.; Blocker, C.; Blum, W.; Blumenschein, U.; Blunier, S.; Bobbink, G. J.; Bobrovnikov, V. S.; Bocchetta, S. S.; Bocci, A.; Bock, C.; Boehler, M.; Boerner, D.; Bogaerts, J. A.; Bogavac, D.; Bogdanchikov, A. G.; Bohm, C.; Boisvert, V.; Bold, T.; Boldea, V.; Boldyrev, A. S.; Bomben, M.; Bona, M.; Boonekamp, M.; Borisov, A.; Borissov, G.; Bortfeldt, J.; Bortoletto, D.; Bortolotto, V.; Bos, K.; Boscherini, D.; Bosman, M.; Sola, J. D. Bossio; Boudreau, J.; Bouffard, J.; Bouhova-Thacker, E. V.; Boumediene, D.; Bourdarios, C.; Boutle, S. K.; Boveia, A.; Boyd, J.; Boyko, I. R.; Bracinik, J.; Brandt, A.; Brandt, G.; Brandt, O.; Bratzler, U.; Brau, B.; Brau, J. E.; Braun, H. M.; Madden, W. D. Breaden; Brendlinger, K.; Brennan, A. J.; Brenner, L.; Brenner, R.; Bressler, S.; Bristow, T. M.; Britton, D.; Britzger, D.; Brochu, F. M.; Brock, I.; Brock, R.; Brooijmans, G.; Brooks, T.; Brooks, W. K.; Brosamer, J.; Brost, E.; Broughton, J. H.; de Renstrom, P. A. Bruckman; Bruncko, D.; Bruneliere, R.; Bruni, A.; Bruni, G.; Brunt, B. H.; Bruschi, M.; Bruscino, N.; Bryant, P.; Bryngemark, L.; Buanes, T.; Buat, Q.; Buchholz, P.; Buckley, A. G.; Budagov, I. A.; Buehrer, F.; Bugge, M. K.; Bulekov, O.; Bullock, D.; Burckhart, H.; Burdin, S.; Burgard, C. D.; Burghgrave, B.; Burka, K.; Burke, S.; Burmeister, I.; Busato, E.; Büscher, D.; Büscher, V.; Bussey, P.; Butler, J. M.; Butt, A. I.; Buttar, C. M.; Butterworth, J. M.; Butti, P.; Buttinger, W.; Buzatu, A.; Buzykaev, A. R.; Urbán, S. Cabrera; Caforio, D.; Cairo, V. M.; Cakir, O.; Calace, N.; Calafiura, P.; Calandri, A.; Calderini, G.; Calfayan, P.; Caloba, L. P.; Calvet, D.; Calvet, S.; Calvet, T. P.; Toro, R. Camacho; Camarda, S.; Camarri, P.; Cameron, D.; Armadans, R. Caminal; Camincher, C.; Campana, S.; Campanelli, M.; Campoverde, A.; Canale, V.; Canepa, A.; Bret, M. Cano; Cantero, J.; Cantrill, R.; Cao, T.; Garrido, M. D. M. Capeans; Caprini, I.; Caprini, M.; Capua, M.; Caputo, R.; Carbone, R. M.; Cardarelli, R.; Cardillo, F.; Carli, T.; Carlino, G.; Carminati, L.; Caron, S.; Carquin, E.; Carrillo-Montoya, G. D.; Carter, J. R.; Carvalho, J.; Casadei, D.; Casado, M. P.; Casolino, M.; Casper, D. W.; Castaneda-Miranda, E.; Castelli, A.; Gimenez, V. Castillo; Castro, N. F.; Catinaccio, A.; Catmore, J. R.; Cattai, A.; Caudron, J.; Cavaliere, V.; Cavallaro, E.; Cavalli, D.; Cavalli-Sforza, M.; Cavasinni, V.; Ceradini, F.; Alberich, L. Cerda; Cerio, B. C.; Cerqueira, A. S.; Cerri, A.; Cerrito, L.; Cerutti, F.; Cerv, M.; Cervelli, A.; Cetin, S. A.; Chafaq, A.; Chakraborty, D.; Chalupkova, I.; Chan, S. K.; Chan, Y. L.; Chang, P.; Chapman, J. D.; Charlton, D. G.; Chatterjee, A.; Chau, C. C.; Barajas, C. A. Chavez; Che, S.; Cheatham, S.; Chegwidden, A.; Chekanov, S.; Chekulaev, S. V.; Chelkov, G. A.; Chelstowska, M. A.; Chen, C.; Chen, H.; Chen, K.; Chen, S.; Chen, S.; Chen, X.; Chen, Y.; Cheng, H. C.; Cheng, H. J.; Cheng, Y.; Cheplakov, A.; Cheremushkina, E.; Moursli, R. Cherkaoui El; Chernyatin, V.; Cheu, E.; Chevalier, L.; Chiarella, V.; Chiarelli, G.; Chiodini, G.; Chisholm, A. S.; Chitan, A.; Chizhov, M. V.; Choi, K.; Chomont, A. R.; Chouridou, S.; Chow, B. K. B.; Christodoulou, V.; Chromek-Burckhart, D.; Chudoba, J.; Chuinard, A. J.; Chwastowski, J. J.; Chytka, L.; Ciapetti, G.; Ciftci, A. K.; Cinca, D.; Cindro, V.; Cioara, I. A.; Ciocio, A.; Cirotto, F.; Citron, Z. H.; Ciubancan, M.; Clark, A.; Clark, B. L.; Clark, P. J.; Clarke, R. N.; Clement, C.; Coadou, Y.; Cobal, M.; Coccaro, A.; Cochran, J.; Coffey, L.; Colasurdo, L.; Cole, B.; Cole, S.; Colijn, A. P.; Collot, J.; Colombo, T.; Compostella, G.; Muiño, P. Conde; Coniavitis, E.; Connell, S. H.; Connelly, I. A.; Consorti, V.; Constantinescu, S.; Conta, C.; Conti, G.; Conventi, F.; Cooke, M.; Cooper, B. D.; Cooper-Sarkar, A. M.; Cornelissen, T.; Corradi, M.; Corriveau, F.; Corso-Radu, A.; Cortes-Gonzalez, A.; Cortiana, G.; Costa, G.; Costa, M. J.; Costanzo, D.; Cottin, G.; Cowan, G.; Cox, B. E.; Cranmer, K.; Crawley, S. J.; Cree, G.; Crépé-Renaudin, S.; Crescioli, F.; Cribbs, W. A.; Ortuzar, M. Crispin; Cristinziani, M.; Croft, V.; Crosetti, G.; Donszelmann, T. Cuhadar; Cummings, J.; Curatolo, M.; Cúth, J.; Cuthbert, C.; Czirr, H.; Czodrowski, P.; D'Auria, S.; D'Onofrio, M.; De Sousa, M. J. Da Cunha Sargedas; Via, C. Da; Dabrowski, W.; Dai, T.; Dale, O.; Dallaire, F.; Dallapiccola, C.; Dam, M.; Dandoy, J. R.; Dang, N. P.; Daniells, A. C.; Dann, N. S.; Danninger, M.; Hoffmann, M. Dano; Dao, V.; Darbo, G.; Darmora, S.; Dassoulas, J.; Dattagupta, A.; Davey, W.; David, C.; Davidek, T.; Davies, M.; Davison, P.; Davygora, Y.; Dawe, E.; Dawson, I.; Daya-Ishmukhametova, R. K.; De, K.; de Asmundis, R.; De Benedetti, A.; De Castro, S.; De Cecco, S.; De Groot, N.; de Jong, P.; De la Torre, H.; De Lorenzi, F.; De Pedis, D.; De Salvo, A.; De Sanctis, U.; De Santo, A.; De Regie, J. B. De Vivie; Dearnaley, W. J.; Debbe, R.; Debenedetti, C.; Dedovich, D. V.; Deigaard, I.; Del Peso, J.; Del Prete, T.; Delgove, D.; Deliot, F.; Delitzsch, C. M.; Deliyergiyev, M.; Dell'Acqua, A.; Dell'Asta, L.; Dell'Orso, M.; Della Pietra, M.; della Volpe, D.; Delmastro, M.; Delsart, P. A.; Deluca, C.; DeMarco, D. A.; Demers, S.; Demichev, M.; Demilly, A.; Denisov, S. P.; Denysiuk, D.; Derendarz, D.; Derkaoui, J. E.; Derue, F.; Dervan, P.; Desch, K.; Deterre, C.; Dette, K.; Deviveiros, P. O.; Dewhurst, A.; Dhaliwal, S.; Di Ciaccio, A.; Di Ciaccio, L.; Di Clemente, W. K.; Di Domenico, A.; Di Donato, C.; Di Girolamo, A.; Di Girolamo, B.; Di Mattia, A.; Di Micco, B.; Di Nardo, R.; Di Simone, A.; Di Sipio, R.; Di Valentino, D.; Diaconu, C.; Diamond, M.; Dias, F. A.; Diaz, M. A.; Diehl, E. B.; Dietrich, J.; Diglio, S.; Dimitrievska, A.; Dingfelder, J.; Dita, P.; Dita, S.; Dittus, F.; Djama, F.; Djobava, T.; Djuvsland, J. I.; do Vale, M. A. B.; Dobos, D.; Dobre, M.; Doglioni, C.; Dohmae, T.; Dolejsi, J.; Dolezal, Z.; Dolgoshein, B. A.; Donadelli, M.; Donati, S.; Dondero, P.; Donini, J.; Dopke, J.; Doria, A.; Dova, M. T.; Doyle, A. T.; Drechsler, E.; Dris, M.; Du, Y.; Duarte-Campderros, J.; Duchovni, E.; Duckeck, G.; Ducu, O. A.; Duda, D.; Dudarev, A.; Duflot, L.; Duguid, L.; Dührssen, M.; Dunford, M.; Yildiz, H. Duran; Düren, M.; Durglishvili, A.; Duschinger, D.; Dutta, B.; Dyndal, M.; Eckardt, C.; Ecker, K. M.; Edgar, R. C.; Edson, W.; Edwards, N. C.; Eifert, T.; Eigen, G.; Einsweiler, K.; Ekelof, T.; Kacimi, M. El; Ellajosyula, V.; Ellert, M.; Elles, S.; Ellinghaus, F.; Elliot, A. A.; Ellis, N.; Elmsheuser, J.; Elsing, M.; Emeliyanov, D.; Enari, Y.; Endner, O. C.; Endo, M.; Ennis, J. S.; Erdmann, J.; Ereditato, A.; Ernis, G.; Ernst, J.; Ernst, M.; Errede, S.; Ertel, E.; Escalier, M.; Esch, H.; Escobar, C.; Esposito, B.; Etienvre, A. I.; Etzion, E.; Evans, H.; Ezhilov, A.; Fabbri, F.; Fabbri, L.; Facini, G.; Fakhrutdinov, R. M.; Falciano, S.; Falla, R. J.; Faltova, J.; Fang, Y.; Fanti, M.; Farbin, A.; Farilla, A.; Farina, C.; Farooque, T.; Farrell, S.; Farrington, S. M.; Farthouat, P.; Fassi, F.; Fassnacht, P.; Fassouliotis, D.; Giannelli, M. Faucci; Favareto, A.; Fawcett, W. J.; Fayard, L.; Fedin, O. L.; Fedorko, W.; Feigl, S.; Feligioni, L.; Feng, C.; Feng, E. J.; Feng, H.; Fenyuk, A. B.; Feremenga, L.; Martinez, P. Fernandez; Perez, S. Fernandez; Ferrando, J.; Ferrari, A.; Ferrari, P.; Ferrari, R.; de Lima, D. E. Ferreira; Ferrer, A.; Ferrere, D.; Ferretti, C.; Parodi, A. Ferretto; Fiedler, F.; Filipčič, A.; Filipuzzi, M.; Filthaut, F.; Fincke-Keeler, M.; Finelli, K. D.; Fiolhais, M. C. N.; Fiorini, L.; Firan, A.; Fischer, A.; Fischer, C.; Fischer, J.; Fisher, W. C.; Flaschel, N.; Fleck, I.; Fleischmann, P.; Fletcher, G. T.; Fletcher, G.; Fletcher, R. R. M.; Flick, T.; Floderus, A.; Castillo, L. R. Flores; Flowerdew, M. J.; Forcolin, G. T.; Formica, A.; Forti, A.; Foster, A. G.; Fournier, D.; Fox, H.; Fracchia, S.; Francavilla, P.; Franchini, M.; Francis, D.; Franconi, L.; Franklin, M.; Frate, M.; Fraternali, M.; Freeborn, D.; Fressard-Batraneanu, S. M.; Friedrich, F.; Froidevaux, D.; Frost, J. A.; Fukunaga, C.; Torregrosa, E. Fullana; Fusayasu, T.; Fuster, J.; Gabaldon, C.; Gabizon, O.; Gabrielli, A.; Gabrielli, A.; Gach, G. P.; Gadatsch, S.; Gadomski, S.; Gagliardi, G.; Gagnon, L. G.; Gagnon, P.; Galea, C.; Galhardo, B.; Gallas, E. J.; Gallop, B. J.; Gallus, P.; Galster, G.; Gan, K. K.; Gao, J.; Gao, Y.; Gao, Y. S.; Walls, F. M. Garay; García, C.; Navarro, J. E. García; Garcia-Sciveres, M.; Gardner, R. W.; Garelli, N.; Garonne, V.; Bravo, A. Gascon; Gatti, C.; Gaudiello, A.; Gaudio, G.; Gaur, B.; Gauthier, L.; Gavrilenko, I. L.; Gay, C.; Gaycken, G.; Gazis, E. N.; Gecse, Z.; Gee, C. N. P.; Geich-Gimbel, Ch.; Geisler, M. P.; Gemme, C.; Genest, M. H.; Geng, C.; Gentile, S.; George, S.; Gerbaudo, D.; Gershon, A.; Ghasemi, S.; Ghazlane, H.; Ghneimat, M.; Giacobbe, B.; Giagu, S.; Giannetti, P.; Gibbard, B.; Gibson, S. M.; Gignac, M.; Gilchriese, M.; Gillam, T. P. S.; Gillberg, D.; Gilles, G.; Gingrich, D. M.; Giokaris, N.; Giordani, M. P.; Giorgi, F. M.; Giorgi, F. M.; Giraud, P. F.; Giromini, P.; Giugni, D.; Giuli, F.; Giuliani, C.; Giulini, M.; Gjelsten, B. K.; Gkaitatzis, S.; Gkialas, I.; Gkougkousis, E. L.; Gladilin, L. K.; Glasman, C.; Glatzer, J.; Glaysher, P. C. F.; Glazov, A.; Goblirsch-Kolb, M.; Godlewski, J.; Goldfarb, S.; Golling, T.; Golubkov, D.; Gomes, A.; Gonçalo, R.; Costa, J. Goncalves Pinto Firmino Da; Gonella, L.; Gongadze, A.; de la Hoz, S. González; Parra, G. Gonzalez; Gonzalez-Sevilla, S.; Goossens, L.; Gorbounov, P. A.; Gordon, H. A.; Gorelov, I.; Gorini, B.; Gorini, E.; Gorišek, A.; Gornicki, E.; Goshaw, A. T.; Gössling, C.; Gostkin, M. I.; Goudet, C. R.; Goujdami, D.; Goussiou, A. G.; Govender, N.; Gozani, E.; Graber, L.; Grabowska-Bold, I.; Gradin, P. O. J.; Grafström, P.; Gramling, J.; Gramstad, E.; Grancagnolo, S.; Gratchev, V.; Gray, H. M.; Graziani, E.; Greenwood, Z. D.; Grefe, C.; Gregersen, K.; Gregor, I. M.; Grenier, P.; Grevtsov, K.; Griffiths, J.; Grillo, A. A.; Grimm, K.; Grinstein, S.; Gris, Ph.; Grivaz, J.-F.; Groh, S.; Grohs, J. P.; Gross, E.; Grosse-Knetter, J.; Grossi, G. C.; Grout, Z. J.; Guan, L.; Guan, W.; Guenther, J.; Guescini, F.; Guest, D.; Gueta, O.; Guido, E.; Guillemin, T.; Guindon, S.; Gul, U.; Gumpert, C.; Guo, J.; Guo, Y.; Gupta, S.; Gustavino, G.; Gutierrez, P.; Ortiz, N. G. Gutierrez; Gutschow, C.; Guyot, C.; Gwenlan, C.; Gwilliam, C. B.; Haas, A.; Haber, C.; Hadavand, H. K.; Haddad, N.; Hadef, A.; Haefner, P.; Hageböck, S.; Hajduk, Z.; Hakobyan, H.; Haleem, M.; Haley, J.; Hall, D.; Halladjian, G.; Hallewell, G. D.; Hamacher, K.; Hamal, P.; Hamano, K.; Hamilton, A.; Hamity, G. N.; Hamnett, P. G.; Han, L.; Hanagaki, K.; Hanawa, K.; Hance, M.; Haney, B.; Hanke, P.; Hanna, R.; Hansen, J. B.; Hansen, J. D.; Hansen, M. C.; Hansen, P. H.; Hara, K.; Hard, A. S.; Harenberg, T.; Hariri, F.; Harkusha, S.; Harrington, R. D.; Harrison, P. F.; Hartjes, F.; Hasegawa, M.; Hasegawa, Y.; Hasib, A.; Hassani, S.; Haug, S.; Hauser, R.; Hauswald, L.; Havranek, M.; Hawkes, C. M.; Hawkings, R. J.; Hawkins, A. D.; Hayden, D.; Hays, C. P.; Hays, J. M.; Hayward, H. S.; Haywood, S. J.; Head, S. J.; Heck, T.; Hedberg, V.; Heelan, L.; Heim, S.; Heim, T.; Heinemann, B.; Heinrich, J. J.; Heinrich, L.; Heinz, C.; Hejbal, J.; Helary, L.; Hellman, S.; Helsens, C.; Henderson, J.; Henderson, R. C. W.; Heng, Y.; Henkelmann, S.; Correia, A. M. Henriques; Henrot-Versille, S.; Herbert, G. H.; Jiménez, Y. Hernández; Herten, G.; Hertenberger, R.; Hervas, L.; Hesketh, G. G.; Hessey, N. P.; Hetherly, J. W.; Hickling, R.; Higón-Rodriguez, E.; Hill, E.; Hill, J. C.; Hiller, K. H.; Hillier, S. J.; Hinchliffe, I.; Hines, E.; Hinman, R. R.; Hirose, M.; Hirschbuehl, D.; Hobbs, J.; Hod, N.; Hodgkinson, M. C.; Hodgson, P.; Hoecker, A.; Hoeferkamp, M. R.; Hoenig, F.; Hohlfeld, M.; Hohn, D.; Holmes, T. R.; Homann, M.; Hong, T. M.; Hooberman, B. H.; Hopkins, W. H.; Horii, Y.; Horton, A. J.; Hostachy, J.-Y.; Hou, S.; Hoummada, A.; Howard, J.; Howarth, J.; Hrabovsky, M.; Hristova, I.; Hrivnac, J.; Hryn'ova, T.; Hrynevich, A.; Hsu, C.; Hsu, P. J.; Hsu, S.-C.; Hu, D.; Hu, Q.; Huang, Y.; Hubacek, Z.; Hubaut, F.; Huegging, F.; Huffman, T. B.; Hughes, E. W.; Hughes, G.; Huhtinen, M.; Hülsing, T. A.; Huseynov, N.; Huston, J.; Huth, J.; Iacobucci, G.; Iakovidis, G.; Ibragimov, I.; Iconomidou-Fayard, L.; Ideal, E.; Idrissi, Z.; Iengo, P.; Igonkina, O.; Iizawa, T.; Ikegami, Y.; Ikeno, M.; Ilchenko, Y.; Iliadis, D.; Ilic, N.; Ince, T.; Introzzi, G.; Ioannou, P.; Iodice, M.; Iordanidou, K.; Ippolito, V.; Quiles, A. Irles; Isaksson, C.; Ishino, M.; Ishitsuka, M.; Ishmukhametov, R.; Issever, C.; Istin, S.; Ito, F.; Ponce, J. M. Iturbe; Iuppa, R.; Ivarsson, J.; Iwanski, W.; Iwasaki, H.; Izen, J. M.; Izzo, V.; Jabbar, S.; Jackson, B.; Jackson, M.; Jackson, P.; Jain, V.; Jakobi, K. B.; Jakobs, K.; Jakobsen, S.; Jakoubek, T.; Jamin, D. O.; Jana, D. K.; Jansen, E.; Jansky, R.; Janssen, J.; Janus, M.; Jarlskog, G.; Javadov, N.; Javůrek, T.; Jeanneau, F.; Jeanty, L.; Jejelava, J.; Jeng, G.-Y.; Jennens, D.; Jenni, P.; Jentzsch, J.; Jeske, C.; Jézéquel, S.; Ji, H.; Jia, J.; Jiang, H.; Jiang, Y.; Jiggins, S.; Pena, J. Jimenez; Jin, S.; Jinaru, A.; Jinnouchi, O.; Johansson, P.; Johns, K. A.; Johnson, W. J.; Jon-And, K.; Jones, G.; Jones, R. W. L.; Jones, S.; Jones, T. J.; Jongmanns, J.; Jorge, P. M.; Jovicevic, J.; Ju, X.; Rozas, A. Juste; Köhler, M. K.; Kaczmarska, A.; Kado, M.; Kagan, H.; Kagan, M.; Kahn, S. J.; Kajomovitz, E.; Kalderon, C. W.; Kaluza, A.; Kama, S.; Kamenshchikov, A.; Kanaya, N.; Kaneti, S.; Kantserov, V. A.; Kanzaki, J.; Kaplan, B.; Kaplan, L. S.; Kapliy, A.; Kar, D.; Karakostas, K.; Karamaoun, A.; Karastathis, N.; Kareem, M. J.; Karentzos, E.; Karnevskiy, M.; Karpov, S. N.; Karpova, Z. M.; Karthik, K.; Kartvelishvili, V.; Karyukhin, A. N.; Kasahara, K.; Kashif, L.; Kass, R. D.; Kastanas, A.; Kataoka, Y.; Kato, C.; Katre, A.; Katzy, J.; Kawade, K.; Kawagoe, K.; Kawamoto, T.; Kawamura, G.; Kazama, S.; Kazanin, V. F.; Keeler, R.; Kehoe, R.; Keller, J. S.; Kempster, J. J.; Keoshkerian, H.; Kepka, O.; Kerševan, B. P.; Kersten, S.; Keyes, R. A.; Khalil-zada, F.; Khandanyan, H.; Khanov, A.; Kharlamov, A. G.; Khoo, T. J.; Khovanskiy, V.; Khramov, E.; Khubua, J.; Kido, S.; Kim, H. Y.; Kim, S. H.; Kim, Y. K.; Kimura, N.; Kind, O. M.; King, B. T.; King, M.; King, S. B.; Kirk, J.; Kiryunin, A. E.; Kishimoto, T.; Kisielewska, D.; Kiss, F.; Kiuchi, K.; Kivernyk, O.; Kladiva, E.; Klein, M. H.; Klein, M.; Klein, U.; Kleinknecht, K.; Klimek, P.; Klimentov, A.; Klingenberg, R.; Klinger, J. A.; Klioutchnikova, T.; Kluge, E.-E.; Kluit, P.; Kluth, S.; Knapik, J.; Kneringer, E.; Knoops, E. B. F. G.; Knue, A.; Kobayashi, A.; Kobayashi, D.; Kobayashi, T.; Kobel, M.; Kocian, M.; Kodys, P.; Koffas, T.; Koffeman, E.; Kogan, L. A.; Kohriki, T.; Koi, T.; Kolanoski, H.; Kolb, M.; Koletsou, I.; Komar, A. A.; Komori, Y.; Kondo, T.; Kondrashova, N.; Köneke, K.; König, A. C.; Kono, T.; Konoplich, R.; Konstantinidis, N.; Kopeliansky, R.; Koperny, S.; Köpke, L.; Kopp, A. K.; Korcyl, K.; Kordas, K.; Korn, A.; Korol, A. A.; Korolkov, I.; Korolkova, E. V.; Kortner, O.; Kortner, S.; Kosek, T.; Kostyukhin, V. V.; Kotov, V. M.; Kotwal, A.; Kourkoumeli-Charalampidi, A.; Kourkoumelis, C.; Kouskoura, V.; Koutsman, A.; Kowalewska, A. B.; Kowalewski, R.; Kowalski, T. Z.; Kozanecki, W.; Kozhin, A. S.; Kramarenko, V. A.; Kramberger, G.; Krasnopevtsev, D.; Krasny, M. W.; Krasznahorkay, A.; Kraus, J. K.; Kravchenko, A.; Kretz, M.; Kretzschmar, J.; Kreutzfeldt, K.; Krieger, P.; Krizka, K.; Kroeninger, K.; Kroha, H.; Kroll, J.; Kroseberg, J.; Krstic, J.; Kruchonak, U.; Krüger, H.; Krumnack, N.; Kruse, A.; Kruse, M. C.; Kruskal, M.; Kubota, T.; Kucuk, H.; Kuday, S.; Kuechler, J. T.; Kuehn, S.; Kugel, A.; Kuger, F.; Kuhl, A.; Kuhl, T.; Kukhtin, V.; Kukla, R.; Kulchitsky, Y.; Kuleshov, S.; Kuna, M.; Kunigo, T.; Kupco, A.; Kurashige, H.; Kurochkin, Y. A.; Kus, V.; Kuwertz, E. S.; Kuze, M.; Kvita, J.; Kwan, T.; Kyriazopoulos, D.; Rosa, A. La; Navarro, J. L. La Rosa; Rotonda, L. La; Lacasta, C.; Lacava, F.; Lacey, J.; Lacker, H.; Lacour, D.; Lacuesta, V. R.; Ladygin, E.; Lafaye, R.; Laforge, B.; Lagouri, T.; Lai, S.; Lammers, S.; Lampl, W.; Lançon, E.; Landgraf, U.; Landon, M. P. J.; Lang, V. S.; Lange, J. C.; Lankford, A. J.; Lanni, F.; Lantzsch, K.; Lanza, A.; Laplace, S.; Lapoire, C.; Laporte, J. F.; Lari, T.; Manghi, F. Lasagni; Lassnig, M.; Laurelli, P.; Lavrijsen, W.; Law, A. T.; Laycock, P.; Lazovich, T.; Lazzaroni, M.; Dortz, O. Le; Guirriec, E. Le; Menedeu, E. Le; Quilleuc, E. P. Le; LeBlanc, M.; LeCompte, T.; Ledroit-Guillon, F.; Lee, C. A.; Lee, S. C.; Lee, L.; Lefebvre, G.; Lefebvre, M.; Legger, F.; Leggett, C.; Lehan, A.; Miotto, G. Lehmann; Lei, X.; Leight, W. A.; Leisos, A.; Leister, A. G.; Leite, M. A. L.; Leitner, R.; Lellouch, D.; Lemmer, B.; Leney, K. J. C.; Lenz, T.; Lenzi, B.; Leone, R.; Leone, S.; Leonidopoulos, C.; Leontsinis, S.; Lerner, G.; Leroy, C.; Lesage, A. A. J.; Lester, C. G.; Levchenko, M.; Levêque, J.; Levin, D.; Levinson, L. J.; Levy, M.; Leyko, A. M.; Leyton, M.; Li, B.; Li, H.; Li, H. L.; Li, L.; Li, L.; Li, Q.; Li, S.; Li, X.; Li, Y.; Liang, Z.; Liao, H.; Liberti, B.; Liblong, A.; Lichard, P.; Lie, K.; Liebal, J.; Liebig, W.; Limbach, C.; Limosani, A.; Lin, S. C.; Lin, T. H.; Lindquist, B. E.; Lipeles, E.; Lipniacka, A.; Lisovyi, M.; Liss, T. M.; Lissauer, D.; Lister, A.; Litke, A. M.; Liu, B.; Liu, D.; Liu, H.; Liu, H.; Liu, J.; Liu, J. B.; Liu, K.; Liu, L.; Liu, M.; Liu, M.; Liu, Y. L.; Liu, Y.; Livan, M.; Lleres, A.; Merino, J. Llorente; Lloyd, S. L.; Sterzo, F. Lo; Lobodzinska, E.; Loch, P.; Lockman, W. S.; Loebinger, F. K.; Loevschall-Jensen, A. E.; Loew, K. M.; Loginov, A.; Lohse, T.; Lohwasser, K.; Lokajicek, M.; Long, B. A.; Long, J. D.; Long, R. E.; Longo, L.; Looper, K. A.; Lopes, L.; Mateos, D. Lopez; Paredes, B. Lopez; Paz, I. Lopez; Solis, A. Lopez; Lorenz, J.; Martinez, N. Lorenzo; Losada, M.; Lösel, P. J.; Lou, X.; Lounis, A.; Love, J.; Love, P. A.; Lu, H.; Lu, N.; Lubatti, H. J.; Luci, C.; Lucotte, A.; Luedtke, C.; Luehring, F.; Lukas, W.; Luminari, L.; Lundberg, O.; Lund-Jensen, B.; Lynn, D.; Lysak, R.; Lytken, E.; Lyubushkin, V.; Ma, H.; Ma, L. L.; Ma, Y.; Maccarrone, G.; Macchiolo, A.; Macdonald, C. M.; Maček, B.; Miguens, J. Machado; Madaffari, D.; Madar, R.; Maddocks, H. J.; Mader, W. F.; Madsen, A.; Maeda, J.; Maeland, S.; Maeno, T.; Maevskiy, A.; Magradze, E.; Mahlstedt, J.; Maiani, C.; Maidantchik, C.; Maier, A. A.; Maier, T.; Maio, A.; Majewski, S.; Makida, Y.; Makovec, N.; Malaescu, B.; Malecki, Pa.; Maleev, V. P.; Malek, F.; Mallik, U.; Malon, D.; Malone, C.; Maltezos, S.; Malyshev, V. M.; Malyukov, S.; Mamuzic, J.; Mancini, G.; Mandelli, B.; Mandelli, L.; Mandić, I.; Maneira, J.; Andrade Filho, L. Manhaes de; Ramos, J. Manjarres; Mann, A.; Mansoulie, B.; Mantifel, R.; Mantoani, M.; Manzoni, S.; Mapelli, L.; Marceca, G.; March, L.; Marchiori, G.; Marcisovsky, M.; Marjanovic, M.; Marley, D. E.; Marroquim, F.; Marsden, S. P.; Marshall, Z.; Marti, L. F.; Marti-Garcia, S.; Martin, B.; Martin, T. A.; Martin, V. J.; Latour, B. Martin dit; Martinez, M.; Martin-Haugh, S.; Martoiu, V. S.; Martyniuk, A. C.; Marx, M.; Marzano, F.; Marzin, A.; Masetti, L.; Mashimo, T.; Mashinistov, R.; Masik, J.; Maslennikov, A. L.; Massa, I.; Massa, L.; Mastrandrea, P.; Mastroberardino, A.; Masubuchi, T.; Mättig, P.; Mattmann, J.; Maurer, J.; Maxfield, S. J.; Maximov, D. A.; Mazini, R.; Mazza, S. M.; Fadden, N. C. Mc; Goldrick, G. Mc; Kee, S. P. Mc; McCarn, A.; McCarthy, R. L.; McCarthy, T. G.; McClymont, L. I.; McFarlane, K. W.; Mcfayden, J. A.; Mchedlidze, G.; McMahon, S. J.; McPherson, R. A.; Medinnis, M.; Meehan, S.; Mehlhase, S.; Mehta, A.; Meier, K.; Meineck, C.; Meirose, B.; Garcia, B. R. Mellado; Meloni, F.; Mengarelli, A.; Menke, S.; Meoni, E.; Mercurio, K. M.; Mergelmeyer, S.; Mermod, P.; Merola, L.; Meroni, C.; Merritt, F. S.; Messina, A.; Metcalfe, J.; Mete, A. S.; Meyer, C.; Meyer, C.; Meyer, J.-P.; Meyer, J.; Theenhausen, H. Meyer Zu; Middleton, R. P.; Miglioranzi, S.; Mijović, L.; Mikenberg, G.; Mikestikova, M.; Mikuž, M.; Milesi, M.; Milic, A.; Miller, D. W.; Mills, C.; Milov, A.; Milstead, D. A.; Minaenko, A. A.; Minami, Y.; Minashvili, I. A.; Mincer, A. I.; Mindur, B.; Mineev, M.; Ming, Y.; Mir, L. M.; Mistry, K. P.; Mitani, T.; Mitrevski, J.; Mitsou, V. A.; Miucci, A.; Miyagawa, P. S.; Mjörnmark, J. U.; Moa, T.; Mochizuki, K.; Mohapatra, S.; Mohr, W.; Molander, S.; Moles-Valls, R.; Monden, R.; Mondragon, M. C.; Mönig, K.; Monk, J.; Monnier, E.; Montalbano, A.; Berlingen, J. Montejo; Monticelli, F.; Monzani, S.; Moore, R. W.; Morange, N.; Moreno, D.; Llácer, M. Moreno; Morettini, P.; Mori, D.; Mori, T.; Morii, M.; Morinaga, M.; Morisbak, V.; Moritz, S.; Morley, A. K.; Mornacchi, G.; Morris, J. D.; Mortensen, S. S.; Morvaj, L.; Mosidze, M.; Moss, J.; Motohashi, K.; Mount, R.; Mountricha, E.; Mouraviev, S. V.; Moyse, E. J. W.; Muanza, S.; Mudd, R. D.; Mueller, F.; Mueller, J.; Mueller, R. S. P.; Mueller, T.; Muenstermann, D.; Mullen, P.; Mullier, G. A.; Sanchez, F. J. Munoz; Quijada, J. A. Murillo; Murray, W. J.; Murrone, A.; Musheghyan, H.; Muskinja, M.; Myagkov, A. G.; Myska, M.; Nachman, B. P.; Nackenhorst, O.; Nadal, J.; Nagai, K.; Nagai, R.; Nagano, K.; Nagasaka, Y.; Nagata, K.; Nagel, M.; Nagy, E.; Nairz, A. M.; Nakahama, Y.; Nakamura, K.; Nakamura, T.; Nakano, I.; Namasivayam, H.; Garcia, R. F. Naranjo; Narayan, R.; Villar, D. I. Narrias; Naryshkin, I.; Naumann, T.; Navarro, G.; Nayyar, R.; Neal, H. A.; Nechaeva, P. Yu.; Neep, T. J.; Nef, P. D.; Negri, A.; Negrini, M.; Nektarijevic, S.; Nellist, C.; Nelson, A.; Nemecek, S.; Nemethy, P.; Nepomuceno, A. A.; Nessi, M.; Neubauer, M. S.; Neumann, M.; Neves, R. M.; Nevski, P.; Newman, P. R.; Nguyen, D. H.; Nickerson, R. B.; Nicolaidou, R.; Nicquevert, B.; Nielsen, J.; Nikiforov, A.; Nikolaenko, V.; Nikolic-Audit, I.; Nikolopoulos, K.; Nilsen, J. K.; Nilsson, P.; Ninomiya, Y.; Nisati, A.; Nisius, R.; Nobe, T.; Nodulman, L.; Nomachi, M.; Nomidis, I.; Nooney, T.; Norberg, S.; Nordberg, M.; Norjoharuddeen, N.; Novgorodova, O.; Nowak, S.; Nozaki, M.; Nozka, L.; Ntekas, K.; Nurse, E.; Nuti, F.; O'grady, F.; O'Neil, D. C.; O'Rourke, A. A.; O'Shea, V.; Oakham, F. G.; Oberlack, H.; Obermann, T.; Ocariz, J.; Ochi, A.; Ochoa, I.; Ochoa-Ricoux, J. P.; Oda, S.; Odaka, S.; Ogren, H.; Oh, A.; Oh, S. H.; Ohm, C. C.; Ohman, H.; Oide, H.; Okawa, H.; Okumura, Y.; Okuyama, T.; Olariu, A.; Seabra, L. F. Oleiro; Pino, S. A. Olivares; Damazio, D. Oliveira; Olszewski, A.; Olszowska, J.; Onofre, A.; Onogi, K.; Onyisi, P. U. E.; Oram, C. J.; Oreglia, M. J.; Oren, Y.; Orestano, D.; Orlando, N.; Orr, R. S.; Osculati, B.; Ospanov, R.; Garzon, G. Otero y.; Otono, H.; Ouchrif, M.; Ould-Saada, F.; Ouraou, A.; Oussoren, K. P.; Ouyang, Q.; Ovcharova, A.; Owen, M.; Owen, R. E.; Ozcan, V. E.; Ozturk, N.; Pachal, K.; Pages, A. Pacheco; Aranda, C. Padilla; Pagáčová, M.; Griso, S. Pagan; Paige, F.; Pais, P.; Pajchel, K.; Palacino, G.; Palestini, S.; Palka, M.; Pallin, D.; Palma, A.; Panagiotopoulou, E. St.; Pandini, C. E.; Vazquez, J. G. Panduro; Pani, P.; Panitkin, S.; Pantea, D.; Paolozzi, L.; Papadopoulou, Th. D.; Papageorgiou, K.; Paramonov, A.; Hernandez, D. Paredes; Parker, A. J.; Parker, M. A.; Parker, K. A.; Parodi, F.; Parsons, J. A.; Parzefall, U.; Pascuzzi, V.; Pasqualucci, E.; Passaggio, S.; Pastore, F.; Pastore, Fr.; Pásztor, G.; Pataraia, S.; Patel, N. D.; Pater, J. R.; Pauly, T.; Pearce, J.; Pearson, B.; Pedersen, L. E.; Pedersen, M.; Lopez, S. Pedraza; Pedro, R.; Peleganchuk, S. V.; Pelikan, D.; Penc, O.; Peng, C.; Peng, H.; Penwell, J.; Peralva, B. S.; Perego, M. M.; Perepelitsa, D. V.; Codina, E. Perez; Perini, L.; Pernegger, H.; Perrella, S.; Peschke, R.; Peshekhonov, V. D.; Peters, K.; Peters, R. F. Y.; Petersen, B. A.; Petersen, T. C.; Petit, E.; Petridis, A.; Petridou, C.; Petroff, P.; Petrolo, E.; Petrov, M.; Petrucci, F.; Pettersson, N. E.; Peyaud, A.; Pezoa, R.; Phillips, P. W.; Piacquadio, G.; Pianori, E.; Picazio, A.; Piccaro, E.; Piccinini, M.; Pickering, M. A.; Piegaia, R.; Pilcher, J. E.; Pilkington, A. D.; Pin, A. W. J.; Pina, J.; Pinamonti, M.; Pinfold, J. L.; Pingel, A.; Pires, S.; Pirumov, H.; Pitt, M.; Plazak, L.; Pleier, M.-A.; Pleskot, V.; Plotnikova, E.; Plucinski, P.; Pluth, D.; Poettgen, R.; Poggioli, L.; Pohl, D.; Polesello, G.; Poley, A.; Policicchio, A.; Polifka, R.; Polini, A.; Pollard, C. S.; Polychronakos, V.; Pommès, K.; Pontecorvo, L.; Pope, B. G.; Popeneciu, G. A.; Popovic, D. S.; Poppleton, A.; Pospisil, S.; Potamianos, K.; Potrap, I. N.; Potter, C. J.; Potter, C. T.; Poulard, G.; Poveda, J.; Pozdnyakov, V.; Astigarraga, M. E. Pozo; Pralavorio, P.; Pranko, A.; Prell, S.; Price, D.; Price, L. E.; Primavera, M.; Prince, S.; Proissl, M.; Prokofiev, K.; Prokoshin, F.; Protopopescu, S.; Proudfoot, J.; Przybycien, M.; Puddu, D.; Puldon, D.; Purohit, M.; Puzo, P.; Qian, J.; Qin, G.; Qin, Y.; Quadt, A.; Quayle, W. B.; Queitsch-Maitland, M.; Quilty, D.; Raddum, S.; Radeka, V.; Radescu, V.; Radhakrishnan, S. K.; Radloff, P.; Rados, P.; Ragusa, F.; Rahal, G.; Raine, J. A.; Rajagopalan, S.; Rammensee, M.; Rangel-Smith, C.; Ratti, M. G.; Rauscher, F.; Rave, S.; Ravenscroft, T.; Raymond, M.; Read, A. L.; Readioff, N. P.; Rebuzzi, D. M.; Redelbach, A.; Redlinger, G.; Reece, R.; Reeves, K.; Rehnisch, L.; Reichert, J.; Reisin, H.; Rembser, C.; Ren, H.; Rescigno, M.; Resconi, S.; Rezanova, O. L.; Reznicek, P.; Rezvani, R.; Richter, R.; Richter, S.; Richter-Was, E.; Ricken, O.; Ridel, M.; Rieck, P.; Riegel, C. J.; Rieger, J.; Rifki, O.; Rijssenbeek, M.; Rimoldi, A.; Rinaldi, L.; Ristić, B.; Ritsch, E.; Riu, I.; Rizatdinova, F.; Rizvi, E.; Rizzi, C.; Robertson, S. H.; Robichaud-Veronneau, A.; Robinson, D.; Robinson, J. E. M.; Robson, A.; Roda, C.; Rodina, Y.; Perez, A. Rodriguez; Rodriguez, D. Rodriguez; Roe, S.; Rogan, C. S.; Røhne, O.; Romaniouk, A.; Romano, M.; Saez, S. M. Romano; Adam, E. Romero; Rompotis, N.; Ronzani, M.; Roos, L.; Ros, E.; Rosati, S.; Rosbach, K.; Rose, P.; Rosenthal, O.; Rossetti, V.; Rossi, E.; Rossi, L. P.; Rosten, J. H. N.; Rosten, R.; Rotaru, M.; Roth, I.; Rothberg, J.; Rousseau, D.; Royon, C. R.; Rozanov, A.; Rozen, Y.; Ruan, X.; Rubbo, F.; Rubinskiy, I.; Rud, V. I.; Rudolph, M. S.; Rühr, F.; Ruiz-Martinez, A.; Rurikova, Z.; Rusakovich, N. A.; Ruschke, A.; Russell, H. L.; Rutherfoord, J. P.; Ruthmann, N.; Ryabov, Y. F.; Rybar, M.; Rybkin, G.; Ryu, S.; Ryzhov, A.; Saavedra, A. F.; Sabato, G.; Sacerdoti, S.; Sadrozinski, H. F.-W.; Sadykov, R.; Tehrani, F. Safai; Saha, P.; Sahinsoy, M.; Saimpert, M.; Saito, T.; Sakamoto, H.; Sakurai, Y.; Salamanna, G.; Salamon, A.; Loyola, J. E. Salazar; Salek, D.; De Bruin, P. H. Sales; Salihagic, D.; Salnikov, A.; Salt, J.; Salvatore, D.; Salvatore, F.; Salvucci, A.; Salzburger, A.; Sammel, D.; Sampsonidis, D.; Sanchez, A.; Sánchez, J.; Martinez, V. Sanchez; Sandaker, H.; Sandbach, R. L.; Sander, H. G.; Sanders, M. P.; Sandhoff, M.; Sandoval, C.; Sandstroem, R.; Sankey, D. P. C.; Sannino, M.; Sansoni, A.; Santoni, C.; Santonico, R.; Santos, H.; Castillo, I. Santoyo; Sapp, K.; Sapronov, A.; Saraiva, J. G.; Sarrazin, B.; Sasaki, O.; Sasaki, Y.; Sato, K.; Sauvage, G.; Sauvan, E.; Savage, G.; Savard, P.; Sawyer, C.; Sawyer, L.; Saxon, J.; Sbarra, C.; Sbrizzi, A.; Scanlon, T.; Scannicchio, D. A.; Scarcella, M.; Scarfone, V.; Schaarschmidt, J.; Schacht, P.; Schaefer, D.; Schaefer, R.; Schaeffer, J.; Schaepe, S.; Schaetzel, S.; Schäfer, U.; Schaffer, A. C.; Schaile, D.; Schamberger, R. D.; Scharf, V.; Schegelsky, V. A.; Scheirich, D.; Schernau, M.; Schiavi, C.; Schillo, C.; Schioppa, M.; Schlenker, S.; Schmieden, K.; Schmitt, C.; Schmitt, S.; Schmitz, S.; Schneider, B.; Schnellbach, Y. J.; Schnoor, U.; Schoeffel, L.; Schoening, A.; Schoenrock, B. D.; Schopf, E.; Schorlemmer, A. L. S.; Schott, M.; Schovancova, J.; Schramm, S.; Schreyer, M.; Schuh, N.; Schultens, M. J.; Schultz-Coulon, H.-C.; Schulz, H.; Schumacher, M.; Schumm, B. A.; Schune, Ph.; Schwanenberger, C.; Schwartzman, A.; Schwarz, T. A.; Schwegler, Ph.; Schweiger, H.; Schwemling, Ph.; Schwienhorst, R.; Schwindling, J.; Schwindt, T.; Sciolla, G.; Scuri, F.; Scutti, F.; Searcy, J.; Seema, P.; Seidel, S. C.; Seiden, A.; Seifert, F.; Seixas, J. M.; Sekhniaidze, G.; Sekhon, K.; Sekula, S. J.; Seliverstov, D. M.; Semprini-Cesari, N.; Serfon, C.; Serin, L.; Serkin, L.; Sessa, M.; Seuster, R.; Severini, H.; Sfiligoj, T.; Sforza, F.; Sfyrla, A.; Shabalina, E.; Shaikh, N. W.; Shan, L. Y.; Shang, R.; Shank, J. T.; Shapiro, M.; Shatalov, P. B.; Shaw, K.; Shaw, S. M.; Shcherbakova, A.; Shehu, C. Y.; Sherwood, P.; Shi, L.; Shimizu, S.; Shimmin, C. O.; Shimojima, M.; Shiyakova, M.; Shmeleva, A.; Saadi, D. Shoaleh; Shochet, M. J.; Shojaii, S.; Shrestha, S.; Shulga, E.; Shupe, M. A.; Sicho, P.; Sidebo, P. E.; Sidiropoulou, O.; Sidorov, D.; Sidoti, A.; Siegert, F.; Sijacki, Dj.; Silva, J.; Silverstein, S. B.; Simak, V.; Simard, O.; Simic, Lj.; Simion, S.; Simioni, E.; Simmons, B.; Simon, D.; Simon, M.; Sinervo, P.; Sinev, N. B.; Sioli, M.; Siragusa, G.; Sivoklokov, S. Yu.; Sjölin, J.; Sjursen, T. B.; Skinner, M. B.; Skottowe, H. P.; Skubic, P.; Slater, M.; Slavicek, T.; Slawinska, M.; Sliwa, K.; Slovak, R.; Smakhtin, V.; Smart, B. H.; Smestad, L.; Smirnov, S. Yu.; Smirnov, Y.; Smirnova, L. N.; Smirnova, O.; Smith, M. N. K.; Smith, R. W.; Smizanska, M.; Smolek, K.; Snesarev, A. A.; Snidero, G.; Snyder, S.; Sobie, R.; Socher, F.; Soffer, A.; Soh, D. A.; Sokhrannyi, G.; Sanchez, C. A. Solans; Solar, M.; Soldatov, E. Yu.; Soldevila, U.; Solodkov, A. A.; Soloshenko, A.; Solovyanov, O. V.; Solovyev, V.; Sommer, P.; Son, H.; Song, H. Y.; Sood, A.; Sopczak, A.; Sopko, V.; Sorin, V.; Sosa, D.; Sotiropoulou, C. L.; Soualah, R.; Soukharev, A. M.; South, D.; Sowden, B. C.; Spagnolo, S.; Spalla, M.; Spangenberg, M.; Spanò, F.; Sperlich, D.; Spettel, F.; Spighi, R.; Spigo, G.; Spiller, L. A.; Spousta, M.; Denis, R. D. St.; Stabile, A.; Staerz, S.; Stahlman, J.; Stamen, R.; Stamm, S.; Stanecka, E.; Stanek, R. W.; Stanescu, C.; Stanescu-Bellu, M.; Stanitzki, M. M.; Stapnes, S.; Starchenko, E. A.; Stark, G. H.; Stark, J.; Staroba, P.; Starovoitov, P.; Staszewski, R.; Steinberg, P.; Stelzer, B.; Stelzer, H. J.; Stelzer-Chilton, O.; Stenzel, H.; Stewart, G. A.; Stillings, J. A.; Stockton, M. C.; Stoebe, M.; Stoicea, G.; Stolte, P.; Stonjek, S.; Stradling, A. R.; Straessner, A.; Stramaglia, M. E.; Strandberg, J.; Strandberg, S.; Strandlie, A.; Strauss, M.; Strizenec, P.; Ströhmer, R.; Strom, D. M.; Stroynowski, R.; Strubig, A.; Stucci, S. A.; Stugu, B.; Styles, N. A.; Su, D.; Su, J.; Subramaniam, R.; Suchek, S.; Sugaya, Y.; Suk, M.; Sulin, V. V.; Sultansoy, S.; Sumida, T.; Sun, S.; Sun, X.; Sundermann, J. E.; Suruliz, K.; Susinno, G.; Sutton, M. R.; Suzuki, S.; Svatos, M.; Swiatlowski, M.; Sykora, I.; Sykora, T.; Ta, D.; Taccini, C.; Tackmann, K.; Taenzer, J.; Taffard, A.; Tafirout, R.; Taiblum, N.; Takai, H.; Takashima, R.; Takeda, H.; Takeshita, T.; Takubo, Y.; Talby, M.; Talyshev, A. A.; Tam, J. Y. C.; Tan, K. G.; Tanaka, J.; Tanaka, R.; Tanaka, S.; Tannenwald, B. B.; Araya, S. Tapia; Tapprogge, S.; Tarem, S.; Tartarelli, G. F.; Tas, P.; Tasevsky, M.; Tashiro, T.; Tassi, E.; Delgado, A. Tavares; Tayalati, Y.; Taylor, A. C.; Taylor, G. N.; Taylor, P. T. E.; Taylor, W.; Teischinger, F. A.; Teixeira-Dias, P.; Temming, K. K.; Temple, D.; Kate, H. Ten; Teng, P. K.; Teoh, J. J.; Tepel, F.; Terada, S.; Terashi, K.; Terron, J.; Terzo, S.; Testa, M.; Teuscher, R. J.; Theveneaux-Pelzer, T.; Thomas, J. P.; Thomas-Wilsker, J.; Thompson, E. N.; Thompson, P. D.; Thompson, R. J.; Thompson, A. S.; Thomsen, L. A.; Thomson, E.; Thomson, M.; Tibbetts, M. J.; Torres, R. E. Ticse; Tikhomirov, V. O.; Tikhonov, Yu. A.; Timoshenko, S.; Tipton, P.; Tisserant, S.; Todome, K.; Todorov, T.; Todorova-Nova, S.; Tojo, J.; Tokár, S.; Tokushuku, K.; Tolley, E.; Tomlinson, L.; Tomoto, M.; Tompkins, L.; Toms, K.; Tong, B.; Torrence, E.; Torres, H.; Pastor, E. Torró; Toth, J.; Touchard, F.; Tovey, D. R.; Trefzger, T.; Tremblet, L.; Tricoli, A.; Trigger, I. M.; Trincaz-Duvoid, S.; Tripiana, M. F.; Trischuk, W.; Trocmé, B.; Trofymov, A.; Troncon, C.; Trottier-McDonald, M.; Trovatelli, M.; Truong, L.; Trzebinski, M.; Trzupek, A.; Tseng, J. C.-L.; Tsiareshka, P. V.; Tsipolitis, G.; Tsirintanis, N.; Tsiskaridze, S.; Tsiskaridze, V.; Tskhadadze, E. G.; Tsui, K. M.; Tsukerman, I. I.; Tsulaia, V.; Tsuno, S.; Tsybychev, D.; Tudorache, A.; Tudorache, V.; Tuna, A. N.; Tupputi, S. A.; Turchikhin, S.; Turecek, D.; Turgeman, D.; Turra, R.; Turvey, A. J.; Tuts, P. M.; Tyndel, M.; Ucchielli, G.; Ueda, I.; Ueno, R.; Ughetto, M.; Ukegawa, F.; Unal, G.; Undrus, A.; Unel, G.; Ungaro, F. C.; Unno, Y.; Unverdorben, C.; Urban, J.; Urquijo, P.; Urrejola, P.; Usai, G.; Usanova, A.; Vacavant, L.; Vacek, V.; Vachon, B.; Valderanis, C.; Santurio, E. Valdes; Valencic, N.; Valentinetti, S.; Valero, A.; Valery, L.; Valkar, S.; Vallecorsa, S.; Ferrer, J. A. Valls; Van Den Wollenberg, W.; Van Der Deijl, P. C.; van der Geer, R.; van der Graaf, H.; van Eldik, N.; van Gemmeren, P.; Van Nieuwkoop, J.; van Vulpen, I.; van Woerden, M. C.; Vanadia, M.; Vandelli, W.; Vanguri, R.; Vaniachine, A.; Vankov, P.; Vardanyan, G.; Vari, R.; Varnes, E. W.; Varol, T.; Varouchas, D.; Vartapetian, A.; Varvell, K. E.; Vasquez, J. G.; Vazeille, F.; Schroeder, T. Vazquez; Veatch, J.; Veloce, L. M.; Veloso, F.; Veneziano, S.; Ventura, A.; Venturi, M.; Venturi, N.; Venturini, A.; Vercesi, V.; Verducci, M.; Verkerke, W.; Vermeulen, J. C.; Vest, A.; Vetterli, M. C.; Viazlo, O.; Vichou, I.; Vickey, T.; Boeriu, O. E. Vickey; Viehhauser, G. H. A.; Viel, S.; Vigani, L.; Vigne, R.; Villa, M.; Perez, M. Villaplana; Vilucchi, E.; Vincter, M. G.; Vinogradov, V. B.; Vittori, C.; Vivarelli, I.; Vlachos, S.; Vlasak, M.; Vogel, M.; Vokac, P.; Volpi, G.; Volpi, M.; von der Schmitt, H.; von Toerne, E.; Vorobel, V.; Vorobev, K.; Vos, M.; Voss, R.; Vossebeld, J. H.; Vranjes, N.; Milosavljevic, M. Vranjes; Vrba, V.; Vreeswijk, M.; Vuillermet, R.; Vukotic, I.; Vykydal, Z.; Wagner, P.; Wagner, W.; Wahlberg, H.; Wahrmund, S.; Wakabayashi, J.; Walder, J.; Walker, R.; Walkowiak, W.; Wallangen, V.; Wang, C.; Wang, C.; Wang, F.; Wang, H.; Wang, H.; Wang, J.; Wang, J.; Wang, K.; Wang, R.; Wang, S. M.; Wang, T.; Wang, T.; Wang, X.; Wanotayaroj, C.; Warburton, A.; Ward, C. P.; Wardrope, D. R.; Washbrook, A.; Watkins, P. M.; Watson, A. T.; Watson, I. J.; Watson, M. F.; Watts, G.; Watts, S.; Waugh, B. M.; Webb, S.; Weber, M. S.; Weber, S. W.; Webster, J. S.; Weidberg, A. R.; Weinert, B.; Weingarten, J.; Weiser, C.; Weits, H.; Wells, P. S.; Wenaus, T.; Wengler, T.; Wenig, S.; Wermes, N.; Werner, M.; Werner, P.; Wessels, M.; Wetter, J.; Whalen, K.; Whallon, N. L.; Wharton, A. M.; White, A.; White, M. J.; White, R.; White, S.; Whiteson, D.; Wickens, F. J.; Wiedenmann, W.; Wielers, M.; Wienemann, P.; Wiglesworth, C.; Wiik-Fuchs, L. A. M.; Wildauer, A.; Wilk, F.; Wilkens, H. G.; Williams, H. H.; Williams, S.; Willis, C.; Willocq, S.; Wilson, J. A.; Wingerter-Seez, I.; Winklmeier, F.; Winston, O. J.; Winter, B. T.; Wittgen, M.; Wittkowski, J.; Wollstadt, S. J.; Wolter, M. W.; Wolters, H.; Wosiek, B. K.; Wotschack, J.; Woudstra, M. J.; Wozniak, K. W.; Wu, M.; Wu, M.; Wu, S. L.; Wu, X.; Wu, Y.; Wyatt, T. R.; Wynne, B. M.; Xella, S.; Xu, D.; Xu, L.; Yabsley, B.; Yacoob, S.; Yakabe, R.; Yamaguchi, D.; Yamaguchi, Y.; Yamamoto, A.; Yamamoto, S.; Yamanaka, T.; Yamauchi, K.; Yamazaki, Y.; Yan, Z.; Yang, H.; Yang, H.; Yang, Y.; Yang, Z.; Yao, W.-M.; Yap, Y. C.; Yasu, Y.; Yatsenko, E.; Wong, K. H. Yau; Ye, J.; Ye, S.; Yeletskikh, I.; Yen, A. L.; Yildirim, E.; Yorita, K.; Yoshida, R.; Yoshihara, K.; Young, C.; Young, C. J. S.; Youssef, S.; Yu, D. R.; Yu, J.; Yu, J. M.; Yu, J.; Yuan, L.; Yuen, S. P. Y.; Yusuff, I.; Zabinski, B.; Zaidan, R.; Zaitsev, A. M.; Zakharchuk, N.; Zalieckas, J.; Zaman, A.; Zambito, S.; Zanello, L.; Zanzi, D.; Zeitnitz, C.; Zeman, M.; Zemla, A.; Zeng, J. C.; Zeng, Q.; Zengel, K.; Zenin, O.; Ženiš, T.; Zerwas, D.; Zhang, D.; Zhang, F.; Zhang, G.; Zhang, H.; Zhang, J.; Zhang, L.; Zhang, R.; Zhang, R.; Zhang, X.; Zhang, Z.; Zhao, X.; Zhao, Y.; Zhao, Z.; Zhemchugov, A.; Zhong, J.; Zhou, B.; Zhou, C.; Zhou, L.; Zhou, L.; Zhou, M.; Zhou, N.; Zhu, C. G.; Zhu, H.; Zhu, J.; Zhu, Y.; Zhuang, X.; Zhukov, K.; Zibell, A.; Zieminska, D.; Zimine, N. I.; Zimmermann, C.; Zimmermann, S.; Zinonos, Z.; Zinser, M.; Ziolkowski, M.; Živković, L.; Zobernig, G.; Zoccoli, A.; Nedden, M. zur; Zurzolo, G.; Zwalinski, L.
2016-12-01
A test of CP invariance in Higgs boson production via vector-boson fusion using the method of the Optimal Observable is presented. The analysis exploits the decay mode of the Higgs boson into a pair of τ leptons and is based on 20.3 fb^{-1} of proton-proton collision data at √{s} = 8 TeV collected by the ATLAS experiment at the LHC. Contributions from CP-violating interactions between the Higgs boson and electroweak gauge bosons are described in an effective field theory framework, in which the strength of CP violation is governed by a single parameter tilde{d}. The mean values and distributions of CP-odd observables agree with the expectation in the Standard Model and show no sign of CP violation. The CP-mixing parameter tilde{d} is constrained to the interval (-0.11,0.05) at 68% confidence level, consistent with the Standard Model expectation of tilde{d}=0.
Syntactic Pattern Recognition Approach To Scene Matching
NASA Astrophysics Data System (ADS)
Gilmore, John F.
1983-03-01
This paper describes a technique for matching two images containing natural terrain and tactical objects using syntactic pattern recognition. A preprocessor analyzes each image to identify potential areas of interest. Points of interest in an image are classified and a graph possessing properties of invariance is created based on these points. Classification derived grammar strings are generated for each classified graph structure. A local match analysis is performed and the best global match is constructed. A probability-of-match metric is computed in order to evaluate the global match. Examples demonstrating these steps are provided and actual FLIR image results are shown.
NASA Astrophysics Data System (ADS)
Mohamed, Firdawati binti; Karim, Mohamad Faisal bin Abd
2015-10-01
Modelling physical problems in mathematical form yields the governing equations that may be linear or nonlinear for known and unknown boundaries. The exact solution for those equations may or may not be obtained easily. Hence we seek an analytical approximation solution in terms of asymptotic expansion. In this study, we focus on a singular perturbation in second order ordinary differential equations. Solutions to several perturbed ordinary differential equations are obtained in terms of asymptotic expansion. The aim of this work is to find an approximate analytical solution using the classical method of matched asymptotic expansion (MMAE). The Mathematica computer algebra system is used to perform the algebraic computations. The details procedures will be discussed and the underlying concepts and principles of the MMAE will be clarified. Perturbation problem for linear equation that occurs at one boundary and two boundary layers are discussed. Approximate analytical solution obtained for both cases are illustrated by graph using selected parameter by showing the outer, inner and composite solution separately. Then, the composite solution will be compare to the exact solution to show their accuracy by graph. By comparison, MMAE is found to be one of the best methods to solve singular perturbation problems in second order ordinary differential equation since the results obtained are very close to the exact solution.
Huang, Y.; Pepe, M. S.
2010-01-01
Summary To assess the value of a continuous marker in predicting the risk of a disease, a graphical tool called the predictiveness curve has been proposed. It characterizes the marker’s predictiveness, or capacity to risk stratify the population by displaying the distribution of risk endowed by the marker. Methods for making inference about the curve and for comparing curves in a general population have been developed. However, knowledge about a marker’s performance in the general population only is not enough. Since a marker’s effect on the risk model and its distribution can both differ across subpopulations, its predictiveness may vary when applied to different subpopulations. Moreover, information about the predictiveness of a marker conditional on baseline covariates is valuable for individual decision making about having the marker measured or not. Therefore, to fully realize the usefulness of a risk prediction marker, it is important to study its performance conditional on covariates. In this article, we propose semiparametric methods for estimating covariate-specific predictiveness curves for a continuous marker. Unmatched and matched case-control study designs are accommodated. We illustrate application of the methodology by evaluating serum creatinine as a predictor of risk of renal artery stenosis. PMID:21562626
An assembly method for micro parts jointing with given space angle based on projection matching
NASA Astrophysics Data System (ADS)
Bi, Lie; Wu, Wenrong; Zhang, Juan; Yang, Honggang
2017-02-01
It is difficult to assemble micro parts jointing with given space angle as the parts assembled are not on the same flat and the visual depth of microscopic vision is small, which can cause the images gathered by the microscopic vision unintelligible and feature extraction difficult. For the problem, this paper presents an assembly method of micro parts based on projection matching. It can assemble micro parts jointing with given space angle accurately. Firstly, an ideal assembly model is established as the size of the micro parts through the drawing software. Secondly, a graphics algorithm based on the primitive information from CAD is designed. Thirdly, according to the pixel value calibration and the graphics algorithm, the projection pictures are shown on the control interface. Lastly, the control method of micro parts is proposed to assemble them with given space angle. And we accomplished an assembly experiment of micro-tube and micro-column in this way, whose assembly deviation is 0.12∘. Experiment results indicate that the angle between two micro parts assembled can be controlled within the given deviation.
NASA Astrophysics Data System (ADS)
Lee, Seung-Cheol; Vouvakis, Marinos N.; Lee, Jin-Fa
2005-02-01
A non-overlapping domain decomposition method (DDM) is proposed herein to solve Maxwell equations in R3. In this work, the Maxwell equations are discretized using a vector finite element method with hierarchical H(curl) vector basis functions. There are two major ingredients in the proposed non-overlapping DDM: (a) A proper 1st order transmission condition to enforce field continuity across domain boundaries and (b) A cement technique to allow non-matching grids for neighboring domains. Moreover, a detail Fourier analysis of the transmission condition for a canonical half-space example is presented. The analysis provides significant insights into the convergence behavior of the proposed non-overlapping DDM for solving electromagnetic radiation problems, such as the large finite antenna arrays. Particularly for the antenna arrays, the proposed non-overlapping DDM is extremely efficient since the formulation can easily incorporate geometrical repetitions. Exponentially tapered notch (Vivaldi) antenna arrays with size up to 100 × 100 elements are solved on a common PC to validate the proposed non-overlapping DDM.
NASA Astrophysics Data System (ADS)
Gereben, Orsolya; Pusztai, László
2011-08-01
The invariant environment refinement technique, as applied to reverse Monte Carlo modelling [invariant environment refinement technique + reverse Monte Carlo (INVERT + RMC); M. J. Cliffe, M. T. Dove, D. A. Drabold, and A. L. Goodwin, Phys. Rev. Lett. 104, 125501 (2010), 10.1103/PhysRevLett.104.125501], is extended so that it is now applicable for interpreting the structure factor (instead of the pair distribution function). The new algorithm, called the local invariance calculation, is presented by the examples of amorphous silicon, phosphorus, and liquid argon. As a measure of the effectiveness of the new algorithm, the ratio of exactly fourfold coordinated Si atoms was larger than obtained previously by the INVERT-RMC scheme.
Reparametrization invariant collinear operators
Marcantonini, Claudio; Stewart, Iain W.
2009-03-15
In constructing collinear operators, which describe the production of energetic jets or energetic hadrons, important constraints are provided by reparametrization invariance (RPI). RPI encodes Lorentz invariance in a power expansion about a collinear direction, and connects the Wilson coefficients of operators at different orders in this expansion to all orders in {alpha}{sub s}. We construct reparametrization invariant collinear objects. The expansion of operators built from these objects provides an efficient way of deriving RPI relations and finding a minimal basis of operators, particularly when one has an observable with multiple collinear directions and/or soft particles. Complete basis of operators is constructed for pure glue currents at twist-4, and for operators with multiple collinear directions, including those appearing in e{sup +}e{sup -}{yields}3 jets, and for pp{yields}2 jets initiated via gluon fusion.
Orthogonal design for scale invariant feature transform optimization
NASA Astrophysics Data System (ADS)
Ding, Xintao; Luo, Yonglong; Yi, Yunyun; Jie, Biao; Wang, Taochun; Bian, Weixin
2016-09-01
To improve object recognition capabilities in applications, we used orthogonal design (OD) to choose a group of optimal parameters in the parameter space of scale invariant feature transform (SIFT). In the case of global optimization (GOP) and local optimization (LOP) objectives, our aim is to show the operation of OD on the SIFT method. The GOP aims to increase the number of correctly detected true matches (NoCDTM) and the ratio of NoCDTM to all matches. In contrast, the LOP mainly aims to increase the performance of recall-precision. In detail, we first abstracted the SIFT method to a 9-way fixed-effect model with an interaction. Second, we designed a mixed orthogonal array, MA(64,23420,2), and its header table to optimize the SIFT parameters. Finally, two groups of parameters were obtained for GOP and LOP after orthogonal experiments and statistical analyses were implemented. Our experiments on four groups of data demonstrate that compared with the state-of-the-art methods, GOP can access more correct matches and is more effective against object recognition. In addition, LOP is favorable in terms of the recall-precision.
Scale Invariant Gabor Descriptor-Based Noncooperative Iris Recognition
NASA Astrophysics Data System (ADS)
Du, Yingzi; Belcher, Craig; Zhou, Zhi
2010-12-01
A new noncooperative iris recognition method is proposed. In this method, the iris features are extracted using a Gabor descriptor. The feature extraction and comparison are scale, deformation, rotation, and contrast-invariant. It works with off-angle and low-resolution iris images. The Gabor wavelet is incorporated with scale-invariant feature transformation (SIFT) for feature extraction to better extract the iris features. Both the phase and magnitude of the Gabor wavelet outputs were used in a novel way for local feature point description. Two feature region maps were designed to locally and globally register the feature points and each subregion in the map is locally adjusted to the dilation/contraction/deformation. We also developed a video-based non-cooperative iris recognition system by integrating video-based non-cooperative segmentation, segmentation evaluation, and score fusion units. The proposed method shows good performance for frontal and off-angle iris matching. Video-based recognition methods can improve non-cooperative iris recognition accuracy.
Supersymmetric invariant theories
NASA Astrophysics Data System (ADS)
Esipova, S. R.; Lavrov, P. M.; Radchenko, O. V.
2014-04-01
We study field models for which a quantum action (i.e. the action appearing in the generating functional of Green functions) is invariant under supersymmetric transformations. We derive the Ward identity which is a direct consequence of this invariance. We consider a change of variables in functional integral connected with supersymmetric transformations when its parameter is replaced by a nilpotent functional of fields. Exact form of the corresponding Jacobian is found. We find restrictions on generators of supersymmetric transformations when a consistent quantum description of given field theories exists.
Invariant Hough random ferns for RGB-D-based object detection
NASA Astrophysics Data System (ADS)
Lou, Xiaoping; Dong, Mingli; Wang, Jun; Sun, Peng; Lin, Yimin
2016-09-01
This paper studies the challenging problem of object detection using rich image and depth features. An invariant Hough random ferns framework for RGB-D images is proposed here, which primarily consists of a rotation-invariant RGB-D local binary feature, random ferns classifier training, Hough mapping and voting, searches for the maxima, and back projection. In comparison with traditional three-dimensional local feature extraction techniques, this method is effective in reducing the amount of computation required for feature extraction and matching. Moreover, the detection results showed that the proposed method is robust against rotation and scale variations, changes in illumination, and part-occlusions. The authors believe that this method will facilitate the use of perception in fields such as robotics.
NASA Astrophysics Data System (ADS)
Bumstead, M.; Arnold, B.; Turak, A.
2017-04-01
Monte Carlo and molecular dynamics simulations are the two main numerical approaches to modeling molecular self-assembly and ordering. Conceptually, however, each method explores different paths through the thermodynamic landscape. Molecular dynamics depends on the position and momentum terms. Monte Carlo is a static set, and thus the momentum term is replaced with an energy term that is dependent on the volume and entropy. Until now, it was unclear if a stochastic process of densifying particles would have the same internal structure as morphologies produced from classical mechanics. This paper provides a systematic (i.e., statistical) analysis of the outcomes of 4032 simulations for hard-core circular objects as a function of the number of molecules and the boundary conditions. Structural classification of the resultant ensembles (averaged pair correlation function, bond-order parameter, translational order parameter, and Voronoi diagrams) shows that stochastic and dynamic approaches do not alter the morphology of the steric molecules. We conclude that when the probability density of covering area fractions are matched, the ensembles produced from the two methods will show the same level of structural disorder and positional patterns. The resultant morphology from both models, therefore, is not a product of dynamic unrest, but that of the relaxation of entropic frustration from macromolecular crowding. Although statistically the two methods produce similar configurations, nuances arise from the static and dynamic nature of modeling. As a result, Monte Carlo is slightly better suited to modeling systems when the desired morphology is represented by a metastable state; molecular dynamics on the other hand is more suited to finding defects that can arise in morphologies. Regardless, a fixed density will result in similar morphologies from both techniques, driven by similar configurational entropy.
Idiographic Measurement Invariance?
ERIC Educational Resources Information Center
Willoughby, Michael T.; Sideris, John
2007-01-01
In this article, the authors comment on Nesselroade, Gerstorf, Hardy, and Ram's efforts (this issue) to grapple with the challenge of accommodating idiographic assessment as it pertains to measurement invariance (MI). Although the authors are in complete agreement with the motivation for Nesselroade et al.'s work, the authors have concerns about…
Kobayashi, Tatsuo; Nitta, Daisuke; Urakawa, Yuko
2016-08-08
Modular invariance is a striking symmetry in string theory, which may keep stringy corrections under control. In this paper, we investigate a phenomenological consequence of the modular invariance, assuming that this symmetry is preserved as well as in a four dimensional (4D) low energy effective field theory. As a concrete setup, we consider a modulus field T whose contribution in the 4D effective field theory remains invariant under the modular transformation and study inflation drived by T. The modular invariance restricts a possible form of the scalar potenntial. As a result, large field models of inflation are hardly realized. Meanwhile, a small field model of inflation can be still accomodated in this restricted setup. The scalar potential traced during the slow-roll inflation mimics the hilltop potential V{sub ht}, but it also has a non-negligible deviation from V{sub ht}. Detecting the primordial gravitational waves predicted in this model is rather challenging. Yet, we argue that it may be still possible to falsify this model by combining the information in the reheating process which can be determined self-completely in this setup.
Pokhozhaev, Stanislav I
2011-06-30
The notion of Riemann quasi-invariants is introduced and their applications to several conservation laws are considered. The case of nonisentropic flow of an ideal polytropic gas is analysed in detail. Sufficient conditions for gradient catastrophes are obtained. Bibliography: 16 titles.
NASA Astrophysics Data System (ADS)
Kobayashi, Tatsuo; Nitta, Daisuke; Urakawa, Yuko
2016-08-01
Modular invariance is a striking symmetry in string theory, which may keep stringy corrections under control. In this paper, we investigate a phenomenological consequence of the modular invariance, assuming that this symmetry is preserved as well as in a four dimensional (4D) low energy effective field theory. As a concrete setup, we consider a modulus field T whose contribution in the 4D effective field theory remains invariant under the modular transformation and study inflation drived by T. The modular invariance restricts a possible form of the scalar potenntial. As a result, large field models of inflation are hardly realized. Meanwhile, a small field model of inflation can be still accomodated in this restricted setup. The scalar potential traced during the slow-roll inflation mimics the hilltop potential Vht, but it also has a non-negligible deviation from Vht. Detecting the primordial gravitational waves predicted in this model is rather challenging. Yet, we argue that it may be still possible to falsify this model by combining the information in the reheating process which can be determined self-completely in this setup.
Cheng, Jianlin; Saigo, Hiroto; Baldi, Pierre
2006-03-15
The formation of disulphide bridges between cysteines plays an important role in protein folding, structure, function, and evolution. Here, we develop new methods for predicting disulphide bridges in proteins. We first build a large curated data set of proteins containing disulphide bridges to extract relevant statistics. We then use kernel methods to predict whether a given protein chain contains intrachain disulphide bridges or not, and recursive neural networks to predict the bonding probabilities of each pair of cysteines in the chain. These probabilities in turn lead to an accurate estimation of the total number of disulphide bridges and to a weighted graph matching problem that can be addressed efficiently to infer the global disulphide bridge connectivity pattern. This approach can be applied both in situations where the bonded state of each cysteine is known, or in ab initio mode where the state is unknown. Furthermore, it can easily cope with chains containing an arbitrary number of disulphide bridges, overcoming one of the major limitations of previous approaches. It can classify individual cysteine residues as bonded or nonbonded with 87% specificity and 89% sensitivity. The estimate for the total number of bridges in each chain is correct 71% of the times, and within one from the true value over 94% of the times. The prediction of the overall disulphide connectivity pattern is exact in about 51% of the chains. In addition to using profiles in the input to leverage evolutionary information, including true (but not predicted) secondary structure and solvent accessibility information yields small but noticeable improvements. Finally, once the system is trained, predictions can be computed rapidly on a proteomic or protein-engineering scale. The disulphide bridge prediction server (DIpro), software, and datasets are available through www.igb.uci.edu/servers/psss.html.
Wide baseline stereo matching based on double topological relationship consistency
NASA Astrophysics Data System (ADS)
Zou, Xiaohong; Liu, Bin; Song, Xiaoxue; Liu, Yang
2009-07-01
Stereo matching is one of the most important branches in computer vision. In this paper, an algorithm is proposed for wide-baseline stereo vision matching. Here, a novel scheme is presented called double topological relationship consistency (DCTR). The combination of double topological configuration includes the consistency of first topological relationship (CFTR) and the consistency of second topological relationship (CSTR). It not only sets up a more advanced model on matching, but discards mismatches by iteratively computing the fitness of the feature matches and overcomes many problems of traditional methods depending on the powerful invariance to changes in the scale, rotation or illumination across large view changes and even occlusions. Experimental examples are shown where the two cameras have been located in very different orientations. Also, epipolar geometry can be recovered using RANSAC by far the most widely method adopted possibly. By the method, we can obtain correspondences with high precision on wide baseline matching problems. Finally, the effectiveness and reliability of this method are demonstrated in wide-baseline experiments on the image pairs.
Measurement Invariance versus Selection Invariance: Is Fair Selection Possible?
ERIC Educational Resources Information Center
Borsman, Denny; Romeijn, Jan-Willem; Wicherts, Jelte M.
2008-01-01
This article shows that measurement invariance (defined in terms of an invariant measurement model in different groups) is generally inconsistent with selection invariance (defined in terms of equal sensitivity and specificity across groups). In particular, when a unidimensional measurement instrument is used and group differences are present in…
Lin, Yang; Lin, Zhouchen; Zha, Hongbin
2017-02-01
Mismatch removal is a key step in many computer vision problems. In this paper, we handle the mismatch removal problem by adopting shape interaction matrix (SIM). Given the homogeneous coordinates of the two corresponding point sets, we first compute the SIMs of the two point sets. Then, we detect the mismatches by picking out the most different entries between the two SIMs. Even under strong affine transformations, outliers, noises, and burstiness, our method can still work well. Actually, this paper is the first non-iterative mismatch removal method that achieves affine invariance. Extensive results on synthetic 2D points matching data sets and real image matching data sets verify the effectiveness, efficiency, and robustness of our method in removing mismatches. Moreover, when applied to partial-duplicate image search, our method reaches higher retrieval precisions with shorter time cost compared with the state-of-the-art geometric verification methods.
Blurred image recognition by legendre moment invariants
Zhang, Hui; Shu, Huazhong; Han, Guo-Niu; Coatrieux, Gouenou; Luo, Limin; Coatrieux, Jean-Louis
2010-01-01
Processing blurred images is a key problem in many image applications. Existing methods to obtain blur invariants which are invariant with respect to centrally symmetric blur are based on geometric moments or complex moments. In this paper, we propose a new method to construct a set of blur invariants using the orthogonal Legendre moments. Some important properties of Legendre moments for the blurred image are presented and proved. The performance of the proposed descriptors is evaluated with various point-spread functions and different image noises. The comparison of the present approach with previous methods in terms of pattern recognition accuracy is also provided. The experimental results show that the proposed descriptors are more robust to noise and have better discriminative power than the methods based on geometric or complex moments. PMID:19933003
Austin, Peter C
2011-05-20
Propensity-score matching allows one to reduce the effects of treatment-selection bias or confounding when estimating the effects of treatments when using observational data. Some authors have suggested that methods of inference appropriate for independent samples can be used for assessing the statistical significance of treatment effects when using propensity-score matching. Indeed, many authors in the applied medical literature use methods for independent samples when making inferences about treatment effects using propensity-score matched samples. Dichotomous outcomes are common in healthcare research. In this study, we used Monte Carlo simulations to examine the effect on inferences about risk differences (or absolute risk reductions) when statistical methods for independent samples are used compared with when statistical methods for paired samples are used in propensity-score matched samples. We found that compared with using methods for independent samples, the use of methods for paired samples resulted in: (i) empirical type I error rates that were closer to the advertised rate; (ii) empirical coverage rates of 95 per cent confidence intervals that were closer to the advertised rate; (iii) narrower 95 per cent confidence intervals; and (iv) estimated standard errors that more closely reflected the sampling variability of the estimated risk difference. Differences between the empirical and advertised performance of methods for independent samples were greater when the treatment-selection process was stronger compared with when treatment-selection process was weaker. We recommend using statistical methods for paired samples when using propensity-score matched samples for making inferences on the effect of treatment on the reduction in the probability of an event occurring.
Matching a Distribution by Matching Quantiles Estimation
Sgouropoulos, Nikolaos; Yao, Qiwei; Yastremiz, Claudia
2015-01-01
Motivated by the problem of selecting representative portfolios for backtesting counterparty credit risks, we propose a matching quantiles estimation (MQE) method for matching a target distribution by that of a linear combination of a set of random variables. An iterative procedure based on the ordinary least-squares estimation (OLS) is proposed to compute MQE. MQE can be easily modified by adding a LASSO penalty term if a sparse representation is desired, or by restricting the matching within certain range of quantiles to match a part of the target distribution. The convergence of the algorithm and the asymptotic properties of the estimation, both with or without LASSO, are established. A measure and an associated statistical test are proposed to assess the goodness-of-match. The finite sample properties are illustrated by simulation. An application in selecting a counterparty representative portfolio with a real dataset is reported. The proposed MQE also finds applications in portfolio tracking, which demonstrates the usefulness of combining MQE with LASSO. PMID:26692592
Matching a Distribution by Matching Quantiles Estimation.
Sgouropoulos, Nikolaos; Yao, Qiwei; Yastremiz, Claudia
2015-04-03
Motivated by the problem of selecting representative portfolios for backtesting counterparty credit risks, we propose a matching quantiles estimation (MQE) method for matching a target distribution by that of a linear combination of a set of random variables. An iterative procedure based on the ordinary least-squares estimation (OLS) is proposed to compute MQE. MQE can be easily modified by adding a LASSO penalty term if a sparse representation is desired, or by restricting the matching within certain range of quantiles to match a part of the target distribution. The convergence of the algorithm and the asymptotic properties of the estimation, both with or without LASSO, are established. A measure and an associated statistical test are proposed to assess the goodness-of-match. The finite sample properties are illustrated by simulation. An application in selecting a counterparty representative portfolio with a real dataset is reported. The proposed MQE also finds applications in portfolio tracking, which demonstrates the usefulness of combining MQE with LASSO.
2010-12-02
evaluating the function ΘP (A) for any fixed A,P is equivalent to solving the so-called Quadratic Assignment Problem ( QAP ), and thus we can employ various...tractable linear programming, spectral, and SDP relaxations of QAP [40, 11, 33]. In particular we discuss recent work [14] on exploiting group...symmetry in SDP relaxations of QAP , which is useful for approximately computing elementary convex graph invariants in many interesting cases. Finally in
Pevsner, A; Davis, B; Joshi, S; Hertanto, A; Mechalakos, J; Yorke, E; Rosenzweig, K; Nehmeh, S; Erdi, Y E; Humm, J L; Larson, S; Ling, C C; Mageras, G S
2006-02-01
We have evaluated an automated registration procedure for predicting tumor and lung deformation based on CT images of the thorax obtained at different respiration phases. The method uses a viscous fluid model of tissue deformation to map voxels from one CT dataset to another. To validate the deformable matching algorithm we used a respiration-correlated CT protocol to acquire images at different phases of the respiratory cycle for six patients with nonsmall cell lung carcinoma. The position and shape of the deformable gross tumor volumes (GTV) at the end-inhale (EI) phase predicted by the algorithm was compared to those drawn by four observers. To minimize interobserver differences, all observers used the contours drawn by a single observer at end-exhale (EE) phase as a guideline to outline GTV contours at EI. The differences between model-predicted and observer-drawn GTV surfaces at EI, as well as differences between structures delineated by observers at EI (interobserver variations) were evaluated using a contour comparison algorithm written for this purpose, which determined the distance between the two surfaces along different directions. The mean and 90% confidence interval for model-predicted versus observer-drawn GTV surface differences over all patients and all directions were 2.6 and 5.1 mm, respectively, whereas the mean and 90% confidence interval for interobserver differences were 2.1 and 3.7 mm. We have also evaluated the algorithm's ability to predict normal tissue deformations by examining the three-dimensional (3-D) vector displacement of 41 landmarks placed by each observer at bronchial and vascular branch points in the lung between the EE and EI image sets (mean and 90% confidence interval displacements of 11.7 and 25.1 mm, respectively). The mean and 90% confidence interval discrepancy between model-predicted and observer-determined landmark displacements over all patients were 2.9 and 7.3 mm, whereas interobserver discrepancies were 2.8 and 6
Passive digital image authentication algorithm based on Tchebichef moment invariants
NASA Astrophysics Data System (ADS)
Li, Mei; Gu, Zongyun; Kan, Junling
2010-12-01
This paper presents a new passive image authenticate algorithm to check and measure the forged pictures and images in the regional copies and sticks. After reducing the image dimension by DWT (Discrete Wavelet Transform), the Tchebichef moment invariants is applied to the fixed sized overlapping blocks of a low-frequency image in the wavelet sub-band, and the eigenvectors are lexicographically sorted. Then, similar eigenvectors are matched by a certain threshold. Finally, the forgery part is identified by the threshold analysis. The experimental results show that proposed method can not only localize the copy forgery regions accurately, but also undergone some attacks like random noise contamination, lossy JPEG(Joint Photographic Experts Group) compression, rotation transformation etc. and reduce the amount of computation and improve the detection efficiency.
Passive digital image authentication algorithm based on Tchebichef moment invariants
NASA Astrophysics Data System (ADS)
Li, Mei; Gu, Zongyun; Kan, Junling
2011-05-01
This paper presents a new passive image authenticate algorithm to check and measure the forged pictures and images in the regional copies and sticks. After reducing the image dimension by DWT (Discrete Wavelet Transform), the Tchebichef moment invariants is applied to the fixed sized overlapping blocks of a low-frequency image in the wavelet sub-band, and the eigenvectors are lexicographically sorted. Then, similar eigenvectors are matched by a certain threshold. Finally, the forgery part is identified by the threshold analysis. The experimental results show that proposed method can not only localize the copy forgery regions accurately, but also undergone some attacks like random noise contamination, lossy JPEG(Joint Photographic Experts Group) compression, rotation transformation etc. and reduce the amount of computation and improve the detection efficiency.
Wille, M-L; Zapf, M; Ruiter, N V; Gemmeke, H; Langton, C M
2015-06-21
The quality of ultrasound computed tomography imaging is primarily determined by the accuracy of ultrasound transit time measurement. A major problem in analysis is the overlap of signals making it difficult to detect the correct transit time. The current standard is to apply a matched-filtering approach to the input and output signals. This study compares the matched-filtering technique with active set deconvolution to derive a transit time spectrum from a coded excitation chirp signal and the measured output signal. The ultrasound wave travels in a direct and a reflected path to the receiver, resulting in an overlap in the recorded output signal. The matched-filtering and deconvolution techniques were applied to determine the transit times associated with the two signal paths. Both techniques were able to detect the two different transit times; while matched-filtering has a better accuracy (0.13 μs versus 0.18 μs standard deviations), deconvolution has a 3.5 times improved side-lobe to main-lobe ratio. A higher side-lobe suppression is important to further improve image fidelity. These results suggest that a future combination of both techniques would provide improved signal detection and hence improved image fidelity.
Image registration and object recognition using affine invariants and convex hulls.
Yang, Z; Cohen, F S
1999-01-01
This paper is concerned with the problem of feature point registration and scene recognition from images under weak perspective transformations which are well approximated by affine transformations and under possible occlusion and/or appearance of new objects. It presents a set of local absolute affine invariants derived from the convex hull of scattered feature points (e.g., fiducial or marking points, corner points, inflection points, etc.) extracted from the image. The affine invariants are constructed from the areas of the triangles formed by connecting three vertices among a set of four consecutive vertices (quadruplets) of the convex hull, and hence do make direct use of the area invariance property associated with the affine transformation. Because they are locally constructed, they are very well suited to handle the occlusion and/or appearance of new objects. These invariants are used to establish the correspondences between the convex hull vertices of a test image with a reference image in order to undo the affine transformation between them. A point matching approach for recognition follows this. The time complexity for registering L feature points on the test image with N feature points of the reference image is of order O(N x L). The method has been tested on real indoor and outdoor images and performs well.
Automated transformation-invariant shape recognition through wavelet multiresolution
NASA Astrophysics Data System (ADS)
Brault, Patrice; Mounier, Hugues
2001-12-01
We present here new results in Wavelet Multi-Resolution Analysis (W-MRA) applied to shape recognition in automatic vehicle driving applications. Different types of shapes have to be recognized in this framework. They pertain to most of the objects entering the sensors field of a car. These objects can be road signs, lane separation lines, moving or static obstacles, other automotive vehicles, or visual beacons. The recognition process must be invariant to global, affine or not, transformations which are : rotation, translation and scaling. It also has to be invariant to more local, elastic, deformations like the perspective (in particular with wide angle camera lenses), and also like deformations due to environmental conditions (weather : rain, mist, light reverberation) or optical and electrical signal noises. To demonstrate our method, an initial shape, with a known contour, is compared to the same contour altered by rotation, translation, scaling and perspective. The curvature computed for each contour point is used as a main criterion in the shape matching process. The original part of this work is to use wavelet descriptors, generated with a fast orthonormal W-MRA, rather than Fourier descriptors, in order to provide a multi-resolution description of the contour to be analyzed. In such way, the intrinsic spatial localization property of wavelet descriptors can be used and the recognition process can be speeded up. The most important part of this work is to demonstrate the potential performance of Wavelet-MRA in this application of shape recognition.
Galilean invariant resummation schemes of cosmological perturbations
NASA Astrophysics Data System (ADS)
Peloso, Marco; Pietroni, Massimo
2017-01-01
Many of the methods proposed so far to go beyond Standard Perturbation Theory break invariance under time-dependent boosts (denoted here as extended Galilean Invariance, or GI). This gives rise to spurious large scale effects which spoil the small scale predictions of these approximation schemes. By using consistency relations we derive fully non-perturbative constraints that GI imposes on correlation functions. We then introduce a method to quantify the amount of GI breaking of a given scheme, and to correct it by properly tailored counterterms. Finally, we formulate resummation schemes which are manifestly GI, discuss their general features, and implement them in the so called Time-Flow, or TRG, equations.
Caetano, Tibério S; McAuley, Julian J; Cheng, Li; Le, Quoc V; Smola, Alex J
2009-06-01
As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the 'labels' are matches between them. Our experimental results reveal that learning can substantially improve the performance of standard graph matching algorithms. In particular, we find that simple linear assignment with such a learning scheme outperforms Graduated Assignment with bistochastic normalisation, a state-of-the-art quadratic assignment relaxation algorithm.
Dimensional Analysis Using Toric Ideals: Primitive Invariants
Atherton, Mark A.; Bates, Ronald A.; Wynn, Henry P.
2014-01-01
Classical dimensional analysis in its original form starts by expressing the units for derived quantities, such as force, in terms of power products of basic units etc. This suggests the use of toric ideal theory from algebraic geometry. Within this the Graver basis provides a unique primitive basis in a well-defined sense, which typically has more terms than the standard Buckingham approach. Some textbook examples are revisited and the full set of primitive invariants found. First, a worked example based on convection is introduced to recall the Buckingham method, but using computer algebra to obtain an integer matrix from the initial integer matrix holding the exponents for the derived quantities. The matrix defines the dimensionless variables. But, rather than this integer linear algebra approach it is shown how, by staying with the power product representation, the full set of invariants (dimensionless groups) is obtained directly from the toric ideal defined by . One candidate for the set of invariants is a simple basis of the toric ideal. This, although larger than the rank of , is typically not unique. However, the alternative Graver basis is unique and defines a maximal set of invariants, which are primitive in a simple sense. In addition to the running example four examples are taken from: a windmill, convection, electrodynamics and the hydrogen atom. The method reveals some named invariants. A selection of computer algebra packages is used to show the considerable ease with which both a simple basis and a Graver basis can be found. PMID:25436774
Karell, Mara A; Langstaff, Helen K; Halazonetis, Demetrios J; Minghetti, Caterina; Frelat, Mélanie; Kranioti, Elena F
2016-09-01
The commingling of human remains often hinders forensic/physical anthropologists during the identification process, as there are limited methods to accurately sort these remains. This study investigates a new method for pair-matching, a common individualization technique, which uses digital three-dimensional models of bone: mesh-to-mesh value comparison (MVC). The MVC method digitally compares the entire three-dimensional geometry of two bones at once to produce a single value to indicate their similarity. Two different versions of this method, one manual and the other automated, were created and then tested for how well they accurately pair-matched humeri. Each version was assessed using sensitivity and specificity. The manual mesh-to-mesh value comparison method was 100 % sensitive and 100 % specific. The automated mesh-to-mesh value comparison method was 95 % sensitive and 60 % specific. Our results indicate that the mesh-to-mesh value comparison method overall is a powerful new tool for accurately pair-matching commingled skeletal elements, although the automated version still needs improvement.
NASA Astrophysics Data System (ADS)
Millán, María S.
2012-10-01
On the verge of the 50th anniversary of Vander Lugt’s formulation for pattern matching based on matched filtering and optical correlation, we acknowledge the very intense research activity developed in the field of correlation-based pattern recognition during this period of time. The paper reviews some domains that appeared as emerging fields in the last years of the 20th century and have been developed later on in the 21st century. Such is the case of three-dimensional (3D) object recognition, biometric pattern matching, optical security and hybrid optical-digital processors. 3D object recognition is a challenging case of multidimensional image recognition because of its implications in the recognition of real-world objects independent of their perspective. Biometric recognition is essentially pattern recognition for which the personal identification is based on the authentication of a specific physiological characteristic possessed by the subject (e.g. fingerprint, face, iris, retina, and multifactor combinations). Biometric recognition often appears combined with encryption-decryption processes to secure information. The optical implementations of correlation-based pattern recognition processes still rely on the 4f-correlator, the joint transform correlator, or some of their variants. But the many applications developed in the field have been pushing the systems for a continuous improvement of their architectures and algorithms, thus leading towards merged optical-digital solutions.
Perspective Projection Invariants,
1986-02-01
ORGANIZATION NAME ANC ADDRESS 10. PROGRAM ELEMENT. PROJECT. TASK Artificial Inteligence Laboratory AREA & WORK UNIT NUMBERSO 545 Technology Square dCambridge...AD-AI67 793 PERSPECTIVE PROJECTION INVARIANTS(U) MASSACHUSETTS INST 1/1~ OF TECH CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB VERRI ET AL, FEB 86 AI-M-832...0R020I4 661 SEC R TVC PAGE fjSr .W IlIII UI A 8 gT@OFTNS21 07 1 MASSACHUSETTS INSTITUTE OF TECHNOLOGY ARTIFICIAL INTELLIGENCE LABORATORY and CENTER
Gauge invariance of quantum gravity in the causal approach
NASA Astrophysics Data System (ADS)
Schorn, Ivo
1997-03-01
We investigate gauge invariance of perturbative quantum gravity without matter fields in the causal Epstein - Glaser approach. This approach uses free fields only so that all objects of the theory are mathematically well defined. The first-order graviton self-couplings are obtained from the Einstein - Hilbert Lagrangian written in terms of Goldberg variables and expanded to lowest order on the flat Minkowski background metric (linearized Einstein theory). Similar to Yang - Mills theory, gauge invariance to first order requires an additional coupling to fermionic ghost fields. For second-order tree graphs, gauge invariance generates four-graviton normalization terms, which agree exactly with the next order of the expansion of the Einstein - Hilbert Lagrangian. Gauge invariance of the ghost sector is then examined in detail. It is stressed that, despite some formal similarities, the concept of operator gauge invariance used in the causal method is different from the conventional BRS-invariance commonly used in the literature.
Image Segmentation, Registration, Compression, and Matching
NASA Technical Reports Server (NTRS)
Yadegar, Jacob; Wei, Hai; Yadegar, Joseph; Ray, Nilanjan; Zabuawala, Sakina
2011-01-01
A novel computational framework was developed of a 2D affine invariant matching exploiting a parameter space. Named as affine invariant parameter space (AIPS), the technique can be applied to many image-processing and computer-vision problems, including image registration, template matching, and object tracking from image sequence. The AIPS is formed by the parameters in an affine combination of a set of feature points in the image plane. In cases where the entire image can be assumed to have undergone a single affine transformation, the new AIPS match metric and matching framework becomes very effective (compared with the state-of-the-art methods at the time of this reporting). No knowledge about scaling or any other transformation parameters need to be known a priori to apply the AIPS framework. An automated suite of software tools has been created to provide accurate image segmentation (for data cleaning) and high-quality 2D image and 3D surface registration (for fusing multi-resolution terrain, image, and map data). These tools are capable of supporting existing GIS toolkits already in the marketplace, and will also be usable in a stand-alone fashion. The toolkit applies novel algorithmic approaches for image segmentation, feature extraction, and registration of 2D imagery and 3D surface data, which supports first-pass, batched, fully automatic feature extraction (for segmentation), and registration. A hierarchical and adaptive approach is taken for achieving automatic feature extraction, segmentation, and registration. Surface registration is the process of aligning two (or more) data sets to a common coordinate system, during which the transformation between their different coordinate systems is determined. Also developed here are a novel, volumetric surface modeling and compression technique that provide both quality-guaranteed mesh surface approximations and compaction of the model sizes by efficiently coding the geometry and connectivity
Binary optical filters for scale invariant pattern recognition
NASA Technical Reports Server (NTRS)
Reid, Max B.; Downie, John D.; Hine, Butler P.
1992-01-01
Binary synthetic discriminant function (BSDF) optical filters which are invariant to scale changes in the target object of more than 50 percent are demonstrated in simulation and experiment. Efficient databases of scale invariant BSDF filters can be designed which discriminate between two very similar objects at any view scaled over a factor of 2 or more. The BSDF technique has considerable advantages over other methods for achieving scale invariant object recognition, as it also allows determination of the object's scale. In addition to scale, the technique can be used to design recognition systems invariant to other geometric distortions.
De Roover, Kim; Timmerman, Marieke E.; De Leersnyder, Jozefien; Mesquita, Batja; Ceulemans, Eva
2014-01-01
The issue of measurement invariance is ubiquitous in the behavioral sciences nowadays as more and more studies yield multivariate multigroup data. When measurement invariance cannot be established across groups, this is often due to different loadings on only a few items. Within the multigroup CFA framework, methods have been proposed to trace such non-invariant items, but these methods have some disadvantages in that they require researchers to run a multitude of analyses and in that they imply assumptions that are often questionable. In this paper, we propose an alternative strategy which builds on clusterwise simultaneous component analysis (SCA). Clusterwise SCA, being an exploratory technique, assigns the groups under study to a few clusters based on differences and similarities in the component structure of the items, and thus based on the covariance matrices. Non-invariant items can then be traced by comparing the cluster-specific component loadings via congruence coefficients, which is far more parsimonious than comparing the component structure of all separate groups. In this paper we present a heuristic for this procedure. Afterwards, one can return to the multigroup CFA framework and check whether removing the non-invariant items or removing some of the equality restrictions for these items, yields satisfactory invariance test results. An empirical application concerning cross-cultural emotion data is used to demonstrate that this novel approach is useful and can co-exist with the traditional CFA approaches. PMID:24999335
Zhen, Xin; Chen, Haibin; Yan, Hao; Zhou, Linghong; Mell, Loren K; Yashar, Catheryn M; Jiang, Steve; Jia, Xun; Gu, Xuejun; Cervino, Laura
2015-04-07
Deformable image registration (DIR) of fractional high-dose-rate (HDR) CT images is challenging due to the presence of applicators in the brachytherapy image. Point-to-point correspondence fails because of the undesired deformation vector fields (DVF) propagated from the applicator region (AR) to the surrounding tissues, which can potentially introduce significant DIR errors in dose mapping. This paper proposes a novel segmentation and point-matching enhanced efficient DIR (named SPEED) scheme to facilitate dose accumulation among HDR treatment fractions. In SPEED, a semi-automatic seed point generation approach is developed to obtain the incremented fore/background point sets to feed the random walks algorithm, which is used to segment and remove the AR, leaving empty AR cavities in the HDR CT images. A feature-based 'thin-plate-spline robust point matching' algorithm is then employed for AR cavity surface points matching. With the resulting mapping, a DVF defining on each voxel is estimated by B-spline approximation, which serves as the initial DVF for the subsequent Demons-based DIR between the AR-free HDR CT images. The calculated DVF via Demons combined with the initial one serve as the final DVF to map doses between HDR fractions. The segmentation and registration accuracy are quantitatively assessed by nine clinical HDR cases from three gynecological cancer patients. The quantitative analysis and visual inspection of the DIR results indicate that SPEED can suppress the impact of applicator on DIR, and accurately register HDR CT images as well as deform and add interfractional HDR doses.
Nelson, Andrew; Chomitz, Kenneth M.
2011-01-01
Protected areas (PAs) cover a quarter of the tropical forest estate. Yet there is debate over the effectiveness of PAs in reducing deforestation, especially when local people have rights to use the forest. A key analytic problem is the likely placement of PAs on marginal lands with low pressure for deforestation, biasing comparisons between protected and unprotected areas. Using matching techniques to control for this bias, this paper analyzes the global tropical forest biome using forest fires as a high resolution proxy for deforestation; disaggregates impacts by remoteness, a proxy for deforestation pressure; and compares strictly protected vs. multiple use PAs vs indigenous areas. Fire activity was overlaid on a 1 km map of tropical forest extent in 2000; land use change was inferred for any point experiencing one or more fires. Sampled points in pre-2000 PAs were matched with randomly selected never-protected points in the same country. Matching criteria included distance to road network, distance to major cities, elevation and slope, and rainfall. In Latin America and Asia, strict PAs substantially reduced fire incidence, but multi-use PAs were even more effective. In Latin America, where there is data on indigenous areas, these areas reduce forest fire incidence by 16 percentage points, over two and a half times as much as naïve (unmatched) comparison with unprotected areas would suggest. In Africa, more recently established strict PAs appear to be effective, but multi-use tropical forest protected areas yield few sample points, and their impacts are not robustly estimated. These results suggest that forest protection can contribute both to biodiversity conservation and CO2 mitigation goals, with particular relevance to the REDD agenda. Encouragingly, indigenous areas and multi-use protected areas can help to accomplish these goals, suggesting some compatibility between global environmental goals and support for local livelihoods. PMID:21857950
Furukawa, M.; Tokuda, S.
2012-10-15
A matching method using a finite-width inner region is extended for stability analysis of magnetohydrodynamic mode including diamagnetic drift effect. The inclusion of the diamagnetic drift effect is accomplished by a newly developed ordering scheme in the outer region. The ordering scheme enables us to derive a hierarchy of generalized Newcomb equations. Higher-order equations give us correction of outer solution due to the diamagnetic drift effect as well as inertia and resistivity. By this correction, the accuracy of the dispersion relation is improved. Several numerical results are presented to demonstrate good performance of the matching method. Dropping the diamagnetic drift effect in the outer region leads to less accurate results.
Coordinate Projection-based Solver for ODE with Invariants
Serban, Radu
2008-04-08
CPODES is a general purpose (serial and parallel) solver for systems of ordinary differential equation (ODE) with invariants. It implements a coordinate projection approach using different types of projection (orthogonal or oblique) and one of several methods for the decompositon of the Jacobian of the invariant equations.
Factorial Invariance in Multiple Populations: A Multiple Testing Procedure
ERIC Educational Resources Information Center
Raykov, Tenko; Marcoulides, George A.; Millsap, Roger E.
2013-01-01
A multiple testing method for examining factorial invariance for latent constructs evaluated by multiple indicators in distinct populations is outlined. The procedure is based on the false discovery rate concept and multiple individual restriction tests and resolves general limitations of a popular factorial invariance testing approach. The…
Bifurcation from an invariant to a non-invariant attractor
NASA Astrophysics Data System (ADS)
Mandal, D.
2016-12-01
Switching dynamical systems are very common in many areas of physics and engineering. We consider a piecewise linear map that periodically switches between more than one different functional forms. We show that in such systems it is possible to have a border collision bifurcation where the system transits from an invariant attractor to a non-invariant attractor.
Zeng, Huanhuan; Wang, Jin; Ye, Qing; Deng, Zhichao; Mei, Jianchun; Zhou, Wenyuan; Zhang, Chunping; Tian, Jianguo
2014-01-01
In recent years, the tissue optical clearing (OC) technique in the biomedicine field has drawn lots of attention. Various physical and chemical methods have been introduced to improve the efficacy of OC. In this study, the effect of the combination of glycerol and ultrasound treatment on OC of in vitro porcine muscle tissues has been investigated. The refractive index (RI) matching mechanism of OC was directly observed based on the derivative total reflection method. A theoretical model was used to simulate the proportion of tissue fluid in the illuminated area. Moreover, the total transmittance spectra have been obtained by a spectrometer over the range from 450 nm to 700 nm. The administration of glycerol and ultrasound has led to an increase of the RI of background medium and a more RI matching environment was achieved. The experimental results support the validity of the ultrasound treatment for OC. The RI matching mechanism has been firstly quantitatively analyzed based on the derivative total reflection method. PMID:25360366
NASA Astrophysics Data System (ADS)
Zhen, Xin; Chen, Haibin; Yan, Hao; Zhou, Linghong; Mell, Loren K.; Yashar, Catheryn M.; Jiang, Steve; Jia, Xun; Gu, Xuejun; Cervino, Laura
2015-04-01
Deformable image registration (DIR) of fractional high-dose-rate (HDR) CT images is challenging due to the presence of applicators in the brachytherapy image. Point-to-point correspondence fails because of the undesired deformation vector fields (DVF) propagated from the applicator region (AR) to the surrounding tissues, which can potentially introduce significant DIR errors in dose mapping. This paper proposes a novel segmentation and point-matching enhanced efficient DIR (named SPEED) scheme to facilitate dose accumulation among HDR treatment fractions. In SPEED, a semi-automatic seed point generation approach is developed to obtain the incremented fore/background point sets to feed the random walks algorithm, which is used to segment and remove the AR, leaving empty AR cavities in the HDR CT images. A feature-based ‘thin-plate-spline robust point matching’ algorithm is then employed for AR cavity surface points matching. With the resulting mapping, a DVF defining on each voxel is estimated by B-spline approximation, which serves as the initial DVF for the subsequent Demons-based DIR between the AR-free HDR CT images. The calculated DVF via Demons combined with the initial one serve as the final DVF to map doses between HDR fractions. The segmentation and registration accuracy are quantitatively assessed by nine clinical HDR cases from three gynecological cancer patients. The quantitative analysis and visual inspection of the DIR results indicate that SPEED can suppress the impact of applicator on DIR, and accurately register HDR CT images as well as deform and add interfractional HDR doses.
Zhen, X; Chen, H; Zhou, L; Yan, H; Jiang, S; Jia, X; Gu, X; Mell, L; Yashar, C; Cervino, L
2014-06-15
Purpose: To propose and validate a novel and accurate deformable image registration (DIR) scheme to facilitate dose accumulation among treatment fractions of high-dose-rate (HDR) gynecological brachytherapy. Method: We have developed a method to adapt DIR algorithms to gynecologic anatomies with HDR applicators by incorporating a segmentation step and a point-matching step into an existing DIR framework. In the segmentation step, random walks algorithm is used to accurately segment and remove the applicator region (AR) in the HDR CT image. A semi-automatic seed point generation approach is developed to obtain the incremented foreground and background point sets to feed the random walks algorithm. In the subsequent point-matching step, a feature-based thin-plate spline-robust point matching (TPS-RPM) algorithm is employed for AR surface point matching. With the resulting mapping, a DVF characteristic of the deformation between the two AR surfaces is generated by B-spline approximation, which serves as the initial DVF for the following Demons DIR between the two AR-free HDR CT images. Finally, the calculated DVF via Demons combined with the initial one serve as the final DVF to map doses between HDR fractions. Results: The segmentation and registration accuracy are quantitatively assessed by nine clinical HDR cases from three gynecological cancer patients. The quantitative results as well as the visual inspection of the DIR indicate that our proposed method can suppress the interference of the applicator with the DIR algorithm, and accurately register HDR CT images as well as deform and add interfractional HDR doses. Conclusions: We have developed a novel and robust DIR scheme that can perform registration between HDR gynecological CT images and yield accurate registration results. This new DIR scheme has potential for accurate interfractional HDR dose accumulation. This work is supported in part by the National Natural ScienceFoundation of China (no 30970866 and no
NASA Technical Reports Server (NTRS)
Pototzky, Anthony S.; Heeg, Jennifer; Perry, Boyd, III
1990-01-01
Time-correlated gust loads are time histories of two or more load quantities due to the same disturbance time history. Time correlation provides knowledge of the value (magnitude and sign) of one load when another is maximum. At least two analysis methods have been identified that are capable of computing maximized time-correlated gust loads for linear aircraft. Both methods solve for the unit-energy gust profile (gust velocity as a function of time) that produces the maximum load at a given location on a linear airplane. Time-correlated gust loads are obtained by re-applying this gust profile to the airplane and computing multiple simultaneous load responses. Such time histories are physically realizable and may be applied to aircraft structures. Within the past several years there has been much interest in obtaining a practical analysis method which is capable of solving the analogous problem for nonlinear aircraft. Such an analysis method has been the focus of an international committee of gust loads specialists formed by the U.S. Federal Aviation Administration and was the topic of a panel discussion at the Gust and Buffet Loads session at the 1989 SDM Conference in Mobile, Alabama. The kinds of nonlinearities common on modern transport aircraft are indicated. The Statical Discrete Gust method is capable of being, but so far has not been, applied to nonlinear aircraft. To make the method practical for nonlinear applications, a search procedure is essential. Another method is based on Matched Filter Theory and, in its current form, is applicable to linear systems only. The purpose here is to present the status of an attempt to extend the matched filter approach to nonlinear systems. The extension uses Matched Filter Theory as a starting point and then employs a constrained optimization algorithm to attack the nonlinear problem.
Yu, Chen-Chieh; Ho, Kuan-Hung; Chen, Hsuen-Li; Chuang, Shang-Yu; Tseng, Shao-Chin; Su, Wei-Fang
2012-03-15
In this study, we prepared metallic corrugated structures for use as highly sensitive plasmonic sensors. Relying on the direct nanoimprint-in-metal method, fabrication of this metallic corrugated structure was readily achieved in a single step. The metallic corrugated structures were capable of sensing both surface plasmon resonance (SPR) wavelengths and index-matching effects. The corrugated Au films exhibited high sensitivity (ca. 800 nm/RIU), comparable with or even higher than those of other reported SPR-based sensors. Because of the unique index-matching effect, refractometric sensing could also be performed by measuring the transmission intensity of the Au/substrate SPR mode-conveniently, without a spectrometer. In the last, we demonstrated the corrugated Au film was capable of sensing biomolecules, revealing the ability of the structure to be a highly sensitive biosensor.
Invariant Measures for Cherry Flows
NASA Astrophysics Data System (ADS)
Saghin, Radu; Vargas, Edson
2013-01-01
We investigate the invariant probability measures for Cherry flows, i.e. flows on the two-torus which have a saddle, a source, and no other fixed points, closed orbits or homoclinic orbits. In the case when the saddle is dissipative or conservative we show that the only invariant probability measures are the Dirac measures at the two fixed points, and the Dirac measure at the saddle is the physical measure. In the other case we prove that there exists also an invariant probability measure supported on the quasi-minimal set, we discuss some situations when this other invariant measure is the physical measure, and conjecture that this is always the case. The main techniques used are the study of the integrability of the return time with respect to the invariant measure of the return map to a closed transversal to the flow, and the study of the close returns near the saddle.
Physical Invariants of Intelligence
NASA Technical Reports Server (NTRS)
Zak, Michail
2010-01-01
A program of research is dedicated to development of a mathematical formalism that could provide, among other things, means by which living systems could be distinguished from non-living ones. A major issue that arises in this research is the following question: What invariants of mathematical models of the physics of systems are (1) characteristic of the behaviors of intelligent living systems and (2) do not depend on specific features of material compositions heretofore considered to be characteristic of life? This research at earlier stages has been reported, albeit from different perspectives, in numerous previous NASA Tech Briefs articles. To recapitulate: One of the main underlying ideas is to extend the application of physical first principles to the behaviors of living systems. Mathematical models of motor dynamics are used to simulate the observable physical behaviors of systems or objects of interest, and models of mental dynamics are used to represent the evolution of the corresponding knowledge bases. For a given system, the knowledge base is modeled in the form of probability distributions and the mental dynamics is represented by models of the evolution of the probability densities or, equivalently, models of flows of information. At the time of reporting the information for this article, the focus of this research was upon the following aspects of the formalism: Intelligence is considered to be a means by which a living system preserves itself and improves its ability to survive and is further considered to manifest itself in feedback from the mental dynamics to the motor dynamics. Because of the feedback from the mental dynamics, the motor dynamics attains quantum-like properties: The trajectory of the physical aspect of the system in the space of dynamical variables splits into a family of different trajectories, and each of those trajectories can be chosen with a probability prescribed by the mental dynamics. From a slightly different perspective
Qiao, Yu; Wang, Wei; Minematsu, Nobuaki; Liu, Jianzhuang; Takeda, Mitsuo; Tang, Xiaoou
2009-10-01
This paper studies phase singularities (PSs) for image representation. We show that PSs calculated with Laguerre-Gauss filters contain important information and provide a useful tool for image analysis. PSs are invariant to image translation and rotation. We introduce several invariant features to characterize the core structures around PSs and analyze the stability of PSs to noise addition and scale change. We also study the characteristics of PSs in a scale space, which lead to a method to select key scales along phase singularity curves. We demonstrate two applications of PSs: object tracking and image matching. In object tracking, we use the iterative closest point algorithm to determine the correspondences of PSs between two adjacent frames. The use of PSs allows us to precisely determine the motions of tracked objects. In image matching, we combine PSs and scale-invariant feature transform (SIFT) descriptor to deal with the variations between two images and examine the proposed method on a benchmark database. The results indicate that our method can find more correct matching pairs with higher repeatability rates than some well-known methods.
NASA Astrophysics Data System (ADS)
Kim, Kihong; Rotermund, F.; Lim, H.
2008-01-01
We revisit the problem of disorder-enhanced tunneling transmission of a quantum mechanical particle through a disordered tunneling barrier in one dimension. Using the invariant imbedding theory of wave propagation generalized to randomly stratified media, we calculate the disorder-averaged logarithmic transmittance in the thick barrier limit and the disorder-averaged transmittance in a numerically exact manner. We confirm that the tunneling decay length obtained from the mean logarithmic transmittance behaves nonmonotonically as a function of the disorder strength and takes its maximum value at some finite value of the disorder parameter. We find that this nonmonotonic dependence persists in the presence of weak inelastic scattering inside the tunneling barrier. When the system size is larger than some critical value, which is somewhat smaller than the wavelength of the incident matter wave, we observe that the disorder-averaged transmittance also shows a similar nonmonotonic dependence on the disorder strength. In other words, weak disorder enhances the transmission, while strong disorder suppresses it. When the system size is smaller than the critical value, the disorder-averaged transmittance decreases monotonically as the disorder strength increases.
Relaxation matching algorithm for moving photogrammetry
NASA Astrophysics Data System (ADS)
Guo, Lei; Liu, Ke; Miao, Yinxiao; Zhu, Jigui
2015-02-01
Moving photogrammetry is an application of close range photogrammetry in industrial measurement to realize threedimensional coordinate measurement within large-scale volume. This paper describes an approach of relaxation matching algorithm applicable to moving photogrammetry according to the characteristics of accurate matching result of different measuring images. This method uses neighborhood matching support to improve the matching rate after coarse matching based on epipolar geometry constraint and precise matching using three images. It reflects the overall matching effect of all points, that means when a point is matched correctly, the matching results of those points round it must be correct. So for one point considered, the matching results of points round it are calculated to judge whether its result is correct. Analysis indicates that relaxation matching can eliminate the mismatching effectively and acquire 100% rate of correct matching. It will play a very important role in moving photogrammetry to ensure the following implement of ray bundle adjustment.
Dimensional analysis using toric ideals: primitive invariants.
Atherton, Mark A; Bates, Ronald A; Wynn, Henry P
2014-01-01
Classical dimensional analysis in its original form starts by expressing the units for derived quantities, such as force, in terms of power products of basic units [Formula: see text] etc. This suggests the use of toric ideal theory from algebraic geometry. Within this the Graver basis provides a unique primitive basis in a well-defined sense, which typically has more terms than the standard Buckingham approach. Some textbook examples are revisited and the full set of primitive invariants found. First, a worked example based on convection is introduced to recall the Buckingham method, but using computer algebra to obtain an integer [Formula: see text] matrix from the initial integer [Formula: see text] matrix holding the exponents for the derived quantities. The [Formula: see text] matrix defines the dimensionless variables. But, rather than this integer linear algebra approach it is shown how, by staying with the power product representation, the full set of invariants (dimensionless groups) is obtained directly from the toric ideal defined by [Formula: see text]. One candidate for the set of invariants is a simple basis of the toric ideal. This, although larger than the rank of [Formula: see text], is typically not unique. However, the alternative Graver basis is unique and defines a maximal set of invariants, which are primitive in a simple sense. In addition to the running example four examples are taken from: a windmill, convection, electrodynamics and the hydrogen atom. The method reveals some named invariants. A selection of computer algebra packages is used to show the considerable ease with which both a simple basis and a Graver basis can be found.
Automated Photogrammetric Image Matching with Sift Algorithm and Delaunay Triangulation
NASA Astrophysics Data System (ADS)
Karagiannis, Georgios; Antón Castro, Francesc; Mioc, Darka
2016-06-01
An algorithm for image matching of multi-sensor and multi-temporal satellite images is developed. The method is based on the SIFT feature detector proposed by Lowe in (Lowe, 1999). First, SIFT feature points are detected independently in two images (reference and sensed image). The features detected are invariant to image rotations, translations, scaling and also to changes in illumination, brightness and 3-dimensional viewpoint. Afterwards, each feature of the reference image is matched with one in the sensed image if, and only if, the distance between them multiplied by a threshold is shorter than the distances between the point and all the other points in the sensed image. Then, the matched features are used to compute the parameters of the homography that transforms the coordinate system of the sensed image to the coordinate system of the reference image. The Delaunay triangulations of each feature set for each image are computed. The isomorphism of the Delaunay triangulations is determined to guarantee the quality of the image matching. The algorithm is implemented in Matlab and tested on World-View 2, SPOT6 and TerraSAR-X image patches.
Image Registration Through The Exploitation Of Perspective Invariant Graphs
NASA Astrophysics Data System (ADS)
Gilmore, John F.
1983-10-01
This paper describes two new techniques of image registration as applied to scenes consisting of natural terrain. The first technique is a syntactic pattern recognition approach which combines the spatial relationships of a point pattern with point classifications to accurately perform image registration. In this approach, a preprocessor analyzes each image in order to identify points of interest and to classify these points based on statistical features. A classified graph possessing perspective invariant properties is created and is converted into a classification-based grammar string. A local match analysis is performed and the best global match is con-structed. A probability-of-match metric is computed in order to evaluate match confidence. The second technique described is an isomorphic graph matching approach called Mean Neighbors (MN). A MN graph is constructed from a given point pattern taking into account the elliptical projections of real world scenes onto a two dimensional surface. This approach exploits the spatial relationships of the given points of interest but neglects the point classifications used in syntactic processing. A projective, perspective invariant graph is constructed for both the reference and sensed images and a mapping of the coincidence edges occurs. A probability of match metric is used to evaluate the confidence of the best mapping.
Quadratic Generalized Scale Invariance
NASA Astrophysics Data System (ADS)
Lovejoy, S.; Schertzer, D.; Addor, J. B.
Nearly twenty years ago, two of us argued that in order to account for the scaling strat- ification of the atmosphere, that an anisotropic "unified scaling model" of the atmo- sphere was required with elliptical dimension 23/9=2.555... "in between" the standard 3-D (small scale) and 2-D large scale model. This model was based on the formal- ism of generalized scale invariance (GSI). Physically, GSI is justified by arguing that various conserved fluxes (energy, buoyancy force variance etc.) should define the ap- propriate notion of scale. In a recent large scale satellite cloud image analysis, we directly confirmed this model by studying the isotropic (angle averaged) horizontal cloud statistics. Mathematically, GSI is based on a a group of scale changing opera- tors and their generators but to date, both analyses (primarily of cloud images) and nu- merical (multifractal) simulations, have been limited to the special case of linear GSI. This has shown that cloud texture can plausibly be associated with local linearizations. However realistic morphologies involve spatially avarying textures; the full non linear GSI is clearly necessary. In this talk, we first show that the observed angle averaged (multi)scaling statistics only give a realtively weak constraint on the nonlinear gner- ator: that the latter can be expressed by self-similar (isotropic) part, and a deviatoric part described (in two dimensions) by an arbitrary scalar potential which contains all the information about the cloud morphology. We then show (using a theorem due to Poincaré) how to reduce nonlinear GSI to linear GSI plus a nonlinear coordinate trans- formation numerically, using this to take multifractal GSI modelling to the next level of approximation: quadratic GSI. We show many examples of the coresponding simu- lations which include transitions from various morphologies (including cyclones) and we discuss the results in relation to satellite cloud images.
NASA Astrophysics Data System (ADS)
Simon-Liedtke, Joschua T.; Farup, Ivar; Laeng, Bruno
2015-01-01
Color deficient people might be confronted with minor difficulties when navigating through daily life, for example when reading websites or media, navigating with maps, retrieving information from public transport schedules and others. Color deficiency simulation and daltonization methods have been proposed to better understand problems of color deficient individuals and to improve color displays for their use. However, it remains unclear whether these color prosthetic" methods really work and how well they improve the performance of color deficient individuals. We introduce here two methods to evaluate color deficiency simulation and daltonization methods based on behavioral experiments that are widely used in the field of psychology. Firstly, we propose a Sample-to-Match Simulation Evaluation Method (SaMSEM); secondly, we propose a Visual Search Daltonization Evaluation Method (ViSDEM). Both methods can be used to validate and allow the generalization of the simulation and daltonization methods related to color deficiency. We showed that both the response times (RT) and the accuracy of SaMSEM can be used as an indicator of the success of color deficiency simulation methods and that performance in the ViSDEM can be used as an indicator for the efficacy of color deficiency daltonization methods. In future work, we will include comparison and analysis of different color deficiency simulation and daltonization methods with the help of SaMSEM and ViSDEM.
Vemer, Pepijn; Al, Maiwenn J.; Oppe, Mark; Rutten-van Mölken, Maureen P. M. H.
2017-01-01
Background Decision-analytic cost-effectiveness (CE) models combine many parameters, often obtained after meta-analysis. Aim We compared different methods of mixed-treatment comparison (MTC) to combine transition and event probabilities derived from several trials, especially with respect to health-economic (HE) outcomes like (quality adjusted) life years and costs. Methods Trials were drawn from a simulated reference population, comparing two of four fictitious interventions. The goal was to estimate the CE between two of these. The amount of heterogeneity between trials was varied in scenarios. Parameter estimates were combined using direct comparison, MTC methods proposed by Song and Puhan, and Bayesian generalized linear fixed effects (GLMFE) and random effects models (GLMRE). Parameters were entered into a Markov model. Parameters and HE outcomes were compared with the reference population using coverage, statistical power, bias and mean absolute deviation (MAD) as performance indicators. Each analytical step was repeated 1,000 times. Results The direct comparison was outperformed by the MTC methods on all indicators, Song’s method yielded low bias and MAD, but uncertainty was overestimated. Puhan’s method had low bias and MAD and did not overestimate uncertainty. GLMFE generally had the lowest bias and MAD, regardless of the amount of heterogeneity, but uncertainty was overestimated. GLMRE showed large bias and MAD and overestimated uncertainty. Song’s and Puhan’s methods lead to the least amount of uncertainty, reflected in the shape of the CE acceptability curve. GLMFE showed slightly more uncertainty. Conclusions Combining direct and indirect evidence is superior to using only direct evidence. Puhan’s method and GLMFE are preferred. PMID:28152099
Dowling, N. Maritza; Hermann, Bruce; La Rue, Asenath; Sager, Mark A.
2010-01-01
Objective To examine the latent structure of a test battery currently being used in a longitudinal study of asymptomatic middle-aged adults with a parental history of Alzheimer’s disease (AD) and test the invariance of the factor solution across subgroups defined by selected demographic variables and known genetic risk factors for AD. Method An exploratory factor analysis (EFA) and a sequence of confirmatory factor analyses (CFA) were conducted on 24 neuropsychological measures selected to provide a comprehensive estimate of cognitive abilities most likely to be affected in preclinical AD. Once the underlying latent model was defined and the structural validity established through model comparisons, a multi-group confirmatory factor analysis model was used to test for factorial invariance across groups. Results The EFA solution revealed a factor structure consisting of 5 constructs: verbal ability, visuo-spatial ability, speed & executive function, working memory, and verbal learning & memory. The CFA models provided support for the hypothesized 5-factor structure. Results indicated factorial invariance of the model across all groups examined. Conclusions Collectively, the results suggested a relatively strong psychometric basis for using the factor structure in clinical samples that match the characteristics of this cohort. This confirmed an invariant factor structure should prove useful in research aimed to detect the earliest cognitive signature of preclinical AD in similar middle aged cohorts. PMID:21038965
Rotational Invariant Dimensionality Reduction Algorithms.
Lai, Zhihui; Xu, Yong; Yang, Jian; Shen, Linlin; Zhang, David
2016-06-30
A common intrinsic limitation of the traditional subspace learning methods is the sensitivity to the outliers and the image variations of the object since they use the L₂ norm as the metric. In this paper, a series of methods based on the L₂,₁-norm are proposed for linear dimensionality reduction. Since the L₂,₁-norm based objective function is robust to the image variations, the proposed algorithms can perform robust image feature extraction for classification. We use different ideas to design different algorithms and obtain a unified rotational invariant (RI) dimensionality reduction framework, which extends the well-known graph embedding algorithm framework to a more generalized form. We provide the comprehensive analyses to show the essential properties of the proposed algorithm framework. This paper indicates that the optimization problems have global optimal solutions when all the orthogonal projections of the data space are computed and used. Experimental results on popular image datasets indicate that the proposed RI dimensionality reduction algorithms can obtain competitive performance compared with the previous L₂ norm based subspace learning algorithms.
Bizopoulos, Paschalis A; Al-Ani, Tarik; Tsalikakis, Dimitrios G; Tzallas, Alexandros T; Koutsouris, Dimitrios D; Fotiadis, Dimitrios I
2013-01-01
Electrooculographic (EOG) artefacts are one of the most common causes of Electroencephalogram (EEG) distortion. In this paper, we propose a method for EOG Blinking Artefacts (BAs) detection and removal from EEG. Normalized Correlation Coefficient (NCC), based on a predetermined BA template library was used for detecting the BA. Ensemble Empirical Mode Decomposition (EEMD) was applied to the contaminated region and a statistical algorithm determined which Intrinsic Mode Functions (IMFs) correspond to the BA. The proposed method was applied in simulated EEG signals, which were contaminated with artificially created EOG BAs, increasing the Signal-to-Error Ratio (SER) of the EEG Contaminated Region (CR) by 35 dB on average.
Orthosymplectically invariant functions in superspace
NASA Astrophysics Data System (ADS)
Coulembier, K.; De Bie, H.; Sommen, F.
2010-08-01
The notion of spherically symmetric superfunctions as functions invariant under the orthosymplectic group is introduced. This leads to dimensional reduction theorems for differentiation and integration in superspace. These spherically symmetric functions can be used to solve orthosymplectically invariant Schrödinger equations in superspace, such as the (an)harmonic oscillator or the Kepler problem. Finally, the obtained machinery is used to prove the Funk-Hecke theorem and Bochner's relations in superspace.
NASA Astrophysics Data System (ADS)
Deng, Zhipeng; Lei, Lin; Zhou, Shilin
2015-10-01
Automatic image registration is a vital yet challenging task, particularly for non-rigid deformation images which are more complicated and common in remote sensing images, such as distorted UAV (unmanned aerial vehicle) images or scanning imaging images caused by flutter. Traditional non-rigid image registration methods are based on the correctly matched corresponding landmarks, which usually needs artificial markers. It is a rather challenging task to locate the accurate position of the points and get accurate homonymy point sets. In this paper, we proposed an automatic non-rigid image registration algorithm which mainly consists of three steps: To begin with, we introduce an automatic feature point extraction method based on non-linear scale space and uniform distribution strategy to extract the points which are uniform distributed along the edge of the image. Next, we propose a hybrid point matching algorithm using DaLI (Deformation and Light Invariant) descriptor and local affine invariant geometric constraint based on triangulation which is constructed by K-nearest neighbor algorithm. Based on the accurate homonymy point sets, the two images are registrated by the model of TPS (Thin Plate Spline). Our method is demonstrated by three deliberately designed experiments. The first two experiments are designed to evaluate the distribution of point set and the correctly matching rate on synthetic data and real data respectively. The last experiment is designed on the non-rigid deformation remote sensing images and the three experimental results demonstrate the accuracy, robustness, and efficiency of the proposed algorithm compared with other traditional methods.
Tracking visual objects using pyramidal rotation invariant features
NASA Astrophysics Data System (ADS)
Paheding, Sidike; Essa, Almabrok; Krieger, Evan; Asari, Vijayan
2016-02-01
Challenges in object tracking such as object deformation, occlusion, and background variations require a robust tracker to ensure accurate object location estimation. To address these issues, we present a Pyramidal Rotation Invariant Features (PRIF) that integrates Gaussian Ringlet Intensity Distribution (GRID) and Fourier Magnitude of Histogram of Oriented Gradients (FMHOG) methods for tracking objects from videos in challenging environments. In this model, we initially partition a reference object region into increasingly fine rectangular grid regions to construct a pyramid. Histograms of local features are then extracted for each level of pyramid. This allows the appearance of a local patch to be captured at multiple levels of detail to make the algorithm insensitive to partial occlusion. Then GRID and magnitude of discrete Fourier transform of the oriented gradient are utilized to achieve a robust rotation invariant feature. The GRID feature creates a weighting scheme to emphasize the object center. In the tracking stage, a Kalman filter is employed to estimate the center of the object search regions in successive frames. Within the search regions, we use a sliding window technique to extract the PRIF of candidate objects, and then Earth Mover's Distance (EMD) is used to classify the best matched candidate features with respect to the reference. Our PRIF object tracking algorithm is tested on two challenging Wide Area Motion Imagery (WAMI) datasets, namely Columbus Large Image Format (CLIF) and Large Area Image Recorder (LAIR), to evaluate its robustness. Experimental results show that the proposed PRIF approach yields superior results compared to state-of-the-art feature based object trackers.
Zhou, Feng; de la Torre, Fernando
2015-11-19
Graph matching (GM) is a fundamental problem in computer science, and it plays a central role to solve correspondence problems in computer vision. GM problems that incorporate pairwise constraints can be formulated as a quadratic assignment problem (QAP). Although widely used, solving the correspondence problem through GM has two main limitations: (1) the QAP is NP-hard and difficult to approximate; (2) GM algorithms do not incorporate geometric constraints between nodes that are natural in computer vision problems. To address aforementioned problems, this paper proposes factorized graph matching (FGM). FGM factorizes the large pairwise affinity matrix into smaller matrices that encode the local structure of each graph and the pairwise affinity between edges. Four are the benefits that follow from this factorization: (1) There is no need to compute the costly (in space and time) pairwise affinity matrix; (2) The factorization allows the use of a path-following optimization algorithm, that leads to improved optimization strategies and matching performance; (3) Given the factorization, it becomes straight-forward to incorporate geometric transformations (rigid and non-rigid) to the GM problem. (4) Using a matrix formulation for the GM problem and the factorization, it is easy to reveal commonalities and differences between different GM methods. The factorization also provides a clean connection with other matching algorithms such as iterative closest point; Experimental results on synthetic and real databases illustrate how FGM outperforms state-of-the-art algorithms for GM. The code is available at http://humansensing.cs.cmu.edu/fgm.
NASA Technical Reports Server (NTRS)
Wolfe, R. H., Jr.; Juday, R. D.
1982-01-01
Interimage matching is the process of determining the geometric transformation required to conform spatially one image to another. In principle, the parameters of that transformation are varied until some measure of some difference between the two images is minimized or some measure of sameness (e.g., cross-correlation) is maximized. The number of such parameters to vary is faily large (six for merely an affine transformation), and it is customary to attempt an a priori transformation reducing the complexity of the residual transformation or subdivide the image into small enough match zones (control points or patches) that a simple transformation (e.g., pure translation) is applicable, yet large enough to facilitate matching. In the latter case, a complex mapping function is fit to the results (e.g., translation offsets) in all the patches. The methods reviewed have all chosen one or both of the above options, ranging from a priori along-line correction for line-dependent effects (the high-frequency correction) to a full sensor-to-geobase transformation with subsequent subdivision into a grid of match points.
Matching Supernovae to Galaxies
NASA Astrophysics Data System (ADS)
Kohler, Susanna
2016-12-01
developed a new automated algorithm for matching supernovae to their host galaxies. Their work builds on currently existing algorithms and makes use of information about the nearby galaxies, accounts for the uncertainty of the match, and even includes a machine learning component to improve the matching accuracy.Gupta and collaborators test their matching algorithm on catalogs of galaxies and simulated supernova events to quantify how well the algorithm is able to accurately recover the true hosts.Successful MatchingThe matching algorithms accuracy (purity) as a function of the true supernova-host separation, the supernova redshift, the true hosts brightness, and the true hosts size. [Gupta et al. 2016]The authors find that when the basic algorithm is run on catalog data, it matches supernovae to their hosts with 91% accuracy. Including the machine learning component, which is run after the initial matching algorithm, improves the accuracy of the matching to 97%.The encouraging results of this work which was intended as a proof of concept suggest that methods similar to this could prove very practical for tackling future survey data. And the method explored here has use beyond matching just supernovae to their host galaxies: it could also be applied to other extragalactic transients, such as gamma-ray bursts, tidal disruption events, or electromagnetic counterparts to gravitational-wave detections.CitationRavi R. Gupta et al 2016 AJ 152 154. doi:10.3847/0004-6256/152/6/154
Data series embedding and scale invariant statistics.
Michieli, I; Medved, B; Ristov, S
2010-06-01
Data sequences acquired from bio-systems such as human gait data, heart rate interbeat data, or DNA sequences exhibit complex dynamics that is frequently described by a long-memory or power-law decay of autocorrelation function. One way of characterizing that dynamics is through scale invariant statistics or "fractal-like" behavior. For quantifying scale invariant parameters of physiological signals several methods have been proposed. Among them the most common are detrended fluctuation analysis, sample mean variance analyses, power spectral density analysis, R/S analysis, and recently in the realm of the multifractal approach, wavelet analysis. In this paper it is demonstrated that embedding the time series data in the high-dimensional pseudo-phase space reveals scale invariant statistics in the simple fashion. The procedure is applied on different stride interval data sets from human gait measurements time series (Physio-Bank data library). Results show that introduced mapping adequately separates long-memory from random behavior. Smaller gait data sets were analyzed and scale-free trends for limited scale intervals were successfully detected. The method was verified on artificially produced time series with known scaling behavior and with the varying content of noise. The possibility for the method to falsely detect long-range dependence in the artificially generated short range dependence series was investigated.
Soft parametric curve matching in scale-space
NASA Astrophysics Data System (ADS)
Avants, Brian B.; Gee, James C.
2002-05-01
We develop a softassign method for application to curve matching. Softassign uses deterministic annealing to iteratively optimize the parameters of an energy function. It also incorporates outlier rejection by converting the energy into a stochastic matrix with entries for rejection probability. Previous applications of the method focused on finding transformations between unordered point sets. Thus, no topological constraints were required. In our application, we must consider the topology of the matching between the reference and the target curve. Our energy function also depends upon the rotation and scaling between the curves. Thus, we develop a topologically correct algorithm to update the arc length correspondence, which is then used to update the similarity transformation. We further enhance robustness by using a scale-space description of the curves. This results in a curve-matching tool that, given an approximate initialization, is invariant to similarity transformations. We demonstrate the reliability of the technique by applying it to open and closed curves extracted from real patient images (cortical sulci in three dimensions and corpora callosa in two dimensions). The set of transformations is then used to compute anatomical atlases.
Intensity invariant nonlinear correlation filtering in spatially disjoint noise.
Ben Tara, Walid; Arsenault, Henri H; García-Martínez, Pascuala
2010-08-01
We analyze the performance of a nonlinear correlation called the Locally Adaptive Contrast Invariant Filter in the presence of spatially disjoint noise under the peak-to-sidelobe ratio (PSR) metric. We show that the PSR using the nonlinear correlation improves as the disjoint noise intensity increases, whereas, for common linear filtering, it goes to zero. Experimental results as well as comparisons with a classical matched filter are given.
Verification of Java Programs using Symbolic Execution and Invariant Generation
NASA Technical Reports Server (NTRS)
Pasareanu, Corina; Visser, Willem
2004-01-01
Software verification is recognized as an important and difficult problem. We present a norel framework, based on symbolic execution, for the automated verification of software. The framework uses annotations in the form of method specifications an3 loop invariants. We present a novel iterative technique that uses invariant strengthening and approximation for discovering these loop invariants automatically. The technique handles different types of data (e.g. boolean and numeric constraints, dynamically allocated structures and arrays) and it allows for checking universally quantified formulas. Our framework is built on top of the Java PathFinder model checking toolset and it was used for the verification of several non-trivial Java programs.
NASA Astrophysics Data System (ADS)
Kulyamina, E. Yu.; Zitserman, V. Yu.; Fokin, L. R.
2017-01-01
A technique for reconstructing thermal properties, including the melting curve, of refractory metals based on the use of experimental data on caloric properties available up to the melting point and some regularities of the Debye-Grüneisen theory has been proposed. The calculation result is the consistent system of high-temperature thermal data, including the thermal expansion coefficient, solid-phase density, and volume jump upon melting. This technique was tried-out on refractory platinum-group metals based on experimental data on the enthalpy of the metals and confirmed by consistency with a thermodynamic calculation using shock-wave experiments and results obtained by the quantum molecular dynamics method.
CPT violation implies violation of Lorentz invariance.
Greenberg, O W
2002-12-02
A interacting theory that violates CPT invariance necessarily violates Lorentz invariance. On the other hand, CPT invariance is not sufficient for out-of-cone Lorentz invariance. Theories that violate CPT by having different particle and antiparticle masses must be nonlocal.
Weyl invariance with a nontrivial mass scale
Álvarez, Enrique; González-Martín, Sergio
2016-09-07
A theory with a mass scale and yet Weyl invariant is presented. The theory is not invariant under all diffeomorphisms but only under transverse ones. This is the reason why Weyl invariance does not imply scale invariance in a free falling frame. Physical implications of this framework are discussed.
Chen, H; Zhen, X; Zhou, L; Zhong, Z; Pompos, A; Yan, H; Jiang, S; Gu, X
2014-06-15
Purpose: To propose and validate a deformable point matching scheme for surface deformation to facilitate accurate bladder dose summation for fractionated HDR cervical cancer treatment. Method: A deformable point matching scheme based on the thin plate spline robust point matching (TPSRPM) algorithm is proposed for bladder surface registration. The surface of bladders segmented from fractional CT images is extracted and discretized with triangular surface mesh. Deformation between the two bladder surfaces are obtained by matching the two meshes' vertices via the TPS-RPM algorithm, and the deformation vector fields (DVFs) characteristic of this deformation is estimated by B-spline approximation. Numerically, the algorithm is quantitatively compared with the Demons algorithm using five clinical cervical cancer cases by several metrics: vertex-to-vertex distance (VVD), Hausdorff distance (HD), percent error (PE), and conformity index (CI). Experimentally, the algorithm is validated on a balloon phantom with 12 surface fiducial markers. The balloon is inflated with different amount of water, and the displacement of fiducial markers is benchmarked as ground truth to study TPS-RPM calculated DVFs' accuracy. Results: In numerical evaluation, the mean VVD is 3.7(±2.0) mm after Demons, and 1.3(±0.9) mm after TPS-RPM. The mean HD is 14.4 mm after Demons, and 5.3mm after TPS-RPM. The mean PE is 101.7% after Demons and decreases to 18.7% after TPS-RPM. The mean CI is 0.63 after Demons, and increases to 0.90 after TPS-RPM. In the phantom study, the mean Euclidean distance of the fiducials is 7.4±3.0mm and 4.2±1.8mm after Demons and TPS-RPM, respectively. Conclusions: The bladder wall deformation is more accurate using the feature-based TPS-RPM algorithm than the intensity-based Demons algorithm, indicating that TPS-RPM has the potential for accurate bladder dose deformation and dose summation for multi-fractional cervical HDR brachytherapy. This work is supported in part by
Adiabatic invariance with first integrals of motion.
Adib, Artur B
2002-10-01
The construction of a microthermodynamic formalism for isolated systems based on the concept of adiabatic invariance is an old but seldom appreciated effort in the literature, dating back at least to P. Hertz [Ann. Phys. (Leipzig) 33, 225 (1910)]. An apparently independent extension of such formalism for systems bearing additional first integrals of motion was recently proposed by Hans H. Rugh [Phys. Rev. E 64, 055101 (2001)], establishing the concept of adiabatic invariance even in such singular cases. After some remarks in connection with the formalism pioneered by Hertz, it will be suggested that such an extension can incidentally explain the success of a dynamical method for computing the entropy of classical interacting fluids, at least in some potential applications where the presence of additional first integrals cannot be ignored.
RESEARCH NOTE: Improving Bahr's invariant parameters using the WAL approach
NASA Astrophysics Data System (ADS)
Martí, Anna; Queralt, Pilar; Jones, Alan G.; Ledo, Juanjo
2005-10-01
In the magnetotelluric technique, several methods exist to perform dimensionality analysis of the measured data using rotational invariants of the impedance tensor. Among these methods there is some dilemma on the different criteria established, which sometimes lead to non-equivalent interpretations. The aim of this work is to compare the Bahr and Weaver et al. (WAL hereafter) methods, and to propose a new method that makes both dimensionality methods consistent. This new method complements the parameters used in Bahr method with WAL invariant Q, and redefines their threshold values. To accomplish this, we used the analytical relations between both sets of parameters and re-analyse and compare the threshold values of each method. Both the Bahr and WAL methods use sets of rotational invariant parameters of the magnetotelluric tensor ] and establish a classification of their values to determine the kind of dimensionality associated to the measured data.
Invariance algorithms for processing NDE signals
NASA Astrophysics Data System (ADS)
Mandayam, Shreekanth; Udpa, Lalita; Udpa, Satish S.; Lord, William
1996-11-01
Signals that are obtained in a variety of nondestructive evaluation (NDE) processes capture information not only about the characteristics of the flaw, but also reflect variations in the specimen's material properties. Such signal changes may be viewed as anomalies that could obscure defect related information. An example of this situation occurs during in-line inspection of gas transmission pipelines. The magnetic flux leakage (MFL) method is used to conduct noninvasive measurements of the integrity of the pipe-wall. The MFL signals contain information both about the permeability of the pipe-wall and the dimensions of the flaw. Similar operational effects can be found in other NDE processes. This paper presents algorithms to render NDE signals invariant to selected test parameters, while retaining defect related information. Wavelet transform based neural network techniques are employed to develop the invariance algorithms. The invariance transformation is shown to be a necessary pre-processing step for subsequent defect characterization and visualization schemes. Results demonstrating the successful application of the method are presented.
Surface matching via currents.
Vaillant, Marc; Glaunès, Joan
2005-01-01
We present a new method for computing an optimal deformation between two arbitrary surfaces embedded in Euclidean 3-dimensional space. Our main contribution is in building a norm on the space of surfaces via representation by currents of geometric measure theory. Currents are an appropriate choice for representations because they inherit natural transformation properties from differential forms. We impose a Hilbert space structure on currents, whose norm gives a convenient and practical way to define a matching functional. Using this Hilbert space norm, we also derive and implement a surface matching algorithm under the large deformation framework, guaranteeing that the optimal solution is a one-to-one regular map of the entire ambient space. We detail an implementation of this algorithm for triangular meshes and present results on 3D face and medical image data.
NASA Astrophysics Data System (ADS)
Zhou, Long-Qiao; Meleshko, Sergey V.
2017-01-01
A linear thermoviscoelastic model for homogeneous, aging materials with memory is established. A system of integro-differential equations is obtained by using two motions (a one-dimensional motion and a shearing motion) for this model. Applying the group analysis method to the system of integro-differential equations, the admitted Lie group is determined. Using this admitted Lie group, invariant and partially invariant solutions are found. The present paper gives a first example of application of partially invariant solutions to integro-differential equations.
McIntosh, E; Donaldson, C; Ryan, M
1999-04-01
This paper outlines recent advances in the methods of cost-benefit analysis (CBA). Economic evaluations in healthcare can be criticised for, amongst other things, the inappropriate use of incremental cost-effectiveness ratios and the reporting of benefits in terms of cost savings, such as treatment costs averted. Many such economic evaluations are, according to the 'scientific' definition, CBAs. The 'balance-sheet' (or opportunity cost) approach is a form of CBA which can be used to identify who bears the costs and who reaps the benefits from any change. Whilst the next stage in a CBA, as defined in health economics, would require that all costs and benefits be valued in monetary terms, the balance-sheet approach, however, advocates that available monetary values can be augmented by other measures of cost and benefit. As such, this approach, which has a theoretical basis, is proposed as a practical prescription for CBA and highlights the notion that unquantified benefits are important and can be included within CBAs even when monetarisation is not possible. Recent methodological developments in monetary valuation for use in CBA are the development of the technique of willingness to pay, the use of conjoint analysis (CA) to elicit willingness-to-pay (WTP) values and advances in the debate on the inclusion of production gains in CBAs. Whilst acknowledging that there have been developments in each of these areas, it is claimed there has also been progress in using CBA as a framework for evaluation, as reflected by the balance-sheet approach. The paper concludes by stating that almost all types of economic evaluation have an element of the 'cost-benefit' approach in them. The important issue is to focus on the policy question to be addressed and to outline the relevant costs and benefits in a manner which assists the evaluation of welfare changes resulting from changes in healthcare delivery. The focus should not be on moulding a question to fit a hybrid definition of
Paiva, Rodrigo José Oliveira; Brites, Ricardo Seixas; Machado, Ricardo Bomfim
2015-01-01
Global efforts to avoid anthropogenic conversion of natural habitat rely heavily on the establishment of protected areas. Studies that evaluate the effectiveness of these areas with a focus on preserving the natural habitat define effectiveness as a measure of the influence of protected areas on total avoided conversion. Changes in the estimated effectiveness are related to local and regional differences, evaluation methods, restriction categories that include the protected areas, and other characteristics. The overall objective of this study was to evaluate the effectiveness of protected areas to prevent the advance of the conversion of natural areas in the core region of the Brazil's Cerrado Biome, taking into account the influence of the restriction degree, governmental sphere, time since the establishment of the protected area units, and the size of the area on the performance of protected areas. The evaluation was conducted using matching methods and took into account the following two fundamental issues: control of statistical biases caused by the influence of covariates on the likelihood of anthropogenic conversion and the non-randomness of the allocation of protected areas throughout the territory (spatial correlation effect) and the control of statistical bias caused by the influence of auto-correlation and leakage effect. Using a sample design that is not based on ways to control these biases may result in outcomes that underestimate or overestimate the effectiveness of those units. The matching method accounted for a bias reduction in 94-99% of the estimation of the average effect of protected areas on anthropogenic conversion and allowed us to obtain results with a reduced influence of the auto-correlation and leakage effects. Most protected areas had a positive influence on the maintenance of natural habitats, although wide variation in this effectiveness was dependent on the type, restriction, governmental sphere, size and age group of the unit.
Paiva, Rodrigo José Oliveira; Brites, Ricardo Seixas; Machado, Ricardo Bomfim
2015-01-01
Global efforts to avoid anthropogenic conversion of natural habitat rely heavily on the establishment of protected areas. Studies that evaluate the effectiveness of these areas with a focus on preserving the natural habitat define effectiveness as a measure of the influence of protected areas on total avoided conversion. Changes in the estimated effectiveness are related to local and regional differences, evaluation methods, restriction categories that include the protected areas, and other characteristics. The overall objective of this study was to evaluate the effectiveness of protected areas to prevent the advance of the conversion of natural areas in the core region of the Brazil’s Cerrado Biome, taking into account the influence of the restriction degree, governmental sphere, time since the establishment of the protected area units, and the size of the area on the performance of protected areas. The evaluation was conducted using matching methods and took into account the following two fundamental issues: control of statistical biases caused by the influence of covariates on the likelihood of anthropogenic conversion and the non-randomness of the allocation of protected areas throughout the territory (spatial correlation effect) and the control of statistical bias caused by the influence of auto-correlation and leakage effect. Using a sample design that is not based on ways to control these biases may result in outcomes that underestimate or overestimate the effectiveness of those units. The matching method accounted for a bias reduction in 94–99% of the estimation of the average effect of protected areas on anthropogenic conversion and allowed us to obtain results with a reduced influence of the auto-correlation and leakage effects. Most protected areas had a positive influence on the maintenance of natural habitats, although wide variation in this effectiveness was dependent on the type, restriction, governmental sphere, size and age group of the unit
Forward-looking recognition based on convex hull invariants of oil depot region
NASA Astrophysics Data System (ADS)
He, Fangfang; Sun, Jiyin; Han, Bing; Xia, Jing
2007-11-01
Forward-looking navigation system is a fire-new technique for terminal guidance of intending precision-guided weapons and research on oil depot recognition of forward-looking imaging is an essential task for this control and guide system. As conventional matching methods could not overcome perspective transmutation, a new method to identify the forward-looking area of oil depot was advanced in this paper. First, constructed three statistics of regions based on convex hull, which were invariant to affine transform. Then, number of inside oilcans could easily be achieved by adding a decision step. Finally the area of oil depot could be located according to the comparison between the computed number and the foreknowable number under a given threshold. Experiments applied to optical images in different areas show that the proposed method is accurate and has wider application in identifying such small objects as oilcans, and it realizes automatically recognizing area of oil depot from forward-looking imaging.
Matching Network For Microwave Preamplifier
NASA Technical Reports Server (NTRS)
Sifri, Jack D.
1988-01-01
Stable operation and broadband, optimum noise performance achieved. Amplifier designed by new method of matching input impedance for optimum noise figure and stability. Output more nearly constant over wider frequency range.
Test of charge conjugation invariance.
Nefkens, B M K; Prakhov, S; Gårdestig, A; Allgower, C E; Bekrenev, V; Briscoe, W J; Clajus, M; Comfort, J R; Craig, K; Grosnick, D; Isenhower, D; Knecht, N; Koetke, D; Koulbardis, A; Kozlenko, N; Kruglov, S; Lolos, G; Lopatin, I; Manley, D M; Manweiler, R; Marusić, A; McDonald, S; Olmsted, J; Papandreou, Z; Peaslee, D; Phaisangittisakul, N; Price, J W; Ramirez, A F; Sadler, M; Shafi, A; Spinka, H; Stanislaus, T D S; Starostin, A; Staudenmaier, H M; Supek, I; Tippens, W B
2005-02-04
We report on the first determination of upper limits on the branching ratio (BR) of eta decay to pi0pi0gamma and to pi0pi0pi0gamma. Both decay modes are strictly forbidden by charge conjugation (C) invariance. Using the Crystal Ball multiphoton detector, we obtained BR(eta-->pi0pi0gamma)<5 x 10(-4) at the 90% confidence level, in support of C invariance of isoscalar electromagnetic interactions of the light quarks. We have also measured BR(eta-->pi0pi0pi0gamma)<6 x 10(-5) at the 90% confidence level, in support of C invariance of isovector electromagnetic interactions.
Global invariants in ideal magnetohydrodynamic turbulence
Shebalin, John V.
2013-10-15
Magnetohydrodynamic (MHD) turbulence is an important though incompletely understood factor affecting the dynamics of many astrophysical, geophysical, and technological plasmas. As an approximation, viscosity and resistivity may be ignored, and ideal MHD turbulence may be investigated by statistical methods. Incompressibility is also assumed and finite Fourier series are used to represent the turbulent velocity and magnetic field. The resulting model dynamical system consists of a set of independent Fourier coefficients that form a canonical ensemble described by a Gaussian probability density function (PDF). This PDF is similar in form to that of Boltzmann, except that its argument may contain not just the energy multiplied by an inverse temperature, but also two other invariant integrals, the cross helicity and magnetic helicity, each multiplied by its own inverse temperature. However, the cross and magnetic helicities, as usually defined, are not invariant in the presence of overall rotation or a mean magnetic field, respectively. Although the generalized form of the magnetic helicity is known, a generalized cross helicity may also be found, by adding terms that are linear in the mean magnetic field and angular rotation vectors, respectively. These general forms are invariant even in the presence of overall rotation and a mean magnetic field. We derive these general forms, explore their properties, examine how they extend the statistical theory of ideal MHD turbulence, and discuss how our results may be affected by dissipation and forcing.
Against relative timing invariance in movement kinematics.
Burgess-Limerick, R; Neal, R J; Abernethy, B
1992-05-01
The kinematics of stair climbing were examined to test the assertion that relative timing is an invariant feature of human gait. Six male and four female subjects were video-recorded (at 60 Hz) while they climbed a flight of stairs 10 times at each of three speeds. Each gait cycle was divided into three segments by the maximum and minimum angular displacement of the left knee and left foot contact. Gentner's (1987) analysis methods were applied to the individual subject data to determine whether the duration of the segments remained a fixed proportion of gait cycle duration across changes in stair-climbing speed. A similar analysis was performed using knee velocity maxima to partition the gait cycle. Regardless of how the gait cycle was divided, relative timing was not found to remain strictly invariant across changes in speed. This conclusion is contrary to previous studies of relative timing that involved less conservative analysis but is consistent with the wider gait literature. Strict invariant relative timing may not be a fundamental feature of movement kinematics.
Global invariants in ideal magnetohydrodynamic turbulence
NASA Astrophysics Data System (ADS)
Shebalin, John V.
2013-10-01
Magnetohydrodynamic (MHD) turbulence is an important though incompletely understood factor affecting the dynamics of many astrophysical, geophysical, and technological plasmas. As an approximation, viscosity and resistivity may be ignored, and ideal MHD turbulence may be investigated by statistical methods. Incompressibility is also assumed and finite Fourier series are used to represent the turbulent velocity and magnetic field. The resulting model dynamical system consists of a set of independent Fourier coefficients that form a canonical ensemble described by a Gaussian probability density function (PDF). This PDF is similar in form to that of Boltzmann, except that its argument may contain not just the energy multiplied by an inverse temperature, but also two other invariant integrals, the cross helicity and magnetic helicity, each multiplied by its own inverse temperature. However, the cross and magnetic helicities, as usually defined, are not invariant in the presence of overall rotation or a mean magnetic field, respectively. Although the generalized form of the magnetic helicity is known, a generalized cross helicity may also be found, by adding terms that are linear in the mean magnetic field and angular rotation vectors, respectively. These general forms are invariant even in the presence of overall rotation and a mean magnetic field. We derive these general forms, explore their properties, examine how they extend the statistical theory of ideal MHD turbulence, and discuss how our results may be affected by dissipation and forcing.
Invariants of broken discrete symmetries.
Kalozoumis, P A; Morfonios, C; Diakonos, F K; Schmelcher, P
2014-08-01
The parity and Bloch theorems are generalized to the case of broken global symmetry. Local inversion or translation symmetries in one dimension are shown to yield invariant currents that characterize wave propagation. These currents map the wave function from an arbitrary spatial domain to any symmetry-related domain. Our approach addresses any combination of local symmetries, thus applying, in particular, to acoustic, optical, and matter waves. Nonvanishing values of the invariant currents provide a systematic pathway to the breaking of discrete global symmetries.
Invariants of Broken Discrete Symmetries
NASA Astrophysics Data System (ADS)
Kalozoumis, P. A.; Morfonios, C.; Diakonos, F. K.; Schmelcher, P.
2014-08-01
The parity and Bloch theorems are generalized to the case of broken global symmetry. Local inversion or translation symmetries in one dimension are shown to yield invariant currents that characterize wave propagation. These currents map the wave function from an arbitrary spatial domain to any symmetry-related domain. Our approach addresses any combination of local symmetries, thus applying, in particular, to acoustic, optical, and matter waves. Nonvanishing values of the invariant currents provide a systematic pathway to the breaking of discrete global symmetries.
NASA Astrophysics Data System (ADS)
Matuszyk, Paweł J.
2017-01-01
The circumferential guided waves (CGW) are of increasing interest for non-destructive inspecting pipes or other cylindrical structures. If such structures are buried underground, these modes can also deliver some valuable information about the surrounding medium or the quality of the contact between the pipe and the embedding medium. Toward this goal, the detailed knowledge of the dispersive characteristics of CGW is required; henceforth, the robust numerical method has to be established, which allows for the extensive study of the propagation of these modes under different loading conditions. Mathematically, this is the problem of the propagation of guided waves in an open waveguide. This problem differs significantly from the corresponding problem of a closed waveguide both in physical and numerical aspect. The paper presents a combination of semi-analytical finite element method with Perfectly Matched Layer technique for a class of coupled acoustics/elasticity problems with application to modeling of CGW. We discuss different aspects of our algorithm and validate the proposed approach against other established methods available in the literature. The presented numerical examples positively verify the robustness of the proposed method.
Invarient patterns in articulatory movements
NASA Astrophysics Data System (ADS)
Bonaventura, Patrizia
2004-04-01
The purpose of the reported study is to discover an effective method of characterizing movement patterns of the crucial articulator as the function of an abstract syllable magnitude and the adjacent boundary, and at the same time to investigate effects of prosodic control on utterance organization. In particular, the speed of movement when a flesh point on the tongue blade or the lower lip crosses a selected position relative to the occlusion plane is examined. The time of such crossing provides an effective measure of syllable timing and syllable duration according to previous work. In the present work, using a very limited vocabulary with only a few consonants and one vowel as the key speech materials, effects of contrastive emphasis on demisyllabic movement patterns were studied. The theoretical framework for this analysis is the C/D model of speech production in relation to the concept of an invariant part of selected articulatory movements. The results show evidence in favor of the existence of ``iceberg'' patterns, but a linear dependence of slope on the total excursion of the demisyllabic movement, instead of the approximate constancy of the threshold crossing speed as suggested in the original proposal of the iceberg, has been found. Accordingly, a revision of the original concept of iceberg, seems necessary. This refinement is consistent with the C/D model assumption on ``prominence control'' that the syllable magnitude determines the movement amplitude, accompanying directly related syllable duration change. In this assumption, the movement of a consonantal component should also be proportional to syllable magnitude. The results suggests, however, systematic outliers deviating from the linear dependence of movement speed on excursion. This deviation may be caused by the effect of the immediately following boundary, often referred to as phrase-final elongation. Thesis advisor: Osamu Fujimura Copies of this thesis written in English can be obtained from
Communication: Fitting potential energy surfaces with fundamental invariant neural network
NASA Astrophysics Data System (ADS)
Shao, Kejie; Chen, Jun; Zhao, Zhiqiang; Zhang, Dong H.
2016-08-01
A more flexible neural network (NN) method using the fundamental invariants (FIs) as the input vector is proposed in the construction of potential energy surfaces for molecular systems involving identical atoms. Mathematically, FIs finitely generate the permutation invariant polynomial (PIP) ring. In combination with NN, fundamental invariant neural network (FI-NN) can approximate any function to arbitrary accuracy. Because FI-NN minimizes the size of input permutation invariant polynomials, it can efficiently reduce the evaluation time of potential energy, in particular for polyatomic systems. In this work, we provide the FIs for all possible molecular systems up to five atoms. Potential energy surfaces for OH3 and CH4 were constructed with FI-NN, with the accuracy confirmed by full-dimensional quantum dynamic scattering and bound state calculations.
NASA Astrophysics Data System (ADS)
Montoux, Nadege; David, Christine; Klekociuk, Andrew; Pitts, Michael; di Liberto, Luca; Snels, Marcel; Jumelet, Julien; Bekki, Slimane; Larsen, Niels
2010-05-01
The project ORACLE-O3 ("Ozone layer and UV RAdiation in a changing CLimate Evaluated during IPY") is one of the coordinated international proposals selected for the International Polar Year (IPY). As part of this global project, LOLITA-PSC ("Lagrangian Observations with Lidar Investigations and Trajectories in Antarctica and Arctic, of PSC") is devoted to Polar Stratospheric Clouds (PSC) studies. Indeed, understanding the formation and evolution of PSC is an important issue to quantify the impact of climate changes on their frequency of formation and, further, on chlorine activation and subsequent ozone depletion. In this framework, three lidar stations performed PSC observations in Antarctica during the 2006, 2007, and 2008 winters: Davis (68.58°S, 77.97°E), McMurdo (77.86°S, 166.48°E) and Dumont D'Urville (66.67°S, 140.01°E). The data are completed with the lidar data from CALIOP ("Cloud-Aerosol Lidar with Orthogonal Polarization") onboard the CALIPSO ("Cloud-Aerosol Lidar and Infrared Pathfinder Satellite Observation") satellite. Lagrangian trajectory calculations are used to identify air masses with PSCs sounded by several ground-based lidar stations with the same method, called MATCH, applied for the first time in Arctic to study the ozone depletion with radiosoundings. The evolution of the optical properties of the PSCs and thus the type of PSCs formed (supercooled ternary solution, nitric acid trihydrate particles or ice particles) could thus be linked to the thermodynamical evolution of the air mass deduced from the trajectories. A modeling with the microphysical model of the Danish Meteorological Institute allows assessing our ability to predict PSCs for various environmental conditions. Indeed, from pressure and temperature evolution, the model allows retrieving the types of particles formed as well as their mean radii, their concentrations and could also simulate the lidar signals. In a first step, a case in August 2007 around 17-18 km, involving
Algebraic invariants for homotopy types
NASA Astrophysics Data System (ADS)
Blanc, David
1999-11-01
We define a sequence of purely algebraic invariants - namely, classes in the Quillen cohomology of the [Pi]-algebra [pi][low asterisk]X - for distinguishing between different homotopy types of spaces. Another sequence of such cohomology classes allows one to decide whether a given abstract [Pi]-algebra can be realized as the homotopy [Pi]-algebra of a space.
Galilean invariance in Lagrangian mechanics
NASA Astrophysics Data System (ADS)
Mohallem, J. R.
2015-10-01
The troublesome topic of Galilean invariance in Lagrangian mechanics is discussed in two situations: (i) A particular case involving a rheonomic constraint in uniform motion and (ii) the general translation of an entire system and the constants of motion involved. A widespread impropriety in most textbooks is corrected, concerning a condition for the equality h = E to hold.
Thomas, Anthony W.
2008-10-13
We discuss recent theoretical progress in understanding the distribution of spin and orbital angular momentum in the proton. Particular attention is devoted to the effect of QCD evolution and to the distinction between 'chiral' and 'invariant' spin. This is particularly significant with respect to the possible presence of polarized strange quarks.
NASA Technical Reports Server (NTRS)
Heedy, D. J.; Burnside, W. D.
1984-01-01
The moment method and the uniform geometrical theory of diffraction are utilized to obtain two separate solutions for the E-plane field pattern of an aperture-matched horn antenna. This particular horn antenna consists of a standard pyramidal horn with the following modifications: a rolled edge section attached to the aperture edges and a curved throat section. The resulting geometry provides significantly better performance in terms of the pattern, impedance, and frequency characteristics than normally obtainable. The moment method is used to calculate the E-plane pattern and BSWR of the antenna. However, at higher frequencies, large amounts of computation time are required. The uniform geometrical theory of diffraction provides a quick and efficient high frequency solution for the E-plane field pattern. In fact, the uniform geometrical theory of diffraction may be used to initially design the antenna; then, the moment method may be applied to fine tune the design. This procedure has been successfully applied to a compact range feed design.
Robust feature point matching with sparse model.
Jiang, Bo; Tang, Jin; Luo, Bin; Lin, Liang
2014-12-01
Feature point matching that incorporates pairwise constraints can be cast as an integer quadratic programming (IQP) problem. Since it is NP-hard, approximate methods are required. The optimal solution for IQP matching problem is discrete, binary, and thus sparse in nature. This motivates us to use sparse model for feature point matching problem. The main advantage of the proposed sparse feature point matching (SPM) method is that it generates sparse solution and thus naturally imposes the discrete mapping constraints approximately in the optimization process. Therefore, it can optimize the IQP matching problem in an approximate discrete domain. In addition, an efficient algorithm can be derived to solve SPM problem. Promising experimental results on both synthetic points sets matching and real-world image feature sets matching tasks show the effectiveness of the proposed feature point matching method.
Robust Matching of Wavelet Features for Sub-Pixel Registration of Landsat Data
NASA Technical Reports Server (NTRS)
LeMoigne, Jacqueline; Netanyahu, Nathan S.; Masek, Jeffrey G.; Mount, David M.; Goward, Samuel; Zukor, Dorothy (Technical Monitor)
2001-01-01
For many Earth and Space Science applications, automatic geo-registration at sub-pixel accuracy has become a necessity. In this work, we are focusing on building an operational system, which will provide a sub-pixel accuracy registration of Landsat-5 and Landsat-7 data. The input to our registration method consists of scenes that have been geometrically and radiometrically corrected. Such pre-processed scenes are then geo-registered relative to a database of Landsat chips. The method assumes a transformation composed of a rotation and a translation, and utilizes rotation- and translation-invariant wavelets to extract image features that are matched using statistically robust feature matching and a generalized Hausdorff distance metric. The registration process is described and results on four Landsat input scenes of the Washington, D.C. area are presented.
Hybrid Schema Matching for Deep Web
NASA Astrophysics Data System (ADS)
Chen, Kerui; Zuo, Wanli; He, Fengling; Chen, Yongheng
Schema matching is the process of identifying semantic mappings, or correspondences, between two or more schemas. Schema matching is a first step and critical part of data integration. For schema matching of deep web, most researches only interested in query interface, while rarely pay attention to abundant schema information contained in query result pages. This paper proposed a mixed schema matching technique, which combines attributes that appeared in query structures and query results of different data sources, and mines the matched schemas inside. Experimental results prove the effectiveness of this method for improving the accuracy of schema matching.
Gaussian MRF rotation-invariant features for image classification.
Deng, Huawu; Clausi, David A
2004-07-01
Features based on Markov random field (MRF) models are sensitive to texture rotation. This paper develops an anisotropic circular Gaussian MRF (ACGMRF) model for retrieving rotation-invariant texture features. To overcome the singularity problem of the least squares estimate method, an approximate least squares estimate method is designed and implemented. Rotation-invariant features are obtained from the ACGMRF model parameters using the discrete Fourier transform. The ACGMRF model is demonstrated to be a statistical improvement over three published methods. The three methods include a Laplacian pyramid, an isotropic circular GMRF (ICGMRF), and gray level cooccurrence probability features.
Masadome, Takashi; Asano, Yasukazu; Imato, Toshihiko; Ohkubo, Satoshi; Tobita, Tatsuya; Tabei, Hisao; Iwasaki, Yuzuru; Niwa, Osamu; Fushinuki, Yoshito
2002-07-01
In order to simplify the procedure for assembling a surface-plasmon resonance (SPR) sensor, a refractive index matching polymer film was prepared as an alternative to the conventionally used matching oil. The refractive index matching polymer film, the refractive index of which was nearly equal to the prism and sensor chip material (a cover glass) of the SPR sensor, was prepared by casting a tetrahydrofuran solution of poly (vinyl chloride) (PVC) containing equal weights of dioctyl phthalate and tricresyl phosphate. The refractive index matching polymer film was found to have a refractive index of 1.516, which is identical to that of the prism and the cover glass used for the present SPR sensor. The utility of the matching polymer film for the SPR sensor was confirmed by the detection of anti-human albumin, based on an antigen-antibody reaction.
Tolkunov, Denis; Rubin, Denis; Mujica-Parodi, LR
2010-01-01
In a well-regulated control system, excitatory and inhibitory components work closely together with minimum lag; in response to inputs of finite duration, outputs should show rapid rise and, following the input's termination, immediate return to baseline. The efficiency of this response can be quantified using the power spectrum density's scaling parameter β, a measure of self-similarity, applied to the first-derivative of the raw signal. In this study, we adapted power spectrum density methods, previously used to quantify autonomic dysregulation (heart rate variability), to neural time-series obtained via functional MRI. The negative feedback loop we investigated was the limbic system, using affect-valent faces as stimuli. We hypothesized that trait anxiety would be related to efficiency of regulation of limbic responses, as quantified by power law scaling of fMRI time series. Our results supported this hypothesis, showing moderate to strong correlations of β (r = 0.4–0.54) for the amygdala, orbitofrontal cortex, hippocampus, superior temporal gyrus, posterior insula, and anterior cingulate. Strong anticorrelations were also found between the amygdala's β and wake heart rate variability (r = −0.61), suggesting a robust relationship between dysregulated limbic outputs and their autonomic consequences. PMID:20025979
Cheng, Candong; Lee, Joon-Ho; Lim, Kim Hwa; Massoud, Hisham Z.; Liu, Qing Huo
2007-01-01
A 3-D quantum transport solver based on the spectral element method (SEM) and perfectly matched layer (PML) is introduced to solve the 3-D Schrödinger equation with a tensor effective mass. In this solver, the influence of the environment is replaced with the artificial PML open boundary extended beyond the contact regions of the device. These contact regions are treated as waveguides with known incident waves from waveguide mode solutions. As the transmitted wave function is treated as a total wave, there is no need to decompose it into waveguide modes, thus significantly simplifying the problem in comparison with conventional open boundary conditions. The spectral element method leads to an exponentially improving accuracy with the increase in the polynomial order and sampling points. The PML region can be designed such that less than −100 dB outgoing waves are reflected by this artificial material. The computational efficiency of the SEM solver is demonstrated by comparing the numerical and analytical results from waveguide and plane-wave examples, and its utility is illustrated by multiple-terminal devices and semiconductor nanotube devices. PMID:18037971
Feature-aided tracking using invariant features of HRR signatures
NASA Astrophysics Data System (ADS)
Gross, David C.; Oppenheimer, Michael W.; Schmitz, James L.; Sturtz, Kirk
2001-08-01
The present era of limited warfare demands that warfighters have the capability for timely acquisition and precision strikes against enemy ground targets with minimum collateral damage. As a result, automatic target recognition (ATR) and Feature Aided Tracking (FAT) of moving ground vehicles using High Range Resolution (HRR) radar has received increased interest in the community. HRR radar is an excellent sensor for potentially identifying moving targets under all-weather, day/night, long-standoff conditions. This paper presents preliminary results of a Veridian Engineering Internal Research and Development effort to determine the feasibility of using invariant HRR signature features to assist a FAT algorithm. The presented method of invariant analysis makes use of Lie mathematics to determine geometric and system invariants contained within an Object/Image (O/I) relationship. The fundamental O/I relationship expresses a geometric relationship (constraint) between a 3-D object (scattering center) and its image (a 1-D HRR profile). The HRR radar sensor model is defined, and then the O/I relationship for invariant features is derived. Although constructing invariants is not a trivial task, once an invariant is determined, it is computationally simple to implement into a FAT algorithm.
Improving the performance of image classification by Hahn moment invariants.
Sayyouri, Mhamed; Hmimid, Abdeslam; Qjidaa, Hassan
2013-11-01
The discrete orthogonal moments are powerful descriptors for image analysis and pattern recognition. However, the computation of these moments is a time consuming procedure. To solve this problem, a new approach that permits the fast computation of Hahn's discrete orthogonal moments is presented in this paper. The proposed method is based, on the one hand, on the computation of Hahn's discrete orthogonal polynomials using the recurrence relation with respect to the variable x instead of the order n and the symmetry property of Hahn's polynomials and, on the other hand, on the application of an innovative image representation where the image is described by a number of homogenous rectangular blocks instead of individual pixels. The paper also proposes a new set of Hahn's invariant moments under the translation, the scaling, and the rotation of the image. This set of invariant moments is computed as a linear combination of invariant geometric moments from a finite number of image intensity slices. Several experiments are performed to validate the effectiveness of our descriptors in terms of the acceleration of time computation, the reconstruction of the image, the invariability, and the classification. The performance of Hahn's moment invariants used as pattern features for a pattern classification application is compared with Hu [IRE Trans. Inform. Theory 8, 179 (1962)] and Krawchouk [IEEE Trans. Image Process.12, 1367 (2003)] moment invariants.
Contour matching by epipolar geometry
NASA Astrophysics Data System (ADS)
Hu, Mao-Lin; Zhang, Damin; Wei, Sui
2003-09-01
Matching features computed in images is an important process in multiview image analysis. When the motion between two images is large, the matching problem becomes very difficult. In this paper, we propose a contour matching algorithm based on geometric constraints. With the assumption that the contours are obtained from images taken from a moving camera with static scenes, we apply the epipolar constraint between two sets of contours and compute the corresponding points on the contours. From the initial epipolar constraints obtained from comer point matching, candidate contours are selected according to the epipolar geometry, the linear relation among tangent vectors of the contour. In order to reduce the possibility of false matches, the curvature of the contour of match points on a contour is also used as a selection method. The initial epipolar constraint is refined from the matched sets of contours. The algorithm can be applied to a pair or two pairs of images. All of the processes are fully automatic and successfully implemented and tested with various synthetic images.
Measurement invariance versus selection invariance: is fair selection possible?
Borsboom, Denny; Romeijn, Jan-Willem; Wicherts, Jelte M
2008-06-01
This article shows that measurement invariance (defined in terms of an invariant measurement model in different groups) is generally inconsistent with selection invariance (defined in terms of equal sensitivity and specificity across groups). In particular, when a unidimensional measurement instrument is used and group differences are present in the location but not in the variance of the latent distribution, sensitivity and positive predictive value will be higher in the group at the higher end of the latent dimension, whereas specificity and negative predictive value will be higher in the group at the lower end of the latent dimension. When latent variances are unequal, the differences in these quantities depend on the size of group differences in variances relative to the size of group differences in means. The effect originates as a special case of Simpson's paradox, which arises because the observed score distribution is collapsed into an accept-reject dichotomy. Simulations show the effect can be substantial in realistic situations. It is suggested that the effect may be partly responsible for overprediction in minority groups as typically found in empirical studies on differential academic performance. A methodological solution to the problem is suggested, and social policy implications are discussed.
Cohomological invariants of central simple algebras
NASA Astrophysics Data System (ADS)
Merkurjev, A. S.
2016-10-01
We determine the indecomposable degree 3 cohomological invariants of tuples of central simple algebras with linear relations. Equivalently, we determine the degree 3 reductive cohomological invariants of all split semisimple groups of type A.
Database crime to crime match rate calculation.
Buckleton, John; Bright, Jo-Anne; Walsh, Simon J
2009-06-01
Guidance exists on how to count matches between samples in a crime sample database but we are unable to locate a definition of how to estimate a match rate. We propose a method that does not proceed from the match counting definition but which has a strong logic.
... for Kids ▸ Stinging Insect Matching Game Share | Stinging Insect Matching Game Stinging insects can ruin summer fun for those who are ... the difference between the different kinds of stinging insects in order to keep your summer safe and ...
Invariance in Measurement and Prediction Revisited
ERIC Educational Resources Information Center
Millsap, Roger E.
2007-01-01
Borsboom (Psychometrika, 71:425-440, 2006) noted that recent work on measurement invariance (MI) and predictive invariance (PI) has had little impact on the practice of measurement in psychology. To understand this contention, the definitions of MI and PI are reviewed, followed by results on the consistency between the two forms of invariance in…
Geometry-invariant resonant cavities
Liberal, I.; Mahmoud, A. M.; Engheta, N.
2016-01-01
Resonant cavities are one of the basic building blocks in various disciplines of science and technology, with numerous applications ranging from abstract theoretical modelling to everyday life devices. The eigenfrequencies of conventional cavities are a function of their geometry, and, thus, the size and shape of a resonant cavity is selected to operate at a specific frequency. Here we demonstrate theoretically the existence of geometry-invariant resonant cavities, that is, resonators whose eigenfrequencies are invariant with respect to geometrical deformations of their external boundaries. This effect is obtained by exploiting the unusual properties of zero-index metamaterials, such as epsilon-near-zero media, which enable decoupling of the temporal and spatial field variations in the lossless limit. This new class of resonators may inspire alternative design concepts, and it might lead to the first generation of deformable resonant devices. PMID:27010103
Anisotropic invariance in minisuperspace models
NASA Astrophysics Data System (ADS)
Chagoya, Javier; Sabido, Miguel
2016-06-01
In this paper we introduce invariance under anisotropic transformations to cosmology. This invariance is one of the key ingredients of the theory of quantum gravity at a Lifshitz point put forward by Hořava. We find that this new symmetry in the minisuperspace introduces characteristics to the model that can be relevant in the ultraviolet regime. For example, by canonical quantization we find a Schrödinger-type equation which avoids the problem of frozen time in quantum cosmology. For simple cases we obtain solutions to this quantum equation in a Kantowski-Sachs (KS) minisuperspace. At the classical level, we study KS and Friedmann-Robertson-Walker cosmologies, obtaining modifications to the solutions of general relativity that can be relevant in the early Universe.
Emerging universe from scale invariance
Del Campo, Sergio; Herrera, Ramón; Guendelman, Eduardo I.; Labraña, Pedro E-mail: guendel@bgu.ac.il E-mail: plabrana@ubiobio.cl
2010-06-01
We consider a scale invariant model which includes a R{sup 2} term in action and show that a stable ''emerging universe'' scenario is possible. The model belongs to the general class of theories, where an integration measure independent of the metric is introduced. To implement scale invariance (S.I.), a dilaton field is introduced. The integration of the equations of motion associated with the new measure gives rise to the spontaneous symmetry breaking (S.S.B) of S.I. After S.S.B. of S.I. in the model with the R{sup 2} term (and first order formalism applied), it is found that a non trivial potential for the dilaton is generated. The dynamics of the scalar field becomes non linear and these non linearities are instrumental in the stability of some of the emerging universe solutions, which exists for a parameter range of the theory.
Geometry-invariant resonant cavities
NASA Astrophysics Data System (ADS)
Liberal, I.; Mahmoud, A. M.; Engheta, N.
2016-03-01
Resonant cavities are one of the basic building blocks in various disciplines of science and technology, with numerous applications ranging from abstract theoretical modelling to everyday life devices. The eigenfrequencies of conventional cavities are a function of their geometry, and, thus, the size and shape of a resonant cavity is selected to operate at a specific frequency. Here we demonstrate theoretically the existence of geometry-invariant resonant cavities, that is, resonators whose eigenfrequencies are invariant with respect to geometrical deformations of their external boundaries. This effect is obtained by exploiting the unusual properties of zero-index metamaterials, such as epsilon-near-zero media, which enable decoupling of the temporal and spatial field variations in the lossless limit. This new class of resonators may inspire alternative design concepts, and it might lead to the first generation of deformable resonant devices.
Quantum mechanics from invariance principles
NASA Astrophysics Data System (ADS)
Moldoveanu, Florin
2015-07-01
Quantum mechanics is an extremely successful theory of nature and yet it lacks an intuitive axiomatization. In contrast, the special theory of relativity is well understood and is rooted into natural or experimentally justified postulates. Here we introduce an axiomatization approach to quantum mechanics which is very similar to special theory of relativity derivation. The core idea is that a composed system obeys the same laws of nature as its components. This leads to a Jordan-Lie algebraic formulation of quantum mechanics. The starting assumptions are minimal: the laws of nature are invariant under time evolution, the laws of nature are invariant under tensor composition, the laws of nature are relational, together with the ability to define a physical state (positivity). Quantum mechanics is singled out by a fifth experimentally justified postulate: nature violates Bell's inequalities.
Proton spin: A topological invariant
NASA Astrophysics Data System (ADS)
Tiwari, S. C.
2016-11-01
Proton spin problem is given a new perspective with the proposition that spin is a topological invariant represented by a de Rham 3-period. The idea is developed generalizing Finkelstein-Rubinstein theory for Skyrmions/kinks to topological defects, and using non-Abelian de Rham theorems. Two kinds of de Rham theorems are discussed applicable to matrix-valued differential forms, and traces. Physical and mathematical interpretations of de Rham periods are presented. It is suggested that Wilson lines and loop operators probe the local properties of the topology, and spin as a topological invariant in pDIS measurements could appear with any value from 0 to ℏ 2, i.e. proton spin decomposition has no meaning in this approach.
Gudimetla, V S Rao; Riker, Jim F
2011-03-10
Optical returns from remote resident space-based objects such as satellites suffer from pointing and tracking errors. In a previously reported paper [Appl. Opt.46, 5608 (2007)APOPAI0003-693510.1364/AO.46.005608], we developed a moment-matching technique that used the statistics of time series of these optical returns to extract information about bore sight and symmetric beam jitter errors (symmetric here implies that the standard deviations of the jitter measured along two orthogonal axes, perpendicular to the line of sight, are equal). In this paper, we extend that method to cover the case of asymmetric beam jitter and bore sight. The asymmetric beam jitter may be due to the combination of symmetric atmospheric turbulence beam jitter and optical beam train jitter. In addition, if a tracking control system is operating, even the residual atmospheric tracking jitter could be asymmetric because the power spectrum is different for the slewing direction compared to the cross-track direction. Analysis of the problem has produced a set of nonlinear equations that can be reduced to a single but much higher-order nonlinear equation in terms of one of the jitter variances. After solving for that jitter, all the equations can be solved to extract all jitter and bore sight errors. The method has been verified by using simulations and then tested on experimental data. In order to develop this method, we derived analytical expressions for the probability density function and the moments of the received total intensity. The results reported here are valid for satellites of small physical cross section, or else those with retroreflectors that dominate the signal return. The results are, in general, applicable to the theory of noncircular Gaussian speckle with a coherent background.
Invariance of the Noether charge
NASA Astrophysics Data System (ADS)
Silagadze, Z. K.
2016-01-01
Surprisingly, an interesting property of the Noether charge that it is by itself invariant under the corresponding symmetry transformation is never discussed in quantum field theory or classical mechanics textbooks we have checked. This property is also almost never mentioned in articles devoted to Noether’s theorem. Nevertheless, to prove this property in the context of Lagrangian formalism is not quite trivial and the proof, outlined in this article, can constitute an useful and interesting exercise for students.
[Invariants of the anthropometrical proportions].
Smolianinov, V V
2012-01-01
In this work a general interpretation of a modulor as scales of segments proportions of anthropometrical modules (extremities and a body) is made. The objects of this study were: 1) to reason the idea of the growth modulor; 2) using the modern empirical data, to prove the validity of a principle of linear similarity for anthropometrical segments; 3) to specify the system of invariants for constitutional anthropometrics.
Shift and Scale Invariant Preprocessor.
1981-12-01
1982 THESIS D V SHIFT AND SCALE INVARIANT ?PREPROCESSOR by Norman E. Huston, Jr. December 1981 0 Thesis Advisor: L. A. Wilson Approved for public...SCHOOL December 1981 Author: - . 4 ,/ A pp ro0ved by: rYY. ( Thesis Advisor Co-Ad isor Chairman, De artment of 4n n eing Dean of Science and...large range of problems/disciplines. Fields where it is particularly common include optical imagery, acoustic signal processing , radiology, radio
Tracking group targets using hypergraph matching in data association
NASA Astrophysics Data System (ADS)
Wu, Shunguang; Xiao, Jiangjiang
2011-09-01
Group moving targets are number of targets independently moving in a physical space but keeping their relative order or pattern invariant. The up to date state-of-the-art multi-target tracking (MTT) data association methods (GNN,JPDA,MHT) are easily fail on group targets tracking problems, since the tracker-to-observation ambiguity cannot be resolved if only using the individual track to observation information. A hypergraph G is represented by G = {V,E}, where V is a set of elements called nodes or vertices, E is a set of non-empty subsets containing d-tuple of vertices called hyperedges. It can be used as a new mathematic tool to represent a group of moving targets if we let each target be a vertex and a d-target subset be an hyperedge. Under this representation, this paper reformulates the traditional MTT data association problem as an hypergraph matching one between the hypergraphs formed from tracks and observations, and shows that the traditional approach (only uses the vertex-to-vertex information) which is a special case under the proposed framework. In addition to the vertex-to-vertex information, since the hyperedge-to-hyperegde information is also used in building the assignment matrix, the hypergraph matching based algorithms give better performance than that from the traditional methods in group target tracking problems. We demonstrate the declaration from simulations as well as video based geotracking examples.
Jenkins, J M; Doyle, L R; Cullers, D K
1996-02-01
The photometric detection of extrasolar planets by transits in eclipsing binary systems can be significantly improved by cross-correlating the observational light curves with synthetic models of possible planetary transit features, essentially a matched filter approach. We demonstrate the utility and application of this transit detection algorithm for ground-based detections of terrestrial-sized (Earth-to-Neptune radii) extrasolar planets in the dwarf M-star eclipsing binary system CM Draconis. Preliminary photometric observational data of this system demonstrate that the observational noise is well characterized as white and Gaussian at the observational time steps required for precision photometric measurements. Depending on planet formation scenarios, terrestrial-sized planets may form quite close to this low-luminosity system. We demonstrate, for example, that planets as small as 1.4 Earth radii with periods on the order of a few months in the CM Draconis system could be detected at the 99.9% confidence level in less than a year using 1-m class telescopes from the ground. This result contradicts commonly held assumptions limiting present ground-based efforts to, at best, detections of gas giant planets after several years of observation. This method can be readily extended to a number of other larger star systems with the utilization of larger telescopes and longer observing times. Its extension to spacecraft observations should also allow the determination of the presence of terrestrial-sized planets in nearly 100 other known eclipsing binary systems.
Disformal invariance of curvature perturbation
Motohashi, Hayato; White, Jonathan E-mail: jwhite@post.kek.jp
2016-02-01
We show that under a general disformal transformation the linear comoving curvature perturbation is not identically invariant, but is invariant on superhorizon scales for any theory that is disformally related to Horndeski's theory. The difference between disformally related curvature perturbations is found to be given in terms of the comoving density perturbation associated with a single canonical scalar field. In General Relativity it is well-known that this quantity vanishes on superhorizon scales through the Poisson equation that is obtained on combining the Hamiltonian and momentum constraints, and we confirm that a similar result holds for any theory that is disformally related to Horndeski's scalar-tensor theory so long as the invertibility condition for the disformal transformation is satisfied. We also consider the curvature perturbation at full nonlinear order in the unitary gauge, and find that it is invariant under a general disformal transformation if we assume that an attractor regime has been reached. Finally, we also discuss the counting of degrees of freedom in theories disformally related to Horndeski's.
Conformal Invariance of Graphene Sheets
Giordanelli, I.; Posé, N.; Mendoza, M.; Herrmann, H. J.
2016-01-01
Suspended graphene sheets exhibit correlated random deformations that can be studied under the framework of rough surfaces with a Hurst (roughness) exponent 0.72 ± 0.01. Here, we show that, independent of the temperature, the iso-height lines at the percolation threshold have a well-defined fractal dimension and are conformally invariant, sharing the same statistical properties as Schramm-Loewner evolution (SLEκ) curves with κ = 2.24 ± 0.07. Interestingly, iso-height lines of other rough surfaces are not necessarily conformally invariant even if they have the same Hurst exponent, e.g. random Gaussian surfaces. We have found that the distribution of the modulus of the Fourier coefficients plays an important role on this property. Our results not only introduce a new universality class and place the study of suspended graphene membranes within the theory of critical phenomena, but also provide hints on the long-standing question about the origin of conformal invariance in iso-height lines of rough surfaces. PMID:26961723
Inflationary quasiscale-invariant attractors
NASA Astrophysics Data System (ADS)
Rinaldi, Massimiliano; Vanzo, Luciano; Zerbini, Sergio; Venturi, Giovanni
2016-01-01
In a series of recent papers Kallosh, Linde, and collaborators provide a unified description of single-field inflation with several types of potentials ranging from power law to supergravity, in terms of just one parameter α . These so-called α attractors predict a spectral index ns and a tensor-to-scalar ratio r , which are fully compatible with the latest Planck data. The only common feature of all α attractors is a noncanonical kinetic term with a pole, and a potential analytic around the pole. In this paper, starting from the same Einstein frame with a noncanonical scalar kinetic energy, we explore the case of nonanalytic potentials. We find the functional form that corresponds to quasiscale-invariant gravitational models in the Jordan frame characterized by a universal relation between r and ns that fits the observational data but is clearly distinct from the one of the α attractors. It is known that the breaking of the exact classical scale invariance in the Jordan frame can be attributed to one-loop corrections. Therefore we conclude that there exists a class of nonanalytic potentials in the noncanonical Einstein frame that is physically equivalent to a class of models in the Jordan frame, with scale invariance softly broken by one-loop quantum corrections.
Scale invariance implies conformal invariance for the three-dimensional Ising model.
Delamotte, Bertrand; Tissier, Matthieu; Wschebor, Nicolás
2016-01-01
Using the Wilson renormalization group, we show that if no integrated vector operator of scaling dimension -1 exists, then scale invariance implies conformal invariance. By using the Lebowitz inequalities, we prove that this necessary condition is fulfilled in all dimensions for the Ising universality class. This shows, in particular, that scale invariance implies conformal invariance for the three-dimensional Ising model.
Skyline based terrain matching
NASA Technical Reports Server (NTRS)
Page, Lance A.
1990-01-01
Skyline-based terrain matching, a new method for locating the vantage point of stereo camera or laser range-finding measurements on a global map previously prepared by satellite or aerial mapping is described. The orientation of the vantage is assumed known, but its translational parameters are determined by the algorithm. Skylines, or occluding contours, can be extracted from the sensory measurements taken by an autonomous vehicle. They can also be modeled from the global map, given a vantage estimate from which to start. The two sets of skylines, represented in cylindrical coordinates about either the true or the estimated vantage, are employed as 'features' or reference objects common to both sources of information. The terrain matching problem is formulated in terms of finding a translation between the respective representations of the skylines, by approximating the two sets of skylines as identical features (curves) on the actual terrain. The search for this translation is based on selecting the longest of the minimum-distance vectors between corresponding curves from the two sets of skylines. In successive iterations of the algorithm, the approximation that the two sets of curves are identical becomes more accurate, and the vantage estimate continues to improve. The algorithm was implemented and evaluated on a simulated terrain. Illustrations and examples are included.
Gerssen, Arjen; van Olst, Erik H W; Mulder, Patrick P J; de Boer, Jacob
2010-08-01
A liquid chromatography tandem mass spectrometry (LC-MS/MS) method for the quantitative analysis of lipophilic marine toxins in shellfish extracts (mussel, oyster, cockle and clam) was validated in-house using European Union (EU) Commission Decision 2002/657/EC as a guideline. The validation included the toxins okadaic acid (OA), yessotoxin (YTX), azaspiracid-1 (AZA1), pectenotoxin-2 (PTX2) and 13-desmethyl spirolide-C (SPX1). Validation was performed at 0.5, 1 and 1.5 times the current EU permitted levels, which are 160 microg kg(-1) for OA, AZA1 and PTX2 and 1,000 microg kg(-1) for YTX. For SPX1, 400 microg kg(-1) was chosen as the target level as no legislation has been established yet for this compound. The method was validated for determination in crude methanolic shellfish extracts and for extracts purified by solid-phase extraction (SPE). Extracts were also subjected to hydrolysis conditions to determine the performance of the method for OA and dinophysistoxin esters. The toxins were quantified against a set of matrix-matched standards instead of standard solutions in methanol. To save valuable standard, methanolic extract instead of the homogenate was spiked with the toxin standard. This was justified by the fact that the extraction efficiency is high for all relevant toxins (above 90%). The method performed very well with respect to accuracy, intraday precision (repeatability), interday precision (within-laboratory reproducibility), linearity, decision limit, specificity and ruggedness. At the permitted level the accuracy ranged from 102 to 111%, the repeatability from 2.6 to 6.7% and the reproducibility from 4.7 to 14.2% in crude methanolic extracts. The crude extracts performed less satisfactorily with respect to the linearity (less than 0.990) and the change in LC-MS/MS sensitivity during the series (more than 25%). SPE purification resulted in greatly improved linearity and signal stability during the series. Recently the European Food Safety Authority
The TTO method and procedural invariance.
Spencer, Anne
2003-08-01
In a pilot study we investigate whether the inferences we draw about people's preferences towards health care treatments are altered if we vary the procedure that is used to elicit these preferences. In a conventional time trade-off (TTO) question, respondents express their preferences towards treatment by comparing a period of ill-health with a shorter period in a higher quality of life. In our less conventional TTO question, we vary the procedure by asking respondents their preferences towards treatment by comparing a period of ill-health with a longer period in a lower quality of life. The quantitative data are equivocal about whether preferences for treatment differ between the conventional and unconventional questions. The qualitative data support the notion of contrasting issues in the questions that involve prolonging time in a lower quality of life and appear to account for a failure to find quantitative differences in all of the questions.
Incoherent method for rotation-invariant recognition.
Arsenault, H H; Hsu, Y N; Yang, Y
1982-02-15
An optodigital hybrid system using an incoherent circular correlator that has features suitable for space and industrial applications is introduced. The incoherent circular correlator uses a fiber-optics sampler and carries out the correlations in white light. The trade offs involved for efficient detection of objects are discussed. The system has been built, and experimental results on a real air photograph are presented.
Distinctive Order Based Self-Similarity descriptor for multi-sensor remote sensing image matching
NASA Astrophysics Data System (ADS)
Sedaghat, Amin; Ebadi, Hamid
2015-10-01
Robust, well-distributed and accurate feature matching in multi-sensor remote sensing image is a difficult task duo to significant geometric and illumination differences. In this paper, a robust and effective image matching approach is presented for multi-sensor remote sensing images. The proposed approach consists of three main steps. In the first step, UR-SIFT (Uniform robust scale invariant feature transform) algorithm is applied for uniform and dense local feature extraction. In the second step, a novel descriptor namely Distinctive Order Based Self Similarity descriptor, DOBSS descriptor, is computed for each extracted feature. Finally, a cross matching process followed by a consistency check in the projective transformation model is performed for feature correspondence and mismatch elimination. The proposed method was successfully applied for matching various multi-sensor satellite images as: ETM+, SPOT 4, SPOT 5, ASTER, IRS, SPOT 6, QuickBird, GeoEye and Worldview sensors, and the results demonstrate its robustness and capability compared to common image matching techniques such as SIFT, PIIFD, GLOH, LIOP and LSS.
Reducing the likelihood of long tennis matches.
Barnett, Tristan; Alan, Brown; Pollard, Graham
2006-01-01
Long matches can cause problems for tournaments. For example, the starting times of subsequent matches can be substantially delayed causing inconvenience to players, spectators, officials and television scheduling. They can even be seen as unfair in the tournament setting when the winner of a very long match, who may have negative aftereffects from such a match, plays the winner of an average or shorter length match in the next round. Long matches can also lead to injuries to the participating players. One factor that can lead to long matches is the use of the advantage set as the fifth set, as in the Australian Open, the French Open and Wimbledon. Another factor is long rallies and a greater than average number of points per game. This tends to occur more frequently on the slower surfaces such as at the French Open. The mathematical method of generating functions is used to show that the likelihood of long matches can be substantially reduced by using the tiebreak game in the fifth set, or more effectively by using a new type of game, the 50-40 game, throughout the match. Key PointsThe cumulant generating function has nice properties for calculating the parameters of distributions in a tennis matchA final tiebreaker set reduces the length of matches as currently being used in the US OpenA new 50-40 game reduces the length of matches whilst maintaining comparable probabilities for the better player to win the match.
Shape invariant potentials in higher dimensions
Sandhya, R.; Sree Ranjani, S.; Kapoor, A.K.
2015-08-15
In this paper we investigate the shape invariance property of a potential in one dimension. We show that a simple ansatz allows us to reconstruct all the known shape invariant potentials in one dimension. This ansatz can be easily extended to arrive at a large class of new shape invariant potentials in arbitrary dimensions. A reformulation of the shape invariance property and possible generalizations are proposed. These may lead to an important extension of the shape invariance property to Hamiltonians that are related to standard potential problems via space time transformations, which are found useful in path integral formulation of quantum mechanics.
Investigating an Invariant Item Ordering for Polytomously Scored Items
ERIC Educational Resources Information Center
Ligtvoet, Rudy; van der Ark, L. Andries; te Marvelde, Janneke M.; Sijtsma, Klaas
2010-01-01
This article discusses the concept of an invariant item ordering (IIO) for polytomously scored items and proposes methods for investigating an IIO in real test data. Method manifest IIO is proposed for assessing whether item response functions intersect. Coefficient H[superscript T] is defined for polytomously scored items. Given that an IIO…
An improved SIFT algorithm in the application of close-range Stereo image matching
NASA Astrophysics Data System (ADS)
Zhang, Xuehua; Wang, Xiaoqing; Yuan, Xiaoxiang; Wang, Shumin
2016-11-01
As unmanned aerial vehicle (UAV) remote sensing is applied in small area aerial photogrammetry surveying, disaster monitoring and emergency command, 3D urban construction and other fields, the image processing of UAV has become a hot topic in current research. The precise matching of UAV image is a key problem, which affects the subsequent processing precision directly, such as 3D reconstruction and automatic aerial triangulation, etc. At present, SIFT (Scale Invariant Feature Transform) algorithm proposed by DAVID G. LOWE as the main method is, is widely used in image matching, since its strong stability to image rotation, shift, scaling, and the change of illumination conditions. It has been successfully applied in target recognition, SFM (Structure from Motion), and many other fields. SIFT algorithm needs the colour images to be converted into grayscale images, detects extremum points under different scales and uses neighbourhood pixels to generate descriptor. As we all know that UAV images with rich colour information, the SIFT algorithm improved through combining with the image colour information in this paper, the experiments are conducted from matching efficiency and accuracy compared with the original SIFT algorithm. The results show that the method which proposed in this paper decreases on the efficiency, but is improved on the precision and provides a basis choice for matching method.
RGIsearch: A C++ program for the determination of renormalization group invariants
NASA Astrophysics Data System (ADS)
Verheyen, Rob
2016-05-01
RGIsearch is a C++ program that searches for invariants of a user-defined set of renormalization group equations. Based on the general shape of the β-functions of quantum field theories, RGIsearch searches for several types of invariants that require different methods. Additionally, it supports the computation of invariants up to two-loop level. A manual for the program is given, including the settings and set-up of the program, as well as a test case.
Surface-invariants in 2D classical Yang-Mills theory
Diaz, Rafael; Fuenmayor, E.; Leal, Lorenzo
2006-03-15
We study a method to obtain invariants under area-preserving diffeomorphisms associated to closed curves in the plane from classical Yang-Mills theory in two dimensions. Taking as starting point the Yang-Mills field coupled to nondynamical particles carrying chromo-electric charge, and by means of a perturbative scheme, we obtain the first two contributions to the on-shell action, which are area-invariants. A geometrical interpretation of these invariants is given.
On asymptotically lacunary invariant statistical equivalent set sequences
NASA Astrophysics Data System (ADS)
Pancaroglu, Nimet; Nuray, Fatih; Savas, Ekrem
2013-10-01
In this paper, we define asymptotically invariant equivalence, strongly asymptotically invariant equivalence, asymptotically invariant statistical equivalence, asymptotically lacunary invariant statistical equivalence, strongly asymptotically lacunary invariant equivalence, asymptotically lacunary invariant equivalence (Wijsman sense) for sequences of sets. Also we investigate some relations between asymptotically lacunary invariant statistical equivalence and asymptotically invariant statistical equivalence for sequences of sets. We introduce some notions and theorems as follows, asymptotically lacunary invariant statistical equivalence, strongly asymptotically lacunary invariant equivalence, asymptotically lacunary invariant equivalence (Wijsman sense) for sequences of sets.
Semi-Global Matching in Object Space
NASA Astrophysics Data System (ADS)
Bethmann, F.; Luhmann, T.
2015-03-01
Semi-Global Matching (SGM) is a widespread algorithm for image matching which is used for very different applications, ranging from real-time applications (e.g. for generating 3D data for driver assistance systems) to aerial image matching. Originally developed for stereo-image matching, several extensions have been proposed to use more than two images within the matching process (multi-baseline matching, multi-view stereo). These extensions still perform the image matching in (rectified) stereo images and combine the pairwise results afterwards to create the final solution. This paper proposes an alternative approach which is suitable for the introduction of an arbitrary number of images into the matching process and utilizes image matching by using non-rectified images. The new method differs from the original SGM method mainly in two aspects: Firstly, the cost calculation is formulated in object space within a dense voxel raster by using the grey (or colour) values of all images instead of pairwise cost calculation in image space. Secondly, the semi-global (path-wise) minimization process is transferred into object space as well, so that the result of semi-global optimization leads to index maps (instead of disparity maps) which directly indicate the 3D positions of the best matches. Altogether, this yields to an essential simplification of the matching process compared to multi-view stereo (MVS) approaches. After a description of the new method, results achieved from two different datasets (close-range and aerial) are presented and discussed.
Understanding Y haplotype matching probability.
Brenner, Charles H
2014-01-01
The Y haplotype population-genetic terrain is better explored from a fresh perspective rather than by analogy with the more familiar autosomal ideas. For haplotype matching probabilities, versus for autosomal matching probabilities, explicit attention to modelling - such as how evolution got us where we are - is much more important while consideration of population frequency is much less so. This paper explores, extends, and explains some of the concepts of "Fundamental problem of forensic mathematics - the evidential strength of a rare haplotype match". That earlier paper presented and validated a "kappa method" formula for the evidential strength when a suspect matches a previously unseen haplotype (such as a Y-haplotype) at the crime scene. Mathematical implications of the kappa method are intuitive and reasonable. Suspicions to the contrary raised in rest on elementary errors. Critical to deriving the kappa method or any sensible evidential calculation is understanding that thinking about haplotype population frequency is a red herring; the pivotal question is one of matching probability. But confusion between the two is unfortunately institutionalized in much of the forensic world. Examples make clear why (matching) probability is not (population) frequency and why uncertainty intervals on matching probabilities are merely confused thinking. Forensic matching calculations should be based on a model, on stipulated premises. The model inevitably only approximates reality, and any error in the results comes only from error in the model, the inexactness of the approximation. Sampling variation does not measure that inexactness and hence is not helpful in explaining evidence and is in fact an impediment. Alternative haplotype matching probability approaches that various authors have considered are reviewed. Some are based on no model and cannot be taken seriously. For the others, some evaluation of the models is discussed. Recent evidence supports the adequacy of
NASA Technical Reports Server (NTRS)
Crosson, William L.; Duchon, Claude E.; Raghavan, Ravikumar; Goodman, Steven J.
1996-01-01
Precipitation estimates from radar systems are a crucial component of many hydrometeorological applications, from flash flood forecasting to regional water budget studies. For analyses on large spatial scales and long timescales, it is frequently necessary to use composite reflectivities from a network of radar systems. Such composite products are useful for regional or national studies, but introduce a set of difficulties not encountered when using single radars. For instance, each contributing radar has its own calibration and scanning characteristics, but radar identification may not be retained in the compositing procedure. As a result, range effects on signal return cannot be taken into account. This paper assesses the accuracy with which composite radar imagery can be used to estimate precipitation in the convective environment of Florida during the summer of 1991. Results using Z = 30OR(sup 1.4) (WSR-88D default Z-R relationship) are compared with those obtained using the probability matching method (PMM). Rainfall derived from the power law Z-R was found to he highly biased (+90%-l10%) compared to rain gauge measurements for various temporal and spatial integrations. Application of a 36.5-dBZ reflectivity threshold (determined via the PMM) was found to improve the performance of the power law Z-R, reducing the biases substantially to 20%-33%. Correlations between precipitation estimates obtained with either Z-R relationship and mean gauge values are much higher for areal averages than for point locations. Precipitation estimates from the PMM are an improvement over those obtained using the power law in that biases and root-mean-square errors are much lower. The minimum timescale for application of the PMM with the composite radar dataset was found to be several days for area-average precipitation. The minimum spatial scale is harder to quantify, although it is concluded that it is less than 350 sq km. Implications relevant to the WSR-88D system are
Path similarity skeleton graph matching.
Bai, Xiang; Latecki, Longin Jan
2008-07-01
This paper presents a novel framework to for shape recognition based on object silhouettes. The main idea is to match skeleton graphs by comparing the shortest paths between skeleton endpoints. In contrast to typical tree or graph matching methods, we completely ignore the topological graph structure. Our approach is motivated by the fact that visually similar skeleton graphs may have completely different topological structures. The proposed comparison of shortest paths between endpoints of skeleton graphs yields correct matching results in such cases. The skeletons are pruned by contour partitioning with Discrete Curve Evolution, which implies that the endpoints of skeleton branches correspond to visual parts of the objects. The experimental results demonstrate that our method is able to produce correct results in the presence of articulations, stretching, and occlusion.
Machine learning strategies for systems with invariance properties
NASA Astrophysics Data System (ADS)
Ling, Julia; Jones, Reese; Templeton, Jeremy
2016-08-01
In many scientific fields, empirical models are employed to facilitate computational simulations of engineering systems. For example, in fluid mechanics, empirical Reynolds stress closures enable computationally-efficient Reynolds Averaged Navier Stokes simulations. Likewise, in solid mechanics, constitutive relations between the stress and strain in a material are required in deformation analysis. Traditional methods for developing and tuning empirical models usually combine physical intuition with simple regression techniques on limited data sets. The rise of high performance computing has led to a growing availability of high fidelity simulation data. These data open up the possibility of using machine learning algorithms, such as random forests or neural networks, to develop more accurate and general empirical models. A key question when using data-driven algorithms to develop these empirical models is how domain knowledge should be incorporated into the machine learning process. This paper will specifically address physical systems that possess symmetry or invariance properties. Two different methods for teaching a machine learning model an invariance property are compared. In the first method, a basis of invariant inputs is constructed, and the machine learning model is trained upon this basis, thereby embedding the invariance into the model. In the second method, the algorithm is trained on multiple transformations of the raw input data until the model learns invariance to that transformation. Results are discussed for two case studies: one in turbulence modeling and one in crystal elasticity. It is shown that in both cases embedding the invariance property into the input features yields higher performance at significantly reduced computational training costs.
Spatio-Temporal Matching for Human Pose Estimation in Video.
Zhou, Feng; Torre, Fernando De la
2016-08-01
Detection and tracking humans in videos have been long-standing problems in computer vision. Most successful approaches (e.g., deformable parts models) heavily rely on discriminative models to build appearance detectors for body joints and generative models to constrain possible body configurations (e.g., trees). While these 2D models have been successfully applied to images (and with less success to videos), a major challenge is to generalize these models to cope with camera views. In order to achieve view-invariance, these 2D models typically require a large amount of training data across views that is difficult to gather and time-consuming to label. Unlike existing 2D models, this paper formulates the problem of human detection in videos as spatio-temporal matching (STM) between a 3D motion capture model and trajectories in videos. Our algorithm estimates the camera view and selects a subset of tracked trajectories that matches the motion of the 3D model. The STM is efficiently solved with linear programming, and it is robust to tracking mismatches, occlusions and outliers. To the best of our knowledge this is the first paper that solves the correspondence between video and 3D motion capture data for human pose detection. Experiments on the CMU motion capture, Human3.6M, Berkeley MHAD and CMU MAD databases illustrate the benefits of our method over state-of-the-art approaches.
Invariant Quantities in Shear Flow
NASA Astrophysics Data System (ADS)
Baule, A.; Evans, R. M. L.
2008-12-01
The dynamics of systems out of thermal equilibrium is usually treated on a case-by-case basis without knowledge of fundamental and universal principles. We address this problem for a class of driven steady states, namely, those mechanically driven at the boundaries such as complex fluids under shear. From a nonequilibrium counterpart to detailed balance (NCDB) we derive a remarkably simple set of invariant quantities which remain unchanged when the system is driven. These new nonequilibrium relations are both exact and valid arbitrarily far from equilibrium. Furthermore, they enable the systematic calculation of transition rates in driven systems with state spaces of arbitrary connectivity.
A Characterization of Invariant Connections
NASA Astrophysics Data System (ADS)
Hanusch, Maximilian
2014-03-01
Given a principal fibre bundle with structure group S and a fibre transitive Lie group G of automorphisms thereon, Wang's theorem identifies the invariant connections with certain linear maps ψ\\colon {g}→ {s}. In the present paper we prove an extension of this theorem that applies to the general situation where G acts non-transitively on the base manifold. We consider several special cases of the general theorem including the result of Harnad, Shnider and Vinet which applies to the situation where G admits only one orbit type. Along the way we give applications to loop quantum gravity.
Translational invariance in nucleation theories: theoretical formulation.
Drossinos, Y; Kevrekidis, P G; Georgopoulos, P G
2001-03-01
The consequences of spontaneously broken translational invariance on the nucleation-rate statistical prefactor in theories of first-order phase transitions are analyzed. A hybrid, semiphenomenological approach based on field-theoretic analyses of condensation and modern density-functional theories of nucleation is adopted to provide a unified prescription for the incorporation of translational-invariance corrections to nucleation-rate predictions. A connection between these theories is obtained starting from a quantum-mechanical Hamiltonian and using methods developed in the context of studies on Bose-Einstein condensation. An extremum principle is used to derive an integro-differential equation for the spatially nonuniform mean-field order-parameter profile; the appropriate order parameter becomes the square root of the fluid density. The importance of the attractive intermolecular potential is emphasized, whereas the repulsive two-body potential is approximated by considering hard-sphere collisions. The functional form of the degenerate translational eigenmodes in three dimensions is related to the mean-field order parameter, and their contribution to the nucleation-rate prefactor is evaluated. The solution of the Euler-Lagrange variational equation is discussed in terms of either a proposed variational trial function or the complete numerical solution of the associated boundary-value integro-differential problem. Alternatively, if the attractive potential is not explicitly known, an approach that allows its formal determination from its moments is presented.
Vagg, P R; Hammond, S B
1976-06-01
A study by Eysenck & Eysenck (1969) investigated the invariance across sex of factors derived from the Eysenck, Cattell and Guilford personality inventories. They found only neuroticism and extraversion invariant. The present study was designed as a partial replication of their study, but employed simpler, common-sense methods that gave the more moderate sized factors a chance to demonstrate the extent of their invariance across sex. Four invariant factors were found: the first two, neuroticism and sociability, were large and demonstrated almost complete invariance across sex; the third and fourth factors were moderate-sized and showed less, but substantial invariance across sex. They were called 'sensitivity v. practicality' and 'group-centred morality v. self-centred independence'.
Effect of silhouetting and inversion on view invariance in the monkey inferotemporal cortex.
Ratan Murty, N Apurva; Arun, Sripati Panditaradhyula
2017-04-05
We effortlessly recognize objects across changes in viewpoint, but we know relatively little about the features that underlie viewpoint invariance in the brain. Here we set out to characterize how viewpoint invariance in monkey inferior temporal (IT) neurons is influenced by two image manipulations - silhouetting and inversion. Reducing an object into its silhouette removes internal detail, so this would reveal how much viewpoint invariance depends on the external contours. Inverting an object retains but rearranges features, so this would reveal how much viewpoint invariance depends on the arrangement and orientation of features. Our main findings are: (1) View invariance is weakened by silhouetting but not by inversion; (2) View invariance was stronger in neurons that generalized across silhouetting and inversion; (3) Neuronal responses to natural objects matched early with that of silhouettes and only later to that of inverted objects, indicative of coarse-to-fine processing and (4) The impact of silhouetting and inversion depended on object structure. Taken together, our results elucidate the underlying features and dynamics of view invariant object representations in the brain.
Feve, Jean-Philippe; Kliner, Dahv A. V.; Farrow; Roger L.
2011-02-01
An optical amplifier, such as an optical waveguide amplifier (e.g., an optical fiber amplifier or a planar waveguide) or a non-guiding optical amplifier, that exhibits a net phase-mismatch selected to at least partially reduce gain-induced phase-matching during operation thereof is disclosed. In one aspect of the invention, an optical amplifier structure includes at least one optical amplifier having a length and a gain region. The at least one optical amplifier exhibits a net phase-mismatch that varies along at least part of the length thereof selected to at least partially reduce gain-induced phase-matching during operation thereof.
Chaotic jumps in the generalized first adiabatic invariant in current sheets
NASA Technical Reports Server (NTRS)
Brittnacher, M. J.; Whipple, E. C.
1991-01-01
The present study examines how the changes in the generalized first adiabatic invariant J derived from the separatrix crossing theory can be incorporated into the drift variable approach to generating distribution functions. A method is proposed for determining distribution functions for an ensemble of particles following interaction with the tail current sheet by treating the interaction as a scattering problem characterized by changes in the invariant. Generalized drift velocities are obtained for a 1D tail configuration by using the generalized first invariant. The invariant remained constant except for the discrete changes caused by chaotic scattering as the particles cross the separatrix.
Octupolar invariants for compact binaries on quasicircular orbits
NASA Astrophysics Data System (ADS)
Nolan, Patrick; Kavanagh, Chris; Dolan, Sam R.; Ottewill, Adrian C.; Warburton, Niels; Wardell, Barry
2015-12-01
We extend the gravitational self-force methodology to identify and compute new O (μ ) tidal invariants for a compact body of mass μ on a quasicircular orbit about a black hole of mass M ≫μ . In the octupolar sector we find seven new degrees of freedom, made up of 3 +3 conservative/dissipative `electric' invariants and 3 +1 `magnetic' invariants, satisfying 1 +1 and 1 +0 trace conditions. We express the new invariants for equatorial circular orbits on Kerr spacetime in terms of the regularized metric perturbation and its derivatives; and we evaluate the expressions in the Schwarzschild case. We employ both Lorenz gauge and Regge-Wheeler gauge numerical codes, and the functional series method of Mano, Suzuki and Takasugi. We present (i) highly-accurate numerical data and (ii) high-order analytical post-Newtonian expansions. We demonstrate consistency between numerical and analytical results, and prior work. We explore the application of these invariants in effective one-body models and binary black hole initial-data formulations.
Measuring Z2 topological invariants in optical lattices using interferometry
NASA Astrophysics Data System (ADS)
Grusdt, F.; Abanin, D.; Demler, E.
2014-04-01
We propose an interferometric method to measure Z2 topological invariants of time-reversal invariant topological insulators realized with optical lattices in two and three dimensions. We suggest two schemes which both rely on a combination of Bloch oscillations with Ramsey interferometry and can be implemented using standard tools of atomic physics. In contrast to topological Zak phase and Chern number, defined for individual one-dimensional and two-dimensional Bloch bands, the formulation of the Z2 invariant involves at least two Bloch bands related by time-reversal symmetry which one must keep track of in measurements. In one of our schemes this can be achieved by the measurement of Wilson loops, which are non-Abelian generalizations of Zak phases. The winding of their eigenvalues is related to the Z2 invariant. We thereby demonstrate that Wilson loops are not just theoretical concepts but can be measured experimentally. For the second scheme we introduce a generalization of time-reversal polarization which is continuous throughout the Brillouin zone. We show that its winding over half the Brillouin zone yields the Z2 invariant. To measure this winding, our protocol only requires Bloch oscillations within a single band, supplemented by coherent transitions to a second band which can be realized by lattice shaking.
Machine learning strategies for systems with invariance properties
Ling, Julia; Jones, Reese E.; Templeton, Jeremy Alan
2016-05-06
Here, in many scientific fields, empirical models are employed to facilitate computational simulations of engineering systems. For example, in fluid mechanics, empirical Reynolds stress closures enable computationally-efficient Reynolds-Averaged Navier-Stokes simulations. Likewise, in solid mechanics, constitutive relations between the stress and strain in a material are required in deformation analysis. Traditional methods for developing and tuning empirical models usually combine physical intuition with simple regression techniques on limited data sets. The rise of high-performance computing has led to a growing availability of high-fidelity simulation data, which open up the possibility of using machine learning algorithms, such as random forests or neural networks, to develop more accurate and general empirical models. A key question when using data-driven algorithms to develop these models is how domain knowledge should be incorporated into the machine learning process. This paper will specifically address physical systems that possess symmetry or invariance properties. Two different methods for teaching a machine learning model an invariance property are compared. In the first , a basis of invariant inputs is constructed, and the machine learning model is trained upon this basis, thereby embedding the invariance into the model. In the second method, the algorithm is trained on multiple transformations of the raw input data until the model learns invariance to that transformation. Results are discussed for two case studies: one in turbulence modeling and one in crystal elasticity. It is shown that in both cases embedding the invariance property into the input features yields higher performance with significantly reduced computational training costs.
Machine learning strategies for systems with invariance properties
Ling, Julia; Jones, Reese E.; Templeton, Jeremy Alan
2016-05-06
Here, in many scientific fields, empirical models are employed to facilitate computational simulations of engineering systems. For example, in fluid mechanics, empirical Reynolds stress closures enable computationally-efficient Reynolds-Averaged Navier-Stokes simulations. Likewise, in solid mechanics, constitutive relations between the stress and strain in a material are required in deformation analysis. Traditional methods for developing and tuning empirical models usually combine physical intuition with simple regression techniques on limited data sets. The rise of high-performance computing has led to a growing availability of high-fidelity simulation data, which open up the possibility of using machine learning algorithms, such as random forests or neuralmore » networks, to develop more accurate and general empirical models. A key question when using data-driven algorithms to develop these models is how domain knowledge should be incorporated into the machine learning process. This paper will specifically address physical systems that possess symmetry or invariance properties. Two different methods for teaching a machine learning model an invariance property are compared. In the first , a basis of invariant inputs is constructed, and the machine learning model is trained upon this basis, thereby embedding the invariance into the model. In the second method, the algorithm is trained on multiple transformations of the raw input data until the model learns invariance to that transformation. Results are discussed for two case studies: one in turbulence modeling and one in crystal elasticity. It is shown that in both cases embedding the invariance property into the input features yields higher performance with significantly reduced computational training costs.« less
A Local Galilean Invariant Thermostat.
Groot, Robert D
2006-05-01
The thermostat introduced recently by Stoyanov and Groot (J. Chem. Phys. 2005, 122, 114112) is analyzed for inhomogeneous systems. This thermostat has one global feature, because the mean temperature used to drive the system toward equilibrium is a global average. The consequence is that the thermostat locally conserves energy rather than temperature. Thus, local temperature variations can be long-lived, although they do average out by thermal diffusion. To obtain a faster local temperature equilibration, a truly local thermostat must be introduced. To conserve momentum and, hence, to simulate hydrodynamic interactions, the thermostat must be Galilean invariant. Such a local Galilean invariant thermostat is studied here. It is shown that, by defining a local temperature on each particle, the ensemble is locally isothermal. The local temperature is obtained from a local square velocity average around each particle. Simulations on the ideal gas show that this local Nosé-Hoover algorithm has a similar artifact as dissipative particle dynamics: the ideal gas pair correlation function is slightly distorted. This is attributed to the fact that the thermostat compensates fluctuations that are natural within a small cluster of particles. When the cutoff range rc for the square velocity average is increased, systematic errors decrease proportionally to rc(-)(3/2); hence, the systematic error can be made arbitrary small.
How is Lorentz invariance encoded in the Hamiltonian?
NASA Astrophysics Data System (ADS)
Kajuri, Nirmalya
2016-07-01
One of the disadvantages of the Hamiltonian formulation is that Lorentz invariance is not manifest in the former. Given a Hamiltonian, there is no simple way to check whether it is relativistic or not. One would either have to solve for the equations of motion or calculate the Poisson brackets of the Noether charges to perform such a check. In this paper we show that, for a class of Hamiltonians, it is possible to check Lorentz invariance directly from the Hamiltonian. Our work is particularly useful for theories where the other methods may not be readily available.
New implicitly solvable potential produced by second order shape invariance
Cannata, F.; Ioffe, M.V.; Kolevatova, E.V.; Nishnianidze, D.N.
2015-05-15
The procedure proposed recently by Bougie et al. (2010) to study the general form of shape invariant potentials in one-dimensional Supersymmetric Quantum Mechanics (SUSY QM) is generalized to the case of Higher Order SUSY QM with supercharges of second order in momentum. A new shape invariant potential is constructed by this method. It is singular at the origin, it grows at infinity, and its spectrum depends on the choice of connection conditions in the singular point. The corresponding Schrödinger equation is solved explicitly: the wave functions are constructed analytically, and the energy spectrum is defined implicitly via the transcendental equation which involves Confluent Hypergeometric functions. - Highlights: • New potential with 2nd order irreducible shape invariance was constructed. • The connection conditions at the singularity of potential were obtained. • The explicit expressions for all wave functions were derived. • The implicit equation for the energy spectrum was obtained.
ERIC Educational Resources Information Center
Bowers, John J.
Procedures devised for computing factor matching statistics in questionnaire construction are described. In a study of the impact of vocational education on social, affective and nontechnical development of students, an attitude questionnaire to measure outcomes was developed. Each item in the final section had a six-point Likert type response…
Approximating Reflectance and Transmittance of Vegetation Using Multiple Spectral Invariants
NASA Astrophysics Data System (ADS)
Mottus, M.
2011-12-01
Canopy spectral invariants, eigenvalues of the radiative transfer equation and photon recollision probability are some of the new theoretical tools that have been applied in remote sensing of vegetation and atmosphere. The theoretical approach based on spectral invariants, informally also referred to as the p-theory, owns its attractivity to several factors. Firstly, it provides a rapid and physically-based way of describing canopy scattering. Secondly, the p-theory aims at parameterizing canopy structure in reflectance models using a simple and intuitive concept which can be applied at various structural levels, from shoot to tree crown. The theory has already been applied at scales from the molecular level to forest stands. The most important shortcoming of the p-theory lies in its inability to predict the directionality of scattering. The theory is currently based on only one physical parameter, the photon recollision probability p. It is evident that one parameter cannot contain enough information to reasonably predict the observed complex reflectance patterns produced by natural vegetation canopies. Without estimating scattering directionality, however, the theory cannot be compared with even the most simple (and well-tested) two-stream vegetation reflectance models. In this study, we evaluate the possibility to use additional parameters to fit the measured reflectance and transmittance of a vegetation stand. As a first step, the parameters are applied to separate canopy scattering into reflectance and transmittance. New parameters are introduced following the general approach of eigenvector expansion. Thus, the new parameters are coined higher-order spectral invariants. Calculation of higher-order invariants is based on separating first-order scattering from total scattering. Thus, the method explicitly accounts for different view geometries with different fractions of visible sunlit canopy (e.g., hot-spot). It additionally allows to produce different
Memristor-based pattern matching
NASA Astrophysics Data System (ADS)
Klimo, Martin; Such, Ondrej; Skvarek, Ondrej; Fratrik, Milan
2014-10-01
Pattern matching is a machine learning area that requires high-performance hardware. It has been hypothesized that massively parallel designs, which avoid von Neumann architecture, could provide a significant performance boost. Such designs can advantageously use memristive switches. This paper discusses a two-stage design that implements the induced ordered weighted average (IOWA) method for pattern matching. We outline the circuit structure and discuss how a functioning circuit can be achieved using metal oxide devices. We describe our simulations of memristive circuits and illustrate their performance on a vowel classification task.
Interacting scale invariant but nonconformal field theories
NASA Astrophysics Data System (ADS)
Nakayama, Yu
2017-03-01
There is a dilemma in constructing interacting scale invariant Euclidean field theories that are not conformal invariant. On one hand, scale invariance without conformal invariance seems more generic by requiring only a smaller symmetry. On the other hand, the existence of a nonconserved current with exact scaling dimension d -1 in d dimensions seems to require extra fine-tuning. To understand the competition better, we explore some examples without the reflection positivity. We show that a theory of elasticity (also known as Riva-Cardy theory) coupled with massless fermions in d =4 -ɛ dimensions does not possess an interacting scale invariant fixed point except for an unstable (and unphysical) one with an infinite coefficient of compression. We do, however, find interacting scale invariant but nonconformal field theories in gauge fixed versions of the Banks-Zaks fixed points in d =4 dimensions.
Ontology Matching Across Domains
2010-05-01
matching include GMO [1], Anchor-Prompt [2], and Similarity Flooding [3]. GMO is an iterative structural matcher, which uses RDF bipartite graphs to...AFRL under contract# FA8750-09-C-0058. References [1] Hu, W., Jian, N., Qu, Y., Wang, Y., “ GMO : a graph matching for ontologies”, in: Proceedings of
Dr Marvin Adams
2002-03-01
OAK 270 - The DOE Matching Grant Program provided $50,000.00 to the Dept of N.E. at TAMU, matching a gift of $50,000.00 from TXU Electric. The $100,000.00 total was spent on scholarships, departmental labs, and computing network.
Linear Invariant Multiclass Component Spaces For Optical Pattern Recognition
NASA Astrophysics Data System (ADS)
Hester, Charles F.
1983-04-01
Optical processing systems which perform linear transformations on image data at high rates are ideal for image pattern recognition systems. As a result of this processing capability, the linear opera-tion of matched spatial filtering has been explored extensively for pattern recognition. For many practical pattern recognition problems, however, multiclass filtering must be used to overcome the variations of input objects due to image scale changes, image rotations, object aspect differences and sensor differences. Hester and Casasent have shown that a linear mapping can be constructed which images all the class elements of a multiclass set into one out-put element or value. This special multi-class filter concept is extended in this paper to show that a subspace of the multi-class set exists that is invariant with respect to the multiclass mapping under linear operations. The concept of this in-variant space and its generation is detailed and a single example given. A typical optical processing architecture using these invariant elements as filters in an associative pattern recognition system is also presented.
Block Matching for Object Tracking
Gyaourova, A; Kamath, C; Cheung, S
2003-10-13
Models which describe road traffic patterns can be helpful in detection and/or prevention of uncommon and dangerous situations. Such models can be built by the use of motion detection algorithms applied to video data. Block matching is a standard technique for encoding motion in video compression algorithms. We explored the capabilities of the block matching algorithm when applied for object tracking. The goal of our experiments is two-fold: (1) to explore the abilities of the block matching algorithm on low resolution and low frame rate video and (2) to improve the motion detection performance by the use of different search techniques during the process of block matching. Our experiments showed that the block matching algorithm yields good object tracking results and can be used with high success on low resolution and low frame rate video data. We observed that different searching methods have small effect on the final results. In addition, we proposed a technique based on frame history, which successfully overcame false motion caused by small camera movements.
Theiler, James P
2009-01-01
Following an analogous distinction in statistical hypothesis testing, we investigate variants of machine learning where the training set comes in matched pairs. We demonstrate that even conventional classifiers can exhibit improved performance when the input data has a matched-pair structure. Online algorithms, in particular, converge quicker when the data is presented in pairs. In some scenarios (such as the weak signal detection problem), matched pairs can be generated from independent samples, with the effect not only doubling the nominal size of the training set, but of providing the structure that leads to better learning. A family of 'dipole' algorithms is introduced that explicitly takes advantage of matched-pair structure in the input data and leads to further performance gains. Finally, we illustrate the application of matched-pair learning to chemical plume detection in hyperspectral imagery.
Other Historical and Philosophical Perspectives on Invariance in Measurement
ERIC Educational Resources Information Center
Fisher, William P., Jr.
2008-01-01
Engelhard draws out the similarities and differences in Guttman's, Rasch's, and Mokken's perspectives on invariance in measurement. He provides a valuable model in evaluating the extent to which different measurement theories and methods serve as a basis for achieving the fundamental goals of quantification. The full extent of this point will…
Cross-validation of matching correlation analysis by resampling matching weights.
Shimodaira, Hidetoshi
2016-03-01
The strength of association between a pair of data vectors is represented by a nonnegative real number, called matching weight. For dimensionality reduction, we consider a linear transformation of data vectors, and define a matching error as the weighted sum of squared distances between transformed vectors with respect to the matching weights. Given data vectors and matching weights, the optimal linear transformation minimizing the matching error is solved by the spectral graph embedding of Yan et al. (2007). This method is a generalization of the canonical correlation analysis, and will be called as matching correlation analysis (MCA). In this paper, we consider a novel sampling scheme where the observed matching weights are randomly sampled from underlying true matching weights with small probability, whereas the data vectors are treated as constants. We then investigate a cross-validation by resampling the matching weights. Our asymptotic theory shows that the cross-validation, if rescaled properly, computes an unbiased estimate of the matching error with respect to the true matching weights. Existing ideas of cross-validation for resampling data vectors, instead of resampling matching weights, are not applicable here. MCA can be used for data vectors from multiple domains with different dimensions via an embarrassingly simple idea of coding the data vectors. This method will be called as cross-domain matching correlation analysis (CDMCA), and an interesting connection to the classical associative memory model of neural networks is also discussed.
Differential Invariants of the (2+1)-Dimensional Breaking Soliton Equation
NASA Astrophysics Data System (ADS)
Han, Zhong; Chen, Yong
2016-09-01
We construct the differential invariants of Lie symmetry pseudogroups of the (2+1)-dimensional breaking soliton equation and analyze the structure of the induced differential invariant algebra. Their syzygies and recurrence relations are classified. In addition, a moving frame and the invariantization of the breaking soliton equation are also presented. The algorithms are based on the method of equivariant moving frames.
Onboard Image Registration from Invariant Features
NASA Technical Reports Server (NTRS)
Wang, Yi; Ng, Justin; Garay, Michael J.; Burl, Michael C
2008-01-01
This paper describes a feature-based image registration technique that is potentially well-suited for onboard deployment. The overall goal is to provide a fast, robust method for dynamically combining observations from multiple platforms into sensors webs that respond quickly to short-lived events and provide rich observations of objects that evolve in space and time. The approach, which has enjoyed considerable success in mainstream computer vision applications, uses invariant SIFT descriptors extracted at image interest points together with the RANSAC algorithm to robustly estimate transformation parameters that relate one image to another. Experimental results for two satellite image registration tasks are presented: (1) automatic registration of images from the MODIS instrument on Terra to the MODIS instrument on Aqua and (2) automatic stabilization of a multi-day sequence of GOES-West images collected during the October 2007 Southern California wildfires.
Scale invariance in road networks
NASA Astrophysics Data System (ADS)
Kalapala, Vamsi; Sanwalani, Vishal; Clauset, Aaron; Moore, Cristopher
2006-02-01
We study the topological and geographic structure of the national road networks of the United States, England, and Denmark. By transforming these networks into their dual representation, where roads are vertices and an edge connects two vertices if the corresponding roads ever intersect, we show that they exhibit both topological and geographic scale invariance. That is, we show that for sufficiently large geographic areas, the dual degree distribution follows a power law with exponent 2.2⩽α⩽2.4 , and that journeys, regardless of their length, have a largely identical structure. To explain these properties, we introduce and analyze a simple fractal model of road placement that reproduces the observed structure, and suggests a testable connection between the scaling exponent α and the fractal dimensions governing the placement of roads and intersections.
Quantum groups with invariant integrals
Van Daele, Alfons
2000-01-01
Quantum groups have been studied intensively for the last two decades from various points of view. The underlying mathematical structure is that of an algebra with a coproduct. Compact quantum groups admit Haar measures. However, if we want to have a Haar measure also in the noncompact case, we are forced to work with algebras without identity, and the notion of a coproduct has to be adapted. These considerations lead to the theory of multiplier Hopf algebras, which provides the mathematical tool for studying noncompact quantum groups with Haar measures. I will concentrate on the *-algebra case and assume positivity of the invariant integral. Doing so, I create an algebraic framework that serves as a model for the operator algebra approach to quantum groups. Indeed, the theory of locally compact quantum groups can be seen as the topological version of the theory of quantum groups as they are developed here in a purely algebraic context. PMID:10639115
Asymptotic invariants of homotopy groups
NASA Astrophysics Data System (ADS)
Manin, Fedor
We study the homotopy groups of a finite CW complex X via constraints on the geometry of representatives of their elements. For example, one can measure the "size" of alpha ∈ pi n (X) by the optimal Lipschitz constant or volume of a representative. By comparing the geometrical structure thus obtained with the algebraic structure of the group, one can define functions such as growth and distortion in pin(X), analogously to the way that such functions are studied in asymptotic geometric group theory. We provide a number of examples and techniques for studying these invariants, with a special focus on spaces with few rational homotopy groups. Our main theorem characterizes those X in which all non-torsion homotopy classes are undistorted, that is, their volume distortion functions, and hence also their Lipschitz distortion functions, are linear.
Invariant Coordinates in Breakup Reactions
NASA Astrophysics Data System (ADS)
Skwira-Chalot, I.; Ciepał, I.; Kistryn, St.; Kozela, A.; Parol, W.; Stephan, E.
2017-03-01
Systematic experimental studies of few-nucleon systems expose various dynamical ingredients which play an important role in correct description of observables, such as three-nucleon force, Coulomb force and relativistic effects. A large set of existing experimental data for ^1H(d, p p)n reaction allows for systematic investigations of these dynamical effects, which vary with energy and appear with different strength in certain observables and phase space regions. Moreover, systematic comparisons with exact theoretical calculations, done in variables related to the system dynamics in a possibly direct ways is a very important tool to verify and improve the existing description of the nucleon interaction. Examples of experimental data for a breakup reaction, transformed to the variables based on Lorentz-invariants are compared with modern theoretical calculations.
A Note on Invariant Observables
NASA Astrophysics Data System (ADS)
Lendelová, Katarína
2006-05-01
The ergodic theory and particularly the individual ergodic theorem were studied in many structures. Recently the individual ergodic theorem has been proved for MV-algebras of fuzzy sets (Riečan, 2000; Riečan and Neubrunn, 1997) and even in general MV-algebras (Jurečková, 2000). The notion of almost everywhere equality of observables was introduced by B. Riečan and M. Jurečková in Riečan and Jurečková (2005). They proved that the limit of Cesaro means is an invariant observable for P-observables. In this paper show that the assumption of P-observable can be omitted.
Real-time pose invariant logo and pattern detection
NASA Astrophysics Data System (ADS)
Sidla, Oliver; Kottmann, Michal; Benesova, Wanda
2011-01-01
The detection of pose invariant planar patterns has many practical applications in computer vision and surveillance systems. The recognition of company logos is used in market studies to examine the visibility and frequency of logos in advertisement. Danger signs on vehicles could be detected to trigger warning systems in tunnels, or brand detection on transport vehicles can be used to count company-specific traffic. We present the results of a study on planar pattern detection which is based on keypoint detection and matching of distortion invariant 2d feature descriptors. Specifically we look at the keypoint detectors of type: i) Lowe's DoG approximation from the SURF algorithm, ii) the Harris Corner Detector, iii) the FAST Corner Detector and iv) Lepetit's keypoint detector. Our study then compares the feature descriptors SURF and compact signatures based on Random Ferns: we use 3 sets of sample images to detect and match 3 logos of different structure to find out which combinations of keypoint detector/feature descriptors work well. A real-world test tries to detect vehicles with a distinctive logo in an outdoor environment under realistic lighting and weather conditions: a camera was mounted on a suitable location for observing the entrance to a parking area so that incoming vehicles could be monitored. In this 2 hour long recording we can successfully detect a specific company logo without false positives.
Match-bounded String Rewriting Systems
NASA Technical Reports Server (NTRS)
Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes
2003-01-01
We introduce a new class of automated proof methods for the termination of rewriting systems on strings. The basis of all these methods is to show that rewriting preserves regular languages. To this end, letters are annotated with natural numbers, called match heights. If the minimal height of all positions in a redex is h+1 then every position in the reduct will get height h+1. In a match-bounded system, match heights are globally bounded. Using recent results on deleting systems, we prove that rewriting by a match-bounded system preserves regular languages. Hence it is decidable whether a given rewriting system has a given match bound. We also provide a sufficient criterion for the abence of a match-bound. The problem of existence of a match-bound is still open. Match-boundedness for all strings can be used as an automated criterion for termination, for match-bounded systems are terminating. This criterion can be strengthened by requiring match-boundedness only for a restricted set of strings, for instance the set of right hand sides of forward closures.
Jain, Anil K; Feng, Jianjiang
2011-01-01
Latent fingerprint identification is of critical importance to law enforcement agencies in identifying suspects: Latent fingerprints are inadvertent impressions left by fingers on surfaces of objects. While tremendous progress has been made in plain and rolled fingerprint matching, latent fingerprint matching continues to be a difficult problem. Poor quality of ridge impressions, small finger area, and large nonlinear distortion are the main difficulties in latent fingerprint matching compared to plain or rolled fingerprint matching. We propose a system for matching latent fingerprints found at crime scenes to rolled fingerprints enrolled in law enforcement databases. In addition to minutiae, we also use extended features, including singularity, ridge quality map, ridge flow map, ridge wavelength map, and skeleton. We tested our system by matching 258 latents in the NIST SD27 database against a background database of 29,257 rolled fingerprints obtained by combining the NIST SD4, SD14, and SD27 databases. The minutiae-based baseline rank-1 identification rate of 34.9 percent was improved to 74 percent when extended features were used. In order to evaluate the relative importance of each extended feature, these features were incrementally used in the order of their cost in marking by latent experts. The experimental results indicate that singularity, ridge quality map, and ridge flow map are the most effective features in improving the matching accuracy.
Invariants of Boundary Link Cobordism
NASA Astrophysics Data System (ADS)
Sheiham, Desmond
2001-10-01
An n-dimensional μ-component boundary link is a codimension 2 embedding of spheres L=bigsqcup_{μ}S^n subset S^{n+2} such that there exist μ disjoint oriented embedded (n+1)-manifolds which span the components of L. An F_μ-link is a boundary link together with a cobordism class of such spanning manifolds. The F_μ-link cobordism group C_n(F_μ) is known to be trivial when n is even but not finitely generated when n is odd. Our main result is an algorithm to decide whether two odd-dimensional F_μ-links represent the same cobordism class in C_{2q-1}(F_μ) assuming q>1. We proceed to compute the isomorphism class of C_{2q-1}(F_μ), generalizing Levine's computation of the knot cobordism group C_{2q-1}(F_1). Our starting point is the algebraic formulation of Levine, Ko and Mio who identify C_{2q-1}(F_μ) with a surgery obstruction group, the Witt group G^{(-1)^q,μ}(Z) of μ-component Seifert matrices. We obtain a complete set of torsion-free invariants by passing from integer coefficients to complex coefficients and by applying the algebraic machinery of Quebbemann, Scharlau and Schulte. Signatures correspond to `algebraically integral' simple self-dual representations of a certain quiver (directed graph with loops). These representations, in turn, correspond to algebraic integers on an infinite disjoint union of real affine varieties. To distinguish torsion classes, we consider rational coefficients in place of complex coefficients, expressing G^{(-1)^q,μ}(Q) as an infinite direct sum of Witt groups of finite-dimensional division Q-algebras with involution. Numerical invariants of such Witt groups are available in the literature.
Pascual-Leone, Antonio; Bierman, Ralph; Arnold, Robert; Stasiak, Eugene
2011-05-01
A 3-year follow-up was conducted for Relating Without Violence, an emotion-focused group psychotherapy program for incarcerated men who have a history of intimate partner violence. This is the only known manualized experiential treatment for incarcerated batterers. A sample of 66 men who completed the treatment was compared to 184 men from the same prison. Although the initial research design was quasi-experimental, new procedures were used to match the groups' averages on all known pre-treatment variables. At 7 and 8 months post-release, the treatment group recidivated by assault and/or sexual assault significantly less than controls. Treatment effects are comparable to those of best practices. The study also demonstrates methodological developments for statistically creating matched groups not previously used in psychotherapy research.
A scale-invariant keypoint detector in log-polar space
NASA Astrophysics Data System (ADS)
Tao, Tao; Zhang, Yun
2017-02-01
The scale-invariant feature transform (SIFT) algorithm is devised to detect keypoints via the difference of Gaussian (DoG) images. However, the DoG data lacks the high-frequency information, which can lead to a performance drop of the algorithm. To address this issue, this paper proposes a novel log-polar feature detector (LPFD) to detect scale-invariant blubs (keypoints) in log-polar space, which, in contrast, can retain all the image information. The algorithm consists of three components, viz. keypoint detection, descriptor extraction and descriptor matching. Besides, the algorithm is evaluated in detecting keypoints from the INRIA dataset by comparing with the SIFT algorithm and one of its fast versions, the speed up robust features (SURF) algorithm in terms of three performance measures, viz. correspondences, repeatability, correct matches and matching score.
Temporal and spatial stability in translation invariant linear resistive networks.
Solak, M K
1997-01-01
Simple algebraic methods are proposed to evaluate the temporal and spatial stability of translation invariant linear resistive networks. Temporal stability is discussed for a finite number of nodes n. The proposed method evaluates stability of a Toeplitz pencil A(n)(a)+muB(n)(b) in terms of parameters a(i ) and b(i). In many cases a simple method allows one to verify positive definition of B(n)(b) in terms of b(i) only.
Contact-free palm-vein recognition based on local invariant features.
Kang, Wenxiong; Liu, Yang; Wu, Qiuxia; Yue, Xishun
2014-01-01
Contact-free palm-vein recognition is one of the most challenging and promising areas in hand biometrics. In view of the existing problems in contact-free palm-vein imaging, including projection transformation, uneven illumination and difficulty in extracting exact ROIs, this paper presents a novel recognition approach for contact-free palm-vein recognition that performs feature extraction and matching on all vein textures distributed over the palm surface, including finger veins and palm veins, to minimize the loss of feature information. First, a hierarchical enhancement algorithm, which combines a DOG filter and histogram equalization, is adopted to alleviate uneven illumination and to highlight vein textures. Second, RootSIFT, a more stable local invariant feature extraction method in comparison to SIFT, is adopted to overcome the projection transformation in contact-free mode. Subsequently, a novel hierarchical mismatching removal algorithm based on neighborhood searching and LBP histograms is adopted to improve the accuracy of feature matching. Finally, we rigorously evaluated the proposed approach using two different databases and obtained 0.996% and 3.112% Equal Error Rates (EERs), respectively, which demonstrate the effectiveness of the proposed approach.
NASA Astrophysics Data System (ADS)
Paganelli, Chiara; Peroni, Marta; Riboldi, Marco; Sharp, Gregory C.; Ciardo, Delia; Alterio, Daniela; Orecchia, Roberto; Baroni, Guido
2013-01-01
Adaptive radiation therapy (ART) aims at compensating for anatomic and pathological changes to improve delivery along a treatment fraction sequence. Current ART protocols require time-consuming manual updating of all volumes of interest on the images acquired during treatment. Deformable image registration (DIR) and contour propagation stand as a state of the ART method to automate the process, but the lack of DIR quality control methods hinder an introduction into clinical practice. We investigated the scale invariant feature transform (SIFT) method as a quantitative automated tool (1) for DIR evaluation and (2) for re-planning decision-making in the framework of ART treatments. As a preliminary test, SIFT invariance properties at shape-preserving and deformable transformations were studied on a computational phantom, granting residual matching errors below the voxel dimension. Then a clinical dataset composed of 19 head and neck ART patients was used to quantify the performance in ART treatments. For the goal (1) results demonstrated SIFT potential as an operator-independent DIR quality assessment metric. We measured DIR group systematic residual errors up to 0.66 mm against 1.35 mm provided by rigid registration. The group systematic errors of both bony and all other structures were also analyzed, attesting the presence of anatomical deformations. The correct automated identification of 18 patients who might benefit from ART out of the total 22 cases using SIFT demonstrated its capabilities toward goal (2) achievement.
ERIC Educational Resources Information Center
Brooks, Martin; And Others
1983-01-01
The Cognitive Levels Matching Project trains teachers to guide students' skill acquisition and problem-solving processes by assessing students' cognitive levels and adapting their teaching materials accordingly. (MLF)
The Green Power Partnership's Project Matching initiative works to connect green power users with new, not-yet-built renewable energy projects that may align with their energy, environmental, and financial objectives.
The molecular matching problem
NASA Technical Reports Server (NTRS)
Kincaid, Rex K.
1993-01-01
Molecular chemistry contains many difficult optimization problems that have begun to attract the attention of optimizers in the Operations Research community. Problems including protein folding, molecular conformation, molecular similarity, and molecular matching have been addressed. Minimum energy conformations for simple molecular structures such as water clusters, Lennard-Jones microclusters, and short polypeptides have dominated the literature to date. However, a variety of interesting problems exist and we focus here on a molecular structure matching (MSM) problem.
Cross-National Invariance of Children's Temperament
ERIC Educational Resources Information Center
Benson, Nicholas; Oakland, Thomas; Shermis, Mark
2009-01-01
Measurement of temperament is an important endeavor with international appeal; however, cross-national invariance (i.e., equivalence of test scores across countries as established by empirical comparisons) of temperament tests has not been established in published research. This study examines the cross-national invariance of school-aged…
Rotation-invariant of Quantum Gross Laplacian
Horrigue, Samah; Ouerdiane, Habib
2010-05-04
In this paper, we prove that the quantum Gross Laplacian denoted DELTA{sub QG} is a rotation-invariant operator. For this purpose, we use the Schwartz-Grothendieck kernel theorem and the characterization theorem of rotation-invariant distributions and operators.
Discernment of Invariants in Dynamic Geometry Environments
ERIC Educational Resources Information Center
Leung, Allen; Baccaglini-Frank, Anna; Mariotti, Maria Alessandra
2013-01-01
In this paper, we discuss discernment of invariants in dynamic geometry environments (DGE) based on a combined perspective that puts together the lens of variation and the maintaining dragging strategy developed previously by the authors. We interpret and describe a model of discerning invariants in DGE through types of variation awareness and…
Invariant Ordering of Item-Total Regressions
ERIC Educational Resources Information Center
Tijmstra, Jesper; Hessen, David J.; van der Heijden, Peter G. M.; Sijtsma, Klaas
2011-01-01
A new observable consequence of the property of invariant item ordering is presented, which holds under Mokken's double monotonicity model for dichotomous data. The observable consequence is an invariant ordering of the item-total regressions. Kendall's measure of concordance "W" and a weighted version of this measure are proposed as measures for…
Rejoinder: Continuing the Dialogue on Invariant Measurement
ERIC Educational Resources Information Center
Engelhard, George, Jr.
2008-01-01
The major purpose of my focus article was to stimulate discussion regarding the concept of invariant measurement. My intent was to provide a historical lens for considering how our views of invariant measurement have evolved over time through the work of three key measurement theorists: Guttman, Rasch, and Mokken. The commentators have offered a…
Multipartite invariant states. I. Unitary symmetry
Chruscinski, Dariusz; Kossakowski, Andrzej
2006-06-15
We propose a natural generalization of bipartite Werner and isotropic states to multipartite systems consisting of an arbitrary even number of d-dimensional subsystems (qudits). These generalized states are invariant under the action of local unitary operations. We study basic properties of multipartite invariant states and present necessary and sufficient separability criteria.
Invariance or Noninvariance, that Is the Question
ERIC Educational Resources Information Center
Widaman, Keith F.; Grimm, Kevin J.
2009-01-01
Nesselroade, Gerstorf, Hardy, and Ram developed a new and interesting way to enforce invariance at the second-order level in P-technique models, while allowing first-order structure to stray from invariance. We discuss our concerns with this approach under the headings of falsifiability, the nature of manifest variables included in models, and…
NASA Astrophysics Data System (ADS)
Patil, Sandeep Baburao; Sinha, G. R.
2016-07-01
India, having less awareness towards the deaf and dumb peoples leads to increase the communication gap between deaf and hard hearing community. Sign language is commonly developed for deaf and hard hearing peoples to convey their message by generating the different sign pattern. The scale invariant feature transform was introduced by David Lowe to perform reliable matching between different images of the same object. This paper implements the various phases of scale invariant feature transform to extract the distinctive features from Indian sign language gestures. The experimental result shows the time constraint for each phase and the number of features extracted for 26 ISL gestures.
NASA Astrophysics Data System (ADS)
Patil, Sandeep Baburao; Sinha, G. R.
2017-02-01
India, having less awareness towards the deaf and dumb peoples leads to increase the communication gap between deaf and hard hearing community. Sign language is commonly developed for deaf and hard hearing peoples to convey their message by generating the different sign pattern. The scale invariant feature transform was introduced by David Lowe to perform reliable matching between different images of the same object. This paper implements the various phases of scale invariant feature transform to extract the distinctive features from Indian sign language gestures. The experimental result shows the time constraint for each phase and the number of features extracted for 26 ISL gestures.
2013-08-01
ΩL and ΩR and use the manufactured solution given by (4.1). The grid for the forward problem is 20 × 20 next to 32×32. The adjoint grid is 80×80 next...for Case 1. The forward grid is 20 × 20 next to 32×32. The adjoint grid is 80×80 next to 128×128. term MFE GFV (linear) GFV (constant) 1 (RuL ,φ h L−Π...with non-matching grids by T. Arbogast, D. Estep, B. Sheehan, and S. Tavener The Institute for Computational Engineering and Sciences The University
A free interactive matching program
J.-F. Ostiguy
1999-04-16
For physicists and engineers involved in the design and analysis of beamlines (transfer lines or insertions) the lattice function matching problem is central and can be time-consuming because it involves constrained nonlinear optimization. For such problems convergence can be difficult to obtain in general without expert human intervention. Over the years, powerful codes have been developed to assist beamline designers. The canonical example is MAD (Methodical Accelerator Design) developed at CERN by Christophe Iselin. MAD, through a specialized command language, allows one to solve a wide variety of problems, including matching problems. Although in principle, the MAD command interpreter can be run interactively, in practice the solution of a matching problem involves a sequence of independent trial runs. Unfortunately, but perhaps not surprisingly, there still exists relatively few tools exploiting the resources offered by modern environments to assist lattice designer with this routine and repetitive task. In this paper, we describe a fully interactive lattice matching program, written in C++ and assembled using freely available software components. An important feature of the code is that the evolution of the lattice functions during the nonlinear iterative process can be graphically monitored in real time; the user can dynamically interrupt the iterations at will to introduce new variables, freeze existing ones into their current state and/or modify constraints. The program runs under both UNIX and Windows NT.
An Efficient Wide-Baseline Dense Matching Descriptor
NASA Astrophysics Data System (ADS)
Wan, Yanli; Miao, Zhenjiang; Tang, Zhen; Wan, Lili; Wang, Zhe
This letter proposes an efficient local descriptor for wide-baseline dense matching. It improves the existing Daisy descriptor by combining intensity-based Haar wavelet response with a new color-based ratio model. The color ratio model is invariant to changes of viewing direction, object geometry, and the direction, intensity and spectral power distribution of the illumination. The experiments show that our descriptor has high discriminative power and robustness.
South Pole Lorentz Invariance Test
NASA Astrophysics Data System (ADS)
Hedges, Morgan; Smiciklas, Marc; Romalis, Michael
2015-05-01
Searches for Lorentz and CPT violation play an important role in testing current theories of space-time. To test one of the consequences of local Lorentz invariance we have performed a precision test of spatial isotropy at the Amundsen-Scott station near the geographic South Pole. This location provides the most isotropic environment available on Earth. The experiment is a rotating atomic-spin co-magnetometer which compares energy levels of 21Ne and Rubidium atoms as a function of direction. The experimental sensitivity obtained is more than an order of magnitude better than in previous such measurements, known as Hughes-Drever experiments. By operating the experiment at the Pole we are able to eliminate background signals due to the gyroscopic interactions of spins with Earth's rotation as well as diurnal environmental effects. Here we will present final results from the experiment's 2-year data collection period. This is the first precision atomic physics experiment performed at the Pole, and we will discuss the potential for future such measurements.
South Pole Lorentz Invariance Test
NASA Astrophysics Data System (ADS)
Hedges, Morgan; Smiciklas, Marc; Romalis, Michael
2015-04-01
Tests of Lorentz and CPT symmetries are important because they form a cornerstone of quantum field theory and general relativity. To test one of the consequences of local Lorentz invariance we have performed a precision test of spatial isotropy at the Amundsen-Scott station near the geographic South Pole. This location provides the most isotropic environment available on Earth. We use an atomic spin co-magnetometer to compare energy levels in 21 Ne and Rubidium atoms as the apparatus rotates with respect to the cosmos. Our experimental sensitivity is more than an order of magnitude greater than in previous such measurements, known as Hughes-Drever experiments. By operating at the South Pole we eliminate background signals due to the gyroscopic interactions of spins with Earth's rotation as well as diurnal environmental effects. The experiment has finished a 2-year data collection period and we expect to present the final results at the meeting. This is the first precision atomic physics experiment performed at the Pole and we will discuss the potential for future such measurements.
Invariance of Conjunctions of Polynomial Equalities for Algebraic Differential Equations
2014-07-01
non- linear hybrid systems by linear algebraic methods. In Radhia Cousot and Matthieu Martel, editors, SAS, volume 6337 of LNCS, pages 373–389. Springer...Tarski. A decision method for elementary algebra and geometry. Bulletin of the American Mathematical Society, 59, 1951. [36] Wolfgang Walter. Ordinary...Invariance of Conjunctions of Polynomial Equalities for Algebraic Differential Equations Khalil Ghorbal1 Andrew Sogokon2 André Platzer1 July 2014
Knot invariants from Virasoro related representation and pretzel knots
NASA Astrophysics Data System (ADS)
Galakhov, D.; Melnikov, D.; Mironov, A.; Morozov, A.
2015-10-01
We remind the method to calculate colored Jones polynomials for the plat representations of knot diagrams from the knowledge of modular transformation (monodromies) of Virasoro conformal blocks with insertions of degenerate fields. As an illustration we use a rich family of pretzel knots, lying on a surface of arbitrary genus g, which was recently analyzed by the evolution method. Further generalizations can be to generic Virasoro modular transformations, provided by integral kernels, which can lead to the Hikami invariants.
Visual tracking and localization of billboards in streamed soccer matches
NASA Astrophysics Data System (ADS)
Aldershoff, Frank; Gevers, Theo
2003-12-01
In this paper we present a system for the localisation and tracking of billboards in streamed soccer matches. The application area for this research is the delivery of customised content to end users. When international soccer matches are broadcast, the diversity of the audience is very large and advertisers would like to be able to adapt the billboards to the different audiences. By replacing the billboards in the video stream this can be achieved. In order to build a more robust system, photometric invariant features are used. These colour features are less susceptible to the changes in illumination. Sensor noise is dealt with through variable kernel density estimation.
2014-01-01
Background Measures of similarity for chemical molecules have been developed since the dawn of chemoinformatics. Molecular similarity has been measured by a variety of methods including molecular descriptor based similarity, common molecular fragments, graph matching and 3D methods such as shape matching. Similarity measures are widespread in practice and have proven to be useful in drug discovery. Because of our interest in electrostatics and high throughput ligand-based virtual screening, we sought to exploit the information contained in atomic coordinates and partial charges of a molecule. Results A new molecular descriptor based on partial charges is proposed. It uses the autocorrelation function and linear binning to encode all atoms of a molecule into two rotation-translation invariant vectors. Combined with a scoring function, the descriptor allows to rank-order a database of compounds versus a query molecule. The proposed implementation is called ACPC (AutoCorrelation of Partial Charges) and released in open source. Extensive retrospective ligand-based virtual screening experiments were performed and other methods were compared with in order to validate the method and associated protocol. Conclusions While it is a simple method, it performed remarkably well in experiments. At an average speed of 1649 molecules per second, it reached an average median area under the curve of 0.81 on 40 different targets; hence validating the proposed protocol and implementation. PMID:24887178
Multiple objects tracking with HOGs matching in circular windows
NASA Astrophysics Data System (ADS)
Miramontes-Jaramillo, Daniel; Kober, Vitaly; Díaz-Ramírez, Víctor H.
2014-09-01
In recent years tracking applications with development of new technologies like smart TVs, Kinect, Google Glass and Oculus Rift become very important. When tracking uses a matching algorithm, a good prediction algorithm is required to reduce the search area for each object to be tracked as well as processing time. In this work, we analyze the performance of different tracking algorithms based on prediction and matching for a real-time tracking multiple objects. The used matching algorithm utilizes histograms of oriented gradients. It carries out matching in circular windows, and possesses rotation invariance and tolerance to viewpoint and scale changes. The proposed algorithm is implemented in a personal computer with GPU, and its performance is analyzed in terms of processing time in real scenarios. Such implementation takes advantage of current technologies and helps to process video sequences in real-time for tracking several objects at the same time.
An invariant shape representation using the anisotropic Helmholtz equation.
Joshi, A A; Ashrafulla, S; Shattuck, D W; Damasio, H; Leahy, R M
2012-01-01
Analyzing geometry of sulcal curves on the human cortical surface requires a shape representation invariant to Euclidean motion. We present a novel shape representation that characterizes the shape of a curve in terms of a coordinate system based on the eigensystem of the anisotropic Helmholtz equation. This representation has many desirable properties: stability, uniqueness and invariance to scaling and isometric transformation. Under this representation, we can find a point-wise shape distance between curves as well as a bijective smooth point-to-point correspondence. When the curves are sampled irregularly, we also present a fast and accurate computational method for solving the eigensystem using a finite element formulation. This shape representation is used to find symmetries between corresponding sulcal shapes between cortical hemispheres. For this purpose, we automatically generate 26 sulcal curves for 24 subject brains and then compute their invariant shape representation. Left-right sulcal shape symmetry as measured by the shape representation's metric demonstrates the utility of the presented invariant representation for shape analysis of the cortical folding pattern.
A simple representation of energy matrix elements in terms of symmetry-invariant bases.
Cui, Peng; Wu, Jian; Zhang, Guiqing; Boyd, Russell J
2010-02-01
When a system under consideration has some symmetry, usually its Hamiltonian space can be parallel partitioned into a set of subspaces, which is invariant under symmetry operations. The bases that span these invariant subspaces are also invariant under the symmetry operations, and they are the symmetry-invariant bases. A standard methodology is available to construct a series of generator functions (GFs) and corresponding symmetry-adapted basis (SAB) functions from these symmetry-invariant bases. Elements of the factorized Hamiltonian and overlap matrix can be expressed in terms of these SAB functions, and their simple representations can be deduced in terms of GFs. The application of this method to the Heisenberg spin Hamiltonian is demonstrated.
Invariant variational structures on fibered manifolds
NASA Astrophysics Data System (ADS)
Krupka, Demeter
2015-12-01
The aim of this paper is to present a relatively complete theory of invariance of global, higher-order integral variational functionals in fibered spaces, as developed during a few past decades. We unify and extend recent results of the geometric invariance theory; new results on deformations of extremals are also included. We show that the theory can be developed by means of the general concept of invariance of a differential form in geometry, which does not require different ad hoc modifications. The concept applies to invariance of Lagrangians, source forms and Euler-Lagrange forms, as well as to extremals of the given variational functional. Equations for generators of invariance transformations of the Lagrangians and the Euler-Lagrange forms are characterized in terms of Lie derivatives. As a consequence of invariance, we derive the global Noether's theorem on existence of conserved currents along extremals, and discuss the meaning of conservation equations. We prove a theorem describing extremals, whose deformations by a vector field are again extremals. The general settings and structures we use admit extension of the global invariance theory to variational principles in physics, especially in field theory.
Feedback-Driven Dynamic Invariant Discovery
NASA Technical Reports Server (NTRS)
Zhang, Lingming; Yang, Guowei; Rungta, Neha S.; Person, Suzette; Khurshid, Sarfraz
2014-01-01
Program invariants can help software developers identify program properties that must be preserved as the software evolves, however, formulating correct invariants can be challenging. In this work, we introduce iDiscovery, a technique which leverages symbolic execution to improve the quality of dynamically discovered invariants computed by Daikon. Candidate invariants generated by Daikon are synthesized into assertions and instrumented onto the program. The instrumented code is executed symbolically to generate new test cases that are fed back to Daikon to help further re ne the set of candidate invariants. This feedback loop is executed until a x-point is reached. To mitigate the cost of symbolic execution, we present optimizations to prune the symbolic state space and to reduce the complexity of the generated path conditions. We also leverage recent advances in constraint solution reuse techniques to avoid computing results for the same constraints across iterations. Experimental results show that iDiscovery converges to a set of higher quality invariants compared to the initial set of candidate invariants in a small number of iterations.
Small gain stability theory for matched basis function repetitive control
NASA Astrophysics Data System (ADS)
Shi, Yunde; Longman, Richard W.; Nagashima, Masaki
2014-02-01
Many spacecraft suffer from jitter produced by periodic vibration sources such as momentum wheels, reaction wheels, or control moment gyros. Vibration isolation mounts are needed for fine pointing equipment. Active control methods directly addressing frequencies of interest have the potential to completely cancel the influence of these disturbances. Typical repetitive control methods initially address all frequencies of a given period. Matched basis function repetitive control individually addresses each frequency, finding error components at these frequencies using the projection algorithm, and can converge to zero error, using only frequency response knowledge at addressed frequencies. This results in linear control laws but with periodic coefficients. Frequency domain raising produces a time invariant pole/zero model of the control law. A small gain stability theory is developed, that exhibits very strong stability robustness properties to model error. For convergence to zero tracking error it needs only knowledge of the phase response at addressed frequencies, and it must be known within an accuracy of ±90°. Controllers are then designed by pole-zero placement, bypassing the complexity of original periodic coefficient equations. Compared to the usual repetitive control approaches, the approach here eliminates the need for a robustifying zero phase low pass filter, eliminates the need for interpolation in data, and handles multiple unrelated frequencies easily and naturally.
Chen, Haibin; Zhong, Zichun; Liao, Yuliang; Pompoš, Arnold; Hrycushko, Brian; Albuquerque, Kevin; Zhen, Xin; Zhou, Linghong; Gu, Xuejun
2016-02-07
GEC-ESTRO guidelines for high dose rate cervical brachytherapy advocate the reporting of the D2cc (the minimum dose received by the maximally exposed 2cc volume) to organs at risk. Due to large interfractional organ motion, reporting of accurate cumulative D2cc over a multifractional course is a non-trivial task requiring deformable image registration and deformable dose summation. To efficiently and accurately describe the point-to-point correspondence of the bladder wall over all treatment fractions while preserving local topologies, we propose a novel graphic processing unit (GPU)-based non-rigid point matching algorithm. This is achieved by introducing local anatomic information into the iterative update of correspondence matrix computation in the 'thin plate splines-robust point matching' (TPS-RPM) scheme. The performance of the GPU-based TPS-RPM with local topology preservation algorithm (TPS-RPM-LTP) was evaluated using four numerically simulated synthetic bladders having known deformations, a custom-made porcine bladder phantom embedded with twenty one fiducial markers, and 29 fractional computed tomography (CT) images from seven cervical cancer patients. Results show that TPS-RPM-LTP achieved excellent geometric accuracy with landmark residual distance error (RDE) of 0.7 ± 0.3 mm for the numerical synthetic data with different scales of bladder deformation and structure complexity, and 3.7 ± 1.8 mm and 1.6 ± 0.8 mm for the porcine bladder phantom with large and small deformation, respectively. The RDE accuracy of the urethral orifice landmarks in patient bladders was 3.7 ± 2.1 mm. When compared to the original TPS-RPM, the TPS-RPM-LTP improved landmark matching by reducing landmark RDE by 50 ± 19%, 37 ± 11% and 28 ± 11% for the synthetic, porcine phantom and the patient bladders, respectively. This was achieved with a computational time of less than 15 s in all cases
Heyman, Gene M.; Grisanzio, Katherine A.; Liang, Victor
2016-01-01
We tested whether principles that describe the allocation of overt behavior, as in choice experiments, also describe the allocation of cognition, as in attention experiments. Our procedure is a cognitive version of the “two-armed bandit choice procedure.” The two-armed bandit procedure has been of interest to psychologistsand economists because it tends to support patterns of responding that are suboptimal. Each of two alternatives provides rewards according to fixed probabilities. The optimal solution is to choose the alternative with the higher probability of reward on each trial. However, subjects often allocate responses so that the probability of a response approximates its probability of reward. Although it is this result which has attracted most interest, probability matching is not always observed. As a function of monetary incentives, practice, and individual differences, subjects tend to deviate from probability matching toward exclusive preference, as predicted by maximizing. In our version of the two-armed bandit procedure, the monitor briefly displayed two, small adjacent stimuli that predicted correct responses according to fixed probabilities, as in a two-armed bandit procedure. We show that in this setting, a simple linear equation describes the relationship between attention and correct responses, and that the equation’s solution is the allocation of attention between the two stimuli. The calculations showed that attention allocation varied as a function of the degree to which the stimuli predicted correct responses. Linear regression revealed a strong correlation (r = 0.99) between the predictiveness of a stimulus and the probability of attending to it. Nevertheless there were deviations from probability matching, and although small, they were systematic and statistically significant. As in choice studies, attention allocation deviated toward maximizing as a function of practice, feedback, and incentives. Our approach also predicts the
Neural networks for data compression and invariant image recognition
NASA Technical Reports Server (NTRS)
Gardner, Sheldon
1989-01-01
An approach to invariant image recognition (I2R), based upon a model of biological vision in the mammalian visual system (MVS), is described. The complete I2R model incorporates several biologically inspired features: exponential mapping of retinal images, Gabor spatial filtering, and a neural network associative memory. In the I2R model, exponentially mapped retinal images are filtered by a hierarchical set of Gabor spatial filters (GSF) which provide compression of the information contained within a pixel-based image. A neural network associative memory (AM) is used to process the GSF coded images. We describe a 1-D shape function method for coding of scale and rotationally invariant shape information. This method reduces image shape information to a periodic waveform suitable for coding as an input vector to a neural network AM. The shape function method is suitable for near term applications on conventional computing architectures equipped with VLSI FFT chips to provide a rapid image search capability.
Matching by linear programming and successive convexification.
Jiang, Hao; Drew, Mark S; Li, Ze-Nian
2007-06-01
We present a novel convex programming scheme to solve matching problems, focusing on the challenging problem of matching in a large search range and with cluttered background. Matching is formulated as metric labeling with L1 regularization terms, for which we propose a novel linear programming relaxation method and an efficient successive convexification implementation. The unique feature of the proposed relaxation scheme is that a much smaller set of basis labels is used to represent the original label space. This greatly reduces the size of the searching space. A successive convexification scheme solves the labeling problem in a coarse to fine manner. Importantly, the original cost function is reconvexified at each stage, in the new focus region only, and the focus region is updated so as to refine the searching result. This makes the method well-suited for large label set matching. Experiments demonstrate successful applications of the proposed matching scheme in object detection, motion estimation, and tracking.
Left ventricle segmentation in MRI via convex relaxed distribution matching.
Nambakhsh, Cyrus M S; Yuan, Jing; Punithakumar, Kumaradevan; Goela, Aashish; Rajchl, Martin; Peters, Terry M; Ayed, Ismail Ben
2013-12-01
A fundamental step in the diagnosis of cardiovascular diseases, automatic left ventricle (LV) segmentation in cardiac magnetic resonance images (MRIs) is still acknowledged to be a difficult problem. Most of the existing algorithms require either extensive training or intensive user inputs. This study investigates fast detection of the left ventricle (LV) endo- and epicardium surfaces in cardiac MRI via convex relaxation and distribution matching. The algorithm requires a single subject for training and a very simple user input, which amounts to a single point (mouse click) per target region (cavity or myocardium). It seeks cavity and myocardium regions within each 3D phase by optimizing two functionals, each containing two distribution-matching constraints: (1) a distance-based shape prior and (2) an intensity prior. Based on a global measure of similarity between distributions, the shape prior is intrinsically invariant with respect to translation and rotation. We further introduce a scale variable from which we derive a fixed-point equation (FPE), thereby achieving scale-invariance with only few fast computations. The proposed algorithm relaxes the need for costly pose estimation (or registration) procedures and large training sets, and can tolerate shape deformations, unlike template (or atlas) based priors. Our formulation leads to a challenging problem, which is not directly amenable to convex-optimization techniques. For each functional, we split the problem into a sequence of sub-problems, each of which can be solved exactly and globally via a convex relaxation and the augmented Lagrangian method. Unlike related graph-cut approaches, the proposed convex-relaxation solution can be parallelized to reduce substantially the computational time for 3D domains (or higher), extends directly to high dimensions, and does not have the grid-bias problem. Our parallelized implementation on a graphics processing unit (GPU) demonstrates that the proposed algorithm
Fast image matching algorithm based on projection characteristics
NASA Astrophysics Data System (ADS)
Zhou, Lijuan; Yue, Xiaobo; Zhou, Lijun
2011-06-01
Based on analyzing the traditional template matching algorithm, this paper identified the key factors restricting the speed of matching and put forward a brand new fast matching algorithm based on projection. Projecting the grayscale image, this algorithm converts the two-dimensional information of the image into one-dimensional one, and then matches and identifies through one-dimensional correlation, meanwhile, because of normalization has been done, when the image brightness or signal amplitude increasing in proportion, it could also perform correct matching. Experimental results show that the projection characteristics based image registration method proposed in this article could greatly improve the matching speed, which ensuring the matching accuracy as well.
Gallistel, C R; King, Adam Philip; Gottlieb, Daniel; Balci, Fuat; Papachristos, Efstathios B; Szalecki, Matthew; Carbone, Kimberly S
2007-03-01
Experimentally naive mice matched the proportions of their temporal investments (visit durations) in two feeding hoppers to the proportions of the food income (pellets per unit session time) derived from them in three experiments that varied the coupling between the behavioral investment and food income, from no coupling to strict coupling. Matching was observed from the outset; it did not improve with training. When the numbers of pellets received were proportional to time invested, investment was unstable, swinging abruptly from sustained, almost complete investment in one hopper, to sustained, almost complete investment in the other-in the absence of appropriate local fluctuations in returns (pellets obtained per time invested). The abruptness of the swings strongly constrains possible models. We suggest that matching reflects an innate (unconditioned) program that matches the ratio of expected visit durations to the ratio between the current estimates of expected incomes. A model that processes the income stream looking for changes in the income and generates discontinuous income estimates when a change is detected is shown to account for salient features of the data.
ERIC Educational Resources Information Center
Gallistel, C. R.; King, Adam Philip; Gottlieb, Daniel; Balci, Fuat; Papachristos, Efstathios B.; Szalecki, Matthew; Carbone, Kimberly S.
2007-01-01
Experimentally naive mice matched the proportions of their temporal investments (visit durations) in two feeding hoppers to the proportions of the food income (pellets per unit session time) derived from them in three experiments that varied the coupling between the behavioral investment and food income, from no coupling to strict coupling.…
ERIC Educational Resources Information Center
Herrnstein, R. J.
1979-01-01
The matching law for reinforced behavior solves a differential equation relating infinitesimal changes in behavior to infinitesimal changes in reinforcement. The equation expresses plausible conceptions of behavior and reinforcement, yields a simple nonlinear operator model for acquisition, and suggests a alternative to the economic law of…
NASA Astrophysics Data System (ADS)
Wang, Yu; Zhao, Yongsheng; Chen, Yi
2014-12-01
More and more attention has been paid to the invariant texture analysis, because the training and testing samples generally have not identical or similar orientations, or are not acquired from the same viewpoint in many practical applications, which often has negative influences on texture analysis. Local binary pattern (LBP) has been widely applied to texture classification due to its simplicity, efficiency, and rotation invariant property. In this paper, an integrated local binary pattern (ILBP) scheme including original rotation invariant LBP, improved contrast rotation invariant LBP, and direction rotation invariant LBP is proposed which can effectively overcome the deficiency of original LBP that is ignoring contrast and direction information. In addition, for surmounting another major drawback of LBP such as locality which can result in the lack of shape and space expression of the holistic texture image, Zernike moment features are fused into the improved LBP texture features in the proposed method because they comprise orthogonal and rotation invariant property and can be easily and rapidly calculated to an arbitrary high order. Experimental results show that the proposed method can be remarkably superior to the other state-of-the-art methods when rotation invariant texture features are extracted and classified.
Convecting reference frames and invariant numerical models
NASA Astrophysics Data System (ADS)
Bihlo, Alexander; Nave, Jean-Christophe
2014-09-01
In the recent paper by Bernardini et al. [1] the discrepancy in the performance of finite difference and spectral models for simulations of flows with a preferential direction of propagation was studied. In a simplified investigation carried out using the viscous Burgers equation the authors attributed the poorer numerical results of finite difference models to a violation of Galilean invariance in the discretization and propose to carry out the computations in a reference frame moving with the bulk velocity of the flow. Here we further discuss this problem and relate it to known results on invariant discretization schemes. Non-invariant and invariant finite difference discretizations of Burgers equation are proposed and compared with the discretization using the remedy proposed by Bernardini et al.
Invariance in the isoheptanes of petroleum
Mango, F.D.
1987-07-31
Four isoheptanes in petroleum display a remarkable invariance in a ratio of sums of concentrations. The isoheptanes are not at thermodynamic equilibrium, nor are they fixed to some constant composition. The four isomers display coherent change in relative amounts but maintain invariance in the ratio of sums. Within sets of genetically related petroleum samples, invariance reaches levels that approach the limits of their analytical precision. The invariance is inconsistent with a chemical origin that involves the thermal fragmentation of natural products or their derivatives. It suggests a reaction process at steady state, in which relative rates of product formation are constant. A mechanism is proposed in which the four isoheptanes are formed pairwise and sequentially through two intermediates in a catalytic process that operates at steady state. 13 references, 3 figures, 1 table.
Testing Lorentz invariance of dark matter
Blas, Diego; Ivanov, Mikhail M.; Sibiryakov, Sergey E-mail: mm.ivanov@physics.msu.ru
2012-10-01
We study the possibility to constrain deviations from Lorentz invariance in dark matter (DM) with cosmological observations. Breaking of Lorentz invariance generically introduces new light gravitational degrees of freedom, which we represent through a dynamical timelike vector field. If DM does not obey Lorentz invariance, it couples to this vector field. We find that this coupling affects the inertial mass of small DM halos which no longer satisfy the equivalence principle. For large enough lumps of DM we identify a (chameleon) mechanism that restores the inertial mass to its standard value. As a consequence, the dynamics of gravitational clustering are modified. Two prominent effects are a scale dependent enhancement in the growth of large scale structure and a scale dependent bias between DM and baryon density perturbations. The comparison with the measured linear matter power spectrum in principle allows to bound the departure from Lorentz invariance of DM at the per cent level.
ConfMatch: automating electron-density map interpretation by matching conformations.
Wang, C E
2000-12-01
Building a protein model from the initial three-dimensional electron-density distribution (density map) is an important task in X-ray crystallography. This problem is computationally challenging because proteins are extremely flexible. The algorithm ConfMatch is a global real-space fitting procedure in torsion-angle space. It solves this 'map-interpretation' problem by matching a detailed conformation of the molecule to the density map (conformational matching). This 'best-match' structure is defined as one which maximizes the sum of the density at atom positions. ConfMatch is a practical systematic algorithm based on a branch-and-bound search. The most important idea of ConfMatch is an efficient method for computing accurate bounds. ConfMatch relaxes the conformational matching problem, a problem which can only be solved in exponential time, into one which can be solved in polynomial time. The solution to the relaxed problem is a guaranteed upper bound for the conformational matching problem. In most empirical cases, these bounds are accurate enough to prune the search space dramatically, enabling ConfMatch to solve structures with more than 100 free dihedral angles. Experiments have shown that ConfMatch may be able to automate the interpretation of density maps of small proteins.
Phasing macromolecular structures via structure-invariant algebra.
Hauptman, H; Han, F
1993-01-01
Owing to the breakdown of Friedel's law when anomalous scatterers are present, unique values of the three-phase structure invariants in the whole range from 0 to 2pi are determined by measured values of diffraction intensities alone. Two methods are described for going from presumed known values of these invariants to the values of the individual phases. The first, dependent on a scheme for resolving the 2pi ambiguity in the estimate omega(HK) of the triplet phi(H) + phi(K) + phi(-H-K), solves by least squares the resulting redundant system of linear equations phi(H) + phi(K) + phi(-H-K) = omega(HK). The second attempts to minimize the weighted sum of squares of differences between the true values of the cosine and sine invariants and their estimates. The latter method is closely related to one based on the 'minimal principle' which determines the values of a large set of phases as the constrained global minimum of a function of all the phases in the set. Both methods work in the sense that they yield values of the individual phases substantially better than the values of the initial estimates of the triplets. However, the second method proves to be superior to the first but requires, in addition to estimates of the triplets, initial estimates of the values of the individual phases.
NASA Astrophysics Data System (ADS)
Chen, Haibin; Zhong, Zichun; Liao, Yuliang; Pompoš, Arnold; Hrycushko, Brian; Albuquerque, Kevin; Zhen, Xin; Zhou, Linghong; Gu, Xuejun
2016-02-01
GEC-ESTRO guidelines for high dose rate cervical brachytherapy advocate the reporting of the D2cc (the minimum dose received by the maximally exposed 2cc volume) to organs at risk. Due to large interfractional organ motion, reporting of accurate cumulative D2cc over a multifractional course is a non-trivial task requiring deformable image registration and deformable dose summation. To efficiently and accurately describe the point-to-point correspondence of the bladder wall over all treatment fractions while preserving local topologies, we propose a novel graphic processing unit (GPU)-based non-rigid point matching algorithm. This is achieved by introducing local anatomic information into the iterative update of correspondence matrix computation in the ‘thin plate splines-robust point matching’ (TPS-RPM) scheme. The performance of the GPU-based TPS-RPM with local topology preservation algorithm (TPS-RPM-LTP) was evaluated using four numerically simulated synthetic bladders having known deformations, a custom-made porcine bladder phantom embedded with twenty one fiducial markers, and 29 fractional computed tomography (CT) images from seven cervical cancer patients. Results show that TPS-RPM-LTP achieved excellent geometric accuracy with landmark residual distance error (RDE) of 0.7 ± 0.3 mm for the numerical synthetic data with different scales of bladder deformation and structure complexity, and 3.7 ± 1.8 mm and 1.6 ± 0.8 mm for the porcine bladder phantom with large and small deformation, respectively. The RDE accuracy of the urethral orifice landmarks in patient bladders was 3.7 ± 2.1 mm. When compared to the original TPS-RPM, the TPS-RPM-LTP improved landmark matching by reducing landmark RDE by 50 ± 19%, 37 ± 11% and 28 ± 11% for the synthetic, porcine phantom and the patient bladders, respectively. This was achieved with a computational time of less than 15 s in all cases
Recognizing 3D Object Using Photometric Invariant.
1995-02-01
model and the data space coordinates, using centroid invariance of corresponding groups of feature positions. Tests are given to show the stability and...positions in the model and the data space coordinates, using centroid invariance of corresponding groups of feature positions. Tests are given to show the...ognizing 3D objects. In our testing , it took only 0.2 seconds to derive corresponding positions in the model and the image for natural pictures. 2
'Breaking' position-invariant object recognition.
Cox, David D; Meier, Philip; Oertelt, Nadja; DiCarlo, James J
2005-09-01
While it is often assumed that objects can be recognized irrespective of where they fall on the retina, little is known about the mechanisms underlying this ability. By exposing human subjects to an altered world where some objects systematically changed identity during the transient blindness that accompanies eye movements, we induced predictable object confusions across retinal positions, effectively 'breaking' position invariance. Thus, position invariance is not a rigid property of vision but is constantly adapting to the statistics of the environment.
Invariant distributions on compact homogeneous spaces
Gorbatsevich, V V
2013-12-31
In this paper, we study distributions on compact homogeneous spaces, including invariant distributions and also distributions admitting a sub-Riemannian structure. We first consider distributions of dimension 1 and 2 on compact homogeneous spaces. After this, we study the cases of compact homogeneous spaces of dimension 2, 3, and 4 in detail. Invariant distributions on simply connected compact homogeneous spaces are also treated. Bibliography: 18 titles.
Invariants of Fokker-Planck equations
NASA Astrophysics Data System (ADS)
Abe, Sumiyoshi
2017-02-01
A weak invariant of a stochastic system is defined in such a way that its expectation value with respect to the distribution function as a solution of the associated Fokker-Planck equation is constant in time. A general formula is given for time evolution of the fluctuations of the invariant. An application to the problem of share price in finance is illustrated. It is shown how this theory makes it possible to reduce the growth rate of the fluctuations.
Computer calculation of Witten's 3-manifold invariant
NASA Astrophysics Data System (ADS)
Freed, Daniel S.; Gompf, Robert E.
1991-10-01
Witten's 2+1 dimensional Chern-Simons theory is exactly solvable. We compute the partition function, a topological invariant of 3-manifolds, on generalized Seifert spaces. Thus we test the path integral using the theory of 3-manifolds. In particular, we compare the exact solution with the asymptotic formula predicted by perturbation theory. We conclude that this path integral works as advertised and gives an effective topological invariant.
MEG source localization using invariance of noise space.
Zhang, Junpeng; Raij, Tommi; Hämäläinen, Matti; Yao, Dezhong
2013-01-01
We propose INvariance of Noise (INN) space as a novel method for source localization of magnetoencephalography (MEG) data. The method is based on the fact that modulations of source strengths across time change the energy in signal subspace but leave the noise subspace invariant. We compare INN with classical MUSIC, RAP-MUSIC, and beamformer approaches using simulated data while varying signal-to-noise ratios as well as distance and temporal correlation between two sources. We also demonstrate the utility of INN with actual auditory evoked MEG responses in eight subjects. In all cases, INN performed well, especially when the sources were closely spaced, highly correlated, or one source was considerably stronger than the other.
NASA Technical Reports Server (NTRS)
LeMoigne, Jacqueline; Zavorine, Ilya
1999-01-01
A wavelet-based image registration approach has previously been proposed by the authors. In this work, wavelet coefficient maxima obtained from an orthogonal wavelet decomposition using Daubechies filters were utilized to register images in a multi-resolution fashion. Tested on several remote sensing datasets, this method gave very encouraging results. Despite the lack of translation-invariance of these filters, we showed that when using cross-correlation as a feature matching technique, features of size larger than twice the size of the filters are correctly registered by using the low-frequency subbands of the Daubechies wavelet decomposition. Nevertheless, high-frequency subbands are still sensitive to translation effects. In this work, we are considering a rotation- and translation-invariant representation developed by E. Simoncelli and integrate it in our image registration scheme. The two types of filters, Daubechies and Simoncelli filters, are then being compared from a registration point of view, utilizing synthetic data as well as data from the Landsat/ Thematic Mapper (TM) and from the NOAA Advanced Very High Resolution Radiometer (AVHRR).
NASA Technical Reports Server (NTRS)
LeMoigne, Jacqueline; Zavorine, Ilya
1999-01-01
A wavelet-based image registration approach has previously been proposed by the authors. In this work, wavelet coefficient maxima obtained from an orthogonal wavelet decomposition using Daubechies filters were utilized to register images in a multi-resolution fashion. Tested on several remote sensing datasets, this method gave very encouraging results. Despite the lack of translation-invariance of these filters, we showed that when using cross-correlation as a feature matching technique, features of size larger than twice the size of the filters are correctly registered by using the low-frequency subbands of the Daubechies wavelet decomposition. Nevertheless, high-frequency subbands are still sensitive to translation effects. In this work, we are considering a rotation- and translation-invariant representation developed by E. Simoncelli and integrate it in our image registration scheme. The two types of filters, Daubechies and Simoncelli filters, are then being compared from a registration point of view, utilizing synthetic data as well as data from the Landsat/ Thematic Mapper (TM) and from the NOAA Advanced Very High Resolution Radiometer (AVHRR).
Altered Perceptual Sensitivity to Kinematic Invariants in Parkinson's Disease
Dayan, Eran; Inzelberg, Rivka; Flash, Tamar
2012-01-01
Ample evidence exists for coupling between action and perception in neurologically healthy individuals, yet the precise nature of the internal representations shared between these domains remains unclear. One experimentally derived view is that the invariant properties and constraints characterizing movement generation are also manifested during motion perception. One prominent motor invariant is the “two-third power law,” describing the strong relation between the kinematics of motion and the geometrical features of the path followed by the hand during planar drawing movements. The two-thirds power law not only characterizes various movement generation tasks but also seems to constrain visual perception of motion. The present study aimed to assess whether motor invariants, such as the two thirds power law also constrain motion perception in patients with Parkinson's disease (PD). Patients with PD and age-matched controls were asked to observe the movement of a light spot rotating on an elliptical path and to modify its velocity until it appeared to move most uniformly. As in previous reports controls tended to choose those movements close to obeying the two-thirds power law as most uniform. Patients with PD displayed a more variable behavior, choosing on average, movements closer but not equal to a constant velocity. Our results thus demonstrate impairments in how the two-thirds power law constrains motion perception in patients with PD, where this relationship between velocity and curvature appears to be preserved but scaled down. Recent hypotheses on the role of the basal ganglia in motor timing may explain these irregularities. Alternatively, these impairments in perception of movement may reflect similar deficits in motor production. PMID:22363430
The invariances of power law size distributions.
Frank, Steven A
2016-01-01
Size varies. Small things are typically more frequent than large things. The logarithm of frequency often declines linearly with the logarithm of size. That power law relation forms one of the common patterns of nature. Why does the complexity of nature reduce to such a simple pattern? Why do things as different as tree size and enzyme rate follow similarly simple patterns? Here I analyze such patterns by their invariant properties. For example, a common pattern should not change when adding a constant value to all observations. That shift is essentially the renumbering of the points on a ruler without changing the metric information provided by the ruler. A ruler is shift invariant only when its scale is properly calibrated to the pattern being measured. Stretch invariance corresponds to the conservation of the total amount of something, such as the total biomass and consequently the average size. Rotational invariance corresponds to pattern that does not depend on the order in which underlying processes occur, for example, a scale that additively combines the component processes leading to observed values. I use tree size as an example to illustrate how the key invariances shape pattern. A simple interpretation of common pattern follows. That simple interpretation connects the normal distribution to a wide variety of other common patterns through the transformations of scale set by the fundamental invariances.
The invariances of power law size distributions
Frank, Steven A.
2016-01-01
Size varies. Small things are typically more frequent than large things. The logarithm of frequency often declines linearly with the logarithm of size. That power law relation forms one of the common patterns of nature. Why does the complexity of nature reduce to such a simple pattern? Why do things as different as tree size and enzyme rate follow similarly simple patterns? Here I analyze such patterns by their invariant properties. For example, a common pattern should not change when adding a constant value to all observations. That shift is essentially the renumbering of the points on a ruler without changing the metric information provided by the ruler. A ruler is shift invariant only when its scale is properly calibrated to the pattern being measured. Stretch invariance corresponds to the conservation of the total amount of something, such as the total biomass and consequently the average size. Rotational invariance corresponds to pattern that does not depend on the order in which underlying processes occur, for example, a scale that additively combines the component processes leading to observed values. I use tree size as an example to illustrate how the key invariances shape pattern. A simple interpretation of common pattern follows. That simple interpretation connects the normal distribution to a wide variety of other common patterns through the transformations of scale set by the fundamental invariances. PMID:27928497
NASA Astrophysics Data System (ADS)
Callahan, Patrick Gregory
A fundamental objective of materials science and engineering is to understand the structure-property-processing-performance relationship. We need to know the true 3-D microstructure of a material to understand certain geometric properties of a material, and thus fulfill this objective. Focused ion beam (FIB) serial sectioning allows us to find the true 3-D microstructure of Ni-base superalloys. Once the true 3-D microstructure is obtained, an accurate quantitative description and characterization of precipitate and/or grain shapes is needed to understand the microstructure and describe it in an unbiased way. In this thesis, second order moment invariants, the shape quotient Q, a convexity measure relating the volume of an object to the volume of its convex hull, V/Vconv, and Gaussian curvature have been used to compare an experimentally observed polycrystalline IN100 microstructure to three synthetic microstructures. The three synthetic microstructures used different shape classes to produce starting grain shapes. The three shape classes are ellipsoids, superellipsoids, and the shapes generated when truncating a cube with an octahedron. The microstructures are compared using a distance measure, the Hellinger distance. The Hellinger distance is used to compare distributions of shape descriptors for the grains in each microstructure. The synthetic microstructure that has the smallest Hellinger distance, and so best matched the experimentally observed microstructure is the microstructure that used superellipsoids as a starting grain shape. While it has the smallest Hellinger distance, and is approaching realistic grain morphologies, the superellipsoidal microstructure is still not realistic. Second order moment invariants, Q, and V/V conv have also been used to characterize the γ' precipitate shapes from four experimental Ru-containing Ni-base superalloys with differences in alloying additions. The superalloys are designated UM-F9, UM-F18, UM-F19, and UM-F22. The
Fast Translation Invariant Multiscale Image Denoising.
Li, Meng; Ghosal, Subhashis
2015-12-01
Translation invariant (TI) cycle spinning is an effective method for removing artifacts from images. However, for a method using O(n) time, the exact TI cycle spinning by averaging all possible circulant shifts requires O(n(2)) time where n is the number of pixels, and therefore is not feasible in practice. Existing literature has investigated efficient algorithms to calculate TI version of some denoising approaches such as Haar wavelet. Multiscale methods, especially those based on likelihood decomposition, such as penalized likelihood estimator and Bayesian methods, have become popular in image processing because of their effectiveness in denoising images. As far as we know, there is no systematic investigation of the TI calculation corresponding to general multiscale approaches. In this paper, we propose a fast TI (FTI) algorithm and a more general k-TI (k-TI) algorithm allowing TI for the last k scales of the image, which are applicable to general d-dimensional images (d = 2, 3, …) with either Gaussian or Poisson noise. The proposed FTI leads to the exact TI estimation but only requires O(n log2 n) time. The proposed k-TI can achieve almost the same performance as the exact TI estimation, but requires even less time. We achieve this by exploiting the regularity present in the multiscale structure, which is justified theoretically. The proposed FTI and k-TI are generic in that they are applicable on any smoothing techniques based on the multiscale structure. We demonstrate the FTI and k-TI algorithms on some recently proposed state-of-the-art methods for both Poisson and Gaussian noised images. Both simulations and real data application confirm the appealing performance of the proposed algorithms. MATLAB toolboxes are online accessible to reproduce the results and be implemented for general multiscale denoising approaches provided by the users.
Anisotropic scaling and generalized conformal invariance at Lifshitz points
NASA Astrophysics Data System (ADS)
Henkel, Malte; Pleimling, Michel
2002-08-01
A new variant of the Wolff cluster algorithm is proposed for simulating systems with competing interactions. This method is used in a high-precision study of the Lifshitz point of the 3D ANNNI model. At the Lifshitz point, several critical exponents are found and the anisotropic scaling of the correlators is verified. The functional form of the two-point correlators is shown to be consistent with the predictions of generalized conformal invariance.
Resurgence matches quantization
NASA Astrophysics Data System (ADS)
Couso-Santamaría, Ricardo; Mariño, Marcos; Schiappa, Ricardo
2017-04-01
The quest to find a nonperturbative formulation of topological string theory has recently seen two unrelated developments. On the one hand, via quantization of the mirror curve associated to a toric Calabi–Yau background, it has been possible to give a nonperturbative definition of the topological-string partition function. On the other hand, using techniques of resurgence and transseries, it has been possible to extend the string (asymptotic) perturbative expansion into a transseries involving nonperturbative instanton sectors. Within the specific example of the local {{{P}}2} toric Calabi–Yau threefold, the present work shows how the Borel–Padé–Écalle resummation of this resurgent transseries, alongside occurrence of Stokes phenomenon, matches the string-theoretic partition function obtained via quantization of the mirror curve. This match is highly non-trivial, given the unrelated nature of both nonperturbative frameworks, signaling at the existence of a consistent underlying structure.
Matching forensic sketches to mug shot photos.
Klare, Brendan F; Li, Zhifeng; Jain, Anil K
2011-03-01
The problem of matching a forensic sketch to a gallery of mug shot images is addressed in this paper. Previous research in sketch matching only offered solutions to matching highly accurate sketches that were drawn while looking at the subject (viewed sketches). Forensic sketches differ from viewed sketches in that they are drawn by a police sketch artist using the description of the subject provided by an eyewitness. To identify forensic sketches, we present a framework called local feature-based discriminant analysis (LFDA). In LFDA, we individually represent both sketches and photos using SIFT feature descriptors and multiscale local binary patterns (MLBP). Multiple discriminant projections are then used on partitioned vectors of the feature-based representation for minimum distance matching. We apply this method to match a data set of 159 forensic sketches against a mug shot gallery containing 10,159 images. Compared to a leading commercial face recognition system, LFDA offers substantial improvements in matching forensic sketches to the corresponding face images. We were able to further improve the matching performance using race and gender information to reduce the target gallery size. Additional experiments demonstrate that the proposed framework leads to state-of-the-art accuracys when matching viewed sketches.
Stereo matching based on census transformation of image gradients
NASA Astrophysics Data System (ADS)
Stentoumis, C.; Grammatikopoulos, L.; Kalisperakis, I.; Karras, G.; Petsa, E.
2015-05-01
Although multiple-view matching provides certain significant advantages regarding accuracy, occlusion handling and radiometric fidelity, stereo-matching remains indispensable for a variety of applications; these involve cases when image acquisition requires fixed geometry and limited number of images or speed. Such instances include robotics, autonomous navigation, reconstruction from a limited number of aerial/satellite images, industrial inspection and augmented reality through smart-phones. As a consequence, stereo-matching is a continuously evolving research field with growing variety of applicable scenarios. In this work a novel multi-purpose cost for stereo-matching is proposed, based on census transformation on image gradients and evaluated within a local matching scheme. It is demonstrated that when the census transformation is applied on gradients the invariance of the cost function to changes in illumination (non-linear) is significantly strengthened. The calculated cost values are aggregated through adaptive support regions, based both on cross-skeletons and basic rectangular windows. The matching algorithm is tuned for the parameters in each case. The described matching cost has been evaluated on the Middlebury stereo-vision 2006 datasets, which include changes in illumination and exposure. The tests verify that the census transformation on image gradients indeed results in a more robust cost function, regardless of aggregation strategy.
NASA Astrophysics Data System (ADS)
Cai, Huiying; Zhu, Feng; Hao, Yingming; Lu, Rongrong
2016-10-01
Shape Matching under Affine Transformation (SMAT) is an important issue in shape analysis. Most of the existing SMAT methods are sensitive to noise or complicated because they usually need to extract the edge points or compute the high order function of the shape. To solve these problems, a new SMAT method which combines the low order shape normalization and the multi-scale area integral features is proposed. First, the shapes with affine transformation are normalized into their orthogonal representations according to the moments and an equivalent resample. This procedure transforms the shape by several linear operations: translations, scaling, and rotation, following by a resample operation. Second, the Multi-Scale Area Integral Features (MSAIF) of the shapes which are invariant to the orthogonal transformation (rotation and reflection transformation) are extracted. The MSAIF is a signature achieved through concatenating the area integral feature at a range of scales from fine to coarse. The area integral feature is an integration of the feature values, which are computed by convoluting the shape with an isotropic kernel and taking the complement, over the shape domain following by the normalization using the area of the shape. Finally, the matching of different shapes is performed according to the dissimilarity which is measured with the optimal transport distance. The performance of the proposed method is tested on the car dataset and the multi-view curve dataset. Experimental results show that the proposed method is efficient and robust, and can be used in many shape analysis works.
ERIC Educational Resources Information Center
Benson, Nicholas; Taub, Gordon E.
2013-01-01
The purpose of this study was to test the invariance of scores derived from the Woodcock-Johnson III Tests of Cognitive Ability (WJ III COG) and Woodcock-Johnson III Tests of Academic Achievement (WJ III ACH) across a group of students diagnosed with learning disorders (n = 994) and a matched sample of students without known clinical diagnoses (n…
ERIC Educational Resources Information Center
Finch, Holmes; Davis, Andrew; Dean, Raymond S.
2010-01-01
The current study examined the measurement