374 research outputs found

    The AAP gene family for amino acid permeases contributes to development of the cyst nematode Heterodera schachtii in roots of Arabidopsis

    Get PDF
    The beet cyst nematode Heterodera schachtii is able to infect Arabidopsis plants and induce feeding sites in the root. These syncytia are the only source of nutrients for the nematodes throughout their life and are a nutrient sink for the host plant. We have studied here the role of amino acid transporters for nematode development. Arabidopsis contains a large number of different amino acid transporters in several gene families but those of the AAP family were found to be especially expressed in syncytia. Arabidopsis contains 8 AAP genes and they were all strongly expressed in syncytia with the exception of AAP5 and AAP7, which were slightly downregulated. We used promoter::GUS lines and in situ RT-PCR to confirm the expression of several AAP genes and LHT1, a lysine- and histidine-specific amino acid transporter, in syncytia. The strong expression of AAP genes in syncytia indicated that these transporters are important for the transport of amino acids into syncytia and we used T-DNA mutants for several AAP genes to test for their influence on nematode development. We found that mutants of AAP1, AAP2, and AAP8 significantly reduced the number of female nematodes developing on these plants. Our study showed that amino acid transport into syncytia is important for the development of the nematodes

    Descriptive Epidemiology of Hemophilia and Other Coagulation Disorders in Mansoura, Egypt: Retrospective Analysis.

    Get PDF
    Hemophilia represent the most severe inherited bleeding disorder (INB), it’s thought to affect inviduals from all geographical areas in equal frequency. In Egypt which has a population of approximately (80million) consanguineous marriage are frequent, therefore autosomal recessive coagulation disorders reach a higher prevalence than in many other countries

    IMPROVING CAMERA POSE ESTIMATION USING SWARM PARTICLE ALGORITHMS

    Get PDF
    Most computer vision and photogrammetry applications rely on accurately estimating the camera pose, such as visual navigation, motion tracking, stereo photogrammetry, and structure from motion. The Essential matrix is a well-known model in computer vision that provides information about the relative orientation between two images, including the rotation and translation, for calibrated cameras with a known camera matrix. To estimate the Essential matrix, the camera calibration matrices, which include focal length and principal point location must be known, and the estimation process typically requires at least five matching points and the use of robust algorithms, such as RANSAC to fit a model to the data as a robust estimator. From the usually large number of matched points, choosing five points, the Essential matrix can be determined based on a simple solution, which could be good or bad. Obtaining a globally optimal and accurate camera pose estimation, however, requires additional steps, such as using evolutionary algorithms (EA) or swarm algorithms (SA), to prevent getting trapped in local optima by searching for solutions within a potentially huge solution space.This paper aims to introduce an improved method for estimating the Essential matrix using swarm particle algorithms that are known to efficiently solve complex problems. Various optimization techniques, including EAs and SAs, such as Particle Swarm Optimization (PSO), Gray Wolf Optimization (GWO), Improved Gray Wolf Optimization (IGWO), Genetic Algorithm (GA), Salp Swarm Algorithm (SSA) and Whale Optimization Algorithm (WOA), are explored to obtain the global minimum of the reprojection error for the five-point Essential matrix estimation based on using symmetric geometric error cost function. The experimental results on a dataset with known camera orientation demonstrate that the IGWO method has achieved the best score compared to other techniques and significantly speeds up the camera pose estimation for larger number of point pairs in contrast to traditional methods that use the collinearity equations in an iterative adjustment.</p

    FEATURE MATCHING ENHANCEMENT USING THE GRAPH NEURAL NETWORK (GNN-RANSAC)

    Get PDF
    Improving the performance of feature matching plays a key role in computers vision and photogrammetry applications, such as fast image recognition, Structure from Motion (SFM), aerial triangulation, Visual Simultaneous Localization and Mapping (VSLAM), etc., where the RANSAC algorithm is frequently used for outlier detection; note that RANSAC is the most widely used robust approach in photogrammetry and computer vision for outlier detection. It is known that the outlier ratio used in RANSAC primarily determines the number of trial runs needed, which eventually, determines the computation time. Over time, different methods have been proposed to reject the false-positive correspondences and improve RANSAC, such as GR_RANSAC, SuperGlue, and LPRANSAC. The specific objective of this study is to propose a filtering algorithm based on Graph Neural Networks (GNN), as a pre-processing step before RANSAC, which can result in improvements for rejecting the outliers. The research is based on the idea that descriptors of corresponding points, as well as their spatial relationship, should be similar in image sequences. In graph representation, built by the adjacency matrix of data (nodes features), there should be similarity for corresponding points that are close to each other in the image domain. From the many GNNs techniques, Graph Attention Networks (GATs) were selected for this study as they assign different importance to each neighbour’s contribution as anisotropic operations, so the features of neighbour nodes are not considered in the same way, unlike other GNNs techniques. In our approach, we build a graph in each image, because the similarity of the two-dimensional spatial relationships between points in the image domain of consecutive images should be similar. Then during processing, points with any significantly different neighbours are considered as outliers. Next, the points can be updated in the GNN layer. GNN-RANSAC is tested experimentally on real image pairs. Clearly, the proposed pre-filtering increases the inlier ratio and results in faster convergence compared to ordinary RANSAC, making it attractive for real-time applications. Furthermore, there is no need to learn the features
    corecore