The Silhouette Zoetrope: A New Blend of Motion, Mirroring, Depth, and Size Illusions.

Science.gov (United States)

Veras, Christine; Pham, Quang-Cuong; Maus, Gerrit W

2017-01-01

Here, we report a novel combination of visual illusions in one stimulus device, a contemporary innovation of the traditional zoetrope, called Silhouette Zoetrope. In this new device, an animation of moving silhouettes is created by sequential cutouts placed outside a rotating empty cylinder, with slits illuminating the cutouts successively from the back. This "inside-out" zoetrope incurs the following visual effects: the resulting animated figures are perceived (a) horizontally flipped, (b) inside the cylinder, and (c) appear to be of different size than the actual cutout object. Here, we explore the unique combination of illusions in this new device. We demonstrate how the geometry of the device leads to a retinal image consistent with a mirrored and distorted image and binocular disparities consistent with the perception of an object inside the cylinder.

Stochastic convergence of persistence landscapes and silhouettes

Directory of Open Access Journals (Sweden)

Frédéric Chazal

2015-03-01

Full Text Available Persistent homology is a widely used tool in Topological Data Analysis that encodes multi-scale topological information as a multiset of points in the plane called a persistence diagram. It is difficult to apply statistical theory directly to a random sample of diagrams. Instead, we summarize persistent homology with a persistence landscape, introduced by Bubenik, which converts a diagram into a well-behaved real-valued function. We investigate the statistical properties of landscapes, such as weak convergence of the average landscapes and convergence of the bootstrap. In addition, we introduce an alternate functional summary of persistent homology, which we call the silhouette, and derive an analogous statistical theory.

[Silhouettes at different age of life: Retrospective appreciation of corpulence and his impact on prevalence of hypertension at 60years].

Science.gov (United States)

Thomas, F; Empana, J P; Charles, M A; Boutouyrie, P; Jouven, X; Pannier, B; Danchin, N

2017-06-01

In epidemiological studies, recall of weight and height are not readily available at different ages of life. In order to improve the knowledge of the weight history, Sörensen et al. in 1983, developed a tool from silhouettes allowing an individual to evaluate his corpulence at different ages of life. Validity studies showed that measured weight and size were correlated to 80% in the reported silhouette. Studies have also shown that silhouettes are a good way to trace the weight history in an individual's life. Very few epidemiological studies have used this tool. A French study revealed a decrease of the risk of breast cancer in obese girls between the age of 8 and adolescence. Another study showed that a low birth weight or a thin silhouette before adulthood was associated with an increased risk of diabetes. On the basis of these findings, it was interesting to evaluate the relationship between the silhouette at 20years and the risk of hypertension at the age of 60years. It was shown that the prevalence of hypertension at age 60 was higher among obese subjects at 20years than among thin subjects (45.3% vs 36.7% (P<0.05). The classification between slimness and obesity is relevant using this tool. The history of corpulence is an important element to consider in the determinants of pathology, especially in hypertension. Copyright © 2017 Elsevier Masson SAS. All rights reserved.

Sparse Detector Imaging Sensor with Two-Class Silhouette Classification

Directory of Open Access Journals (Sweden)

David Russomanno

2008-12-01

Full Text Available This paper presents the design and test of a simple active near-infrared sparse detector imaging sensor. The prototype of the sensor is novel in that it can capture remarkable silhouettes or profiles of a wide-variety of moving objects, including humans, animals, and vehicles using a sparse detector array comprised of only sixteen sensing elements deployed in a vertical configuration. The prototype sensor was built to collect silhouettes for a variety of objects and to evaluate several algorithms for classifying the data obtained from the sensor into two classes: human versus non-human. Initial tests show that the classification of individually sensed objects into two classes can be achieved with accuracy greater than ninety-nine percent (99% with a subset of the sixteen detectors using a representative dataset consisting of 512 signatures. The prototype also includes a Webservice interface such that the sensor can be tasked in a network-centric environment. The sensor appears to be a low-cost alternative to traditional, high-resolution focal plane array imaging sensors for some applications. After a power optimization study, appropriate packaging, and testing with more extensive datasets, the sensor may be a good candidate for deployment in vast geographic regions for a myriad of intelligent electronic fence and persistent surveillance applications, including perimeter security scenarios.

Robustness of Input features from Noisy Silhouettes in Human Pose Estimation

DEFF Research Database (Denmark)

Gong, Wenjuan; Fihl, Preben; Gonzàlez, Jordi

2014-01-01

. In this paper, we explore this problem. First, We compare performances of several image features widely used for human pose estimation and explore their performances against each other and select one with best performance. Second, iterative closest point algorithm is introduced for a new quantitative...... of silhouette samples of different noise levels and compare with the selected feature on a public dataset: Human Eva dataset....

Body Image Satisfaction, Eating Attitudes and Perceptions of Female Body Silhouettes in Rural South African Adolescents.

Directory of Open Access Journals (Sweden)

Titilola M Pedro

Full Text Available This study aims to examine the associations between BMI, disordered eating attitude, body dissatisfaction in female adolescents, and descriptive attributes assigned to silhouettes of varying sizes in male and female adolescents, aged 11 to 15, in rural South Africa. Height and weight were measured to determine BMI. Age and sex-specific cut-offs for underweight and overweight/obesity were determined using the International Obesity Task Force cut-offs. Body image satisfaction using Feel-Ideal Discrepancy (FID scores, Eating Attitudes Test-26 (EAT-26, and perceptual female silhouettes were collected through self-administered questionnaires in 385 adolescents from the Agincourt Health and Socio-Demographic Surveillance System (HSDSS. Participants self-reported their Tanner pubertal stage and were classified as early pubertal ( 2. Mid to post pubertal boys and girls were significantly heavier, taller, and had higher BMI values than their early pubertal counterparts (all p<0.001. The prevalence of overweight and obesity was higher in the girls than the boys in both pubertal stages. The majority (83.5% of the girls demonstrated body dissatisfaction (a desire to be thinner or fatter. The girls who wanted to be fatter had a significantly higher BMI than the girls who wanted to be thinner (p<0.001. There were no differences in EAT-26 scores between pubertal groups, within the same sex, and between boys and girls within the two pubertal groups. The majority of the boys and the girls in both pubertal groups perceived the underweight silhouettes to be "unhappy" and "weak" and the majority of girls in both pubertal groups perceived the normal silhouettes to be the "best". These findings suggest a need for policy intervention that will address a healthy body size among South African adolescents.

Encryption of QR code and grayscale image in interference-based scheme with high quality retrieval and silhouette problem removal

Science.gov (United States)

Qin, Yi; Wang, Hongjuan; Wang, Zhipeng; Gong, Qiong; Wang, Danchen

2016-09-01

In optical interference-based encryption (IBE) scheme, the currently available methods have to employ the iterative algorithms in order to encrypt two images and retrieve cross-talk free decrypted images. In this paper, we shall show that this goal can be achieved via an analytical process if one of the two images is QR code. For decryption, the QR code is decrypted in the conventional architecture and the decryption has a noisy appearance. Nevertheless, the robustness of QR code against noise enables the accurate acquisition of its content from the noisy retrieval, as a result of which the primary QR code can be exactly regenerated. Thereafter, a novel optical architecture is proposed to recover the grayscale image by aid of the QR code. In addition, the proposal has totally eliminated the silhouette problem existing in the previous IBE schemes, and its effectiveness and feasibility have been demonstrated by numerical simulations.

Perceptual Categorization of Cat and Dog Silhouettes by 3- to 4-Month-Old Infants.

Science.gov (United States)

Quinn, Paul C.; Eimas, Peter D.; Tarr, Michael

2001-01-01

Four experiments utilizing the familiarization-novelty preference procedure examined whether 3- and 4-month-olds could form categorical representations for cats versus dogs from the perceptual information available in silhouettes. Findings indicated that general shape or external contour information centered about the head was sufficient for…

The apparent size of three-dimensional objects and their silhouettes: a solid-superiority effect.

Science.gov (United States)

Walker, J T; Walker, M J

1988-01-01

A solid object looks larger than its outline or silhouette under many viewing conditions. This solid-superiority effect may result from the assimilation or confusion of visual contours within the projection of a three-dimensional object on the picture plane. An aspect of the Müller-Lyer illusion may also play a role.

Silhouette and spectral line profiles in the special modification of the Kerr black hole geometry generated by quintessential fields

Energy Technology Data Exchange (ETDEWEB)

Schee, Jan; Stuchlik, Zdenek [Silesian University in Opava, Faculty of Philosophy and Science, Institute of Physics and Research Centre for Theoretical Physics and Astrophysics, Opava (Czech Republic)

2016-11-15

We study optical effects in quintessential Kerr black hole spacetimes corresponding to the limiting case of the equation-of-state parameter ω{sub q} = -1/3 of the quintessence. In dependence on the dimensionless quintessential field parameter c, we determine the black hole silhouette and the spectral line profiles of Keplerian disks generated in this special quintessential Kerr geometry, representing an extension of the general modifications of the Kerr geometry introduced recently by Ghasemi-Nodehi and Bambi (Eur. Phys. J. C 56:290, 2016). We demonstrate that due to the influence of the parameter c, the silhouette is almost homogeneously enlarged, and the spectral line profiles are redshifted with almost conserved shape. (orig.)

Invariant Classification of Gait Types

DEFF Research Database (Denmark)

Fihl, Preben; Moeslund, Thomas B.

2008-01-01

. Input silhouettes are matched to the database using the Hungarian method. A classifier is defined based on the dissimilarity between the input silhouettes and the gait actions of the database. The overall recognition rate is 88.2% on a large and diverse test set. The recognition rate is better than...

Object-based connectedness facilitates matching

NARCIS (Netherlands)

Koning, A.R.; Lier, R.J. van

2003-01-01

In two matching tasks, participants had to match two images of object pairs. Image-based (113) connectedness refers to connectedness between the objects in an image. Object-based (OB) connectedness refers to connectedness between the interpreted objects. In Experiment 1, a monocular depth cue

Hybrid-Based Dense Stereo Matching

Science.gov (United States)

Chuang, T. Y.; Ting, H. W.; Jaw, J. J.

2016-06-01

Stereo matching generating accurate and dense disparity maps is an indispensable technique for 3D exploitation of imagery in the fields of Computer vision and Photogrammetry. Although numerous solutions and advances have been proposed in the literature, occlusions, disparity discontinuities, sparse texture, image distortion, and illumination changes still lead to problematic issues and await better treatment. In this paper, a hybrid-based method based on semi-global matching is presented to tackle the challenges on dense stereo matching. To ease the sensitiveness of SGM cost aggregation towards penalty parameters, a formal way to provide proper penalty estimates is proposed. To this end, the study manipulates a shape-adaptive cross-based matching with an edge constraint to generate an initial disparity map for penalty estimation. Image edges, indicating the potential locations of occlusions as well as disparity discontinuities, are approved by the edge drawing algorithm to ensure the local support regions not to cover significant disparity changes. Besides, an additional penalty parameter 𝑃𝑒 is imposed onto the energy function of SGM cost aggregation to specifically handle edge pixels. Furthermore, the final disparities of edge pixels are found by weighting both values derived from the SGM cost aggregation and the U-SURF matching, providing more reliable estimates at disparity discontinuity areas. Evaluations on Middlebury stereo benchmarks demonstrate satisfactory performance and reveal the potency of the hybrid-based dense stereo matching method.

Gait Correlation Analysis Based Human Identification

Directory of Open Access Journals (Sweden)

Jinyan Chen

2014-01-01

Full Text Available Human gait identification aims to identify people by a sequence of walking images. Comparing with fingerprint or iris based identification, the most important advantage of gait identification is that it can be done at a distance. In this paper, silhouette correlation analysis based human identification approach is proposed. By background subtracting algorithm, the moving silhouette figure can be extracted from the walking images sequence. Every pixel in the silhouette has three dimensions: horizontal axis (x, vertical axis (y, and temporal axis (t. By moving every pixel in the silhouette image along these three dimensions, we can get a new silhouette. The correlation result between the original silhouette and the new one can be used as the raw feature of human gait. Discrete Fourier transform is used to extract features from this correlation result. Then, these features are normalized to minimize the affection of noise. Primary component analysis method is used to reduce the features’ dimensions. Experiment based on CASIA database shows that this method has an encouraging recognition performance.

Image matching navigation based on fuzzy information

Institute of Scientific and Technical Information of China (English)

田玉龙; 吴伟仁; 田金文; 柳健

2003-01-01

In conventional image matching methods, the image matching process is mostly based on image statistic information. One aspect neglected by all these methods is that there is much fuzzy information contained in these images. A new fuzzy matching algorithm based on fuzzy similarity for navigation is presented in this paper. Because the fuzzy theory is of the ability of making good description of the fuzzy information contained in images, the image matching method based on fuzzy similarity would look forward to producing good performance results. Experimental results using matching algorithm based on fuzzy information also demonstrate its reliability and practicability.

a Target Aware Texture Mapping for Sculpture Heritage Modeling

Science.gov (United States)

Yang, C.; Zhang, F.; Huang, X.; Li, D.; Zhu, Y.

2017-08-01

In this paper, we proposed a target aware image to model registration method using silhouette as the matching clues. The target sculpture object in natural environment can be automatically detected from image with complex background with assistant of 3D geometric data. Then the silhouette can be automatically extracted and applied in image to model matching. Due to the user don't need to deliberately draw target area, the time consumption for precisely image to model matching operation can be greatly reduced. To enhance the function of this method, we also improved the silhouette matching algorithm to support conditional silhouette matching. Two experiments using a stone lion sculpture of Ming Dynasty and a potable relic in museum are given to evaluate the method we proposed. The method we proposed in this paper is extended and developed into a mature software applied in many culture heritage documentation projects.

Fractional Order Element Based Impedance Matching

KAUST Repository

Radwan, Ahmed Gomaa

2014-06-24

Disclosed are various embodiments of methods and systems related to fractional order element based impedance matching. In one embodiment, a method includes aligning a traditional Smith chart (|.alpha.|=1) with a fractional order Smith chart (|.alpha.|.noteq.1). A load impedance is located on the traditional Smith chart and projected onto the fractional order Smith chart. A fractional order matching element is determined by transitioning along a matching circle of the fractional order Smith chart based at least in part upon characteristic line impedance. In another embodiment, a system includes a fractional order impedance matching application executed in a computing device. The fractional order impedance matching application includes logic that obtains a first set of Smith chart coordinates at a first order, determines a second set of Smith chart coordinates at a second order, and determines a fractional order matching element from the second set of Smith chart coordinates.

Matching score based face recognition

NARCIS (Netherlands)

Boom, B.J.; Beumer, G.M.; Spreeuwers, Lieuwe Jan; Veldhuis, Raymond N.J.

2006-01-01

Accurate face registration is of vital importance to the performance of a face recognition algorithm. We propose a new method: matching score based face registration, which searches for optimal alignment by maximizing the matching score output of a classifier as a function of the different

What can child silhouette data tell us? Exploring links to parenting, food and activity behaviors, and maternal concerns

Science.gov (United States)

Purpose: A study of resiliency to overweight explored how child silhouettes (maternal perception of child’s body size) related to child BMI, maternal concerns, parenting styles and practices. Methods: In a diverse, multi-state sample, 175 low-income mother-child (ages 3-11) dyads were assessed for...

Fast image matching algorithm based on projection characteristics

Science.gov (United States)

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.

A Full-Body Layered Deformable Model for Automatic Model-Based Gait Recognition

Science.gov (United States)

Lu, Haiping; Plataniotis, Konstantinos N.; Venetsanopoulos, Anastasios N.

2007-12-01

This paper proposes a full-body layered deformable model (LDM) inspired by manually labeled silhouettes for automatic model-based gait recognition from part-level gait dynamics in monocular video sequences. The LDM is defined for the fronto-parallel gait with 22 parameters describing the human body part shapes (widths and lengths) and dynamics (positions and orientations). There are four layers in the LDM and the limbs are deformable. Algorithms for LDM-based human body pose recovery are then developed to estimate the LDM parameters from both manually labeled and automatically extracted silhouettes, where the automatic silhouette extraction is through a coarse-to-fine localization and extraction procedure. The estimated LDM parameters are used for model-based gait recognition by employing the dynamic time warping for matching and adopting the combination scheme in AdaBoost.M2. While the existing model-based gait recognition approaches focus primarily on the lower limbs, the estimated LDM parameters enable us to study full-body model-based gait recognition by utilizing the dynamics of the upper limbs, the shoulders and the head as well. In the experiments, the LDM-based gait recognition is tested on gait sequences with differences in shoe-type, surface, carrying condition and time. The results demonstrate that the recognition performance benefits from not only the lower limb dynamics, but also the dynamics of the upper limbs, the shoulders and the head. In addition, the LDM can serve as an analysis tool for studying factors affecting the gait under various conditions.

The relative pose estimation of aircraft based on contour model

Science.gov (United States)

Fu, Tai; Sun, Xiangyi

2017-02-01

This paper proposes a relative pose estimation approach based on object contour model. The first step is to obtain a two-dimensional (2D) projection of three-dimensional (3D)-model-based target, which will be divided into 40 forms by clustering and LDA analysis. Then we proceed by extracting the target contour in each image and computing their Pseudo-Zernike Moments (PZM), thus a model library is constructed in an offline mode. Next, we spot a projection contour that resembles the target silhouette most in the present image from the model library with reference of PZM; then similarity transformation parameters are generated as the shape context is applied to match the silhouette sampling location, from which the identification parameters of target can be further derived. Identification parameters are converted to relative pose parameters, in the premise that these values are the initial result calculated via iterative refinement algorithm, as the relative pose parameter is in the neighborhood of actual ones. At last, Distance Image Iterative Least Squares (DI-ILS) is employed to acquire the ultimate relative pose parameters.

ADAPTIVE OPTICS OBSERVATIONS OF 3 {mu}m WATER ICE IN SILHOUETTE DISKS IN THE ORION NEBULA CLUSTER AND M43

Energy Technology Data Exchange (ETDEWEB)

Terada, Hiroshi; Pyo, Tae-Soo; Minowa, Yosuke; Hayano, Yutaka; Oya, Shin; Hattori, Masayuki; Takami, Hideki [Subaru Telescope, National Astronomical Observatory of Japan, 650 North A' ohoku Place, Hilo, HI 96720 (United States); Tokunaga, Alan T. [Institute for Astronomy, University of Hawaii, 2680 Woodlawn Drive, Honolulu, HI 96822 (United States); Watanabe, Makoto [Department of Cosmosciences, Hokkaido University, Kita 10, Nishi 8, Kita-ku, Sapporo, Hokkaido 060-0810 (Japan); Saito, Yoshihiko [Department of Physics, Tokyo Institute of Technology, 2-12-1 Ookayama, Meguro, Tokyo 152-8551 (Japan); Ito, Meguru [Department of Mechanical Engineering, University of Victoria, 3800 Finnerty Road, Victoria, BC, V8P 5C2 (Canada); Iye, Masanori, E-mail: terada@subaru.naoj.org [National Astronomical Observatory of Japan, 2-21-1 Osawa, Mitaka, Tokyo 181-8588 (Japan)

2012-12-01

We present the near-infrared images and spectra of four silhouette disks in the Orion Nebula Cluster (M42) and M43 using the Subaru Adaptive Optics system. While d053-717 and d141-1952 show no water ice feature at 3.1 {mu}m, a moderately deep ({tau}{sub ice} {approx} 0.7) water ice absorption is detected toward d132-1832 and d216-0939. Taking into account the water ice so far detected in the silhouette disks, the critical inclination angle to produce a water ice absorption feature is confirmed to be 65 Degree-Sign -75 Degree-Sign . As for d216-0939, the crystallized water ice profile is exactly the same as in the previous observations taken 3.63 years ago. If the water ice material is located at 30 AU, then the observations suggest it is uniform at a scale of about 3.5 AU.

An analysis of the VOSP Silhouettes Test with neurological patients

Directory of Open Access Journals (Sweden)

THOMAS MERTEN

2006-12-01

Full Text Available An item analysis of the Silhouettes, part of the Visual Object and Space Perception Battery, was performed using the test protocols of 266 German-speaking neurological patients with a mean age of 54.8 years, all of them presenting some sort of brain pathology. The sample yielded a mean test score of 17.0 (SD = 4.6. The two subsets of 15 animals and 15 objects were only moderately correlated (0.45, so the inclusion into a single scale is questionable. Other reliability estimates were also rather low (0.62 to 0.77. Moreover, gross deviations in item difficulty were obtained with this sample; scoring rules were found to be insufficiently explicit. Despite moderate rank correlations with other instruments (Hooper VOT: 0.65; WAIS-R Block Design: 0.57; neuropsychological screening battery SKT: -0.45, the psychometric properties obtained with this sample must be considered to be insufficient.

Body dissatisfaction and the wish for different silhouette is associated with higher adiposity and fat intake in female ballet dancers than male.

Science.gov (United States)

Da Silva, Camila Lacerda; De Oliveira, Erick Prado; De Sousa, Maysa Vieira; Pimentel, Gustavo D

2016-01-01

It is known that behavioral disorders and altered food intake are linked to ballet dancers. Thus, the aim of the present study was to investigate the body composition, dietetic profile, self-perceived body image and social desirability in professional ballet dancers. This study was conducted from April to October 2010 in athletes screened for nutritional evaluation. Anthropometric, dietary, social desirability and self-perceived body image evaluation were performed to attend the aim of study. We found that ballet dancers are highly trained and eutrophic, although female dancers had higher adiposity and fat intake than male dancers. In addition, it was observed low consumption of calcium, dietary fiber, potassium, magnesium and vitamin A. Moreover, 30% of male ballet dancers have a strong desire for social acceptance. When the body image was evaluated by Body Shape Questionnaire (BSQ), was reported that 40% of the ballet female dancers have of moderate to severe alteration in body image and 20% of male dancers had slight alteration. Furthermore, the Drawings and Silhouettes Scale showed that 80% of male dancers wish to have a smaller or larger silhouette than the current self-perceived and 60% of the female dancers would like to have a silhouette lower than the self-perceive as current. Collectively, our results shown that most of the dancers were eutrophic, but female athletes have higher adiposity and present strong desire for a different shape of current. Furthermore, was found increased fat intake in female group; however, deficiencies in consumption of dietary fiber, calcium, potassium, magnesium and vitamin A were found in both gender.

Theory of fractional order elements based impedance matching networks

KAUST Repository

Radwan, Ahmed G.

2011-03-01

Fractional order circuit elements (inductors and capacitors) based impedance matching networks are introduced for the first time. In comparison to the conventional integer based L-type matching networks, fractional matching networks are much simpler and versatile. Any complex load can be matched utilizing a single series fractional element, which generally requires two elements for matching in the conventional approach. It is shown that all the Smith chart circles (resistance and reactance) are actually pairs of completely identical circles. They appear to be single for the conventional integer order case, where the identical circles completely overlap each other. The concept is supported by design equations and impedance matching examples. © 2010 IEEE.

DISCOVERY OF CRYSTALLIZED WATER ICE IN A SILHOUETTE DISK IN THE M43 REGION

Energy Technology Data Exchange (ETDEWEB)

Terada, Hiroshi [Subaru Telescope, National Astronomical Observatory of Japan, 650 North A' ohoku Place, Hilo, HI 96720 (United States); Tokunaga, Alan T., E-mail: terada@subaru.naoj.org [Institute for Astronomy, University of Hawaii, 2680 Woodlawn Drive, Honolulu 96822 (United States)

2012-07-01

We present the 1.9-4.2 {mu}m spectra of the five bright (L {<=} 11.2) young stars associated with silhouette disks with a moderate to high inclination angle of 39 Degree-Sign -80 Degree-Sign in the M42 and M43 regions. The water ice absorption is seen toward d121-1925 and d216-0939, while the spectra of d182-316, d183-405, and d218-354 show no water ice feature around 3.1 {mu}m within the detection limits. By comparing the water ice features toward nearby stars, we find that the water ice absorption toward d121-1925 and d216-0939 most likely originates from the foreground material and the surrounding disk, respectively. The angle of the disk inclination is found to be mainly responsible for the difference of the optical depth of the water ice among the five young stars. Our results suggest that there is a critical inclination angle between 65 Degree-Sign and 75 Degree-Sign for the circumstellar disk where the water ice absorption becomes strong. The average density at the disk surface of d216-0939 was found to be 6.38 Multiplication-Sign 10{sup -18} g cm{sup -3}. The water ice absorption band in the d216-0939 disk is remarkable in that the maximum optical depth of the water ice band is at a longer wavelength than detected before. It indicates that the primary carrier of the feature is purely crystallized water ice at the surface of the d216-0939 disk with characteristic size of {approx}0.8 {mu}m, which suggests grain growth. This is the first direct detection of purely crystallized water ice in a silhouette disk.

Image Relaxation Matching Based on Feature Points for DSM Generation

Institute of Scientific and Technical Information of China (English)

ZHENG Shunyi; ZHANG Zuxun; ZHANG Jianqing

2004-01-01

In photogrammetry and remote sensing, image matching is a basic and crucial process for automatic DEM generation. In this paper we presented a image relaxation matching method based on feature points. This method can be considered as an extention of regular grid point based matching. It avoids the shortcome of grid point based matching. For example, with this method, we can avoid low or even no texture area where errors frequently appear in cross correlaton matching. In the mean while, it makes full use of some mature techniques such as probability relaxation, image pyramid and the like which have already been successfully used in grid point matching process. Application of the technique to DEM generaton in different regions proved that it is more reasonable and reliable.

3-D FEATURE-BASED MATCHING BY RSTG APPROACH

Directory of Open Access Journals (Sweden)

J.-J. Jaw

2012-07-01

Full Text Available 3-D feature matching is the essential kernel in a fully automated feature-based LiDAR point cloud registration. After feasible procedures of feature acquisition, connecting corresponding features in different data frames is imperative to be solved. The objective addressed in this paper is developing an approach coined RSTG to retrieve corresponding counterparts of unsorted multiple 3-D features extracted from sets of LiDAR point clouds. RSTG stands for the four major processes, "Rotation alignment"; "Scale estimation"; "Translation alignment" and "Geometric check," strategically formulated towards finding out matching solution with high efficiency and leading to accomplishing the 3-D similarity transformation among all sets. The workable types of features to RSTG comprise points, lines, planes and clustered point groups. Each type of features can be employed exclusively or combined with others, if sufficiently supplied, throughout the matching scheme. The paper gives a detailed description of the matching methodology and discusses on the matching effects based on the statistical assessment which revealed that the RSTG approach reached an average matching rate of success up to 93% with around 6.6% of statistical type 1 error. Notably, statistical type 2 error, the critical indicator of matching reliability, was kept 0% throughout all the experiments.

A coarse to fine minutiae-based latent palmprint matching.

Science.gov (United States)

Liu, Eryun; Jain, Anil K; Tian, Jie

2013-10-01

With the availability of live-scan palmprint technology, high resolution palmprint recognition has started to receive significant attention in forensics and law enforcement. In forensic applications, latent palmprints provide critical evidence as it is estimated that about 30 percent of the latents recovered at crime scenes are those of palms. Most of the available high-resolution palmprint matching algorithms essentially follow the minutiae-based fingerprint matching strategy. Considering the large number of minutiae (about 1,000 minutiae in a full palmprint compared to about 100 minutiae in a rolled fingerprint) and large area of foreground region in full palmprints, novel strategies need to be developed for efficient and robust latent palmprint matching. In this paper, a coarse to fine matching strategy based on minutiae clustering and minutiae match propagation is designed specifically for palmprint matching. To deal with the large number of minutiae, a local feature-based minutiae clustering algorithm is designed to cluster minutiae into several groups such that minutiae belonging to the same group have similar local characteristics. The coarse matching is then performed within each cluster to establish initial minutiae correspondences between two palmprints. Starting with each initial correspondence, a minutiae match propagation algorithm searches for mated minutiae in the full palmprint. The proposed palmprint matching algorithm has been evaluated on a latent-to-full palmprint database consisting of 446 latents and 12,489 background full prints. The matching results show a rank-1 identification accuracy of 79.4 percent, which is significantly higher than the 60.8 percent identification accuracy of a state-of-the-art latent palmprint matching algorithm on the same latent database. The average computation time of our algorithm for a single latent-to-full match is about 141 ms for genuine match and 50 ms for impostor match, on a Windows XP desktop system with 2

Visual agnosia for line drawings and silhouettes without apparent impairment of real-object recognition: a case report.

Science.gov (United States)

Hiraoka, Kotaro; Suzuki, Kyoko; Hirayama, Kazumi; Mori, Etsuro

2009-01-01

We report on a patient with visual agnosia for line drawings and silhouette pictures following cerebral infarction in the region of the right posterior cerebral artery. The patient retained the ability to recognize real objects and their photographs, and could precisely copy line drawings of objects that she could not name. This case report highlights the importance of clinicians and researchers paying special attention to avoid overlooking agnosia in such cases. The factors that lead to problems in the identification of stimuli other than real objects in agnosic cases are discussed.

Visual Agnosia for Line Drawings and Silhouettes without Apparent Impairment of Real-Object Recognition: A Case Report

Directory of Open Access Journals (Sweden)

Kotaro Hiraoka

2009-01-01

Full Text Available We report on a patient with visual agnosia for line drawings and silhouette pictures following cerebral infarction in the region of the right posterior cerebral artery. The patient retained the ability to recognize real objects and their photographs, and could precisely copy line drawings of objects that she could not name. This case report highlights the importance of clinicians and researchers paying special attention to avoid overlooking agnosia in such cases. The factors that lead to problems in the identification of stimuli other than real objects in agnosic cases are discussed.

AN AERIAL-IMAGE DENSE MATCHING APPROACH BASED ON OPTICAL FLOW FIELD

Directory of Open Access Journals (Sweden)

W. Yuan

2016-06-01

Full Text Available Dense matching plays an important role in many fields, such as DEM (digital evaluation model producing, robot navigation and 3D environment reconstruction. Traditional approaches may meet the demand of accuracy. But the calculation time and out puts density is hardly be accepted. Focus on the matching efficiency and complex terrain surface matching feasibility an aerial image dense matching method based on optical flow field is proposed in this paper. First, some high accurate and uniformed control points are extracted by using the feature based matching method. Then the optical flow is calculated by using these control points, so as to determine the similar region between two images. Second, the optical flow field is interpolated by using the multi-level B-spline interpolation in the similar region and accomplished the pixel by pixel coarse matching. Final, the results related to the coarse matching refinement based on the combined constraint, which recognizes the same points between images. The experimental results have shown that our method can achieve per-pixel dense matching points, the matching accuracy achieves sub-pixel level, and fully meet the three-dimensional reconstruction and automatic generation of DSM-intensive matching’s requirements. The comparison experiments demonstrated that our approach’s matching efficiency is higher than semi-global matching (SGM and Patch-based multi-view stereo matching (PMVS which verifies the feasibility and effectiveness of the algorithm.

Average Gait Differential Image Based Human Recognition

Directory of Open Access Journals (Sweden)

Jinyan Chen

2014-01-01

Full Text Available The difference between adjacent frames of human walking contains useful information for human gait identification. Based on the previous idea a silhouettes difference based human gait recognition method named as average gait differential image (AGDI is proposed in this paper. The AGDI is generated by the accumulation of the silhouettes difference between adjacent frames. The advantage of this method lies in that as a feature image it can preserve both the kinetic and static information of walking. Comparing to gait energy image (GEI, AGDI is more fit to representation the variation of silhouettes during walking. Two-dimensional principal component analysis (2DPCA is used to extract features from the AGDI. Experiments on CASIA dataset show that AGDI has better identification and verification performance than GEI. Comparing to PCA, 2DPCA is a more efficient and less memory storage consumption feature extraction method in gait based recognition.

Fractional Order Element Based Impedance Matching

KAUST Repository

Radwan, Ahmed Gomaa; Salama, Khaled N.; Shamim, Atif

2014-01-01

Disclosed are various embodiments of methods and systems related to fractional order element based impedance matching. In one embodiment, a method includes aligning a traditional Smith chart (|.alpha.|=1) with a fractional order Smith chart (|.alpha

Unsupervised image matching based on manifold alignment.

Science.gov (United States)

Pei, Yuru; Huang, Fengchun; Shi, Fuhao; Zha, Hongbin

2012-08-01

This paper challenges the issue of automatic matching between two image sets with similar intrinsic structures and different appearances, especially when there is no prior correspondence. An unsupervised manifold alignment framework is proposed to establish correspondence between data sets by a mapping function in the mutual embedding space. We introduce a local similarity metric based on parameterized distance curves to represent the connection of one point with the rest of the manifold. A small set of valid feature pairs can be found without manual interactions by matching the distance curve of one manifold with the curve cluster of the other manifold. To avoid potential confusions in image matching, we propose an extended affine transformation to solve the nonrigid alignment in the embedding space. The comparatively tight alignments and the structure preservation can be obtained simultaneously. The point pairs with the minimum distance after alignment are viewed as the matchings. We apply manifold alignment to image set matching problems. The correspondence between image sets of different poses, illuminations, and identities can be established effectively by our approach.

An adaptive clustering algorithm for image matching based on corner feature

Science.gov (United States)

Wang, Zhe; Dong, Min; Mu, Xiaomin; Wang, Song

2018-04-01

The traditional image matching algorithm always can not balance the real-time and accuracy better, to solve the problem, an adaptive clustering algorithm for image matching based on corner feature is proposed in this paper. The method is based on the similarity of the matching pairs of vector pairs, and the adaptive clustering is performed on the matching point pairs. Harris corner detection is carried out first, the feature points of the reference image and the perceived image are extracted, and the feature points of the two images are first matched by Normalized Cross Correlation (NCC) function. Then, using the improved algorithm proposed in this paper, the matching results are clustered to reduce the ineffective operation and improve the matching speed and robustness. Finally, the Random Sample Consensus (RANSAC) algorithm is used to match the matching points after clustering. The experimental results show that the proposed algorithm can effectively eliminate the most wrong matching points while the correct matching points are retained, and improve the accuracy of RANSAC matching, reduce the computation load of whole matching process at the same time.

An Image Matching Method Based on Fourier and LOG-Polar Transform

Directory of Open Access Journals (Sweden)

Zhijia Zhang

2014-04-01

Full Text Available This Traditional template matching methods are not appropriate for the situation of large angle rotation between two images in the online detection for industrial production. Aiming at this problem, Fourier transform algorithm was introduced to correct image rotation angle based on its rotatary invariance in time-frequency domain, orienting image under test in the same direction with reference image, and then match these images using matching algorithm based on log-polar transform. Compared with the current matching algorithms, experimental results show that the proposed algorithm can not only match two images with rotation of arbitrary angle, but also possess a high matching accuracy and applicability. In addition, the validity and reliability of algorithm was verified by simulated matching experiment targeting circular images.

Target matching based on multi-view tracking

Science.gov (United States)

Liu, Yahui; Zhou, Changsheng

2011-01-01

A feature matching method is proposed based on Maximally Stable Extremal Regions (MSER) and Scale Invariant Feature Transform (SIFT) to solve the problem of the same target matching in multiple cameras. Target foreground is extracted by using frame difference twice and bounding box which is regarded as target regions is calculated. Extremal regions are got by MSER. After fitted into elliptical regions, those regions will be normalized into unity circles and represented with SIFT descriptors. Initial matching is obtained from the ratio of the closest distance to second distance less than some threshold and outlier points are eliminated in terms of RANSAC. Experimental results indicate the method can reduce computational complexity effectively and is also adapt to affine transformation, rotation, scale and illumination.

Ontology-based composition and matching for dynamic service coordination

OpenAIRE

Pahl, Claus; Gacitua-Decar, Veronica; Wang, MingXue; Yapa Bandara, Kosala

2011-01-01

Service engineering needs to address integration problems allowing services to collaborate and coordinate. The need to address dynamic automated changes - caused by on-demand environments and changing requirements - can be addressed through service coordination based on ontology-based composition and matching techniques. Our solution to composition and matching utilises a service coordination space that acts as a passive infrastructure for collaboration. We discuss the information models an...

A Polygon and Point-Based Approach to Matching Geospatial Features

Directory of Open Access Journals (Sweden)

Juan J. Ruiz-Lendínez

2017-12-01

Full Text Available A methodology for matching bidimensional entities is presented in this paper. The matching is proposed for both area and point features extracted from geographical databases. The procedure used to obtain homologous entities is achieved in a two-step process: The first matching, polygon to polygon matching (inter-element matching, is obtained by means of a genetic algorithm that allows the classifying of area features from two geographical databases. After this, we apply a point to point matching (intra-element matching based on the comparison of changes in their turning functions. This study shows that genetic algorithms are suitable for matching polygon features even if these features are quite different. Our results show up to 40% of matched polygons with differences in geometrical attributes. With regards to point matching, the vertex from homologous polygons, the function and threshold values proposed in this paper show a useful method for obtaining precise vertex matching.

A FPGA-based architecture for real-time image matching

Science.gov (United States)

Wang, Jianhui; Zhong, Sheng; Xu, Wenhui; Zhang, Weijun; Cao, Zhiguo

2013-10-01

Image matching is a fundamental task in computer vision. It is used to establish correspondence between two images taken at different viewpoint or different time from the same scene. However, its large computational complexity has been a challenge to most embedded systems. This paper proposes a single FPGA-based image matching system, which consists of SIFT feature detection, BRIEF descriptor extraction and BRIEF matching. It optimizes the FPGA architecture for the SIFT feature detection to reduce the FPGA resources utilization. Moreover, we implement BRIEF description and matching on FPGA also. The proposed system can implement image matching at 30fps (frame per second) for 1280x720 images. Its processing speed can meet the demand of most real-life computer vision applications.

A dual-adaptive support-based stereo matching algorithm

Science.gov (United States)

Zhang, Yin; Zhang, Yun

2017-07-01

Many stereo matching algorithms use fixed color thresholds and a rigid cross skeleton to segment supports (viz., Cross method), which, however, does not work well for different images. To address this issue, this paper proposes a novel dual adaptive support (viz., DAS)-based stereo matching method, which uses both appearance and shape information of a local region to segment supports automatically, and, then, integrates the DAS-based cost aggregation with the absolute difference plus census transform cost, scanline optimization and disparity refinement to develop a stereo matching system. The performance of the DAS method is also evaluated in the Middlebury benchmark and by comparing with the Cross method. The results show that the average error for the DAS method 25.06% lower than that for the Cross method, indicating that the proposed method is more accurate, with fewer parameters and suitable for parallel computing.

Dissociating Simon and affordance compatibility effects: silhouettes and photographs.

Science.gov (United States)

Pappas, Zissis

2014-12-01

When a graspable object's handle is oriented to the same side as the response hand, responses are quicker and more accurate than when it is oriented to the opposite side. This effect has been attributed to the affordance of the object's handle (Tucker & Ellis, 1998). Recent findings suggest this effect results instead from an abstract spatial response code (i.e., Simon effect; Cho & Proctor, 2010). However, the stimuli used in these previous studies differ in the amount of object and environmental depth information they contain, which may be critical to conveying an affordance. This information could explain these disparate findings as well as dissociate Simon and affordance compatibility effects. Four experiments demonstrate that the Simon effect results from the absence of this information, as in a silhouette, and the affordance effect results from its presence, as in a photograph. A fifth experiment confirmed that modifying information associated with the affordance, rather than the modification itself, produced the effects observed in the previous experiments. These findings support the following: (a) the internal details of an object and environmental depth can dissociate Simon and affordance compatibility effects, (b) this information is necessary to convey the object's graspable affordance, and (c) the outer shape of the object is not sufficient to elicit an affordance effect. These findings are discussed in relation to the theory of embodied cognition. Copyright © 2014 Elsevier B.V. All rights reserved.

LINE-BASED MULTI-IMAGE MATCHING FOR FAÇADE RECONSTRUCTION

Directory of Open Access Journals (Sweden)

T. A. Teo

2012-07-01

Full Text Available This research integrates existing LOD 2 building models and multiple close-range images for façade structural lines extraction. The major works are orientation determination and multiple image matching. In the orientation determination, Speeded Up Robust Features (SURF is applied to extract tie points automatically. Then, tie points and control points are combined for block adjustment. An object-based multi-images matching is proposed to extract the façade structural lines. The 2D lines in image space are extracted by Canny operator followed by Hough transform. The role of LOD 2 building models is to correct the tilt displacement of image from different views. The wall of LOD 2 model is also used to generate hypothesis planes for similarity measurement. Finally, average normalized cross correlation is calculated to obtain the best location in object space. The test images are acquired by a nonmetric camera Nikon D2X. The total number of image is 33. The experimental results indicate that the accuracy of orientation determination is about 1 pixel from 2515 tie points and 4 control points. It also indicates that line-based matching is more flexible than point-based matching.

Birth weight, body silhouette over the life course, and incident diabetes in 91,453 middle-aged women from the French Etude Epidemiologique de Femmes de la Mutuelle Generale de l'Education Nationale (E3N) Cohort.

Science.gov (United States)

de Lauzon-Guillain, Blandine; Balkau, Beverley; Charles, Marie-Aline; Romieu, Isabelle; Boutron-Ruault, Marie-Christine; Clavel-Chapelon, Françoise

2010-02-01

Obesity and increases in body weight in adults are considered to be among the most important risk factors for type 2 diabetes. Low birth weight is also associated with a higher diabetes incidence. We aimed to examine to what extent the evolution of body shape, from childhood to adulthood, is related to incident diabetes in late adulthood. Etude Epidemiologique de Femmes de la Mutuelle Générale de l'Education Nationale (E3N) is a cohort study of French women born in 1925-1950 and followed by questionnaire every 2 years. At baseline, in 1990, women were asked to report their current weight, height, and body silhouette at various ages. Birth weight was recorded in 2002. Cases of diabetes were self-reported or obtained by drug reimbursement record linkage and further validated. Of the 91,453 women who were nondiabetic at baseline, 2,534 developed diabetes over the 15 years of follow-up. Birth weight and body silhouette at 8 years, at menarche, and in young adulthood (20-25 years) were inversely associated with the risk of diabetes, independently of adult BMI during follow-up (all P(trend) < 0.001). In mid-adulthood (35-40 years), the association was reversed, with an increase in risk related to a larger body silhouette. An increase in body silhouette from childhood to mid-adulthood amplified the risk of diabetes. Low birth weight and thinness until young adulthood may increase the risk of diabetes, independently of adult BMI during follow-up. Young women who were lean children should be especially warned against weight gain.

Fractured reservoir history matching improved based on artificial intelligent

Directory of Open Access Journals (Sweden)

Sayyed Hadi Riazi

2016-12-01

Full Text Available In this paper, a new robust approach based on Least Square Support Vector Machine (LSSVM as a proxy model is used for an automatic fractured reservoir history matching. The proxy model is made to model the history match objective function (mismatch values based on the history data of the field. This model is then used to minimize the objective function through Particle Swarm Optimization (PSO and Imperialist Competitive Algorithm (ICA. In automatic history matching, sensitive analysis is often performed on full simulation model. In this work, to get new range of the uncertain parameters (matching parameters in which the objective function has a minimum value, sensitivity analysis is also performed on the proxy model. By applying the modified ranges to the optimization methods, optimization of the objective function will be faster and outputs of the optimization methods (matching parameters are produced in less time and with high precision. This procedure leads to matching of history of the field in which a set of reservoir parameters is used. The final sets of parameters are then applied for the full simulation model to validate the technique. The obtained results show that the present procedure in this work is effective for history matching process due to its robust dependability and fast convergence speed. Due to high speed and need for small data sets, LSSVM is the best tool to build a proxy model. Also the comparison of PSO and ICA shows that PSO is less time-consuming and more effective.

Content Based Image Matching for Planetary Science

Science.gov (United States)

Deans, M. C.; Meyer, C.

2006-12-01

Planetary missions generate large volumes of data. With the MER rovers still functioning on Mars, PDS contains over 7200 released images from the Microscopic Imagers alone. These data products are only searchable by keys such as the Sol, spacecraft clock, or rover motion counter index, with little connection to the semantic content of the images. We have developed a method for matching images based on the visual textures in images. For every image in a database, a series of filters compute the image response to localized frequencies and orientations. Filter responses are turned into a low dimensional descriptor vector, generating a 37 dimensional fingerprint. For images such as the MER MI, this represents a compression ratio of 99.9965% (the fingerprint is approximately 0.0035% the size of the original image). At query time, fingerprints are quickly matched to find images with similar appearance. Image databases containing several thousand images are preprocessed offline in a matter of hours. Image matches from the database are found in a matter of seconds. We have demonstrated this image matching technique using three sources of data. The first database consists of 7200 images from the MER Microscopic Imager. The second database consists of 3500 images from the Narrow Angle Mars Orbital Camera (MOC-NA), which were cropped into 1024×1024 sub-images for consistency. The third database consists of 7500 scanned archival photos from the Apollo Metric Camera. Example query results from all three data sources are shown. We have also carried out user tests to evaluate matching performance by hand labeling results. User tests verify approximately 20% false positive rate for the top 14 results for MOC NA and MER MI data. This means typically 10 to 12 results out of 14 match the query image sufficiently. This represents a powerful search tool for databases of thousands of images where the a priori match probability for an image might be less than 1%. Qualitatively, correct

Personnel Selection Method Based on Personnel-Job Matching

OpenAIRE

Li Wang; Xilin Hou; Lili Zhang

2013-01-01

The existing personnel selection decisions in practice are based on the evaluation of job seeker's human capital, and it may be difficult to make personnel-job matching and make each party satisfy. Therefore, this paper puts forward a new personnel selection method by consideration of bilateral matching. Starting from the employment thoughts of ¡°satisfy¡±, the satisfaction evaluation indicator system of each party are constructed. The multi-objective optimization model is given according to ...

Towards real-time body pose estimation for presenters in meeting environments

NARCIS (Netherlands)

Poppe, Ronald Walter; Heylen, Dirk K.J.; Nijholt, Antinus; Poel, Mannes

2005-01-01

This paper describes a computer vision-based approach to body pose estimation. The algorithm can be executed in real-time and processes low resolution, monocular image sequences. A silhouette is extracted and matched against a projection of a 16 DOF human body model. In addition, skin color is used

A Multi-Scale Settlement Matching Algorithm Based on ARG

Science.gov (United States)

Yue, Han; Zhu, Xinyan; Chen, Di; Liu, Lingjia

2016-06-01

Homonymous entity matching is an important part of multi-source spatial data integration, automatic updating and change detection. Considering the low accuracy of existing matching methods in dealing with matching multi-scale settlement data, an algorithm based on Attributed Relational Graph (ARG) is proposed. The algorithm firstly divides two settlement scenes at different scales into blocks by small-scale road network and constructs local ARGs in each block. Then, ascertains candidate sets by merging procedures and obtains the optimal matching pairs by comparing the similarity of ARGs iteratively. Finally, the corresponding relations between settlements at large and small scales are identified. At the end of this article, a demonstration is presented and the results indicate that the proposed algorithm is capable of handling sophisticated cases.

A Multi-Scale Settlement Matching Algorithm Based on ARG

Directory of Open Access Journals (Sweden)

H. Yue

2016-06-01

Full Text Available Homonymous entity matching is an important part of multi-source spatial data integration, automatic updating and change detection. Considering the low accuracy of existing matching methods in dealing with matching multi-scale settlement data, an algorithm based on Attributed Relational Graph (ARG is proposed. The algorithm firstly divides two settlement scenes at different scales into blocks by small-scale road network and constructs local ARGs in each block. Then, ascertains candidate sets by merging procedures and obtains the optimal matching pairs by comparing the similarity of ARGs iteratively. Finally, the corresponding relations between settlements at large and small scales are identified. At the end of this article, a demonstration is presented and the results indicate that the proposed algorithm is capable of handling sophisticated cases.

UltiMatch-NL: a Web service matchmaker based on multiple semantic filters.

Science.gov (United States)

Mohebbi, Keyvan; Ibrahim, Suhaimi; Zamani, Mazdak; Khezrian, Mojtaba

2014-01-01

In this paper, a Semantic Web service matchmaker called UltiMatch-NL is presented. UltiMatch-NL applies two filters namely Signature-based and Description-based on different abstraction levels of a service profile to achieve more accurate results. More specifically, the proposed filters rely on semantic knowledge to extract the similarity between a given pair of service descriptions. Thus it is a further step towards fully automated Web service discovery via making this process more semantic-aware. In addition, a new technique is proposed to weight and combine the results of different filters of UltiMatch-NL, automatically. Moreover, an innovative approach is introduced to predict the relevance of requests and Web services and eliminate the need for setting a threshold value of similarity. In order to evaluate UltiMatch-NL, the repository of OWLS-TC is used. The performance evaluation based on standard measures from the information retrieval field shows that semantic matching of OWL-S services can be significantly improved by incorporating designed matching filters.

UltiMatch-NL: A Web Service Matchmaker Based on Multiple Semantic Filters

Science.gov (United States)

Mohebbi, Keyvan; Ibrahim, Suhaimi; Zamani, Mazdak; Khezrian, Mojtaba

2014-01-01

In this paper, a Semantic Web service matchmaker called UltiMatch-NL is presented. UltiMatch-NL applies two filters namely Signature-based and Description-based on different abstraction levels of a service profile to achieve more accurate results. More specifically, the proposed filters rely on semantic knowledge to extract the similarity between a given pair of service descriptions. Thus it is a further step towards fully automated Web service discovery via making this process more semantic-aware. In addition, a new technique is proposed to weight and combine the results of different filters of UltiMatch-NL, automatically. Moreover, an innovative approach is introduced to predict the relevance of requests and Web services and eliminate the need for setting a threshold value of similarity. In order to evaluate UltiMatch-NL, the repository of OWLS-TC is used. The performance evaluation based on standard measures from the information retrieval field shows that semantic matching of OWL-S services can be significantly improved by incorporating designed matching filters. PMID:25157872

Matching biomedical ontologies based on formal concept analysis.

Science.gov (United States)

Zhao, Mengyi; Zhang, Songmao; Li, Weizhuo; Chen, Guowei

2018-03-19

The goal of ontology matching is to identify correspondences between entities from different yet overlapping ontologies so as to facilitate semantic integration, reuse and interoperability. As a well developed mathematical model for analyzing individuals and structuring concepts, Formal Concept Analysis (FCA) has been applied to ontology matching (OM) tasks since the beginning of OM research, whereas ontological knowledge exploited in FCA-based methods is limited. This motivates the study in this paper, i.e., to empower FCA with as much as ontological knowledge as possible for identifying mappings across ontologies. We propose a method based on Formal Concept Analysis to identify and validate mappings across ontologies, including one-to-one mappings, complex mappings and correspondences between object properties. Our method, called FCA-Map, incrementally generates a total of five types of formal contexts and extracts mappings from the lattices derived. First, the token-based formal context describes how class names, labels and synonyms share lexical tokens, leading to lexical mappings (anchors) across ontologies. Second, the relation-based formal context describes how classes are in taxonomic, partonomic and disjoint relationships with the anchors, leading to positive and negative structural evidence for validating the lexical matching. Third, the positive relation-based context can be used to discover structural mappings. Afterwards, the property-based formal context describes how object properties are used in axioms to connect anchor classes across ontologies, leading to property mappings. Last, the restriction-based formal context describes co-occurrence of classes across ontologies in anonymous ancestors of anchors, from which extended structural mappings and complex mappings can be identified. Evaluation on the Anatomy, the Large Biomedical Ontologies, and the Disease and Phenotype track of the 2016 Ontology Alignment Evaluation Initiative campaign

FINGERPRINT MATCHING BASED ON PORE CENTROIDS

Directory of Open Access Journals (Sweden)

S. Malathi

2011-05-01

Full Text Available In recent years there has been exponential growth in the use of bio- metrics for user authentication applications. Automated Fingerprint Identification systems have become popular tool in many security and law enforcement applications. Most of these systems rely on minutiae (ridge ending and bifurcation features. With the advancement in sensor technology, high resolution fingerprint images (1000 dpi pro- vide micro level of features (pores that have proven to be useful fea- tures for identification. In this paper, we propose a new strategy for fingerprint matching based on pores by reliably extracting the pore features The extraction of pores is done by Marker Controlled Wa- tershed segmentation method and the centroids of each pore are con- sidered as feature vectors for matching of two fingerprint images. Experimental results shows that the proposed method has better per- formance with lower false rates and higher accuracy.

SAD-Based Stereo Matching Using FPGAs

Science.gov (United States)

Ambrosch, Kristian; Humenberger, Martin; Kubinger, Wilfried; Steininger, Andreas

In this chapter we present a field-programmable gate array (FPGA) based stereo matching architecture. This architecture uses the sum of absolute differences (SAD) algorithm and is targeted at automotive and robotics applications. The disparity maps are calculated using 450×375 input images and a disparity range of up to 150 pixels. We discuss two different implementation approaches for the SAD and analyze their resource usage. Furthermore, block sizes ranging from 3×3 up to 11×11 and their impact on the consumed logic elements as well as on the disparity map quality are discussed. The stereo matching architecture enables a frame rate of up to 600 fps by calculating the data in a highly parallel and pipelined fashion. This way, a software solution optimized by using Intel's Open Source Computer Vision Library running on an Intel Pentium 4 with 3 GHz clock frequency is outperformed by a factor of 400.

Improved artificial bee colony algorithm based gravity matching navigation method.

Science.gov (United States)

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.

Local coding based matching kernel method for image classification.

Directory of Open Access Journals (Sweden)

Yan Song

Full Text Available This paper mainly focuses on how to effectively and efficiently measure visual similarity for local feature based representation. Among existing methods, metrics based on Bag of Visual Word (BoV techniques are efficient and conceptually simple, at the expense of effectiveness. By contrast, kernel based metrics are more effective, but at the cost of greater computational complexity and increased storage requirements. We show that a unified visual matching framework can be developed to encompass both BoV and kernel based metrics, in which local kernel plays an important role between feature pairs or between features and their reconstruction. Generally, local kernels are defined using Euclidean distance or its derivatives, based either explicitly or implicitly on an assumption of Gaussian noise. However, local features such as SIFT and HoG often follow a heavy-tailed distribution which tends to undermine the motivation behind Euclidean metrics. Motivated by recent advances in feature coding techniques, a novel efficient local coding based matching kernel (LCMK method is proposed. This exploits the manifold structures in Hilbert space derived from local kernels. The proposed method combines advantages of both BoV and kernel based metrics, and achieves a linear computational complexity. This enables efficient and scalable visual matching to be performed on large scale image sets. To evaluate the effectiveness of the proposed LCMK method, we conduct extensive experiments with widely used benchmark datasets, including 15-Scenes, Caltech101/256, PASCAL VOC 2007 and 2011 datasets. Experimental results confirm the effectiveness of the relatively efficient LCMK method.

Gun bore flaw image matching based on improved SIFT descriptor

Science.gov (United States)

Zeng, Luan; Xiong, Wei; Zhai, You

2013-01-01

In order to increase the operation speed and matching ability of SIFT algorithm, the SIFT descriptor and matching strategy are improved. First, a method of constructing feature descriptor based on sector area is proposed. By computing the gradients histogram of location bins which are parted into 6 sector areas, a descriptor with 48 dimensions is constituted. It can reduce the dimension of feature vector and decrease the complexity of structuring descriptor. Second, it introduce a strategy that partitions the circular region into 6 identical sector areas starting from the dominate orientation. Consequently, the computational complexity is reduced due to cancellation of rotation operation for the area. The experimental results indicate that comparing with the OpenCV SIFT arithmetic, the average matching speed of the new method increase by about 55.86%. The matching veracity can be increased even under some variation of view point, illumination, rotation, scale and out of focus. The new method got satisfied results in gun bore flaw image matching. Keywords: Metrology, Flaw image matching, Gun bore, Feature descriptor

MATCHING AERIAL IMAGES TO 3D BUILDING MODELS BASED ON CONTEXT-BASED GEOMETRIC HASHING

Directory of Open Access Journals (Sweden)

J. Jung

2016-06-01

Full Text Available In this paper, a new model-to-image framework to automatically align a single airborne image with existing 3D building models using geometric hashing is proposed. As a prerequisite process for various applications such as data fusion, object tracking, change detection and texture mapping, the proposed registration method is used for determining accurate exterior orientation parameters (EOPs of a single image. This model-to-image matching process consists of three steps: 1 feature extraction, 2 similarity measure and matching, and 3 adjustment of EOPs of a single image. For feature extraction, we proposed two types of matching cues, edged corner points representing the saliency of building corner points with associated edges and contextual relations among the edged corner points within an individual roof. These matching features are extracted from both 3D building and a single airborne image. A set of matched corners are found with given proximity measure through geometric hashing and optimal matches are then finally determined by maximizing the matching cost encoding contextual similarity between matching candidates. Final matched corners are used for adjusting EOPs of the single airborne image by the least square method based on co-linearity equations. The result shows that acceptable accuracy of single image's EOP can be achievable by the proposed registration approach as an alternative to labour-intensive manual registration process.

Robust, Efficient Depth Reconstruction With Hierarchical Confidence-Based Matching.

Science.gov (United States)

Sun, Li; Chen, Ke; Song, Mingli; Tao, Dacheng; Chen, Gang; Chen, Chun

2017-07-01

In recent years, taking photos and capturing videos with mobile devices have become increasingly popular. Emerging applications based on the depth reconstruction technique have been developed, such as Google lens blur. However, depth reconstruction is difficult due to occlusions, non-diffuse surfaces, repetitive patterns, and textureless surfaces, and it has become more difficult due to the unstable image quality and uncontrolled scene condition in the mobile setting. In this paper, we present a novel hierarchical framework with multi-view confidence-based matching for robust, efficient depth reconstruction in uncontrolled scenes. Particularly, the proposed framework combines local cost aggregation with global cost optimization in a complementary manner that increases efficiency and accuracy. A depth map is efficiently obtained in a coarse-to-fine manner by using an image pyramid. Moreover, confidence maps are computed to robustly fuse multi-view matching cues, and to constrain the stereo matching on a finer scale. The proposed framework has been evaluated with challenging indoor and outdoor scenes, and has achieved robust and efficient depth reconstruction.

Physics-based shape matching for intraoperative image guidance

Energy Technology Data Exchange (ETDEWEB)

Suwelack, Stefan, E-mail: suwelack@kit.edu; Röhl, Sebastian; Bodenstedt, Sebastian; Reichard, Daniel; Dillmann, Rüdiger; Speidel, Stefanie [Institute for Anthropomatics and Robotics, Karlsruhe Institute of Technology, Adenauerring 2, Karlsruhe 76131 (Germany); Santos, Thiago dos; Maier-Hein, Lena [Computer-assisted Interventions, German Cancer Research Center (DKFZ), Im Neuenheimer Feld 280, Heidelberg 69120 (Germany); Wagner, Martin; Wünscher, Josephine; Kenngott, Hannes; Müller, Beat P. [General, Visceral and Transplantation Surgery, Heidelberg University Hospital, Im Neuenheimer Feld 110, Heidelberg 69120 (Germany)

2014-11-01

Purpose: Soft-tissue deformations can severely degrade the validity of preoperative planning data during computer assisted interventions. Intraoperative imaging such as stereo endoscopic, time-of-flight or, laser range scanner data can be used to compensate these movements. In this context, the intraoperative surface has to be matched to the preoperative model. The shape matching is especially challenging in the intraoperative setting due to noisy sensor data, only partially visible surfaces, ambiguous shape descriptors, and real-time requirements. Methods: A novel physics-based shape matching (PBSM) approach to register intraoperatively acquired surface meshes to preoperative planning data is proposed. The key idea of the method is to describe the nonrigid registration process as an electrostatic–elastic problem, where an elastic body (preoperative model) that is electrically charged slides into an oppositely charged rigid shape (intraoperative surface). It is shown that the corresponding energy functional can be efficiently solved using the finite element (FE) method. It is also demonstrated how PBSM can be combined with rigid registration schemes for robust nonrigid registration of arbitrarily aligned surfaces. Furthermore, it is shown how the approach can be combined with landmark based methods and outline its application to image guidance in laparoscopic interventions. Results: A profound analysis of the PBSM scheme based on in silico and phantom data is presented. Simulation studies on several liver models show that the approach is robust to the initial rigid registration and to parameter variations. The studies also reveal that the method achieves submillimeter registration accuracy (mean error between 0.32 and 0.46 mm). An unoptimized, single core implementation of the approach achieves near real-time performance (2 TPS, 7–19 s total registration time). It outperforms established methods in terms of speed and accuracy. Furthermore, it is shown that the

A Spherical Model Based Keypoint Descriptor and Matching Algorithm for Omnidirectional Images

Directory of Open Access Journals (Sweden)

Guofeng Tong

2014-04-01

Full Text Available Omnidirectional images generally have nonlinear distortion in radial direction. Unfortunately, traditional algorithms such as scale-invariant feature transform (SIFT and Descriptor-Nets (D-Nets do not work well in matching omnidirectional images just because they are incapable of dealing with the distortion. In order to solve this problem, a new voting algorithm is proposed based on the spherical model and the D-Nets algorithm. Because the spherical-based keypoint descriptor contains the distortion information of omnidirectional images, the proposed matching algorithm is invariant to distortion. Keypoint matching experiments are performed on three pairs of omnidirectional images, and comparison is made among the proposed algorithm, the SIFT and the D-Nets. The result shows that the proposed algorithm is more robust and more precise than the SIFT, and the D-Nets in matching omnidirectional images. Comparing with the SIFT and the D-Nets, the proposed algorithm has two main advantages: (a there are more real matching keypoints; (b the coverage range of the matching keypoints is wider, including the seriously distorted areas.

Spectral matching research for light-emitting diode-based neonatal jaundice therapeutic device light source

Science.gov (United States)

Gan, Ruting; Guo, Zhenning; Lin, Jieben

2015-09-01

To decrease the risk of bilirubin encephalopathy and minimize the need for exchange transfusions, we report a novel design for light source of light-emitting diode (LED)-based neonatal jaundice therapeutic device (NJTD). The bilirubin absorption spectrum in vivo was regarded as target. Based on spectral constructing theory, we used commercially available LEDs with different peak wavelengths and full width at half maximum as matching light sources. Simple genetic algorithm was first proposed as the spectral matching method. The required LEDs number at each peak wavelength was calculated, and then, the commercial light source sample model of the device was fabricated to confirm the spectral matching technology. In addition, the corresponding spectrum was measured and the effect was analyzed finally. The results showed that fitted spectrum was very similar to the target spectrum with 98.86 % matching degree, and the actual device model has a spectrum close to the target with 96.02 % matching degree. With higher fitting degree and efficiency, this matching algorithm is very suitable for light source matching technology of LED-based spectral distribution, and bilirubin absorption spectrum in vivo will be auspicious candidate for the target spectrum of new LED-based NJTD light source.

Appearance-Based Multimodal Human Tracking and Identification for Healthcare in the Digital Home

Directory of Open Access Journals (Sweden)

Mau-Tsuen Yang

2014-08-01

Full Text Available There is an urgent need for intelligent home surveillance systems to provide home security, monitor health conditions, and detect emergencies of family members. One of the fundamental problems to realize the power of these intelligent services is how to detect, track, and identify people at home. Compared to RFID tags that need to be worn all the time, vision-based sensors provide a natural and nonintrusive solution. Observing that body appearance and body build, as well as face, provide valuable cues for human identification, we model and record multi-view faces, full-body colors and shapes of family members in an appearance database by using two Kinects located at a home’s entrance. Then the Kinects and another set of color cameras installed in other parts of the house are used to detect, track, and identify people by matching the captured color images with the registered templates in the appearance database. People are detected and tracked by multisensor fusion (Kinects and color cameras using a Kalman filter that can handle duplicate or partial measurements. People are identified by multimodal fusion (face, body appearance, and silhouette using a track-based majority voting. Moreover, the appearance-based human detection, tracking, and identification modules can cooperate seamlessly and benefit from each other. Experimental results show the effectiveness of the human tracking across multiple sensors and human identification considering the information of multi-view faces, full-body clothes, and silhouettes. The proposed home surveillance system can be applied to domestic applications in digital home security and intelligent healthcare.

CP-ABE Based Privacy-Preserving User Profile Matching in Mobile Social Networks.

Directory of Open Access Journals (Sweden)

Weirong Cui

Full Text Available Privacy-preserving profile matching, a challenging task in mobile social networks, is getting more attention in recent years. In this paper, we propose a novel scheme that is based on ciphertext-policy attribute-based encryption to tackle this problem. In our scheme, a user can submit a preference-profile and search for users with matching-profile in decentralized mobile social networks. In this process, no participant's profile and the submitted preference-profile is exposed. Meanwhile, a secure communication channel can be established between the pair of successfully matched users. In contrast to existing related schemes which are mainly based on the secure multi-party computation, our scheme can provide verifiability (both the initiator and any unmatched user cannot cheat each other to pretend to be matched, and requires few interactions among users. We provide thorough security analysis and performance evaluation on our scheme, and show its advantages in terms of security, efficiency and usability over state-of-the-art schemes.

CP-ABE Based Privacy-Preserving User Profile Matching in Mobile Social Networks.

Science.gov (United States)

Cui, Weirong; Du, Chenglie; Chen, Jinchao

2016-01-01

Privacy-preserving profile matching, a challenging task in mobile social networks, is getting more attention in recent years. In this paper, we propose a novel scheme that is based on ciphertext-policy attribute-based encryption to tackle this problem. In our scheme, a user can submit a preference-profile and search for users with matching-profile in decentralized mobile social networks. In this process, no participant's profile and the submitted preference-profile is exposed. Meanwhile, a secure communication channel can be established between the pair of successfully matched users. In contrast to existing related schemes which are mainly based on the secure multi-party computation, our scheme can provide verifiability (both the initiator and any unmatched user cannot cheat each other to pretend to be matched), and requires few interactions among users. We provide thorough security analysis and performance evaluation on our scheme, and show its advantages in terms of security, efficiency and usability over state-of-the-art schemes.

Robust Point Matching for Non-Rigid Shapes: A Relaxation Labeling Based Approach

National Research Council Canada - National Science Library

Zheng, Yefeng; Doermann, David S

2004-01-01

.... Based on this observation, we formulate point matching as a graph matching problem. Each point is a node in the graph, and two nodes are connected by an edge if their Euclidean distance is less...

Stereo matching based on SIFT descriptor with illumination and camera invariance

Science.gov (United States)

Niu, Haitao; Zhao, Xunjie; Li, Chengjin; Peng, Xiang

2010-10-01

Stereo matching is the process of finding corresponding points in two or more images. The description of interest points is a critical aspect of point correspondence which is vital in stereo matching. SIFT descriptor has been proven to be better on the distinctiveness and robustness than other local descriptors. However, SIFT descriptor does not involve color information of feature point which provides powerfully distinguishable feature in matching tasks. Furthermore, in a real scene, image color are affected by various geometric and radiometric factors,such as gamma correction and exposure. These situations are very common in stereo images. For this reason, the color recorded by a camera is not a reliable cue, and the color consistency assumption is no longer valid between stereo images in real scenes. Hence the performance of other SIFT-based stereo matching algorithms can be severely degraded under the radiometric variations. In this paper, we present a new improved SIFT stereo matching algorithms that is invariant to various radiometric variations between left and right images. Unlike other improved SIFT stereo matching algorithms, we explicitly employ the color formation model with the parameters of lighting geometry, illuminant color and camera gamma in SIFT descriptor. Firstly, we transform the input color images to log-chromaticity color space, thus a linear relationship can be established. Then, we use a log-polar histogram to build three color invariance components for SIFT descriptor. So that our improved SIFT descriptor is invariant to lighting geometry, illuminant color and camera gamma changes between left and right images. Then we can match feature points between two images and use SIFT descriptor Euclidean distance as a geometric measure in our data sets to make it further accurate and robust. Experimental results show that our method is superior to other SIFT-based algorithms including conventional stereo matching algorithms under various

MatchGUI: A Graphical MATLAB-Based Tool for Automatic Image Co-Registration

Science.gov (United States)

Ansar, Adnan I.

2011-01-01

MatchGUI software, based on MATLAB, automatically matches two images and displays the match result by superimposing one image on the other. A slider bar allows focus to shift between the two images. There are tools for zoom, auto-crop to overlap region, and basic image markup. Given a pair of ortho-rectified images (focused primarily on Mars orbital imagery for now), this software automatically co-registers the imagery so that corresponding image pixels are aligned. MatchGUI requires minimal user input, and performs a registration over scale and inplane rotation fully automatically

Thermal-depth matching in dynamic scene based on affine projection and feature registration

Science.gov (United States)

Wang, Hongyu; Jia, Tong; Wu, Chengdong; Li, Yongqiang

2018-03-01

This paper aims to study the construction of 3D temperature distribution reconstruction system based on depth and thermal infrared information. Initially, a traditional calibration method cannot be directly used, because the depth and thermal infrared camera is not sensitive to the color calibration board. Therefore, this paper aims to design a depth and thermal infrared camera calibration board to complete the calibration of the depth and thermal infrared camera. Meanwhile a local feature descriptors in thermal and depth images is proposed. The belief propagation matching algorithm is also investigated based on the space affine transformation matching and local feature matching. The 3D temperature distribution model is built based on the matching of 3D point cloud and 2D thermal infrared information. Experimental results show that the method can accurately construct the 3D temperature distribution model, and has strong robustness.

Gait Recognition Based on Outermost Contour

Directory of Open Access Journals (Sweden)

Lili Liu

2011-10-01

Full Text Available Gait recognition aims to identify people by the way they walk. In this paper, a simple but e ective gait recognition method based on Outermost Contour is proposed. For each gait image sequence, an adaptive silhouette extraction algorithm is firstly used to segment the frames of the sequence and a series of postprocessing is applied to obtain the normalized silhouette images with less noise. Then a novel feature extraction method based on Outermost Contour is performed. Principal Component Analysis (PCA is adopted to reduce the dimensionality of the distance signals derived from the Outermost Contours of silhouette images. Then Multiple Discriminant Analysis (MDA is used to optimize the separability of gait features belonging to di erent classes. Nearest Neighbor (NN classifier and Nearest Neighbor classifier with respect to class Exemplars (ENN are used to classify the final feature vectors produced by MDA. In order to verify the e ectiveness and robustness of our feature extraction algorithm, we also use two other classifiers: Backpropagation Neural Network (BPNN and Support Vector Machine (SVM for recognition. Experimental results on a gait database of 100 people show that the accuracy of using MDA, BPNN and SVM can achieve 97.67%, 94.33% and 94.67%, respectively.

Fuzzy Matching Based on Gray-scale Difference for Quantum Images

Science.gov (United States)

Luo, GaoFeng; Zhou, Ri-Gui; Liu, XingAo; Hu, WenWen; Luo, Jia

2018-05-01

Quantum image processing has recently emerged as an essential problem in practical tasks, e.g. real-time image matching. Previous studies have shown that the superposition and entanglement of quantum can greatly improve the efficiency of complex image processing. In this paper, a fuzzy quantum image matching scheme based on gray-scale difference is proposed to find out the target region in a reference image, which is very similar to the template image. Firstly, we employ the proposed enhanced quantum representation (NEQR) to store digital images. Then some certain quantum operations are used to evaluate the gray-scale difference between two quantum images by thresholding. If all of the obtained gray-scale differences are not greater than the threshold value, it indicates a successful fuzzy matching of quantum images. Theoretical analysis and experiments show that the proposed scheme performs fuzzy matching at a low cost and also enables exponentially significant speedup via quantum parallel computation.

Stereo Matching Based On Election Campaign Algorithm

Directory of Open Access Journals (Sweden)

Xie Qing Hua

2016-01-01

Full Text Available Stereo matching is one of the significant problems in the study of the computer vision. By getting the distance information through pixels, it is possible to reproduce a three-dimensional stereo. In this paper, the edges are the primitives for matching, the grey values of the edges and the magnitude and direction of the edge gradient were figured out as the properties of the edge feature points, according to the constraints for stereo matching, the energy function was built for finding the route minimizing by election campaign optimization algorithm during the process of stereo matching was applied to this problem the energy function. Experiment results show that this algorithm is more stable and it can get the matching result with better accuracy.

A long baseline global stereo matching based upon short baseline estimation

Science.gov (United States)

Li, Jing; Zhao, Hong; Li, Zigang; Gu, Feifei; Zhao, Zixin; Ma, Yueyang; Fang, Meiqi

2018-05-01

In global stereo vision, balancing the matching efficiency and computing accuracy seems to be impossible because they contradict each other. In the case of a long baseline, this contradiction becomes more prominent. In order to solve this difficult problem, this paper proposes a novel idea to improve both the efficiency and accuracy in global stereo matching for a long baseline. In this way, the reference images located between the long baseline image pairs are firstly chosen to form the new image pairs with short baselines. The relationship between the disparities of pixels in the image pairs with different baselines is revealed by considering the quantized error so that the disparity search range under the long baseline can be reduced by guidance of the short baseline to gain matching efficiency. Then, the novel idea is integrated into the graph cuts (GCs) to form a multi-step GC algorithm based on the short baseline estimation, by which the disparity map under the long baseline can be calculated iteratively on the basis of the previous matching. Furthermore, the image information from the pixels that are non-occluded under the short baseline but are occluded for the long baseline can be employed to improve the matching accuracy. Although the time complexity of the proposed method depends on the locations of the chosen reference images, it is usually much lower for a long baseline stereo matching than when using the traditional GC algorithm. Finally, the validity of the proposed method is examined by experiments based on benchmark datasets. The results show that the proposed method is superior to the traditional GC method in terms of efficiency and accuracy, and thus it is suitable for long baseline stereo matching.

AN INTEGRATED RANSAC AND GRAPH BASED MISMATCH ELIMINATION APPROACH FOR WIDE-BASELINE IMAGE MATCHING

Directory of Open Access Journals (Sweden)

M. Hasheminasab

2015-12-01

Full Text Available In this paper we propose an integrated approach in order to increase the precision of feature point matching. Many different algorithms have been developed as to optimizing the short-baseline image matching while because of illumination differences and viewpoints changes, wide-baseline image matching is so difficult to handle. Fortunately, the recent developments in the automatic extraction of local invariant features make wide-baseline image matching possible. The matching algorithms which are based on local feature similarity principle, using feature descriptor as to establish correspondence between feature point sets. To date, the most remarkable descriptor is the scale-invariant feature transform (SIFT descriptor , which is invariant to image rotation and scale, and it remains robust across a substantial range of affine distortion, presence of noise, and changes in illumination. The epipolar constraint based on RANSAC (random sample consensus method is a conventional model for mismatch elimination, particularly in computer vision. Because only the distance from the epipolar line is considered, there are a few false matches in the selected matching results based on epipolar geometry and RANSAC. Aguilariu et al. proposed Graph Transformation Matching (GTM algorithm to remove outliers which has some difficulties when the mismatched points surrounded by the same local neighbor structure. In this study to overcome these limitations, which mentioned above, a new three step matching scheme is presented where the SIFT algorithm is used to obtain initial corresponding point sets. In the second step, in order to reduce the outliers, RANSAC algorithm is applied. Finally, to remove the remained mismatches, based on the adjacent K-NN graph, the GTM is implemented. Four different close range image datasets with changes in viewpoint are utilized to evaluate the performance of the proposed method and the experimental results indicate its robustness and

A Learning-Based Steganalytic Method against LSB Matching Steganography

Directory of Open Access Journals (Sweden)

Z. Xia

2011-04-01

Full Text Available This paper considers the detection of spatial domain least significant bit (LSB matching steganography in gray images. Natural images hold some inherent properties, such as histogram, dependence between neighboring pixels, and dependence among pixels that are not adjacent to each other. These properties are likely to be disturbed by LSB matching. Firstly, histogram will become smoother after LSB matching. Secondly, the two kinds of dependence will be weakened by the message embedding. Accordingly, three features, which are respectively based on image histogram, neighborhood degree histogram and run-length histogram, are extracted at first. Then, support vector machine is utilized to learn and discriminate the difference of features between cover and stego images. Experimental results prove that the proposed method possesses reliable detection ability and outperforms the two previous state-of-the-art methods. Further more, the conclusions are drawn by analyzing the individual performance of three features and their fused feature.

Visual Localization across Seasons Using Sequence Matching Based on Multi-Feature Combination.

Science.gov (United States)

Qiao, Yongliang

2017-10-25

Visual localization is widely used in autonomous navigation system and Advanced Driver Assistance Systems (ADAS). However, visual-based localization in seasonal changing situations is one of the most challenging topics in computer vision and the intelligent vehicle community. The difficulty of this task is related to the strong appearance changes that occur in scenes due to weather or season changes. In this paper, a place recognition based visual localization method is proposed, which realizes the localization by identifying previously visited places using the sequence matching method. It operates by matching query image sequences to an image database acquired previously (video acquired during traveling period). In this method, in order to improve matching accuracy, multi-feature is constructed by combining a global GIST descriptor and local binary feature CSLBP (Center-symmetric local binary patterns) to represent image sequence. Then, similarity measurement according to Chi-square distance is used for effective sequences matching. For experimental evaluation, the relationship between image sequence length and sequences matching performance is studied. To show its effectiveness, the proposed method is tested and evaluated in four seasons outdoor environments. The results have shown improved precision-recall performance against the state-of-the-art SeqSLAM algorithm.

Design and development of PLC based offline impedance matching system for ICRH experiment

International Nuclear Information System (INIS)

Joshi, Ramesh; Jadav, H.M.; Mali, Aniruddh; Kulkarni, S.V.

2015-01-01

Ion Cyclotron Resonance Heating (ICRH) transmission line has two impedance matching networks, one for offline matching which has been employed before experimental shot. Another is online impedance matching which has been employed during experimental shot. Offline matching network consists of two static stubs, coarse tuner and coarse phase shifter identical in both transmission lines. There are motorized arrangement installed in each stubs and phase shifters. Both stubs are being used to vary transmission line length. Phase shifter is used to match the frequency of generated RF power. Programmable Logic Controller (PLC) based automation and control technique has been designed and developed for the system. Offline matching should be operated below 1 kHz frequency in order to move stepper motors. Program generates required square pulses which employed to motor controller to move either in upward or downward direction. In existing system this operation has been carried out using VME. To reduce the load on VME, PLC based system has been designed and integrated with main DAC system. WinCC software has been used (as SCADA/HMI) to develop front end GUI which communicates with OPC server. Further, OPC communicates with PLC for control of motorized arrangement. This paper describes technical details,design and development of PLC based offline matching system using WinCC as user interface. The communication between WinCC application and hardware devices was realized by OPC technique. The developed system has friendly graphical user interface, high-level automation and comprehensive function such as experimental process control. The system was proved to be reliable and accurate in practical application. (author)

MOCC: A Fast and Robust Correlation-Based Method for Interest Point Matching under Large Scale Changes

Science.gov (United States)

Zhao, Feng; Huang, Qingming; Wang, Hao; Gao, Wen

2010-12-01

Similarity measures based on correlation have been used extensively for matching tasks. However, traditional correlation-based image matching methods are sensitive to rotation and scale changes. This paper presents a fast correlation-based method for matching two images with large rotation and significant scale changes. Multiscale oriented corner correlation (MOCC) is used to evaluate the degree of similarity between the feature points. The method is rotation invariant and capable of matching image pairs with scale changes up to a factor of 7. Moreover, MOCC is much faster in comparison with the state-of-the-art matching methods. Experimental results on real images show the robustness and effectiveness of the proposed method.

Visual color matching system based on RGB LED light source

Science.gov (United States)

Sun, Lei; Huang, Qingmei; Feng, Chen; Li, Wei; Wang, Chaofeng

2018-01-01

In order to study the property and performance of LED as RGB primary color light sources on color mixture in visual psychophysical experiments, and to find out the difference between LED light source and traditional light source, a visual color matching experiment system based on LED light sources as RGB primary colors has been built. By simulating traditional experiment of metameric color matching in CIE 1931 RGB color system, it can be used for visual color matching experiments to obtain a set of the spectral tristimulus values which we often call color-matching functions (CMFs). This system consists of three parts: a monochromatic light part using blazed grating, a light mixing part where the summation of 3 LED illuminations are to be visually matched with a monochromatic illumination, and a visual observation part. The three narrow band LEDs used have dominant wavelengths of 640 nm (red), 522 nm (green) and 458 nm (blue) respectively and their intensities can be controlled independently. After the calibration of wavelength and luminance of LED sources with a spectrophotometer, a series of visual color matching experiments have been carried out by 5 observers. The results are compared with those from CIE 1931 RGB color system, and have been used to compute an average locus for the spectral colors in the color triangle, with white at the center. It has been shown that the use of LED is feasible and has the advantages of easy control, good stability and low cost.

Robust multiple cue fusion-based high-speed and nonrigid object tracking algorithm for short track speed skating

Science.gov (United States)

Liu, Chenguang; Cheng, Heng-Da; Zhang, Yingtao; Wang, Yuxuan; Xian, Min

2016-01-01

This paper presents a methodology for tracking multiple skaters in short track speed skating competitions. Nonrigid skaters move at high speed with severe occlusions happening frequently among them. The camera is panned quickly in order to capture the skaters in a large and dynamic scene. To automatically track the skaters and precisely output their trajectories becomes a challenging task in object tracking. We employ the global rink information to compensate camera motion and obtain the global spatial information of skaters, utilize random forest to fuse multiple cues and predict the blob of each skater, and finally apply a silhouette- and edge-based template-matching and blob-evolving method to labelling pixels to a skater. The effectiveness and robustness of the proposed method are verified through thorough experiments.

Multiple Constraints Based Robust Matching of Poor-Texture Close-Range Images for Monitoring a Simulated Landslide

Directory of Open Access Journals (Sweden)

Gang Qiao

2016-05-01

Full Text Available Landslides are one of the most destructive geo-hazards that can bring about great threats to both human lives and infrastructures. Landslide monitoring has been always a research hotspot. In particular, landslide simulation experimentation is an effective tool in landslide research to obtain critical parameters that help understand the mechanism and evaluate the triggering and controlling factors of slope failure. Compared with other traditional geotechnical monitoring approaches, the close-range photogrammetry technique shows potential in tracking and recording the 3D surface deformation and failure processes. In such cases, image matching usually plays a critical role in stereo image processing for the 3D geometric reconstruction. However, the complex imaging conditions such as rainfall, mass movement, illumination, and ponding will reduce the texture quality of the stereo images, bringing about difficulties in the image matching process and resulting in very sparse matches. To address this problem, this paper presents a multiple-constraints based robust image matching approach for poor-texture close-range images particularly useful in monitoring a simulated landslide. The Scale Invariant Feature Transform (SIFT algorithm was first applied to the stereo images for generation of scale-invariate feature points, followed by a two-step matching process: feature-based image matching and area-based image matching. In the first feature-based matching step, the triangulation process was performed based on the SIFT matches filtered by the Fundamental Matrix (FM and a robust checking procedure, to serve as the basic constraints for feature-based iterated matching of all the non-matched SIFT-derived feature points inside each triangle. In the following area-based image-matching step, the corresponding points of the non-matched features in each triangle of the master image were predicted in the homologous triangle of the searching image by using geometric

Matching Aerial Images to 3D Building Models Using Context-Based Geometric Hashing

Directory of Open Access Journals (Sweden)

Jaewook Jung

2016-06-01

Full Text Available A city is a dynamic entity, which environment is continuously changing over time. Accordingly, its virtual city models also need to be regularly updated to support accurate model-based decisions for various applications, including urban planning, emergency response and autonomous navigation. A concept of continuous city modeling is to progressively reconstruct city models by accommodating their changes recognized in spatio-temporal domain, while preserving unchanged structures. A first critical step for continuous city modeling is to coherently register remotely sensed data taken at different epochs with existing building models. This paper presents a new model-to-image registration method using a context-based geometric hashing (CGH method to align a single image with existing 3D building models. This model-to-image registration process consists of three steps: (1 feature extraction; (2 similarity measure; and matching, and (3 estimating exterior orientation parameters (EOPs of a single image. For feature extraction, we propose two types of matching cues: edged corner features representing the saliency of building corner points with associated edges, and contextual relations among the edged corner features within an individual roof. A set of matched corners are found with given proximity measure through geometric hashing, and optimal matches are then finally determined by maximizing the matching cost encoding contextual similarity between matching candidates. Final matched corners are used for adjusting EOPs of the single airborne image by the least square method based on collinearity equations. The result shows that acceptable accuracy of EOPs of a single image can be achievable using the proposed registration approach as an alternative to a labor-intensive manual registration process.

Visual Localization across Seasons Using Sequence Matching Based on Multi-Feature Combination

Directory of Open Access Journals (Sweden)

Yongliang Qiao

2017-10-01

Full Text Available Visual localization is widely used in autonomous navigation system and Advanced Driver Assistance Systems (ADAS. However, visual-based localization in seasonal changing situations is one of the most challenging topics in computer vision and the intelligent vehicle community. The difficulty of this task is related to the strong appearance changes that occur in scenes due to weather or season changes. In this paper, a place recognition based visual localization method is proposed, which realizes the localization by identifying previously visited places using the sequence matching method. It operates by matching query image sequences to an image database acquired previously (video acquired during traveling period. In this method, in order to improve matching accuracy, multi-feature is constructed by combining a global GIST descriptor and local binary feature CSLBP (Center-symmetric local binary patterns to represent image sequence. Then, similarity measurement according to Chi-square distance is used for effective sequences matching. For experimental evaluation, the relationship between image sequence length and sequences matching performance is studied. To show its effectiveness, the proposed method is tested and evaluated in four seasons outdoor environments. The results have shown improved precision–recall performance against the state-of-the-art SeqSLAM algorithm.

MOCC: A Fast and Robust Correlation-Based Method for Interest Point Matching under Large Scale Changes

Directory of Open Access Journals (Sweden)

Wang Hao

2010-01-01

Full Text Available Similarity measures based on correlation have been used extensively for matching tasks. However, traditional correlation-based image matching methods are sensitive to rotation and scale changes. This paper presents a fast correlation-based method for matching two images with large rotation and significant scale changes. Multiscale oriented corner correlation (MOCC is used to evaluate the degree of similarity between the feature points. The method is rotation invariant and capable of matching image pairs with scale changes up to a factor of 7. Moreover, MOCC is much faster in comparison with the state-of-the-art matching methods. Experimental results on real images show the robustness and effectiveness of the proposed method.

A Line-Based Adaptive-Weight Matching Algorithm Using Loopy Belief Propagation

Directory of Open Access Journals (Sweden)

Hui Li

2015-01-01

Full Text Available In traditional adaptive-weight stereo matching, the rectangular shaped support region requires excess memory consumption and time. We propose a novel line-based stereo matching algorithm for obtaining a more accurate disparity map with low computation complexity. This algorithm can be divided into two steps: disparity map initialization and disparity map refinement. In the initialization step, a new adaptive-weight model based on the linear support region is put forward for cost aggregation. In this model, the neural network is used to evaluate the spatial proximity, and the mean-shift segmentation method is used to improve the accuracy of color similarity; the Birchfield pixel dissimilarity function and the census transform are adopted to establish the dissimilarity measurement function. Then the initial disparity map is obtained by loopy belief propagation. In the refinement step, the disparity map is optimized by iterative left-right consistency checking method and segmentation voting method. The parameter values involved in this algorithm are determined with many simulation experiments to further improve the matching effect. Simulation results indicate that this new matching method performs well on standard stereo benchmarks and running time of our algorithm is remarkably lower than that of algorithm with rectangle-shaped support region.

Fan fault diagnosis based on symmetrized dot pattern analysis and image matching

Science.gov (United States)

Xu, Xiaogang; Liu, Haixiao; Zhu, Hao; Wang, Songling

2016-07-01

To detect the mechanical failure of fans, a new diagnostic method based on the symmetrized dot pattern (SDP) analysis and image matching is proposed. Vibration signals of 13 kinds of running states are acquired on a centrifugal fan test bed and reconstructed by the SDP technique. The SDP pattern templates of each running state are established. An image matching method is performed to diagnose the fault. In order to improve the diagnostic accuracy, the single template, multiple templates and clustering fault templates are used to perform the image matching.

MOCC: A Fast and Robust Correlation-Based Method for Interest Point Matching under Large Scale Changes

OpenAIRE

Wang Hao; Gao Wen; Huang Qingming; Zhao Feng

2010-01-01

Similarity measures based on correlation have been used extensively for matching tasks. However, traditional correlation-based image matching methods are sensitive to rotation and scale changes. This paper presents a fast correlation-based method for matching two images with large rotation and significant scale changes. Multiscale oriented corner correlation (MOCC) is used to evaluate the degree of similarity between the feature points. The method is rotation invariant and capable of matchin...

SNPsnap: a Web-based tool for identification and annotation of matched SNPs

DEFF Research Database (Denmark)

Pers, Tune Hannes; Timshel, Pascal; Hirschhorn, Joel N.

2015-01-01

-localization of GWAS signals to gene-dense and high linkage disequilibrium (LD) regions, and correlations of gene size, location and function. The SNPsnap Web server enables SNP-based enrichment analysis by providing matched sets of SNPs that can be used to calibrate background expectations. Specifically, SNPsnap...... efficiently identifies sets of randomly drawn SNPs that are matched to a set of query SNPs based on allele frequency, number of SNPs in LD, distance to nearest gene and gene density. Availability and implementation : SNPsnap server is available at http://www.broadinstitute.org/mpg/snpsnap/. Contact: joelh...

Object-Based Dense Matching Method for Maintaining Structure Characteristics of Linear Buildings.

Science.gov (United States)

Su, Nan; Yan, Yiming; Qiu, Mingjie; Zhao, Chunhui; Wang, Liguo

2018-03-29

In this paper, we proposed a novel object-based dense matching method specially for the high-precision disparity map of building objects in urban areas, which can maintain accurate object structure characteristics. The proposed framework mainly includes three stages. Firstly, an improved edge line extraction method is proposed for the edge segments to fit closely to building outlines. Secondly, a fusion method is proposed for the outlines under the constraint of straight lines, which can maintain the building structural attribute with parallel or vertical edges, which is very useful for the dense matching method. Finally, we proposed an edge constraint and outline compensation (ECAOC) dense matching method to maintain building object structural characteristics in the disparity map. In the proposed method, the improved edge lines are used to optimize matching search scope and matching template window, and the high-precision building outlines are used to compensate the shape feature of building objects. Our method can greatly increase the matching accuracy of building objects in urban areas, especially at building edges. For the outline extraction experiments, our fusion method verifies the superiority and robustness on panchromatic images of different satellites and different resolutions. For the dense matching experiments, our ECOAC method shows great advantages for matching accuracy of building objects in urban areas compared with three other methods.

Object-Based Dense Matching Method for Maintaining Structure Characteristics of Linear Buildings

Directory of Open Access Journals (Sweden)

Nan Su

2018-03-01

Full Text Available In this paper, we proposed a novel object-based dense matching method specially for the high-precision disparity map of building objects in urban areas, which can maintain accurate object structure characteristics. The proposed framework mainly includes three stages. Firstly, an improved edge line extraction method is proposed for the edge segments to fit closely to building outlines. Secondly, a fusion method is proposed for the outlines under the constraint of straight lines, which can maintain the building structural attribute with parallel or vertical edges, which is very useful for the dense matching method. Finally, we proposed an edge constraint and outline compensation (ECAOC dense matching method to maintain building object structural characteristics in the disparity map. In the proposed method, the improved edge lines are used to optimize matching search scope and matching template window, and the high-precision building outlines are used to compensate the shape feature of building objects. Our method can greatly increase the matching accuracy of building objects in urban areas, especially at building edges. For the outline extraction experiments, our fusion method verifies the superiority and robustness on panchromatic images of different satellites and different resolutions. For the dense matching experiments, our ECOAC method shows great advantages for matching accuracy of building objects in urban areas compared with three other methods.

Athermalization in atomic force microscope based force spectroscopy using matched microstructure coupling.

Science.gov (United States)

Torun, H; Finkler, O; Degertekin, F L

2009-07-01

The authors describe a method for athermalization in atomic force microscope (AFM) based force spectroscopy applications using microstructures that thermomechanically match the AFM probes. The method uses a setup where the AFM probe is coupled with the matched structure and the displacements of both structures are read out simultaneously. The matched structure displaces with the AFM probe as temperature changes, thus the force applied to the sample can be kept constant without the need for a separate feedback loop for thermal drift compensation, and the differential signal can be used to cancel the shift in zero-force level of the AFM.

Robust Automatic Target Recognition via HRRP Sequence Based on Scatterer Matching

Directory of Open Access Journals (Sweden)

Yuan Jiang

2018-02-01

Full Text Available High resolution range profile (HRRP plays an important role in wideband radar automatic target recognition (ATR. In order to alleviate the sensitivity to clutter and target aspect, employing a sequence of HRRP is a promising approach to enhance the ATR performance. In this paper, a novel HRRP sequence-matching method based on singular value decomposition (SVD is proposed. First, the HRRP sequence is decoupled into the angle space and the range space via SVD, which correspond to the span of the left and the right singular vectors, respectively. Second, atomic norm minimization (ANM is utilized to estimate dominant scatterers in the range space and the Hausdorff distance is employed to measure the scatter similarity between the test and training data. Next, the angle space similarity between the test and training data is evaluated based on the left singular vector correlations. Finally, the range space matching result and the angle space correlation are fused with the singular values as weights. Simulation and outfield experimental results demonstrate that the proposed matching metric is a robust similarity measure for HRRP sequence recognition.

Sensor-based vibration signal feature extraction using an improved composite dictionary matching pursuit algorithm.

Science.gov (United States)

Cui, Lingli; Wu, Na; Wang, Wenjing; Kang, Chenhui

2014-09-09

This paper presents a new method for a composite dictionary matching pursuit algorithm, which is applied to vibration sensor signal feature extraction and fault diagnosis of a gearbox. Three advantages are highlighted in the new method. First, the composite dictionary in the algorithm has been changed from multi-atom matching to single-atom matching. Compared to non-composite dictionary single-atom matching, the original composite dictionary multi-atom matching pursuit (CD-MaMP) algorithm can achieve noise reduction in the reconstruction stage, but it cannot dramatically reduce the computational cost and improve the efficiency in the decomposition stage. Therefore, the optimized composite dictionary single-atom matching algorithm (CD-SaMP) is proposed. Second, the termination condition of iteration based on the attenuation coefficient is put forward to improve the sparsity and efficiency of the algorithm, which adjusts the parameters of the termination condition constantly in the process of decomposition to avoid noise. Third, composite dictionaries are enriched with the modulation dictionary, which is one of the important structural characteristics of gear fault signals. Meanwhile, the termination condition of iteration settings, sub-feature dictionary selections and operation efficiency between CD-MaMP and CD-SaMP are discussed, aiming at gear simulation vibration signals with noise. The simulation sensor-based vibration signal results show that the termination condition of iteration based on the attenuation coefficient enhances decomposition sparsity greatly and achieves a good effect of noise reduction. Furthermore, the modulation dictionary achieves a better matching effect compared to the Fourier dictionary, and CD-SaMP has a great advantage of sparsity and efficiency compared with the CD-MaMP. The sensor-based vibration signals measured from practical engineering gearbox analyses have further shown that the CD-SaMP decomposition and reconstruction algorithm

Sensor-Based Vibration Signal Feature Extraction Using an Improved Composite Dictionary Matching Pursuit Algorithm

Directory of Open Access Journals (Sweden)

Lingli Cui

2014-09-01

Full Text Available This paper presents a new method for a composite dictionary matching pursuit algorithm, which is applied to vibration sensor signal feature extraction and fault diagnosis of a gearbox. Three advantages are highlighted in the new method. First, the composite dictionary in the algorithm has been changed from multi-atom matching to single-atom matching. Compared to non-composite dictionary single-atom matching, the original composite dictionary multi-atom matching pursuit (CD-MaMP algorithm can achieve noise reduction in the reconstruction stage, but it cannot dramatically reduce the computational cost and improve the efficiency in the decomposition stage. Therefore, the optimized composite dictionary single-atom matching algorithm (CD-SaMP is proposed. Second, the termination condition of iteration based on the attenuation coefficient is put forward to improve the sparsity and efficiency of the algorithm, which adjusts the parameters of the termination condition constantly in the process of decomposition to avoid noise. Third, composite dictionaries are enriched with the modulation dictionary, which is one of the important structural characteristics of gear fault signals. Meanwhile, the termination condition of iteration settings, sub-feature dictionary selections and operation efficiency between CD-MaMP and CD-SaMP are discussed, aiming at gear simulation vibration signals with noise. The simulation sensor-based vibration signal results show that the termination condition of iteration based on the attenuation coefficient enhances decomposition sparsity greatly and achieves a good effect of noise reduction. Furthermore, the modulation dictionary achieves a better matching effect compared to the Fourier dictionary, and CD-SaMP has a great advantage of sparsity and efficiency compared with the CD-MaMP. The sensor-based vibration signals measured from practical engineering gearbox analyses have further shown that the CD-SaMP decomposition and

Artificial intelligence (AI)-based relational matching and multimodal medical image fusion: generalized 3D approaches

Science.gov (United States)

Vajdic, Stevan M.; Katz, Henry E.; Downing, Andrew R.; Brooks, Michael J.

1994-09-01

A 3D relational image matching/fusion algorithm is introduced. It is implemented in the domain of medical imaging and is based on Artificial Intelligence paradigms--in particular, knowledge base representation and tree search. The 2D reference and target images are selected from 3D sets and segmented into non-touching and non-overlapping regions, using iterative thresholding and/or knowledge about the anatomical shapes of human organs. Selected image region attributes are calculated. Region matches are obtained using a tree search, and the error is minimized by evaluating a `goodness' of matching function based on similarities of region attributes. Once the matched regions are found and the spline geometric transform is applied to regional centers of gravity, images are ready for fusion and visualization into a single 3D image of higher clarity.

Coalition-based multimedia peer matching strategies for P2P networks

Science.gov (United States)

Park, Hyunggon; van der Schaar, Mihaela

2008-01-01

In this paper, we consider the problem of matching users for multimedia transmission in peer-to-peer (P2P) networks and identify strategies for fair resource division among the matched multimedia peers. We propose a framework for coalition formation, which enables users to form a group of matched peers where they can interact cooperatively and negotiate resources based on their satisfaction with the coalition, determined by explicitly considering the peer's multimedia attributes. In addition, our proposed approach goes a step further by introducing the concept of marginal contribution, which is the value improvement of the coalition induced by an incoming peer. We show that the best way for a peer to select a coalition is to choose the coalition that provides the largest division of marginal contribution given a deployed value-division scheme. Moreover, we model the utility function by explicitly considering each peer's attributes as well as the cost for uploading content. To quantify the benefit that users derive from a coalition, we define the value of a coalition based on the total utility that all peers can achieve jointly in the coalition. Based on this definition of the coalition value, we use an axiomatic bargaining solution in order to fairly negotiate the value division of the upload bandwidth given each peer's attributes.

Hybrid Video Coding Based on Bidimensional Matching Pursuit

Directory of Open Access Journals (Sweden)

Lorenzo Granai

2004-12-01

Full Text Available Hybrid video coding combines together two stages: first, motion estimation and compensation predict each frame from the neighboring frames, then the prediction error is coded, reducing the correlation in the spatial domain. In this work, we focus on the latter stage, presenting a scheme that profits from some of the features introduced by the standard H.264/AVC for motion estimation and replaces the transform in the spatial domain. The prediction error is so coded using the matching pursuit algorithm which decomposes the signal over an appositely designed bidimensional, anisotropic, redundant dictionary. Comparisons are made among the proposed technique, H.264, and a DCT-based coding scheme. Moreover, we introduce fast techniques for atom selection, which exploit the spatial localization of the atoms. An adaptive coding scheme aimed at optimizing the resource allocation is also presented, together with a rate-distortion study for the matching pursuit algorithm. Results show that the proposed scheme outperforms the standard DCT, especially at very low bit rates.

POOR TEXTURAL IMAGE MATCHING BASED ON GRAPH THEORY

Directory of Open Access Journals (Sweden)

S. Chen

2016-06-01

Full Text Available Image matching lies at the heart of photogrammetry and computer vision. For poor textural images, the matching result is affected by low contrast, repetitive patterns, discontinuity or occlusion, few or homogeneous textures. Recently, graph matching became popular for its integration of geometric and radiometric information. Focused on poor textural image matching problem, it is proposed an edge-weight strategy to improve graph matching algorithm. A series of experiments have been conducted including 4 typical landscapes: Forest, desert, farmland, and urban areas. And it is experimentally found that our new algorithm achieves better performance. Compared to SIFT, doubled corresponding points were acquired, and the overall recall rate reached up to 68%, which verifies the feasibility and effectiveness of the algorithm.

Distortion analysis on binary representation of minutiae based fingerprint matching for match-on-card

CSIR Research Space (South Africa)

Mlambo, CS

2016-12-01

Full Text Available The fingerprint matching on the smart card has long been developed and recognized faster method than fingerprint matching on a computer or large capacity systems. There has been much research and activities concerned with improving the accuracy...

A Featured-Based Strategy for Stereovision Matching in Sensors with Fish-Eye Lenses for Forest Environments

Science.gov (United States)

Herrera, Pedro Javier; Pajares, Gonzalo; Guijarro, Maria; Ruz, José J.; Cruz, Jesús M.; Montes, Fernando

2009-01-01

This paper describes a novel feature-based stereovision matching process based on a pair of omnidirectional images in forest stands acquired with a stereovision sensor equipped with fish-eye lenses. The stereo analysis problem consists of the following steps: image acquisition, camera modelling, feature extraction, image matching and depth determination. Once the depths of significant points on the trees are obtained, the growing stock volume can be estimated by considering the geometrical camera modelling, which is the final goal. The key steps are feature extraction and image matching. This paper is devoted solely to these two steps. At a first stage a segmentation process extracts the trunks, which are the regions used as features, where each feature is identified through a set of attributes of properties useful for matching. In the second step the features are matched based on the application of the following four well known matching constraints, epipolar, similarity, ordering and uniqueness. The combination of the segmentation and matching processes for this specific kind of sensors make the main contribution of the paper. The method is tested with satisfactory results and compared against the human expert criterion. PMID:22303134

Semi-Automatic Anatomical Tree Matching for Landmark-Based Elastic Registration of Liver Volumes

Directory of Open Access Journals (Sweden)

Klaus Drechsler

2010-01-01

Full Text Available One promising approach to register liver volume acquisitions is based on the branching points of the vessel trees as anatomical landmarks inherently available in the liver. Automated tree matching algorithms were proposed to automatically find pair-wise correspondences between two vessel trees. However, to the best of our knowledge, none of the existing automatic methods are completely error free. After a review of current literature and methodologies on the topic, we propose an efficient interaction method that can be employed to support tree matching algorithms with important pre-selected correspondences or after an automatic matching to manually correct wrongly matched nodes. We used this method in combination with a promising automatic tree matching algorithm also presented in this work. The proposed method was evaluated by 4 participants and a CT dataset that we used to derive multiple artificial datasets.

Theoretical investigation into negative differential resistance characteristics of resonant tunneling diodes based on lattice-matched and polarization-matched AlInN/GaN heterostructures

Science.gov (United States)

Rong, Taotao; Yang, Lin-An; Yang, Lin; Hao, Yue

2018-01-01

In this work, we report an investigation of resonant tunneling diodes (RTDs) with lattice-matched and polarization-matched AlInN/GaN heterostructures using the numerical simulation. Compared with the lattice-matched AlInN/GaN RTDs, the RTDs based on polarization-matched AlInN/GaN hetero-structures exhibit symmetrical conduction band profiles due to eliminating the polarization charge discontinuity, which achieve the equivalence of double barrier transmission coefficients, thereby the relatively high driving current, the high symmetry of current density, and the high peak-to-valley current ratio (PVCR) under the condition of the positive and the negative sweeping voltages. Simulations show that the peak current density approaches 1.2 × 107 A/cm2 at the bias voltage of 0.72 V and the PVCR approaches 1.37 at both sweeping voltages. It also shows that under the condition of the same shallow energy level, when the trap density reaches 1 × 1019 cm-3, the polarization-matched RTDs still have acceptable negative differential resistance (NDR) characteristics, while the NDR characteristics of lattice-matched RTDs become irregular. After introducing the deeper energy level of 1 eV into the polarization-matched and lattice-matched RTDs, 60 scans are performed under the same trap density. Simulation results show that the degradation of the polarization-matched RTDs is 22%, while lattice-matched RTDs have a degradation of 55%. It can be found that the polarization-matched RTDs have a greater defect tolerance than the lattice-matched RTDs, which is beneficial to the available manufacture of actual terahertz RTD devices.

Iris Matching Based on Personalized Weight Map.

Science.gov (United States)

Dong, Wenbo; Sun, Zhenan; Tan, Tieniu

2011-09-01

Iris recognition typically involves three steps, namely, iris image preprocessing, feature extraction, and feature matching. The first two steps of iris recognition have been well studied, but the last step is less addressed. Each human iris has its unique visual pattern and local image features also vary from region to region, which leads to significant differences in robustness and distinctiveness among the feature codes derived from different iris regions. However, most state-of-the-art iris recognition methods use a uniform matching strategy, where features extracted from different regions of the same person or the same region for different individuals are considered to be equally important. This paper proposes a personalized iris matching strategy using a class-specific weight map learned from the training images of the same iris class. The weight map can be updated online during the iris recognition procedure when the successfully recognized iris images are regarded as the new training data. The weight map reflects the robustness of an encoding algorithm on different iris regions by assigning an appropriate weight to each feature code for iris matching. Such a weight map trained by sufficient iris templates is convergent and robust against various noise. Extensive and comprehensive experiments demonstrate that the proposed personalized iris matching strategy achieves much better iris recognition performance than uniform strategies, especially for poor quality iris images.

Geomagnetic matching navigation algorithm based on robust estimation

Science.gov (United States)

Xie, Weinan; Huang, Liping; Qu, Zhenshen; Wang, Zhenhuan

2017-08-01

The outliers in the geomagnetic survey data seriously affect the precision of the geomagnetic matching navigation and badly disrupt its reliability. A novel algorithm which can eliminate the outliers influence is investigated in this paper. First, the weight function is designed and its principle of the robust estimation is introduced. By combining the relation equation between the matching trajectory and the reference trajectory with the Taylor series expansion for geomagnetic information, a mathematical expression of the longitude, latitude and heading errors is acquired. The robust target function is obtained by the weight function and the mathematical expression. Then the geomagnetic matching problem is converted to the solutions of nonlinear equations. Finally, Newton iteration is applied to implement the novel algorithm. Simulation results show that the matching error of the novel algorithm is decreased to 7.75% compared to the conventional mean square difference (MSD) algorithm, and is decreased to 18.39% to the conventional iterative contour matching algorithm when the outlier is 40nT. Meanwhile, the position error of the novel algorithm is 0.017° while the other two algorithms fail to match when the outlier is 400nT.

An effective approach for iris recognition using phase-based image matching.

Science.gov (United States)

Miyazawa, Kazuyuki; Ito, Koichi; Aoki, Takafumi; Kobayashi, Koji; Nakajima, Hiroshi

2008-10-01

This paper presents an efficient algorithm for iris recognition using phase-based image matching--an image matching technique using phase components in 2D Discrete Fourier Transforms (DFTs) of given images. Experimental evaluation using CASIA iris image databases (versions 1.0 and 2.0) and Iris Challenge Evaluation (ICE) 2005 database clearly demonstrates that the use of phase components of iris images makes possible to achieve highly accurate iris recognition with a simple matching algorithm. This paper also discusses major implementation issues of our algorithm. In order to reduce the size of iris data and to prevent the visibility of iris images, we introduce the idea of 2D Fourier Phase Code (FPC) for representing iris information. The 2D FPC is particularly useful for implementing compact iris recognition devices using state-of-the-art Digital Signal Processing (DSP) technology.

Investigation of bistable perception with the "silhouette spinner": sit still, spin the dancer with your will.

Science.gov (United States)

Liu, Chao-Hsuan; Tzeng, Ovid J L; Hung, Daisy L; Tseng, Philip; Juan, Chi-Hung

2012-05-01

Many studies have used static and non-biologically related stimuli to investigate bistable perception and found that the percept is usually dominated by their intrinsic nature with some influence of voluntary control from the viewer. Here we used a dynamic stimulus of a rotating human body, the silhouette spinner illusion, to investigate how the viewers' intentions may affect their percepts. In two experiments, we manipulated observer intention (active or passive), fixation position (body or feet), and spinning velocity (fast, medium, or slow). Our results showed that the normalized alternating rate between two bistable percepts was greater when (1) participants actively attempted to switch percepts, (2) when participants fixated at the spinner's feet rather than the body, inducing as many as 25 switches of the bistable percepts within 1 min, and (3) when they watched the spinner at high velocity. These results suggest that a dynamic biologically-bistable percept can be quickly alternated by the viewers' intention. Furthermore, the higher alternating rate in the feet condition compared to the body condition suggests a role for biological meaningfulness in determining bistable percepts, where 'biologically plausible' interpretations are favored by the visual system. Copyright © 2012 Elsevier Ltd. All rights reserved.

Color-weak compensation using local affine isometry based on discrimination threshold matching

OpenAIRE

Mochizuki, Rika; Kojima, Takanori; Lenz, Reiner; Chao, Jinhui

2015-01-01

We develop algorithms for color-weak compensation and color-weak simulation based on Riemannian geometry models of color spaces. The objective function introduced measures the match of color discrimination thresholds of average normal observers and a color-weak observer. The developed matching process makes use of local affine maps between color spaces of color-normal and color-weak observers. The method can be used to generate displays of images that provide color-normal and color-weak obser...

Stereo matching and view interpolation based on image domain triangulation.

Science.gov (United States)

Fickel, Guilherme Pinto; Jung, Claudio R; Malzbender, Tom; Samadani, Ramin; Culbertson, Bruce

2013-09-01

This paper presents a new approach for stereo matching and view interpolation problems based on triangular tessellations suitable for a linear array of rectified cameras. The domain of the reference image is initially partitioned into triangular regions using edge and scale information, aiming to place vertices along image edges and increase the number of triangles in textured regions. A region-based matching algorithm is then used to find an initial disparity for each triangle, and a refinement stage is applied to change the disparity at the vertices of the triangles, generating a piecewise linear disparity map. A simple post-processing procedure is applied to connect triangles with similar disparities generating a full 3D mesh related to each camera (view), which are used to generate new synthesized views along the linear camera array. With the proposed framework, view interpolation reduces to the trivial task of rendering polygonal meshes, which can be done very fast, particularly when GPUs are employed. Furthermore, the generated views are hole-free, unlike most point-based view interpolation schemes that require some kind of post-processing procedures to fill holes.

Technical performance and match-to-match variation in elite football teams.

Science.gov (United States)

Liu, Hongyou; Gómez, Miguel-Angel; Gonçalves, Bruno; Sampaio, Jaime

2016-01-01

Recent research suggests that match-to-match variation adds important information to performance descriptors in team sports, as it helps measure how players fine-tune their tactical behaviours and technical actions to the extreme dynamical environments. The current study aims to identify the differences in technical performance of players from strong and weak teams and to explore match-to-match variation of players' technical match performance. Performance data of all the 380 matches of season 2012-2013 in the Spanish First Division Professional Football League were analysed. Twenty-one performance-related match actions and events were chosen as variables in the analyses. Players' technical performance profiles were established by unifying count values of each action or event of each player per match into the same scale. Means of these count values of players from Top3 and Bottom3 teams were compared and plotted into radar charts. Coefficient of variation of each match action or event within a player was calculated to represent his match-to-match variation of technical performance. Differences in the variation of technical performances of players across different match contexts (team and opposition strength, match outcome and match location) were compared. All the comparisons were achieved by the magnitude-based inferences. Results showed that technical performances differed between players of strong and weak teams from different perspectives across different field positions. Furthermore, the variation of the players' technical performance is affected by the match context, with effects from team and opposition strength greater than effects from match location and match outcome.

Scene matching based on non-linear pre-processing on reference image and sensed image

Institute of Scientific and Technical Information of China (English)

Zhong Sheng; Zhang Tianxu; Sang Nong

2005-01-01

To solve the heterogeneous image scene matching problem, a non-linear pre-processing method for the original images before intensity-based correlation is proposed. The result shows that the proper matching probability is raised greatly. Especially for the low S/N image pairs, the effect is more remarkable.

Posture recognition based on fuzzy logic for home monitoring of the elderly.

Science.gov (United States)

Brulin, Damien; Benezeth, Yannick; Courtial, Estelle

2012-09-01

We propose in this paper a computer vision-based posture recognition method for home monitoring of the elderly. The proposed system performs human detection prior to the posture analysis; posture recognition is performed only on a human silhouette. The human detection approach has been designed to be robust to different environmental stimuli. Thus, posture is analyzed with simple and efficient features that are not designed to manage constraints related to the environment but only designed to describe human silhouettes. The posture recognition method, based on fuzzy logic, identifies four static postures and is robust to variation in the distance between the camera and the person, and to the person's morphology. With an accuracy of 74.29% of satisfactory posture recognition, this approach can detect emergency situations such as a fall within a health smart home.

Invariant Feature Matching for Image Registration Application Based on New Dissimilarity of Spatial Features

Science.gov (United States)

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

Invariant Feature Matching for Image Registration Application Based on New Dissimilarity of Spatial Features.

Directory of Open Access Journals (Sweden)

Seyed Mostafa Mousavi Kahaki

Full Text Available 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.

Research on vehicles and cargos matching model based on virtual logistics platform

Science.gov (United States)

Zhuang, Yufeng; Lu, Jiang; Su, Zhiyuan

2018-04-01

Highway less than truckload (LTL) transportation vehicles and cargos matching problem is a joint optimization problem of typical vehicle routing and loading, which is also a hot issue of operational research. This article based on the demand of virtual logistics platform, for the problem of the highway LTL transportation, the matching model of the idle vehicle and the transportation order is set up and the corresponding genetic algorithm is designed. Then the algorithm is implemented by Java. The simulation results show that the solution is satisfactory.

RNAPattMatch: a web server for RNA sequence/structure motif detection based on pattern matching with flexible gaps

Science.gov (United States)

Drory Retwitzer, Matan; Polishchuk, Maya; Churkin, Elena; Kifer, Ilona; Yakhini, Zohar; Barash, Danny

2015-01-01

Searching for RNA sequence-structure patterns is becoming an essential tool for RNA practitioners. Novel discoveries of regulatory non-coding RNAs in targeted organisms and the motivation to find them across a wide range of organisms have prompted the use of computational RNA pattern matching as an enhancement to sequence similarity. State-of-the-art programs differ by the flexibility of patterns allowed as queries and by their simplicity of use. In particular—no existing method is available as a user-friendly web server. A general program that searches for RNA sequence-structure patterns is RNA Structator. However, it is not available as a web server and does not provide the option to allow flexible gap pattern representation with an upper bound of the gap length being specified at any position in the sequence. Here, we introduce RNAPattMatch, a web-based application that is user friendly and makes sequence/structure RNA queries accessible to practitioners of various background and proficiency. It also extends RNA Structator and allows a more flexible variable gaps representation, in addition to analysis of results using energy minimization methods. RNAPattMatch service is available at http://www.cs.bgu.ac.il/rnapattmatch. A standalone version of the search tool is also available to download at the site. PMID:25940619

Mobile Visual Search Based on Histogram Matching and Zone Weight Learning

Science.gov (United States)

Zhu, Chuang; Tao, Li; Yang, Fan; Lu, Tao; Jia, Huizhu; Xie, Xiaodong

2018-01-01

In this paper, we propose a novel image retrieval algorithm for mobile visual search. At first, a short visual codebook is generated based on the descriptor database to represent the statistical information of the dataset. Then, an accurate local descriptor similarity score is computed by merging the tf-idf weighted histogram matching and the weighting strategy in compact descriptors for visual search (CDVS). At last, both the global descriptor matching score and the local descriptor similarity score are summed up to rerank the retrieval results according to the learned zone weights. The results show that the proposed approach outperforms the state-of-the-art image retrieval method in CDVS.

Magnetic safety matches

Science.gov (United States)

Lindén, J.; Lindberg, M.; Greggas, A.; Jylhävuori, N.; Norrgrann, H.; Lill, J. O.

2017-07-01

In addition to the main ingredients; sulfur, potassium chlorate and carbon, ordinary safety matches contain various dyes, glues etc, giving the head of the match an even texture and appealing color. Among the common reddish-brown matches there are several types, which after ignition can be attracted by a strong magnet. Before ignition the match head is generally not attracted by the magnet. An elemental analysis based on proton-induced x-ray emission was performed to single out iron as the element responsible for the observed magnetism. 57Fe Mössbauer spectroscopy was used for identifying the various types of iron-compounds, present before and after ignition, responsible for the macroscopic magnetism: Fe2O3 before and Fe3O4 after. The reaction was verified by mixing the main chemicals in the match-head with Fe2O3 in glue and mounting the mixture on a match stick. The ash residue after igniting the mixture was magnetic.

Best matching theory & applications

CERN Document Server

Moghaddam, Mohsen

2017-01-01

Mismatch or best match? This book demonstrates that best matching of individual entities to each other is essential to ensure smooth conduct and successful competitiveness in any distributed system, natural and artificial. Interactions must be optimized through best matching in planning and scheduling, enterprise network design, transportation and construction planning, recruitment, problem solving, selective assembly, team formation, sensor network design, and more. Fundamentals of best matching in distributed and collaborative systems are explained by providing: § Methodical analysis of various multidimensional best matching processes § Comprehensive taxonomy, comparing different best matching problems and processes § Systematic identification of systems’ hierarchy, nature of interactions, and distribution of decision-making and control functions § Practical formulation of solutions based on a library of best matching algorithms and protocols, ready for direct applications and apps development. Design...

Graphical matching rules for cardinality based service feature diagrams

Directory of Open Access Journals (Sweden)

Faiza Kanwal

2017-03-01

Full Text Available To provide efficient services to end-users, variability and commonality among the features of the product line is a challenge for industrialist and researchers. Feature modeling provides great services to deal with variability and commonality among the features of product line. Cardinality based service feature diagrams changed the basic framework of service feature diagrams by putting constraints to them, which make service specifications more flexible, but apart from their variation in selection third party services may have to be customizable. Although to control variability, cardinality based service feature diagrams provide high level visual notations. For specifying variability, the use of cardinality based service feature diagrams raises the problem of matching a required feature diagram against the set of provided diagrams.

Modelling relationships between match events and match outcome in elite football.

Science.gov (United States)

Liu, Hongyou; Hopkins, Will G; Gómez, Miguel-Angel

2016-08-01

Identifying match events that are related to match outcome is an important task in football match analysis. Here we have used generalised mixed linear modelling to determine relationships of 16 football match events and 1 contextual variable (game location: home/away) with the match outcome. Statistics of 320 close matches (goal difference ≤ 2) of season 2012-2013 in the Spanish First Division Professional Football League were analysed. Relationships were evaluated with magnitude-based inferences and were expressed as extra matches won or lost per 10 close matches for an increase of two within-team or between-team standard deviations (SD) of the match event (representing effects of changes in team values from match to match and of differences between average team values, respectively). There was a moderate positive within-team effect from shots on target (3.4 extra wins per 10 matches; 99% confidence limits ±1.0), and a small positive within-team effect from total shots (1.7 extra wins; ±1.0). Effects of most other match events were related to ball possession, which had a small negative within-team effect (1.2 extra losses; ±1.0) but a small positive between-team effect (1.7 extra wins; ±1.4). Game location showed a small positive within-team effect (1.9 extra wins; ±0.9). In analyses of nine combinations of team and opposition end-of-season rank (classified as high, medium, low), almost all between-team effects were unclear, while within-team effects varied depending on the strength of team and opposition. Some of these findings will be useful to coaches and performance analysts when planning training sessions and match tactics.

Volume Measurement Algorithm for Food Product with Irregular Shape using Computer Vision based on Monte Carlo Method

Directory of Open Access Journals (Sweden)

Joko Siswantoro

2014-11-01

Full Text Available Volume is one of important issues in the production and processing of food product. Traditionally, volume measurement can be performed using water displacement method based on Archimedes’ principle. Water displacement method is inaccurate and considered as destructive method. Computer vision offers an accurate and nondestructive method in measuring volume of food product. This paper proposes algorithm for volume measurement of irregular shape food product using computer vision based on Monte Carlo method. Five images of object were acquired from five different views and then processed to obtain the silhouettes of object. From the silhouettes of object, Monte Carlo method was performed to approximate the volume of object. The simulation result shows that the algorithm produced high accuracy and precision for volume measurement.

MULTI-TEMPORAL AND MULTI-SENSOR IMAGE MATCHING BASED ON LOCAL FREQUENCY INFORMATION

Directory of Open Access Journals (Sweden)

X. Liu

2012-08-01

Full Text Available Image Matching is often one of the first tasks in many Photogrammetry and Remote Sensing applications. This paper presents an efficient approach to automated multi-temporal and multi-sensor image matching based on local frequency information. Two new independent image representations, Local Average Phase (LAP and Local Weighted Amplitude (LWA, are presented to emphasize the common scene information, while suppressing the non-common illumination and sensor-dependent information. In order to get the two representations, local frequency information is firstly obtained from Log-Gabor wavelet transformation, which is similar to that of the human visual system; then the outputs of odd and even symmetric filters are used to construct the LAP and LWA. The LAP and LWA emphasize on the phase and amplitude information respectively. As these two representations are both derivative-free and threshold-free, they are robust to noise and can keep as much of the image details as possible. A new Compositional Similarity Measure (CSM is also presented to combine the LAP and LWA with the same weight for measuring the similarity of multi-temporal and multi-sensor images. The CSM can make the LAP and LWA compensate for each other and can make full use of the amplitude and phase of local frequency information. In many image matching applications, the template is usually selected without consideration of its matching robustness and accuracy. In order to overcome this problem, a local best matching point detection is presented to detect the best matching template. In the detection method, we employ self-similarity analysis to identify the template with the highest matching robustness and accuracy. Experimental results using some real images and simulation images demonstrate that the presented approach is effective for matching image pairs with significant scene and illumination changes and that it has advantages over other state-of-the-art approaches, which include: the

Robust stereo matching with trinary cross color census and triple image-based refinements

Science.gov (United States)

Chang, Ting-An; Lu, Xiao; Yang, Jar-Ferr

2017-12-01

For future 3D TV broadcasting systems and navigation applications, it is necessary to have accurate stereo matching which could precisely estimate depth map from two distanced cameras. In this paper, we first suggest a trinary cross color (TCC) census transform, which can help to achieve accurate disparity raw matching cost with low computational cost. The two-pass cost aggregation (TPCA) is formed to compute the aggregation cost, then the disparity map can be obtained by a range winner-take-all (RWTA) process and a white hole filling procedure. To further enhance the accuracy performance, a range left-right checking (RLRC) method is proposed to classify the results as correct, mismatched, or occluded pixels. Then, the image-based refinements for the mismatched and occluded pixels are proposed to refine the classified errors. Finally, the image-based cross voting and a median filter are employed to complete the fine depth estimation. Experimental results show that the proposed semi-global stereo matching system achieves considerably accurate disparity maps with reasonable computation cost.

Probabilistic active recognition of multiple objects using Hough-based geometric matching features

CSIR Research Space (South Africa)

Govender, N

2015-01-01

Full Text Available be recognized simultaneously, and occlusion and clutter (through distracter objects) is common. We propose a representation for object viewpoints using Hough transform based geometric matching features, which are robust in such circumstances. We show how...

Real-Time Projection-Based Augmented Reality System for Dynamic Objects in the Performing Arts

Directory of Open Access Journals (Sweden)

Jaewoon Lee

2015-02-01

Full Text Available This paper describes the case study of applying projection-based augmented reality, especially for dynamic objects in live performing shows, such as plays, dancing, or musicals. Our study aims to project imagery correctly inside the silhouettes of flexible objects, in other words, live actors or the surface of actor’s costumes; the silhouette transforms its own shape frequently. To realize this work, we implemented a special projection system based on the real-time masking technique, that is to say real-time projection-based augmented reality system for dynamic objects in performing arts. We installed the sets on a stage for live performance, and rehearsed particular scenes of a musical. In live performance, using projection-based augmented reality technology enhances technical and theatrical aspects which were not possible with existing video projection techniques. The projected images on the surfaces of actor’s costume could not only express the particular scene of a performance more effectively, but also lead the audience to an extraordinary visual experience.

Rapid matching of stereo vision based on fringe projection profilometry

Science.gov (United States)

Zhang, Ruihua; Xiao, Yi; Cao, Jian; Guo, Hongwei

2016-09-01

As the most important core part of stereo vision, there are still many problems to solve in stereo matching technology. For smooth surfaces on which feature points are not easy to extract, this paper adds a projector into stereo vision measurement system based on fringe projection techniques, according to the corresponding point phases which extracted from the left and right camera images are the same, to realize rapid matching of stereo vision. And the mathematical model of measurement system is established and the three-dimensional (3D) surface of the measured object is reconstructed. This measurement method can not only broaden application fields of optical 3D measurement technology, and enrich knowledge achievements in the field of optical 3D measurement, but also provide potential possibility for the commercialized measurement system in practical projects, which has very important scientific research significance and economic value.

Accurate recapture identification for genetic mark–recapture studies with error-tolerant likelihood-based match calling and sample clustering

Science.gov (United States)

Sethi, Suresh; Linden, Daniel; Wenburg, John; Lewis, Cara; Lemons, Patrick R.; Fuller, Angela K.; Hare, Matthew P.

2016-01-01

Error-tolerant likelihood-based match calling presents a promising technique to accurately identify recapture events in genetic mark–recapture studies by combining probabilities of latent genotypes and probabilities of observed genotypes, which may contain genotyping errors. Combined with clustering algorithms to group samples into sets of recaptures based upon pairwise match calls, these tools can be used to reconstruct accurate capture histories for mark–recapture modelling. Here, we assess the performance of a recently introduced error-tolerant likelihood-based match-calling model and sample clustering algorithm for genetic mark–recapture studies. We assessed both biallelic (i.e. single nucleotide polymorphisms; SNP) and multiallelic (i.e. microsatellite; MSAT) markers using a combination of simulation analyses and case study data on Pacific walrus (Odobenus rosmarus divergens) and fishers (Pekania pennanti). A novel two-stage clustering approach is demonstrated for genetic mark–recapture applications. First, repeat captures within a sampling occasion are identified. Subsequently, recaptures across sampling occasions are identified. The likelihood-based matching protocol performed well in simulation trials, demonstrating utility for use in a wide range of genetic mark–recapture studies. Moderately sized SNP (64+) and MSAT (10–15) panels produced accurate match calls for recaptures and accurate non-match calls for samples from closely related individuals in the face of low to moderate genotyping error. Furthermore, matching performance remained stable or increased as the number of genetic markers increased, genotyping error notwithstanding.

Latent palmprint matching.

Science.gov (United States)

Jain, Anil K; Feng, Jianjiang

2009-06-01

The evidential value of palmprints in forensic applications is clear as about 30 percent of the latents recovered from crime scenes are from palms. While biometric systems for palmprint-based personal authentication in access control type of applications have been developed, they mostly deal with low-resolution (about 100 ppi) palmprints and only perform full-to-full palmprint matching. We propose a latent-to-full palmprint matching system that is needed in forensic applications. Our system deals with palmprints captured at 500 ppi (the current standard in forensic applications) or higher resolution and uses minutiae as features to be compatible with the methodology used by latent experts. Latent palmprint matching is a challenging problem because latent prints lifted at crime scenes are of poor image quality, cover only a small area of the palm, and have a complex background. Other difficulties include a large number of minutiae in full prints (about 10 times as many as fingerprints), and the presence of many creases in latents and full prints. A robust algorithm to reliably estimate the local ridge direction and frequency in palmprints is developed. This facilitates the extraction of ridge and minutiae features even in poor quality palmprints. A fixed-length minutia descriptor, MinutiaCode, is utilized to capture distinctive information around each minutia and an alignment-based minutiae matching algorithm is used to match two palmprints. Two sets of partial palmprints (150 live-scan partial palmprints and 100 latent palmprints) are matched to a background database of 10,200 full palmprints to test the proposed system. Despite the inherent difficulty of latent-to-full palmprint matching, rank-1 recognition rates of 78.7 and 69 percent, respectively, were achieved in searching live-scan partial palmprints and latent palmprints against the background database.

Speed-up Template Matching through Integral Image based Weak Classifiers

NARCIS (Netherlands)

Wu, t.; Toet, A.

2014-01-01

Template matching is a widely used pattern recognition method, especially in industrial inspection. However, the computational costs of traditional template matching increase dramatically with both template-and scene imagesize. This makes traditional template matching less useful for many (e.g.

Matching algorithm of missile tail flame based on back-propagation neural network

Science.gov (United States)

Huang, Da; Huang, Shucai; Tang, Yidong; Zhao, Wei; Cao, Wenhuan

2018-02-01

This work presents a spectral matching algorithm of missile plume detection that based on neural network. The radiation value of the characteristic spectrum of the missile tail flame is taken as the input of the network. The network's structure including the number of nodes and layers is determined according to the number of characteristic spectral bands and missile types. We can get the network weight matrixes and threshold vectors through training the network using training samples, and we can determine the performance of the network through testing the network using the test samples. A small amount of data cause the network has the advantages of simple structure and practicality. Network structure composed of weight matrix and threshold vector can complete task of spectrum matching without large database support. Network can achieve real-time requirements with a small quantity of data. Experiment results show that the algorithm has the ability to match the precise spectrum and strong robustness.

LipidMatch: an automated workflow for rule-based lipid identification using untargeted high-resolution tandem mass spectrometry data.

Science.gov (United States)

Koelmel, Jeremy P; Kroeger, Nicholas M; Ulmer, Candice Z; Bowden, John A; Patterson, Rainey E; Cochran, Jason A; Beecher, Christopher W W; Garrett, Timothy J; Yost, Richard A

2017-07-10

Lipids are ubiquitous and serve numerous biological functions; thus lipids have been shown to have great potential as candidates for elucidating biomarkers and pathway perturbations associated with disease. Methods expanding coverage of the lipidome increase the likelihood of biomarker discovery and could lead to more comprehensive understanding of disease etiology. We introduce LipidMatch, an R-based tool for lipid identification for liquid chromatography tandem mass spectrometry workflows. LipidMatch currently has over 250,000 lipid species spanning 56 lipid types contained in in silico fragmentation libraries. Unique fragmentation libraries, compared to other open source software, include oxidized lipids, bile acids, sphingosines, and previously uncharacterized adducts, including ammoniated cardiolipins. LipidMatch uses rule-based identification. For each lipid type, the user can select which fragments must be observed for identification. Rule-based identification allows for correct annotation of lipids based on the fragments observed, unlike typical identification based solely on spectral similarity scores, where over-reporting structural details that are not conferred by fragmentation data is common. Another unique feature of LipidMatch is ranking lipid identifications for a given feature by the sum of fragment intensities. For each lipid candidate, the intensities of experimental fragments with exact mass matches to expected in silico fragments are summed. The lipid identifications with the greatest summed intensity using this ranking algorithm were comparable to other lipid identification software annotations, MS-DIAL and Greazy. For example, for features with identifications from all 3 software, 92% of LipidMatch identifications by fatty acyl constituents were corroborated by at least one other software in positive mode and 98% in negative ion mode. LipidMatch allows users to annotate lipids across a wide range of high resolution tandem mass spectrometry

Matching Students to Schools

Directory of Open Access Journals (Sweden)

Dejan Trifunovic

2017-08-01

Full Text Available In this paper, we present the problem of matching students to schools by using different matching mechanisms. This market is specific since public schools are free and the price mechanism cannot be used to determine the optimal allocation of children in schools. Therefore, it is necessary to use different matching algorithms that mimic the market mechanism and enable us to determine the core of the cooperative game. In this paper, we will determine that it is possible to apply cooperative game theory in matching problems. This review paper is based on illustrative examples aiming to compare matching algorithms in terms of the incentive compatibility, stability and efficiency of the matching. In this paper we will present some specific problems that may occur in matching, such as improving the quality of schools, favoring minority students, the limited length of the list of preferences and generating strict priorities from weak priorities.

Keyframes Global Map Establishing Method for Robot Localization through Content-Based Image Matching

Directory of Open Access Journals (Sweden)

Tianyang Cao

2017-01-01

Full Text Available Self-localization and mapping are important for indoor mobile robot. We report a robust algorithm for map building and subsequent localization especially suited for indoor floor-cleaning robots. Common methods, for example, SLAM, can easily be kidnapped by colliding or disturbed by similar objects. Therefore, keyframes global map establishing method for robot localization in multiple rooms and corridors is needed. Content-based image matching is the core of this method. It is designed for the situation, by establishing keyframes containing both floor and distorted wall images. Image distortion, caused by robot view angle and movement, is analyzed and deduced. And an image matching solution is presented, consisting of extraction of overlap regions of keyframes extraction and overlap region rebuild through subblocks matching. For improving accuracy, ceiling points detecting and mismatching subblocks checking methods are incorporated. This matching method can process environment video effectively. In experiments, less than 5% frames are extracted as keyframes to build global map, which have large space distance and overlap each other. Through this method, robot can localize itself by matching its real-time vision frames with our keyframes map. Even with many similar objects/background in the environment or kidnapping robot, robot localization is achieved with position RMSE <0.5 m.

Automatic Matching of Large Scale Images and Terrestrial LIDAR Based on App Synergy of Mobile Phone

Science.gov (United States)

Xia, G.; Hu, C.

2018-04-01

The digitalization of Cultural Heritage based on ground laser scanning technology has been widely applied. High-precision scanning and high-resolution photography of cultural relics are the main methods of data acquisition. The reconstruction with the complete point cloud and high-resolution image requires the matching of image and point cloud, the acquisition of the homonym feature points, the data registration, etc. However, the one-to-one correspondence between image and corresponding point cloud depends on inefficient manual search. The effective classify and management of a large number of image and the matching of large image and corresponding point cloud will be the focus of the research. In this paper, we propose automatic matching of large scale images and terrestrial LiDAR based on APP synergy of mobile phone. Firstly, we develop an APP based on Android, take pictures and record related information of classification. Secondly, all the images are automatically grouped with the recorded information. Thirdly, the matching algorithm is used to match the global and local image. According to the one-to-one correspondence between the global image and the point cloud reflection intensity image, the automatic matching of the image and its corresponding laser radar point cloud is realized. Finally, the mapping relationship between global image, local image and intensity image is established according to homonym feature point. So we can establish the data structure of the global image, the local image in the global image, the local image corresponding point cloud, and carry on the visualization management and query of image.

Landmark matching based retinal image alignment by enforcing sparsity in correspondence matrix.

Science.gov (United States)

Zheng, Yuanjie; Daniel, Ebenezer; Hunter, Allan A; Xiao, Rui; Gao, Jianbin; Li, Hongsheng; Maguire, Maureen G; Brainard, David H; Gee, James C

2014-08-01

Retinal image alignment is fundamental to many applications in diagnosis of eye diseases. In this paper, we address the problem of landmark matching based retinal image alignment. We propose a novel landmark matching formulation by enforcing sparsity in the correspondence matrix and offer its solutions based on linear programming. The proposed formulation not only enables a joint estimation of the landmark correspondences and a predefined transformation model but also combines the benefits of the softassign strategy (Chui and Rangarajan, 2003) and the combinatorial optimization of linear programming. We also introduced a set of reinforced self-similarities descriptors which can better characterize local photometric and geometric properties of the retinal image. Theoretical analysis and experimental results with both fundus color images and angiogram images show the superior performances of our algorithms to several state-of-the-art techniques. Copyright © 2013 Elsevier B.V. All rights reserved.

Inverse consistent non-rigid image registration based on robust point set matching

Science.gov (United States)

2014-01-01

Background Robust point matching (RPM) has been extensively used in non-rigid registration of images to robustly register two sets of image points. However, except for the location at control points, RPM cannot estimate the consistent correspondence between two images because RPM is a unidirectional image matching approach. Therefore, it is an important issue to make an improvement in image registration based on RPM. Methods In our work, a consistent image registration approach based on the point sets matching is proposed to incorporate the property of inverse consistency and improve registration accuracy. Instead of only estimating the forward transformation between the source point sets and the target point sets in state-of-the-art RPM algorithms, the forward and backward transformations between two point sets are estimated concurrently in our algorithm. The inverse consistency constraints are introduced to the cost function of RPM and the fuzzy correspondences between two point sets are estimated based on both the forward and backward transformations simultaneously. A modified consistent landmark thin-plate spline registration is discussed in detail to find the forward and backward transformations during the optimization of RPM. The similarity of image content is also incorporated into point matching in order to improve image matching. Results Synthetic data sets, medical images are employed to demonstrate and validate the performance of our approach. The inverse consistent errors of our algorithm are smaller than RPM. Especially, the topology of transformations is preserved well for our algorithm for the large deformation between point sets. Moreover, the distance errors of our algorithm are similar to that of RPM, and they maintain a downward trend as whole, which demonstrates the convergence of our algorithm. The registration errors for image registrations are evaluated also. Again, our algorithm achieves the lower registration errors in same iteration number

FPFH-based graph matching for 3D point cloud registration

Science.gov (United States)

Zhao, Jiapeng; Li, Chen; Tian, Lihua; Zhu, Jihua

2018-04-01

Correspondence detection is a vital step in point cloud registration and it can help getting a reliable initial alignment. In this paper, we put forward an advanced point feature-based graph matching algorithm to solve the initial alignment problem of rigid 3D point cloud registration with partial overlap. Specifically, Fast Point Feature Histograms are used to determine the initial possible correspondences firstly. Next, a new objective function is provided to make the graph matching more suitable for partially overlapping point cloud. The objective function is optimized by the simulated annealing algorithm for final group of correct correspondences. Finally, we present a novel set partitioning method which can transform the NP-hard optimization problem into a O(n3)-solvable one. Experiments on the Stanford and UWA public data sets indicates that our method can obtain better result in terms of both accuracy and time cost compared with other point cloud registration methods.

Efficient line matching with homography

Science.gov (United States)

Shen, Yan; Dai, Yuxing; Zhu, Zhiliang

2018-03-01

In this paper, we propose a novel approach to line matching based on homography. The basic idea is to use cheaply obtainable matched points to boost the similarity between two images. Two types of homography method, which are estimated by direct linear transformation, transform images and extract their similar parts, laying a foundation for the use of optical flow tracking. The merit of the similarity is that rapid matching can be achieved by regionalizing line segments and local searching. For multiple homography estimation that can perform better than one global homography, we introduced the rank-one modification method of singular value decomposition to reduce the computation cost. The proposed approach results in point-to-point matches, which can be utilized with state-of-the-art point-match-based structures from motion (SfM) frameworks seamlessly. The outstanding performance and feasible robustness of our approach are demonstrated in this paper.

Semantic Data Matching: Principles and Performance

Science.gov (United States)

Deaton, Russell; Doan, Thao; Schweiger, Tom

Automated and real-time management of customer relationships requires robust and intelligent data matching across widespread and diverse data sources. Simple string matching algorithms, such as dynamic programming, can handle typographical errors in the data, but are less able to match records that require contextual and experiential knowledge. Latent Semantic Indexing (LSI) (Berry et al. ; Deerwester et al. is a machine intelligence technique that can match data based upon higher order structure, and is able to handle difficult problems, such as words that have different meanings but the same spelling, are synonymous, or have multiple meanings. Essentially, the technique matches records based upon context, or mathematically quantifying when terms occur in the same record.

A Fast and Robust Feature-Based Scan-Matching Method in 3D SLAM and the Effect of Sampling Strategies

Directory of Open Access Journals (Sweden)

Cihan Ulas

2013-11-01

Full Text Available Simultaneous localization and mapping (SLAM plays an important role in fully autonomous systems when a GNSS (global navigation satellite system is not available. Studies in both 2D indoor and 3D outdoor SLAM are based on the appearance of environments and utilize scan-matching methods to find rigid body transformation parameters between two consecutive scans. In this study, a fast and robust scan-matching method based on feature extraction is introduced. Since the method is based on the matching of certain geometric structures, like plane segments, the outliers and noise in the point cloud are considerably eliminated. Therefore, the proposed scan-matching algorithm is more robust than conventional methods. Besides, the registration time and the number of iterations are significantly reduced, since the number of matching points is efficiently decreased. As a scan-matching framework, an improved version of the normal distribution transform (NDT is used. The probability density functions (PDFs of the reference scan are generated as in the traditional NDT, and the feature extraction - based on stochastic plane detection - is applied to the only input scan. By using experimental dataset belongs to an outdoor environment like a university campus, we obtained satisfactory performance results. Moreover, the feature extraction part of the algorithm is considered as a special sampling strategy for scan-matching and compared to other sampling strategies, such as random sampling and grid-based sampling, the latter of which is first used in the NDT. Thus, this study also shows the effect of the subsampling on the performance of the NDT.

A new template matching method based on contour information

Science.gov (United States)

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

AN EVOLUTIONARY ALGORITHM FOR FAST INTENSITY BASED IMAGE MATCHING BETWEEN OPTICAL AND SAR SATELLITE IMAGERY

Directory of Open Access Journals (Sweden)

P. Fischer

2018-04-01

Full Text Available This paper presents a hybrid evolutionary algorithm for fast intensity based matching between satellite imagery from SAR and very high-resolution (VHR optical sensor systems. The precise and accurate co-registration of image time series and images of different sensors is a key task in multi-sensor image processing scenarios. The necessary preprocessing step of image matching and tie-point detection is divided into a search problem and a similarity measurement. Within this paper we evaluate the use of an evolutionary search strategy for establishing the spatial correspondence between satellite imagery of optical and radar sensors. The aim of the proposed algorithm is to decrease the computational costs during the search process by formulating the search as an optimization problem. Based upon the canonical evolutionary algorithm, the proposed algorithm is adapted for SAR/optical imagery intensity based matching. Extensions are drawn using techniques like hybridization (e.g. local search and others to lower the number of objective function calls and refine the result. The algorithm significantely decreases the computational costs whilst finding the optimal solution in a reliable way.

Graph configuration model based evaluation of the education-occupation match.

Science.gov (United States)

Gadar, Laszlo; Abonyi, Janos

2018-01-01

To study education-occupation matchings we developed a bipartite network model of education to work transition and a graph configuration model based metric. We studied the career paths of 15 thousand Hungarian students based on the integrated database of the National Tax Administration, the National Health Insurance Fund, and the higher education information system of the Hungarian Government. A brief analysis of gender pay gap and the spatial distribution of over-education is presented to demonstrate the background of the research and the resulted open dataset. We highlighted the hierarchical and clustered structure of the career paths based on the multi-resolution analysis of the graph modularity. The results of the cluster analysis can support policymakers to fine-tune the fragmented program structure of higher education.

Global rotational motion and displacement estimation of digital image stabilization based on the oblique vectors matching algorithm

Science.gov (United States)

Yu, Fei; Hui, Mei; Zhao, Yue-jin

2009-08-01

The image block matching algorithm based on motion vectors of correlative pixels in oblique direction is presented for digital image stabilization. The digital image stabilization is a new generation of image stabilization technique which can obtains the information of relative motion among frames of dynamic image sequences by the method of digital image processing. In this method the matching parameters are calculated from the vectors projected in the oblique direction. The matching parameters based on the vectors contain the information of vectors in transverse and vertical direction in the image blocks at the same time. So the better matching information can be obtained after making correlative operation in the oblique direction. And an iterative weighted least square method is used to eliminate the error of block matching. The weights are related with the pixels' rotational angle. The center of rotation and the global emotion estimation of the shaking image can be obtained by the weighted least square from the estimation of each block chosen evenly from the image. Then, the shaking image can be stabilized with the center of rotation and the global emotion estimation. Also, the algorithm can run at real time by the method of simulated annealing in searching method of block matching. An image processing system based on DSP was used to exam this algorithm. The core processor in the DSP system is TMS320C6416 of TI, and the CCD camera with definition of 720×576 pixels was chosen as the input video signal. Experimental results show that the algorithm can be performed at the real time processing system and have an accurate matching precision.

Far-Infrared Based Pedestrian Detection for Driver-Assistance Systems Based on Candidate Filters, Gradient-Based Feature and Multi-Frame Approval Matching.

Science.gov (United States)

Wang, Guohua; Liu, Qiong

2015-12-21

Far-infrared pedestrian detection approaches for advanced driver-assistance systems based on high-dimensional features fail to simultaneously achieve robust and real-time detection. We propose a robust and real-time pedestrian detection system characterized by novel candidate filters, novel pedestrian features and multi-frame approval matching in a coarse-to-fine fashion. Firstly, we design two filters based on the pedestrians' head and the road to select the candidates after applying a pedestrian segmentation algorithm to reduce false alarms. Secondly, we propose a novel feature encapsulating both the relationship of oriented gradient distribution and the code of oriented gradient to deal with the enormous variance in pedestrians' size and appearance. Thirdly, we introduce a multi-frame approval matching approach utilizing the spatiotemporal continuity of pedestrians to increase the detection rate. Large-scale experiments indicate that the system works in real time and the accuracy has improved about 9% compared with approaches based on high-dimensional features only.

Far-Infrared Based Pedestrian Detection for Driver-Assistance Systems Based on Candidate Filters, Gradient-Based Feature and Multi-Frame Approval Matching

Directory of Open Access Journals (Sweden)

Guohua Wang

2015-12-01

Full Text Available Far-infrared pedestrian detection approaches for advanced driver-assistance systems based on high-dimensional features fail to simultaneously achieve robust and real-time detection. We propose a robust and real-time pedestrian detection system characterized by novel candidate filters, novel pedestrian features and multi-frame approval matching in a coarse-to-fine fashion. Firstly, we design two filters based on the pedestrians’ head and the road to select the candidates after applying a pedestrian segmentation algorithm to reduce false alarms. Secondly, we propose a novel feature encapsulating both the relationship of oriented gradient distribution and the code of oriented gradient to deal with the enormous variance in pedestrians’ size and appearance. Thirdly, we introduce a multi-frame approval matching approach utilizing the spatiotemporal continuity of pedestrians to increase the detection rate. Large-scale experiments indicate that the system works in real time and the accuracy has improved about 9% compared with approaches based on high-dimensional features only.

An improved principal component analysis based region matching method for fringe direction estimation

Science.gov (United States)

He, A.; Quan, C.

2018-04-01

The principal component analysis (PCA) and region matching combined method is effective for fringe direction estimation. However, its mask construction algorithm for region matching fails in some circumstances, and the algorithm for conversion of orientation to direction in mask areas is computationally-heavy and non-optimized. We propose an improved PCA based region matching method for the fringe direction estimation, which includes an improved and robust mask construction scheme, and a fast and optimized orientation-direction conversion algorithm for the mask areas. Along with the estimated fringe direction map, filtered fringe pattern by automatic selective reconstruction modification and enhanced fast empirical mode decomposition (ASRm-EFEMD) is used for Hilbert spiral transform (HST) to demodulate the phase. Subsequently, windowed Fourier ridge (WFR) method is used for the refinement of the phase. The robustness and effectiveness of proposed method are demonstrated by both simulated and experimental fringe patterns.

Areal Feature Matching Based on Similarity Using Critic Method

Science.gov (United States)

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.

Histogram Curve Matching Approaches for Object-based Image Classification of Land Cover and Land Use

Science.gov (United States)

Toure, Sory I.; Stow, Douglas A.; Weeks, John R.; Kumar, Sunil

2013-01-01

The classification of image-objects is usually done using parametric statistical measures of central tendency and/or dispersion (e.g., mean or standard deviation). The objectives of this study were to analyze digital number histograms of image objects and evaluate classifications measures exploiting characteristic signatures of such histograms. Two histograms matching classifiers were evaluated and compared to the standard nearest neighbor to mean classifier. An ADS40 airborne multispectral image of San Diego, California was used for assessing the utility of curve matching classifiers in a geographic object-based image analysis (GEOBIA) approach. The classifications were performed with data sets having 0.5 m, 2.5 m, and 5 m spatial resolutions. Results show that histograms are reliable features for characterizing classes. Also, both histogram matching classifiers consistently performed better than the one based on the standard nearest neighbor to mean rule. The highest classification accuracies were produced with images having 2.5 m spatial resolution. PMID:24403648

The match-to-match variation of match-running in elite female soccer.

Science.gov (United States)

Trewin, Joshua; Meylan, César; Varley, Matthew C; Cronin, John

2018-02-01

The purpose of this study was to examine the match-to-match variation of match-running in elite female soccer players utilising GPS, using full-match and rolling period analyses. Longitudinal study. Elite female soccer players (n=45) from the same national team were observed during 55 international fixtures across 5 years (2012-2016). Data was analysed using a custom built MS Excel spreadsheet as full-matches and using a rolling 5-min analysis period, for all players who played 90-min matches (files=172). Variation was examined using co-efficient of variation and 90% confidence limits, calculated following log transformation. Total distance per minute exhibited the smallest variation when both the full-match and peak 5-min running periods were examined (CV=6.8-7.2%). Sprint-efforts were the most variable during a full-match (CV=53%), whilst high-speed running per minute exhibited the greatest variation in the post-peak 5-min period (CV=143%). Peak running periods were observed as slightly more variable than full-match analyses, with the post-peak period very-highly variable. Variability of accelerations (CV=17%) and Player Load (CV=14%) was lower than that of high-speed actions. Positional differences were also present, with centre backs exhibiting the greatest variation in high-speed movements (CV=41-65%). Practitioners and researchers should account for within player variability when examining match performances. Identification of peak running periods should be used to assist worst case scenarios. Whilst micro-sensor technology should be further examined as to its viable use within match-analyses. Copyright © 2017 Sports Medicine Australia. Published by Elsevier Ltd. All rights reserved.

Feature Matching for SAR and Optical Images Based on Gaussian-Gamma-shaped Edge Strength Map

Directory of Open Access Journals (Sweden)

CHEN Min

2016-03-01

Full Text Available A matching method for SAR and optical images, robust to pixel noise and nonlinear grayscale differences, is presented. Firstly, a rough correction to eliminate rotation and scale change between images is performed. Secondly, features robust to speckle noise of SAR image are detected by improving the original phase congruency based method. Then, feature descriptors are constructed on the Gaussian-Gamma-shaped edge strength map according to the histogram of oriented gradient pattern. Finally, descriptor similarity and geometrical relationship are combined to constrain the matching processing.The experimental results demonstrate that the proposed method provides significant improvement in correct matches number and image registration accuracy compared with other traditional methods.

AREAL FEATURE MATCHING BASED ON SIMILARITY USING CRITIC METHOD

Directory of Open Access Journals (Sweden)

J. Kim

2015-10-01

Full Text Available 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.

Wide baseline stereo matching based on double topological relationship consistency

Science.gov (United States)

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.

FEATURE MATCHING OF HISTORICAL IMAGES BASED ON GEOMETRY OF QUADRILATERALS

Directory of Open Access Journals (Sweden)

F. Maiwald

2018-05-01

Full Text Available This contribution shows an approach to match historical images from the photo library of the Saxon State and University Library Dresden (SLUB in the context of a historical three-dimensional city model of Dresden. In comparison to recent images, historical photography provides diverse factors which make an automatical image analysis (feature detection, feature matching and relative orientation of images difficult. Due to e.g. film grain, dust particles or the digitalization process, historical images are often covered by noise interfering with the image signal needed for a robust feature matching. The presented approach uses quadrilaterals in image space as these are commonly available in man-made structures and façade images (windows, stones, claddings. It is explained how to generally detect quadrilaterals in images. Consequently, the properties of the quadrilaterals as well as the relationship to neighbouring quadrilaterals are used for the description and matching of feature points. The results show that most of the matches are robust and correct but still small in numbers.

Image matching for digital close-range stereo photogrammetry based on constraints of Delaunay triangulated network and epipolar-line

Science.gov (United States)

Zhang, K.; Sheng, Y. H.; Li, Y. Q.; Han, B.; Liang, Ch.; Sha, W.

2006-10-01

In the field of digital photogrammetry and computer vision, the determination of conjugate points in a stereo image pair, referred to as "image matching," is the critical step to realize automatic surveying and recognition. Traditional matching methods encounter some problems in the digital close-range stereo photogrammetry, because the change of gray-scale or texture is not obvious in the close-range stereo images. The main shortcoming of traditional matching methods is that geometric information of matching points is not fully used, which will lead to wrong matching results in regions with poor texture. To fully use the geometry and gray-scale information, a new stereo image matching algorithm is proposed in this paper considering the characteristics of digital close-range photogrammetry. Compared with the traditional matching method, the new algorithm has three improvements on image matching. Firstly, shape factor, fuzzy maths and gray-scale projection are introduced into the design of synthetical matching measure. Secondly, the topology connecting relations of matching points in Delaunay triangulated network and epipolar-line are used to decide matching order and narrow the searching scope of conjugate point of the matching point. Lastly, the theory of parameter adjustment with constraint is introduced into least square image matching to carry out subpixel level matching under epipolar-line constraint. The new algorithm is applied to actual stereo images of a building taken by digital close-range photogrammetric system. The experimental result shows that the algorithm has a higher matching speed and matching accuracy than pyramid image matching algorithm based on gray-scale correlation.

The Interaction Between Schema Matching and Record Matching in Data Integration

KAUST Repository

Gu, Binbin

2016-09-20

Schema Matching (SM) and Record Matching (RM) are two necessary steps in integrating multiple relational tables of different schemas, where SM unifies the schemas and RM detects records referring to the same real-world entity. The two processes have been thoroughly studied separately, but few attention has been paid to the interaction of SM and RM. In this work, we find that, even alternating them in a simple manner, SM and RM can benefit from each other to reach a better integration performance (i.e., in terms of precision and recall). Therefore, combining SM and RM is a promising solution for improving data integration. To this end, we define novel matching rules for SM and RM, respectively, that is, every SM decision is made based on intermediate RM results, and vice versa, such that SM and RM can be performed alternately. The quality of integration is guaranteed by a Matching Likelihood Estimation model and the control of semantic drift, which prevent the effect of mismatch magnification. To reduce the computational cost, we design an index structure based on q-grams and a greedy search algorithm that can reduce around 90 percent overhead of the interaction. Extensive experiments on three data collections show that the combination and interaction between SM and RM significantly outperforms previous works that conduct SM and RM separately.

Individual 3D measurements of end users to personalize work wear clothing

Science.gov (United States)

Mielicka, E.; Napieralska, L.; Jasińska, I.; Jarzyna, V.

2017-10-01

Body silhouette 3D measurements need to be performed separately in each country due to significant ethnic differences in body silhouette which preclude the transfer of European data to particular countries. Systematic research allows to update information on the population body silhouette and body proportions as well as select the size changes possible to implement in clothing construction modifications. The diversity in body silhouettes and sizes as well as the issue of clothing fitting encourage clothing producers to provide work wear clothing based on individual measurements of the end users’ bodies. In the framework of the carried research, the group of construction workers was selected as the target group of the analysed work wear clothing users. 42 construction workers, men only, were measured. The body silhouette measurement process was non-contact and was carried out with the use of 3D body scanner. The collected data on the body silhouette allowed to select sizes used to construct the work wear clothing and identify the clothing size. The selected measurement points of the body silhouette underwent statistical analysis to determine the distribution of random variables, here body sizes. The variables distribution characteristics were calculated. On that basis, the fitting appraisal of work wear clothing with respect to the size of the finished product corresponding to the adequate size of individually measured worker/end user was performed. The size overview of the work wear clothing used by the specific professional group and the appraisal of the size fitting to the body silhouette took into consideration the work wear clothing ergonomic functionality with respect to the body posture when performing the tasks, design and clothing construction. The analysis based on the currently gathered end users’ remarks and objections concerning the clothing fitting and performed body silhouette measurements allows to modify the existing work wear clothing for the

A Stable-Matching-Based User Linking Method with User Preference Order

Directory of Open Access Journals (Sweden)

Xuzhong Wang

2017-01-01

Full Text Available With the development of social networks, more and more users choose to use multiple accounts from different networks to meet their needs. Linking a particular user’s multiple accounts not only can improve user’s experience of the net-services such as recommender system, but also plays a significant role in network security. However, multiple accounts of the same user are often not directly linked to each other, and further, the privacy policy provided by the service provider makes it harder to find accounts for a particular user. In this paper, we propose a stable-matching-based method with user preference order for the problem of low accuracy of user linking in cross-media sparse data. Different from the traditional way which just calculates the similarity of accounts, we take full account of the mutual influence among multiple accounts by regarding different networks as bilateral (multilateral market and user linking as a stable matching problem in such a market. Based on the combination of Game-Theoretic Machine Learning and Pairwise, a novel user linking method has been proposed. The experiment shows that our method has a 21.6% improvement in accuracy compared with the traditional linking method and a further increase of about 7.8% after adding the prior knowledge.

The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees

OpenAIRE

Demeyer, Sofie; Michoel, Tom; Fostier, Jan; Audenaert, Pieter; Pickavet, Mario; Demeester, Piet

2013-01-01

Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm (ISMA), a novel tree-based algorithm. ISMA realizes a speedup compared to existing algorithms by carefully selecting the order in which the nodes of a query subgraph are inve...

78 FR 39730 - Privacy Act of 1974; CMS Computer Match No. 2013-11; HHS Computer Match No. 1302

Science.gov (United States)

2013-07-02

... 1974; CMS Computer Match No. 2013-11; HHS Computer Match No. 1302 AGENCY: Centers for Medicare & Medicaid Services (CMS), Department of Health and Human Services (HHS). ACTION: Notice of Computer Matching... notice announces the establishment of a CMP that CMS intends to conduct with State-based Administering...

A Low Cost Matching Motion Estimation Sensor Based on the NIOS II Microprocessor

Directory of Open Access Journals (Sweden)

Diego González

2012-09-01

Full Text Available This work presents the implementation of a matching-based motion estimation sensor on a Field Programmable Gate Array (FPGA and NIOS II microprocessor applying a C to Hardware (C2H acceleration paradigm. The design, which involves several matching algorithms, is mapped using Very Large Scale Integration (VLSI technology. These algorithms, as well as the hardware implementation, are presented here together with an extensive analysis of the resources needed and the throughput obtained. The developed low-cost system is practical for real-time throughput and reduced power consumption and is useful in robotic applications, such as tracking, navigation using an unmanned vehicle, or as part of a more complex system.

The index-based subgraph matching algorithm (ISMA: fast subgraph enumeration in large networks using optimized search trees.

Directory of Open Access Journals (Sweden)

Sofie Demeyer

Full Text Available Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm (ISMA, a novel tree-based algorithm. ISMA realizes a speedup compared to existing algorithms by carefully selecting the order in which the nodes of a query subgraph are investigated. In order to achieve this, we developed a number of data structures and maximally exploited symmetry characteristics of the subgraph. We compared ISMA to a naive recursive tree-based algorithm and to a number of well-known subgraph matching algorithms. Our algorithm outperforms the other algorithms, especially on large networks and with large query subgraphs. An implementation of ISMA in Java is freely available at http://sourceforge.net/projects/isma/.

The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees

Science.gov (United States)

Demeyer, Sofie; Michoel, Tom; Fostier, Jan; Audenaert, Pieter; Pickavet, Mario; Demeester, Piet

2013-01-01

Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm (ISMA), a novel tree-based algorithm. ISMA realizes a speedup compared to existing algorithms by carefully selecting the order in which the nodes of a query subgraph are investigated. In order to achieve this, we developed a number of data structures and maximally exploited symmetry characteristics of the subgraph. We compared ISMA to a naive recursive tree-based algorithm and to a number of well-known subgraph matching algorithms. Our algorithm outperforms the other algorithms, especially on large networks and with large query subgraphs. An implementation of ISMA in Java is freely available at http://sourceforge.net/projects/isma/. PMID:23620730

An adaptive map-matching algorithm based on hierarchical fuzzy system from vehicular GPS data.

Directory of Open Access Journals (Sweden)

Jinjun Tang

Full Text Available An improved hierarchical fuzzy inference method based on C-measure map-matching algorithm is proposed in this paper, in which the C-measure represents the certainty or probability of the vehicle traveling on the actual road. A strategy is firstly introduced to use historical positioning information to employ curve-curve matching between vehicle trajectories and shapes of candidate roads. It improves matching performance by overcoming the disadvantage of traditional map-matching algorithm only considering current information. An average historical distance is used to measure similarity between vehicle trajectories and road shape. The input of system includes three variables: distance between position point and candidate roads, angle between driving heading and road direction, and average distance. As the number of fuzzy rules will increase exponentially when adding average distance as a variable, a hierarchical fuzzy inference system is then applied to reduce fuzzy rules and improve the calculation efficiency. Additionally, a learning process is updated to support the algorithm. Finally, a case study contains four different routes in Beijing city is used to validate the effectiveness and superiority of the proposed method.

Computer holography: 3D digital art based on high-definition CGH

International Nuclear Information System (INIS)

Matsushima, K; Arima, Y; Nishi, H; Yamashita, H; Yoshizaki, Y; Ogawa, K; Nakahara, S

2013-01-01

Our recent works of high-definition computer-generated holograms (CGH) and the techniques used for the creation, such as the polygon-based method, silhouette method and digitized holography, are summarized and reviewed in this paper. The concept of computer holography is proposed in terms of integrating and crystalizing the techniques into novel digital art.

A multiscale approach to mutual information matching

NARCIS (Netherlands)

Pluim, J.P.W.; Maintz, J.B.A.; Viergever, M.A.; Hanson, K.M.

1998-01-01

Methods based on mutual information have shown promising results for matching of multimodal brain images. This paper discusses a multiscale approach to mutual information matching, aiming for an acceleration of the matching process while considering the accuracy and robustness of the method. Scaling

Global stereo matching algorithm based on disparity range estimation

Science.gov (United States)

Li, Jing; Zhao, Hong; Gu, Feifei

2017-09-01

The global stereo matching algorithms are of high accuracy for the estimation of disparity map, but the time-consuming in the optimization process still faces a curse, especially for the image pairs with high resolution and large baseline setting. To improve the computational efficiency of the global algorithms, a disparity range estimation scheme for the global stereo matching is proposed to estimate the disparity map of rectified stereo images in this paper. The projective geometry in a parallel binocular stereo vision is investigated to reveal a relationship between two disparities at each pixel in the rectified stereo images with different baselines, which can be used to quickly obtain a predicted disparity map in a long baseline setting estimated by that in the small one. Then, the drastically reduced disparity ranges at each pixel under a long baseline setting can be determined by the predicted disparity map. Furthermore, the disparity range estimation scheme is introduced into the graph cuts with expansion moves to estimate the precise disparity map, which can greatly save the cost of computing without loss of accuracy in the stereo matching, especially for the dense global stereo matching, compared to the traditional algorithm. Experimental results with the Middlebury stereo datasets are presented to demonstrate the validity and efficiency of the proposed algorithm.

The Purification Method of Matching Points Based on Principal Component Analysis

Directory of Open Access Journals (Sweden)

DONG Yang

2017-02-01

Full Text Available The traditional purification method of matching points usually uses a small number of the points as initial input. Though it can meet most of the requirements of point constraints, the iterative purification solution is easy to fall into local extreme, which results in the missing of correct matching points. To solve this problem, we introduce the principal component analysis method to use the whole point set as initial input. And thorough mismatching points step eliminating and robust solving, more accurate global optimal solution, which intends to reduce the omission rate of correct matching points and thus reaches better purification effect, can be obtained. Experimental results show that this method can obtain the global optimal solution under a certain original false matching rate, and can decrease or avoid the omission of correct matching points.

Morpheme matching based text tokenization for a scarce resourced language.

Science.gov (United States)

Rehman, Zobia; Anwar, Waqas; Bajwa, Usama Ijaz; Xuan, Wang; Chaoying, Zhou

2013-01-01

Text tokenization is a fundamental pre-processing step for almost all the information processing applications. This task is nontrivial for the scarce resourced languages such as Urdu, as there is inconsistent use of space between words. In this paper a morpheme matching based approach has been proposed for Urdu text tokenization, along with some other algorithms to solve the additional issues of boundary detection of compound words, affixation, reduplication, names and abbreviations. This study resulted into 97.28% precision, 93.71% recall, and 95.46% F1-measure; while tokenizing a corpus of 57000 words by using a morpheme list with 6400 entries.

GeneYenta: a phenotype-based rare disease case matching tool based on online dating algorithms for the acceleration of exome interpretation.

Science.gov (United States)

Gottlieb, Michael M; Arenillas, David J; Maithripala, Savanie; Maurer, Zachary D; Tarailo Graovac, Maja; Armstrong, Linlea; Patel, Millan; van Karnebeek, Clara; Wasserman, Wyeth W

2015-04-01

Advances in next-generation sequencing (NGS) technologies have helped reveal causal variants for genetic diseases. In order to establish causality, it is often necessary to compare genomes of unrelated individuals with similar disease phenotypes to identify common disrupted genes. When working with cases of rare genetic disorders, finding similar individuals can be extremely difficult. We introduce a web tool, GeneYenta, which facilitates the matchmaking process, allowing clinicians to coordinate detailed comparisons for phenotypically similar cases. Importantly, the system is focused on phenotype annotation, with explicit limitations on highly confidential data that create barriers to participation. The procedure for matching of patient phenotypes, inspired by online dating services, uses an ontology-based semantic case matching algorithm with attribute weighting. We evaluate the capacity of the system using a curated reference data set and 19 clinician entered cases comparing four matching algorithms. We find that the inclusion of clinician weights can augment phenotype matching. © 2015 WILEY PERIODICALS, INC.

A review on compressed pattern matching

Directory of Open Access Journals (Sweden)

Surya Prakash Mishra

2016-09-01

Full Text Available Compressed pattern matching (CPM refers to the task of locating all the occurrences of a pattern (or set of patterns inside the body of compressed text. In this type of matching, pattern may or may not be compressed. CPM is very useful in handling large volume of data especially over the network. It has many applications in computational biology, where it is useful in finding similar trends in DNA sequences; intrusion detection over the networks, big data analytics etc. Various solutions have been provided by researchers where pattern is matched directly over the uncompressed text. Such solution requires lot of space and consumes lot of time when handling the big data. Various researchers have proposed the efficient solutions for compression but very few exist for pattern matching over the compressed text. Considering the future trend where data size is increasing exponentially day-by-day, CPM has become a desirable task. This paper presents a critical review on the recent techniques on the compressed pattern matching. The covered techniques includes: Word based Huffman codes, Word Based Tagged Codes; Wavelet Tree Based Indexing. We have presented a comparative analysis of all the techniques mentioned above and highlighted their advantages and disadvantages.

The test of time in school-based mentoring: the role of relationship duration and re-matching on academic outcomes.

Science.gov (United States)

Grossman, Jean B; Chan, Christian S; Schwartz, Sarah E O; Rhodes, Jean E

2012-03-01

The influence of match length and re-matching on the effectiveness of school-based mentoring was studied in the context of a national, randomized study of 1,139 youth in Big Brothers Big Sisters programs. The sample included youth in grades four through nine from diverse racial and ethnic backgrounds. At the end of the year, youth in intact relationships showed significant academic improvement, while youth in matches that terminated prematurely showed no impact. Those who were re-matched after terminations showed negative impacts. Youth, mentor, and program characteristics associated with having an intact match were examined. Youth with high levels of baseline stress and those matched with college student mentors were likely to be in matches that terminated prematurely, while rejection-sensitive youth and mentors who had previous mentoring experience were more likely to be in intact relationships. Implications for research and practice are discussed.

Matched molecular pair-based data sets for computer-aided medicinal chemistry

Science.gov (United States)

Bajorath, Jürgen

2014-01-01

Matched molecular pairs (MMPs) are widely used in medicinal chemistry to study changes in compound properties including biological activity, which are associated with well-defined structural modifications. Herein we describe up-to-date versions of three MMP-based data sets that have originated from in-house research projects. These data sets include activity cliffs, structure-activity relationship (SAR) transfer series, and second generation MMPs based upon retrosynthetic rules. The data sets have in common that they have been derived from compounds included in the ChEMBL database (release 17) for which high-confidence activity data are available. Thus, the activity data associated with MMP-based activity cliffs, SAR transfer series, and retrosynthetic MMPs cover the entire spectrum of current pharmaceutical targets. Our data sets are made freely available to the scientific community. PMID:24627802

Local Stereo Matching Using Adaptive Local Segmentation

NARCIS (Netherlands)

Damjanovic, S.; van der Heijden, Ferdinand; Spreeuwers, Lieuwe Jan

We propose a new dense local stereo matching framework for gray-level images based on an adaptive local segmentation using a dynamic threshold. We define a new validity domain of the fronto-parallel assumption based on the local intensity variations in the 4-neighborhood of the matching pixel. The

Implementation procedure for a fingerprint based matching and authentication system using filterbank for e-commerce applications

International Nuclear Information System (INIS)

Choudhry, B.S.; Baloch, A.K.; Pathan, A.H.

2004-01-01

The issue of secure online transactions is of almost importance in the present day world of Internet based commercial applications. Accurate authentication of a person before he or she is allowed to use a resource is very important. On the other hand biometrics is fast developing as a reliable and accurate system for person identification. Biometrics can be the answer to most of the security related problems of the online commercial world. Finger based matching and authentication systems are one of the most reliable systems that can be used for security applications. In this paper, we present a detailed description and implementation procedure for a fingerprint based matching and authentication system using Filterbank approach. The algorithm has been found to give good performance for low quality images. (author)

Matching theory

CERN Document Server

Plummer, MD

1986-01-01

This study of matching theory deals with bipartite matching, network flows, and presents fundamental results for the non-bipartite case. It goes on to study elementary bipartite graphs and elementary graphs in general. Further discussed are 2-matchings, general matching problems as linear programs, the Edmonds Matching Algorithm (and other algorithmic approaches), f-factors and vertex packing.

DC-based smart PV-powered home energy management system based on voltage matching and RF module

Science.gov (United States)

Hasan, W. Z. W.

2017-01-01

The main tool for measuring system efficiency in homes and offices is the energy monitoring of the household appliances’ consumption. With the help of GUI through a PC or smart phone, there are various applications that can be developed for energy saving. This work describes the design and prototype implementation of a wireless PV-powered home energy management system under a DC-distribution environment, which allows remote monitoring of appliances’ energy consumptions and power rate quality. The system can be managed by a central computer, which obtains the energy data based on XBee RF modules that access the sensor measurements of system components. The proposed integrated prototype framework is characterized by low power consumption due to the lack of components and consists of three layers: XBee-based circuit for processing and communication architecture, solar charge controller, and solar-battery-load matching layers. Six precise analogue channels for data monitoring are considered to cover the energy measurements. Voltage, current and temperature analogue signals were accessed directly from the remote XBee node to be sent in real time with a sampling frequency of 11–123 Hz to capture the possible surge power. The performance shows that the developed prototype proves the DC voltage matching concept and is able to provide accurate and precise results. PMID:28934271

DC-based smart PV-powered home energy management system based on voltage matching and RF module.

Directory of Open Access Journals (Sweden)

Ahmad H Sabry

Full Text Available The main tool for measuring system efficiency in homes and offices is the energy monitoring of the household appliances' consumption. With the help of GUI through a PC or smart phone, there are various applications that can be developed for energy saving. This work describes the design and prototype implementation of a wireless PV-powered home energy management system under a DC-distribution environment, which allows remote monitoring of appliances' energy consumptions and power rate quality. The system can be managed by a central computer, which obtains the energy data based on XBee RF modules that access the sensor measurements of system components. The proposed integrated prototype framework is characterized by low power consumption due to the lack of components and consists of three layers: XBee-based circuit for processing and communication architecture, solar charge controller, and solar-battery-load matching layers. Six precise analogue channels for data monitoring are considered to cover the energy measurements. Voltage, current and temperature analogue signals were accessed directly from the remote XBee node to be sent in real time with a sampling frequency of 11-123 Hz to capture the possible surge power. The performance shows that the developed prototype proves the DC voltage matching concept and is able to provide accurate and precise results.

DC-based smart PV-powered home energy management system based on voltage matching and RF module.

Science.gov (United States)

Sabry, Ahmad H; Hasan, W Z W; Ab Kadir, Mza; Radzi, M A M; Shafie, S

2017-01-01

The main tool for measuring system efficiency in homes and offices is the energy monitoring of the household appliances' consumption. With the help of GUI through a PC or smart phone, there are various applications that can be developed for energy saving. This work describes the design and prototype implementation of a wireless PV-powered home energy management system under a DC-distribution environment, which allows remote monitoring of appliances' energy consumptions and power rate quality. The system can be managed by a central computer, which obtains the energy data based on XBee RF modules that access the sensor measurements of system components. The proposed integrated prototype framework is characterized by low power consumption due to the lack of components and consists of three layers: XBee-based circuit for processing and communication architecture, solar charge controller, and solar-battery-load matching layers. Six precise analogue channels for data monitoring are considered to cover the energy measurements. Voltage, current and temperature analogue signals were accessed directly from the remote XBee node to be sent in real time with a sampling frequency of 11-123 Hz to capture the possible surge power. The performance shows that the developed prototype proves the DC voltage matching concept and is able to provide accurate and precise results.

Study of Biometric Identification Method Based on Naked Footprint

Directory of Open Access Journals (Sweden)

Raji Rafiu King

2013-10-01

Full Text Available The scale of deployment of biometric identity-verification systems has recently seen an enormous increase owing to the need for more secure and reliable way of identifying people. Footprint identification which can be defined as the measurement of footprint features for recognizing the identity of a user has surfaced recently. This study is based on a biometric personal identification method using static footprint features viz. friction ridge / texture and foot shape / silhouette. To begin with, naked footprints of users are captured; images then undergo pre processing followed by the extraction of two features; shape using Gradient Vector Flow （GVF） snake model and minutiae extraction respectively. Matching is then effected based on these two features followed by a fusion of these two results for either a reject or accept decision. Our shape matching feature is based on cosine similarity while the texture one is based on miniature score matching. The results from our research establish that the naked footprint is a credible biometric feature as two barefoot impressions of an individual match perfectly while that of two different persons shows a great deal of dissimilarity. Normal 0 false false false IN X-NONE X-NONE /* Style Definitions */ table.MsoNormalTable {mso-style-name:"Table Normal"; mso-tstyle-rowband-size:0; mso-tstyle-colband-size:0; mso-style-noshow:yes; mso-style-priority:99; mso-style-qformat:yes; mso-style-parent:""; mso-padding-alt:0cm 5.4pt 0cm 5.4pt; mso-para-margin:0cm; mso-para-margin-bottom:.0001pt; mso-pagination:widow-orphan; font-size:11.0pt; font-family:"Calibri","sans-serif"; mso-ascii-font-family:Calibri; mso-ascii-theme-font:minor-latin; mso-fareast-font-family:"Times New Roman"; mso-fareast-theme-font:minor-fareast; mso-hansi-font-family:Calibri; mso-hansi-theme-font:minor-latin; mso-bidi-font-family:"Times New Roman"; mso-bidi-theme-font:minor-bidi;} Doi: 10.12777/ijse.5.2.29-35 How to cite this article: King

Approaches for Stereo Matching

Directory of Open Access Journals (Sweden)

Takouhi Ozanian

1995-04-01

Full Text Available This review focuses on the last decade's development of the computational stereopsis for recovering three-dimensional information. The main components of the stereo analysis are exposed: image acquisition and camera modeling, feature selection, feature matching and disparity interpretation. A brief survey is given of the well known feature selection approaches and the estimation parameters for this selection are mentioned. The difficulties in identifying correspondent locations in the two images are explained. Methods as to how effectively to constrain the search for correct solution of the correspondence problem are discussed, as are strategies for the whole matching process. Reasons for the occurrence of matching errors are considered. Some recently proposed approaches, employing new ideas in the modeling of stereo matching in terms of energy minimization, are described. Acknowledging the importance of computation time for real-time applications, special attention is paid to parallelism as a way to achieve the required level of performance. The development of trinocular stereo analysis as an alternative to the conventional binocular one, is described. Finally a classification based on the test images for verification of the stereo matching algorithms, is supplied.

Anomalous dispersion enhanced Cerenkov phase-matching

Energy Technology Data Exchange (ETDEWEB)

Kowalczyk, T.C.; Singer, K.D. [Case Western Reserve Univ., Cleveland, OH (United States). Dept. of Physics; Cahill, P.A. [Sandia National Labs., Albuquerque, NM (United States)

1993-11-01

The authors report on a scheme for phase-matching second harmonic generation in polymer waveguides based on the use of anomalous dispersion to optimize Cerenkov phase matching. They have used the theoretical results of Hashizume et al. and Onda and Ito to design an optimum structure for phase-matched conversion. They have found that the use of anomalous dispersion in the design results in a 100-fold enhancement in the calculated conversion efficiency. This technique also overcomes the limitation of anomalous dispersion phase-matching which results from absorption at the second harmonic. Experiments are in progress to demonstrate these results.

Color matching of fabric blends: hybrid Kubelka-Munk + artificial neural network based method

Science.gov (United States)

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.

Effects of Internet and Smartphone Addictions on Depression and Anxiety Based on Propensity Score Matching Analysis.

Science.gov (United States)

Kim, Yeon-Jin; Jang, Hye Min; Lee, Youngjo; Lee, Donghwan; Kim, Dai-Jin

2018-04-25

The associations of Internet addiction (IA) and smartphone addiction (SA) with mental health problems have been widely studied. We investigated the effects of IA and SA on depression and anxiety while adjusting for sociodemographic variables. In this study, 4854 participants completed a cross-sectional web-based survey including socio-demographic items, the Korean Scale for Internet Addiction, the Smartphone Addiction Proneness Scale, and the subscales of the Symptom Checklist 90 Items-Revised. The participants were classified into IA, SA, and normal use (NU) groups. To reduce sampling bias, we applied the propensity score matching method based on genetics matching. The IA group showed an increased risk of depression (relative risk 1.207; p smartphone use.

IMLS-SLAM: scan-to-model matching based on 3D data

OpenAIRE

Deschaud, Jean-Emmanuel

2018-01-01

The Simultaneous Localization And Mapping (SLAM) problem has been well studied in the robotics community, especially using mono, stereo cameras or depth sensors. 3D depth sensors, such as Velodyne LiDAR, have proved in the last 10 years to be very useful to perceive the environment in autonomous driving, but few methods exist that directly use these 3D data for odometry. We present a new low-drift SLAM algorithm based only on 3D LiDAR data. Our method relies on a scan-to-model matching framew...

Research Article Special Issue

African Journals Online (AJOL)

2017-10-05

Oct 5, 2017 ... is an approach that recognizes human gait based on human body parts such as the stick-figure model [5]. The stick-figure model generates skeleton joints from the silhouette of detected body. In the model-free approach however, human gait is detected based on the silhouette shapes of the walking human.

Phase-matching-free parametric oscillators based on two dimensional semiconductors

OpenAIRE

Ciattoni, A.; Marini, A.; Rizza, C.; Conti, C.

2017-01-01

Optical parametric oscillators are widely-used pulsed and continuous-wave tunable sources for innumerable applications, as in quantum technologies, imaging and biophysics. A key drawback is material dispersion imposing the phase-matching condition that generally entails a complex setup design, thus hindering tunability and miniaturization. Here we show that the burden of phase-matching is surprisingly absent in parametric micro-resonators adopting monolayer transition-metal dichalcogenides as...

Matching of Tore Supra ICRH antennas

International Nuclear Information System (INIS)

Ladurelle, L.; Beaumont, B.; Kuus, H.; Lombard, G.

1994-01-01

An automatic matching method is described for Tore Supra ICRH antennas based on impedance variations seen at their feed points. Error signals derived from directional voltage and phase measurements in the feeder allow to control the matching capacitors values for optimal power transmission. (author) 5 refs.; 9 figs

Neural evidence for competition-mediated suppression in the perception of a single object.

Science.gov (United States)

Cacciamani, Laura; Scalf, Paige E; Peterson, Mary A

2015-11-01

Multiple objects compete for representation in visual cortex. Competition may also underlie the perception of a single object. Computational models implement object perception as competition between units on opposite sides of a border. The border is assigned to the winning side, which is perceived as an object (or "figure"), whereas the other side is perceived as a shapeless ground. Behavioral experiments suggest that the ground is inhibited to a degree that depends on the extent to which it competed for object status, and that this inhibition is relayed to low-level brain areas. Here, we used fMRI to assess activation for ground regions of task-irrelevant novel silhouettes presented in the left or right visual field (LVF or RVF) while participants performed a difficult task at fixation. Silhouettes were designed so that the insides would win the competition for object status. The outsides (grounds) suggested portions of familiar objects in half of the silhouettes and novel objects in the other half. Because matches to object memories affect the competition, these two types of silhouettes operationalized, respectively, high competition and low competition from the grounds. The results showed that activation corresponding to ground regions was reduced for high- versus low-competition silhouettes in V4, where receptive fields (RFs) are large enough to encompass the familiar objects in the grounds, and in V1/V2, where RFs are much smaller. These results support a theory of object perception involving competition-mediated ground suppression and feedback from higher to lower levels. This pattern of results was observed in the left hemisphere (RVF), but not in the right hemisphere (LVF). One explanation of the lateralized findings is that task-irrelevant silhouettes in the RVF captured attention, allowing us to observe these effects, whereas those in the LVF did not. Experiment 2 provided preliminary behavioral evidence consistent with this possibility. Copyright �

How convincing is a matching Y-chromosome profile?

DEFF Research Database (Denmark)

Andersen, Mikkel Meyer; Balding, David J.

2017-01-01

, yet the number of matching relatives is fixed as population size varies, it is typically infeasible to derive population-based match probabilities relevant to a specific crime. We propose a conceptually simple solution, based on a simulation model and software to approximate the distribution...

Exploiting Best-Match Equations for Efficient Reinforcement Learning

NARCIS (Netherlands)

van Seijen, Harm; Whiteson, Shimon; van Hasselt, Hado; Wiering, Marco

This article presents and evaluates best-match learning, a new approach to reinforcement learning that trades off the sample efficiency of model-based methods with the space efficiency of model-free methods. Best-match learning works by approximating the solution to a set of best-match equations,

Simultaneous measurement of refractive index and temperature based on intensity demodulation using matching grating method.

Science.gov (United States)

Qi, Liang; Zhao, Chun-Liu; Kang, Juan; Jin, Yongxing; Wang, Jianfeng; Ye, Manping; Jin, Shangzhong

2013-07-01

A solution refractive index (SRI) and temperature simultaneous measurement sensor with intensity-demodulation system based on matching grating method were demonstrated. Long period grating written in a photonic crystal fiber (LPG-PCF), provides temperature stable and wavelength dependent optical intensity transmission. The reflective peaks of two fiber Bragg gratings (FBGs), one of which is etched then sensitive to both SRI and temperature, another (FBG2) is only sensitive to temperature, were located in the same linear range of the LPG-PCF's transmission spectrum. An identical FBG with FBG2 was chosen as a matching FBG. When environments (SRI and temperature) change, the wavelength shifts of the FBGs are translated effectively to the reflection intensity changes. By monitoring output lights of unmatching and matching paths, the SRI and temperature were deduced by a signal processing unit. Experimental results show that the simultaneous refractive index and temperature measurement system work well. The proposed sensor system is compact and suitable for in situ applications at lower cost.

Unmatched U.S. Allopathic Seniors in the 2015 Main Residency Match: A Study of Applicant Behavior, Interview Selection, and Match Outcome.

Science.gov (United States)

Liang, Mei; Curtin, Laurie S; Signer, Mona M; Savoia, Maria C

2017-07-01

The application and interview behaviors of unmatched U.S. allopathic medical school senior students (U.S. seniors) participating in the 2015 National Resident Matching Program (NRMP) Main Residency Match were studied in conjunction with their United States Medical Licensing Examination (USMLE) Step 1 scores and ranking preferences to understand their effects on Match outcome. USMLE Step 1 score and preferred specialty information were reviewed for U.S. seniors who responded to the 2015 NRMP Applicant Survey. Unmatched U.S. seniors were categorized as "strong," "solid," "marginal," or "weak" based on the perceived competitiveness of their Step 1 scores compared with U.S. seniors who matched in the same preferred specialty. The numbers of applications sent, interviews obtained, and programs ranked also were examined by Match outcome. Strong unmatched U.S. seniors submitted significantly more applications to achieve and attend approximately the same number of interviews as strong matched U.S. seniors. Strong unmatched seniors ranked fewer programs than their matched counterparts. As a group, unmatched U.S. seniors were less likely than their matched counterparts to rank a mix of competitive and less competitive programs and more likely to rank programs based on their perceived likelihood of matching. A small number of unmatched U.S. seniors would have matched if they had ranked programs that ranked them. U.S. seniors' Match outcomes may be affected by applicant characteristics that negatively influence their selection for interviews, and their difficulties may be exacerbated by disadvantageous ranking behaviors.

Two-out-of-two color matching based visual cryptography schemes.

Science.gov (United States)

Machizaud, Jacques; Fournel, Thierry

2012-09-24

Visual cryptography which consists in sharing a secret message between transparencies has been extended to color prints. In this paper, we propose a new visual cryptography scheme based on color matching. The stacked printed media reveal a uniformly colored message decoded by the human visual system. In contrast with the previous color visual cryptography schemes, the proposed one enables to share images without pixel expansion and to detect a forgery as the color of the message is kept secret. In order to correctly print the colors on the media and to increase the security of the scheme, we use spectral models developed for color reproduction describing printed colors from an optical point of view.

Selecting foils for identification lineups: matching suspects or descriptions?

Science.gov (United States)

Tunnicliff, J L; Clark, S E

2000-04-01

Two experiments directly compare two methods of selecting foils for identification lineups. The suspect-matched method selects foils based on their match to the suspect, whereas the description-matched method selects foils based on their match to the witness's description of the perpetrator. Theoretical analyses and previous results predict an advantage for description-matched lineups both in terms of correctly identifying the perpetrator and minimizing false identification of innocent suspects. The advantage for description-matched lineups should be particularly pronounced if the foils selected in suspect-matched lineups are too similar to the suspect. In Experiment 1, the lineups were created by trained police officers, and in Experiment 2, the lineups were constructed by undergraduate college students. The results of both experiments showed higher suspect-to-foil similarity for suspect-matched lineups than for description-matched lineups. However, neither experiment showed a difference in correct or false identification rates. Both experiments did, however, show that there may be an advantage for suspect-matched lineups in terms of no-pick and rejection responses. From these results, the endorsement of one method over the other seems premature.

A Review on Block Matching Motion Estimation and Automata Theory based Approaches for Fractal Coding

Directory of Open Access Journals (Sweden)

Shailesh Kamble

2016-12-01

Full Text Available Fractal compression is the lossy compression technique in the field of gray/color image and video compression. It gives high compression ratio, better image quality with fast decoding time but improvement in encoding time is a challenge. This review paper/article presents the analysis of most significant existing approaches in the field of fractal based gray/color images and video compression, different block matching motion estimation approaches for finding out the motion vectors in a frame based on inter-frame coding and intra-frame coding i.e. individual frame coding and automata theory based coding approaches to represent an image/sequence of images. Though different review papers exist related to fractal coding, this paper is different in many sense. One can develop the new shape pattern for motion estimation and modify the existing block matching motion estimation with automata coding to explore the fractal compression technique with specific focus on reducing the encoding time and achieving better image/video reconstruction quality. This paper is useful for the beginners in the domain of video compression.

Compressive Video Recovery Using Block Match Multi-Frame Motion Estimation Based on Single Pixel Cameras

Directory of Open Access Journals (Sweden)

Sheng Bi

2016-03-01

Full Text Available Compressive sensing (CS theory has opened up new paths for the development of signal processing applications. Based on this theory, a novel single pixel camera architecture has been introduced to overcome the current limitations and challenges of traditional focal plane arrays. However, video quality based on this method is limited by existing acquisition and recovery methods, and the method also suffers from being time-consuming. In this paper, a multi-frame motion estimation algorithm is proposed in CS video to enhance the video quality. The proposed algorithm uses multiple frames to implement motion estimation. Experimental results show that using multi-frame motion estimation can improve the quality of recovered videos. To further reduce the motion estimation time, a block match algorithm is used to process motion estimation. Experiments demonstrate that using the block match algorithm can reduce motion estimation time by 30%.

Bayesian grid matching

DEFF Research Database (Denmark)

Hartelius, Karsten; Carstensen, Jens Michael

2003-01-01

A method for locating distorted grid structures in images is presented. The method is based on the theories of template matching and Bayesian image restoration. The grid is modeled as a deformable template. Prior knowledge of the grid is described through a Markov random field (MRF) model which r...

Self-match based on polling scheme for passive optical network monitoring

Science.gov (United States)

Zhang, Xuan; Guo, Hao; Jia, Xinhong; Liao, Qinghua

2018-06-01

We propose a self-match based on polling scheme for passive optical network monitoring. Each end-user is equipped with an optical matcher that exploits only the specific length patchcord and two different fiber Bragg gratings with 100% reflectivity. The simple and low-cost scheme can greatly simplify the final recognition processing of the network link status and reduce the sensitivity of the photodetector. We analyze the time-domain relation between reflected pulses and establish the calculation model to evaluate the false alarm rate. The feasibility of the proposed scheme and the validity of the time-domain relation analysis are experimentally demonstrated.

Effect of silhouetting and inversion on view invariance in the monkey inferotemporal cortex.

Science.gov (United States)

Ratan Murty, N Apurva; Arun, S P

2017-07-01

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. NEW & NOTEWORTHY We easily recognize objects across changes in viewpoint, but the underlying features are unknown. Here, we show that view invariance in the monkey inferotemporal cortex is driven mainly by external object contours and is not specialized for object orientation. We also find that the responses to natural objects match with that of their silhouettes early in the response, and with inverted versions later in the response-indicative of a coarse-to-fine processing sequence in the brain. Copyright © 2017 the American Physiological Society.

76 FR 5235 - Privacy Act of 1974, as Amended; Computer Matching Program (SSA Internal Match)-Match Number 1014

Science.gov (United States)

2011-01-28

...; Computer Matching Program (SSA Internal Match)--Match Number 1014 AGENCY: Social Security Administration... regarding protections for such persons. The Privacy Act, as amended, regulates the use of computer matching....C. 552a, as amended, and the provisions of the Computer Matching and Privacy Protection Act of 1988...

Probability matching and strategy availability.

Science.gov (United States)

Koehler, Derek J; James, Greta

2010-09-01

Findings from two experiments indicate that probability matching in sequential choice arises from an asymmetry in strategy availability: The matching strategy comes readily to mind, whereas a superior alternative strategy, maximizing, does not. First, compared with the minority who spontaneously engage in maximizing, the majority of participants endorse maximizing as superior to matching in a direct comparison when both strategies are described. Second, when the maximizing strategy is brought to their attention, more participants subsequently engage in maximizing. Third, matchers are more likely than maximizers to base decisions in other tasks on their initial intuitions, suggesting that they are more inclined to use a choice strategy that comes to mind quickly. These results indicate that a substantial subset of probability matchers are victims of "underthinking" rather than "overthinking": They fail to engage in sufficient deliberation to generate a superior alternative to the matching strategy that comes so readily to mind.

Broadband electrical impedance matching for piezoelectric ultrasound transducers.

Science.gov (United States)

Huang, Haiying; Paramo, Daniel

2011-12-01

This paper presents a systematic method for designing broadband electrical impedance matching networks for piezoelectric ultrasound transducers. The design process involves three steps: 1) determine the equivalent circuit of the unmatched piezoelectric transducer based on its measured admittance; 2) design a set of impedance matching networks using a computerized Smith chart; and 3) establish the simulation model of the matched transducer to evaluate the gain and bandwidth of the impedance matching networks. The effectiveness of the presented approach is demonstrated through the design, implementation, and characterization of impedance matching networks for a broadband acoustic emission sensor. The impedance matching network improved the power of the acquired signal by 9 times.

A Data-Driven Modeling Strategy for Smart Grid Power Quality Coupling Assessment Based on Time Series Pattern Matching

Directory of Open Access Journals (Sweden)

Hao Yu

2018-01-01

Full Text Available This study introduces a data-driven modeling strategy for smart grid power quality (PQ coupling assessment based on time series pattern matching to quantify the influence of single and integrated disturbance among nodes in different pollution patterns. Periodic and random PQ patterns are constructed by using multidimensional frequency-domain decomposition for all disturbances. A multidimensional piecewise linear representation based on local extreme points is proposed to extract the patterns features of single and integrated disturbance in consideration of disturbance variation trend and severity. A feature distance of pattern (FDP is developed to implement pattern matching on univariate PQ time series (UPQTS and multivariate PQ time series (MPQTS to quantify the influence of single and integrated disturbance among nodes in the pollution patterns. Case studies on a 14-bus distribution system are performed and analyzed; the accuracy and applicability of the FDP in the smart grid PQ coupling assessment are verified by comparing with other time series pattern matching methods.

Modified Three-Step Search Block Matching Motion Estimation and Weighted Finite Automata based Fractal Video Compression

Directory of Open Access Journals (Sweden)

Shailesh Kamble

2017-08-01

Full Text Available The major challenge with fractal image/video coding technique is that, it requires more encoding time. Therefore, how to reduce the encoding time is the research component remains in the fractal coding. Block matching motion estimation algorithms are used, to reduce the computations performed in the process of encoding. The objective of the proposed work is to develop an approach for video coding using modified three step search (MTSS block matching algorithm and weighted finite automata (WFA coding with a specific focus on reducing the encoding time. The MTSS block matching algorithm are used for computing motion vectors between the two frames i.e. displacement of pixels and WFA is used for the coding as it behaves like the Fractal Coding (FC. WFA represents an image (frame or motion compensated prediction error based on the idea of fractal that the image has self-similarity in itself. The self-similarity is sought from the symmetry of an image, so the encoding algorithm divides an image into multi-levels of quad-tree segmentations and creates an automaton from the sub-images. The proposed MTSS block matching algorithm is based on the combination of rectangular and hexagonal search pattern and compared with the existing New Three-Step Search (NTSS, Three-Step Search (TSS, and Efficient Three-Step Search (ETSS block matching estimation algorithm. The performance of the proposed MTSS block matching algorithm is evaluated on the basis of performance evaluation parameters i.e. mean absolute difference (MAD and average search points required per frame. Mean of absolute difference (MAD distortion function is used as the block distortion measure (BDM. Finally, developed approaches namely, MTSS and WFA, MTSS and FC, and Plane FC (applied on every frame are compared with each other. The experimentations are carried out on the standard uncompressed video databases, namely, akiyo, bus, mobile, suzie, traffic, football, soccer, ice etc. Developed

Delayed Match Retrieval: A Novel Anticipation-Based Visual Working Memory Paradigm

Science.gov (United States)

Kaldy, Zsuzsa; Guillory, Sylvia B.; Blaser, Erik

2016-01-01

We tested 8- and 10-month-old infants' visual working memory (VWM) for object-location bindings--"what is where"--with a novel paradigm, Delayed Match Retrieval, that measured infants' anticipatory gaze responses (using a Tobii T120 eye tracker). In an inversion of Delayed-Match-to-Sample tasks and with inspiration from the game…

Analysis of an Online Match Discussion Board: Improving the Otolaryngology—Head and Neck Surgery Match

Science.gov (United States)

Kozin, Elliott D.; Sethi, Rosh; Lehmann, Ashton; Remenschneider, Aaron K.; Golub, Justin S.; Reyes, Samuel A.; Emerick, Kevin; Lee, Daniel J.; Gray, Stacey T.

2015-01-01

Introduction “The Match” has become the accepted selection process for graduate medical education. Otomatch.com has provided an online forum for Otolaryngology-Head and Neck Surgery (OHNS) Match-related questions for over a decade. Herein, we aim to 1) delineate the types of posts on Otomatch to better understand the perspective of medical students applying for residency and 2) provide recommendations to potentially improve the Match process. Methods Discussion forum posts on Otomatch between December 2001 and April 2014 were reviewed. The title of each thread and total number of views were recorded for quantitative analysis. Each thread was organized into one of six major categories and one of eighteen subcategories, based on chronology within the application cycle and topic. National Resident Matching Program (NRMP) data were utilized for comparison. Results We identified 1,921 threads corresponding to over 2 million page views. Over 40% of threads related to questions about specific programs, and 27% were discussions about interviews. Views, a surrogate measure for popularity, reflected different trends. The majority of individuals viewed posts on interviews (42%), program specific questions (20%) and how to rank programs (11%). Increase in viewership tracked with a rise in applicant numbers based on NRMP data. Conclusions Our study provides an in depth analysis of a popular discussion forum for medical students interested in the OHNS Match. The most viewed posts are about interview dates and questions regarding specific programs. We provide suggestions to address unmet needs for medical students and potentially improve the Match process. PMID:25550223

State of otolaryngology match: has competition increased since the "early" match?

Science.gov (United States)

Cabrera-Muffly, Cristina; Sheeder, Jeanelle; Abaza, Mona

2015-05-01

To examine fluctuations in supply and demand of otolaryngology residency positions after the shift from an "early match" coordinated by the San Francisco match to a "conventional" matching process through the National Residency Matching Program (NRMP). To determine whether competition among otolaryngology residency positions have changed during this time frame. Database analysis. Matching statistics from 1998 to 2013 were obtained for all first-year residency positions through the NRMP. Matching statistics from 1998 to 2005 were obtained for otolaryngology residency positions through the San Francisco match. Univariate analysis was performed, with a P value less than .05 determined as significant. The number of otolaryngology positions and applicants remained proportional to the overall number of positions and applicants in the NRMP match. Otolaryngology applicants per position and the matching rate of all applicants did not change between the 2 time periods studied. The overall match rate of US seniors applying to otolaryngology did not change, while the match rate of non-US seniors decreased significantly following initiation of the conventional match. There was no significant change in United States Medical Licensing Exam step 1 scores or percentage of unfilled otolaryngology residency positions between the 2 time periods. When comparing the early versus conventional otolaryngology match time periods, the only major change was the decreased percentage of matching among non-US senior applicants. Despite a significant shift in match timing after 2006, the supply, demand, and competitiveness of otolaryngology residency positions have not changed significantly. © American Academy of Otolaryngology—Head and Neck Surgery Foundation 2015.

Toward Practical Secure Stable Matching

Directory of Open Access Journals (Sweden)

Riazi M. Sadegh

2017-01-01

Full Text Available The Stable Matching (SM algorithm has been deployed in many real-world scenarios including the National Residency Matching Program (NRMP and financial applications such as matching of suppliers and consumers in capital markets. Since these applications typically involve highly sensitive information such as the underlying preference lists, their current implementations rely on trusted third parties. This paper introduces the first provably secure and scalable implementation of SM based on Yao’s garbled circuit protocol and Oblivious RAM (ORAM. Our scheme can securely compute a stable match for 8k pairs four orders of magnitude faster than the previously best known method. We achieve this by introducing a compact and efficient sub-linear size circuit. We even further decrease the computation cost by three orders of magnitude by proposing a novel technique to avoid unnecessary iterations in the SM algorithm. We evaluate our implementation for several problem sizes and plan to publish it as open-source.

Defining the XML schema matching problem for a personal schema based query answering system

OpenAIRE

Smiljanic, M.; van Keulen, Maurice; Jonker, Willem

2004-01-01

In this report, we analyze the problem of personal schema matching. We define the ingredients of the XML schema matching problem using constraint logic programming. This allows us to thourougly investigate specific matching problems. We do not have the ambition to provide for a formalism that covers all kinds of schema matching problems. The target is specifically personal schema matching using XML. The report is organized as follows. Chapter 2 provides a detailed description of our research ...

A feature matching and fusion-based positive obstacle detection algorithm for field autonomous land vehicles

Directory of Open Access Journals (Sweden)

Tao Wu

2017-03-01

Full Text Available Positive obstacles will cause damage to field robotics during traveling in field. Field autonomous land vehicle is a typical field robotic. This article presents a feature matching and fusion-based algorithm to detect obstacles using LiDARs for field autonomous land vehicles. There are three main contributions: (1 A novel setup method of compact LiDAR is introduced. This method improved the LiDAR data density and reduced the blind region of the LiDAR sensor. (2 A mathematical model is deduced under this new setup method. The ideal scan line is generated by using the deduced mathematical model. (3 Based on the proposed mathematical model, a feature matching and fusion (FMAF-based algorithm is presented in this article, which is employed to detect obstacles. Experimental results show that the performance of the proposed algorithm is robust and stable, and the computing time is reduced by an order of two magnitudes by comparing with other exited algorithms. This algorithm has been perfectly applied to our autonomous land vehicle, which has won the champion in the challenge of Chinese “Overcome Danger 2014” ground unmanned vehicle.

Job Searchers, Job Matches and the Elasticity of Matching

NARCIS (Netherlands)

Broersma, L.; van Ours, J.C.

1998-01-01

This paper stresses the importance of a specification of the matching function in which the measure of job matches corresponds to the measure of job searchers. In many empirical studies on the matching function this requirement has not been fulfilled because it is difficult to find information about

Genetic Algorithm-Based Optimization to Match Asteroid Energy Deposition Curves

Science.gov (United States)

Tarano, Ana; Mathias, Donovan; Wheeler, Lorien; Close, Sigrid

2018-01-01

An asteroid entering Earth's atmosphere deposits energy along its path due to thermal ablation and dissipative forces that can be measured by ground-based and spaceborne instruments. Inference of pre-entry asteroid properties and characterization of the atmospheric breakup is facilitated by using an analytic fragment-cloud model (FCM) in conjunction with a Genetic Algorithm (GA). This optimization technique is used to inversely solve for the asteroid's entry properties, such as diameter, density, strength, velocity, entry angle, and strength scaling, from simulations using FCM. The previous parameters' fitness evaluation involves minimizing error to ascertain the best match between the physics-based calculated energy deposition and the observed meteors. This steady-state GA provided sets of solutions agreeing with literature, such as the meteor from Chelyabinsk, Russia in 2013 and Tagish Lake, Canada in 2000, which were used as case studies in order to validate the optimization routine. The assisted exploration and exploitation of this multi-dimensional search space enables inference and uncertainty analysis that can inform studies of near-Earth asteroids and consequently improve risk assessment.

Adaboost-based algorithm for human action recognition

KAUST Repository

Zerrouki, Nabil

2017-11-28

This paper presents a computer vision-based methodology for human action recognition. First, the shape based pose features are constructed based on area ratios to identify the human silhouette in images. The proposed features are invariance to translation and scaling. Once the human body features are extracted from videos, different human actions are learned individually on the training frames of each class. Then, we apply the Adaboost algorithm for the classification process. We assessed the proposed approach using the UR Fall Detection dataset. In this study six classes of activities are considered namely: walking, standing, bending, lying, squatting, and sitting. Results demonstrate the efficiency of the proposed methodology.

Adaboost-based algorithm for human action recognition

KAUST Repository

Zerrouki, Nabil; Harrou, Fouzi; Sun, Ying; Houacine, Amrane

2017-01-01

This paper presents a computer vision-based methodology for human action recognition. First, the shape based pose features are constructed based on area ratios to identify the human silhouette in images. The proposed features are invariance to translation and scaling. Once the human body features are extracted from videos, different human actions are learned individually on the training frames of each class. Then, we apply the Adaboost algorithm for the classification process. We assessed the proposed approach using the UR Fall Detection dataset. In this study six classes of activities are considered namely: walking, standing, bending, lying, squatting, and sitting. Results demonstrate the efficiency of the proposed methodology.

Selective sp3 C–H alkylation via polarity-match-based cross-coupling

Science.gov (United States)

Le, Chip; Liang, Yufan; Evans, Ryan W.; Li, Ximing; MacMillan, David W. C.

2017-01-01

The functionalization of carbon–hydrogen (C–H) bonds is one of the most attractive strategies for molecular construction in organic chemistry. The hydrogen atom is considered to be an ideal coupling handle, owing to its relative abundance in organic molecules and its availability for functionalization at almost any stage in a synthetic sequence1. Although many C–H functionalization reactions involve C(sp3)–C(sp2) coupling, there is a growing demand for C–H alkylation reactions, wherein sp3 C–H bonds are replaced with sp3 C–alkyl groups. Here we describe a polarity-match-based selective sp3 C–H alkylation via the combination of photoredox, nickel and hydrogen-atom transfer catalysis. This methodology simultaneously uses three catalytic cycles to achieve hydridic C–H bond abstraction (enabled by polarity matching), alkyl halide oxidative addition, and reductive elimination to enable alkyl–alkyl fragment coupling. The sp3 C–H alkylation is highly selective for the α-C–H of amines, ethers and sulphides, which are commonly found in pharmaceutically relevant architectures. This cross-coupling protocol should enable broad synthetic applications in de novo synthesis and late-stage functionalization chemistry. PMID:28636596

Selective sp3 C-H alkylation via polarity-match-based cross-coupling.

Science.gov (United States)

Le, Chip; Liang, Yufan; Evans, Ryan W; Li, Ximing; MacMillan, David W C

2017-07-06

The functionalization of carbon-hydrogen (C-H) bonds is one of the most attractive strategies for molecular construction in organic chemistry. The hydrogen atom is considered to be an ideal coupling handle, owing to its relative abundance in organic molecules and its availability for functionalization at almost any stage in a synthetic sequence. Although many C-H functionalization reactions involve C(sp 3 )-C(sp 2 ) coupling, there is a growing demand for C-H alkylation reactions, wherein sp 3 C-H bonds are replaced with sp 3 C-alkyl groups. Here we describe a polarity-match-based selective sp 3 C-H alkylation via the combination of photoredox, nickel and hydrogen-atom transfer catalysis. This methodology simultaneously uses three catalytic cycles to achieve hydridic C-H bond abstraction (enabled by polarity matching), alkyl halide oxidative addition, and reductive elimination to enable alkyl-alkyl fragment coupling. The sp 3 C-H alkylation is highly selective for the α-C-H of amines, ethers and sulphides, which are commonly found in pharmaceutically relevant architectures. This cross-coupling protocol should enable broad synthetic applications in de novo synthesis and late-stage functionalization chemistry.

Selective sp3 C-H alkylation via polarity-match-based cross-coupling

Science.gov (United States)

Le, Chip; Liang, Yufan; Evans, Ryan W.; Li, Ximing; MacMillan, David W. C.

2017-07-01

The functionalization of carbon-hydrogen (C-H) bonds is one of the most attractive strategies for molecular construction in organic chemistry. The hydrogen atom is considered to be an ideal coupling handle, owing to its relative abundance in organic molecules and its availability for functionalization at almost any stage in a synthetic sequence. Although many C-H functionalization reactions involve C(sp3)-C(sp2) coupling, there is a growing demand for C-H alkylation reactions, wherein sp3 C-H bonds are replaced with sp3 C-alkyl groups. Here we describe a polarity-match-based selective sp3 C-H alkylation via the combination of photoredox, nickel and hydrogen-atom transfer catalysis. This methodology simultaneously uses three catalytic cycles to achieve hydridic C-H bond abstraction (enabled by polarity matching), alkyl halide oxidative addition, and reductive elimination to enable alkyl-alkyl fragment coupling. The sp3 C-H alkylation is highly selective for the α-C-H of amines, ethers and sulphides, which are commonly found in pharmaceutically relevant architectures. This cross-coupling protocol should enable broad synthetic applications in de novo synthesis and late-stage functionalization chemistry.

Generic Energy Matching Model and Figure of Matching Algorithm for Combined Renewable Energy Systems

Directory of Open Access Journals (Sweden)

J.C. Brezet

2009-08-01

Full Text Available In this paper the Energy Matching Model and Figure of Matching Algorithm which originally was dedicated only to photovoltaic (PV systems [1] are extended towards a Model and Algorithm suitable for combined systems which are a result of integration of two or more renewable energy sources into one. The systems under investigation will range from mobile portable devices up to the large renewable energy system conceivably to be applied at the Afsluitdijk (Closure- dike in the north of the Netherlands. This Afsluitdijk is the major dam in the Netherlands, damming off the Zuiderzee, a salt water inlet of the North Sea and turning it into the fresh water lake of the IJsselmeer. The energy chain of power supplies based on a combination of renewable energy sources can be modeled by using one generic Energy Matching Model as starting point.

The prediction in computer color matching of dentistry based on GA+BP neural network.

Science.gov (United States)

Li, Haisheng; Lai, Long; Chen, Li; Lu, Cheng; Cai, Qiang

2015-01-01

Although the use of computer color matching can reduce the influence of subjective factors by technicians, matching the color of a natural tooth with a ceramic restoration is still one of the most challenging topics in esthetic prosthodontics. Back propagation neural network (BPNN) has already been introduced into the computer color matching in dentistry, but it has disadvantages such as unstable and low accuracy. In our study, we adopt genetic algorithm (GA) to optimize the initial weights and threshold values in BPNN for improving the matching precision. To our knowledge, we firstly combine the BPNN with GA in computer color matching in dentistry. Extensive experiments demonstrate that the proposed method improves the precision and prediction robustness of the color matching in restorative dentistry.

78 FR 73195 - Privacy Act of 1974: CMS Computer Matching Program Match No. 2013-01; HHS Computer Matching...

Science.gov (United States)

2013-12-05

... 1974: CMS Computer Matching Program Match No. 2013-01; HHS Computer Matching Program Match No. 1312 AGENCY: Centers for Medicare & Medicaid Services (CMS), Department of Health and Human Services (HHS... Privacy Act of 1974 (5 U.S.C. 552a), as amended, this notice announces the renewal of a CMP that CMS plans...

A TSR Visual Servoing System Based on a Novel Dynamic Template Matching Method

Directory of Open Access Journals (Sweden)

Jia Cai

2015-12-01

Full Text Available 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.

The interchangeability of global positioning system and semiautomated video-based performance data during elite soccer match play.

Science.gov (United States)

Harley, Jamie A; Lovell, Ric J; Barnes, Christopher A; Portas, Matthew D; Weston, Matthew

2011-08-01

In elite-level soccer, player motion characteristics are commonly generated from match play and training situations using semiautomated video analysis systems and global positioning system (GPS) technology, respectively. Before such data are used collectively to quantify global player load, it is necessary to understand both the level of agreement and direction of bias between the systems so that specific interventions can be made based on the reported results. The aim of this report was to compare data derived from both systems for physical match performances. Six elite-level soccer players were analyzed during a competitive match using semiautomated video analysis (ProZone® [PZ]) and GPS (MinimaxX) simultaneously. Total distances (TDs), high speed running (HSR), very high speed running (VHSR), sprinting distance (SPR), and high-intensity running distance (HIR; >4.0 m·s(-1)) were reported in 15-minute match periods. The GPS reported higher values than PZ did for TD (GPS: 1,755.4 ± 245.4 m; PZ: 1,631.3 ± 239.5 m; p < 0.05); PZ reported higher values for SPR and HIR than GPS did (SPR: PZ, 34.1 ± 24.0 m; GPS: 20.3 ± 15.8 m; HIR: PZ, 368.1 ± 129.8 m; GPS: 317.0 ± 92.5 m; p < 0.05). Caution should be exercised when using match-load (PZ) and training-load (GPS) data interchangeably.

Theory of fractional order elements based impedance matching networks

KAUST Repository

Radwan, Ahmed G.; Shamim, Atif; Salama, Khaled N.

2011-01-01

pairs of completely identical circles. They appear to be single for the conventional integer order case, where the identical circles completely overlap each other. The concept is supported by design equations and impedance matching examples. © 2010 IEEE.

Quantum learning and universal quantum matching machine

International Nuclear Information System (INIS)

Sasaki, Masahide; Carlini, Alberto

2002-01-01

Suppose that three kinds of quantum systems are given in some unknown states vertical bar f> xN , vertical bar g 1 > xK , and vertical bar g 2 > xK , and we want to decide which template state vertical bar g 1 > or vertical bar g 2 >, each representing the feature of the pattern class C 1 or C 2 , respectively, is closest to the input feature state vertical bar f>. This is an extension of the pattern matching problem into the quantum domain. Assuming that these states are known a priori to belong to a certain parametric family of pure qubit systems, we derive two kinds of matching strategies. The first one is a semiclassical strategy that is obtained by the natural extension of conventional matching strategies and consists of a two-stage procedure: identification (estimation) of the unknown template states to design the classifier (learning process to train the classifier) and classification of the input system into the appropriate pattern class based on the estimated results. The other is a fully quantum strategy without any intermediate measurement, which we might call as the universal quantum matching machine. We present the Bayes optimal solutions for both strategies in the case of K=1, showing that there certainly exists a fully quantum matching procedure that is strictly superior to the straightforward semiclassical extension of the conventional matching strategy based on the learning process

Object Detection Based on Template Matching through Use of Best-So-Far ABC

Directory of Open Access Journals (Sweden)

Anan Banharnsakun

2014-01-01

Full Text Available Best-so-far ABC is a modified version of the artificial bee colony (ABC algorithm used for optimization tasks. This algorithm is one of the swarm intelligence (SI algorithms proposed in recent literature, in which the results demonstrated that the best-so-far ABC can produce higher quality solutions with faster convergence than either the ordinary ABC or the current state-of-the-art ABC-based algorithm. In this work, we aim to apply the best-so-far ABC-based approach for object detection based on template matching by using the difference between the RGB level histograms corresponding to the target object and the template object as the objective function. Results confirm that the proposed method was successful in both detecting objects and optimizing the time used to reach the solution.

Improving multiple-point-based a priori models for inverse problems by combining Sequential Simulation with the Frequency Matching Method

DEFF Research Database (Denmark)

Cordua, Knud Skou; Hansen, Thomas Mejer; Lange, Katrine

In order to move beyond simplified covariance based a priori models, which are typically used for inverse problems, more complex multiple-point-based a priori models have to be considered. By means of marginal probability distributions ‘learned’ from a training image, sequential simulation has...... proven to be an efficient way of obtaining multiple realizations that honor the same multiple-point statistics as the training image. The frequency matching method provides an alternative way of formulating multiple-point-based a priori models. In this strategy the pattern frequency distributions (i.......e. marginals) of the training image and a subsurface model are matched in order to obtain a solution with the same multiple-point statistics as the training image. Sequential Gibbs sampling is a simulation strategy that provides an efficient way of applying sequential simulation based algorithms as a priori...

Improved SURF Algorithm and Its Application in Seabed Relief Image Matching

Directory of Open Access Journals (Sweden)

Zhang Hong-Mei

2017-01-01

Full Text Available The matching based on seabed relief image is widely used in underwater relief matching navigation and target recognition, etc. However, being influenced by various factors, some conventional matching algorithms are difficult to obtain an ideal result in the matching of seabed relief image. SURF(Speeded Up Robust Features algorithm is based on feature points pair to achieve matching, and can get good results in the seabed relief image matching. However, in practical applications, the traditional SURF algorithm is easy to get false matching, especially when the area’s features are similar or not obvious, the problem is more seriously. In order to improve the robustness of the algorithm, this paper proposes an improved matching algorithm, which combines the SURF, and RANSAC (Random Sample Consensus algorithms. The new algorithm integrates the two algorithms advantages, firstly, the SURF algorithm is applied to detect and extract the feature points then to pre-match. Secondly, RANSAC algorithm is utilized to eliminate mismatching points, and then the accurate matching is accomplished with the correct matching points. The experimental results show that the improved algorithm overcomes the mismatching problem effectively and have better precision and faster speed than the traditional SURF algorithm.

Indonesian name matching using machine learning supervised approach

Science.gov (United States)

Alifikri, Mohamad; Arif Bijaksana, Moch.

2018-03-01

Most existing name matching methods are developed for English language and so they cover the characteristics of this language. Up to this moment, there is no specific one has been designed and implemented for Indonesian names. The purpose of this thesis is to develop Indonesian name matching dataset as a contribution to academic research and to propose suitable feature set by utilizing combination of context of name strings and its permute-winkler score. Machine learning classification algorithms is taken as the method for performing name matching. Based on the experiments, by using tuned Random Forest algorithm and proposed features, there is an improvement of matching performance by approximately 1.7% and it is able to reduce until 70% misclassification result of the state of the arts methods. This improving performance makes the matching system more effective and reduces the risk of misclassified matches.

Fiber cavities with integrated mode matching optics.

Science.gov (United States)

Gulati, Gurpreet Kaur; Takahashi, Hiroki; Podoliak, Nina; Horak, Peter; Keller, Matthias

2017-07-17

In fiber based Fabry-Pérot Cavities (FFPCs), limited spatial mode matching between the cavity mode and input/output modes has been the main hindrance for many applications. We have demonstrated a versatile mode matching method for FFPCs. Our novel design employs an assembly of a graded-index and large core multimode fiber directly spliced to a single mode fiber. This all-fiber assembly transforms the propagating mode of the single mode fiber to match with the mode of a FFPC. As a result, we have measured a mode matching of 90% for a cavity length of ~400 μm. This is a significant improvement compared to conventional FFPCs coupled with just a single mode fiber, especially at long cavity lengths. Adjusting the parameters of the assembly, the fundamental cavity mode can be matched with the mode of almost any single mode fiber, making this approach highly versatile and integrable.

A novel method for EMG decomposition based on matched filters

Directory of Open Access Journals (Sweden)

Ailton Luiz Dias Siqueira Júnior

Full Text Available Introduction Decomposition of electromyography (EMG signals into the constituent motor unit action potentials (MUAPs can allow for deeper insights into the underlying processes associated with the neuromuscular system. The vast majority of the methods for EMG decomposition found in the literature depend on complex algorithms and specific instrumentation. As an attempt to contribute to solving these issues, we propose a method based on a bank of matched filters for the decomposition of EMG signals. Methods Four main units comprise our method: a bank of matched filters, a peak detector, a motor unit classifier and an overlapping resolution module. The system’s performance was evaluated with simulated and real EMG data. Classification accuracy was measured by comparing the responses of the system with known data from the simulator and with the annotations of a human expert. Results The results show that decomposition of non-overlapping MUAPs can be achieved with up to 99% accuracy for signals with up to 10 active motor units and a signal-to-noise ratio (SNR of 10 dB. For overlapping MUAPs with up to 10 motor units per signal and a SNR of 20 dB, the technique allows for correct classification of approximately 71% of the MUAPs. The method is capable of processing, decomposing and classifying a 50 ms window of data in less than 5 ms using a standard desktop computer. Conclusion This article contributes to the ongoing research on EMG decomposition by describing a novel technique capable of delivering high rates of success by means of a fast algorithm, suggesting its possible use in future real-time embedded applications, such as myoelectric prostheses control and biofeedback systems.

Underwater Acoustic Matched Field Imaging Based on Compressed Sensing

Directory of Open Access Journals (Sweden)

Huichen Yan

2015-10-01

Full Text Available Matched field processing (MFP is an effective method for underwater target imaging and localizing, but its performance is not guaranteed due to the nonuniqueness and instability problems caused by the underdetermined essence of MFP. By exploiting the sparsity of the targets in an imaging area, this paper proposes a compressive sensing MFP (CS-MFP model from wave propagation theory by using randomly deployed sensors. In addition, the model’s recovery performance is investigated by exploring the lower bounds of the coherence parameter of the CS dictionary. Furthermore, this paper analyzes the robustness of CS-MFP with respect to the displacement of the sensors. Subsequently, a coherence-excluding coherence optimized orthogonal matching pursuit (CCOOMP algorithm is proposed to overcome the high coherent dictionary problem in special cases. Finally, some numerical experiments are provided to demonstrate the effectiveness of the proposed CS-MFP method.

Mode-matching strategies in slowly varying engine ducts

NARCIS (Netherlands)

Ovenden, N.C.; Rienstra, S.W.

2003-01-01

A matching method is proposed to connect the CFD source region to the CAA propagation region of rotorstator interaction sound produced in a turbofan engine. The method is based on a modal decomposition across three neighbouring axial interfaces adjacent to the matching interface. The modal

Multi-image Matching of Airborne SAR Imagery by SANCC

Directory of Open Access Journals (Sweden)

DING Hao

2015-03-01

Full Text Available In order to improve accuracy of SAR matching, a multi-image matching method based on sum of adaptive normalized cross-correlation (SANCC is proposed. It utilizes geometrical and radiometric information of multi-baselinesynthetic aperture radar (SARimages effectively. Firstly, imaging parameters, platform parameters and approximate digital surface model (DSM are used to predict matching line. Secondly, similarity and proximity in Gestalt theory are introduced to SANCC, and SANCC measures of potential matching points along the matching line are calculated. Thirdly, multi-image matching results and object coordinates of matching points are obtained by winner-take-all (WTA optimization strategy. The approach has been demonstrated with airborne SAR images acquired by a Chinese airborne SAR system (CASMSAR system. The experimental results indicate that the proposed algorithm is effective for providing dense and accuracy matching points, reducing the number of mismatches caused by repeated textures, and offering a better solution to match in poor textured areas.

Defining the XML schema matching problem for a personal schema based query answering system

NARCIS (Netherlands)

Smiljanic, M.; van Keulen, Maurice; Jonker, Willem

In this report, we analyze the problem of personal schema matching. We define the ingredients of the XML schema matching problem using constraint logic programming. This allows us to thourougly investigate specific matching problems. We do not have the ambition to provide for a formalism that covers

Preparing ITER ICRF: development and analysis of the load resilient matching systems based on antenna mock-up measurements

International Nuclear Information System (INIS)

Messiaen, A.; Vervier, M.; Dumortier, P.; Grine, D.; Lamalle, P.U.; Durodie, F.; Koch, R.; Louche, F.; Weynants, R.

2009-01-01

The reference design for the ICRF antenna of ITER is constituted by a tight array of 24 straps grouped in eight triplets. The matching network must be load resilient for operation in ELMy discharges and must have antenna spectrum control for heating or current drive operation. The load resilience is based on the use of either hybrid couplers or conjugate-T circuits. However, the mutual coupling between the triplets at the low expected loading strongly counteracts the load resilience and the spectrum control. Using a mock-up of the ITER antenna array with adjustable water load matching solutions are designed. These solutions are derived from transmission line modelling based on the measured scattering matrix and are finally tested. We show that the array current spectrum can be controlled by the anti-node voltage distribution and that suitable decoupler circuits can not only neutralize the adverse mutual coupling effects but also monitor this anti-node voltage distribution. A matching solution using four 3 dB hybrids and the antenna current spectrum feedback control by the decouplers provides outstanding performance if each pair of poloidal triplets undergoes a same load variation. Finally, it is verified by modelling that this matching scenario has the same antenna spectrum and load resilience performances as the antenna array loaded by plasma as described by the TOPICA simulation. This is true for any phasing and frequency in the ITER frequency band. The conjugate-T solution is presently considered as a back-up option.

High Performance Embedded System for Real-Time Pattern Matching

CERN Document Server

Sotiropoulou, Calliope Louisa; The ATLAS collaboration; Gkaitatzis, Stamatios; Citraro, Saverio; Giannetti, Paola; Dell'Orso, Mauro

2016-01-01

In this paper we present an innovative and high performance embedded system for real-time pattern matching. This system is based on the evolution of hardware and algorithms developed for the field of High Energy Physics (HEP) and more specifically for the execution of extremely fast pattern matching for tracking of particles produced by proton-proton collisions in hadron collider experiments. A miniaturised version of this complex system is being developed for pattern matching in generic image processing applications. The system works as a contour identifier able to extract the salient features of an image. It is based on the principles of cognitive image processing, which means that it executes fast pattern matching and data reduction mimicking the operation of the human brain. The pattern matching can be executed by a custom designed Associative Memory (AM) chip. The reference patterns are chosen by a complex training algorithm implemented on an FPGA device. Post processing algorithms (e.g. pixel clustering...

Probabilistic seismic history matching using binary images

Science.gov (United States)

Davolio, Alessandra; Schiozer, Denis Jose

2018-02-01

Currently, the goal of history-matching procedures is not only to provide a model matching any observed data but also to generate multiple matched models to properly handle uncertainties. One such approach is a probabilistic history-matching methodology based on the discrete Latin Hypercube sampling algorithm, proposed in previous works, which was particularly efficient for matching well data (production rates and pressure). 4D seismic (4DS) data have been increasingly included into history-matching procedures. A key issue in seismic history matching (SHM) is to transfer data into a common domain: impedance, amplitude or pressure, and saturation. In any case, seismic inversions and/or modeling are required, which can be time consuming. An alternative to avoid these procedures is using binary images in SHM as they allow the shape, rather than the physical values, of observed anomalies to be matched. This work presents the incorporation of binary images in SHM within the aforementioned probabilistic history matching. The application was performed with real data from a segment of the Norne benchmark case that presents strong 4D anomalies, including softening signals due to pressure build up. The binary images are used to match the pressurized zones observed in time-lapse data. Three history matchings were conducted using: only well data, well and 4DS data, and only 4DS. The methodology is very flexible and successfully utilized the addition of binary images for seismic objective functions. Results proved the good convergence of the method in few iterations for all three cases. The matched models of the first two cases provided the best results, with similar well matching quality. The second case provided models presenting pore pressure changes according to the expected dynamic behavior (pressurized zones) observed on 4DS data. The use of binary images in SHM is relatively new with few examples in the literature. This work enriches this discussion by presenting a new

Security and matching of partial fingerprint recognition systems

Science.gov (United States)

Jea, Tsai-Yang; Chavan, Viraj S.; Govindaraju, Venu; Schneider, John K.

2004-08-01

Despite advances in fingerprint identification techniques, matching incomplete or partial fingerprints still poses a difficult challenge. While the introduction of compact silicon chip-based sensors that capture only a part of the fingerprint area have made this problem important from a commercial perspective, there is also considerable interest on the topic for processing partial and latent fingerprints obtained at crime scenes. Attempts to match partial fingerprints using singular ridge structures-based alignment techniques fail when the partial print does not include such structures (e.g., core or delta). We present a multi-path fingerprint matching approach that utilizes localized secondary features derived using only the relative information of minutiae. Since the minutia-based fingerprint representation, is an ANSI-NIST standard, our approach has the advantage of being directly applicable to already existing databases. We also analyze the vulnerability of partial fingerprint identification systems to brute force attacks. The described matching approach has been tested on one of FVC2002"s DB1 database11. The experimental results show that our approach achieves an equal error rate of 1.25% and a total error rate of 1.8% (with FAR at 0.2% and FRR at 1.6%).

High performance embedded system for real-time pattern matching

Energy Technology Data Exchange (ETDEWEB)

Sotiropoulou, C.-L., E-mail: c.sotiropoulou@cern.ch [University of Pisa, Largo B. Pontecorvo 3, 56127 Pisa (Italy); INFN-Pisa Section, Largo B. Pontecorvo 3, 56127 Pisa (Italy); Luciano, P. [University of Cassino and Southern Lazio, Gaetano di Biasio 43, Cassino 03043 (Italy); INFN-Pisa Section, Largo B. Pontecorvo 3, 56127 Pisa (Italy); Gkaitatzis, S. [Aristotle University of Thessaloniki, 54124 Thessaloniki (Greece); Citraro, S. [University of Pisa, Largo B. Pontecorvo 3, 56127 Pisa (Italy); INFN-Pisa Section, Largo B. Pontecorvo 3, 56127 Pisa (Italy); Giannetti, P. [INFN-Pisa Section, Largo B. Pontecorvo 3, 56127 Pisa (Italy); Dell' Orso, M. [University of Pisa, Largo B. Pontecorvo 3, 56127 Pisa (Italy); INFN-Pisa Section, Largo B. Pontecorvo 3, 56127 Pisa (Italy)

2017-02-11

In this paper we present an innovative and high performance embedded system for real-time pattern matching. This system is based on the evolution of hardware and algorithms developed for the field of High Energy Physics and more specifically for the execution of extremely fast pattern matching for tracking of particles produced by proton–proton collisions in hadron collider experiments. A miniaturized version of this complex system is being developed for pattern matching in generic image processing applications. The system works as a contour identifier able to extract the salient features of an image. It is based on the principles of cognitive image processing, which means that it executes fast pattern matching and data reduction mimicking the operation of the human brain. The pattern matching can be executed by a custom designed Associative Memory chip. The reference patterns are chosen by a complex training algorithm implemented on an FPGA device. Post processing algorithms (e.g. pixel clustering) are also implemented on the FPGA. The pattern matching can be executed on a 2D or 3D space, on black and white or grayscale images, depending on the application and thus increasing exponentially the processing requirements of the system. We present the firmware implementation of the training and pattern matching algorithm, performance and results on a latest generation Xilinx Kintex Ultrascale FPGA device. - Highlights: • A high performance embedded system for real-time pattern matching is proposed. • It is based on a system developed for High Energy Physics experiment triggers. • It mimics the operation of the human brain (cognitive image processing). • The process can be executed on 2D and 3D, black and white or grayscale images. • The implementation uses FPGAs and custom designed associative memory (AM) chips.

High performance embedded system for real-time pattern matching

International Nuclear Information System (INIS)

Sotiropoulou, C.-L.; Luciano, P.; Gkaitatzis, S.; Citraro, S.; Giannetti, P.; Dell'Orso, M.

2017-01-01

In this paper we present an innovative and high performance embedded system for real-time pattern matching. This system is based on the evolution of hardware and algorithms developed for the field of High Energy Physics and more specifically for the execution of extremely fast pattern matching for tracking of particles produced by proton–proton collisions in hadron collider experiments. A miniaturized version of this complex system is being developed for pattern matching in generic image processing applications. The system works as a contour identifier able to extract the salient features of an image. It is based on the principles of cognitive image processing, which means that it executes fast pattern matching and data reduction mimicking the operation of the human brain. The pattern matching can be executed by a custom designed Associative Memory chip. The reference patterns are chosen by a complex training algorithm implemented on an FPGA device. Post processing algorithms (e.g. pixel clustering) are also implemented on the FPGA. The pattern matching can be executed on a 2D or 3D space, on black and white or grayscale images, depending on the application and thus increasing exponentially the processing requirements of the system. We present the firmware implementation of the training and pattern matching algorithm, performance and results on a latest generation Xilinx Kintex Ultrascale FPGA device. - Highlights: • A high performance embedded system for real-time pattern matching is proposed. • It is based on a system developed for High Energy Physics experiment triggers. • It mimics the operation of the human brain (cognitive image processing). • The process can be executed on 2D and 3D, black and white or grayscale images. • The implementation uses FPGAs and custom designed associative memory (AM) chips.

A Matlab-Based Testbed for Integration, Evaluation and Comparison of Heterogeneous Stereo Vision Matching Algorithms

Directory of Open Access Journals (Sweden)

Raul Correal

2016-11-01

Full Text Available Stereo matching is a heavily researched area with a prolific published literature and a broad spectrum of heterogeneous algorithms available in diverse programming languages. This paper presents a Matlab-based testbed that aims to centralize and standardize this variety of both current and prospective stereo matching approaches. The proposed testbed aims to facilitate the application of stereo-based methods to real situations. It allows for configuring and executing algorithms, as well as comparing results, in a fast, easy and friendly setting. Algorithms can be combined so that a series of processes can be chained and executed consecutively, using the output of a process as input for the next; some additional filtering and image processing techniques have been included within the testbed for this purpose. A use case is included to illustrate how these processes are sequenced and its effect on the results for real applications. The testbed has been conceived as a collaborative and incremental open-source project, where its code is accessible and modifiable, with the objective of receiving contributions and releasing future versions to include new algorithms and features. It is currently available online for the research community.

A medium resolution fingerprint matching system

Directory of Open Access Journals (Sweden)

Ayman Mohammad Bahaa-Eldin

2013-09-01

Full Text Available In this paper, a novel minutiae based fingerprint matching system is proposed. The system is suitable for medium resolution fingerprint images obtained by low cost commercial sensors. The paper presents a new thinning algorithm, a new features extraction and representation, and a novel feature distance matching algorithm. The proposed system is rotation and translation invariant and is suitable for complete or partial fingerprint matching. The proposed algorithms are optimized to be executed on low resource environments both in CPU power and memory space. The system was evaluated using a standard fingerprint dataset and good performance and accuracy were achieved under certain image quality requirements. In addition, the proposed system was compared favorably to that of the state of the art systems.

A string matching based algorithm for performance evaluation of ...

Indian Academy of Sciences (India)

In this paper, we have addressed the problem of automated performance evaluation of Mathematical Expression (ME) recognition. Automated evaluation requires that recognition output and ground truth in some editable format like LaTeX, MathML, etc. have to be matched. But standard forms can have extraneous symbols ...

Target Matching Recognition for Satellite Images Based on the Improved FREAK Algorithm

Directory of Open Access Journals (Sweden)

Yantong Chen

2016-01-01

Full Text Available Satellite remote sensing image target matching recognition exhibits poor robustness and accuracy because of the unfit feature extractor and large data quantity. To address this problem, we propose a new feature extraction algorithm for fast target matching recognition that comprises an improved feature from accelerated segment test (FAST feature detector and a binary fast retina key point (FREAK feature descriptor. To improve robustness, we extend the FAST feature detector by applying scale space theory and then transform the feature vector acquired by the FREAK descriptor from decimal into binary. We reduce the quantity of data in the computer and improve matching accuracy by using the binary space. Simulation test results show that our algorithm outperforms other relevant methods in terms of robustness and accuracy.

Hyper thin 3D edge measurement of honeycomb core structures based on the triangular camera-projector layout & phase-based stereo matching.

Science.gov (United States)

Jiang, Hongzhi; Zhao, Huijie; Li, Xudong; Quan, Chenggen

2016-03-07

We propose a novel hyper thin 3D edge measurement technique to measure the profile of 3D outer envelope of honeycomb core structures. The width of the edges of the honeycomb core is less than 0.1 mm. We introduce a triangular layout design consisting of two cameras and one projector to measure hyper thin 3D edges and eliminate data interference from the walls. A phase-shifting algorithm and the multi-frequency heterodyne phase-unwrapping principle are applied for phase retrievals on edges. A new stereo matching method based on phase mapping and epipolar constraint is presented to solve correspondence searching on the edges and remove false matches resulting in 3D outliers. Experimental results demonstrate the effectiveness of the proposed method for measuring the 3D profile of honeycomb core structures.

Person identification based on multiscale matching of cortical images

NARCIS (Netherlands)

Kruizinga, P; Petkov, N; Hertzberger, B; Serazzi, G

1995-01-01

A set of so-called cortical images, motivated by the function of simple cells in the primary visual cortex of mammals, is computed from each of two input images and an image pyramid is constructed for each cortical image. The two sets of cortical image pyramids are matched synchronously and an

High Performance Embedded System for Real-Time Pattern Matching

CERN Document Server

Sotiropoulou, Calliope Louisa; The ATLAS collaboration; Gkaitatzis, Stamatios; Citraro, Saverio; Giannetti, Paola; Dell'Orso, Mauro

2016-01-01

We present an innovative and high performance embedded system for real-time pattern matching. This system is based on the evolution of hardware and algorithms developed for the field of High Energy Physics (HEP) and more specifically for the execution of extremely fast pattern matching for tracking of particles produced by proton-proton collisions in hadron collider experiments. A miniaturized version of this complex system is being developed for pattern matching in generic image processing applications. The design uses the flexibility of Field Programmable Gate Arrays (FPGAs) and the powerful Associative Memory Chip (ASIC) to achieve real-time performance. The system works as a contour identifier able to extract the salient features of an image. It is based on the principles of cognitive image processing, which means that it executes fast pattern matching and data reduction mimicking the operation of the human brain.

Measurement of left ventricular torsion using block-matching-based speckle tracking for two-dimensional echocardiography

Science.gov (United States)

Sun, Feng-Rong; Wang, Xiao-Jing; Wu, Qiang; Yao, Gui-Hua; Zhang, Yun

2013-01-01

Left ventricular (LV) torsion is a sensitive and global index of LV systolic and diastolic function, but how to noninvasively measure it is challenging. Two-dimensional echocardiography and the block-matching based speckle tracking method were used to measure LV torsion. Main advantages of the proposed method over the previous ones are summarized as follows: (1) The method is automatic, except for manually selecting some endocardium points on the end-diastolic frame in initialization step. (2) The diamond search strategy is applied, with a spatial smoothness constraint introduced into the sum of absolute differences matching criterion; and the reference frame during the search is determined adaptively. (3) The method is capable of removing abnormal measurement data automatically. The proposed method was validated against that using Doppler tissue imaging and some preliminary clinical experimental studies were presented to illustrate clinical values of the proposed method.

Análise exploratória das escalas de silhuetas bidimensionais e tridimensionais adaptadas para a pessoa com cegueira Exploratory analysis of two dimensional and three dimensional silhouette scales for persons with blindness

Directory of Open Access Journals (Sweden)

Fabiane Frota da Rocha Morgado

2010-04-01

Full Text Available Realizar uma análise exploratória da Escala de Silhuetas Bidimensionais (ESB e da Escala de Silhuetas Tridimensionais (EST, verificando qual destas Escalas é a mais apropriada e representativa à pessoa com cegueira congênita. Trata-se de uma pesquisa qualitativa e exploratória. A amostra foi composta por 20 sujeitos adultos com cegueira congênita. Foram entrevistados 10 homens e 10 mulheres, com idades entre 21 e 50 anos, do Instituto Benjamin Constant, no Rio de Janeiro e da Associação dos Cegos de Juiz de Fora, MG. Os Instrumentos para coleta de dados foram: ESB, EST e roteiro de entrevista semiestruturada. A estratégia adotada para tratar os dados foi a Análise de Conteúdo de Bardin. Foram formadas três grandes categorias: 1 Principais vias de informações sobre o corpo, subdividida em: tato; informações sobre peso e altura; informações das pessoas do convívio; informações culturais; tamanho das roupas e atividade física como referência. 2 Escala de Silhuetas Bidimensionais, subdividida em: não reconhecimento da ESB; dificuldades; utilidades. 3 Escala de Silhuetas Tridimensionais, subdividida em: Reconhecimento da Escala; Relação consigo ou com o outro; Facilidades e preferências da EST. Foi constatado que 90% dos participantes não reconheceram a ESB, enquanto que todos os participantes reconheceram a EST. A EST é a Escala mais apropriada e representativa para a pessoa com cegueira congênita. Sugere-se a realização de estudos futuros que visem avaliar as qualidades psicométricas da EST.The aim of the study was to conduct an exploratory analysis of the two dimensional and three dimensional Silhouette Scales (2SS and 3SS so as to determine which one is most suitable and meaningful for persons that are congenitally blind. This is a qualitative and exploratory study. The sample was composed of 20 adult congenitally blind subjects. Ten men and 10 women aged between 21 and 50 years of age from the Benjamin Constant

Experiences with string matching on the Fermi Architecture

Energy Technology Data Exchange (ETDEWEB)

Tumeo, Antonino; Secchi, Simone; Villa, Oreste

2011-02-25

String matching is at the core of many real-world applications, such as security, bioinformatic, data mining. All these applications requires the ability to match always growing data sets against large dictionaries effectively, fastly and possibly in real time. Unfortunately, string matching is a computationally intensive procedure which poses significant challenges on current software and hardware implementations. Graphic Processing Units (GPU) have become an interesting target for such high-throughput applications, but the algorithms and the data structures need to be redesigned to be parallelized and adapted to the underlining hardware, coping with the limitations imposed by these architectures. In this paper we present an efficient implementation of the Aho-Corasick string matching algorithm on GPU, showing how we progressively redesigned the algorithm and the data structures to fit on the architecture. We then evaluate the implementation on single and multiple Tesla C2050 (T20 ``Fermi'' based) boards, comparing them to the previous Tesla C1060 (T10 based) solutions and equivalent multicore implementations on x86 CPUs. We discuss the various tradeoffs of the different architectures.

Sensor-Based Auto-Focusing System Using Multi-Scale Feature Extraction and Phase Correlation Matching

Directory of Open Access Journals (Sweden)

Jinbeum Jang

2015-03-01

Full Text Available This paper presents a novel auto-focusing system based on a CMOS sensor containing pixels with different phases. Robust extraction of features in a severely defocused image is the fundamental problem of a phase-difference auto-focusing system. In order to solve this problem, a multi-resolution feature extraction algorithm is proposed. Given the extracted features, the proposed auto-focusing system can provide the ideal focusing position using phase correlation matching. The proposed auto-focusing (AF algorithm consists of four steps: (i acquisition of left and right images using AF points in the region-of-interest; (ii feature extraction in the left image under low illumination and out-of-focus blur; (iii the generation of two feature images using the phase difference between the left and right images; and (iv estimation of the phase shifting vector using phase correlation matching. Since the proposed system accurately estimates the phase difference in the out-of-focus blurred image under low illumination, it can provide faster, more robust auto focusing than existing systems.

Computer face-matching technology using two-dimensional photographs accurately matches the facial gestalt of unrelated individuals with the same syndromic form of intellectual disability.

Science.gov (United States)

Dudding-Byth, Tracy; Baxter, Anne; Holliday, Elizabeth G; Hackett, Anna; O'Donnell, Sheridan; White, Susan M; Attia, John; Brunner, Han; de Vries, Bert; Koolen, David; Kleefstra, Tjitske; Ratwatte, Seshika; Riveros, Carlos; Brain, Steve; Lovell, Brian C

2017-12-19

Massively parallel genetic sequencing allows rapid testing of known intellectual disability (ID) genes. However, the discovery of novel syndromic ID genes requires molecular confirmation in at least a second or a cluster of individuals with an overlapping phenotype or similar facial gestalt. Using computer face-matching technology we report an automated approach to matching the faces of non-identical individuals with the same genetic syndrome within a database of 3681 images [1600 images of one of 10 genetic syndrome subgroups together with 2081 control images]. Using the leave-one-out method, two research questions were specified: 1) Using two-dimensional (2D) photographs of individuals with one of 10 genetic syndromes within a database of images, did the technology correctly identify more than expected by chance: i) a top match? ii) at least one match within the top five matches? or iii) at least one in the top 10 with an individual from the same syndrome subgroup? 2) Was there concordance between correct technology-based matches and whether two out of three clinical geneticists would have considered the diagnosis based on the image alone? The computer face-matching technology correctly identifies a top match, at least one correct match in the top five and at least one in the top 10 more than expected by chance (P syndromes except Kabuki syndrome. Although the accuracy of the computer face-matching technology was tested on images of individuals with known syndromic forms of intellectual disability, the results of this pilot study illustrate the potential utility of face-matching technology within deep phenotyping platforms to facilitate the interpretation of DNA sequencing data for individuals who remain undiagnosed despite testing the known developmental disorder genes.

Improved peak detection in mass spectrum by incorporating continuous wavelet transform-based pattern matching.

Science.gov (United States)

Du, Pan; Kibbe, Warren A; Lin, Simon M

2006-09-01

A major problem for current peak detection algorithms is that noise in mass spectrometry (MS) spectra gives rise to a high rate of false positives. The false positive rate is especially problematic in detecting peaks with low amplitudes. Usually, various baseline correction algorithms and smoothing methods are applied before attempting peak detection. This approach is very sensitive to the amount of smoothing and aggressiveness of the baseline correction, which contribute to making peak detection results inconsistent between runs, instrumentation and analysis methods. Most peak detection algorithms simply identify peaks based on amplitude, ignoring the additional information present in the shape of the peaks in a spectrum. In our experience, 'true' peaks have characteristic shapes, and providing a shape-matching function that provides a 'goodness of fit' coefficient should provide a more robust peak identification method. Based on these observations, a continuous wavelet transform (CWT)-based peak detection algorithm has been devised that identifies peaks with different scales and amplitudes. By transforming the spectrum into wavelet space, the pattern-matching problem is simplified and in addition provides a powerful technique for identifying and separating the signal from the spike noise and colored noise. This transformation, with the additional information provided by the 2D CWT coefficients can greatly enhance the effective signal-to-noise ratio. Furthermore, with this technique no baseline removal or peak smoothing preprocessing steps are required before peak detection, and this improves the robustness of peak detection under a variety of conditions. The algorithm was evaluated with SELDI-TOF spectra with known polypeptide positions. Comparisons with two other popular algorithms were performed. The results show the CWT-based algorithm can identify both strong and weak peaks while keeping false positive rate low. The algorithm is implemented in R and will be

Fast and accurate phylogeny reconstruction using filtered spaced-word matches

Science.gov (United States)

Sohrabi-Jahromi, Salma; Morgenstern, Burkhard

2017-01-01

Abstract Motivation: Word-based or ‘alignment-free’ algorithms are increasingly used for phylogeny reconstruction and genome comparison, since they are much faster than traditional approaches that are based on full sequence alignments. Existing alignment-free programs, however, are less accurate than alignment-based methods. Results: We propose Filtered Spaced Word Matches (FSWM), a fast alignment-free approach to estimate phylogenetic distances between large genomic sequences. For a pre-defined binary pattern of match and don’t-care positions, FSWM rapidly identifies spaced word-matches between input sequences, i.e. gap-free local alignments with matching nucleotides at the match positions and with mismatches allowed at the don’t-care positions. We then estimate the number of nucleotide substitutions per site by considering the nucleotides aligned at the don’t-care positions of the identified spaced-word matches. To reduce the noise from spurious random matches, we use a filtering procedure where we discard all spaced-word matches for which the overall similarity between the aligned segments is below a threshold. We show that our approach can accurately estimate substitution frequencies even for distantly related sequences that cannot be analyzed with existing alignment-free methods; phylogenetic trees constructed with FSWM distances are of high quality. A program run on a pair of eukaryotic genomes of a few hundred Mb each takes a few minutes. Availability and Implementation: The program source code for FSWM including a documentation, as well as the software that we used to generate artificial genome sequences are freely available at http://fswm.gobics.de/ Contact: chris.leimeister@stud.uni-goettingen.de Supplementary information: Supplementary data are available at Bioinformatics online. PMID:28073754

Metabolic power demands of rugby league match play.

Science.gov (United States)

Kempton, Tom; Sirotic, Anita Claire; Rampinini, Ermanno; Coutts, Aaron James

2015-01-01

To describe the metabolic demands of rugby league match play for positional groups and compare match distances obtained from high-speed-running classifications with those derived from high metabolic power. Global positioning system (GPS) data were collected from 25 players from a team competing in the National Rugby League competition over 39 matches. Players were classified into positional groups (adjustables, outside backs, hit-up forwards, and wide-running forwards). The GPS devices provided instantaneous raw velocity data at 5 Hz, which were exported to a customized spreadsheet. The spreadsheet provided calculations for speed-based distances (eg, total distance; high-speed running, >14.4 km/h; and very-high-speed running, >18.1 km/h) and metabolic-power variables (eg, energy expenditure; average metabolic power; and high-power distance, >20 W/kg). The data show that speed-based distances and metabolic power varied between positional groups, although this was largely related to differences in time spent on field. The distance covered at high running speed was lower than that obtained from high-power thresholds for all positional groups; however, the difference between the 2 methods was greatest for hit-up forwards and adjustables. Positional differences existed for all metabolic parameters, although these are at least partially related to time spent on the field. Higher-speed running may underestimate the demands of match play when compared with high-power distance-although the degree of difference between the measures varied by position. The analysis of metabolic power may complement traditional speed-based classifications and improve our understanding of the demands of rugby league match play.

Post-decomposition optimizations using pattern matching and rule-based clustering for multi-patterning technology

Science.gov (United States)

Wang, Lynn T.-N.; Madhavan, Sriram

2018-03-01

A pattern matching and rule-based polygon clustering methodology with DFM scoring is proposed to detect decomposition-induced manufacturability detractors and fix the layout designs prior to manufacturing. A pattern matcher scans the layout for pre-characterized patterns from a library. If a pattern were detected, rule-based clustering identifies the neighboring polygons that interact with those captured by the pattern. Then, DFM scores are computed for the possible layout fixes: the fix with the best score is applied. The proposed methodology was applied to two 20nm products with a chip area of 11 mm2 on the metal 2 layer. All the hotspots were resolved. The number of DFM spacing violations decreased by 7-15%.

Venous thromboembolism after induced abortion: a population-based, propensity-score-matched cohort study in Canada.

Science.gov (United States)

Liu, Ning; Vigod, Simone N; Farrugia, M Michèle; Urquia, Marcelo L; Ray, Joel G

2018-06-08

A woman's risk of venous thromboembolism during pregnancy is estimated to be two-to-six times higher than her risk when she is not pregnant. Such risk estimates are largely based on pregnancies that result in delivery of a newborn baby; no estimates exist for the risk of venous thromboembolism after induced abortion, another common pregnancy outcome. To fill this knowledge gap, we aimed to assess the risk of venous thromboembolism in women whose first pregnancy ended with induced abortion. We did this propensity score-matched cohort study using data from the universal health-care system of Ontario, Canada. We included primigravid women who had an induced abortion between Jan 1, 2003, and Dec 31, 2015, and used a propensity score to match them to primigravid women who had a livebirth (1:1) or nulligravid women who were not pregnant on the procedure date of their matched counterpart and who did not conceive within 1 year afterwards (5:1). We excluded from our analysis women younger than 15 years or older than 49 years and individuals who had missing or invalid information about their sex, area of residence, residential income, or world region of origin. The primary outcome was risk of any venous thromboembolism within 42 days of the index date (defined as the date of an induced abortion, delivery date for livebirth, or for non-pregnant women the induced abortion date of their matched counterpart). We compared the rate of venous thromboembolism in primigravid women who had an induced abortion with the rate of venous thromboembolism in propensity-score-matched non-pregnant women and propensity-score-matched primigravid women whose pregnancy ended with a livebirth. We generated hazard ratios (HRs) of 42-day risk of venous thromboembolism after induced abortion using Cox proportional hazard models. We identified 194 086 eligible women whose first pregnancy ended with induced abortion, of whom 176 001 (90·7%) could be matched with women whose first pregnancy ended in

Reliability of visual and instrumental color matching.

Science.gov (United States)

Igiel, Christopher; Lehmann, Karl Martin; Ghinea, Razvan; Weyhrauch, Michael; Hangx, Ysbrand; Scheller, Herbert; Paravina, Rade D

2017-09-01

The aim of this investigation was to evaluate intra-rater and inter-rater reliability of visual and instrumental shade matching. Forty individuals with normal color perception participated in this study. The right maxillary central incisor of a teaching model was prepared and restored with 10 feldspathic all-ceramic crowns of different shades. A shade matching session consisted of the observer (rater) visually selecting the best match by using VITA classical A1-D4 (VC) and VITA Toothguide 3D Master (3D) shade guides and the VITA Easyshade Advance intraoral spectrophotometer (ES) to obtain both VC and 3D matches. Three shade matching sessions were held with 4 to 6 weeks between sessions. Intra-rater reliability was assessed based on the percentage of agreement for the three sessions for the same observer, whereas the inter-rater reliability was calculated as mean percentage of agreement between different observers. The Fleiss' Kappa statistical analysis was used to evaluate visual inter-rater reliability. The mean intra-rater reliability for the visual shade selection was 64(11) for VC and 48(10) for 3D. The corresponding ES values were 96(4) for both VC and 3D. The percentages of observers who matched the same shade with VC and 3D were 55(10) and 43(12), respectively, while corresponding ES values were 88(8) for VC and 92(4) for 3D. The results for visual shade matching exhibited a high to moderate level of inconsistency for both intra-rater and inter-rater comparisons. The VITA Easyshade Advance intraoral spectrophotometer exhibited significantly better reliability compared with visual shade selection. This study evaluates the ability of observers to consistently match the same shade visually and with a dental spectrophotometer in different sessions. The intra-rater and inter-rater reliability (agreement of repeated shade matching) of visual and instrumental tooth color matching strongly suggest the use of color matching instruments as a supplementary tool in

Application of Pareto optimization method for ontology matching in nuclear reactor domain

International Nuclear Information System (INIS)

Meenachi, N. Madurai; Baba, M. Sai

2017-01-01

This article describes the need for ontology matching and describes the methods to achieve the same. Efforts are put in the implementation of the semantic web based knowledge management system for nuclear domain which necessitated use of the methods for development of ontology matching. In order to exchange information in a distributed environment, ontology mapping has been used. The constraints in matching the ontology are also discussed. Pareto based ontology matching algorithm is used to find the similarity between two ontologies in the nuclear reactor domain. Algorithms like Jaro Winkler distance, Needleman Wunsch algorithm, Bigram, Kull Back and Cosine divergence are employed to demonstrate ontology matching. A case study was carried out to analysis the ontology matching in diversity in the nuclear reactor domain and same was illustrated.

Application of Pareto optimization method for ontology matching in nuclear reactor domain

Energy Technology Data Exchange (ETDEWEB)

Meenachi, N. Madurai [Indira Gandhi Centre for Atomic Research, HBNI, Tamil Nadu (India). Planning and Human Resource Management Div.; Baba, M. Sai [Indira Gandhi Centre for Atomic Research, HBNI, Tamil Nadu (India). Resources Management Group

2017-12-15

This article describes the need for ontology matching and describes the methods to achieve the same. Efforts are put in the implementation of the semantic web based knowledge management system for nuclear domain which necessitated use of the methods for development of ontology matching. In order to exchange information in a distributed environment, ontology mapping has been used. The constraints in matching the ontology are also discussed. Pareto based ontology matching algorithm is used to find the similarity between two ontologies in the nuclear reactor domain. Algorithms like Jaro Winkler distance, Needleman Wunsch algorithm, Bigram, Kull Back and Cosine divergence are employed to demonstrate ontology matching. A case study was carried out to analysis the ontology matching in diversity in the nuclear reactor domain and same was illustrated.

A Mean-Shift-Based Feature Descriptor for Wide Baseline Stereo Matching

Directory of Open Access Journals (Sweden)

Yiwen Dou

2015-01-01

Full Text Available We propose a novel Mean-Shift-based building approach in wide baseline. Initially, scale-invariance feature transform (SIFT approach is used to extract relatively stable feature points. As to each matching SIFT feature point, it needs a reasonable neighborhood range so as to choose feature points set. Subsequently, in view of selecting repeatable and high robust feature points, Mean-Shift controls corresponding feature scale. At last, our approach is employed to depth image acquirement in wide baseline and Graph Cut algorithm optimizes disparity information. Compared with the existing methods such as SIFT, speeded up robust feature (SURF, and normalized cross-correlation (NCC, the presented approach has the advantages of higher robustness and accuracy rate. Experimental results on low resolution image and weak feature description in wide baseline confirm the validity of our approach.

An efficient approach for video action classification based on 3d Zernike moments

OpenAIRE

Lassoued , Imen; Zagrouba , Ezzedine; Chahir , Youssef

2011-01-01

International audience; Action recognition in video and still image is one of the most challenging research topics in pattern recognition and computer vision. This paper proposes a new method for video action classification based on 3D Zernike moments. These last ones aim to capturing both structural and temporal information of a time varying sequence. The originality of this approach consists to represent actions in video sequences by a three-dimension shape obtained from different silhouett...

Matching games: the least core and the nucleolus

NARCIS (Netherlands)

Kern, Walter; Paulusma, Daniël

2003-01-01

A matching game is a cooperative game defined by a graph G = (N, E). The player set is N and the value of a coalition S ⫅ N is defined as the size of a maximum matching in the subgraph induced by S. We show that the nucleolus of such games can be computed efficiently. The result is based on an

Primary tumor resection in metastatic breast cancer: A propensity-matched analysis, 1988-2011 SEER data base.

Science.gov (United States)

Vohra, Nasreen A; Brinkley, Jason; Kachare, Swapnil; Muzaffar, Mahvish

2018-03-02

Primary tumor resection (PTR) in metastatic breast cancer is not a standard treatment modality, and its impact on survival is conflicting. The primary objective of this study was to analyze impact of PTR on survival in metastatic patients with breast cancer. A retrospective study of metastatic patients with breast cancer was conducted using the 1988-2011 Surveillance, Epidemiology, and End Results (SEER) data base. Cox proportional hazards regression models were used to evaluate the relationship between PTR and survival and to adjust for the heterogeneity between the groups, and a propensity score-matched analysis was also performed. A total of 29 916 patients with metastatic breast cancer were included in the study, and 15 129 (51%) of patients underwent primary tumor resection, and 14 787 (49%) patients did not undergo surgery. Overall, decreasing trend in PTR for metastatic breast cancer in last decades was noted. Primary tumor resection was associated with a longer median OS (34 vs 18 months). In a propensity score-matched analysis, prognosis was also more favorable in the resected group (P = .0017). Primary tumor resection in metastatic breast cancer was associated with survival improvement, and the improvement persisted in propensity-matched analysis. © 2018 Wiley Periodicals, Inc.

Fixed-pattern noise correction method based on improved moment matching for a TDI CMOS image sensor.

Science.gov (United States)

Xu, Jiangtao; Nie, Huafeng; Nie, Kaiming; Jin, Weimin

2017-09-01

In this paper, an improved moment matching method based on a spatial correlation filter (SCF) and bilateral filter (BF) is proposed to correct the fixed-pattern noise (FPN) of a time-delay-integration CMOS image sensor (TDI-CIS). First, the values of row FPN (RFPN) and column FPN (CFPN) are estimated and added to the original image through SCF and BF, respectively. Then the filtered image will be processed by an improved moment matching method with a moving window. Experimental results based on a 128-stage TDI-CIS show that, after correcting the FPN in the image captured under uniform illumination, the standard deviation of row mean vector (SDRMV) decreases from 5.6761 LSB to 0.1948 LSB, while the standard deviation of the column mean vector (SDCMV) decreases from 15.2005 LSB to 13.1949LSB. In addition, for different images captured by different TDI-CISs, the average decrease of SDRMV and SDCMV is 5.4922/2.0357 LSB, respectively. Comparative experimental results indicate that the proposed method can effectively correct the FPNs of different TDI-CISs while maintaining image details without any auxiliary equipment.

Fingerprint Identification Using SIFT-Based Minutia Descriptors and Improved All Descriptor-Pair Matching

Directory of Open Access Journals (Sweden)

Jiuqiang Han

2013-03-01

Full Text Available The performance of conventional minutiae-based fingerprint authentication algorithms degrades significantly when dealing with low quality fingerprints with lots of cuts or scratches. A similar degradation of the minutiae-based algorithms is observed when small overlapping areas appear because of the quite narrow width of the sensors. Based on the detection of minutiae, Scale Invariant Feature Transformation (SIFT descriptors are employed to fulfill verification tasks in the above difficult scenarios. However, the original SIFT algorithm is not suitable for fingerprint because of: (1 the similar patterns of parallel ridges; and (2 high computational resource consumption. To enhance the efficiency and effectiveness of the algorithm for fingerprint verification, we propose a SIFT-based Minutia Descriptor (SMD to improve the SIFT algorithm through image processing, descriptor extraction and matcher. A two-step fast matcher, named improved All Descriptor-Pair Matching (iADM, is also proposed to implement the 1:N verifications in real-time. Fingerprint Identification using SMD and iADM (FISiA achieved a significant improvement with respect to accuracy in representative databases compared with the conventional minutiae-based method. The speed of FISiA also can meet real-time requirements.

A Model-Based Approach to Recovering the Structure of a Plant from Images

KAUST Repository

Ward, Ben

2015-03-19

We present a method for recovering the structure of a plant directly from a small set of widely-spaced images for automated analysis of phenotype. Structure recovery is more complex than shape estimation, but the resulting structure estimate is more closely related to phenotype than is a 3D geometric model. The method we propose is applicable to a wide variety of plants, but is demonstrated on wheat. Wheat is composed of thin elements with few identifiable features, making it difficult to analyse using standard feature matching techniques. Our method instead analyses the structure of plants using only their silhouettes. We employ a generate-and-test method, using a database of manually modelled leaves and a model for their composition to synthesise plausible plant structures which are evaluated against the images. The method is capable of efficiently recovering accurate estimates of plant structure in a wide variety of imaging scenarios, without manual intervention.

A Model-Based Approach to Recovering the Structure of a Plant from Images

KAUST Repository

Ward, Ben; Bastian, John; van den Hengel, Anton; Pooley, Daniel; Bari, Rajendra; Berger, Bettina; Tester, Mark A.

2015-01-01

We present a method for recovering the structure of a plant directly from a small set of widely-spaced images for automated analysis of phenotype. Structure recovery is more complex than shape estimation, but the resulting structure estimate is more closely related to phenotype than is a 3D geometric model. The method we propose is applicable to a wide variety of plants, but is demonstrated on wheat. Wheat is composed of thin elements with few identifiable features, making it difficult to analyse using standard feature matching techniques. Our method instead analyses the structure of plants using only their silhouettes. We employ a generate-and-test method, using a database of manually modelled leaves and a model for their composition to synthesise plausible plant structures which are evaluated against the images. The method is capable of efficiently recovering accurate estimates of plant structure in a wide variety of imaging scenarios, without manual intervention.

Matching of Remote Sensing Images with Complex Background Variations via Siamese Convolutional Neural Network

Directory of Open Access Journals (Sweden)

Haiqing He

2018-02-01

Full Text Available Feature-based matching methods have been widely used in remote sensing image matching given their capability to achieve excellent performance despite image geometric and radiometric distortions. However, most of the feature-based methods are unreliable for complex background variations, because the gradient or other image grayscale information used to construct the feature descriptor is sensitive to image background variations. Recently, deep learning-based methods have been proven suitable for high-level feature representation and comparison in image matching. Inspired by the progresses made in deep learning, a new technical framework for remote sensing image matching based on the Siamese convolutional neural network is presented in this paper. First, a Siamese-type network architecture is designed to simultaneously learn the features and the corresponding similarity metric from labeled training examples of matching and non-matching true-color patch pairs. In the proposed network, two streams of convolutional and pooling layers sharing identical weights are arranged without the manually designed features. The number of convolutional layers is determined based on the factors that affect image matching. The sigmoid function is employed to compute the matching and non-matching probabilities in the output layer. Second, a gridding sub-pixel Harris algorithm is used to obtain the accurate localization of candidate matches. Third, a Gaussian pyramid coupling quadtree is adopted to gradually narrow down the searching space of the candidate matches, and multiscale patches are compared synchronously. Subsequently, a similarity measure based on the output of the sigmoid is adopted to find the initial matches. Finally, the random sample consensus algorithm and the whole-to-local quadratic polynomial constraints are used to remove false matches. In the experiments, different types of satellite datasets, such as ZY3, GF1, IKONOS, and Google Earth images

Stability Analysis of Positive Polynomial Fuzzy-Model-Based Control Systems with Time Delay under Imperfect Premise Matching

OpenAIRE

Li, Xiaomiao; Lam, Hak Keung; Song, Ge; Liu, Fucai

2017-01-01

This paper deals with the stability and positivity analysis of polynomial-fuzzy-model-based ({PFMB}) control systems with time delay, which is formed by a polynomial fuzzy model and a polynomial fuzzy controller connected in a closed loop, under imperfect premise matching. To improve the design and realization flexibility, the polynomial fuzzy model and the polynomial fuzzy controller are allowed to have their own set of premise membership functions. A sum-of-squares (SOS)-based stability ana...

Poor textural image tie point matching via graph theory

Science.gov (United States)

Yuan, Xiuxiao; Chen, Shiyu; Yuan, Wei; Cai, Yang

2017-07-01

Feature matching aims to find corresponding points to serve as tie points between images. Robust matching is still a challenging task when input images are characterized by low contrast or contain repetitive patterns, occlusions, or homogeneous textures. In this paper, a novel feature matching algorithm based on graph theory is proposed. This algorithm integrates both geometric and radiometric constraints into an edge-weighted (EW) affinity tensor. Tie points are then obtained by high-order graph matching. Four pairs of poor textural images covering forests, deserts, bare lands, and urban areas are tested. For comparison, three state-of-the-art matching techniques, namely, scale-invariant feature transform (SIFT), speeded up robust features (SURF), and features from accelerated segment test (FAST), are also used. The experimental results show that the matching recall obtained by SIFT, SURF, and FAST varies from 0 to 35% in different types of poor textures. However, through the integration of both geometry and radiometry and the EW strategy, the recall obtained by the proposed algorithm is better than 50% in all four image pairs. The better matching recall improves the number of correct matches, dispersion, and positional accuracy.

Improved LSB matching steganography with histogram characters reserved

Science.gov (United States)

Chen, Zhihong; Liu, Wenyao

2008-03-01

This letter bases on the researches of LSB (least significant bit, i.e. the last bit of a binary pixel value) matching steganographic method and the steganalytic method which aims at histograms of cover images, and proposes a modification to LSB matching. In the LSB matching, if the LSB of the next cover pixel matches the next bit of secret data, do nothing; otherwise, choose to add or subtract one from the cover pixel value at random. In our improved method, a steganographic information table is defined and records the changes which embedded secrete bits introduce in. Through the table, the next LSB which has the same pixel value will be judged to add or subtract one dynamically in order to ensure the histogram's change of cover image is minimized. Therefore, the modified method allows embedding the same payload as the LSB matching but with improved steganographic security and less vulnerability to attacks compared with LSB matching. The experimental results of the new method show that the histograms maintain their attributes, such as peak values and alternative trends, in an acceptable degree and have better performance than LSB matching in the respects of histogram distortion and resistance against existing steganalysis.

Automatic identification of bullet signatures based on consecutive matching striae (CMS) criteria.

Science.gov (United States)

Chu, Wei; Thompson, Robert M; Song, John; Vorburger, Theodore V

2013-09-10

The consecutive matching striae (CMS) numeric criteria for firearm and toolmark identifications have been widely accepted by forensic examiners, although there have been questions concerning its observer subjectivity and limited statistical support. In this paper, based on signal processing and extraction, a model for the automatic and objective counting of CMS is proposed. The position and shape information of the striae on the bullet land is represented by a feature profile, which is used for determining the CMS number automatically. Rapid counting of CMS number provides a basis for ballistics correlations with large databases and further statistical and probability analysis. Experimental results in this report using bullets fired from ten consecutively manufactured barrels support this developed model. Published by Elsevier Ireland Ltd.

[Propensity score matching in SPSS].

Science.gov (United States)

Huang, Fuqiang; DU, Chunlin; Sun, Menghui; Ning, Bing; Luo, Ying; An, Shengli

2015-11-01

To realize propensity score matching in PS Matching module of SPSS and interpret the analysis results. The R software and plug-in that could link with the corresponding versions of SPSS and propensity score matching package were installed. A PS matching module was added in the SPSS interface, and its use was demonstrated with test data. Score estimation and nearest neighbor matching was achieved with the PS matching module, and the results of qualitative and quantitative statistical description and evaluation were presented in the form of a graph matching. Propensity score matching can be accomplished conveniently using SPSS software.

TPS-HAMMER: improving HAMMER registration algorithm by soft correspondence matching and thin-plate splines based deformation interpolation.

Science.gov (United States)

Wu, Guorong; Yap, Pew-Thian; Kim, Minjeong; Shen, Dinggang

2010-02-01

We present an improved MR brain image registration algorithm, called TPS-HAMMER, which is based on the concepts of attribute vectors and hierarchical landmark selection scheme proposed in the highly successful HAMMER registration algorithm. We demonstrate that TPS-HAMMER algorithm yields better registration accuracy, robustness, and speed over HAMMER owing to (1) the employment of soft correspondence matching and (2) the utilization of thin-plate splines (TPS) for sparse-to-dense deformation field generation. These two aspects can be integrated into a unified framework to refine the registration iteratively by alternating between soft correspondence matching and dense deformation field estimation. Compared with HAMMER, TPS-HAMMER affords several advantages: (1) unlike the Gaussian propagation mechanism employed in HAMMER, which can be slow and often leaves unreached blotches in the deformation field, the deformation interpolation in the non-landmark points can be obtained immediately with TPS in our algorithm; (2) the smoothness of deformation field is preserved due to the nice properties of TPS; (3) possible misalignments can be alleviated by allowing the matching of the landmarks with a number of possible candidate points and enforcing more exact matches in the final stages of the registration. Extensive experiments have been conducted, using the original HAMMER as a comparison baseline, to validate the merits of TPS-HAMMER. The results show that TPS-HAMMER yields significant improvement in both accuracy and speed, indicating high applicability for the clinical scenario. Copyright (c) 2009 Elsevier Inc. All rights reserved.

Evaluation of the Match External Load in Soccer: Methods Comparison.

Science.gov (United States)

Castagna, Carlo; Varley, Matthew; Póvoas, Susana C A; D'Ottavio, Stefano

2017-04-01

To test the interchangeability of 2 match-analysis approaches for external-load detection considering arbitrary selected speeds and metabolic power (MP) thresholds in male top-level soccer. Data analyses were performed considering match physical performance of 60 matches (1200 player cases) of randomly selected Spanish, German, and English first-division championship matches (2013-14 season). Match analysis was performed with a validated semiautomated multicamera system operating at 25 Hz. During a match, players covered 10,673 ± 348 m, of which 1778 ± 208 m and 2759 ± 241 m were performed at high intensity, as measured using speed (≥16 km/h, HI) and metabolic power (≥20 W/kg, MPHI) notations. High-intensity notations were nearly perfectly associated (r = .93, P Player high-intensity decelerations (≥-2 m/s 2 ) were very largely associated with MPHI (r = .73, P physical match-analysis methods can be independently used to track match external load in elite-level players. However, match-analyst decisions must be based on use of a single method to avoid bias in external-load determination.

Identification of toxic cyclopeptides based on mass spectral library matching

Directory of Open Access Journals (Sweden)

Boris L. Milman

2014-08-01

Full Text Available To gain perspective on the use of tandem mass spectral libraries for identification of toxic cyclic peptides, the new library was built from 263 mass spectra (mainly MS2 spectra of 59 compounds of that group, such as microcystins, amatoxins, and some related compounds. Mass spectra were extracted from the literature or specially acquired on ESI-Q-ToF and MALDI-ToF/ToF tandem instruments. ESI-MS2 product-ion mass spectra appeared to be rather close to MALDI-ToF/ToF fragment spectra which are uncommon for mass spectral libraries. Testing of the library was based on searches where reference spectra were in turn cross-compared. The percentage of 1st rank correct identifications (true positives was 70% in a general case and 88–91% without including knowingly defective (‘one-dimension’ spectra as test ones. The percentage of 88–91% is the principal estimate for the overall performance of this library that can be used in a method of choice for identification of individual cyclopeptides and also for group recognition of individual classes of such peptides. The approach to identification of cyclopeptides based on mass spectral library matching proved to be the most effective for abundant toxins. That was confirmed by analysis of extracts from two cyanobacterial strains.

Photon signature analysis using template matching

Energy Technology Data Exchange (ETDEWEB)

Bradley, D.A., E-mail: d.a.bradley@surrey.ac.uk [Department of Physics, University of Surrey, Guildford GU2 7XH (United Kingdom); Hashim, S., E-mail: suhairul@utm.my [Department of Physics, Universiti Teknologi Malaysia, 81310 Skudai, Johor (Malaysia); Saripan, M.I. [Faculty of Engineering, Universiti Putra Malaysia, 43400 Serdang, Selangor (Malaysia); Wells, K. [Centre for Vision, Speech and Signal Processing, University of Surrey, Guildford GU2 7XH (United Kingdom); Dunn, W.L. [Department of Mechanical and Nuclear Engineering, Kansas State University, 3002 Rathbone Hall, Manhattan, KS 66506 (United States)

2011-10-01

We describe an approach to detect improvised explosive devices (IEDs) by using a template matching procedure. This approach relies on the signature due to backstreaming {gamma} photons from various targets. In this work we have simulated cylindrical targets of aluminum, iron, copper, water and ammonium nitrate (nitrogen-rich fertilizer). We simulate 3.5 MeV source photons distributed on a plane inside a shielded area using Monte Carlo N-Particle (MCNP{sup TM}) code version 5 (V5). The 3.5 MeV source gamma rays yield 511 keV peaks due to pair production and scattered gamma rays. In this work, we simulate capture of those photons that backstream, after impinging on the target element, toward a NaI detector. The captured backstreamed photons are expected to produce a unique spectrum that will become part of a simple signal processing recognition system based on the template matching method. Different elements were simulated using different sets of random numbers in the Monte Carlo simulation. To date, the sum of absolute differences (SAD) method has been used to match the template. In the examples investigated, template matching was found to detect all elements correctly.

Hierarchical Matching of Traffic Information Services Using Semantic Similarity

Directory of Open Access Journals (Sweden)

Zongtao Duan

2018-01-01

Full Text Available Service matching aims to find the information similar to a given query, which has numerous applications in web search. Although existing methods yield promising results, they are not applicable for transportation. In this paper, we propose a multilevel matching method based on semantic technology, towards efficiently searching the traffic information requested. Our approach is divided into two stages: service clustering, which prunes candidate services that are not promising, and functional matching. The similarity at function level between services is computed by grouping the connections between the services into inheritance and noninheritance relationships. We also developed a three-layer framework with a semantic similarity measure that requires less time and space cost than existing method since the scale of candidate services is significantly smaller than the whole transportation network. The OWL_TC4 based service set was used to verify the proposed approach. The accuracy of offline service clustering reached 93.80%, and it reduced the response time to 651 ms when the total number of candidate services was 1000. Moreover, given the different thresholds for the semantic similarity measure, the proposed mixed matching model did better in terms of recall and precision (i.e., up to 72.7% and 80%, respectively, for more than 1000 services compared to the compared models based on information theory and taxonomic distance. These experimental results confirmed the effectiveness and validity of service matching for responding quickly and accurately to user queries.

Study on a digital pulse processing algorithm based on template-matching for high-throughput spectroscopy

Energy Technology Data Exchange (ETDEWEB)

Wen, Xianfei; Yang, Haori

2015-06-01

A major challenge in utilizing spectroscopy techniques for nuclear safeguards is to perform high-resolution measurements at an ultra-high throughput rate. Traditionally, piled-up pulses are rejected to ensure good energy resolution. To improve throughput rate, high-pass filters are normally implemented to shorten pulses. However, this reduces signal-to-noise ratio and causes degradation in energy resolution. In this work, a pulse pile-up recovery algorithm based on template-matching was proved to be an effective approach to achieve high-throughput gamma ray spectroscopy. First, a discussion of the algorithm was given in detail. Second, the algorithm was then successfully utilized to process simulated piled-up pulses from a scintillator detector. Third, the algorithm was implemented to analyze high rate data from a NaI detector, a silicon drift detector and a HPGe detector. The promising results demonstrated the capability of this algorithm to achieve high-throughput rate without significant sacrifice in energy resolution. The performance of the template-matching algorithm was also compared with traditional shaping methods. - Highlights: • A detailed discussion on the template-matching algorithm was given. • The algorithm was tested on data from a NaI and a Si detector. • The algorithm was successfully implemented on high rate data from a HPGe detector. • The performance of the algorithm was compared with traditional shaping methods. • The advantage of the algorithm in active interrogation was discussed.

A novel cancer vaccine strategy based on HLA-A*0201 matched allogeneic plasmacytoid dendritic cells.

Directory of Open Access Journals (Sweden)

Caroline Aspord

Full Text Available BACKGROUND: The development of effective cancer vaccines still remains a challenge. Despite the crucial role of plasmacytoid dendritic cells (pDCs in anti-tumor responses, their therapeutic potential has not yet been worked out. We explored the relevance of HLA-A*0201 matched allogeneic pDCs as vectors for immunotherapy. METHODS AND FINDINGS: Stimulation of PBMC from HLA-A*0201(+ donors by HLA-A*0201 matched allogeneic pDCs pulsed with tumor-derived peptides triggered high levels of antigen-specific and functional cytotoxic T cell responses (up to 98% tetramer(+ CD8 T cells. The pDC vaccine demonstrated strong anti-tumor therapeutic in vivo efficacy as shown by the inhibition of tumor growth in a humanized mouse model. It also elicited highly functional tumor-specific T cells ex-vivo from PBMC and TIL of stage I-IV melanoma patients. Responses against MelA, GP100, tyrosinase and MAGE-3 antigens reached tetramer levels up to 62%, 24%, 85% and 4.3% respectively. pDC vaccine-primed T cells specifically killed patients' own autologous melanoma tumor cells. This semi-allogeneic pDC vaccine was more effective than conventional myeloid DC-based vaccines. Furthermore, the pDC vaccine design endows it with a strong potential for clinical application in cancer treatment. CONCLUSIONS: These findings highlight HLA-A*0201 matched allogeneic pDCs as potent inducers of tumor immunity and provide a promising immunotherapeutic strategy to fight cancer.

Ontology Based Vocabulary Matching for Oceanographic Instruments

Science.gov (United States)

Chen, Yu; Shepherd, Adam; Chandler, Cyndy; Arko, Robert; Leadbetter, Adam

2014-05-01

Data integration act as the preliminary entry point as we enter the era of big data in many scientific domains. However the reusefulness of various dataset has met the hurdle due to different initial of interests of different parties, therefore different vocabularies in describing similar or semantically related concepts. In this scenario it is vital to devise an automatic or semi-supervised algorithm to facilitate the convergence of different vocabularies. The Ocean Data Interoperability Platform (ODIP) seeks to increase data sharing across scientific domains and international boundaries by providing a forum to harmonize diverse regional data systems. ODIP participants from the US include the Rolling Deck to Repository (R2R) program, whose mission is to capture, catalog, and describe the underway/environmental sensor data from US oceanographic research vessels and submit the data to public long-term archives. In an attempt to harmonize these regional data systems, especially vocabularies, R2R recognizes the value of the SeaDataNet vocabularies served by the NERC Vocabulary Server (NVS) hosted at the British Oceanographic Data Centre as a trusted, authoritative source for describing many oceanographic research concepts such as instrumentation. In this work, we make use of the semantic relations in the vocabularies served by NVS to build a Bayesian network and take advantage of the idea of entropy in evaluating the correlation between different concepts and keywords. The performance of the model is evaluated against matching instruments from R2R against the SeaDataNet instrument vocabularies based on calculated confidence scores in the instrument pairings. These pairings with their scores can then be analyzed for assertion growing the interoperability of the R2R vocabulary through its links to the SeaDataNet entities.

Perturbative matching of continuum and lattice quasi-distributions

Directory of Open Access Journals (Sweden)

Ishikawa Tomomi

2018-01-01

Full Text Available Matching of the quasi parton distribution functions between continuum and lattice is addressed using lattice perturbation theory specifically withWilson-type fermions. The matching is done for nonlocal quark bilinear operators with a straightWilson line in a spatial direction. We also investigate operator mixing in the renormalization and possible O(a operators for the nonlocal operators based on a symmetry argument on lattice.

Hand Depth Image Denoising and Superresolution via Noise-Aware Dictionaries

Directory of Open Access Journals (Sweden)

Huayang Li

2016-01-01

Full Text Available This paper proposes a two-stage method for hand depth image denoising and superresolution, using bilateral filters and learned dictionaries via noise-aware orthogonal matching pursuit (NAOMP based K-SVD. The bilateral filtering phase recovers singular points and removes artifacts on silhouettes by averaging depth data using neighborhood pixels on which both depth difference and RGB similarity restrictions are imposed. The dictionary learning phase uses NAOMP for training dictionaries which separates faithful depth from noisy data. Compared with traditional OMP, NAOMP adds a residual reduction step which effectively weakens the noise term within the residual during the residual decomposition in terms of atoms. Experimental results demonstrate that the bilateral phase and the NAOMP-based learning dictionaries phase corporately denoise both virtual and real depth images effectively.

A Single Camera Motion Capture System for Human-Computer Interaction

Science.gov (United States)

Okada, Ryuzo; Stenger, Björn

This paper presents a method for markerless human motion capture using a single camera. It uses tree-based filtering to efficiently propagate a probability distribution over poses of a 3D body model. The pose vectors and associated shapes are arranged in a tree, which is constructed by hierarchical pairwise clustering, in order to efficiently evaluate the likelihood in each frame. Anew likelihood function based on silhouette matching is proposed that improves the pose estimation of thinner body parts, i. e. the limbs. The dynamic model takes self-occlusion into account by increasing the variance of occluded body-parts, thus allowing for recovery when the body part reappears. We present two applications of our method that work in real-time on a Cell Broadband Engine™: a computer game and a virtual clothing application.

SU-G-BRA-02: Development of a Learning Based Block Matching Algorithm for Ultrasound Tracking in Radiotherapy

Energy Technology Data Exchange (ETDEWEB)

Shepard, A; Bednarz, B [University of Wisconsin, Madison, WI (United States)

2016-06-15

Purpose: To develop an ultrasound learning-based tracking algorithm with the potential to provide real-time motion traces of anatomy-based fiducials that may aid in the effective delivery of external beam radiation. Methods: The algorithm was developed in Matlab R2015a and consists of two main stages: reference frame selection, and localized block matching. Immediately following frame acquisition, a normalized cross-correlation (NCC) similarity metric is used to determine a reference frame most similar to the current frame from a series of training set images that were acquired during a pretreatment scan. Segmented features in the reference frame provide the basis for the localized block matching to determine the feature locations in the current frame. The boundary points of the reference frame segmentation are used as the initial locations for the block matching and NCC is used to find the most similar block in the current frame. The best matched block locations in the current frame comprise the updated feature boundary. The algorithm was tested using five features from two sets of ultrasound patient data obtained from MICCAI 2014 CLUST. Due to the lack of a training set associated with the image sequences, the first 200 frames of the image sets were considered a valid training set for preliminary testing, and tracking was performed over the remaining frames. Results: Tracking of the five vessel features resulted in an average tracking error of 1.21 mm relative to predefined annotations. The average analysis rate was 15.7 FPS with analysis for one of the two patients reaching real-time speeds. Computations were performed on an i5-3230M at 2.60 GHz. Conclusion: Preliminary tests show tracking errors comparable with similar algorithms at close to real-time speeds. Extension of the work onto a GPU platform has the potential to achieve real-time performance, making tracking for therapy applications a feasible option. This work is partially funded by NIH grant R01CA

SU-G-BRA-02: Development of a Learning Based Block Matching Algorithm for Ultrasound Tracking in Radiotherapy

International Nuclear Information System (INIS)

Shepard, A; Bednarz, B

2016-01-01

Purpose: To develop an ultrasound learning-based tracking algorithm with the potential to provide real-time motion traces of anatomy-based fiducials that may aid in the effective delivery of external beam radiation. Methods: The algorithm was developed in Matlab R2015a and consists of two main stages: reference frame selection, and localized block matching. Immediately following frame acquisition, a normalized cross-correlation (NCC) similarity metric is used to determine a reference frame most similar to the current frame from a series of training set images that were acquired during a pretreatment scan. Segmented features in the reference frame provide the basis for the localized block matching to determine the feature locations in the current frame. The boundary points of the reference frame segmentation are used as the initial locations for the block matching and NCC is used to find the most similar block in the current frame. The best matched block locations in the current frame comprise the updated feature boundary. The algorithm was tested using five features from two sets of ultrasound patient data obtained from MICCAI 2014 CLUST. Due to the lack of a training set associated with the image sequences, the first 200 frames of the image sets were considered a valid training set for preliminary testing, and tracking was performed over the remaining frames. Results: Tracking of the five vessel features resulted in an average tracking error of 1.21 mm relative to predefined annotations. The average analysis rate was 15.7 FPS with analysis for one of the two patients reaching real-time speeds. Computations were performed on an i5-3230M at 2.60 GHz. Conclusion: Preliminary tests show tracking errors comparable with similar algorithms at close to real-time speeds. Extension of the work onto a GPU platform has the potential to achieve real-time performance, making tracking for therapy applications a feasible option. This work is partially funded by NIH grant R01CA

Object matching using a locally affine invariant and linear programming techniques.

Science.gov (United States)

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.

Perception without self-matching in conditional tag based cooperation.

Science.gov (United States)

McAvity, David M; Bristow, Tristen; Bunker, Eric; Dreyer, Alex

2013-09-21

We consider a model for the evolution of cooperation in a population where individuals may have one of a number of different heritable and distinguishable markers or tags. Individuals interact with each of their neighbors on a square lattice by either cooperating by donating some benefit at a cost to themselves or defecting by doing nothing. The decision to cooperate or defect is contingent on each individual's perception of its interacting partner's tag. Unlike in other tag-based models individuals do not compare their own tag to that of their interaction partner. That is, there is no self-matching. When perception is perfect the cooperation rate is substantially higher than in the usual spatial prisoner's dilemma game when the cost of cooperation is high. The enhancement in cooperation is positively correlated with the number of different tags. The more diverse a population is the more cooperative it becomes. When individuals start with an inability to perceive tags the population evolves to a state where individuals gain at least partial perception. With some reproduction mechanisms perfect perception evolves, but with others the ability to perceive tags is imperfect. We find that perception of tags evolves to lower levels when the cost of cooperation is higher. Copyright © 2013 Elsevier Ltd. All rights reserved.

Matching based on biological categories in Orangutans (Pongo abelii and a Gorilla (Gorilla gorilla gorilla

Directory of Open Access Journals (Sweden)

Jennifer Vonk

2013-09-01

Full Text Available Following a series of experiments in which six orangutans and one gorilla discriminated photographs of different animal species in a two-choice touch screen procedure, Vonk & MacDonald (2002 and Vonk & MacDonald (2004 concluded that orangutans, but not the gorilla, seemed to learn intermediate level category discriminations, such as primates versus non-primates, more rapidly than they learned concrete level discriminations, such as orangutans versus humans. In the current experiments, four of the same orangutans and the gorilla were presented with delayed matching-to-sample tasks in which they were rewarded for matching photos of different members of the same primate species; golden lion tamarins, Japanese macaques, and proboscis monkeys, or family; gibbons, lemurs (Experiment 1, and subsequently for matching photos of different species within the following classes: birds, reptiles, insects, mammals, and fish (Experiment 2. Members of both Great Ape species were rapidly able to match the photos at levels above chance. Orangutans matched images from both category levels spontaneously whereas the gorilla showed effects of learning to match intermediate level categories. The results show that biological knowledge is not necessary to form natural categories at both concrete and intermediate levels.

Multisensor signal denoising based on matching synchrosqueezing wavelet transform for mechanical fault condition assessment

Science.gov (United States)

Yi, Cancan; Lv, Yong; Xiao, Han; Huang, Tao; You, Guanghui

2018-04-01

Since it is difficult to obtain the accurate running status of mechanical equipment with only one sensor, multisensor measurement technology has attracted extensive attention. In the field of mechanical fault diagnosis and condition assessment based on vibration signal analysis, multisensor signal denoising has emerged as an important tool to improve the reliability of the measurement result. A reassignment technique termed the synchrosqueezing wavelet transform (SWT) has obvious superiority in slow time-varying signal representation and denoising for fault diagnosis applications. The SWT uses the time-frequency reassignment scheme, which can provide signal properties in 2D domains (time and frequency). However, when the measured signal contains strong noise components and fast varying instantaneous frequency, the performance of SWT-based analysis still depends on the accuracy of instantaneous frequency estimation. In this paper, a matching synchrosqueezing wavelet transform (MSWT) is investigated as a potential candidate to replace the conventional synchrosqueezing transform for the applications of denoising and fault feature extraction. The improved technology utilizes the comprehensive instantaneous frequency estimation by chirp rate estimation to achieve a highly concentrated time-frequency representation so that the signal resolution can be significantly improved. To exploit inter-channel dependencies, the multisensor denoising strategy is performed by using a modulated multivariate oscillation model to partition the time-frequency domain; then, the common characteristics of the multivariate data can be effectively identified. Furthermore, a modified universal threshold is utilized to remove noise components, while the signal components of interest can be retained. Thus, a novel MSWT-based multisensor signal denoising algorithm is proposed in this paper. The validity of this method is verified by numerical simulation, and experiments including a rolling

Dense Matching Comparison Between Census and a Convolutional Neural Network Algorithm for Plant Reconstruction

Science.gov (United States)

Xia, Y.; Tian, J.; d'Angelo, P.; Reinartz, P.

2018-05-01

3D reconstruction of plants is hard to implement, as the complex leaf distribution highly increases the difficulty level in dense matching. Semi-Global Matching has been successfully applied to recover the depth information of a scene, but may perform variably when different matching cost algorithms are used. In this paper two matching cost computation algorithms, Census transform and an algorithm using a convolutional neural network, are tested for plant reconstruction based on Semi-Global Matching. High resolution close-range photogrammetric images from a handheld camera are used for the experiment. The disparity maps generated based on the two selected matching cost methods are comparable with acceptable quality, which shows the good performance of Census and the potential of neural networks to improve the dense matching.

Hybrid ontology for semantic information retrieval model using keyword matching indexing system.

Science.gov (United States)

Uthayan, K R; Mala, G S Anandha

2015-01-01

Ontology is the process of growth and elucidation of concepts of an information domain being common for a group of users. Establishing ontology into information retrieval is a normal method to develop searching effects of relevant information users require. Keywords matching process with historical or information domain is significant in recent calculations for assisting the best match for specific input queries. This research presents a better querying mechanism for information retrieval which integrates the ontology queries with keyword search. The ontology-based query is changed into a primary order to predicate logic uncertainty which is used for routing the query to the appropriate servers. Matching algorithms characterize warm area of researches in computer science and artificial intelligence. In text matching, it is more dependable to study semantics model and query for conditions of semantic matching. This research develops the semantic matching results between input queries and information in ontology field. The contributed algorithm is a hybrid method that is based on matching extracted instances from the queries and information field. The queries and information domain is focused on semantic matching, to discover the best match and to progress the executive process. In conclusion, the hybrid ontology in semantic web is sufficient to retrieve the documents when compared to standard ontology.

Deep-UV Emitters and Detectors Based on Lattice-Matched Cubic Oxide Semiconductors (4.2 Optoelectronics)

Science.gov (United States)

2015-05-14

calculated   by   dividing   photo-­‐‑ generated  current  by  the  optical  power  spectrum  of  the   lamp .    A   UV ...the optimized parameters for growth. Efforts led to significant increases in solar?blind detector responsivity (up to 0.1 A/W) with sub-­ nanoamp...Aug-2014 Approved for Public Release; Distribution Unlimited Final Report: Deep- UV Emitters and Detectors Based on Lattice- Matched Cubic Oxide

Cerenkov luminescence tomography based on preconditioning orthogonal matching pursuit

Science.gov (United States)

Liu, Haixiao; Hu, Zhenhua; Wang, Kun; Tian, Jie; Yang, Xin

2015-03-01

Cerenkov luminescence imaging (CLI) is a novel optical imaging method and has been proved to be a potential substitute of the traditional radionuclide imaging such as positron emission tomography (PET) and single-photon emission computed tomography (SPECT). This imaging method inherits the high sensitivity of nuclear medicine and low cost of optical molecular imaging. To obtain the depth information of the radioactive isotope, Cerenkov luminescence tomography (CLT) is established and the 3D distribution of the isotope is reconstructed. However, because of the strong absorption and scatter, the reconstruction of the CLT sources is always converted to an ill-posed linear system which is hard to be solved. In this work, the sparse nature of the light source was taken into account and the preconditioning orthogonal matching pursuit (POMP) method was established to effectively reduce the ill-posedness and obtain better reconstruction accuracy. To prove the accuracy and speed of this algorithm, a heterogeneous numerical phantom experiment and an in vivo mouse experiment were conducted. Both the simulation result and the mouse experiment showed that our reconstruction method can provide more accurate reconstruction result compared with the traditional Tikhonov regularization method and the ordinary orthogonal matching pursuit (OMP) method. Our reconstruction method will provide technical support for the biological application for Cerenkov luminescence.

Current Interview Trail Metrics in the Otolaryngology Match.

Science.gov (United States)

Cabrera-Muffly, Cristina; Chang, C W David; Puscas, Liana

2017-06-01

Objectives To identify how applicants to otolaryngology residency determine how to apply to, interview with, and rank programs on the interview trail and to determine the extent of the financial burden of the otolaryngology interview trail. Study Design Web-based survey distributed in March and April 2016. Setting Otolaryngology residency applicants throughout the United States. Subjects and Methods Applicants to otolaryngology residency during the 2016 match cycle and current otolaryngology residents were surveyed. Results Median number of applications, interview offers, interviews attended, and programs ranked was not different during the 2016 match and the previous 5 match years. The most important factor affecting the number of applications was the need to apply widely to ensure sufficient interview offers. The most common reason for declining an interview offer was scheduling conflict. Applicants during the 2016 match spent a median of $5400 applying and interviewing for otolaryngology residency. Conclusions Median number of applications, interview offers, interviews attended, and programs ranked has not changed. The most cited reason for applying to many programs was to increase the chances of matching, but this is not statistically likely to increase match success. We advocate for continued attempts to make the otolaryngology match process more transparent for both applicants and resident selection committees, but recognize that applicants are likely to continue to overapply for otolaryngology residency positions.

Development of Vision Based Multiview Gait Recognition System with MMUGait Database

Directory of Open Access Journals (Sweden)

Hu Ng

2014-01-01

Full Text Available This paper describes the acquisition setup and development of a new gait database, MMUGait. This database consists of 82 subjects walking under normal condition and 19 subjects walking with 11 covariate factors, which were captured under two views. This paper also proposes a multiview model-based gait recognition system with joint detection approach that performs well under different walking trajectories and covariate factors, which include self-occluded or external occluded silhouettes. In the proposed system, the process begins by enhancing the human silhouette to remove the artifacts. Next, the width and height of the body are obtained. Subsequently, the joint angular trajectories are determined once the body joints are automatically detected. Lastly, crotch height and step-size of the walking subject are determined. The extracted features are smoothened by Gaussian filter to eliminate the effect of outliers. The extracted features are normalized with linear scaling, which is followed by feature selection prior to the classification process. The classification experiments carried out on MMUGait database were benchmarked against the SOTON Small DB from University of Southampton. Results showed correct classification rate above 90% for all the databases. The proposed approach is found to outperform other approaches on SOTON Small DB in most cases.

Computer Color Matching and Levelness of PEG-Based Reverse Micellar Decamethyl cyclopentasiloxane (D5 Solvent-Assisted Reactive Dyeing on Cotton Fiber

Directory of Open Access Journals (Sweden)

Alan Y. L. Tang

2017-07-01

Full Text Available The color matching and levelness of cotton fabrics dyed with reactive dye, in a non-aqueous environmentally-friendly medium of decamethylcyclopentasiloxane (D5, was investigated using the non-ionic surfactant reverse-micellar approach comprised of poly(ethylene glycol-based surfactant. The calibration dyeing databases for both conventional water-based dyeing and D5-assisted reverse micellar dyeing were established, along with the dyeing of standard samples with predetermined concentrations. Computer color matching (CCM was conducted by using different color difference formulae for both dyeing methods. Experimental results reveal that the measured concentrations were nearly the same as the expected concentrations for both methods. This indicates that the D5-assisted non-ionic reverse micellar dyeing approach can achieve color matching as good as the conventional dyeing system. The levelness of the dyed samples was measured according to the relative unlevelness indices (RUI, and the results reveal that the samples dyed by the D5 reverse micellar dyeing system can achieve good to excellent levelness comparable to that of the conventional dyeing system.

Accuracy of Cup Positioning With the Computed Tomography-Based Two-dimensional to Three-Dimensional Matched Navigation System: A Prospective, Randomized Controlled Study.

Science.gov (United States)

Yamada, Kazuki; Endo, Hirosuke; Tetsunaga, Tomonori; Miyake, Takamasa; Sanki, Tomoaki; Ozaki, Toshifumi

2018-01-01

The accuracy of various navigation systems used for total hip arthroplasty has been described, but no publications reported the accuracy of cup orientation in computed tomography (CT)-based 2D-3D (two-dimensional to three-dimensional) matched navigation. In a prospective, randomized controlled study, 80 hips including 44 with developmental dysplasia of the hips were divided into a CT-based 2D-3D matched navigation group (2D-3D group) and a paired-point matched navigation group (PPM group). The accuracy of cup orientation (absolute difference between the intraoperative record and the postoperative measurement) was compared between groups. Additionally, multiple logistic regression analysis was performed to evaluate patient factors affecting the accuracy of cup orientation in each navigation. The accuracy of cup inclination was 2.5° ± 2.2° in the 2D-3D group and 4.6° ± 3.3° in the PPM group (P = .0016). The accuracy of cup anteversion was 2.3° ± 1.7° in the 2D-3D group and 4.4° ± 3.3° in the PPM group (P = .0009). In the PPM group, the presence of roof osteophytes decreased the accuracy of cup inclination (odds ratio 8.27, P = .0140) and the absolute value of pelvic tilt had a negative influence on the accuracy of cup anteversion (odds ratio 1.27, P = .0222). In the 2D-3D group, patient factors had no effect on the accuracy of cup orientation. The accuracy of cup positioning in CT-based 2D-3D matched navigation was better than in paired-point matched navigation, and was not affected by patient factors. It is a useful system for even severely deformed pelvises such as developmental dysplasia of the hips. Copyright © 2017 Elsevier Inc. All rights reserved.

Statistical primer: propensity score matching and its alternatives.

Science.gov (United States)

Benedetto, Umberto; Head, Stuart J; Angelini, Gianni D; Blackstone, Eugene H

2018-06-01

Propensity score (PS) methods offer certain advantages over more traditional regression methods to control for confounding by indication in observational studies. Although multivariable regression models adjust for confounders by modelling the relationship between covariates and outcome, the PS methods estimate the treatment effect by modelling the relationship between confounders and treatment assignment. Therefore, methods based on the PS are not limited by the number of events, and their use may be warranted when the number of confounders is large, or the number of outcomes is small. The PS is the probability for a subject to receive a treatment conditional on a set of baseline characteristics (confounders). The PS is commonly estimated using logistic regression, and it is used to match patients with similar distribution of confounders so that difference in outcomes gives unbiased estimate of treatment effect. This review summarizes basic concepts of the PS matching and provides guidance in implementing matching and other methods based on the PS, such as stratification, weighting and covariate adjustment.

Improved Stereo Matching With Boosting Method

Directory of Open Access Journals (Sweden)

Shiny B

2015-06-01

Full Text Available Abstract This paper presents an approach based on classification for improving the accuracy of stereo matching methods. We propose this method for occlusion handling. This work employs classification of pixels for finding the erroneous disparity values. Due to the wide applications of disparity map in 3D television medical imaging etc the accuracy of disparity map has high significance. An initial disparity map is obtained using local or global stereo matching methods from the input stereo image pair. The various features for classification are computed from the input stereo image pair and the obtained disparity map. Then the computed feature vector is used for classification of pixels by using GentleBoost as the classification method. The erroneous disparity values in the disparity map found by classification are corrected through a completion stage or filling stage. A performance evaluation of stereo matching using AdaBoostM1 RUSBoost Neural networks and GentleBoost is performed.

3D shape measurement of moving object with FFT-based spatial matching

Science.gov (United States)

Guo, Qinghua; Ruan, Yuxi; Xi, Jiangtao; Song, Limei; Zhu, Xinjun; Yu, Yanguang; Tong, Jun

2018-03-01

This work presents a new technique for 3D shape measurement of moving object in translational motion, which finds applications in online inspection, quality control, etc. A low-complexity 1D fast Fourier transform (FFT)-based spatial matching approach is devised to obtain accurate object displacement estimates, and it is combined with single shot fringe pattern prolometry (FPP) techniques to achieve high measurement performance with multiple captured images through coherent combining. The proposed technique overcomes some limitations of existing ones. Specifically, the placement of marks on object surface and synchronization between projector and camera are not needed, the velocity of the moving object is not required to be constant, and there is no restriction on the movement trajectory. Both simulation and experimental results demonstrate the effectiveness of the proposed technique.

Template match using local feature with view invariance

Science.gov (United States)

Lu, Cen; Zhou, Gang

2013-10-01

Matching the template image in the target image is the fundamental task in the field of computer vision. Aiming at the deficiency in the traditional image matching methods and inaccurate matching in scene image with rotation, illumination and view changing, a novel matching algorithm using local features are proposed in this paper. The local histograms of the edge pixels (LHoE) are extracted as the invariable feature to resist view and brightness changing. The merits of the LHoE is that the edge points have been little affected with view changing, and the LHoE can resist not only illumination variance but also the polution of noise. For the process of matching are excuded only on the edge points, the computation burden are highly reduced. Additionally, our approach is conceptually simple, easy to implement and do not need the training phase. The view changing can be considered as the combination of rotation, illumination and shear transformation. Experimental results on simulated and real data demonstrated that the proposed approach is superior to NCC(Normalized cross-correlation) and Histogram-based methods with view changing.

An accurate algorithm to match imperfectly matched images for lung tumor detection without markers.

Science.gov (United States)

Rozario, Timothy; Bereg, Sergey; Yan, Yulong; Chiu, Tsuicheng; Liu, Honghuan; Kearney, Vasant; Jiang, Lan; Mao, Weihua

2015-05-08

In order to locate lung tumors on kV projection images without internal markers, digitally reconstructed radiographs (DRRs) are created and compared with projection images. However, lung tumors always move due to respiration and their locations change on projection images while they are static on DRRs. In addition, global image intensity discrepancies exist between DRRs and projections due to their different image orientations, scattering, and noises. This adversely affects comparison accuracy. A simple but efficient comparison algorithm is reported to match imperfectly matched projection images and DRRs. The kV projection images were matched with different DRRs in two steps. Preprocessing was performed in advance to generate two sets of DRRs. The tumors were removed from the planning 3D CT for a single phase of planning 4D CT images using planning contours of tumors. DRRs of background and DRRs of tumors were generated separately for every projection angle. The first step was to match projection images with DRRs of background signals. This method divided global images into a matrix of small tiles and similarities were evaluated by calculating normalized cross-correlation (NCC) between corresponding tiles on projections and DRRs. The tile configuration (tile locations) was automatically optimized to keep the tumor within a single projection tile that had a bad matching with the corresponding DRR tile. A pixel-based linear transformation was determined by linear interpolations of tile transformation results obtained during tile matching. The background DRRs were transformed to the projection image level and subtracted from it. The resulting subtracted image now contained only the tumor. The second step was to register DRRs of tumors to the subtracted image to locate the tumor. This method was successfully applied to kV fluoro images (about 1000 images) acquired on a Vero (BrainLAB) for dynamic tumor tracking on phantom studies. Radiation opaque markers were

Effects of Internet and Smartphone Addictions on Depression and Anxiety Based on Propensity Score Matching Analysis

Directory of Open Access Journals (Sweden)

Yeon-Jin Kim

2018-04-01

Full Text Available The associations of Internet addiction (IA and smartphone addiction (SA with mental health problems have been widely studied. We investigated the effects of IA and SA on depression and anxiety while adjusting for sociodemographic variables. In this study, 4854 participants completed a cross-sectional web-based survey including socio-demographic items, the Korean Scale for Internet Addiction, the Smartphone Addiction Proneness Scale, and the subscales of the Symptom Checklist 90 Items-Revised. The participants were classified into IA, SA, and normal use (NU groups. To reduce sampling bias, we applied the propensity score matching method based on genetics matching. The IA group showed an increased risk of depression (relative risk 1.207; p < 0.001 and anxiety (relative risk 1.264; p < 0.001 compared to NUs. The SA group also showed an increased risk of depression (relative risk 1.337; p < 0.001 and anxiety (relative risk 1.402; p < 0.001 compared to NCs. These findings show that both, IA and SA, exerted significant effects on depression and anxiety. Moreover, our findings showed that SA has a stronger relationship with depression and anxiety, stronger than IA, and emphasized the need for prevention and management policy of the excessive smartphone use.

DENSE MATCHING COMPARISON BETWEEN CENSUS AND A CONVOLUTIONAL NEURAL NETWORK ALGORITHM FOR PLANT RECONSTRUCTION

Directory of Open Access Journals (Sweden)

Y. Xia

2018-05-01

Full Text Available 3D reconstruction of plants is hard to implement, as the complex leaf distribution highly increases the difficulty level in dense matching. Semi-Global Matching has been successfully applied to recover the depth information of a scene, but may perform variably when different matching cost algorithms are used. In this paper two matching cost computation algorithms, Census transform and an algorithm using a convolutional neural network, are tested for plant reconstruction based on Semi-Global Matching. High resolution close-range photogrammetric images from a handheld camera are used for the experiment. The disparity maps generated based on the two selected matching cost methods are comparable with acceptable quality, which shows the good performance of Census and the potential of neural networks to improve the dense matching.

OBJECT-SPACE MULTI-IMAGE MATCHING OF MOBILE-MAPPING-SYSTEM IMAGE SEQUENCES

Directory of Open Access Journals (Sweden)

Y. C. Chen

2012-07-01

Full Text Available This paper proposes an object-space multi-image matching procedure of terrestrial MMS (Mobile Mapping System image sequences to determine the coordinates of an object point automatically and reliably. This image matching procedure can be applied to find conjugate points of MMS image sequences efficiently. Conventional area-based image matching methods are not reliable to deliver accurate matching results for this application due to image scale variations, viewing angle variations, and object occlusions. In order to deal with these three matching problems, an object space multi-image matching is proposed. A modified NCC (Normalized Cross Correlation coefficient is proposed to measure the similarity of image patches. A modified multi-window matching procedure will also be introduced to solve the problem of object occlusion. A coarse-to-fine procedure with a combination of object-space multi-image matching and multi-window matching is adopted. The proposed procedure has been implemented for the purpose of matching terrestrial MMS image sequences. The ratio of correct matches of this experiment was about 80 %. By providing an approximate conjugate point in an overlapping image manually, most of the incorrect matches could be fixed properly and the ratio of correct matches was improved up to 98 %.

Multi-Probe Based Artificial DNA Encoding and Matching Classifier for Hyperspectral Remote Sensing Imagery

Directory of Open Access Journals (Sweden)

Ke Wu

2016-08-01

Full Text Available In recent years, a novel matching classification strategy inspired by the artificial deoxyribonucleic acid (DNA technology has been proposed for hyperspectral remote sensing imagery. Such a method can describe brightness and shape information of a spectrum by encoding the spectral curve into a DNA strand, providing a more comprehensive way for spectral similarity comparison. However, it suffers from two problems: data volume is amplified when all of the bands participate in the encoding procedure and full-band comparison degrades the importance of bands carrying key information. In this paper, a new multi-probe based artificial DNA encoding and matching (MADEM method is proposed. In this method, spectral signatures are first transformed into DNA code words with a spectral feature encoding operation. After that, multiple probes for interesting classes are extracted to represent the specific fragments of DNA strands. During the course of spectral matching, the different probes are compared to obtain the similarity of different types of land covers. By computing the absolute vector distance (AVD between different probes of an unclassified spectrum and the typical DNA code words from the database, the class property of each pixel is set as the minimum distance class. The main benefit of this strategy is that the risk of redundant bands can be deeply reduced and critical spectral discrepancies can be enlarged. Two hyperspectral image datasets were tested. Comparing with the other classification methods, the overall accuracy can be improved from 1.22% to 10.09% and 1.19% to 15.87%, respectively. Furthermore, the kappa coefficient can be improved from 2.05% to 15.29% and 1.35% to 19.59%, respectively. This demonstrated that the proposed algorithm outperformed other traditional classification methods.

The metabolic power and energetic demands of elite Gaelic football match play.

Science.gov (United States)

Malone, Shane; Solan, Barry; Collins, Kieran; Doran, Dominic

2017-05-01

Metabolic power has not yet been investigated within elite Gaelic football. The aim of the current investigation was to compare the metabolic power demands between positional groups and examine the temporal profile of elite Gaelic football match play. Global positional satellite system (GPS) data were collected from 50 elite Gaelic football players from 4 inter-county teams during 35 elite competitive matches over a three season period. A total of 351 complete match samples were obtained for final analysis. Players were categorized based on positional groups; full-back, half-back, midfield, half-forward and full-forward. Instantaneous raw velocity data was obtained from the GPS and exported to a customized spreadsheet which provided estimations of both speed based, derived metabolic power and energy expenditure variables (total distance, high speed distance, average metabolic power, high power distance and total energy expenditure). Match mean distance was 9222±1588 m, reflective of an average metabolic power of 9.5-12.5 W·kg-1, with an average energy expenditure of 58-70 Kj·kg-1 depending on position. There were significant differences between positional groups for both speed-based and metabolic power indices. Midfielders covered more total and high-speed distance, as well as greater average and overall energy expenditure compared to other positions (Ppower distance, as well as average metabolic power throughout the match (Ppower and traditional running based variables. The middle three positions (midfield, half-back and half-forward) possess greater activity profiles when compared to other positional groups. The reduction in metabolic power and traditional running based variables are comparable across match play. The current study demonstrates that metabolic power may contribute to our understanding of Gaelic football match-play.

Gravity Matching Aided Inertial Navigation Technique Based on Marginal Robust Unscented Kalman Filter

Directory of Open Access Journals (Sweden)

Ming Liu

2015-01-01

Full Text Available This paper is concerned with the topic of gravity matching aided inertial navigation technology using Kalman filter. The dynamic state space model for Kalman filter is constructed as follows: the error equation of the inertial navigation system is employed as the process equation while the local gravity model based on 9-point surface interpolation is employed as the observation equation. The unscented Kalman filter is employed to address the nonlinearity of the observation equation. The filter is refined in two ways as follows. The marginalization technique is employed to explore the conditionally linear substructure to reduce the computational load; specifically, the number of the needed sigma points is reduced from 15 to 5 after this technique is used. A robust technique based on Chi-square test is employed to make the filter insensitive to the uncertainties in the above constructed observation model. Numerical simulation is carried out, and the efficacy of the proposed method is validated by the simulation results.

Quantity precommitment and price matching

DEFF Research Database (Denmark)

Tumennasan, Norovsambuu

We revisit the question of whether price matching is anti-competitive in a capacity constrained duopoly setting. We show that the effect of price matching depends on capacity. Specifically, price matching has no effect when capacity is relatively low, but it benefits the firms when capacity...... is relatively high. Interestingly, when capacity is in an intermediate range, price matching benefits only the small firm but does not affect the large firm in any way. Therefore, one has to consider capacity seriously when evaluating if price matching is anti-competitive. If the firms choose their capacities...... simultaneously before pricing decisions, then the effect of price matching is either pro-competitive or ambiguous. We show that if the cost of capacity is high, then price matching can only (weakly) decrease the market price. On the other hand, if the cost of capacity is low, then the effect of price matching...

Using Microsoft Office Excel 2007 to conduct generalized matching analyses.

Science.gov (United States)

Reed, Derek D

2009-01-01

The generalized matching equation is a robust and empirically supported means of analyzing relations between reinforcement and behavior. Unfortunately, no simple task analysis is available to behavior analysts interested in using the matching equation to evaluate data in clinical or applied settings. This technical article presents a task analysis for the use of Microsoft Excel to analyze and plot the generalized matching equation. Using a data-based case example and a step-by-step guide for completing the analysis, these instructions are intended to promote the use of quantitative analyses by researchers with little to no experience in quantitative analyses or the matching law.

USING MICROSOFT OFFICE EXCEL® 2007 TO CONDUCT GENERALIZED MATCHING ANALYSES

Science.gov (United States)

Reed, Derek D

2009-01-01

The generalized matching equation is a robust and empirically supported means of analyzing relations between reinforcement and behavior. Unfortunately, no simple task analysis is available to behavior analysts interested in using the matching equation to evaluate data in clinical or applied settings. This technical article presents a task analysis for the use of Microsoft Excel to analyze and plot the generalized matching equation. Using a data-based case example and a step-by-step guide for completing the analysis, these instructions are intended to promote the use of quantitative analyses by researchers with little to no experience in quantitative analyses or the matching law. PMID:20514196

A Novel Artificial Bee Colony Algorithm Based on Internal-Feedback Strategy for Image Template Matching

Directory of Open Access Journals (Sweden)

Bai Li

2014-01-01

Full Text Available Image template matching refers to the technique of locating a given reference image over a source image such that they are the most similar. It is a fundamental mission in the field of visual target recognition. In general, there are two critical aspects of a template matching scheme. One is similarity measurement and the other is best-match location search. In this work, we choose the well-known normalized cross correlation model as a similarity criterion. The searching procedure for the best-match location is carried out through an internal-feedback artificial bee colony (IF-ABC algorithm. IF-ABC algorithm is highlighted by its effort to fight against premature convergence. This purpose is achieved through discarding the conventional roulette selection procedure in the ABC algorithm so as to provide each employed bee an equal chance to be followed by the onlooker bees in the local search phase. Besides that, we also suggest efficiently utilizing the internal convergence states as feedback guidance for searching intensity in the subsequent cycles of iteration. We have investigated four ideal template matching cases as well as four actual cases using different searching algorithms. Our simulation results show that the IF-ABC algorithm is more effective and robust for this template matching mission than the conventional ABC and two state-of-the-art modified ABC algorithms do.

A MATCHING METHOD TO REDUCE THE INFLUENCE OF SAR GEOMETRIC DEFORMATION

Directory of Open Access Journals (Sweden)

C. Gao

2018-04-01

Full Text Available There are large geometrical deformations in SAR image, including foreshortening, layover, shade，which leads to SAR Image matching with low accuracy. Especially in complex terrain area, the control points are difficult to obtain, and the matching is difficult to achieve. Considering the impact of geometric distortions in SAR image pairs, a matching algorithm with a combination of speeded up robust features (SURF and summed of normalize cross correlation (SNCC was proposed, which can avoid the influence of SAR geometric deformation. Firstly, SURF algorithm was utilized to predict the search area. Then the matching point pairs was selected based on summed of normalized cross correlation. Finally, false match points were eliminated by the bidirectional consistency. SURF algorithm can control the range of matching points, and the matching points extracted from the deformation area are eliminated, and the matching points with stable and even distribution are obtained. The experimental results demonstrated that the proposed algorithm had high precision, and can effectively avoid the effect of geometric distortion on SAR image matching. Meet accuracy requirements of the block adjustment with sparse control points.

A multi-pattern hash-binary hybrid algorithm for URL matching in the HTTP protocol.

Directory of Open Access Journals (Sweden)

Ping Zeng

Full Text Available In this paper, based on our previous multi-pattern uniform resource locator (URL binary-matching algorithm called HEM, we propose an improved multi-pattern matching algorithm called MH that is based on hash tables and binary tables. The MH algorithm can be applied to the fields of network security, data analysis, load balancing, cloud robotic communications, and so on-all of which require string matching from a fixed starting position. Our approach effectively solves the performance problems of the classical multi-pattern matching algorithms. This paper explores ways to improve string matching performance under the HTTP protocol by using a hash method combined with a binary method that transforms the symbol-space matching problem into a digital-space numerical-size comparison and hashing problem. The MH approach has a fast matching speed, requires little memory, performs better than both the classical algorithms and HEM for matching fields in an HTTP stream, and it has great promise for use in real-world applications.

A blur-invariant local feature for motion blurred image matching

Science.gov (United States)

Tong, Qiang; Aoki, Terumasa

2017-07-01

Image matching between a blurred (caused by camera motion, out of focus, etc.) image and a non-blurred image is a critical task for many image/video applications. However, most of the existing local feature schemes fail to achieve this work. This paper presents a blur-invariant descriptor and a novel local feature scheme including the descriptor and the interest point detector based on moment symmetry - the authors' previous work. The descriptor is based on a new concept - center peak moment-like element (CPME) which is robust to blur and boundary effect. Then by constructing CPMEs, the descriptor is also distinctive and suitable for image matching. Experimental results show our scheme outperforms state of the art methods for blurred image matching

The Interaction Between Schema Matching and Record Matching in Data Integration

KAUST Repository

Gu, Binbin; Li, Zhixu; Zhang, Xiangliang; Liu, An; Liu, Guanfeng; Zheng, Kai; Zhao, Lei; Zhou, Xiaofang

2016-01-01

Schema Matching (SM) and Record Matching (RM) are two necessary steps in integrating multiple relational tables of different schemas, where SM unifies the schemas and RM detects records referring to the same real-world entity. The two processes have

Steelmaking-Casting of Molten Steel by Decarburization Ladle Matching

Directory of Open Access Journals (Sweden)

Wei Liu

2018-01-01

Full Text Available Steelmaking–continuous casting is a complex process. The method of selecting a ladle, which also functions as a storage device, follows a specific process of the production plan. In ladle matching, several ladle attributes are considered. However, matching objectives are difficult to achieve simultaneously. Different molten steel properties have contributed to the complexity of matching constraints, and, thus, matching optimization is regarded a multiconflict goal problem. In the process of optimization, the first-order rule learning method is first used to extract key ladle attributes (performance indicators, including highest temperature, usage frequency, lowest-level material, and outlet. On the basis of a number of indicators, such as ladle temperature, quantity, material, and usage frequency, as well as skateboard quantity, the ladle matching model is established. Second, the rule of ladle selection is determined by the method of least-generalization rule learning. Third, a simulation experiment is carried out according to various scheduling order strategies and matching priority combinations. Finally, the heuristic ladle matching method based on the rule priority (RP is determined for possible industrial applications. Results show that the accuracy of ladle selection can be improved. In particular, the numbers of ladles and maintenance times are reduced. Consequently, furnace production efficiency is also enhanced.

Matching Matched Filtering with Deep Networks for Gravitational-Wave Astronomy

Science.gov (United States)

Gabbard, Hunter; Williams, Michael; Hayes, Fergus; Messenger, Chris

2018-04-01

We report on the construction of a deep convolutional neural network that can reproduce the sensitivity of a matched-filtering search for binary black hole gravitational-wave signals. The standard method for the detection of well-modeled transient gravitational-wave signals is matched filtering. We use only whitened time series of measured gravitational-wave strain as an input, and we train and test on simulated binary black hole signals in synthetic Gaussian noise representative of Advanced LIGO sensitivity. We show that our network can classify signal from noise with a performance that emulates that of match filtering applied to the same data sets when considering the sensitivity defined by receiver-operator characteristics.

Matching Matched Filtering with Deep Networks for Gravitational-Wave Astronomy.

Science.gov (United States)

Gabbard, Hunter; Williams, Michael; Hayes, Fergus; Messenger, Chris

2018-04-06

We report on the construction of a deep convolutional neural network that can reproduce the sensitivity of a matched-filtering search for binary black hole gravitational-wave signals. The standard method for the detection of well-modeled transient gravitational-wave signals is matched filtering. We use only whitened time series of measured gravitational-wave strain as an input, and we train and test on simulated binary black hole signals in synthetic Gaussian noise representative of Advanced LIGO sensitivity. We show that our network can classify signal from noise with a performance that emulates that of match filtering applied to the same data sets when considering the sensitivity defined by receiver-operator characteristics.

Explaining soccer match outcomes with goal scoring opportunities predictive analytics

NARCIS (Netherlands)

Eggels, H.; van Elk, R.; Pechenizkiy, M.

2016-01-01

In elite soccer, decisions are often based on recent results and emotions. In this paper, we propose a method to determine the expected winner of a match in elite soccer. The expected result of a soccer match is determined by estimating the probability of scoring for the individual goal scoring

Small Vocabulary with Saliency Matching for Video Copy Detection

DEFF Research Database (Denmark)

Ren, Huamin; Moeslund, Thomas B.; Tang, Sheng

2013-01-01

The importance of copy detection has led to a substantial amount of research in recent years, among which Bag of visual Words (BoW) plays an important role due to its ability to effectively handling occlusion and some minor transformations. One crucial issue in BoW approaches is the size of vocab......The importance of copy detection has led to a substantial amount of research in recent years, among which Bag of visual Words (BoW) plays an important role due to its ability to effectively handling occlusion and some minor transformations. One crucial issue in BoW approaches is the size...... matching algorithm based on salient visual words selection. More specifically, the variation of visual words across a given video are represented as trajectories and those containing locally asymptotically stable points are selected as salient visual words. Then we attempt to measure the similarity of two...... videos through saliency matching merely based on the selected salient visual words to remove false positives. Our experiments show that a small codebook with saliency matching is quite competitive in video copy detection. With the incorporation of the proposed saliency matching, the precision can...

mEBT: multiple-matching Evidence-based Translator of Murine Genomic Responses for Human Immunity Studies.

Science.gov (United States)

Tae, Donghyun; Seok, Junhee

2018-05-29

In this paper, we introduce multiple-matching Evidence-based Translator (mEBT) to discover genomic responses from murine expression data for human immune studies, which are significant in the given condition of mice and likely have similar responses in the corresponding condition of human. mEBT is evaluated over multiple data sets and shows improved inter-species agreement. mEBT is expected to be useful for research groups who use murine models to study human immunity. http://cdal.korea.ac.kr/mebt/. jseok14@korea.ac.kr. Supplementary data are available at Bioinformatics online.

78 FR 42080 - Privacy Act of 1974; CMS Computer Match No. 2013-07; HHS Computer Match No. 1303; DoD-DMDC Match...

Science.gov (United States)

2013-07-15

... 1974; CMS Computer Match No. 2013-07; HHS Computer Match No. 1303; DoD-DMDC Match No. 18 AGENCY: Centers for Medicare & Medicaid Services (CMS), Department of Health and Human Services (HHS). ACTION... Act of 1974, as amended, this notice announces the establishment of a CMP that CMS plans to conduct...

Mix-and-match holography

KAUST Repository

Peng, Yifan; Dun, Xiong; Sun, Qilin; Heidrich, Wolfgang

2017-01-01

target images into pairs of front and rear phase-distorting surfaces. Different target holograms can be decoded by mixing and matching different front and rear surfaces under specific geometric alignments. Our approach, which we call mixWe derive a detailed image formation model for the setting of holographic projection displays, as well as a multiplexing method based on a combination of phase retrieval methods and complex matrix factorization. We demonstrate several application scenarios in both simulation and physical prototypes.

Enhanced Map-Matching Algorithm with a Hidden Markov Model for Mobile Phone Positioning

Directory of Open Access Journals (Sweden)

An Luo

2017-10-01

Full Text Available Numerous map-matching techniques have been developed to improve positioning, using Global Positioning System (GPS data and other sensors. However, most existing map-matching algorithms process GPS data with high sampling rates, to achieve a higher correct rate and strong universality. This paper introduces a novel map-matching algorithm based on a hidden Markov model (HMM for GPS positioning and mobile phone positioning with a low sampling rate. The HMM is a statistical model well known for providing solutions to temporal recognition applications such as text and speech recognition. In this work, the hidden Markov chain model was built to establish a map-matching process, using the geometric data, the topologies matrix of road links in road network and refined quad-tree data structure. HMM-based map-matching exploits the Viterbi algorithm to find the optimized road link sequence. The sequence consists of hidden states in the HMM model. The HMM-based map-matching algorithm is validated on a vehicle trajectory using GPS and mobile phone data. The results show a significant improvement in mobile phone positioning and high and low sampling of GPS data.

78 FR 48169 - Privacy Act of 1974; CMS Computer Match No. 2013-02; HHS Computer Match No. 1306; DoD-DMDC Match...

Science.gov (United States)

2013-08-07

... 1974; CMS Computer Match No. 2013-02; HHS Computer Match No. 1306; DoD-DMDC Match No. 12 AGENCY: Department of Health and Human Services (HHS), Centers for Medicare & Medicaid Services (CMS). ACTION: Notice... of 1974, as amended, this notice establishes a CMP that CMS plans to conduct with the Department of...

Local Deep Hashing Matching of Aerial Images Based on Relative Distance and Absolute Distance Constraints

Directory of Open Access Journals (Sweden)

Suting Chen

2017-12-01

Full Text Available Aerial images have features of high resolution, complex background, and usually require large amounts of calculation, however, most algorithms used in matching of aerial images adopt the shallow hand-crafted features expressed as floating-point descriptors (e.g., SIFT (Scale-invariant Feature Transform, SURF (Speeded Up Robust Features, which may suffer from poor matching speed and are not well represented in the literature. Here, we propose a novel Local Deep Hashing Matching (LDHM method for matching of aerial images with large size and with lower complexity or fast matching speed. The basic idea of the proposed algorithm is to utilize the deep network model in the local area of the aerial images, and study the local features, as well as the hash function of the images. Firstly, according to the course overlap rate of aerial images, the algorithm extracts the local areas for matching to avoid the processing of redundant information. Secondly, a triplet network structure is proposed to mine the deep features of the patches of the local image, and the learned features are imported to the hash layer, thus obtaining the representation of a binary hash code. Thirdly, the constraints of the positive samples to the absolute distance are added on the basis of the triplet loss, a new objective function is constructed to optimize the parameters of the network and enhance the discriminating capabilities of image patch features. Finally, the obtained deep hash code of each image patch is used for the similarity comparison of the image patches in the Hamming space to complete the matching of aerial images. The proposed LDHM algorithm evaluates the UltraCam-D dataset and a set of actual aerial images, simulation result demonstrates that it may significantly outperform the state-of-the-art algorithm in terms of the efficiency and performance.

Best matching Barenblatt profiles are delayed

International Nuclear Information System (INIS)

Dolbeault, Jean; Toscani, Giuseppe

2015-01-01

The growth of the second moments of the solutions of fast diffusion equations is asymptotically governed by the behavior of self-similar solutions. However, at next order, there is a correction term which amounts to a delay depending on the nonlinearity and on a distance of the initial data to the set of self-similar Barenblatt solutions. This distance can be measured in terms of a relative entropy to the best matching Barenblatt profile. This best matching Barenblatt function determines a scale. In new variables based on this scale, which are given by a self-similar change of variables if and only if the initial datum is one of the Barenblatt profiles, the typical scale is monotone and has a limit. Coming back to original variables, the best matching Barenblatt profile is delayed compared to the self-similar solution with same initial second moment as the initial datum. Such a delay is a new phenomenon, which has to be taken into account for instance when fitting experimental data. (paper)

On the tautology of the matching law in consumer behavior analysis.

Science.gov (United States)

Curry, Bruce; Foxall, Gordon R; Sigurdsson, Valdimar

2010-05-01

Matching analysis has often attracted the criticism that it is formally tautological and hence empirically unfalsifiable, a problem that particularly affects translational attempts to extend behavior analysis into new areas. An example is consumer behavior analysis where application of matching in natural settings requires the inference of ratio-based relationships between amount purchased and amount spent. This gives rise to the argument that matching is an artifact of the way in which the alleged independent and dependent variables are defined and measured. We argue that the amount matching law would be tautological only in extreme circumstances (those in which prices or quantities move strictly in proportion); this is because of the presence of an error term in the matching function which arises from aggregation, particularly aggregation over brands. Cost matching is a viable complement of amount matching which avoids this tautology but a complete explanation of consumer choice requires a viable measure of amount matching also. This necessitates a more general solution to the problem of tautology in matching. In general, the fact that there remain doubts about the functional form of the matching equation itself implies the absence of a tautology. In proposing a general solution to the problem of assumed tautology in matching, the paper notes the experiences of matching researchers in another translation field, sports behavior. Copyright (c) 2009 Elsevier B.V. All rights reserved.

Multimodal Personal Verification Using Likelihood Ratio for the Match Score Fusion

Directory of Open Access Journals (Sweden)

Long Binh Tran

2017-01-01

Full Text Available In this paper, the authors present a novel personal verification system based on the likelihood ratio test for fusion of match scores from multiple biometric matchers (face, fingerprint, hand shape, and palm print. In the proposed system, multimodal features are extracted by Zernike Moment (ZM. After matching, the match scores from multiple biometric matchers are fused based on the likelihood ratio test. A finite Gaussian mixture model (GMM is used for estimating the genuine and impostor densities of match scores for personal verification. Our approach is also compared to some different famous approaches such as the support vector machine and the sum rule with min-max. The experimental results have confirmed that the proposed system can achieve excellent identification performance for its higher level in accuracy than different famous approaches and thus can be utilized for more application related to person verification.

Parton-shower matching systematics in vector-boson-fusion WW production

Energy Technology Data Exchange (ETDEWEB)

Rauch, Michael [Karlsruhe Institute of Technology, Institute for Theoretical Physics, Karlsruhe (Germany); Plaetzer, Simon [Durham University, Institute for Particle Physics Phenomenology, Durham (United Kingdom); University of Manchester, School of Physics and Astronomy, Manchester (United Kingdom)

2017-05-15

We perform a detailed analysis of next-to-leading order plus parton-shower matching in vector-boson-fusion WW production including leptonic decays. The study is performed in the Herwig 7 framework interfaced to VBFNLO 3, using the angular-ordered and dipole-based parton-shower algorithms combined with the subtractive and multiplicative-matching algorithms. (orig.)

Locality constrained joint dynamic sparse representation for local matching based face recognition.

Science.gov (United States)

Wang, Jianzhong; Yi, Yugen; Zhou, Wei; Shi, Yanjiao; Qi, Miao; Zhang, Ming; Zhang, Baoxue; Kong, Jun

2014-01-01

Recently, Sparse Representation-based Classification (SRC) has attracted a lot of attention for its applications to various tasks, especially in biometric techniques such as face recognition. However, factors such as lighting, expression, pose and disguise variations in face images will decrease the performances of SRC and most other face recognition techniques. In order to overcome these limitations, we propose a robust face recognition method named Locality Constrained Joint Dynamic Sparse Representation-based Classification (LCJDSRC) in this paper. In our method, a face image is first partitioned into several smaller sub-images. Then, these sub-images are sparsely represented using the proposed locality constrained joint dynamic sparse representation algorithm. Finally, the representation results for all sub-images are aggregated to obtain the final recognition result. Compared with other algorithms which process each sub-image of a face image independently, the proposed algorithm regards the local matching-based face recognition as a multi-task learning problem. Thus, the latent relationships among the sub-images from the same face image are taken into account. Meanwhile, the locality information of the data is also considered in our algorithm. We evaluate our algorithm by comparing it with other state-of-the-art approaches. Extensive experiments on four benchmark face databases (ORL, Extended YaleB, AR and LFW) demonstrate the effectiveness of LCJDSRC.

Locality constrained joint dynamic sparse representation for local matching based face recognition.

Directory of Open Access Journals (Sweden)

Jianzhong Wang

Full Text Available Recently, Sparse Representation-based Classification (SRC has attracted a lot of attention for its applications to various tasks, especially in biometric techniques such as face recognition. However, factors such as lighting, expression, pose and disguise variations in face images will decrease the performances of SRC and most other face recognition techniques. In order to overcome these limitations, we propose a robust face recognition method named Locality Constrained Joint Dynamic Sparse Representation-based Classification (LCJDSRC in this paper. In our method, a face image is first partitioned into several smaller sub-images. Then, these sub-images are sparsely represented using the proposed locality constrained joint dynamic sparse representation algorithm. Finally, the representation results for all sub-images are aggregated to obtain the final recognition result. Compared with other algorithms which process each sub-image of a face image independently, the proposed algorithm regards the local matching-based face recognition as a multi-task learning problem. Thus, the latent relationships among the sub-images from the same face image are taken into account. Meanwhile, the locality information of the data is also considered in our algorithm. We evaluate our algorithm by comparing it with other state-of-the-art approaches. Extensive experiments on four benchmark face databases (ORL, Extended YaleB, AR and LFW demonstrate the effectiveness of LCJDSRC.

An ensemble based nonlinear orthogonal matching pursuit algorithm for sparse history matching of reservoir models

KAUST Repository

Fsheikh, Ahmed H.

2013-01-01

A nonlinear orthogonal matching pursuit (NOMP) for sparse calibration of reservoir models is presented. Sparse calibration is a challenging problem as the unknowns are both the non-zero components of the solution and their associated weights. NOMP is a greedy algorithm that discovers at each iteration the most correlated components of the basis functions with the residual. The discovered basis (aka support) is augmented across the nonlinear iterations. Once the basis functions are selected from the dictionary, the solution is obtained by applying Tikhonov regularization. The proposed algorithm relies on approximate gradient estimation using an iterative stochastic ensemble method (ISEM). ISEM utilizes an ensemble of directional derivatives to efficiently approximate gradients. In the current study, the search space is parameterized using an overcomplete dictionary of basis functions built using the K-SVD algorithm.

Match Performance and Physiological Capacity of Female Elite Team Handball Players

DEFF Research Database (Denmark)

Michalsik, L B; Madsen, K; Aagaard, Per

2014-01-01

The present study evaluated the physical demands imposed on female elite team handball players in relation to playing position. Female elite team handball field players were examined during match-play over a 5-year period using video based computerized locomotion analysis of tournament matches...

The Effectiveness of Advertising Matching Purchase Motivation

NARCIS (Netherlands)

J. Loef (Joost); G. Antonides (Gerrit); W.F. van Raaij (Fred)

2001-01-01

textabstractSeveral authors have proposed frameworks to help advertisers predict and plan advertising effectiveness. Rossiter and Percy's advertising grid (1997) recommends that the ad appeal should match the purchase motivation or attitude base. They suggest that for utilitarian brands

Multi-Configuration Matched Spectral Filter Core, Phase I

Data.gov (United States)

National Aeronautics and Space Administration — OPTRA proposes an open-architecture spectral gas sensor based on compressive sensing concepts employed for both spatial and spectral domains. Our matched spectral...

Quality-aware features-based noise level estimator for block matching and three-dimensional filtering algorithm

Science.gov (United States)

Xu, Shaoping; Hu, Lingyan; Yang, Xiaohui

2016-01-01

The performance of conventional denoising algorithms is usually controlled by one or several parameters whose optimal settings depend on the contents of the processed images and the characteristics of the noises. Among these parameters, noise level is a fundamental parameter that is always assumed to be known by most of the existing denoising algorithms (so-called nonblind denoising algorithms), which largely limits the applicability of these nonblind denoising algorithms in many applications. Moreover, these nonblind algorithms do not always achieve the best denoised images in visual quality even when fed with the actual noise level parameter. To address these shortcomings, in this paper we propose a new quality-aware features-based noise level estimator (NLE), which consists of quality-aware features extraction and optimal noise level parameter prediction. First, considering that image local contrast features convey important structural information that is closely related to image perceptual quality, we utilize the marginal statistics of two local contrast operators, i.e., the gradient magnitude and the Laplacian of Gaussian (LOG), to extract quality-aware features. The proposed quality-aware features have very low computational complexity, making them well suited for time-constrained applications. Then we propose a learning-based framework where the noise level parameter is estimated based on the quality-aware features. Based on the proposed NLE, we develop a blind block matching and three-dimensional filtering (BBM3D) denoising algorithm which is capable of effectively removing additive white Gaussian noise, even coupled with impulse noise. The noise level parameter of the BBM3D algorithm is automatically tuned according to the quality-aware features, guaranteeing the best performance. As such, the classical block matching and three-dimensional algorithm can be transformed into a blind one in an unsupervised manner. Experimental results demonstrate that the

A Technology Based Program That Matches Enrichment Resources With Student Strengths

Directory of Open Access Journals (Sweden)

J.S. Renzulli

2007-09-01

Full Text Available Remarkable advances in instructionalcommunication technology (ICT have now made ispossible to provide high levels of enrichment and thekinds of curricular differentiation that facilitateadvanced learning services to students who have accessto a computer and the Internet. But in order tomaximize the potential if ICT it is necessary to constructprograms that are based on learning theory that goesbeyond the didactic and prescriptive models that haveresulted in too much worksheets-on-line and electronicencyclopedias. The Renzulli Learning System (RLSuses a strength-based learning theory called theEnrichment Triad Model that is purposefully designedto promote advanced level learning, creativeproductivity, and high levels of student engagement byfocusing on the application of knowledge rather than themere acquisition and storage of information.The Renzulli Learning System is acomprehensive program that begins by providing acomputer-generated profile of each student’s academicstrengths, interests, learning styles, and preferred modesof expression. A search engine then matches Internetresources to the student’s profile from fourteen carefullyscreened data bases that are categorized by subject area,grade level, state curricular standards, and degree ofcomplexity. There are also hundreds of enrichmentactivities that can be down loaded and reproduced forindividual or group learning activities. A managementsystem called the Wizard Project Maker guides studentsin the application of knowledge to teacher or studentselected assignments, independent research studies, orcreative projects that individuals or small groups wouldlike to pursue. Students and teachers can evaluate thequality of students’ products using a rubric called TheStudent Product Assessment Form. Students can rateeach site visited, conduct a self-assessment of what theyhave gained from the site, and place resources in theirown Total talent Portfolio for future use. RLS alsoincludes a

Speckle noise reduction technique for Lidar echo signal based on self-adaptive pulse-matching independent component analysis

Science.gov (United States)

Xu, Fan; Wang, Jiaxing; Zhu, Daiyin; Tu, Qi

2018-04-01

Speckle noise has always been a particularly tricky problem in improving the ranging capability and accuracy of Lidar system especially in harsh environment. Currently, effective speckle de-noising techniques are extremely scarce and should be further developed. In this study, a speckle noise reduction technique has been proposed based on independent component analysis (ICA). Since normally few changes happen in the shape of laser pulse itself, the authors employed the laser source as a reference pulse and executed the ICA decomposition to find the optimal matching position. In order to achieve the self-adaptability of algorithm, local Mean Square Error (MSE) has been defined as an appropriate criterion for investigating the iteration results. The obtained experimental results demonstrated that the self-adaptive pulse-matching ICA (PM-ICA) method could effectively decrease the speckle noise and recover the useful Lidar echo signal component with high quality. Especially, the proposed method achieves 4 dB more improvement of signal-to-noise ratio (SNR) than a traditional homomorphic wavelet method.

Self-tuning wireless power transmission scheme based on on-line scattering parameters measurement and two-side power matching.

Science.gov (United States)

Luo, Yanting; Yang, Yongmin; Chen, Zhongsheng

2014-04-10

Sub-resonances often happen in wireless power transmission (WPT) systems using coupled magnetic resonances (CMR) due to environmental changes, coil movements or component degradations, which is a serious challenge for high efficiency power transmission. Thus self-tuning is very significant to keep WPT systems following strongly magnetic resonant conditions in practice. Traditional coupled-mode ways is difficult to solve this problem. In this paper a two-port power wave model is presented, where power matching and the overall systemic power transmission efficiency are firstly defined by scattering (S) parameters. Then we propose a novel self-tuning scheme based on on-line S parameters measurements and two-side power matching. Experimental results testify the feasibility of the proposed method. These findings suggest that the proposed method is much potential to develop strongly self-adaptive WPT systems with CMR.

Doppler distortion correction based on microphone array and matching pursuit algorithm for a wayside train bearing monitoring system

International Nuclear Information System (INIS)

Liu, Xingchen; Hu, Zhiyong; He, Qingbo; Zhang, Shangbin; Zhu, Jun

2017-01-01

Doppler distortion and background noise can reduce the effectiveness of wayside acoustic train bearing monitoring and fault diagnosis. This paper proposes a method of combining a microphone array and matching pursuit algorithm to overcome these difficulties. First, a dictionary is constructed based on the characteristics and mechanism of a far-field assumption. Then, the angle of arrival of the train bearing is acquired when applying matching pursuit to analyze the acoustic array signals. Finally, after obtaining the resampling time series, the Doppler distortion can be corrected, which is convenient for further diagnostic work. Compared with traditional single-microphone Doppler correction methods, the advantages of the presented array method are its robustness to background noise and its barely requiring pre-measuring parameters. Simulation and experimental study show that the proposed method is effective in performing wayside acoustic bearing fault diagnosis. (paper)

Doppler distortion correction based on microphone array and matching pursuit algorithm for a wayside train bearing monitoring system

Science.gov (United States)

Liu, Xingchen; Hu, Zhiyong; He, Qingbo; Zhang, Shangbin; Zhu, Jun

2017-10-01

Doppler distortion and background noise can reduce the effectiveness of wayside acoustic train bearing monitoring and fault diagnosis. This paper proposes a method of combining a microphone array and matching pursuit algorithm to overcome these difficulties. First, a dictionary is constructed based on the characteristics and mechanism of a far-field assumption. Then, the angle of arrival of the train bearing is acquired when applying matching pursuit to analyze the acoustic array signals. Finally, after obtaining the resampling time series, the Doppler distortion can be corrected, which is convenient for further diagnostic work. Compared with traditional single-microphone Doppler correction methods, the advantages of the presented array method are its robustness to background noise and its barely requiring pre-measuring parameters. Simulation and experimental study show that the proposed method is effective in performing wayside acoustic bearing fault diagnosis.

Best Practices for NPT Transit Matching

International Nuclear Information System (INIS)

Gilligan, Kimberly V.; Whitaker, J. Michael; Oakberg, John A.; Snow, Catherine

2016-01-01

Transit matching is the process for relating or matching reports of shipments and receipts submitted to the International Atomic Energy Agency (IAEA). Transit matching is a component used by the IAEA in drawing safeguards conclusions and performing investigative analysis. Transit matching is part of IAEA safeguards activities and the State evaluation process, and it is included in the annual Safeguards Implementation Report (SIR). Annually, the IAEA currently receives reports of ~900,000 nuclear material transactions, of which ~500,000 are for domestic and foreign transfers. Of these the IAEA software can automatically match (i.e., machine match) about 95% of the domestic transfers and 25% of the foreign transfers. Given the increasing demands upon IAEA resources, it is highly desirable for the machine-matching process to match as many transfers as possible. Researchers at Oak Ridge National Laboratory (ORNL) have conducted an investigation funded by the National Nuclear Security Administration through the Next Generation Safeguards Initiative to identify opportunities to strengthen IAEA transit matching. Successful matching, and more specifically machine matching, is contingent on quality data from the reporting States. In February 2016, ORNL hosted representatives from three States, the IAEA, and Euratom to share results from past studies and to discuss the processes, policies, and procedures associated with State reporting for transit matching. Drawing on each entity's experience and knowledge, ORNL developed a best practices document to be shared with the international safeguards community to strengthen transit matching. This paper shares the recommendations that resulted from this strategic meeting and the next steps being taken to strengthen transit matching.

Best Practices for NPT Transit Matching

Energy Technology Data Exchange (ETDEWEB)

Gilligan, Kimberly V. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Whitaker, J. Michael [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Oakberg, John A. [Tetra Tech, Inc., Oak Ridge, TN (United States); Snow, Catherine [Sno Consulting, LLC, Sandy, UT (United States)

2016-09-01

Transit matching is the process for relating or matching reports of shipments and receipts submitted to the International Atomic Energy Agency (IAEA). Transit matching is a component used by the IAEA in drawing safeguards conclusions and performing investigative analysis. Transit matching is part of IAEA safeguards activities and the State evaluation process, and it is included in the annual Safeguards Implementation Report (SIR). Annually, the IAEA currently receives reports of ~900,000 nuclear material transactions, of which ~500,000 are for domestic and foreign transfers. Of these the IAEA software can automatically match (i.e., machine match) about 95% of the domestic transfers and 25% of the foreign transfers. Given the increasing demands upon IAEA resources, it is highly desirable for the machine-matching process to match as many transfers as possible. Researchers at Oak Ridge National Laboratory (ORNL) have conducted an investigation funded by the National Nuclear Security Administration through the Next Generation Safeguards Initiative to identify opportunities to strengthen IAEA transit matching. Successful matching, and more specifically machine matching, is contingent on quality data from the reporting States. In February 2016, ORNL hosted representatives from three States, the IAEA, and Euratom to share results from past studies and to discuss the processes, policies, and procedures associated with State reporting for transit matching. Drawing on each entity's experience and knowledge, ORNL developed a best practices document to be shared with the international safeguards community to strengthen transit matching. This paper shares the recommendations that resulted from this strategic meeting and the next steps being taken to strengthen transit matching.

New Power Sharing Control for Inverter-Dominated Microgrid Based on Impedance Match Concept

Science.gov (United States)

Gu, Herong; Wang, Deyu; Shen, Hong; Zhao, Wei; Guo, Xiaoqiang

2013-01-01

Power flow control is one of the most important issues for operating the inverter-dominated autonomous microgrid. A technical challenge is how to achieve the accurate active/reactive power sharing of inverters. P-F and Q-V droop control schemes have been widely used for power sharing in the past decades. But they suffer from the poor power sharing in the presence of unequal line impedance. In order to solve the problem, a comprehensive analysis of the power droop control is presented, and a new droop control based on the impedance match concept is proposed in this paper. In addition, the design guidelines of control coefficients and virtual impedance are provided. Finally, the performance evaluation is carried out, and the evaluation results verify the effectiveness of the proposed method. PMID:24453910

New power sharing control for inverter-dominated microgrid based on impedance match concept.

Science.gov (United States)

Gu, Herong; Wang, Deyu; Shen, Hong; Zhao, Wei; Guo, Xiaoqiang

2013-01-01

Power flow control is one of the most important issues for operating the inverter-dominated autonomous microgrid. A technical challenge is how to achieve the accurate active/reactive power sharing of inverters. P-F and Q-V droop control schemes have been widely used for power sharing in the past decades. But they suffer from the poor power sharing in the presence of unequal line impedance. In order to solve the problem, a comprehensive analysis of the power droop control is presented, and a new droop control based on the impedance match concept is proposed in this paper. In addition, the design guidelines of control coefficients and virtual impedance are provided. Finally, the performance evaluation is carried out, and the evaluation results verify the effectiveness of the proposed method.

Matrix-Inversion-Free Compressed Sensing With Variable Orthogonal Multi-Matching Pursuit Based on Prior Information for ECG Signals.

Science.gov (United States)

Cheng, Yih-Chun; Tsai, Pei-Yun; Huang, Ming-Hao

2016-05-19

Low-complexity compressed sensing (CS) techniques for monitoring electrocardiogram (ECG) signals in wireless body sensor network (WBSN) are presented. The prior probability of ECG sparsity in the wavelet domain is first exploited. Then, variable orthogonal multi-matching pursuit (vOMMP) algorithm that consists of two phases is proposed. In the first phase, orthogonal matching pursuit (OMP) algorithm is adopted to effectively augment the support set with reliable indices and in the second phase, the orthogonal multi-matching pursuit (OMMP) is employed to rescue the missing indices. The reconstruction performance is thus enhanced with the prior information and the vOMMP algorithm. Furthermore, the computation-intensive pseudo-inverse operation is simplified by the matrix-inversion-free (MIF) technique based on QR decomposition. The vOMMP-MIF CS decoder is then implemented in 90 nm CMOS technology. The QR decomposition is accomplished by two systolic arrays working in parallel. The implementation supports three settings for obtaining 40, 44, and 48 coefficients in the sparse vector. From the measurement result, the power consumption is 11.7 mW at 0.9 V and 12 MHz. Compared to prior chip implementations, our design shows good hardware efficiency and is suitable for low-energy applications.

On the use of INS to improve Feature Matching

Science.gov (United States)

Masiero, A.; Guarnieri, A.; Vettore, A.; Pirotti, F.

2014-11-01

The continuous technological improvement of mobile devices opens the frontiers of Mobile Mapping systems to very compact systems, i.e. a smartphone or a tablet. This motivates the development of efficient 3D reconstruction techniques based on the sensors typically embedded in such devices, i.e. imaging sensors, GPS and Inertial Navigation System (INS). Such methods usually exploits photogrammetry techniques (structure from motion) to provide an estimation of the geometry of the scene. Actually, 3D reconstruction techniques (e.g. structure from motion) rely on use of features properly matched in different images to compute the 3D positions of objects by means of triangulation. Hence, correct feature matching is of fundamental importance to ensure good quality 3D reconstructions. Matching methods are based on the appearance of features, that can change as a consequence of variations of camera position and orientation, and environment illumination. For this reason, several methods have been developed in recent years in order to provide feature descriptors robust (ideally invariant) to such variations, e.g. Scale-Invariant Feature Transform (SIFT), Affine SIFT, Hessian affine and Harris affine detectors, Maximally Stable Extremal Regions (MSER). This work deals with the integration of information provided by the INS in the feature matching procedure: a previously developed navigation algorithm is used to constantly estimate the device position and orientation. Then, such information is exploited to estimate the transformation of feature regions between two camera views. This allows to compare regions from different images but associated to the same feature as seen by the same point of view, hence significantly easing the comparison of feature characteristics and, consequently, improving matching. SIFT-like descriptors are used in order to ensure good matching results in presence of illumination variations and to compensate the approximations related to the estimation

Privacy‐Preserving Friend Matching Protocol approach for Pre‐match in Social Networks

DEFF Research Database (Denmark)

Ople, Shubhangi S.; Deshmukh, Aaradhana A.; Mihovska, Albena Dimitrova

2016-01-01

Social services make the most use of the user profile matching to help the users to discover friends with similar social attributes (e.g. interests, location, age). However, there are many privacy concerns that prevent to enable this functionality. Privacy preserving encryption is not suitable...... for use in social networks due to its data sharing problems and information leakage. In this paper, we propose a novel framework for privacy–preserving profile matching. We implement both the client and server portion of the secure match and evaluate its performance network dataset. The results show...

A spherically-shaped PZT thin film ultrasonic transducer with an acoustic impedance gradient matching layer based on a micromachined periodically structured flexible substrate.

Science.gov (United States)

Feng, Guo-Hua; Liu, Wei-Fan

2013-10-09

This paper presents the microfabrication of an acoustic impedance gradient matching layer on a spherically-shaped piezoelectric ultrasonic transducer. The acoustic matching layer can be designed to achieve higher acoustic energy transmission and operating bandwidth. Also included in this paper are a theoretical analysis of the device design and a micromachining technique to produce the novel transducer. Based on a design of a lead titanium zirconium (PZT) micropillar array, the constructed gradient acoustic matching layer has much better acoustic transmission efficiency within a 20-50 MHz operation range compared to a matching layer with a conventional quarter-wavelength thickness Parylene deposition. To construct the transducer, periodic microcavities are built on a flexible copper sheet, and then the sheet forms a designed curvature with a ball shaping. After PZT slurry deposition, the constructed PZT micropillar array is released onto a curved thin PZT layer. Following Parylene conformal coating on the processed PZT micropillars, the PZT micropillars and the surrounding Parylene comprise a matching layer with gradient acoustic impedance. By using the proposed technique, the fabricated transducer achieves a center frequency of 26 MHz and a -6 dB bandwidth of approximately 65%.

Registration of FA and T1-weighted MRI data of healthy human brain based on template matching and normalized cross-correlation.

Science.gov (United States)

Malinsky, Milos; Peter, Roman; Hodneland, Erlend; Lundervold, Astri J; Lundervold, Arvid; Jan, Jiri

2013-08-01

In this work, we propose a new approach for three-dimensional registration of MR fractional anisotropy images with T1-weighted anatomy images of human brain. From the clinical point of view, this accurate coregistration allows precise detection of nerve fibers that is essential in neuroscience. A template matching algorithm combined with normalized cross-correlation was used for this registration task. To show the suitability of the proposed method, it was compared with the normalized mutual information-based B-spline registration provided by the Elastix software library, considered a reference method. We also propose a general framework for the evaluation of robustness and reliability of both registration methods. Both registration methods were tested by four evaluation criteria on a dataset consisting of 74 healthy subjects. The template matching algorithm has shown more reliable results than the reference method in registration of the MR fractional anisotropy and T1 anatomy image data. Significant differences were observed in the regions splenium of corpus callosum and genu of corpus callosum, considered very important areas of brain connectivity. We demonstrate that, in this registration task, the currently used mutual information-based parametric registration can be replaced by more accurate local template matching utilizing the normalized cross-correlation similarity measure.

Maternal obesity in singleton versus twin gestations: a population-based matched case-control study.

Science.gov (United States)

Lucovnik, Miha; Blickstein, Isaac; Verdenik, Ivan; Trojner-Bregar, Andreja; Tul, Natasa

2015-04-01

To examine the impact of pre-pregnancy obesity on adverse outcomes in twin compared to singleton pregnancies. Dichorionic twin gestations with maternal body mass index >30 were matched to three singleton controls. Both obese groups were matched (1:3) with non-obese controls. Rates of preeclampsia, gestational diabetes, cesarean section, and preterm birth were compared. One hundred eighty-nine dichorionic twin pregnancies in obese mothers were matched to 567 twin pregnancies in non-obese mothers, and to 567 singleton pregnancies in obese mothers. The latter were matched to 1701 non-obese mothers with singletons. Preeclampsia was more common in obese mothers with both twins and singletons (odds ratio (OR) 3.95, 95% confidence interval (CI) 2.18-7.16 and OR 6.53, 95% CI 3.75-11.4, respectively) as was gestational diabetes (OR 4.35, 95% CI 2.18-8.69; OR 5.53 95% CI 3.60-8.50). Obese mothers with singletons were more likely to deliver abdominally, but the cesarean rates were obesity independent in twins. Obese mothers were more likely to deliver at Obesity-attributable adverse outcomes are lower in twins compared to singletons. Obesity increases the risk of preterm birth regardless of plurality.

A Depth Video Sensor-Based Life-Logging Human Activity Recognition System for Elderly Care in Smart Indoor Environments

Directory of Open Access Journals (Sweden)

Ahmad Jalal

2014-07-01

Full Text Available Recent advancements in depth video sensors technologies have made human activity recognition (HAR realizable for elderly monitoring applications. Although conventional HAR utilizes RGB video sensors, HAR could be greatly improved with depth video sensors which produce depth or distance information. In this paper, a depth-based life logging HAR system is designed to recognize the daily activities of elderly people and turn these environments into an intelligent living space. Initially, a depth imaging sensor is used to capture depth silhouettes. Based on these silhouettes, human skeletons with joint information are produced which are further used for activity recognition and generating their life logs. The life-logging system is divided into two processes. Firstly, the training system includes data collection using a depth camera, feature extraction and training for each activity via Hidden Markov Models. Secondly, after training, the recognition engine starts to recognize the learned activities and produces life logs. The system was evaluated using life logging features against principal component and independent component features and achieved satisfactory recognition rates against the conventional approaches. Experiments conducted on the smart indoor activity datasets and the MSRDailyActivity3D dataset show promising results. The proposed system is directly applicable to any elderly monitoring system, such as monitoring healthcare problems for elderly people, or examining the indoor activities of people at home, office or hospital.

A depth video sensor-based life-logging human activity recognition system for elderly care in smart indoor environments.

Science.gov (United States)

Jalal, Ahmad; Kamal, Shaharyar; Kim, Daijin

2014-07-02

Recent advancements in depth video sensors technologies have made human activity recognition (HAR) realizable for elderly monitoring applications. Although conventional HAR utilizes RGB video sensors, HAR could be greatly improved with depth video sensors which produce depth or distance information. In this paper, a depth-based life logging HAR system is designed to recognize the daily activities of elderly people and turn these environments into an intelligent living space. Initially, a depth imaging sensor is used to capture depth silhouettes. Based on these silhouettes, human skeletons with joint information are produced which are further used for activity recognition and generating their life logs. The life-logging system is divided into two processes. Firstly, the training system includes data collection using a depth camera, feature extraction and training for each activity via Hidden Markov Models. Secondly, after training, the recognition engine starts to recognize the learned activities and produces life logs. The system was evaluated using life logging features against principal component and independent component features and achieved satisfactory recognition rates against the conventional approaches. Experiments conducted on the smart indoor activity datasets and the MSRDailyActivity3D dataset show promising results. The proposed system is directly applicable to any elderly monitoring system, such as monitoring healthcare problems for elderly people, or examining the indoor activities of people at home, office or hospital.

The Brown-Servranckx matching transformer for simultaneous RFQ to DTL H+ and H- matching

International Nuclear Information System (INIS)

Wadlinger, E.A.; Garnett, R.W.

1996-01-01

The issue involved in the simultaneous matching of H + and H - beams between an RFQ and DTL lies in the fact that both beams experience the same electric-field forces at a given position in the RFQ. Hence, the two beams are focused to the same correlation. However, matching to a DTL requires correlation of the opposite sign. The Brown-Servranckx quarter-wave (λ / 4) matching transformer system, which requires four quadrupoles, provides a method to simultaneously match H + and H - beams between an RFQ and a DTL. The method requires the use of a special RFQ section to obtain the Twiss parameter conditions β x = β y and α x = α y = 0 at the exit of the RFQ. This matching between the RFQ and DTL is described. (author)

The Brown-Servranckx matching transformer for simultaneous RFQ to DTL H+ and H- matching

International Nuclear Information System (INIS)

Wadlinger, E.A.; Garnett, R.W.

1996-01-01

The issue involved in simultaneous matching of H + and H - beams between an RFQ and DTL lies in the fact that both beams experience the same electric-field forces at a given position in the RFQ. Hence, the two beams are focused to the same correlation. However, matching to a DTL requires correlation of the opposite sign. The Brown-Servranckx quarter-wave (λ/4) matching transformer system, which requires four quadrupoles, provides a method to simultaneously match H + and H - beams between an RFQ and a DTL. The method requires the use of a special RFQ section to obtain the Twiss parameter conditions β x =β y and α x =α y =0 at the exit of the RFQ. This matching between the RFQ and DTL is described

Application of four different football match analysis systems

DEFF Research Database (Denmark)

Randers, Morten B; Mujika, Inigo; Hewitt, Adam

2010-01-01

Using a video-based time-motion analysis system, a semi-automatic multiple-camera system, and two commercially available GPS systems (GPS-1; 5 Hz and GPS-2; 1 Hz), we compared activity pattern and fatigue development in the same football match. Twenty football players competing in the Spanish...... a football game and can be used to study game-induced fatigue. Rather large between-system differences were present in the determination of the absolute distances covered, meaning that any comparisons of results between different match analysis systems should be done with caution....

Self-Similar Spin Images for Point Cloud Matching

Science.gov (United States)

Pulido, Daniel

based on the concept of self-similarity to aid in the scale and feature matching steps. An open problem in fusion is how best to extract features from two point clouds and then perform feature-based matching. The proposed approach for this matching step is the use of local self-similarity as an invariant measure to match features. In particular, the proposed approach is to combine the concept of local self-similarity with a well-known feature descriptor, Spin Images, and thereby define "Self-Similar Spin Images". This approach is then extended to the case of matching two points clouds in very different coordinate systems (e.g., a geo-referenced Lidar point cloud and stereo-image derived point cloud without geo-referencing). The use of Self-Similar Spin Images is again applied to address this problem by introducing a "Self-Similar Keyscale" that matches the spatial scales of two point clouds. Another open problem is how best to detect changes in content between two point clouds. A method is proposed to find changes between two point clouds by analyzing the order statistics of the nearest neighbors between the two clouds, and thereby define the "Nearest Neighbor Order Statistic" method. Note that the well-known Hausdorff distance is a special case as being just the maximum order statistic. Therefore, by studying the entire histogram of these nearest neighbors it is expected to yield a more robust method to detect points that are present in one cloud but not the other. This approach is applied at multiple resolutions. Therefore, changes detected at the coarsest level will yield large missing targets and at finer levels will yield smaller targets.

World wide matching of registration metrology tools of various generations

Science.gov (United States)

Laske, F.; Pudnos, A.; Mackey, L.; Tran, P.; Higuchi, M.; Enkrich, C.; Roeth, K.-D.; Schmidt, K.-H.; Adam, D.; Bender, J.

2008-10-01

Turn around time/cycle time is a key success criterion in the semiconductor photomask business. Therefore, global mask suppliers typically allocate work loads based on fab capability and utilization capacity. From a logistical point of view, the manufacturing location of a photomask should be transparent to the customer (mask user). Matching capability of production equipment and especially metrology tools is considered a key enabler to guarantee cross site manufacturing flexibility. Toppan, with manufacturing sites in eight countries worldwide, has an on-going program to match the registration metrology systems of all its production sites. This allows for manufacturing flexibility and risk mitigation.In cooperation with Vistec Semiconductor Systems, Toppan has recently completed a program to match the Vistec LMS IPRO systems at all production sites worldwide. Vistec has developed a new software feature which allows for significantly improved matching of LMS IPRO(x) registration metrology tools of various generations. We will report on the results of the global matching campaign of several of the leading Toppan sites.

Edge-Assignment and Figure-Ground Segmentation in Short-Term Visual Matching.

Science.gov (United States)

Driver, Jon; Baylis, Gordon

1996-01-01

Eight experiments involving 99 college students examined the role of edge-assignment in a contour matching task. Edge-matching performance was not based solely on a raw description of the edges themselves. Results suggest a pervasive tendency within the visual system to go beyond the edges toward figural shapes. (SLD)

Risk and protective factors for meningococcal disease in adolescents: matched cohort study

OpenAIRE

Tully, Joanna; Viner, Russell M; Coen, Pietro G; Stuart, James M; Zambon, Maria; Peckham, Catherine; Booth, Clare; Klein, Nigel; Kaczmarski, Ed; Booy, Robert

2006-01-01

Objective: To examine biological and social risk factors for meningococcal disease in adolescents. Design: Prospective, population based, matched cohort study with controls matched for age and sex in 1:1 matching. Controls were sought from the general practitioner. Setting: Six contiguous regions of England, which represent some 65% of the country’s population. Participants: 15-19 year olds with meningococcal disease recruited at hospital admission in six regions (repr...

Curvelet-domain multiple matching method combined with cubic B-spline function

Science.gov (United States)

Wang, Tong; Wang, Deli; Tian, Mi; Hu, Bin; Liu, Chengming

2018-05-01

Since the large amount of surface-related multiple existed in the marine data would influence the results of data processing and interpretation seriously, many researchers had attempted to develop effective methods to remove them. The most successful surface-related multiple elimination method was proposed based on data-driven theory. However, the elimination effect was unsatisfactory due to the existence of amplitude and phase errors. Although the subsequent curvelet-domain multiple-primary separation method achieved better results, poor computational efficiency prevented its application. In this paper, we adopt the cubic B-spline function to improve the traditional curvelet multiple matching method. First, select a little number of unknowns as the basis points of the matching coefficient; second, apply the cubic B-spline function on these basis points to reconstruct the matching array; third, build constraint solving equation based on the relationships of predicted multiple, matching coefficients, and actual data; finally, use the BFGS algorithm to iterate and realize the fast-solving sparse constraint of multiple matching algorithm. Moreover, the soft-threshold method is used to make the method perform better. With the cubic B-spline function, the differences between predicted multiple and original data diminish, which results in less processing time to obtain optimal solutions and fewer iterative loops in the solving procedure based on the L1 norm constraint. The applications to synthetic and field-derived data both validate the practicability and validity of the method.

IdeMatch – a digital tool for innovative, social and transdisciplinary learning designs

DEFF Research Database (Denmark)

Hansen, Gitte Riis

This paper presents IdeMatch which is a digital tool implemented in University College Zealand (UCZ) in spring 2015. IdeMatch is based on educational policies and educational structural intentions and needs, and this paper examines and offers an outline for the learning perspective and the impact...... that IdeMatch has got concerning teaching and learning designs....

Matched-Filter Thermography

Directory of Open Access Journals (Sweden)

Nima Tabatabaei

2018-04-01

Full Text Available Conventional infrared thermography techniques, including pulsed and lock-in thermography, have shown great potential for non-destructive evaluation of broad spectrum of materials, spanning from metals to polymers to biological tissues. However, performance of these techniques is often limited due to the diffuse nature of thermal wave fields, resulting in an inherent compromise between inspection depth and depth resolution. Recently, matched-filter thermography has been introduced as a means for overcoming this classic limitation to enable depth-resolved subsurface thermal imaging and improving axial/depth resolution. This paper reviews the basic principles and experimental results of matched-filter thermography: first, mathematical and signal processing concepts related to matched-fileting and pulse compression are discussed. Next, theoretical modeling of thermal-wave responses to matched-filter thermography using two categories of pulse compression techniques (linear frequency modulation and binary phase coding are reviewed. Key experimental results from literature demonstrating the maintenance of axial resolution while inspecting deep into opaque and turbid media are also presented and discussed. Finally, the concept of thermal coherence tomography for deconvolution of thermal responses of axially superposed sources and creation of depth-selective images in a diffusion-wave field is reviewed.

Inhibitory mechanism of the matching heuristic in syllogistic reasoning.

Science.gov (United States)

Tse, Ping Ping; Moreno Ríos, Sergio; García-Madruga, Juan Antonio; Bajo Molina, María Teresa

2014-11-01

A number of heuristic-based hypotheses have been proposed to explain how people solve syllogisms with automatic processes. In particular, the matching heuristic employs the congruency of the quantifiers in a syllogism—by matching the quantifier of the conclusion with those of the two premises. When the heuristic leads to an invalid conclusion, successful solving of these conflict problems requires the inhibition of automatic heuristic processing. Accordingly, if the automatic processing were based on processing the set of quantifiers, no semantic contents would be inhibited. The mental model theory, however, suggests that people reason using mental models, which always involves semantic processing. Therefore, whatever inhibition occurs in the processing implies the inhibition of the semantic contents. We manipulated the validity of the syllogism and the congruency of the quantifier of its conclusion with those of the two premises according to the matching heuristic. A subsequent lexical decision task (LDT) with related words in the conclusion was used to test any inhibition of the semantic contents after each syllogistic evaluation trial. In the LDT, the facilitation effect of semantic priming diminished after correctly solved conflict syllogisms (match-invalid or mismatch-valid), but was intact after no-conflict syllogisms. The results suggest the involvement of an inhibitory mechanism of semantic contents in syllogistic reasoning when there is a conflict between the output of the syntactic heuristic and actual validity. Our results do not support a uniquely syntactic process of syllogistic reasoning but fit with the predictions based on mental model theory. Copyright © 2014 Elsevier B.V. All rights reserved.

Entropy-Weighted Instance Matching Between Different Sourcing Points of Interest

Directory of Open Access Journals (Sweden)

Lin Li

2016-01-01

Full Text Available The crucial problem for integrating geospatial data is finding the corresponding objects (the counterpart from different sources. Most current studies focus on object matching with individual attributes such as spatial, name, or other attributes, which avoids the difficulty of integrating those attributes, but at the cost of an ineffective matching. In this study, we propose an approach for matching instances by integrating heterogeneous attributes with the allocation of suitable attribute weights via information entropy. First, a normalized similarity formula is developed, which can simplify the calculation of spatial attribute similarity. Second, sound-based and word segmentation-based methods are adopted to eliminate the semantic ambiguity when there is a lack of a normative coding standard in geospatial data to express the name attribute. Third, category mapping is established to address the heterogeneity among different classifications. Finally, to address the non-linear characteristic of attribute similarity, the weights of the attributes are calculated by the entropy of the attributes. Experiments demonstrate that the Entropy-Weighted Approach (EWA has good performance both in terms of precision and recall for instance matching from different data sets.

Spatial competition with intermediated matching

NARCIS (Netherlands)

van Raalte, C.L.J.P.; Webers, H.M.

1995-01-01

This paper analyzes the spatial competition in commission fees between two match makers. These match makers serve as middlemen between buyers and sellers who are located uniformly on a circle. The profits of the match makers are determined by their respective market sizes. A limited willingness to

Iris recognition using possibilistic fuzzy matching on local features.

Science.gov (United States)

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.

PREDICTING THE MATCH OUTCOME IN ONE DAY INTERNATIONAL CRICKET MATCHES, WHILE THE GAME IS IN PROGRESS

Directory of Open Access Journals (Sweden)

Michael Bailey

2006-12-01

Full Text Available Millions of dollars are wagered on the outcome of one day international (ODI cricket matches, with a large percentage of bets occurring after the game has commenced. Using match information gathered from all 2200 ODI matches played prior to January 2005, a range of variables that could independently explain statistically significant proportions of variation associated with the predicted run totals and match outcomes were created. Such variables include home ground advantage, past performances, match experience, performance at the specific venue, performance against the specific opposition, experience at the specific venue and current form. Using a multiple linear regression model, prediction variables were numerically weighted according to statistical significance and used to predict the match outcome. With the use of the Duckworth-Lewis method to determine resources remaining, at the end of each completed over, the predicted run total of the batting team could be updated to provide a more accurate prediction of the match outcome. By applying this prediction approach to a holdout sample of matches, the efficiency of the "in the run" wagering market could be assessed. Preliminary results suggest that the market is prone to overreact to events occurring throughout the course of the match, thus creating brief inefficiencies in the wagering market

Constructivist-Based Asynchronous Tutorial to Improve Transfer between Math and Chemistry Domains: Design, Implementation, and Analysis of the Impact of ReMATCH on General Chemistry Course Performance and Confidence

Science.gov (United States)

Barker, M. Danielle

2011-07-01

The two-year implementation of ReMATCH, a web-based math and problem-solving tutorial, in a traditionally arranged general chemistry classroom at the University of Kansas examined the impact of a designed intervention to assist students with the transfer of their mathematical knowledge to a chemistry context where it could be readily used for quantitative problem solving. The ReMATCH intervention, designed on constructivist-based pedagogies, focused on illuminating the expert-processes of problem solving and transferring knowledge across domains to the novice chemistry. The two implementations of ReMATCH -- once as lab assignments and once lecture assignments -- resulted in very different student responses to the intervention. However, within both, the beneficial effects of sustained ReMATCH-use were visible. In 2006, students who attempted all of the ReMATCH homework assignments were predicted to earn ˜5% higher on their total exam points. The 2007 implementation of ReMATCH demonstrated that students who attempted all of the homework problems and visited at least half of the ReMATCH tutorial pages were predicted to earn ˜8.5% higher on their total exam points. Additionally, use of ReMATCH in 2006 also resulted in increased confidence (as measured by comfort-level) with some of the math-related chemistry topics covered in ReMATCH. In 2007, when only students who attempted all of the ReMATCH problems were considered, it became clear that individuals who were initially less confident in their math-related chemistry skills were more likely to view more of the ReMATCH tutorial pages. When students with lower initial comfort-levels on these topics viewed at least half of the ReMATCH tutorial pages, they were able to compensate for their initially lower levels of confidence and were equally comfortable with most of the math-related chemistry topics by the final survey. Student interactions with and perceptions of ReMATCH showed that student attitudes towards ReMATCH

DEHYDRATION IN SOCCER PLAYERS AFTER A MATCH IN THE HEAT

Directory of Open Access Journals (Sweden)

J.C.B. Marins

2011-11-01

Full Text Available We investigated the level of dehydration after a match in 20 soccer players (mean ± SD, 17.9 ± 1.3 years old, height 1.75 ± 0.05 m, body mass 70.71± 7.65 kg from two teams that participate in a Brazilian Championship game performed at a temperature of 29 ± 1.1 C and a relative humidity of 64 ± 4.2%. Body mass, urine specific gravity and urinary protein were measured before and after the match, and self-perception measurements were performed during the match. Body mass loss was 1.00 ± 0.39 kg, corresponding to a dehydration percentage of 1.35 ± 0.87%. The mean sweating rate during the match was 866 ± 319 ml · h[sup]-1[/sup] and total fluid intake was 1265.00 ± 505.45 ml. The sweating rate and the quantity of ingested fluids correlated positively (r = 0.98; P<0.05. Protein occurred in the urine in 18 soccer players. The players showed no perception of thirst and considered themselves as comfortable during the match. At the end of the match the soccer players replaced 57.7 ± 15% of the water loss and presented a condition of significant to severe dehydration based on the post-match urine specific gravity data (1.027 ± 6 g · ml[sup]-1[/sup]. The results of this study demonstrate that most of the soccer players began the match with some degree of dehydration that worsened during the match.

Lattice and strain analysis of atomic resolution Z-contrast images based on template matching

Energy Technology Data Exchange (ETDEWEB)

Zuo, Jian-Min, E-mail: jianzuo@uiuc.edu [Department of Materials Science and Engineering, University of Illinois, Urbana, IL 61801 (United States); Seitz Materials Research Laboratory, University of Illinois, Urbana, IL 61801 (United States); Shah, Amish B. [Center for Microanalysis of Materials, Materials Research Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL 61801 (United States); Kim, Honggyu; Meng, Yifei; Gao, Wenpei [Department of Materials Science and Engineering, University of Illinois, Urbana, IL 61801 (United States); Seitz Materials Research Laboratory, University of Illinois, Urbana, IL 61801 (United States); Rouviére, Jean-Luc [CEA-INAC/UJF-Grenoble UMR-E, SP2M, LEMMA, Minatec, Grenoble 38054 (France)

2014-01-15

A real space approach is developed based on template matching for quantitative lattice analysis using atomic resolution Z-contrast images. The method, called TeMA, uses the template of an atomic column, or a group of atomic columns, to transform the image into a lattice of correlation peaks. This is helped by using a local intensity adjusted correlation and by the design of templates. Lattice analysis is performed on the correlation peaks. A reference lattice is used to correct for scan noise and scan distortions in the recorded images. Using these methods, we demonstrate that a precision of few picometers is achievable in lattice measurement using aberration corrected Z-contrast images. For application, we apply the methods to strain analysis of a molecular beam epitaxy (MBE) grown LaMnO{sub 3} and SrMnO{sub 3} superlattice. The results show alternating epitaxial strain inside the superlattice and its variations across interfaces at the spatial resolution of a single perovskite unit cell. Our methods are general, model free and provide high spatial resolution for lattice analysis. - Highlights: • A real space approach is developed for strain analysis using atomic resolution Z-contrast images and template matching. • A precision of few picometers is achievable in the measurement of lattice displacements. • The spatial resolution of a single perovskite unit cell is demonstrated for a LaMnO{sub 3} and SrMnO{sub 3} superlattice grown by MBE.

FBG Interrogation Method with High Resolution and Response Speed Based on a Reflective-Matched FBG Scheme

Science.gov (United States)

Cui, Jiwen; Hu, Yang; Feng, Kunpeng; Li, Junying; Tan, Jiubin

2015-01-01

In this paper, a high resolution and response speed interrogation method based on a reflective-matched Fiber Bragg Grating (FBG) scheme is investigated in detail. The nonlinear problem of the reflective-matched FBG sensing interrogation scheme is solved by establishing and optimizing the mathematical model. A mechanical adjustment to optimize the interrogation method by tuning the central wavelength of the reference FBG to improve the stability and anti-temperature perturbation performance is investigated. To satisfy the measurement requirements of optical and electric signal processing, a well- designed acquisition circuit board is prepared, and experiments on the performance of the interrogation method are carried out. The experimental results indicate that the optical power resolution of the acquisition circuit border is better than 8 pW, and the stability of the interrogation method with the mechanical adjustment can reach 0.06%. Moreover, the nonlinearity of the interrogation method is 3.3% in the measurable range of 60 pm; the influence of temperature is significantly reduced to 9.5%; the wavelength resolution and response speed can achieve values of 0.3 pm and 500 kHz, respectively. PMID:26184195

A high-resolution processing technique for improving the energy of weak signal based on matching pursuit

Directory of Open Access Journals (Sweden)

Shuyan Wang

2016-05-01

Full Text Available This paper proposes a new method to improve the resolution of the seismic signal and to compensate the energy of weak seismic signal based on matching pursuit. With a dictionary of Morlet wavelets, matching pursuit algorithm can decompose a seismic trace into a series of wavelets. We abstract complex-trace attributes from analytical expressions to shrink the search range of amplitude, frequency and phase. In addition, considering the level of correlation between constituent wavelets and average wavelet abstracted from well-seismic calibration, we can obtain the search range of scale which is an important adaptive parameter to control the width of wavelet in time and the bandwidth of frequency. Hence, the efficiency of selection of proper wavelets is improved by making first a preliminary estimate and refining a local selecting range. After removal of noise wavelets, we integrate useful wavelets which should be firstly executed by adaptive spectral whitening technique. This approach can improve the resolutions of seismic signal and enhance the energy of weak wavelets simultaneously. The application results of real seismic data show this method has a good perspective of application.

Constructed-Response Matching to Sample and Spelling Instruction.

Science.gov (United States)

Dube, William V.; And Others

1991-01-01

This paper describes a computer-based spelling program grounded in programed instructional techniques and using constructed-response matching-to-sample procedures. Following use of the program, two mentally retarded men successfully spelled previously misspelled words. (JDD)

Analytical modelling of waveguide mode launchers for matched feed reflector systems

DEFF Research Database (Denmark)

Palvig, Michael Forum; Breinbjerg, Olav; Meincke, Peter

2016-01-01

Matched feed horns aim to cancel cross polarization generated in offset reflector systems. An analytical method for predicting the mode spectrum generated by inclusions in such horns, e.g. stubs and pins, is presented. The theory is based on the reciprocity theorem with the inclusions represented...... by current sources. The model is supported by Method of Moments calculations in GRASP and very good agreement is seen. The model gives rise to many interesting observations and ideas for new or improved mode launchers for matched feeds.......Matched feed horns aim to cancel cross polarization generated in offset reflector systems. An analytical method for predicting the mode spectrum generated by inclusions in such horns, e.g. stubs and pins, is presented. The theory is based on the reciprocity theorem with the inclusions represented...

Adaptação de escalas de silhuetas bidimensionais e tridimensionais para o deficiente visual Adaptation of two and three dimensional silhouette scales for the visually impaired

Directory of Open Access Journals (Sweden)

Fabiane Frota da Rocha Morgado

2011-04-01

Full Text Available O objetivo deste estudo foi descrever o processo de adaptação da Escala de Silhuetas Bidimensionais (ESB e de criação da Escala de Silhuetas Tridimensionais (EST. Para isso uma pesquisa de cunho qualitativo realizado em três etapas: na primeira, foi solicitada a autorização do prof. Stunkard para a utilização de seu instrumento como parâmetro para a confecção das Escalas. Na segunda, foi confeccionada a ESB e na terceira, a EST. Estas Escalas foram elaboradas considerando os critérios técnicos da Divisão de Pesquisa e Produção de Material Especializado do Instituto Benjamin Constant - RJ. Os resultados indicaram que a ESB foi confeccionada em linguagem grafo-tátil em alto relevo e é composta por nove bonecos masculinos e nove femininos, com diferentes formas corporais, texturizados com lixa de parede e linha. Os bonecos possuem 8,5 cm de altura. A EST foi composta por nove bonecos masculinos e nove femininos, com diferentes pesos e formas corporais. Os modelos foram confeccionados através de processo artesanal e constituídos de gesso pedra. Os bonecos do gênero masculino possuem altura de 15,5 cm e os do gênero feminino, 13,5 cm. Conclui-se que as informações contidas na descrição detalhada dos processos de confecção da ESB e EST podem ser um referencial para adaptações futuras e melhoradas de outras Escalas de figuras humanas, desenvolvidas a partir deste primeiro referencial.The objective of this study was to describe the process of adaptation of the Two Dimencional Silhouette Scale (2DSS and the development of a Three Dimensional Silhouette Scale (3DSS. To that end, a qualitative study was conducted in three stages: In the first one, the creator of the tool, Mr. Stunkard was contacted for permission to use his instrument as a parameter for the development of the scales. In the second and third ones, the 2DSS and the 3DSS were developed, respectively. These scales were developed considering the technical criteria

Rethinking the Match: A Proposal for Modern Matchmaking.

Science.gov (United States)

Ray, Chris; Bishop, Steven E; Dow, Alan W

2018-01-01

Since the 1950s, the National Resident Matching Program, or "the Match," has governed the placement of medical students into residencies. The Match was created to protect students in an era when residency positions outnumbered applicants and hospitals pressured students early in their academic careers to commit to a residency position. Now, however, applicants outnumber positions, applicants are applying to increasing numbers of programs, and the costs of the Match for applicants and programs are high. Meanwhile, medical education is evolving toward a competency-based approach, a U.S. physician shortage is predicted, and some researchers describe a "July effect"-worse clinical outcomes correlated with the mass entry of new residents.Against this background, the authors argue for adopting a more modern, free-market approach to residency matchmaking that might better suit the needs of applicants, programs, and the public. They propose allowing students who have been identified by their medical schools as having achieved graduation-level competency to apply to residency programs at any point during the year. Residency programs would set their own application timetables and extend offers in an ongoing fashion. Students, counseled by their schools, would accept or decline offers as desired. The authors argue this approach would better support competency-based education while allowing applicants and programs more choice regarding how they engage and adapt within the selection process. The approach's staggered start times for new residents might attenuate the July effect and improve outcomes for patients. Medical students might also enter and thereby complete residency earlier, increasing the physician workforce.

Stinging Insect Matching Game

Science.gov (United States)

... 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 ...

Data Matching Concepts and Techniques for Record Linkage, Entity Resolution, and Duplicate Detection

CERN Document Server

Christen, Peter

2012-01-01

Data matching (also known as record or data linkage, entity resolution, object identification, or field matching) is the task of identifying, matching and merging records that correspond to the same entities from several databases or even within one database. Based on research in various domains including applied statistics, health informatics, data mining, machine learning, artificial intelligence, database management, and digital libraries, significant advances have been achieved over the last decade in all aspects of the data matching process, especially on how to improve the accuracy of da

Identification of meat products by shotgun spectral matching

DEFF Research Database (Denmark)

Ohana, D.; Dalebout, H.; Marissen, R. J.

2016-01-01

A new method, based on shotgun spectral matching of peptide tandem mass spectra, was successfully applied to the identification of different food species. The method was demonstrated to work on raw as well as processed samples from 16 mammalian and 10 bird species by counting spectral matches...... to spectral libraries in a reference database with one spectral library per species. A phylogenetic tree could also be constructed directly from the spectra. Nearly all samples could be correctly identified at the species level, and 100% at the genus level. The method does not use any genomic information...

Anthropometric body measurements based on multi-view stereo image reconstruction.

Science.gov (United States)

Li, Zhaoxin; Jia, Wenyan; Mao, Zhi-Hong; Li, Jie; Chen, Hsin-Chen; Zuo, Wangmeng; Wang, Kuanquan; Sun, Mingui

2013-01-01

Anthropometric measurements, such as the circumferences of the hip, arm, leg and waist, waist-to-hip ratio, and body mass index, are of high significance in obesity and fitness evaluation. In this paper, we present a home based imaging system capable of conducting anthropometric measurements. Body images are acquired at different angles using a home camera and a simple rotating disk. Advanced image processing algorithms are utilized for 3D body surface reconstruction. A coarse body shape model is first established from segmented body silhouettes. Then, this model is refined through an inter-image consistency maximization process based on an energy function. Our experimental results using both a mannequin surrogate and a real human body validate the feasibility of the proposed system.

Fingerprint matching algorithm for poor quality images

Directory of Open Access Journals (Sweden)

Vedpal Singh

2015-04-01

Full Text Available The main aim of this study is to establish an efficient platform for fingerprint matching for low-quality images. Generally, fingerprint matching approaches use the minutiae points for authentication. However, it is not such a reliable authentication method for low-quality images. To overcome this problem, the current study proposes a fingerprint matching methodology based on normalised cross-correlation, which would improve the performance and reduce the miscalculations during authentication. It would decrease the computational complexities. The error rate of the proposed method is 5.4%, which is less than the two-dimensional (2D dynamic programming (DP error rate of 5.6%, while Lee's method produces 5.9% and the combined method has 6.1% error rate. Genuine accept rate at 1% false accept rate is 89.3% but at 0.1% value it is 96.7%, which is higher. The outcome of this study suggests that the proposed methodology has a low error rate with minimum computational effort as compared with existing methods such as Lee's method and 2D DP and the combined method.

An Matching Method for Vehicle-borne Panoramic Image Sequence Based on Adaptive Structure from Motion Feature

Directory of Open Access Journals (Sweden)

ZHANG Zhengpeng

2015-10-01

Full Text Available Panoramic image matching method with the constraint condition of local structure from motion similarity feature is an important method, the process requires multivariable kernel density estimations for the structure from motion feature used nonparametric mean shift. Proper selection of the kernel bandwidth is a critical step for convergence speed and accuracy of matching method. Variable bandwidth with adaptive structure from motion feature for panoramic image matching method has been proposed in this work. First the bandwidth matrix is defined using the locally adaptive spatial structure of the sampling point in spatial domain and optical flow domain. The relaxation diffusion process of structure from motion similarity feature is described by distance weighting method of local optical flow feature vector. Then the expression form of adaptive multivariate kernel density function is given out, and discusses the solution of the mean shift vector, termination conditions, and the seed point selection method. The final fusions of multi-scale SIFT the features and structure features to establish a unified panoramic image matching framework. The sphere panoramic images from vehicle-borne mobile measurement system are chosen such that a comparison analysis between fixed bandwidth and adaptive bandwidth is carried out in detail. The results show that adaptive bandwidth is good for case with the inlier ratio changes and the object space scale changes. The proposed method can realize the adaptive similarity measure of structure from motion feature, improves the correct matching points and matching rate, experimental results have shown our method to be robust.

Face recognition: Eigenface, elastic matching, and neural nets

International Nuclear Information System (INIS)

Zhang, J.; Lades, M.

1997-01-01

This paper is a comparative study of three recently proposed algorithms for face recognition: eigenface, autoassociation and classification neural nets, and elastic matching. After these algorithms were analyzed under a common statistical decision framework, they were evaluated experimentally on four individual data bases, each with a moderate subject size, and a combined data base with more than a hundred different subjects. Analysis and experimental results indicate that the eigenface algorithm, which is essentially a minimum distance classifier, works well when lighting variation is small. Its performance deteriorates significantly as lighting variation increases. The elastic matching algorithm, on the other hand, is insensitive to lighting, face position, and expression variations and therefore is more versatile. The performance of the autoassociation and classification nets is upper bounded by that of the eigenface but is more difficult to implement in practice

Tensile Properties of Under-Matched Weld Joints for 950 MPa Steel.

Science.gov (United States)

Yamamoto, Kouji; Arakawa, Toshiaki; Akazawa, Nobuki; Yamamoto, Kousei; Matsuo, Hiroki; Nakagara, Kiyoyuki; Suita, Yoshikazu

In welding of 950 MPa-class high tensile strength steel, preheating is crucial in order to avoid cold cracks, which, however, eventually increases welding deformations. One way to decrease welding deformations is lowering preheating temperature by using under-matched weld metal. Toyota and others clarify that although breaking elongation can decrease due to plastic constraint effect under certain conditions, static tensile of under-matched weld joints is comparable to that of base metal. However, there has still been no report about joint static tensile of under-matched weld joints applied to 950 MPa-class high tensile strength steel. In this study, we aim to research tensile strength and fatigue strength of under-matched weld joints applied to 950 MPa-class high tensile steel.

Neural network based pattern matching and spike detection tools and services--in the CARMEN neuroinformatics project.

Science.gov (United States)

Fletcher, Martyn; Liang, Bojian; Smith, Leslie; Knowles, Alastair; Jackson, Tom; Jessop, Mark; Austin, Jim

2008-10-01

In the study of information flow in the nervous system, component processes can be investigated using a range of electrophysiological and imaging techniques. Although data is difficult and expensive to produce, it is rarely shared and collaboratively exploited. The Code Analysis, Repository and Modelling for e-Neuroscience (CARMEN) project addresses this challenge through the provision of a virtual neuroscience laboratory: an infrastructure for sharing data, tools and services. Central to the CARMEN concept are federated CARMEN nodes, which provide: data and metadata storage, new, thirdparty and legacy services, and tools. In this paper, we describe the CARMEN project as well as the node infrastructure and an associated thick client tool for pattern visualisation and searching, the Signal Data Explorer (SDE). We also discuss new spike detection methods, which are central to the services provided by CARMEN. The SDE is a client application which can be used to explore data in the CARMEN repository, providing data visualization, signal processing and a pattern matching capability. It performs extremely fast pattern matching and can be used to search for complex conditions composed of many different patterns across the large datasets that are typical in neuroinformatics. Searches can also be constrained by specifying text based metadata filters. Spike detection services which use wavelet and morphology techniques are discussed, and have been shown to outperform traditional thresholding and template based systems. A number of different spike detection and sorting techniques will be deployed as services within the CARMEN infrastructure, to allow users to benchmark their performance against a wide range of reference datasets.

Real-time eSports Match Result Prediction

OpenAIRE

Yang, Yifan; Qin, Tian; Lei, Yu-Heng

2016-01-01

In this paper, we try to predict the winning team of a match in the multiplayer eSports game Dota 2. To address the weaknesses of previous work, we consider more aspects of prior (pre-match) features from individual players' match history, as well as real-time (during-match) features at each minute as the match progresses. We use logistic regression, the proposed Attribute Sequence Model, and their combinations as the prediction models. In a dataset of 78362 matches where 20631 matches contai...

S-1-Based versus capecitabine-based preoperative chemoradiotherapy in the treatment of locally advanced rectal cancer: a matched-pair analysis.

Directory of Open Access Journals (Sweden)

Meng Su

Full Text Available OBJECTIVE: The aim of this paper was to compare the efficacy and safety of S-1-based and capecitabine-based preoperative chemoradiotherapy regimens in patients with locally advanced rectal cancer through a retrospective matched-pair analysis. MATERIALS AND METHODS: Between Jan 2010 and Mar 2014, 24 patients with locally advanced rectal cancer who received preoperative radiotherapy concurrently with S-1 were individually matched with 24 contemporary patients with locally advanced rectal cancer who received preoperative radiotherapy concurrently with capecitabine according to clinical stage (as determined by pelvic magnetic resonance imaging and computed tomography and age (within five years. All these patients performed mesorectal excision 4-8 weeks after the completion of chemoradiotherapy. RESULTS: The tumor volume reduction rates were 55.9±15.1% in the S-1 group and 53.8±16.0% in the capecitabine group (p = 0.619. The overall downstaging, including both T downstaging and N downstaging, occurred in 83.3% of the S-1 group and 70.8% of the capecitabine group (p = 0.508. The significant tumor regression, including regression grade I and II, occurred in 33.3% of S-1 patients and 25.0% of capecitabine patients (p = 0.754. In the two groups, Grade 4 adverse events were not observed and Grade 3 consisted of only two cases of diarrhea, and no patient suffered hematologic adverse event of Grade 2 or higher. However, the incidence of diarrhea (62.5% vs 33.3%, p = 0.014 and hand-foot syndrome (29.2% vs 0%, p = 0.016 were higher in capecitabine group. Other adverse events did not differ significantly between two groups. CONCLUSIONS: The two preoperative chemoradiotherapy regimens were effective and safe for patients of locally advanced rectal cancer, but regimen with S-1 exhibited a lower incidence of adverse events.

Rating Algorithm for Pronunciation of English Based on Audio Feature Pattern Matching

Directory of Open Access Journals (Sweden)

Li Kun

2015-01-01

Full Text Available With the increasing internationalization of China, language communication has become an important channel for us to adapt to the political and economic environment. How to improve English learners’ language learning efficiency in limited conditions has turned into a problem demanding prompt solution at present. This paper applies two pronunciation patterns according to the actual needs of English pronunciation rating: to-be-evaluated pronunciation pattern and standard pronunciation pattern. It will translate the patterns into English pronunciation rating results through European distance. Besides, this paper will introduce the design philosophy of the whole algorithm in combination with CHMM matching pattern. Each link of the CHMM pattern will be given selective analysis while a contrast experiment between the CHMM matching pattern and the other two patterns will be conducted. From the experiment results, it can be concluded that CHMM pattern is the best option.

Image matching as a data source for forest inventory - Comparison of Semi-Global Matching and Next-Generation Automatic Terrain Extraction algorithms in a typical managed boreal forest environment

Science.gov (United States)

Kukkonen, M.; Maltamo, M.; Packalen, P.

2017-08-01

Image matching is emerging as a compelling alternative to airborne laser scanning (ALS) as a data source for forest inventory and management. There is currently an open discussion in the forest inventory community about whether, and to what extent, the new method can be applied to practical inventory campaigns. This paper aims to contribute to this discussion by comparing two different image matching algorithms (Semi-Global Matching [SGM] and Next-Generation Automatic Terrain Extraction [NGATE]) and ALS in a typical managed boreal forest environment in southern Finland. Spectral features from unrectified aerial images were included in the modeling and the potential of image matching in areas without a high resolution digital terrain model (DTM) was also explored. Plot level predictions for total volume, stem number, basal area, height of basal area median tree and diameter of basal area median tree were modeled using an area-based approach. Plot level dominant tree species were predicted using a random forest algorithm, also using an area-based approach. The statistical difference between the error rates from different datasets was evaluated using a bootstrap method. Results showed that ALS outperformed image matching with every forest attribute, even when a high resolution DTM was used for height normalization and spectral information from images was included. Dominant tree species classification with image matching achieved accuracy levels similar to ALS regardless of the resolution of the DTM when spectral metrics were used. Neither of the image matching algorithms consistently outperformed the other, but there were noticeably different error rates depending on the parameter configuration, spectral band, resolution of DTM, or response variable. This study showed that image matching provides reasonable point cloud data for forest inventory purposes, especially when a high resolution DTM is available and information from the understory is redundant.

Comparison of the Physical and Technical Demands of Cricket Players During Training and Match-Play.

Science.gov (United States)

Vickery, Will; Duffield, Rob; Crowther, Rian; Beakley, David; Blanch, Peter; Dascombe, Ben J

2018-03-01

Vickery, W, Duffield, R, Crowther, R, Beakley, D, Blanch, P, and Dascombe, BJ. Comparison of the physical and technical demands of cricket players during training and match-play. J Strength Cond Res 32(3): 821-829, 2018-This study aimed to determine which training method (net-based sessions or center-wicket simulations) currently used in national level and U19 male players cricket provided a more physical and technical match-specific training response. The heart rate, rating of perceived exertion, and movement patterns of 42 male cricket players were measured across the various training and match formats. Video analysis was coded retrospectively to quantify technical loads based on the cricket skills performed. Magnitude-based inferences were based on the standardization of effect and presented with ±90% confidence intervals. Regardless of playing position, differences in physiological demands between training modes and match-play were unclear, with the exception of higher heart rates in fielders during traditional net sessions (mean heart rate: d = -2.7 [-4.7 to -0.7]; 75% of maximum heart rate: d = -1.7 [-3.2 to -0.2]). Typically, the movement demands of center-wicket simulations were similar or greater than match-play, which was most evident in the distance traveled at a high intensity within each playing position (batsmen: d = 6.4 [3.7-9.2]; medium-fast bowlers: d = 1.71 [0.1-3.3]; spin bowlers: d = 6.5 [0.01-13.0]; fielders: d = 0.8 [-0.2 to 1.7]). The technical demands of traditional net cricket training exceeded that of a typical match for each playing position. Specifically, fast bowlers delivered a greater number of balls during net-bowling compared with a match (d = -2.2 [-3.6 to 0.9]). In conclusion, center-wicket simulations more closely matched the physical demands of a One-Day match within batsmen and spin bowlers, whereas traditional cricket training often exceeded match-specific demands.

Design Studies of a CZT-based Detector Combined with a Pixel-Geometry-Matching Collimator for SPECT Imaging.

Science.gov (United States)

Weng, Fenghua; Bagchi, Srijeeta; Huang, Qiu; Seo, Youngho

2013-10-01

Single Photon Emission Computed Tomography (SPECT) suffers limited efficiency due to the need for collimators. Collimator properties largely decide the data statistics and image quality. Various materials and configurations of collimators have been investigated in many years. The main thrust of our study is to evaluate the design of pixel-geometry-matching collimators to investigate their potential performances using Geant4 Monte Carlo simulations. Here, a pixel-geometry-matching collimator is defined as a collimator which is divided into the same number of pixels as the detector's and the center of each pixel in the collimator is a one-to-one correspondence to that in the detector. The detector is made of Cadmium Zinc Telluride (CZT), which is one of the most promising materials for applications to detect hard X-rays and γ -rays due to its ability to obtain good energy resolution and high light output at room temperature. For our current project, we have designed a large-area, CZT-based gamma camera (20.192 cm×20.192 cm) with a small pixel pitch (1.60 mm). The detector is pixelated and hence the intrinsic resolution can be as small as the size of the pixel. Materials of collimator, collimator hole geometry, detection efficiency, and spatial resolution of the CZT detector combined with the pixel-matching collimator were calculated and analyzed under different conditions. From the simulation studies, we found that such a camera using rectangular holes has promising imaging characteristics in terms of spatial resolution, detection efficiency, and energy resolution.

45 CFR 2516.700 - What matching funds are required?

Science.gov (United States)

2010-10-01

... COMMUNITY SERVICE SCHOOL-BASED SERVICE-LEARNING PROGRAMS Funding Requirements § 2516.700 What matching funds... for that share through State sources, local sources, or Federal sources (other than funds made...

Sparse Reconstruction of Regional Gravity Signal Based on Stabilized Orthogonal Matching Pursuit (SOMP)

Science.gov (United States)

Saadat, S. A.; Safari, A.; Needell, D.

2016-06-01

The main role of gravity field recovery is the study of dynamic processes in the interior of the Earth especially in exploration geophysics. In this paper, the Stabilized Orthogonal Matching Pursuit (SOMP) algorithm is introduced for sparse reconstruction of regional gravity signals of the Earth. In practical applications, ill-posed problems may be encountered regarding unknown parameters that are sensitive to the data perturbations. Therefore, an appropriate regularization method needs to be applied to find a stabilized solution. The SOMP algorithm aims to regularize the norm of the solution vector, while also minimizing the norm of the corresponding residual vector. In this procedure, a convergence point of the algorithm that specifies optimal sparsity-level of the problem is determined. The results show that the SOMP algorithm finds the stabilized solution for the ill-posed problem at the optimal sparsity-level, improving upon existing sparsity based approaches.

A new taxonomy of sublinear keyword pattern matching algorithms

NARCIS (Netherlands)

Cleophas, L.G.W.A.; Watson, B.W.; Zwaan, G.

2004-01-01

Abstract This paper presents a new taxonomy of sublinear (multiple) keyword pattern matching algorithms. Based on an earlier taxonomy by Watson and Zwaan [WZ96, WZ95], this new taxonomy includes not only suffix-based algorithms related to the Boyer-Moore, Commentz-Walter and Fan-Su algorithms, but

An Improvement on LSB Matching and LSB Matching Revisited Steganography Methods

OpenAIRE

Qazanfari, Kazem; Safabakhsh, Reza

2017-01-01

The aim of the steganography methods is to communicate securely in a completely undetectable manner. LSB Matching and LSB Matching Revisited steganography methods are two general and esiest methods to achieve this aim. Being secured against first order steganalysis methods is the most important feature of these methods. On the other hand, these methods don't consider inter pixel dependency. Therefore, recently, several steganalysis methods are proposed that by using co-occurrence matrix detec...

Matching of Energy Provisions in Multihop Wireless Infra-Structures

Directory of Open Access Journals (Sweden)

Rui Teng

2016-01-01

Full Text Available Recently there have been large advances in energy technologies for battery-operated systems, including green energy resources and high capacity batteries. The effective use of battery energy resources in wireless infrastructure networks to improve the versatility and reliability of wireless communications is an important issue. Emerging applications of smart cities, Internet of Things (IoT, and emergency responses highly rely on the basic communication network infrastructures that enable ubiquitous network connections. However, energy consumption by nodes in a wireless infrastructure network depends on the transmissions of other nodes in the network. Considering this inter-dependence is necessary to achieve efficient provision of energy in wireless networks. This paper studies the issue of energy provision for wireless relay nodes in Wireless Multihop Infrastructures (WMI assuming constraints on the total energy provision. We introduce a scheme of Energy Provision Matching (Matching-EP for WMI which optimizes energy provision based on matching of energy provision with estimates of differentiated position-dependent energy consumption by wireless nodes distributed in the network. The evaluation results show that Matching-EP with 4%–34% improvement in energy matching degree enables 10%–40% improvement of the network lifetime, and 5%–40% improvement of packet delivery compared with conventional WMI networks.

Towards a Next-Generation Catalogue Cross-Match Service

Science.gov (United States)

Pineau, F.; Boch, T.; Derriere, S.; Arches Consortium

2015-09-01

We have been developing in the past several catalogue cross-match tools. On one hand the CDS XMatch service (Pineau et al. 2011), able to perform basic but very efficient cross-matches, scalable to the largest catalogues on a single regular server. On the other hand, as part of the European project ARCHES1, we have been developing a generic and flexible tool which performs potentially complex multi-catalogue cross-matches and which computes probabilities of association based on a novel statistical framework. Although the two approaches have been managed so far as different tracks, the need for next generation cross-match services dealing with both efficiency and complexity is becoming pressing with forthcoming projects which will produce huge high quality catalogues. We are addressing this challenge which is both theoretical and technical. In ARCHES we generalize to N catalogues the candidate selection criteria - based on the chi-square distribution - described in Pineau et al. (2011). We formulate and test a number of Bayesian hypothesis which necessarily increases dramatically with the number of catalogues. To assign a probability to each hypotheses, we rely on estimated priors which account for local densities of sources. We validated our developments by comparing the theoretical curves we derived with the results of Monte-Carlo simulations. The current prototype is able to take into account heterogeneous positional errors, object extension and proper motion. The technical complexity is managed by OO programming design patterns and SQL-like functionalities. Large tasks are split into smaller independent pieces for scalability. Performances are achieved resorting to multi-threading, sequential reads and several tree data-structures. In addition to kd-trees, we account for heterogeneous positional errors and object's extension using M-trees. Proper-motions are supported using a modified M-tree we developed, inspired from Time Parametrized R-trees (TPR

Thorvaldsen's Shadow

DEFF Research Database (Denmark)

Dam Christensen, Hans

2010-01-01

as well as their importance in a more general history of visual culture. First and foremost, the article points to the fact that silhouettes once were a very popular way of making portraits, which has been neglected by posterity. Next, it discusses silhouette portraits in a wider context that invites......-photographic" reception of silhouette portraits, where the indexical representation (in a Peircean sense) of a beloved, deceased or missed person is stressed; this "pre-photographic" reception is a mode of affective reception which we nowadays seem to overlook. In other words, the article argues that silhouette portraits...

An Efficient Metric of Automatic Weight Generation for Properties in Instance Matching Technique

OpenAIRE

Seddiqui, Md. Hanif; Nath, Rudra Pratap Deb; Aono, Masaki

2015-01-01

The proliferation of heterogeneous data sources of semantic knowledge base intensifies the need of an automatic instance matching technique. However, the efficiency of instance matching is often influenced by the weight of a property associated to instances. Automatic weight generation is a non-trivial, however an important task in instance matching technique. Therefore, identifying an appropriate metric for generating weight for a property automatically is nevertheless a formidab...

Error Analysis for RADAR Neighbor Matching Localization in Linear Logarithmic Strength Varying Wi-Fi Environment

Directory of Open Access Journals (Sweden)

Mu Zhou

2014-01-01

Full Text Available This paper studies the statistical errors for the fingerprint-based RADAR neighbor matching localization with the linearly calibrated reference points (RPs in logarithmic received signal strength (RSS varying Wi-Fi environment. To the best of our knowledge, little comprehensive analysis work has appeared on the error performance of neighbor matching localization with respect to the deployment of RPs. However, in order to achieve the efficient and reliable location-based services (LBSs as well as the ubiquitous context-awareness in Wi-Fi environment, much attention has to be paid to the highly accurate and cost-efficient localization systems. To this end, the statistical errors by the widely used neighbor matching localization are significantly discussed in this paper to examine the inherent mathematical relations between the localization errors and the locations of RPs by using a basic linear logarithmic strength varying model. Furthermore, based on the mathematical demonstrations and some testing results, the closed-form solutions to the statistical errors by RADAR neighbor matching localization can be an effective tool to explore alternative deployment of fingerprint-based neighbor matching localization systems in the future.

Error Analysis for RADAR Neighbor Matching Localization in Linear Logarithmic Strength Varying Wi-Fi Environment

Science.gov (United States)

Tian, Zengshan; Xu, Kunjie; Yu, Xiang

2014-01-01

This paper studies the statistical errors for the fingerprint-based RADAR neighbor matching localization with the linearly calibrated reference points (RPs) in logarithmic received signal strength (RSS) varying Wi-Fi environment. To the best of our knowledge, little comprehensive analysis work has appeared on the error performance of neighbor matching localization with respect to the deployment of RPs. However, in order to achieve the efficient and reliable location-based services (LBSs) as well as the ubiquitous context-awareness in Wi-Fi environment, much attention has to be paid to the highly accurate and cost-efficient localization systems. To this end, the statistical errors by the widely used neighbor matching localization are significantly discussed in this paper to examine the inherent mathematical relations between the localization errors and the locations of RPs by using a basic linear logarithmic strength varying model. Furthermore, based on the mathematical demonstrations and some testing results, the closed-form solutions to the statistical errors by RADAR neighbor matching localization can be an effective tool to explore alternative deployment of fingerprint-based neighbor matching localization systems in the future. PMID:24683349

An approach to 3D model fusion in GIS systems and its application in a future ECDIS

Science.gov (United States)

Liu, Tao; Zhao, Depeng; Pan, Mingyang

2016-04-01

Three-dimensional (3D) computer graphics technology is widely used in various areas and causes profound changes. As an information carrier, 3D models are becoming increasingly important. The use of 3D models greatly helps to improve the cartographic expression and design. 3D models are more visually efficient, quicker and easier to understand and they can express more detailed geographical information. However, it is hard to efficiently and precisely fuse 3D models in local systems. The purpose of this study is to propose an automatic and precise approach to fuse 3D models in geographic information systems (GIS). It is the basic premise for subsequent uses of 3D models in local systems, such as attribute searching, spatial analysis, and so on. The basic steps of our research are: (1) pose adjustment by principal component analysis (PCA); (2) silhouette extraction by simple mesh silhouette extraction and silhouette merger; (3) size adjustment; (4) position matching. Finally, we implement the above methods in our system Automotive Intelligent Chart (AIC) 3D Electronic Chart Display and Information Systems (ECDIS). The fusion approach we propose is a common method and each calculation step is carefully designed. This approach solves the problem of cross-platform model fusion. 3D models can be from any source. They may be stored in the local cache or retrieved from Internet, or may be manually created by different tools or automatically generated by different programs. The system can be any kind of 3D GIS system.

Geographic Trends in the Plastic Surgery Match.

Science.gov (United States)

Silvestre, Jason; Lin, Ines C; Serletti, Joseph M; Chang, Benjamin

2016-01-01

The integrated plastic surgery match is among the most competitive residency matches in recent years. Although previous studies have correlated applicant characteristics with successful match outcomes, none have comprehensively investigated the role of geography in the match. This study elucidates regional biases in the match. Plastic surgery residents who matched during 2011-2015 were eligible for study inclusion. Names of residents were obtained from official residency program websites and cross-referenced with data obtained from the Student Doctor Network. For each resident, region of residency program and medical school were compared. From 67 programs, 622 residents were identified. Most graduated from US medical schools (97.9%). A total of 94 residents matched at a home institution (15.1%). Half of the residents matched in the same region as their medical school (48.9%). Programs in the South matched the greatest number of residents from the same region (60.8%), whereas West programs matched the least (30.8%, p < 0.001). No regional differences existed regarding residents matching at their home institution (p = 0.268). More women matched at West programs (43.1%) versus East programs (30.6%, p < 0.05). A significant number of residents matched at their home institution. Roughly, half matched at a program in the same region as their medical school. Whether this regional phenomenon stems from applicant or program factors remains unknown. Yet, given the limited number of interviews and the high costs of interviewing, applicants and programs can use these data to help optimize the match process. Copyright © 2015 Association of Program Directors in Surgery. Published by Elsevier Inc. All rights reserved.

Smoothing technology of gamma-ray spectrometry data based on matched filtering

International Nuclear Information System (INIS)

Gu Min; Ge Liangquan

2009-01-01

Traditional method of smoothness of gamma-ray spectrometry data gives rise to aberration of spectra curves easily. The article improve convolution sliding transformation using idea of matched filtering. Gauss adding the exponential function instead of Gauss function is used as converting function. The improved method not only suppresses statistical fluctuation mostly but also keeps feature of spectra curves. Instance verified superiority of this new method. (authors)

Integral staggered point-matching method for millimeter-wave reflective diffraction gratings on electron cyclotron heating systems

International Nuclear Information System (INIS)

Xia, Donghui; Huang, Mei; Wang, Zhijiang; Zhang, Feng; Zhuang, Ge

2016-01-01

Highlights: • The integral staggered point-matching method for design of polarizers on the ECH systems is presented. • The availability of the integral staggered point-matching method is checked by numerical calculations. • Two polarizers are designed with the integral staggered point-matching method and the experimental results are given. - Abstract: The reflective diffraction gratings are widely used in the high power electron cyclotron heating systems for polarization strategy. This paper presents a method which we call “the integral staggered point-matching method” for design of reflective diffraction gratings. This method is based on the integral point-matching method. However, it effectively removes the convergence problems and tedious calculations of the integral point-matching method, making it easier to be used for a beginner. A code is developed based on this method. The calculation results of the integral staggered point-matching method are compared with the integral point-matching method, the coordinate transformation method and the low power measurement results. It indicates that the integral staggered point-matching method can be used as an optional method for the design of reflective diffraction gratings in electron cyclotron heating systems.

Integral staggered point-matching method for millimeter-wave reflective diffraction gratings on electron cyclotron heating systems

Energy Technology Data Exchange (ETDEWEB)

Xia, Donghui [State Key Laboratory of Advanced Electromagnetic Engineering and Technology, Huazhong University of Science and Technology, 430074 Wuhan (China); Huang, Mei [Southwestern Institute of Physics, 610041 Chengdu (China); Wang, Zhijiang, E-mail: wangzj@hust.edu.cn [State Key Laboratory of Advanced Electromagnetic Engineering and Technology, Huazhong University of Science and Technology, 430074 Wuhan (China); Zhang, Feng [Southwestern Institute of Physics, 610041 Chengdu (China); Zhuang, Ge [State Key Laboratory of Advanced Electromagnetic Engineering and Technology, Huazhong University of Science and Technology, 430074 Wuhan (China)

2016-10-15

Highlights: • The integral staggered point-matching method for design of polarizers on the ECH systems is presented. • The availability of the integral staggered point-matching method is checked by numerical calculations. • Two polarizers are designed with the integral staggered point-matching method and the experimental results are given. - Abstract: The reflective diffraction gratings are widely used in the high power electron cyclotron heating systems for polarization strategy. This paper presents a method which we call “the integral staggered point-matching method” for design of reflective diffraction gratings. This method is based on the integral point-matching method. However, it effectively removes the convergence problems and tedious calculations of the integral point-matching method, making it easier to be used for a beginner. A code is developed based on this method. The calculation results of the integral staggered point-matching method are compared with the integral point-matching method, the coordinate transformation method and the low power measurement results. It indicates that the integral staggered point-matching method can be used as an optional method for the design of reflective diffraction gratings in electron cyclotron heating systems.

Optical asymmetric cryptography based on amplitude reconstruction of elliptically polarized light

Science.gov (United States)

Cai, Jianjun; Shen, Xueju; Lei, Ming

2017-11-01

We propose a novel optical asymmetric image encryption method based on amplitude reconstruction of elliptically polarized light, which is free from silhouette problem. The original image is analytically separated into two phase-only masks firstly, and then the two masks are encoded into amplitudes of the orthogonal polarization components of an elliptically polarized light. Finally, the elliptically polarized light propagates through a linear polarizer, and the output intensity distribution is recorded by a CCD camera to obtain the ciphertext. The whole encryption procedure could be implemented by using commonly used optical elements, and it combines diffusion process and confusion process. As a result, the proposed method achieves high robustness against iterative-algorithm-based attacks. Simulation results are presented to prove the validity of the proposed cryptography.

Ontology Matching Across Domains

Science.gov (United States)

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

Equation level matching: An extension of the method of matched asymptotic expansion for problems of wave propagation

Science.gov (United States)

Faria, Luiz; Rosales, Rodolfo

2017-11-01

We introduce an alternative to the method of matched asymptotic expansions. In the ``traditional'' implementation, approximate solutions, valid in different (but overlapping) regions are matched by using ``intermediate'' variables. Here we propose to match at the level of the equations involved, via a ``uniform expansion'' whose equations enfold those of the approximations to be matched. This has the advantage that one does not need to explicitly solve the asymptotic equations to do the matching, which can be quite impossible for some problems. In addition, it allows matching to proceed in certain wave situations where the traditional approach fails because the time behaviors differ (e.g., one of the expansions does not include dissipation). On the other hand, this approach does not provide the fairly explicit approximations resulting from standard matching. In fact, this is not even its aim, which to produce the ``simplest'' set of equations that capture the behavior. Ruben Rosales work was partially supported by NSF Grants DMS-1614043 and DMS-1719637.

Selective suppression of high-order harmonics within phase-matched spectral regions.

Science.gov (United States)

Lerner, Gavriel; Diskin, Tzvi; Neufeld, Ofer; Kfir, Ofer; Cohen, Oren

2017-04-01

Phase matching in high-harmonic generation leads to enhancement of multiple harmonics. It is sometimes desired to control the spectral structure within the phase-matched spectral region. We propose a scheme for selective suppression of high-order harmonics within the phase-matched spectral region while weakly influencing the other harmonics. The method is based on addition of phase-mismatched segments within a phase-matched medium. We demonstrate the method numerically in two examples. First, we show that one phase-mismatched segment can significantly suppress harmonic orders 9, 15, and 21. Second, we show that two phase-mismatched segments can efficiently suppress circularly polarized harmonics with one helicity over the other when driven by a bi-circular field. The new method may be useful for various applications, including the generation of highly helical bright attosecond pulses.

Mode-matching strategies in slowly varying engine ducts

NARCIS (Netherlands)

Ovenden, N.C.; Rienstra, S.W.

2004-01-01

A matching method is proposed to connect the computational fluid dynamics (CFD) source region to the computational aeroacoustics propagation region of rotor–stator interaction sound produced in a turbofan engine. The method is based on a modal decomposition across three neighbouring axial interfaces

Reducing the likelihood of long tennis matches.

Science.gov (United States)